基于模糊数据挖掘和遗传算法的网络入侵检测技术

文章通过开发一套新的网络入侵检测系统来证实应用模糊逻辑和遗传算法的数据挖掘技术的有效性;这个系统联合了基于模糊数据挖掘技术的异常检测和基于专家系统的滥用检测,在开发异常检测的部分时,利用模糊数据挖掘技术来从正常的行为存储模式中寻找差异,遗传算法用来调整模糊隶属函数和选择一个合适的特征集合,滥用检测部分用于寻找先前行为描述模式,这种模式很可能预示着入侵,网络的通信量和系统的审计数据被用做两个元件的输入;此系统的系统结构既支持异常检测又支持滥用检测、既适用于个人工作站又可以适用于复杂网络。     

以ARM为核心的嵌入式体感遥控器设计

介绍一种以ARM为核心的嵌入式服务机器人体感遥控器的设计。硬件上,本遥控器采用具有ARM Cortex—M3内核的STM32F103C8T6作为核心处理器,选用ST公司的iNEMO惯性导航模块进行手部姿态的识别,同时还具有LCD显示模块、无线收发模块和电源模块;软件上,采用嵌入式操作系统μC／OS—Ⅱ实现多任务的调度和外围设备的管理。经实验验证,本遥控器具有高稳定性、高实时性、高可靠性、低误码率等优点。     

常见计算机窃密技术分析及安全防范措施

随着信息化和网络技术的不断发展,以计算机为工具来盗取用户信息的犯罪日益增加。尤其是通过网络窃取上网计算机涉密信息,已经成为国内外不法分子窃取我国秘密信息的重要手段。本文对国内外计算机窃密与反窃密技术的各种手段进行研究与分析,并通过理论与实际的相结合,提出安全与实用并重的防范措施。     

Analysis and control of general logical networks – An algebraic approach

Since Boolean network is a powerful tool in describing the genetic regulatory networks, accompanying the development of systems biology, the analysis and control of Boolean networks have attracted much attention from biologists, physicists, and systems scientists. From mathematical point of view, the dynamics of a Boolean (control) network is a discrete-time logical dynamic process. This paper surveys a recently developed technique, called the algebraic approach, based on semi-tensor product. The new technique can deal with not only Boolean networks, which allow each node to take two values, but also k-valued networks, which allow each node to take k different values, and mix-valued networks, which allow nodes to take different numbers of values.The paper provides a comprehensive introduction to the new technique, including (1) mathematical background of this new technique – semi-tensor product of matrices and the matrix expression of logic; (2) dynamic models of Boolean networks, and general (multi- or mix-valued) logical networks; (3) the topological structure of Boolean networks and general networks; (4) the basic control problems of Boolean/general control networks, which include the controllability, observability, realization, stability and stabilization, disturbance decoupling, identification and optimization, etc.; (5) some other related applications.     

Fuzzy local maximal marginal embedding for feature extraction

In graph-based linear dimensionality reduction algorithms, it is crucial to construct a neighbor graph that can correctly reflect the relationship between samples. This paper presents an improved algorithm called fuzzy local maximal marginal embedding (FLMME) for linear dimensionality reduction. Significantly differing from the existing graph-based algorithms is that two novel fuzzy gradual graphs are constructed in FLMME, which help to pull the near neighbor samples in same class nearer and nearer and repel the far neighbor samples of margin between different classes farther and farther when they are projected to feature subspace. Through the fuzzy gradual graphs, FLMME algorithm has lower sensitivities to the sample variations caused by varying illumination, expression, viewing conditions and shapes. The proposed FLMME algorithm is evaluated through experiments by using the WINE database, the Yale and ORL face image databases and the USPS handwriting digital databases. The results show that the FLMME outperforms PCA, LDA, LPP and local maximal marginal embedding.     

Generalized extreme learning machine acting on a metric space

