全自动酶免工作站计算机控制系统设计

介绍了酶免工作站软件控制部分的分析和设计。按软件工程的设计思想,归纳出系统的对象,给出系统实现单文档多视和控制类的详细设计。并将一种改进的自适应遗传算法应用于系统执行效率的优化。此开发系统已投入实际试验,从实际使用的效果看,试验执行效率提高了69.9%,血样检测的准确率也达到了99.6%以上,因此,每台酶免仪每天可以多检测120个左右的血样,如果按照现在医院血液检测的指导价,每台酶免仪每年可为医院多创造150万人民币左右的利润。     

Improvisation of Node Mobility Using Cluster Routing-based Group Adaptive in MANET

In today's Internet routing infrastructure, designers have addressed scaling concerns in routing constrained multiobjective optimization problems examining latency and mobility concerns as a secondary constrain. In tactical Mobile Ad-hoc Network (MANET), hubs can function based on the work plan in various social affairs and the internally connected hubs are almost having the related moving standards where the topology between one and the other are tightly coupled in steady support by considering the touchstone of hubs such as a self-sorted out, self-mending and self-administration. Clustering in the routing process is one of the key aspects to increase MANET performance by coordinating the pathways using multiple criteria and analytics. We present a Group Adaptive Hybrid Routing Algorithm (GAHRA) for gathering portability, which pursues table-driven directing methodology in stable accumulations and on-request steering strategy for versatile situations. Based on this aspect, the research demonstrates an adjustable framework for commuting between the table-driven approach and the on-request approach, with the objectives of enhancing the output of MANET routing computation in each hub. Simulation analysis and replication results reveal that the proposed method is promising than a single well-known existing routing approach and is well-suited for sensitive MANET applications.     

Adaptive prescribed time control for quadrotor formation with stochastic links failure

The formation control for multiple quadrotors subject to maintaining the formation configuration and collision avoidance in the situation of stochastic links failure is investigated in this paper. First, the distributed formation controller is designed, the position controller is developed to manage the desired formation of position, and the attitude controller is developed to control the translation and rotation movements of the quadrotor. Then, in order to avoid the collisions between multiple quadrotors and the obstacles, a potential energy function method is introduced into the quadrotor formation control combined with the nest adaptive control. Inspired by the design of event trigger controller, a communication compensation controller is designed to ensure the stability of quadrotor formation under the condition of random communication interruption and recovery. Moreover, a prescribed time function is designed, which means the convergence time of the formation system can be set in advance. The prescribed time stability of the formation control system is proved by Lyapunov theory. Finally, the simulation results verify the effectiveness and superiority of this method.     

一种快速自适应谱估计算法

通过对梯度格型快速自适应算法的研究,结合最大熵谱外推目前存在的缺点,将梯度格型算法应用于最大熵谱外推中,并将其与伯格算法进行了比较。     

Approximate dynamic programming solutions with a single network adaptive critic for a class of nonlinear systems

Approximate dynamic programming (ADP) formulation implemented with an adaptive critic (AC)-based neural network (NN) structure has evolved as a powerful technique for solving the Hamilton-Jacobi-Bellman (HJB) equations. As interest in ADP and the AC solutions are escalating with time, there is a dire need to consider possible enabling factors for their implementations. A typical AC structure consists of two interacting NNs, which is computationally expensive. In this paper, a new architecture, called the ‘cost-function-based single network adaptive critic (J-SNAC)’ is presented, which eliminates one of the networks in a typical AC structure. This approach is applicable to a wide class of nonlinear systems in engineering. In order to demonstrate the benefits and the control synthesis with the J-SNAC, two problems have been solved with the AC and the J-SNAC approaches. Results are presented, which show savings of about 50% of the computational costs by J-SNAC while having the same accuracy levels of the dual network structure in solving for optimal control. Furthermore, convergence of the J-SNAC iterations, which reduces to a least-squares problem, is discussed; for linear systems, the iterative process is shown to reduce to solving the familiar algebraic Ricatti equation.     

An improved new error estimation algorithm for optimal filter lengths for stereophonic acoustic echo cancellation

