Potentials of IR-UWB technology for ubiquitous computing

Connectivity is very important to enable ubiquitous computing. Wireless communication plays a continual key role in future ubiquitous network where all devices need to be connected freely. Ultra-wideband (UWB) radio is a new method of short-range wireless technology which is suit for ubiquitous computing. In this paper, we provided the potentials of impulse radio UWB (IR-UWB) technology in ubiquitous computing environments. Our study investigated possible communication methods which can be used in ubiquitous network. Comparisons between different communication technologies demonstrated that UWB-based solutions can support identification, location, sensing, and connectivity. In addition, we proposed two typical schemes which show how IR-UWB is used in ubiquitous computing.     

基于行扫描的炮弹引信铆点特征提取

在炮弹引信铆点机器视觉识别中,有效消除图像中各种干扰、正确提取铆点特征是关键,解决好铆点特征的准确提取问题,是炮弹引信安全破除铆点的前提条件;根据铆点的结构特点,分析了产生各种干扰的原因及特点,在高斯滤波,阀值分割、形态学运算等基本运算的基础上,提出了一种基于行扫描的铆点特征提取方法;测试结果表明,提出的方法可行,铆点正确识别率达到90%以上,具有高效性和很好的鲁棒性的铆点特征提取,使得炮弹铆点的准确破除成为可能.     

不常用备件基于AHP的ABC分类模型

分析了传统ABC分类法在不常用备件库存分类中的应用,针对传统ABC分类法的缺陷.文章应用基于AHP的ABC分类方法,将备件单价、采购提前期、年采购费用、年使用次数、备件类型、重要性等级作为分类准则,对每一备件相对准则层进行ABC分类,然后结合准则层对目标层的权重计算备件组合权重并再次进行ABC分类,建立了不常用备件基于...     

应用型院校操作系统课程实验教学设计

办学类型不同、培养目标不同、需求不同,课程的教学和实验的内容和形式就应该不同.该文分析了应用型院校操作系统课程的实验教学方式设计,实验内容定位,论述了实验项目实施的内容和方法,并对实施效果进行了评估.     

一种扭曲指纹图像的细节点修正方法

非线性形变在指纹图像中非常普遍,严重时会导致指纹识别系统的识别性能显著降低,是指纹图像识别领域重要的研究课题之一.尤其对基于细节点的指纹匹配方法而言,由于相当一部分细节点的位置和方向都在非线性形变的作用下发生了改变,从而导致算法匹配准确率下降.在对非线性形变图像反复观察和实验的基础上,发现了细节点偏离的一些有用的规律,并用于细节点的位置和方向调整.提出了一种基于多参考细节点对齐修正指纹图像中部分细节点的方法,首先获取一组匹配细节点对作为基准点对,然后再以此为基础对邻域其他细节点进行修正,在FVC2004 DB2数据集上进行了一系列实验,实验结果表明该算法能够明显改善匹配性能.     

基于三角剖分和纹理映射的物体表面重建算法

提出一种简便的物体表面重建算法,该算法用立体匹配获得的物体表面三维特征点和原匹配图像来重建物体的真实表面,主要步骤是:将物体表面三维特征点集映射到某个平面上,在此平面上完成三角剖分,将剖分的结果映射回物体表面,用空间三角片来表示物体的几何模型,最后在OpenGL环境下将物体原匹配图像贴到几何模型上,这样就真实地重建了物体表面.最后给出了重建物体真实表面的所需条件.     

一种无线传感器网络实际环境测试系统

为实现无线传感器网络(WSNs)在实际环境下的综合性能测试,提出了一种无线传感器网络测试系统。系统采用全实物布置策略,以基于Linux操作系统的测试床为核心;支持多个节点和异构节点的通用测试,能够满足大规模、通用性和可扩展性需求;功能丰富,支持对节点的在线编程、电源控制以及状态监测。     

802.11g保护机制对网络性能影响的仿真与分析

在探讨IEEE802.11g保护机制工作模式的基础上,构建OPNET仿真网络以测试保护机制对WEAN网络性能的影响.实验结果表明,保护机制的引入可显著地降低WLAN网络吞吐率.纯802.11g模式下,网络平均吞吐率最大可达23.95 Mb/s;启用CTS-to-self保护机制的802.11b/g混合模式下,网络平均吞吐率仅为11.45 Mb/s,约为前者的50%;启用RTS/CTS保护机制时,网络平均吞吐率只有7 Mb/s,减少到前者的30%,且此时单个802.11g站点仅获得约7.5 Mb/s的TCP传输速率.为更好地规划和部署802.11无线网络提供了较准确的数据分析依据.     

Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time

Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free XML storage structures with as few scheme trees as possible. Redundancy-free XML structures guarantee both economy in storage space and the absence of update anomalies, and having the least number of scheme trees requires the fewest number of joins to navigate among the data elements. We know that the general problem is intractable. The problem may still be intractable even when the hypergraph is acyclic and each hyperedge is in Boyce–Codd normal form (BCNF). As we show here, however, given an acyclic hypergraph with each hyperedge in BCNF, a polynomial-time algorithm exists that generates a largest possible redundancy-free XML storage structure. Successively generating largest possible scheme trees from among hyperedges not already included in generated scheme trees constitutes a reasonable heuristic for finding the fewest possible scheme trees. For many practical cases, this heuristic finds the set of redundancy-free XML storage structures with the fewest number of scheme trees. In addition to a correctness proof and a complexity analysis showing that the algorithm is polynomial, we also give experimental results over randomly generated but appropriately constrained hypergraphs showing empirically that the algorithm is indeed polynomial.     

Analytical modelling of networks in multicomputer systems under bursty and batch arrival traffic

The hypercube and torus are two important message-passing network architectures of high-performance multicomputers. Analytical models of multicomputer networks under the non-bursty Poisson traffic have been widely reported. Motivated by the convincing evidence of bursty and batch arrival nature of traffic generated by many real-world parallel applications in high-performance computing environments, we develop a new and concise analytical model in this paper for hypercube and torus networks in the presence of batch message arrivals modelled by the compound Poisson process with geometrically distributed batch sizes. The average degree of virtual channel multiplexing is derived by employing a Markov chain which can capture the batch arrival nature. An attractive advantage of the model is its constant computation complexity independent of the network size. The accuracy of the analytical performance results is validated against those obtained from simulation experiments of an actual system.