Adaptive interaction driven by the learning effect in the spatial prisoner's dilemma

We propose a computing model in which individuals can automatically adjust their interaction intensity with their mentor according to the learning effect.This model is designed to investigate the cooperative dynamics of the spatial prisoner's dilemma.More specifically,when the cumulative payoff of a learner is more than his reference earning,he will strengthen his interaction with his mentor;otherwise,he will reduce it.The experimental results indicate that this mechanism can improve the emergence of cooperation in a networked population and that the driving coefficient of interaction intensity plays an important role in promoting cooperation.Interestingly,under a certain social dilemma condition,there exists a minimal driving coefficient that leads to optimal cooperation.This occurs due to a positive feedback effect between the individual's satisfaction frequency and the number of effective neighbors.Moreover,we find that the experimental results are in accord with theoretical predictions obtained from an extension of the classical pair-approximation method.Our conclusions obtained by considering relationships with mentors can provide a new perspective for future investigations into the dynamics of evolutionary games within structured populations.

Edge Detection Algorithm of SAR Images with Wedgelet Filter

Based on the analysis of the characteristics of synthetic aperture radar （SAR） images, a new edge detection method is proposed. The wedgelet transform is introduced into the area of SAR image speckle reduction for it can provide a nearly optimal representation for images in the horizon class. The wedgelet filter has good ability in keeping edge and speckle reduction. Then, a ratio edge detector is applied after a process of speckle reduction. The experimental results show that the method outperforms substantially others visually.

Degradation of AlGaN/GaN High Electron Mobility Transistors with Different AlGaN Layer Thicknesses under Strong Electric Field

The degradation of AlGaN/GaN high electron mobility transistors （HEMTs） has a close relationship with a model of traps in AlGaN barriers as a result of high electric field. We mainly discuss the impacts of strong electrical field on the AlGaN barrier thickness of AlGaN/GaN HEMTs. It is found that the device with a thin AlGaN barrier layer is more easily degraded. We study the degradation of four parameters, i.e. the gate series resistance RGate, channel resistance R channel, gate current IG,off at VGS=-5 and VDS=0.1 V, and drain current ID,max at VGS=2 and VDS=5 V. In addition, the degradation mechanisms of the device electrical parameters are also investigated in detail.

Improved quantum key agreement protocol with authentication

In order to make the quantum key agreement process immune to participant attacks, it is necessary to introduce the authentication in the communication process. A quantum key agreement protocol with identity authentication that exploits the measurement correlation of six-particle entangled states is proposed. In contrast to some recently proposed quantum key agreement protocols with authentication, this protocol requires neither a semi-trusted third party nor additional private keys in the authentication process. The entire process of authentication and key agreement can be achieved using only n six-particle entangled states, which saves communication costs and reduces the complexity of the authentication process.Finally, security analysis shows that this scheme is resistant to some important attacks.

Blind quantum computation with a client performing different single-qubit gates

In the field of single-server blind quantum computation(BQC), a major focus is to make the client as classical as possible. To achieve this goal, we propose two single-server BQC protocols to achieve verifiable universal quantum computation. In these two protocols, the client only needs to perform either the gate T(in the first protocol) or the gates H and X(in the second protocol). With assistance from a single server, the client can utilize his quantum capabilities to generate some single-qubit states while keeping the actual state of these qubits confidential from others. By using these single-qubit states, the verifiable universal quantum computation can be achieved.

Fusion Algorithm for Remote Sensing Images Based on Nonsubsampled Contourlet Transform

就图象的人的视觉系统和特征而言，新奇图象熔化策略为在 nonsubsampled contourlet 的高分辨率图象和 multispectral 图象转变的 panchro matic (NSCT ) 被介绍域。NSCT 能由它好 multiresolution，移动不变性，和高 directionality 的特征的优点在图象给 asymptotic 边和轮廓的最佳的表示。紧张部件增加策略基于 LHS 变换被介绍进 NSCT 领域保存空间分辨率和颜色内容。熔化方法建议了的实验表演能改进空间分辨率并且保留光谱信息同时，并且与传统的原则部件分析( PCA )相比在视觉效果和量的肛门 ysis 两个都有改进方法， intensity-hue-saturation (代表耶稣之符号)变换技术，小浪变换加权的熔化方法，相应小浪基于变换的熔化方法，和 contourlet 基于变换的熔化方法。

