Particle swarm optimization (PSO) algorithm is frequently employed to solve various optimization problems, but it easily gets into the local extremum in later evolution period. An improved chaos search strategy is int...
详细信息
Particle swarm optimization (PSO) algorithm is frequently employed to solve various optimization problems, but it easily gets into the local extremum in later evolution period. An improved chaos search strategy is introduced into PSO algorithm. When particles get into the local extremum, they are activated by chaos search strategy, and chaos search area are controlled in the neighborhood of the current optimal solution by reducing search area of variables, which avoids searching blindly. The new algorithm can not only solve local extremum problem effectively but also enhance the precision of convergence. Experiment results show that the proposed method is better than standard PSO algorithm in both precision and stability.
A wireless mesh network (WMN) presents a new wireless network technology for building commercial mobile ad hoc networks. However, security in WMN has not received enough attention in the research community. One main c...
详细信息
A wireless mesh network (WMN) presents a new wireless network technology for building commercial mobile ad hoc networks. However, security in WMN has not received enough attention in the research community. One main challenge in designing WMNs is the vulnerability of such networks to malicious attacks. In this paper, we propose a zone-based distributed key management scheme for WMNs in which we show that the proposed scheme would improve key management in security, expandability, validity, fault tolerance and usability.
Run length encoding can be found in numerous applications such as data transfer or image storing (Sayood, 2002). It is a well known, easy and efficient compression method based on the assumption of long data sequences...
详细信息
ISBN:
(纸本)9780863419317
Run length encoding can be found in numerous applications such as data transfer or image storing (Sayood, 2002). It is a well known, easy and efficient compression method based on the assumption of long data sequences without the change of content. These sequences can be described by their position and length of appearance. Implementations using dedicated logic are optimised for parallel data processing. Here, images are transferred in blocks of multiple pixels in parallel. A compression of these streams into a run length code requires an encoder with a parallel input. This run length encoder has to compress the sequence at a minimum of clock cycles to avoid long inhibit intervals at the input. This paper describes a hardware algorithm performing a high performance run length encoding for binary images using a parallel input.
η-quantum languages are discussed and some of their properties are derived. Furthermore the q-quantum language is defined. It is shown that L(A1A2)=L(A1)∩L(A2), L(A)=L(A1)∪L(A2). So over the same alphabet the int...
详细信息
η-quantum languages are discussed and some of their properties are derived. Furthermore the q-quantum language is defined. It is shown that L(A1A2)=L(A1)∩L(A2), L(A)=L(A1)∪L(A2). So over the same alphabet the intersection and union of two different q-quantum languages are also q-quantum languages.
Information spreads rapidly across websites and other online media. The IDIOM research project analyses this process by identifying redundant content elements, mapping them to ontology concepts, and tracking their tem...
详细信息
This paper studies the issue of the ticket selling service system of Chengdu railway station from the point of view of queueing theory. A basic queueing model of the ticket selling system is formulated, and two differ...
详细信息
This paper studies the issue of the ticket selling service system of Chengdu railway station from the point of view of queueing theory. A basic queueing model of the ticket selling system is formulated, and two differ...
详细信息
This paper studies the issue of the ticket selling service system of Chengdu railway station from the point of view of queueing theory. A basic queueing model of the ticket selling system is formulated, and two different optimizations are studied respectively from the point of view of system structure and the vacation policy. For each optimization, not only the theoretical analyses but also the application limits are considered. Numerical analysis based on the realistic statistical data is given. At last, we draw a conclusion in section 5.
When a PC cluster is extended with new nodes, if a good scalability can keep is focused, especially in unbalanced-nodes PC cluster. In this paper, an experimental scalability evaluation of unbalanced-nodes PC cluster ...
详细信息
When a PC cluster is extended with new nodes, if a good scalability can keep is focused, especially in unbalanced-nodes PC cluster. In this paper, an experimental scalability evaluation of unbalanced- nodes PC cluster...
详细信息
When a PC cluster is extended with new nodes, if a good scalability can keep is focused, especially in unbalanced-nodes PC cluster. In this paper, an experimental scalability evaluation of unbalanced- nodes PC cluster is illustrated. The results are also compared with that of balanced-nodes PC cluster. And, on the experiment results, the problems in parallel and distributed processing on unbalanced-nodes PC cluster are discussed and considered.
暂无评论