Fuzzy soft set (FSs) is a novel mathematical tool, in order to describe and measure uncertain information of FSs perfectly, granularity analysis based on covering about FSs is originally discussed in this paper. First...
详细信息
In recent years, WSN (Wireless Sensor Network) technology has been developed rapidly, and been widely used in the fields of industry, agriculture, medicine and so on. To solve the low communication rate and short-dist...
详细信息
ISBN:
(纸本)9781467344999
In recent years, WSN (Wireless Sensor Network) technology has been developed rapidly, and been widely used in the fields of industry, agriculture, medicine and so on. To solve the low communication rate and short-distance data transmission in the current temperature and humidity monitoring system, this paper designs a temperature and humidity remote monitoring system based on WSN technology. In this system, microprocessor Atmega128L is adopted as the control core of network node, and wireless transceiver module nRF905 is used to realize wireless data transmission. The data of temperature and humidity is sampled by using digital temperature sensor DS18B20 and humidity sensor SHT75 in the system. The proposed network protocol in this paper not only can realize long-rang wireless data transmission, but also can realize self-organizing and manual networking. The results of practical test show that this system has the stable and reliable performance and the advantage of scalability.
In cognitive radio (CR) networks, unlicensed secondary users need to conduct spectrum sensing to gain access to a licensed spectrum band. And cooperation among CR users will solve the problems caused by multipath fadi...
详细信息
In cognitive radio (CR) networks, unlicensed secondary users need to conduct spectrum sensing to gain access to a licensed spectrum band. And cooperation among CR users will solve the problems caused by multipath fading and shadowing. In this paper, we propose a multi-threshold method at local nodes to cope with noises of great uncertainty. Functions of distance between bodies of evidence are used at fusion centre to make synthetic judgment. To guarantee security which is an essential component for basic network functions, we will take selfish nodes into account which try to occupy channels exclusively. The proposed technique has shown better performance than conventional algorithms without increase the system overhead.
In this paper, we propose a novel method named Contracting Community Approach (CCA) to get the maximum flow of flow network. Firstly, we contract communities in the original network. Then, we apply classic algorithms ...
详细信息
In this paper, we propose a novel method named Contracting Community Approach (CCA) to get the maximum flow of flow network. Firstly, we contract communities in the original network. Then, we apply classic algorithms on the contracted network to approximately solve the maximum flow problem. Experimental results show that the efficiency of the proposed algorithm. For sparse networks, the size of network is reduced to 58.38% averagely and the correctness of maximum flow is over 95%. For middle dense networks, the size of network is reduced to 65.77% averagely. For dense networks, the size of network is reduced to 64.84% averagely. And the correctness of maximum flow even reach 100% both in many middle dense and dense cases in our experiments.
In allusion to the phenomenon of stagnation and precocity during evolution in ant colony optimization (ACO) algorithm, this paper proposed a dual population parallel ant colony optimization (DPPACO) algorithm, which w...
详细信息
In allusion to the phenomenon of stagnation and precocity during evolution in ant colony optimization (ACO) algorithm, this paper proposed a dual population parallel ant colony optimization (DPPACO) algorithm, which was applied to the traveling salesman problem. The DPPACO algorithm separated the ants into soldier ant population and worker ant population which evolve separately by parallel method and exchanges information timely. The dynamic equilibrium between solution diversity and convergence speed is achieved by using the effect of the soldier ant's distribution to worker ants' movement choice. The DPPACO algorithm can enlarge searching range and avoid local minimum, prevent local convergence caused by misbalance of the pheromone and can improve the searching performance of the algorithm effectively. The proposed algorithm is applied in the traveling salesman problem by using the 17 data sets obtained from the TSPLIB. We compare the experimental results of the proposed DPPACO method with the traditional methods. The experimental results demonstrate that the proposed algorithm has a better global searching ability, higher convergence speed and solution diversity.
The effect of Web information extraction depends on the quality of extraction rules. But for most approaches for Web information extraction, independence of extraction rules is their common shortages. In this paper, w...
详细信息
The effect of Web information extraction depends on the quality of extraction rules. But for most approaches for Web information extraction, independence of extraction rules is their common shortages. In this paper, we propose a novel approach based on ontology for Web information extraction. We sum up four features for information items and induce these features to a group of extraction rules. Then according to a group of mapping rules between elements of ontology and extraction rules, extraction rules are well organized in ontology. According to properties of concept in ontology, the initial result of information extraction is got and then the final result is obtained by simplifying the initial results. Experiments show that our approach has higher precision.
The weighted circles layout problem belongs to the layout optimization problem with performance constraints. Due to its NP-hard property, it is difficult to solve in polynomial time. In this paper, a heuristic particl...
详细信息
The weighted circles layout problem belongs to the layout optimization problem with performance constraints. Due to its NP-hard property, it is difficult to solve in polynomial time. In this paper, a heuristic particle swarm optimization approach with quasi-human strategy (HQHPSA) is presented for this problem. Its layout scheme is constructed through the proposed heuristic method: that both circular radius and the norm of row vector of the matrix and sub-vector are taken as the probability factors of the roulette selection and the circles are located by arranging round existing circles in peripheral with counterclockwise. The complexity of the proposed heuristic method is only O(n) for one layout scheme. The better layout solution obtained through the proposed heuristic method is taken as the elite particle individual. The PSO with quasi-human strategy is used to optimize the elite particle into the optimal solution. The numerical experiments show that the performance of proposed algorithm is superior to the existing algorithms.
In the theory of compressive sensing, the selection of the basis functions directly affects the sparse transformation, observation number and reconstruction accuracy. In this paper, we introduce the structure of three...
详细信息
The conventional 'OR' fusion rule is frequently applied in two pre-determined limits energy detection networks but its overall performance of the false alarm and miss detection probability is generally. The ne...
详细信息
The quotient space theory based on fuzzy tolerance relation is put forward to solve the problem of clustering in this paper. The similarity matrix does not always satisfy ultrametric inequality, theoretically and prac...
详细信息
暂无评论