Broadcast group-oriented encryption secure against chosen ciphertext attack

A novel broadcast encryption scheme for group communication scenarios in distributed networks is presented. In the scheme, anyone is allowed to encrypt a message and distribute it to a designated group. Each member in the designated group has the ability to independently decrypt a ciphertext. In contrast to traditional broadcast encryption, all the valid receivers in the proposed scheme compose the designated group. To take advantage of this property, a tab for the group is set and the matching private key for each member is generated. In addition, before decrypting a ciphertext, anyone in the scheme can verify the ciphertext, to ensure that the ciphertext is correct. This property is very important for large-scale group communication, as the gateway can filter incorrect ciphertext and alleviate the receiver's workload. Finally, a proof in the random oracle model is given, to show that the proposed scheme is secure against the adaptively chosen ciphertext attack.     

A situation calculus based approach to dynamic management of e-business services

In the era of e-businesses, the traditional business services are greatly challenged by the ever-increasing demands from customers with various backgrounds and personalities. Large numbers of new e-businesses are driven by the needs of customers. The existing dynamics inherent in the customer needs require the corresponding dynamic management of services. Attempting to respond to customers in a rapid and intelligent way, this paper proposes a situation calculus based approach for dynamically managing e-Business services in the ubiquitous environment. By employing the formalism of the situation calculus to enable intelligence and automation, the approach can implement. the functions of service automatic composition and model verification. These functions will improve the degree of customer-orientation and enable fast responsiveness in the emerging e-service systems.     

THE λ-GROBNER BASES UNDER POLYNOMIAL COMPOSITION

Polynomial composition is the operation of replacing variables in a polynomial with other polynomials. λ-Grgbner basis is an especial Grobner basis. The main problem in the paper is： when does composition commute with λ-Grobner basis computation？ We shall answer better the above question. This has a natural application in the computation of λ-Grobner bases.     

基于双尺度连续小波变换的二相编码信号识别

针对信号和噪声小波变换的模极大值在不同尺度上表现出截然不同的性质,提出一种利用粗细定位相结合的思想对二相编码信号奇异点实现精确定位的方法。该方法采用大尺度上的模极值点进行粗略定位奇异点出现的范围,并据此去除小尺度上的伪极值点,用小尺度上的模极值点精确定位奇异点出现的时刻。实验仿真比较了几种不同小波基函数下的算法性能,结果表明,该方法在采用db3小波基下对二相编码信号突变点的识别具有很好的效果。     

C4ISR体系结构研究现状与问题

体系结构是组成系统各部件的结构、它们之间的关系以及制约它们设计和随时间演进的原则和指南。C4ISR体系结构已成为国内外军事领域的研究热点以及大型军事信息系统开发的关键技术之一。归纳了C4ISR体系结构研究的重要意义及其主要的研究方向。在介绍了C4ISR系统体系结构定义之后,从三个方面总结了C4ISR体系结构技术的研究进展。最后在分析当前体系结构研究不足的基础上对体系结构的发展趋势进行了总结和展望。     

基于模糊Hough变换的被动传感器系统航迹起始方法

提出一种基于模糊Hough变换(FHT)的被动传感器系统中的航迹起始方法。首先利用逻辑关系或规则初步排除鬼点,以降低计算复杂度,推导出被动传感器系统中的Hough变换形式。考虑到传感器系统误差和测量误差对检测结果的影响,将传感器系统获得的观测值模糊映射到参数空间,利用梯度信息降低计算消耗,求出参数空间的模糊累积矩阵,通过模糊推理确定出最终的航迹检测结果。实验结果表明,所提的模糊Hough变换方法能有效解决杂波环境下的航迹起始问题,且计算消耗小。     

Circular object recognition based on shape parameters

To recognize circular objects rapidly in satellite remote sensing imagery, an approach using their geometry properties is presented. The original image is segmented to be a binary one by one dimension maximum entropy threshold algorithm and the binary image is labeled with an algorithm based on recursion technique. Then, shape parameters of all labeled regions are calculated and those regions with shape parameters satisfying certain conditions are recognized as circular objects. The algorithm is described in detail, and comparison experiments with the randomized Hough transformation (RHT) are also provided. The experimental results on synthetic images and real images show that the proposed method has the merits of fast recognition rate, high recognition efficiency and the ability of anti-noise and anti-jamming. In addition, the method performs well when some circular objects are little deformed and partly misshapen.     

QoS保证的传感器网络拓扑控制算法的设计

传感器网络技术的发展对网络服务质量提出了要求,如何在满足一定的服务质量要求前提下实现能量的优化是传感器网络设计必须面对的问题。现有的相关研究主要集中在如何从路由层和链路层来保证一定的QoS指标,本工作将传感器网络中的QoS支持延伸到拓扑管理层,提出了一种支持一定QoS要求的高效的拓扑控制算法,该算法构造一种具有梯度分布特征的节点拓扑结构以平衡网络数据流在sink节点处的聚集。NS2仿真证明了该结构对QoS支持的可行性。仿真表明,该算法以较少的冗余节点增加可将延时和丢包率分别降低50%和40%,证明了该机制在高速率数据场景下的高效性。还通过NS仿真分析了算法实现中关键参数的选取原则。     

Ad hoc distributed mutual exclusion algorithm based on token-asking

The solution of distributed mutual exclusion is difficult in Ad hoc networks owing to dynamic topologies and mobility. Based on the analysis of the properties of Ad hoc networks and the disadvantages of the traditional algorithms, an improved Ad hoc system model was given and a novel algorithm was presented as AHDME (Ad Hoc Distributed Mutual Exclusion); it was based on the token-asking algorithms. It utilized broadcast to search for the token and to decrease the message complexity of multi-hop Ad hoc networks. Lamport's timestamp was improved to ensure the time sequence and to prevent nodes from starvation. When compared to traditional algorithms, AHDME does not require the fixed size of request queues and the global system information, which adapts itself to the frequent arrival/departures and the limited computing capability of nodes in Ad hoc networks. Performance analysis and simulation results show that the AHDME algorithm has low message complexity, small space complexity, and short response delay.     

Multiple QoS modeling and algorithm in computational grid

Multiple QoS modeling and algorithm in grid system is considered. Grid QoS requirements can be formulated as a utility function for each task as a weighted sum of its each dimensional QoS utility functions. Multiple QoS constraint resource scheduling optimization in computational grid is distributed to two subproblems: optimization of grid user and grid resource provider. Grid QoS scheduling can be achieved by solving sub problems via an iterative algorithm.