一种可视二维条码设计

融合信息隐藏与二维条码编译码技术,提出一种基于图像的可视二维条码设计。对图像进行块误差扩散,得到的半色调图像作为码图,将编码块嵌入置乱后的码图,反置乱使编码块分散在码图中。与以往提出的图像条码相比,该设计注重图像的可视性,可以表达图像信息。实验结果表明,该设计效果较好。     

基于角度方差的多层次高维数据异常检测算法

异常检测一直是数据挖掘领域的重要工作之一。基于欧式距离的异常检测算法在应用于高维数据时存在检测精度无法保证和运行时间过长的问题。在基于角度方差的异常检测算法基础上提出了一种多层次的高维数据异常检测算法（Hybrid outlier detection algorithm based on angle variance for High-dimensional data, HODA）。算法结合了粗糙集理论,分析属性之间的相互作用以排除影响较小的属性;通过分析各维度上的数据分布,对数据进行网格划分,寻找可能存在异常点的网格;最后对可能存在异常点的网格计算角度方差异常因子,筛选异常数据。实验结果表明,与ABOD, FastVOA和经典LOF算法相比,HODA算法在保证精测精度的前提下,运行时间显著缩短且可扩展性强。     

不完备信息系统中对象的相似性刻画

信息系统知识约简与知识发现是粗糙集理论的重要研究方向。通过对不完备信息系统中对象的相似性刻画方式以及相应的粗糙集模型进行对比分析,基于限制容差关系提出了一种新的限制相似关系,建立了基于限制相似关系的粗糙集模型,讨论了模型的基本性质及其与已有模型之间的关系。     

Reliability of data processing and fault compensation in unreliable arithmetic processors

In logical circuits, like arithmetic operations in a processor system, arbitrary faults become a more tremendous aspect in future. Modern manufacturing processes lead to less reliability and higher vulnerability of software execution to soft-errors. The correctness of certain results is important especially for safety–critical applications whose reliability depends on the fault-free execution of each single instruction and the dependencies between them. The more complex a software is the more unreliable the outcome is. But, there is a contrary effect. If the probability for multiple faults increases, there is also the chance that two faults compensate each other and the result is correct again. This paper presents the basic ideas for such a reliability evaluation of a software's data flow with arbitrary soft-errors and the effect of fault compensation. Further, this evaluation provides a possibility to compare different implementations of a data flow with respect to the reliability. This is shown by the comparison of two different error codes as alternatives for coded data processing.     

Communication-efficient and crash-quiescent Omega with unknown membership

The failure detector class Omega (Ω) provides an eventual leader election functionality, i.e., eventually all correct processes permanently trust the same correct process. An algorithm is communication-efficient if the number of links that carry messages forever is bounded by n, being n the number of processes in the system. It has been defined that an algorithm is crash-quiescent if it eventually stops sending messages to crashed processes. In this regard, it has been recently shown the impossibility of implementing Ω crash quiescently without a majority of correct processes. We say that the membership is unknown if each process pi only knows its own identity and the number of processes in the system (that is, i and n), but pi does not know the identity of the rest of processes of the system. There is a type of link (denoted by ADD link) in which a bounded (but unknown) number of consecutive messages can be delayed or lost.In this work we present the first implementation (to our knowledge) of Ω in partially synchronous systems with ADD links and with unknown membership. Furthermore, it is the first implementation of Ω that combines two very interesting properties: communication-efficiency and crash-quiescence when the majority of processes are correct. Finally, we also obtain with the same algorithm a failure detector () such that every correct process eventually and permanently outputs the set of all correct processes.     

Multi-objective K-connected Deployment and Power Assignment in WSNs using a problem-specific constrained evolutionary algorithm based on decomposition

The K-connected Deployment and Power Assignment Problem (DPAP) in WSNs aims at deciding both the sensor locations and transmit power levels, for maximizing the network coverage and lifetime objectives under K-connectivity constraints, in a single run. Recently, it is shown that the Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D) is a strong enough tool for dealing with unconstraint real life problems (such as DPAP), emphasizing the importance of incorporating problem-specific knowledge for increasing its efficiency. In a constrained Multi-objective Optimization Problem (such as K-connected DPAP), the search space is divided into feasible and infeasible regions. Therefore, problem-specific operators are designed for MOEA/D to direct the search into optimal, feasible regions of the space. Namely, a DPAP-specific population initialization that seeds the initial solutions into promising regions, problem-specific genetic operators (i.e. M-tournament selection, adaptive crossover and mutation) for generating good, feasible solutions and a DPAP-specific Repair Heuristic (RH) that transforms an infeasible solution into a feasible one and maintains the MOEA/D’s efficiency simultaneously. Simulation results have shown the importance of each proposed operator and their interrelation, as well as the superiority of the DPAP-specific MOEA/D against the popular constrained NSGA-II in several WSN instances.     

An improved transport layer protocol for wireless sensor networks

Wireless sensor networks (WSNs) are a kind of communication networks having independent sensor nodes that form multi-hop ad hoc network to transfer data. In the past few years, various transport control protocols in wireless sensor networks (WSNs) have been developed and proposed in the literature. In this paper, we have analyzed pump slowly, fetch quickly (PSFQ) protocol and presented an improved transport layer protocol for wireless sensor networks. The improved protocol has been analyzed based on various factors such as average latency and average error tolerance and it is found that the proposed protocol is better than PSFQ in terms of these factors.     

COS和H_2S毒化F-T合成催化剂热力学分析

利用热力学基础数据和相关软件对F-T合成催化剂COS和H_2S中毒的热力学进行了计算。在热力学上,Ru、Fe、Co的COS中毒在F-T合成反应可以发生的条件下均是自发过程。F-T合成反应体系中10~(-9)级的COS即可使Ru基催化剂中的金属Ru生成RuS_2而中毒。Fe和Co毒化后生成的硫化物种类较多,对这些反应的热力学计算结果表明,对于不同的反应,其平衡常数的差异很大,对应中毒反应发生时,所需的COS和H_2S的浓度也不同,对COS的要求更为严格。由于Fe基F-T合成催化剂活性相的复杂性,利用对催化剂相关性质的修饰开发具有一定抗硫性的铁基F-T合成催化剂是可行的;对于Co催化剂,利用F-T合成的反应特点和催化剂改性开发具有一定抗硫性催化剂是可能的。