基于第二代Bandelet域隐马尔可夫树模型的图像分割

第二代Bandelet可以充分利用图像的内在几何正则性特点,并能自适应获得图像的最优表示.本文采用隐马尔可夫树(Hidden Markov tree,HMT)模型对图像的第二代Bandelet系数建模,通过多尺度参数训练和基于上下文的最大后验概率进行图像分割.为了评价本文方法的性能,我们分别选择合成纹理图像、航拍图像和SAR图像进行实验,并与小波域HMT模型分割方法(WD-HMTseg)和Contourlet域HMT模型分割方法(CHM Tseg)进行比较说明算法的有效性.实验结果表明本文方法不但在边缘准确性和区域一致性上有明显改进,而且也降低了纹理图的错分概率.

Optimal approximation of linear systems by artificial immune response

This paper puts forward a novel artificial immune response algorithm for optimal approximation of linear systems. A quaternion model of artificial immune response is proposed for engineering computing. The model abstracts four elements, namely, antigen, antibody, reaction rules among antibodies, and driving algorithm describing how the rules are applied to antibodies, to simulate the process of immune response. Some reaction rules including clonal selection rules, immunological memory rules and immune regulation rules are introduced. Using the theorem of Markov chain, it is proofed that the new model is convergent. The experimental study on the optimal approximation of a stable linear system and an unstable one show that the approximate models searched by the new model have better performance indices than those obtained by some existing algorithms including the differential evolution algorithm and the multi-agent genetic algorithm.

Directional Filter for SAR Images Based on Nonsubsampled Contourlet Transform and Immune Clonal Selection

A directional filter algorithm for intensity synthetic aperture radar （SAR） image based on nonsubsampled contourlet transform （NSCT） and immune clonal selection （ICS） is presented. The proposed filter mainly focuses on exploiting different features of edges and noises by NSCT. Furthermore, ICS strategy is introduced to optimize threshold parameter and amplify parameter adaptively. Numerical experiments on real SAR images show that there are improvements in both visual effects and objective indexes.

Image retrieval based on color features integrated with anisotropic directionality

A novel image retrieval approach based on color features and anisotropic directional information is proposed for content based image retrieval systems （CBIR）. The color feature is described by the color histogram （CH）, which is translation and rotation invariant. However, the CH does not contain spatial information which is very important for the image retrieval. To overcome this shortcoming, the subband energy of the lifting directionlet transform （L-DT） is proposed to describe the directional information, in which L-DT is characterized by multi-direction and anisotropic basis functions compared with the wavelet transform. A global similarity measure is designed to implement the fusion of both color feature and anisotropic directionality for the retrieval process. The retrieval experiments using a set of COREL images demonstrate that the higher query precision and better visual effect can be achieved.

Quantum Immune Clonal Selection Algorithm for Multi-objective 0/1 Knapsack Problems

Based on the concept and principles of quantum computing and the principle of the immune clonal selection, a new algorithm for multi-objective 0/1 knapsack problems is introduced. In the algorithm, for the novel representation, qubit antibodies in the antibody population are updated by applying a new chaos update strategy. A quantitative metric is used for testing the convergence to the Pareto-optimal front. Simulation results on the 0/1 knapsack problems show that the new algorithm, in most cases, is more effective.

Target Detection in Three-Dimension Sensor Networks Based on Clifford Algebra

The three-dimensional sensor networks are supposed to be deployed for many applications. So it is signifi-cant to do research on the problems of coverage and target detection in three-dimensional sensor networks. In this paper, we introduced Clifford algebra in 3D Euclidean space, developed the coverage model of 3D sensor networks based on Clifford algebra, and proposed a method for detecting target moving. With Clif-ford Spinor, calculating the target moving formulation is easier than traditional methods in sensor node’s coverage area.

