19419085
Computer Virus Evolution Model Inspired by Biological DNA
There has been considerable interest in computer viruses since they appeared. Firstly, computer viruses make software developers pay more attention to security and develop anti-virus technology more carefully. Secondly, computer viruses are vital simulation platforms to study biological viruses. Moreover, computer viruses (a form of artificial life) are helpful to enhance the understanding of the philosophy of life. Therefore, computer viruses and their evolutions are worth thoroughly studying in scientific research sense. To further investigate the evolution of computer viruses, a DNA-based model for computer viruses evolution, which draws inspiration from biological DNA and artificial life, is proposed. The formal definition of computer virus is introduced, and the evolution operators which include selection, mutation, and recombination operator are presented. The simulation experiments were conducted and the results indicate that computer viruses have enormous capabilities of self-propagation and self-evolution.
14272122
A Dynamic Immunity-Based Model for Computer Virus Detection
Internet provides a fertile medium for new breeds of computer viruses. Many people who have access to a wealth of information via Internet are attacked by more computer viruses than they can effectively process. We present a dynamic computer virus detection model that can detect known viruses and previously unknown viruses to prevent information systems from damage. This model is inspired by biological immune systems that protect the body against damage from pathogens. The architecture of this model, the formal definitions of self, nonself, antigen, antibody, and vaccine gene library are introduced. Furthermore, the evolution of self and nonself, the generation of the antibody, the evolution of the virus vaccine gene, and the detection of the antigen are depicted. Experiment results show that this model has better capacity of self-adaptability and self-learning in detecting unknown viruses than traditional models.
10021622
Dynamically Maintaining Duplicate-Insensitive and Time-Decayed Sum Using Time-Decaying Bloom Filter
The duplicate-insensitive and time-decayed sum of an arbitrary subset in a stream is an important aggregation for various analyses in many distributed stream scenarios. In general, precisely providing this sum in an unbounded and high-rate stream is infeasible. Therefore, we target at this problem and introduce a sketch, namely, time-decaying Bloom Filter (TDBF). The TDBF can detect duplicates in a stream and meanwhile dynamically maintain decayed-weight of all distinct elements in the stream according to a user-specified decay function. For a query for the current decayed sum of a subset in the stream, TDBF provides an effective estimation. In our theoretical analysis, a provably approximate guarantee has been given for the error of the estimation. In addition, the experimental results on synthetic stream validate our theoretical analysis.
29802848
Improved Approximate Detection of Duplicates for Data Streams Over Sliding Windows
Detecting duplicates in data streams is an important problem that has a wide range of applications. In general, precisely detecting duplicates in an unbounded data stream is not feasible in most streaming scenarios, and, on the other hand, the elements in data streams are always time sensitive. These make it particular significant approximately detecting duplicates among newly arrived elements of a data stream within a fixed time frame. In this paper, we present a novel data structure, Decaying Bloom Filter (DBF), as an extension of the Counting Bloom Filter, that effectively removes stale elements as new elements continuously arrive over sliding windows. On the DBF basis we present an efficient algorithm to approximately detect duplicates over sliding windows. Our algorithm may produce false positive errors, but not false negative errors as in many previous results. We analyze the time complexity and detection accuracy, and give a tight upper bound of false positive rate. For a given space G bits and sliding window size W, our algorithm has an amortized time complexity of $ O + (\sqrt{G/W}) $. Both analytical and experimental results on synthetic data demonstrate that our algorithm is superior in both execution time and detection accuracy to the previous results.
43302296
A Novel Immune Based Approach for Detection of Windows PE Virus
Generic computer virus detection is the absolute need of the hour as most commercial antivirus products fail to detect unknown and new Windows PE viruses. Motivated by the success of immune-based techniques in intrusion detection systems, recent research in detecting computer viruses is directed towards devising efficient non-signature-based techniques. We observe that each Windows PE virus whether or not it is encrypted must have a relocation module to relocate its variables or constants in the infected programs. Due to its unique characteristic, the virus relocation module can be extracted as an antibody in the immune systems to detect the specific antigens. In this paper, we presented a novel Windows PE virus detection approach that draws inspiration from artificial immune system and the structure of the relocation module of the virus. The structure of Windows PE virus is sufficiently analyzed. The dynamic evolution of self and nonself, the presentation of the antigen, and the generation of the antibody are proposed. The experiment is conducted and its results indicate that this approach not only has relatively higher detection rate of unknown Windows PE virus than the earlier known methods, but also has better capability of self-adaptive and self-learning.
18262600
Parameters optimization of support vector regression based on immune particle swarm optimization algorithm
A novel Immune Particle Swarm Optimization (IPSO) for parameters optimization of Support Vector Regression (SVR) is proposed in this article. After introduced clonal copy and mutation process of Immune Algorithm (IA), the particle of PSO is considered as antibodies. Therefore, evaluated the fitness of particles by the Leave-One-Out Cross-Validation (LOOCV) standard, the best individual mutated particle for each cloned group will be selected to compose the next generation to get better parameters of SVR. It can construct high accuracy and generalization performance regression model rapidly by optimizing the combination of three SVR parameters at the same time. Under the datasets generated from sinx function with additive noise and spectra dataset, simulation results show that the new method can determine the parameters of SVR quickly and the gotten models have superior learning accuracy and generalization performance.
36049595
The Implementation of a Fully Integrated Scheme of self-Configuration and self-Organization (FISCO) on Imote2
Wireless Sensor networks are gaining a role of importance in the research community. In this paper, we choose Imote2 to establish our testbed according to the analysis and the comparison of the hardware capabilities and software characteristics of the current WSNs products. Moreover, we present our hardware, software platforms and "30 motes" testbed to validate and evaluate our Fully Integrated Scheme of self-Configuration and self-Organization (FISCO) while further propose the rudiment of our general routing and data dissemination testbed. In the test stage, experimental results show that each mote in the network obtains the corresponding role and takes correct actions to handle every receiving message.
14243699
Research on the Hierarchical Supervisory Control of Underwater Glider
An underwater glider is a buoyancy-propelled and fixed-wing vehicle with attitude controlled completely by means of internal mass redistribution. In order to independently accomplish complex missions in unstructured and unknown oceanic environment, intelligent control system is needed to provide the underwater glider with the ability of active autonomy. Based on the RW (Ramadge & Wonham) supervisory control theory of discrete event dynamic system (DEDS), a three-level hierarchical supervisory control architecture for underwater glider is presented. The DEDS formalism models of underwater glider in terms of finite state automata (FSA) are built, and the realization of the hierarchical supervisory control (HSC) system is brought forth in detail. The simulation result shows that the three-level supervisory control system can adapt to uncertain undersea environment, and makes reasonable planning
7343144
A New Recovery Escalation Algorithm with Load Balancing and Backup Resources Sharing in Path Protected WDM Optical Networks
This paper proposes a new survivable algorithm, enhanced shared-path protection (ESPP), to tolerate multi-link failures in WDM optical networks. In ESPP, we consider the load balancing to reduce the blocking probability, use resources sharing to save backup resources, and perform recovery escalation to carry the affected traffic. Compared with the conventional algorithm, ESPP has better resource utilization ratio, lower blocking probability and higher protection ability. Simulation results are shown to be promising.
119556859
Eventual practical stability of impulsive differential equations with time delay in terms of two measurements
In this paper we introduce a new stability--eventual practical stability for impulsive differential equations with time delay. By using Lyapunov functions and comparison principle, we will get some criteria of eventual practical stability, eventual practical quasistability and strong eventual practical stability for impulsive differential equations with time delay in terms of two measurements.
44610157
A New Robust Bandpass Sampling Scheme for Multiple RF Signals in SDR System
Software defined radio (SDR) technology has been widely applied for its powerful universality and flexibility in the past decade. To address the issue of bandpass sampling of multiband signals, a novel and efficient method of finding the minimum valid sampling frequency is proposed. Since there are frequency deviations due to the channel effect and hardware instability in actual systems, we also consider the guard-bands between downconverted signal spectra in determining the minimum sampling frequency. In addition, the case that the spectra within the sampled bandwidth are located in inverse placement can be avoided by our proposed method, which will reduce the complexity of the succeeding digital signal process significantly. Simulation results illustrate that the proper minimum sampling frequency can be determined rapidly and accurately.