The empirical mode decomposition (EMD) developed by Huang etc. of NASA is an advanced method for signal analysis. But there is an involved end issue in the course of getting two envelops of the data using spline inter...
详细信息
The empirical mode decomposition (EMD) developed by Huang etc. of NASA is an advanced method for signal analysis. But there is an involved end issue in the course of getting two envelops of the data using spline interpolation. A self-adaptive method to dealing with the end issue is proposed. Generally, it extends the externa sequence near the ends of the data by the most suited sequence in the inner data. For the chosen inner sequence has the most similarity of tendency with the ends, the data extension is reasonable. After the extension, the spline does not swing at both ends of the data. The result of experiment proved that the method can be used to solve the end issue effectively.
In a wireless sensor network, the regions in which a large percentage of sensor nodes are not available may form holes in the network. In holes, sensor nodes may be depleted or not dense enough to communicate with oth...
详细信息
In this paper, we address the problem of MAC address assignment in wireless sensor networks. A novel scheme for MAC address assignment is proposed to reduce the overhead. We model the problem from the game theoretical...
详细信息
Wireless sensor networks have posed a number of challenging problems such as localization, deployment and tracking, etc. One of the interesting problems is the calculation of the coverage and exposure paths for the se...
详细信息
Wireless sensor networks have posed a number of challenging problems such as localization, deployment and tracking, etc. One of the interesting problems is the calculation of the coverage and exposure paths for the sensor networks. This paper presents a fully localized algorithm to solve the worst coverage problem first introduced by Meguerdichian et al. The nodes of the sensor network cooperate to construct the worst coverage path only by the one-hop neighbor＇s information, thus avoiding the massive communication and conserving the energy. The correctness of the proposed algorithm is proved formally under the sensing diminishing model. Moreover, this algorithm can be easily extended to solve the minimal exposure problem with local information as well.
A zone routing protocol based on the energy consumption speed of nodes in mobile Adhoc networks is presented. A route select parameter computed by residual lifetime of nodes and hop count of route is used to be select...
详细信息
A zone routing protocol based on the energy consumption speed of nodes in mobile Adhoc networks is presented. A route select parameter computed by residual lifetime of nodes and hop count of route is used to be selected the best route, the nodes that have more energy have more probability of chosen. The mechanism can balance the energy consumption of node and prolong network's life. Simulation result comparing with zone routing protocol in NS-2 shows EZRP has less number of death nodes, lower routing overhead, and longer lifetime of network.
In this paper, we present a general survey on parallel computing. The main contents include parallel computer system which is the hardware platform of parallel computing, parallel algorithm which is the theoretical ba...
详细信息
In this paper, we present a general survey on parallel computing. The main contents include parallel computer system which is the hardware platform of parallel computing, parallel algorithm which is the theoretical base of parallel computing, parallel programming which is the software support of parallel computing. After that, we also introduce some parallel applications and enabling technologies. We argue that parallel computing research should form an integrated methodology of ＂architecture algorithm programming application＂. Only in this way, parallel computing research becomes continuous development and more realistic.
In a pedestrian detection system, a classifier is usually designed to recognize whether a candidate is a pedestrian. Support vector machines (SVM) has become a primary technique to train a classifier for pedestrian de...
详细信息
In a pedestrian detection system, a classifier is usually designed to recognize whether a candidate is a pedestrian. Support vector machines (SVM) has become a primary technique to train a classifier for pedestrian detection. However, it is hard to give the best training model which has a tremendous effect to the performance of a SVM classifier. In this paper, we design special code/decode scheme and evaluation function for a training model firstly; and then use genetic algorithm to optimize key parameters which represent the SVM training model. Therefore a most suitable SVM classifier can be obtained for pedestrian detection. Experiments have been carried out in a single camera based pedestrian detection system. The results show that the evolutionary SVM classifier has a better detection rate; moreover, RBF kernel is more suitable than polynomial kernel when chosen in an evolutionary SVM classifier for pedestrian detection
Sample based texture synthesis allows the generation of arbitrarily sized textures based on a small sample image. One main drawback of the technique is that a new pixel or patch is selected only considering local info...
详细信息
Sample based texture synthesis allows the generation of arbitrarily sized textures based on a small sample image. One main drawback of the technique is that a new pixel or patch is selected only considering local information in the generated texture. Thus structural error can't assure to be avoided for structural textures. To accelerate texture synthesis process and to avoid structural mismatch in the output picture, we present in this paper a structural pattern analysis (SPA) algorithm and a texture synthesis method using the algorithm. The pattern analysis tool also quantizes the texture randomness in macro scope view. It can be used in other applications such as automatic texture classification and quality evaluation of synthesized texture. We illustrate our result with some examples
A dynamic multi-secrets sharing threshold scheme is presented to apply to a large scale electronic voting system with many talliers (tallying authorities). Even if there exists adaptive adversaries, this scheme can gu...
详细信息
A dynamic multi-secrets sharing threshold scheme is presented to apply to a large scale electronic voting system with many talliers (tallying authorities). Even if there exists adaptive adversaries, this scheme can guard the ballot's producing, encrypting, transmitting, decrypting and final tallying in spite of the adversaries's attack, so the scheme guarantees robustness. In this paper, the verifiability of the voters' qualification and talliers' identification will be solved by a dynamic multi-secret sharing scheme without invoking more zero knowledge proof to maintain privacy, universal verifiability, and anonymity of ballots. It holds more communication efficiency and more security than the proposed schemes in early time.
暂无评论