CLUSTERING VIA DIMENSIONAL REDUCTION METHOD FOR THE PROJECTION PURSUIT BASED ON THE ICSA

The performance of the classical clustering algorithm is not always satisfied with the high-dimensional datasets, which make clustering method limited in many application. To solve this problem, clustering method with Projection Pursuit dimension reduction based on Immune Clonal Selection Algorithm (ICSA-PP) is proposed in this paper. Projection pursuit strategy can maintain consistent Euclidean distances between points in the low-dimensional embeddings where the ICSA is used to search optimizing projection direction. The proposed algorithm can converge quickly with less iteration to reduce dimension of some high-dimensional datasets, and in which space, K-mean clustering algorithm is used to partition the reduced data. The experiment results on UCI data show that the presented method can search quicker to optimize projection direction than Genetic Algorithm (GA) and it has better clustering results compared with traditional linear dimension reduction method for Principle Component Analysis (PCA).

Plagiarism Detection in Homework Based on Image Hashing

The problem of high similarity in homework has troubled teachers with time. Previous plagiarism detection systems are mainly realized by string matching which has a limitation, i.e., image homework cannot be detected. To this issue, we propose a new method of plagiarism detection in homework. First,we get fingerprint features of image homework by converting text homework into images. Then, we use image hashing algorithm and hamming distance to calculate the similarity of these features. Finally, we perform the empirical study on course of Computer Network Experiment, the test shows that our method not only reliably keeps the detection speedily, but also consistently ensures precision and false positive rate.

Disturbance identification of electric field data observed by the CSES-01 satellite before earthquakes

Numerous studies have confirmed that electromagnetic disturbances before earthquakes can be observed by satellites.In this study,we use the C-value method that includes the acoustic whistle signature;pre-seismic ionospheric electromagnetic disturbance signals were acquired based on the CSES-01 satellite electric field data,and the maximum value of C in the earthquake preparation zones increased continuously from 2.0 three days before the earthquake and reached a maximum weight of 3.0 on the day of the earthquake,after the earthquake,it gradually decreased and recovered to about 2.0;its the C values fluctuated between-2 and 3,it is different from the C values range-2–12 of the previous seismic case study using the DEMETER satellite,which may be related to the orbital altitude and revisit period of the satellite.Then,the C values were normalized,and the time series analysis of the obtained θ values were done,and the results showed that:In the pregnant zone,the background variation of the disturbance amplitude θ is within 2σ,and the maximum disturbance amplitude of θ starts to increase gradually from the seventh period(one period of 5 days,i.e.,35–39 days before the earthquake),it reached 2σ by the fourth preseismic cycle(20–24 days before the earthquake),and then dropped sharply to about 1.5σ in the third pre-seismic cycle(15–19days before the earthquake),after two cycles of increase,the θ over the epicenter reached a maximum of 2.1σ at the time of the earthquake(combining the time of the earthquake and the satellite flight characteristics,the epicenter period is defined as January25-January 29,2020,and this defines the study time period line),and the θ decreases to within 2 times the standard range after the earthquake;The negative value of the disturbance amplitude θ in the central region of the pregnant seismic zone during the earthquake shows the transient energy release process.Through comparison,the θ values obtained by normalization based on the C-value method takes into account the variation of the background field,and the result can better reflect the energy change of the ionospheric field before the earthquakes.

Text Reasoning Chain Extraction for Multi-Hop Question Answering

