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.     

实验室排课系统开发与使用

实验室是学生实践实验的必要场所,但是所有高校都会面临着实验室少,学生人数多,如何更好分配实验室的使用,是实验室管理人员值得考虑的首要问题。针对此问题,本院校实验室结合自己实验室的真实情况编写实验室排课系统。     

关于计算机信息网络安全问题的对策分析

当今科技日新月异,经济发展迅猛,也带动了网络技术的不断高速发展,并广泛的应用于各大领域(军事、经济和政治等)。在计算机网络技术的广泛应用形势下,它的安全性问题也就逐渐的突显出来,引起了行业内人士的广泛关注。因此对网络应用中的安全性问题进行分析与探究是迫在眉睫的任务。本文首先论述了其应用中最常见的几大安全性问题,以及说明了对其安全问题所需要防护的相关策略。     

浅析局域网的安全技术

随着计算机网络的不断发展和广泛运用,局域网的安全问题也越来越受到人们的关注。本文将阐述局域网的存在的一些不安全因素及相应的安全策略和采用的安全技术。