基于混沌查找表的单向Hash函数构造算法

提出一种基于混沌查找表的单向Hash函数构造算法。该算法通过控制符更新的混沌查找表将明文信息映射为查找表中的数据,置换出相应的信息后按照一定的规则提取长度为128 bit的Hash值。理论分析和仿真结果证明,该算法具有较好的单向性、混乱与扩散性以及抗碰撞性,满足单向Hash函数的各项性能要求。     

基于单链表和散列表比较的词频统计研究

针对操作系统课程中的词频统计实验,介绍两种分别采用单链表和散列表进行词频统计的方法,并着重说明后一种方法在效率方面的优越性。     

Energy optimal spacecraft attitude control subject to convergence rate constraints

Attitude control of operational satellites is still predominantly performed by standard controllers such as Proportional plus Derivative (PD) control laws, which are still preferred for implementation to the computationally intensive nonlinear optimal control techniques, representing higher implementation complexity. In this paper, an inverse optimal control approach based on phase space geometry is presented, which is easy to implement and free from numerical and computational issues. The optimal control objective is to minimize a norm of the control torque subject to a rapidity constraint on the convergence rate of a Lyapunov function, under the effect of a benchmark controller. The proposed optimization method is shown to significantly enhance the torque-rapidity trade-off compared to the benchmark controller, chosen to be a PD law then a sliding mode controller. The inverse optimal control scheme is implemented on an air bearing table experimental platform.     

ZigBee中改进的Cluster-Tree路由算法

针对ZigBee网络的Cluster-Tree算法对簇首能量要求高、选择的路由非最佳路由等问题,结合节点能量分析和节点邻居表,提出一种改进的簇首生成方法,利用AODVjr算法为节点选择最佳路由。仿真结果证明,与原Cluster-Tree算法相比,改进的算法能有效提高数据发送成功率,减少源节点与目标节点间的跳数,降低端到端的报文传输时延,提高网络的使用价值。     

WSN中基于分簇的实时传输算法

采用跨层技术,提出一种无线传感器网络(WSN)中基于分簇的实时传输算法。在WSN中找出簇头到基站的多条优化路径,采用基于平均队列长度的拥塞控制方法,在这些路径中找出一条耗能最小且实时性最优的路径,并沿着该路径将数据传送到基站。仿真分析表明,该算法能满足网络的实时性需求,并能有效进行拥塞控制。     

Peer-exchange schemes to handle mismatch in peer-to-peer systems

A self-organizing peer-to-peer system is built upon an application level overlay, whose topology is independent of an underlying physical network. A well-routed message path in such systems may result in a long delay and excessive traffic due to the mismatch between logical and physical networks. In order to solve this problem, we present a family of Peer-exchange Routing Optimization Protocols (PROP) to reconstruct the overlay. It includes two policies: PROP-G for generic condition and PROP-O for optimized one. Both theoretical analysis and simulation experiments show that these two protocols greatly reduce the average latency of the overlay and achieve a better logical topology with low overhead. Their overall performance can be further improved if combined with other recent approaches. Specifically, PROP-G can be easily applied to both structured and unstructured systems without the loss of their primary characteristics, such as efficient routing and anonymity. PROP-O, on the other hand, is more efficient, especially in a heterogenous environment where nodes have different processing capabilities.

HTML表格向XML的智能转换

XML已经成为处理与管理信息的标准格式,而HTML表格被广泛应用于Web。为了充分利用与管理HTML表格信息,需要将HTML表格转换成XML。提出一种有效的处理方法,该方法包含2个部分,即表格识别与结构转换。表格识别通过检查格式、语法及语义的特征将表格提取出来并分割成值域与属性域,使用预设的表格模板分析属性域与值域间的层次结构并将其转换成XML格式。通过 300多个表格的实验表明,所提出的方法要优于传统方法,结果的准确率达86.7%。     

某型飞机振动传感器试验器的研制

为测试某型飞机振动传感器性能,采用背靠背比较法振动测试方法,基于苏试振动台(VT-500)、功率放大器(LA-800)、单轴向电荷输出型加速度标准传感器(Ymc222A25)、电荷放大器(Ymc8102T)、普源信号发生器(DG1032Z)以及研华PCI工控机与A/D板卡(PCI-1716L),搭建振动传感器试验器振动测试平台,以DG1032Z输出作为振动激励信号源,基于VC ++6.0开发出信号发生器远程控制与板卡信号采集软件,对试验器的功能进行试验验证,结果表明其有效性.所研制的试验器可实现振动信号源的产生与标准/被测信号的校准,从而为某型飞机振动传感器的测试与修理提供技术支撑.     

基于Android手机应用的在线课程表查询

讲述Android手机应用开发实例.手机用户可通过查询,了解学校安排的课程信息,为师生提供了方便.     

Restricted compositions and permutations: From old to new Gray codes

Any Gray code for a set of combinatorial objects defines a total order relation on this set: x is less than y if and only if y occurs after x in the Gray code list. Let ? denote the order relation induced by the classical Gray code for the product set (the natural extension of the Binary Reflected Gray Code to k-ary tuples). The restriction of ? to the set of compositions and bounded compositions gives known Gray codes for those sets. Here we show that ? restricted to the set of bounded compositions of an interval yields still a Gray code. An n-composition of an interval is an n-tuple of integers whose sum lies between two integers; and the set of bounded n-compositions of an interval simultaneously generalizes product set and compositions of an integer, and so ? put under a single roof all these Gray codes.As a byproduct we obtain Gray codes for permutations with a number of inversions lying between two integers, and with even/odd number of inversions or cycles. Such particular classes of permutations are used to solve some computational difficult problems.