质量交换网络集成的状态空间法

State space approach is an effective method to mass-exchange network (MEN) synthesis. By decomposing the network into two interactive parts, a distribution network and a process operator, the synthesis problem can be formulated into a mixed integer nonlinear programming (MINLP) model. In this article, a generalized state space model based on typical MEN is established and verified in two cases. A new asymmetrical operator and cost index are also adopted to speed up the solution process. The results demonstrate the efficiency of the proposed approach.     

Large deformation and ultimate properties of biopolymer gels: 2. Mixed gel systems

Biphasic, mixed gels of agarose and gelatin were prepared, and their mechanical behaviour in tensile tests was determined, up to failure, utilising four decades of (constant) strain rate. The behaviour of pure agarose and pure gelatin in such tests has been determined previously. Suitable ‘blending-laws’ relating the small deformation shear modulus of the composite to the moduli of the component phases have also been discussed elsewhere. This report extends the latter treatment to the more aggressive large deformation regime, deriving bounds for modulus and break stress which closely model observed behaviour.     

Multirate control with incomplete information over Profibus-DP network

When a process field bus-decentralized peripherals (Profibus-DP) network is used in an industrial environment, a deterministic behaviour is usually claimed. However, due to some concerns such as bandwidth limitations, lack of synchronisation among different clocks and existence of time-varying delays, a more complex problem must be faced. This problem implies the transmission of irregular and, even, random sequences of incomplete information. The main consequence of this issue is the appearance of different sampling periods at different network devices. In this paper, this aspect is checked by means of a detailed Profibus-DP timescale study. In addition, in order to deal with the different periods, a delay-dependent dual-rate proportional-integral-derivative control is introduced. Stability for the proposed control system is analysed in terms of linear matrix inequalities.     

Performance evaluation of an importance sampling technique in a Jackson network

Importance sampling is a technique that is commonly used to speed up Monte Carlo simulation of rare events. However, little is known regarding the design of efficient importance sampling algorithms in the context of queueing networks. The standard approach, which simulates the system using an a priori fixed change of measure suggested by large deviation analysis, has been shown to fail in even the simplest network settings. Estimating probabilities associated with rare events has been a topic of great importance in queueing theory, and in applied probability at large. In this article, we analyse the performance of an importance sampling estimator for a rare event probability in a Jackson network. This article carries out strict deadlines to a two-node Jackson network with feedback whose arrival and service rates are modulated by an exogenous finite state Markov process. We have estimated the probability of network blocking for various sets of parameters, and also the probability of missing the deadline of customers for different loads and deadlines. We have finally shown that the probability of total population overflow may be affected by various deadline values, service rates and arrival rates.     

Finite horizon optimal control of non-linear discrete-time switched systems using adaptive dynamic programming with ε-error bound

In this paper, we aim to solve the finite-horizon optimal control problem for a class of non-linear discrete-time switched systems using adaptive dynamic programming(ADP) algorithm. A new ε-optimal control scheme based on the iterative ADP algorithm is presented which makes the value function converge iteratively to the greatest lower bound of all value function indices within an error according to ε within finite time. Two neural networks are used as parametric structures to implement the iterative ADP algorithm with ε-error bound, which aim at approximating the value function and the control policy, respectively. And then, the optimal control policy is obtained. Finally, a simulation example is included to illustrate the applicability of the proposed method.     

A fuzzy neural network approach for online fault detection in waste water treatment process

In this paper, an effective strategy for fault detection of sludge volume index (SVI) sensor is proposed and tested on an experimental hardware setup in waste water treatment process (WWTP). The main objective of this fault detection strategy is to design a system which consists of the online sensors, the SVI predicting plant and fault diagnosis method. The SVI predicting plant is designed utilizing a fuzzy neural network (FNN), which is trained by a historical set of data collected during fault-free operation of WWTP. The fault diagnosis method, based on the difference between the measured concentration values and FNN predictions, allows a quick revealing of the faults. Then this proposed fault detection method is applied to a real WWTP and compared with other approaches. Experimental results show that the proposed fault detection strategy can obtain the fault signals of the SVI sensor online.     

Price-based congestion control and local channel-link assignment for multi-radio wireless mesh networks

In multi-radio multi-channel wireless mesh networks, engineering the network capacity requires a complex cross-layer design. In this paper, in order to make the complex problem implementable in a distributed manner, we make a decoupling approach that breaks down the entire design space into routing and initial channel assignment, and distributed congestion control and local channel reassignment. We propose a unified priced-based framework for distributed congestion control and localized channel-link assignment algorithms. We demonstrate the convergence of the proposed algorithms with respect to different fairness objectives (i.e., proportional fairness and max–min fairness) via simulation on both grid and random topologies. The proposed algorithms achieve faster convergence with less overhead in the control and forwarding plane than previous multi-path based algorithms.     

Adaptive recurrent neural network control of uncertain constrained nonholonomic mobile manipulators

In this article, motion/force control problem of a class of constrained mobile manipulators with unknown dynamics is considered. The system is subject to both holonomic and nonholonomic constraints. An adaptive recurrent neural network controller is proposed to deal with the unmodelled system dynamics. The proposed control strategy guarantees that the system motion asymptotically converges to the desired manifold while the constraint force remains bounded. In addition, an adaptive method is proposed to identify the contact surface. Simulation studies are carried out to verify the validation of the proposed approach.     

The C-loss function for pattern classification

This paper presents a new loss function for neural network classification, inspired by the recently proposed similarity measure called Correntropy. We show that this function essentially behaves like the conventional square loss for samples that are well within the decision boundary and have small errors, and L₀ or counting norm for samples that are outliers or are difficult to classify. Depending on the value of the kernel size parameter, the proposed loss function moves smoothly from convex to non-convex and becomes a close approximation to the misclassification loss (ideal 0–1 loss). We show that the discriminant function obtained by optimizing the proposed loss function in the neighborhood of the ideal 0–1 loss function to train a neural network is immune to overfitting, more robust to outliers, and has consistent and better generalization performance as compared to other commonly used loss functions, even after prolonged training. The results also show that it is a close competitor to the SVM. Since the proposed method is compatible with simple gradient based online learning, it is a practical way of improving the performance of neural network classifiers.     

Towards subject independent continuous sign language recognition: A segment and merge approach

This paper presents a segment-based probabilistic approach to robustly recognize continuous sign language sentences. The recognition strategy is based on a two-layer conditional random field (CRF) model, where the lower layer processes the component channels and provides outputs to the upper layer for sign recognition. The continuously signed sentences are first segmented, and the sub-segments are labeled SIGN or ME (movement epenthesis) by a Bayesian network (BN) which fuses the outputs of independent CRF and support vector machine (SVM) classifiers. The sub-segments labeled as ME are discarded and the remaining SIGN sub-segments are merged and recognized by the two-layer CRF classifier; for this we have proposed a new algorithm based on the semi-Markov CRF decoding scheme. With eight signers, we obtained a recall rate of 95.7% and a precision of 96.6% for unseen samples from seen signers, and a recall rate of 86.6% and a precision of 89.9% for unseen signers.