Jiang YU Youyun XU Jinlong WANG
In this letter, we study cooperative transmission in wireless multicast networks. An opportunistic cooperative multicast scheme based on coded cooperation (OCM-CC) is proposed and its closed-form expression of outage performance is obtained. Through numeric evaluation, we analyze its outage probability with different numbers of relays and different cooperative ratios.
Shangce GAO Rong-Long WANG Masahiro ISHII Zheng TANG
This paper represents a feedback artificial immune system (FAIS). Inspired by the feedback mechanisms in the biological immune system, the proposed algorithm effectively manipulates the population size by increasing and decreasing B cells according to the diversity of the current population. Two kinds of assessments are used to evaluate the diversity aiming to capture the characteristics of the problem on hand. Furthermore, the processing of adding and declining the number of population is designed. The validity of the proposed algorithm is tested for several traveling salesman benchmark problems. Simulation results demonstrate the efficiency of the proposed algorithm when compared with the traditional genetic algorithm and an improved clonal selection algorithm.
Kaiyu WANG Sichen TAO Rong-Long WANG Yuki TODO Shangce GAO
In 2019, a new selection method, named fitness-distance balance (FDB), was proposed. FDB has been proved to have a significant effect on improving the search capability for evolutionary algorithms. But it still suffers from poor flexibility when encountering various optimization problems. To address this issue, we propose a functional weights-enhanced FDB (FW). These functional weights change the original weights in FDB from fixed values to randomly generated ones by a distribution function, thereby enabling the algorithm to select more suitable individuals during the search. As a case study, FW is incorporated into the spherical search algorithm. Experimental results based on various IEEE CEC2017 benchmark functions demonstrate the effectiveness of FW.
Rong-Long WANG Zheng TANG Qi-Ping CAO
When solving combinatorial optimization problems with a binary Hopfield-type neural network, the updating process in neural network is an important step in achieving a solution. In this letter, we propose a new updating procedure in binary Hopfield-type neural network for efficiently solving combinatorial optimization problems. In the new updating procedure, once the neuron is in excitatory state, then its input potential is in positive saturation where the input potential can only be reduced but cannot be increased, and once the neuron is in inhibitory state, then its input potential is in negative saturation where the input potential can only be increased but cannot be reduced. The new updating procedure is evaluated and compared with the original procedure and other improved methods through simulations based on N-Queens problem. The results show that the new updating procedure improves the searching capability of neural networks with shorter computation time. Particularly, the simulation results show that the performance of proposed method surpasses the exiting methods for N-queens problem in synchronous parallel computation model.
Rong-Long WANG Xiao-Fan ZHOU Kozo OKAZAKI
Ant colony optimization (ACO) algorithms are a recently developed, population-based approach which has been successfully applied to optimization problems. However, in the ACO algorithms it is difficult to adjust the balance between intensification and diversification and thus the performance is not always very well. In this work, we propose an improved ACO algorithm in which some of ants can evolve by performing genetic operation, and the balance between intensification and diversification can be adjusted by numbers of ants which perform genetic operation. The proposed algorithm is tested by simulating the Traveling Salesman Problem (TSP). Experimental studies show that the proposed ACO algorithm with genetic operation has superior performance when compared to other existing ACO algorithms.
Zheng TANG Rong Long WANG Qi Ping CAO
A gradient ascent learning algorithm of the Hopfield neural networks for graph planarization is presented. This learning algorithm uses the Hopfield neural network to get a near-maximal planar subgraph, and increases the energy by modifying parameters in a gradient ascent direction to help the network escape from the state of the near-maximal planar subgraph to the state of the maximal planar subgraph or better one. The proposed algorithm is applied to several graphs up to 150 vertices and 1064 edges. The performance of our algorithm is compared with that of Takefuji/Lee's method. Simulation results show that the proposed algorithm is much better than Takefuji/Lee's method in terms of the solution quality for every tested graph.
An improved genetic algorithm for solving the graph planarization problem is presented. The improved genetic algorithm which is designed to embed a graph on a plane, performs crossover and mutation conditionally instead of probability. The improved genetic algorithm is verified by a large number of simulation runs and compared with other algorithms. The experimental results show that the improved genetic algorithm performs remarkably well and outperforms its competitors.
Shangce GAO Rong-Long WANG Hiroki TAMURA Zheng TANG
This paper presents a new multi-layered artificial immune system architecture using the ideas generated from the biological immune system for solving combinatorial optimization problems. The proposed methodology is composed of five layers. After expressing the problem as a suitable representation in the first layer, the search space and the features of the problem are estimated and extracted in the second and third layers, respectively. Through taking advantage of the minimized search space from estimation and the heuristic information from extraction, the antibodies (or solutions) are evolved in the fourth layer and finally the fittest antibody is exported. In order to demonstrate the efficiency of the proposed system, the graph planarization problem is tested. Simulation results based on several benchmark instances show that the proposed algorithm performs better than traditional algorithms.
Jinlong WANG Yang YANG Qihui WU Xin LIU
In this letter, we focus on the spectrum sharing cognitive radio system, wherein a single-input multi-output cognitive fading channel is considered. Subject to the joint average interference constraint and peak interference constraint at the primary receiver, the outage capacity of the cognitive channel involving joint beamforming and power control is analyzed. We derive the optimal beamforming and power control strategy and deduce the closed-form expression for the outage capacity under Rayleigh fading model, the functional regions of two kinds of interference constraints are discussed as well. Furthermore, considering zero-outage transmission, we investigate the delay-limited capacity and introduce a new concept called the zero-outage average interference wall. Extensive simulations corroborate our theoretical results.
Cheng Yong SHAO Hai Long WANG Xia Mu NIU Xiao Tong WANG
A statistic based algorithm for watermarking 2D vector maps is proposed. Instead of 2D coordinates, a one-dimensional distance sequence extracted from the original map is used as the cover data to achieve the shape-preserving ability. The statistical feature of the cover data is utilized for data embedding. Experiment results indicate the scheme's better performance in invisibility, as well as its robustness to certain attacks.
We introduce a graphical calculus for multi-qutrit systems (the qutrit ZX-calculus) based on the framework of dagger symmetric monoidal categories. This graphical calculus consists of generators for building diagrams and rules for transforming diagrams, which is obviously different from the qubit ZX-calculus. As an application of the qutrit ZX-calculus, we give a graphical description of a (2, 3) threshold quantum secret sharing scheme. In this way, we prove the correctness of the secret sharing scheme in a intuitively clear manner instead of complicated linear algebraic operations.
Jiu-jun CHENG Shangce GAO Catherine VAIRAPPAN Rong-Long WANG Antti YLÄ-JÄÄSKI
Software watermarking is a digital technique used to protect software by embedding some secret information as identification in order to discourage software piracy and unauthorized modification. Watermarking is still a relatively new field and has good potential in protecting software from privacy threats. However, there appears to be a security vulnerability in the watermark trigger behaviour, and has been frequently attacked. By tracing the watermark trigger behaviour, attackers can easily intrude into the software and locate and expose the watermark for modification. In order to address this problem, we propose an algorithm that obscures the watermark trigger behaviour by utilizing buffer overflow. The code of the watermark trigger behaviour is removed from the software product itself, making it more difficult for attackers to trace the software. Experiments show that the new algorithm has promising performance in terms of the imperceptibility of software watermark.
Jiahai WANG Zheng TANG Ronglong WANG
In this paper, based on maximum neural network, we propose a new parallel algorithm that can escape from local minima and has powerful ability of searching the globally optimal or near-optimum solution for the maximum clique problem (MCP). In graph theory a clique is a completely connected subgraph and the MCP is to find a clique of maximum size of a graph. The MCP is a classic optimization problem in computer science and in graph theory with many real-world applications, and is also known to be NP-complete. Lee and Takefuji have presented a very powerful neural approach called maximum neural network for this NP-complete problem. The maximum neural model always guarantees a valid solution and greatly reduces the search space without a burden on the parameter-tuning. However, the model has a tendency to converge to the local minimum easily because it is based on the steepest descent method. By adding a negative self-feedback to the maximum neural network, we proposed a parallel algorithm that introduces richer and more flexible chaotic dynamics and can prevent the network from getting stuck at local minima. After the chaotic dynamics vanishes, the proposed algorithm is then fundamentally reined by the gradient descent dynamics and usually converges to a stable equilibrium point. The proposed algorithm has the advantages of both the maximum neural network and the chaotic neurodynamics. A large number of instances have been simulated to verify the proposed algorithm.
Controlling the peak-to-mean envelope power ratio (PMEPR) of orthogonal frequency-division multiplexed (OFDM) transmissions is a significant obstacle in many low-cost applications of OFDM. An coding approach proposed by H.R. Sadjadpour presents non-square M-QAM symbols as a combination of QPSK and BPSK signals when M=22n+1, and then uses QPSK and BPSK Golay (or Golay-like) sequences with a constant PMEPR to generate M-QAM sequences. This paper proposes a new scheme in which M-QAM sequences are generated by QPSK and BPSK sequences with variable PMEPRs. In other words, this new scheme is a general case of the existing approach. As a result, the code rate of the new sequence is significantly improved, while the upper bound of its PMEPR remains at a comparative level.
Junnan YAO Qihui WU Jinlong WANG
In this letter, we propose a dissimilarity metric (DM) to measure the deviation of a cognitive radio from the network in terms of local sensing reports. Utilizing the probability mass function of the DM, we present a dissimilarity-based attacker detection algorithm to distinguish Byzantine attackers from honest users. The proposed algorithm is able to identify the attackers without a priori information of the attacking styles and is robust against both independent and dependent attacks.
Yuhua XU Qihui WU Jinlong WANG Neng MIN Alagan ANPALAGAN
This letter investigates the problem of distributed channel selection in cognitive radio ad hoc networks (CRAHNs) with heterogeneous spectrum opportunities. Firstly, we formulate this problem as a local congestion game, which is proved to be an exact potential game. Then, we propose a spatial best response dynamic (SBRD) to rapidly achieve Nash equilibrium via local information exchange. Moreover, the potential function of the game reflects the network collision level and can be used to achieve higher throughput.
Ning LI Yan GUO Qi-Hui WU Jin-Long WANG Xue-Liang LIU
A method based on covariance differencing for a uniform linear array is proposed to counter the problem of direction finding of narrowband signals under a colored noise environment. By assuming a Hermitian symmetric Toeplitz matrix for the unknown noise, the array covariance matrix is transformed into a centrohermitian matrix in an appropriate way allowing the noise component to be eliminated. The modified covariance differencing algorithm provides accurate direction of arrival (DOA) estimation when the incident signals are uncorrelated or just two of the signals are coherent. If there are more than two coherent signals, the presented method combined with spatial smoothing (SS) scheme can be used. Unlike the original method, the new approach dispenses the need to determine the true angles and the phantom angles. Simulation results demonstrate the effectiveness of presented algorithm.
Dandan WANG Qingcai CHEN Xiaolong WANG
Text Categorization (TC) is a task of classifying a set of documents into one or more predefined categories. Centroid-based method, a very popular TC method, aims to make classifiers simple and efficient by constructing one prototype vector for each class. It classifies a document into the class that owns the prototype vector nearest to the document. Many studies have been done on constructing prototype vectors. However, the basic philosophies of these methods are quite different from each other. It makes the comparison and selection of centroid-based TC methods very difficult. It also makes the further development of centroid-based TC methods more challenging. In this paper, based on the observation of its general procedure, the centroid-based text classification is treated as a kind of ranking task, and a unified framework for centroid-based TC methods is proposed. The goal of this unified framework is to classify a text via ranking all possible classes by document-class similarities. Prototype vectors are constructed based on various loss functions for ranking classes. Under this framework, three popular centroid-based methods: Rocchio, Hypothesis Margin Centroid and DragPushing are unified and their details are discussed. A novel centroid-based TC method called SLRCM that uses a smoothing ranking loss function is further proposed. Experiments conducted on several standard databases show that the proposed SLRCM method outperforms the compared centroid-based methods and reaches the same performance as the state-of-the-art TC methods.
Rong-Long WANG Xin-Shun XU Zheng TANG
We present a learning algorithm of the Hopfield neural network for minimizing edge crossings in linear drawings of nonplanar graphs. The proposed algorithm uses the Hopfield neural network to get a local optimal number of edge crossings, and adjusts the balance between terms of the energy function to make the network escape from the local optimal number of edge crossings. The proposed algorithm is tested on a variety of graphs including some "real word" instances of interconnection networks. The proposed learning algorithm is compared with some existing algorithms. The experimental results indicate that the proposed algorithm yields optimal or near-optimal solutions and outperforms the compared algorithms.
Yuehuai MA Youyun XU Jin-Long WANG
We consider the problem of transmit power and bit rate allocation for OFDM based cognitive radio systems. An efficient allocation algorithm which mainly consists of two steps is proposed to maximize the sum rate of secondary users. In the first step of the algorithm, original nonlinear problem is converted to a convex problem which is solved by dual methods, and in the second step the final resource allocation results is obtained via iterative power rescale operation. Numerical results show the effectiveness of the proposed algorithm.