Entity

Time filter

Source Type


Zhao Y.,CAS Academy of Mathematics and Systems Science | Li Z.,CAS Academy of Mathematics and Systems Science | Li Z.,Henan University of Economics and Law | Cheng D.,CAS Academy of Mathematics and Systems Science
IEEE Transactions on Automatic Control | Year: 2011

This paper considers the infinite horizon optimal control of logical control networks, including Boolean control networks as a special case. Using the framework of game theory, the optimal control problem is formulated. In the sight of the algebraic form of a logical control network, its cycles can be calculated algebraically. Then the optimal control is revealed over a certain cycle. When the games, using memory μ> 1 (which means the players only consider previous μ steps' action at each step), are considered, the higher order logical control network is introduced and its algebraic form is also presented, which corresponds to a conventional logical control network (i.e., μ = 1). Then it is proved that the optimization technique developed for conventional logical control networks is also applicable to this μ-memory case. © 2010 IEEE.


Wang J.,Henan University of Economics and Law
International Review on Computers and Software | Year: 2012

With the development of the cloud computing technology, more and more companies are willing to apply this technology. When our private data are out-sourced in cloud computing, we should guarantee the confidentiality and searchability of the sensitive data. However, nowadays privacy preserving issues in the cloud have not been carefully explored at current stage. To relieve individuals' concerns of their data privacy, this paper explores an effective algorithm based on privacy protocol and min-attribute generalization to avoid the disclosure of private information in the cloud environment. This paper also provides security analysis and experimental evaluation for the proposed algorithm. © 2012 Praise Worthy Prize S.r.l.


Guo Q.,Henan University of Economics and Law
Advances in Information Sciences and Service Sciences | Year: 2012

This paper would study the DSR routing technology based on multiple description coding and communication distance between nodes in vehicle ad hoc network. This routing technology based on routing protocol DSR, aims to cope with the characteristics of dynamic network topology, high-speed motion of vehicle, unpredictable direction and speed of vehicle in vehicle ad hoc network. This technology improves the discovery and reply process of DSR route through multiple description coding technology and residual energy of nodes. The vehicle nodes measure the one-hop communication distance between nodes according to the attenuation degree of signals and the original node chooses the main path according to RREP messages. Sending and receiving routing message through multiple-description technology would reduce the overhead of routing request.Simulation experiment analysis indicates that the improved DSR routing technology has the better performance in terms of end-to-end delay, packet delivery ratio and routing request overhead.


Zhou X.,Henan University of Economics and Law
Advances in Information Sciences and Service Sciences | Year: 2012

Among the application of gradient algorithm, the selection of the step length is the key of the blind signal separation. Therefore, in order to solve the relationship between the convergence speed and the stability problem of the natural gradient blind source separation algorithm, a kind of adaptive variable step length natural gradient algorithm was researched in this paper. A suitable step length adaptive natural gradient separation algorithm for the ECG signal blind source separation was found, which makes the next iteration of the step length optimal, and the objective function is the smallest. Through the blind source separation result of the mixed maternal ECG signal shown that the adaptive variable step length natural gradient algorithm can achieve fetal ECG signal separation effectively, and the frequency spectrum testing error is less than 0.5%.


XiaoXue L.,Henan University of Economics and Law
International Journal of Advancements in Computing Technology | Year: 2011

Peer-to-peer (P2P) networking is more and more widely used in many fields, such as exchange, contribute, or obtain files from any users of the internet. It's also a convenient environment for worms, viruses to find an easy way to attack other users from network. Therefore, a domain pool trust model for P2P networks is presented in this paper to represent the trust model among peers because they may from different domain pools. In this model, every peer belongs to a domain pool, which is marked by different hierarchy and category. The trust reputation value is based on which domain pool they belong to. What's more, a domain feedback algorithm is designed to filter selfish and fake peers. Finally, after simulation experiment in Query Cycle Simulator, it shows the domain pool trust model can get available peers effectively and against fake ones.

Discover hidden collaborations