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.
Cognitive Radio requires improving spectrum utilization, and focusing on complexity of the sub carrier power allocation algorithm in OFDM system, A power allocation method which plots the entire channel into lots sub carriers segments is proposed. It gets the maximum communication throughput by auto-adapted modulation. After improved the method, the system performance is also improved. The result...
We propose DIRA as an overlay multicast routing algorithm to support QoS-aware multicast applications. Its basic idea is to construct overlay multicast trees within Diffserv domains and try to find an overlay tree spanning all member nodes at a cost as low as possible. The proposed algorithm exploits the special relationship between the edge routers and the core routers in the Diffserv domain to adapt...
In the process of decision tree construction, property division standards directly affect the classification results. Aimed at weakness of ID3 in nicety of grading, we provide the concept of degree of rough classification as select criteria of separation of property. The method took into account nicety of grading and dependency between condition attributes and decision attributes. Compared with traditional...
This paper deals with a hybrid optimization method for solving the optimization problems with inequality constraints and equality constraints, in which an adaptive penalty strategy is firstly adopted to convert the optimization problem with both equality constraints and inequality constraints to one only with lower and upper bound constraint of decision variables, then an adaptive real-coded genetic...
Inspired from social swarm intelligence, a cooperative boundaries tracking model with a mobile sensor network based on social foraging swarm behavior. In the model, the nodes of mobile sensor network are viewed as simple intelligent individuals of social swarm. The cooperative moving of the individuals is driven by sensed distribution environment. For boundaries tracking problems with mobile sensor...
This paper describes a multi-seeds mesh growing and flat portions first growing algorithm that takes as input an unorganized set of points on an unknown manifold, and produces as output an approximate surface. A priority driven strategy for mesh growing is then used to sweep the advance front ahead in an effective way. The method makes no assumption regarding the points, and the main contributions...
We describe a new scalar multiplication method for hyperelliptic curve cryptosystems. The method is obtained by the decomposition of the divisor into the simple divisors. The comparison results show that our method is much more efficient than Frobenius method and Double-and-Add method for some special hyperelliptic curves.
Transmission security of media data in video conference system has been a challenging task, since those data are high volume and latency sensitive. Partial encryption and other media encryption schemes are effective approaches to encrypt those data. However, a partial disclosure of media data can leak the secret about the conference, moreover when wireless terminals joint in those systems, the limited...
In this paper, a modified Pareto differential evolution algorithm approach is introduced to solve multi-objective optimization problems. The modified approach including: improving the crowding mechanism by introducing the Niche theory, introducing a time variant scaling factor F, and using a simple but efficient mutation operator which combines information of the both better and worse solution in...
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.