With the advent of the information age, it will be more troublesome to search for a lot of relevant knowledge to find the information you need. Text reasoning is a very basic and important part of multi-hop question and answer tasks. This paper aims to study the integrity, uniformity, and speed of computational intelligence inference data capabilities. That is why multi-hop reasoning came into being, but it is still in its infancy, that is, it is far from enough to conduct multi-hop question and answer questions, such as search breadth, process complexity, response speed, comprehensiveness of information, etc. This paper makes a text comparison between traditional information retrieval and computational intelligence through corpus relevancy and other computing methods. The study finds that in the face of multi-hop question and answer reasoning, the reasoning data that traditional retrieval methods lagged behind in intelligence are about 35% worse. It shows that computational intelligence would be more complete, unified, and faster than traditional retrieval methods. This paper also introduces the relevant points of text reasoning and describes the process of the multi-hop question answering system, as well as the subsequent discussions and expectations.

Active transfer learning of matching query results across multiple sources

Entity resolution （ER） is the problem of identi- fying and grouping different manifestations of the same real world object. Algorithmic approaches have been developed where most tasks offer superior performance under super- vised learning. However, the prohibitive cost of labeling training data is still a huge obstacle for detecting duplicate query records from online sources. Furthermore, the unique combinations of noisy data with missing elements make ER tasks more challenging. To address this, transfer learning has been adopted to adaptively share learned common structures of similarity scoring problems between multiple sources. Al- though such techniques reduce the labeling cost so that it is linear with respect to the number of sources, its random sam- piing strategy is not successful enough to handle the ordinary sample imbalance problem. In this paper, we present a novel multi-source active transfer learning framework to jointly select fewer data instances from all sources to train classi- fiers with constant precision/recall. The intuition behind our approach is to actively label the most informative samples while adaptively transferring collective knowledge between sources. In this way, the classifiers that are learned can be both label-economical and flexible even for imbalanced or quality diverse sources. We compare our method with the state-of-the-art approaches on real-word datasets. Our exper- imental results demonstrate that our active transfer learning algorithm can achieve impressive performance with far fewerlabeled samples for record matching with numerous and var- ied sources.

Clonal Strategy Algorithm Based on the Immune Memory

Based on the clonal selection theory and immune memory mechanism in the natural immune system, a novel artificial immune system algorithm, Clonal Strategy Algorithm based on the Immune Memory （CSAIM）, is proposed in this paper. The algorithm realizes the evolution of antibody population and the evolution of memory unit at the same time, and by using clonal selection operator, the global optimal computation can be combined with the local searching. According to antibody-antibody （Ab-Ab） affinity and antibody-antigen （Ab-Ag） affinity, the algorithm can allot adaptively the scales of memory unit and antibody population. It is proved theoretically that CSAIM is convergent with probability 1. And with the computer simulations of eight benchmark functions and one instance of traveling salesman problem （TSP）, it is shown that CSAIM has strong abilities in having high convergence speed, enhancing the diversity of the population and avoiding the premature convergence to some extent.

Multiobjective optimization using an immunodominance and clonal selection inspired algorithm

Based on the mechanisms of immunodominance and clonal selection theory, we propose a new multiobjective optimization algorithm, immune dominance clonal multiobjective algorithm （IDCMA）. IDCMA is unique in that its fitness values of current dominated individuals are assigned as the values of a custom distance measure, termed as Ab-Ab affinity, between the dominated individuals and one of the nondominated individuals found so far. According to the values of Ab-Ab affinity, all dominated individuals （antibodies） are divided into two kinds, subdominant antibodies and cryptic antibodies. Moreover, local search only applies to the subdominant antibodies, while the cryptic antibodies are redundant and have no function during local search, but they can become subdominant （active） antibodies during the subsequent evolution. Furthermore, a new immune operation, clonal proliferation is provided to enhance local search. Using the clonal proliferation operation, IDCMA reproduces individuals and selects their improved maturated progenies after local search, so single individuals can exploit their surrounding space effectively and the newcomers yield a broader exploration of the search space. The performance comparison of IDCMA with MISA, NSGA-Ⅱ, SPEA, PAES, NSGA, VEGA, NPGA, and HLGA in solving six well-known multiobjective function optimization problems and nine multiobjective 0/1 knapsack problems shows that IDCMA has a good performance in converging to approximate Pareto-optimal fronts with a good distribution.