Provable secure identity based generalized signcryption scheme

According to actual needs, a generalized signcryption scheme can flexibly work as an encryption scheme, a signature scheme or a signcryption scheme. In this paper, firstly, we give a security model for identity based generalized signcryption which is more complete than the existing model. Secondly, we propose an identity based generalized signcryption scheme. Thirdly, we give the security proof of the new scheme in this complete model. Compared with existing identity based generalized signcryption, the new scheme has less implementation complexity. Moreover, the new scheme has comparable computation complexity with the existing normal signcryption schemes.     

Hard multidimensional multiple choice knapsack problems, an empirical study

Recent advances in algorithms for the multidimensional multiple choice knapsack problems have enabled us to solve rather large problem instances. However, these algorithms are evaluated with very limited benchmark instances. In this study, we propose new methods to systematically generate comprehensive benchmark instances. Some instances with special correlation properties between parameters are found to be several orders of magnitude harder than those currently used for benchmarking the algorithms. Experiments on an existing exact algorithm and two generic solvers show that instances whose weights are uncorrelated with the profits are easier compared with weakly or strongly correlated cases. Instances with classes containing similar set of profits for items and with weights strongly correlated to the profits are the hardest among all instance groups investigated. These hard instances deserve further study and understanding their properties may shed light to better algorithms.     

Building a database for product design knowledge retrieval—A case study in robotic design database

In product design process, when dealing with technical problems or initiating a new design, R&D personnel would often turn to technical database to seek inspiration. The building of a database with such documents has not been systematically dealt with. In this paper, several issues on how to build up a product design database are investigated: input source, sampling scheme and quality control. A case study of building a database for robotic design is used to demonstrate the concept. It is an archive of more than 1500 relevant technical papers. A total of 16 graduates are employed as operators in the labeling process and subsequently the hypothesis tests are utilized to process the labeling results. To ensure this database quality, the labeling consistency of each operator and the understanding of each category are tested. With the use of statistical methods, this work proposes a feasible and practical way to create such a database for product design.     

Global exponential robust stability of reaction–diffusion interval neural networks with continuously distributed delays

This paper considers the existence of the equilibrium point and its global exponential robust stability for reaction-diffusion interval neural networks with variable coefficients and distributed delays by means of the topological degree theory and Lyapunov-functional method. The sufficient conditions on global exponential robust stability established in this paper are easily verifiable. An example is presented to demonstrate the effectiveness and efficiency of our results.     

Intelligent integrated data processing model for oceanic warning system

There are a number of dirty data in observation data set derived from ocean observing network. These data should be carefully and reasonably processed before they are used for forecasting or analysis in oceanic warning system (OWS). Due to high-dimensional and dynamic oceanic data, we propose an intelligent integrated data processing model for the OWS. Firstly, we design an integrated framework of the oceanic data processing and present its processing model. The function of each module of this model is analyzed in details. Then, we propose several intelligent data processing methods, such as an intelligent data cleaning method based on the fuzzy c-means algorithm, a data filtering and clustering method based on the greedy clustering algorithm, and a data processing method based on the maximum entropy for the OWS. The efficiency and accuracy of the proposed model is proved by experimental results of observation data of the Red Tide. The proposed model can automatically find the new clustering center with the updated sample data, and outperforms several algorithms in data processing for the OWS.     

基于GPRS的远程监控系统中监控中心网络数据通信实现

基于GPRS的远程监控系统中,监控中心实现与前端采集系统的网络数据传输是整个系统的重要的组成部分。本文提出了采用套接字（socket）,基于TCP/IP协议实现远程数据收发的办法。简要介绍了基于GPRS的远程监控系统的组成功能,详细论述了基于套接字的编程技术,给出了基于Win32控制台的部分源码。     

远程VPN接入技术的选择浅析

VPN技术种类繁多,但是不同的用户有不同的需求,本文依据当前文献中出现的不同VPN技术,在分析了它们各自的技术特点后,提出了一种远程用户接入本地网络时的VPN方案的选择方法。     

Exponential stability and exponential stabilization of singularly perturbed stochastic systems with time‐varying delay

In this paper, the problems of exponential stability and exponential stabilization for linear singularly perturbed stochastic systems with time‐varying delay are investigated. First, an appropriate Lyapunov functional is introduced to establish an improved delay‐dependent stability criterion. By applying free‐weighting matrix technique and by equivalently eliminating time‐varying delay through the idea of convex combination, a less conservative sufficient condition for exponential stability in mean square is obtained in terms of ε‐dependent linear matrix inequalities (LMIs). It is shown that if this set of LMIs for ε=0 are feasible then the system is exponentially stable in mean square for sufficiently small ε?0. Furthermore, it is shown that if a certain matrix variable in this set of LMIs is chosen to be a special form and the resulting LMIs are feasible for ε=0, then the system is ε‐uniformly exponentially stable for all sufficiently small ε?0. Based on the stability criteria, an ε‐independent state‐feedback controller that stabilizes the system for sufficiently small ε?0 is derived. Finally, numerical examples are presented, which show our results are effective and useful. Copyright © 2010 John Wiley & Sons, Ltd.     

量子密码在无线局域网中的安全研究

本文通过对量子密码BB84协议及IEEE802.11i认证协议的分析与讨论,深入研究了802.11i密钥管理机制中的4次握手,利用量子密码安全的优势与IEEE802.11i无线网络相结合,提出量子握手,为无线网络中数据的通信安全提供保障。     

Modeling Massive RFID Data Sets: A Gateway-Based Movement Graph Approach

Massive Radio Frequency Identification (RFID) data sets are expected to become commonplace in supply chain management systems. Warehousing and mining this data is an essential problem with great potential benefits for inventory management, object tracking, and product procurement processes. Since RFID tags can be used to identify each individual item, enormous amounts of location-tracking data are generated. With such data, object movements can be modeled by movement graphs, where nodes correspond to locations and edges record the history of item transitions between locations. In this study, we develop a movement graph model as a compact representation of RFID data sets. Since spatiotemporal as well as item information can be associated with the objects in such a model, the movement graph can be huge, complex, and multidimensional in nature. We show that such a graph can be better organized around gateway nodes, which serve as bridges connecting different regions of the movement graph. A graph-based object movement cube can be constructed by merging and collapsing nodes and edges according to an application-oriented topological structure. Moreover, we propose an efficient cubing algorithm that performs simultaneous aggregation of both spatiotemporal and item dimensions on a partitioned movement graph, guided by such a topological structure.