Functional data learning is an extension of traditional data learning, that is, learning the data chosen from the Euclidean space ${\mathbb{R}^{n}}$ to a metric space. This paper focuses on the functional data learning with generalized single-hidden layer feedforward neural networks (GSLFNs) acting on some metric spaces. In addition, three learning algorithms, named Hilbert parallel overrelaxation backpropagation (H-PORBP) algorithm, ν-generalized support vector regression (ν-GSVR) and generalized extreme learning machine (G-ELM) are proposed to train the GSLFNs acting on some metric spaces. The experimental results on some metric spaces indicate that GELM with additive/RBF hidden-nodes has a faster learning speed, a better accuracy, and a better stability than HPORBP algorithm and ν-GSVR for training the functional data. The idea of GELM can be used to extend those improved extreme learning machines (ELMs) that act on the Euclidean space ${\mathbb{R}^{n}, }$ such as online sequential ELM, incremental ELM, pruning ELM and so on, to some metric spaces.     

Stability of a class of switched stochastic nonlinear systems under asynchronous switching

The stability of a class of switched stochastic nonlinear retarded systems with asynchronous switching controller is investigated. By constructing a virtual switching signal and using the average dwell time approach incorporated with Razumikhin-type theorem, the sufficient criteria for pth moment exponential stability and global asymptotic stability in probability are given. It is shown that the stability of the asynchronous stochastic systems can be guaranteed provided that the average dwell time is sufficiently large and the mismatched time between the controller and the systems is sufficiently small. This result is then applied to a class of switched stochastic nonlinear delay systems where the controller is designed with both state and switching delays. A numerical example illustrates the effectiveness of the obtained results.     

A novel technique to measure the group velocity of sound in dispersive media

A technique is proposed for measuring the group velocity of sound by a frequency-modulated (FM) continuous wave (CW) technique. Detailed calculations are presented, showing that V(g)=(deltaomega(m)/deltaphi)d , where V(g), deltaomega(m), deltaphi, and d are, respectively, the group velocity, change of modulation frequency, phase change of the received signal detected by a biphase lock-in amplifier, and the distance traveled by the sound. The approach has the advantage of high resolution compared to the conventional time-of-flight measurement technique.     

Design and development of the d.c. plasma reactor for the synthesis of ultrafine powders

After analysing different plasma processes, we have designed and developed a 14kW d.c. plasma unit for generating ultrafine powders. Experiments to characterize the torch demonstrated that it is possible to operate the plasma unit over a wide range of conditions without losing its discharge stability. Temperature distribution profiles were determined radially as well as axially in the reaction chamber, and the efficiency of the torch was calculated for a fixed power input. Ultrafine powders of Ta, Mo and W were synthesized, and size and size distribution obtained. The particle size was found to be 0.03–0.1 m, with a perfect spherical shape. The analysis of the samples is discussed.     

A self-adjusting algorithm for byzantine agreement

Summary Byzantine Agreement is important both in the theory and practice of distributed computing. However, protocols to reach Byzantine Agreement are usually expensive both in the time required as well as in the number of messages exchanged. In this paper, we present a self-adjusting approach to the problem. The Mostly Byzantine Agreement is proposed as a more restrictive agreement problem that requires that in the consecutive attempts to reach agreement, the number of disagreements (i.e., failures to reach Byzantine Agreement) is finite. Fort faulty processes, we give an algorithm that has at mostt disagreements for 4t or more processes. Another algorithm is given forn3t+1 processes with the number of disagreements belowt ²/2. Both algorithms useO(n ³) message bits for binary value agreement. Yi Zhao is currently working on his Ph.D. degree in Computer Science at University of Houston. His research interests include fault tolerance, distributed computing, parallel computation and neural networks. He obtained his M.S. from University of Houston in 1988 and B.S. from Beijing University of Aeronautics and Astronautics in 1984, both in computer science. Farokh B. Bastani received the B. Tech. degree in electrical engineering from the Indian Institute of Technology, Bombay, India, and the M.S. and Ph.D. degrees in electrical engineering and computer science from the University of California, Berkeley. He joined the University of Houston in 1980, where he is currently an Associate Professor of Computer Science. His research interests include software design and validation techniques, distributed systems, and fault-tolerant systems. He is a member of the ACM and the IEEE and is on the editorial board of theIEEE Transactions on Software Engineering.