As the number of objectives increases,the performance of the Pareto dominance-based Evolutionary Multi-objective Optimization( EMO) algorithms such as NSGA-II,SPEA2 severely deteriorates due to the drastic increase in...
详细信息
As the number of objectives increases,the performance of the Pareto dominance-based Evolutionary Multi-objective Optimization( EMO) algorithms such as NSGA-II,SPEA2 severely deteriorates due to the drastic increase in the Pareto-incomparable solutions. We propose a sorting method which classifies these incomparable solutions into several ordered classes by using the decision maker's( DM) preference *** is accomplished by designing an interactive evolutionary algorithm and constructing convex cones. This method allows the DMs to drive the search process toward a preferred region of the Pareto optimal front. The performance of the proposed algorithm is assessed for two,three,and four-objective knapsack problems. The results demonstrate the algorithm ' s ability to converge to the most preferred point. The evaluation and comparison of the results indicate that the proposed approach gives better solutions than that of NSGA-II. In addition,the approach is more efficient compared to NSGA-II in terms of the number of generations required to reach the preferred point.
In cognitive radio system, the Cournot game model is used for analyzing the spectrum allocation of primary users. Considering the noise is random, the spectrum allocation of primary user based on Bayesian game is prop...
详细信息
ISBN:
(纸本)9781467321969
In cognitive radio system, the Cournot game model is used for analyzing the spectrum allocation of primary users. Considering the noise is random, the spectrum allocation of primary user based on Bayesian game is proposed in this paper. First, the transmit power is viewed as one factor of the cost function. And considering the noise is uncertain, the high noise and the low noise are viewed as two different types of primary users. Then, we can obtain the strategy of primary user by using dynamic Bayesian game. The experimental results on spectrum allocation demonstrate the effectiveness of the proposed scheme.
Distributed secure quantum machine learning (DSQML) enables a classical client with little quantum technology to delegate a remote quantum machine learning to the quantum server with the privacy data preserved. More...
详细信息
Distributed secure quantum machine learning (DSQML) enables a classical client with little quantum technology to delegate a remote quantum machine learning to the quantum server with the privacy data preserved. Moreover, DSQML can be extended to a more general case that the client does not have enough data, and resorts both the remote quantum server and remote databases to perform the secure machi~ learning. Here we propose a DSQML protocol that the client can classify two-dimensional vectors to dif- ferent clusters, resorting to a remote small-scale photon quantum computation processor. The protocol is secure without leaking any relevant information to the Eve. Any eavesdropper who attempts to intercept and disturb the learning process can be noticed. In principle, this protocol can be used to classify high dimensional vectors and may provide a new viewpoint and application for future "big data".
We present a highly efficient entanglement concentration protocol (ECP) for a four-electron system in a less-entangled cluster state. In this ECP, we only require one pair of less-entangled electron cluster states a...
详细信息
We present a highly efficient entanglement concentration protocol (ECP) for a four-electron system in a less-entangled cluster state. In this ECP, we only require one pair of less-entangled electron cluster states and one ancillary electron to complete the task. With the help of the controlled-not (CNOT) gate, the concentrated maximally entangled state can be retained for further application with some success probability. On the other hand, the discarded items can be reused to obtain a high success probability. All the features make this ECP useful in the current quantum information field.
To improve the performance of reprogramming in wirelesssensornetwork, we present a novel reprogramming structure and constructive interference-based dissemination protocol (CIDP) to transmit the patch throughout the...
详细信息
Due to a rapid increase in the number of functionally equivalent web services at open and dynamic Io T service environment,Qo S has become a major discrimination factor to reflect the user's expectation and experi...
详细信息
Due to a rapid increase in the number of functionally equivalent web services at open and dynamic Io T service environment,Qo S has become a major discrimination factor to reflect the user's expectation and experience of using a *** are different languages and models for expressing Qo S advertisements and requirements among service providers and ***,it leads to the issues of semantic interoperability of Qo S information and semantic similarity match between a semantic description of the service being requested by the service consumer,and a formal description of the service being offered by the service *** this paper,we propose a hierarchical two-layer semantic Qo S ontology to promote the description and declaration of Qo S-based service information in detail for any domain and ***,we develop a semantic matchmaking algorithm to compare the web services according to their Qo S information and adopt analytical hierarchy process( AHP) to make decision for the ranked services depending on the Qo S *** comparison study and experimental result show that our proposed system is superior to other service ranking approaches.
The traditional Poisson model in the modern data networks have been ineffective and cannot reflect the real flow trend. However, since Hosking discovers the network traffic self-similarity, self-similar models have co...
详细信息
The traditional Poisson model in the modern data networks have been ineffective and cannot reflect the real flow trend. However, since Hosking discovers the network traffic self-similarity, self-similar models have continued to emerge, this article improved FARIMA model based on time compensation. We put forward a sliding FARIMA model which fixes the time delay of FARIMA model and analyzed the model's application in the anomaly detection of network.
In order to change the path candidates, reduce the average list size, and make more paths pass cyclic redundancy check (CRC), multiple CRC-aided variable successive cancellation list (SCL) decoding algorithm is pr...
详细信息
In order to change the path candidates, reduce the average list size, and make more paths pass cyclic redundancy check (CRC), multiple CRC-aided variable successive cancellation list (SCL) decoding algorithm is proposed. In the decoding algorithm, the whole unfrozen bits are divided into several parts and each part is concatenated with a corresponding CRC code, except the last part which is concatenated with a whole unfrozen CRC code. Each CRC detection is performed, and only those satisfying each part CRC become the path candidates. A variable list is setup for each part to reduce the time complexity. Variable list size is setup for each part to reduce the time complexity until one survival path in each part can pass its corresponding CRC. The results show that the proposed algorithm can reduce the average list size, and the frame error rate (FER) performance, and has a better performance with the increase of the part number.
QoS-aware routing algorithm is important in wireless multimedia sensornetworks. This paper formulates a generalized QoS-aware routing model on the basis of multiple routing metrics and priorities of packets. We first...
详细信息
QoS-aware routing algorithm is important in wireless multimedia sensornetworks. This paper formulates a generalized QoS-aware routing model on the basis of multiple routing metrics and priorities of packets. We first introduce a 2D plain-based routing algorithm IPACR which improves the standard ant colony algorithm by optimizing the initial distribution of artificial pheromone in order to accelerate the algorithm convergence rate. Then a clustering-based routing algorithm ICACR is presented which can be well applied in a large scale network. ICACR is a variation of IPACR because it can be suitable for clustering cases to satisfy the larger scale situations. Both the numerical algorithm performance analysis and simulation of IPACR and ICACR are given. The results show that ICACR outperforms IPACR in terms of both network lifetime and QoS-aware routing metrics in large scale wireless multimedia sensornetworks. Moreover, the simulation based on the real video traces shows that by extending the multi-path to ICACR for different priorities of video frames better performance can be achieved.
In Internet of Things (IoT), the similar functional services are evolving in different quality of services (QoS) due to the widespread deployment of spatially distributed things on dynamic networks through the web. Th...
详细信息
暂无评论