The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, the WAP supervision is studied with dynamics system method. Firstly, the value-added service is analyzed based on the structure of industry chain. A system dynamic simulation model of WAP industry chain is established, which describes the interaction of the elements in the WAP service. Based on the running results of this model in the VENSIN PLE software, we predict the market prospect...
Utilizing the complexity and good pseudorandom property of the spatiotemporal chaotic system, a novel image encryption algorithm is proposed. The plain-image block data is masked by the values extracted from the spatiotemporal chaotic system. Then the masked data is shuffled according to the maximum state value in the system. A cipher block chaining (CBC) mode is employed to adjust the state value...
Although a variety of hash functions have been proposed, few of them works efficiently in parallel computing environment. An algorithm for parallel hash function construction based on block cipher is proposed. Not only message blocks but also the orders of them are considered in the process of constructing hash values. This hash function can be expected to have the same computational security against...
An algorithm for one-way Hash function construction based on iterating a chaotic map is proposed. The total chaotic space is divided into some subspace based on the density distribution function of the chaotic map. Each subspace is associated with a unique bit in a bit sequence. The value of the chaotic map is dynamically decided by the last-time value and the corresponding message bit in different...
The problem of computing the Bandwidth-Delay Constrained QoS multicast routing for Networks is an NP-hard problem. Classical approaches of multicast routing consider a tree path whose computational cost entails high use of resources such as time and memory. This paper presents a chaotic optimization adaptive genetic algorithm applied to the multicast routing problem, in which no tree is built. The...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.