In this paper, we propose an new error estimate algorithm (NEEA) for stereophonic acoustic echo cancellation (SAEC) that is based on the error estimation algorithm (EEA) in [Nguyen-Ky T, Leis J, Xiang W. An improved error estimate algorithm for stereophonic acoustic echo cancellation system. In: International conference on signal processing and communication systems, ICSPCS’2007, Australia; December 2007]. In the EEA and NEEA, with the minimum error signal fixed, we compute the filter lengths so that the error signal may approximate the minimum error signal. When the echo paths change, the adaptive filter automatically adjusts the filter lengths to the optimum values. We also investigate the difference between the adaptive filter lengths. In contrast with the conclusions in [Khong AWH, Naylor PA. Stereophonic acoustic echo cancellation employing selective-tap adaptive algorithms. IEEE Trans Audio, Speech, Lang Process 2006;14(3):785-96, Gansler T, Benesty J. Stereophonic acoustic echo cancellation and two channel adaptive filtering: an overview. Int J Adapt Control Signal Process 2000;4:565-86, Benesty J, Gansler T. A multichannel acoustic echo canceler double-talk detector based on a normalized cross-correlation matrix. Acoust Echo Noise Control 2002;13(2):95-101, Gansler T, Benesty J. A frequency-domain double-talk detector based on a normalized cross-correlation vector. Signal Process 2001;81:1783-7, Eneroth P, Gay SL, Gansler T, Benesty J. A real-time implementation of a stereophonic acoustic echo canceler. IEEE Trans. Speech Audio Process 2001;9(5):513-23, Gansler T, Benesty J. New insights into the stereophonic acoustic echo cancellation problem and an adaptive nonlinearity solution. IEEE Trans. Speech Audio Process 2002; 10(5):257-67, Benesty J, Gansler T, Morgan DR, Sondhi MM, Gay SL. Advances in network and acoustic echo cancellation. Berlin: Springer-Verlag; 2001], our simulation results have shown that the filter lengths can be different. Our simulation results also confirm that the NEEA is better than EEA and SM-NLMS algorithm in terms of echo return loss enhancement.     

Guiding students to the right questions: adaptive navigation support in an E‐Learning system for Java programming

Rapid growth of the volume of interactive questions available to the students of modern E‐Learning courses placed the problem of personalized guidance on the agenda of E‐Learning researchers. Without proper guidance, students frequently select too simple or too complicated problems and ended either bored or discouraged. This paper explores a specific personalized guidance technology known as adaptive navigation support. We developed JavaGuide, a system, which guides students to appropriate questions in a Java programming course, and investigated the effect of personalized guidance a three‐semester long classroom study. The results of this study confirm the educational and motivational effects of adaptive navigation support.     

ADAPTIVE RANKS CLONE AND k‐NEAREST NEIGHBOR LIST–BASED IMMUNE MULTI‐OBJECTIVE OPTIMIZATION

Artificial immune systems (AIS) are computational systems inspired by the principles and processes of the vertebrate immune system. The AIS‐based algorithms typically exploit the immune system's characteristics of learning and adaptability to solve some complicated problems. Although, several AIS‐based algorithms have proposed to solve multi‐objective optimization problems (MOPs), little focus have been placed on the issues that adaptively use the online discovered solutions. Here, we proposed an adaptive selection scheme and an adaptive ranks clone scheme by the online discovered solutions in different ranks. Accordingly, the dynamic information of the online antibody population is efficiently exploited, which is beneficial to the search process. Furthermore, it has been widely approved that one‐off deletion could not obtain excellent diversity in the final population; therefore, a k‐nearest neighbor list (where k is the number of objectives) is established and maintained to eliminate the solutions in the archive population. The k‐nearest neighbors of each antibody are founded and stored in a list memory. Once an antibody with minimal product of k‐nearest neighbors is deleted, the neighborhood relations of the remaining antibodies in the list memory are updated. Finally, the proposed algorithm is tested on 10 well‐known and frequently used multi‐objective problems and two many‐objective problems with 4, 6, and 8 objectives. Compared with five other state‐of‐the‐art multi‐objective algorithms, namely NSGA‐II, SPEA2, IBEA, HYPE, and NNIA, our method achieves comparable results in terms of convergence, diversity metrics, and computational time.     

The generalized assortment and best cutting stock length problems

This paper introduces two new one-dimensional cutting stock models: the generalized assortment problem (GAP) and the best cutting stock length (BSL) problem. These new models provide the potential to reduce waste to values lower than the optimum of current models, under the right management circumstances. In the GAP, management has a standard length and can select one or more of any additional custom stock lengths, and management wishes to minimize cutting stock waste. This model is different from existing models that assume that the selection is from a small fixed set of stock lengths. In the BSL problem, management chooses any number of custom stock lengths, but wishes to find the fewest custom stock lengths in order to have zero waste. Results show waste reductions of 80% with just one custom stock length compared with solutions from standard cutting stock formulations, when item lengths are long relative to the stock length. The models are most effective when the item lengths are nearly as long as the stock length. Solutions from the model have been implemented for a manufacturer. The model is easily generalized to allow multiple existing stock lengths and different costs.     

Structure damage diagnosis using neural network and feature fusion

A structure damage diagnosis method combining the wavelet packet decomposition, multi-sensor feature fusion theory and neural network pattern classification was presented. Firstly, vibration signals gathered from sensors were decomposed using orthogonal wavelet. Secondly, the relative energy of decomposed frequency band was calculated. Thirdly, the input feature vectors of neural network classifier were built by fusing wavelet packet relative energy distribution of these sensors. Finally, with the trained classifier, damage diagnosis and assessment was realized. The result indicates that, a much more precise and reliable diagnosis information is obtained and the diagnosis accuracy is improved as well.