Gait Pattern Adaptation for an Active Lower-Limb Orthosis Based on Neural Networks

This work deals with neural network (NN)-based gait pattern adaptation algorithms for an active lower-limb orthosis. Stable trajectories with different walking speeds are generated during an optimization process considering the zero-moment point (ZMP) criterion and the inverse dynamic of the orthosis-patient model. Additionally, a set of NNs is used to decrease the time-consuming analytical computation of the model and ZMP. The first NN approximates the inverse dynamics including the ZMP computation, while the second NN works in the optimization procedure, giving an adapted desired trajectory according to orthosis-patient interaction. This trajectory adaptation is added directly to the trajectory generator, also reproduced by a set of NNs. With this strategy, it is possible to adapt the trajectory during the walking cycle in an on-line procedure, instead of changing the trajectory parameter after each step. The dynamic model of the actual exoskeleton, with interaction forces included, is used to generate simulation results. Also, an experimental test is performed with an active ankle-foot orthosis, where the dynamic variables of this joint are replaced in the simulator by actual values provided by the device. It is shown that the final adapted trajectory follows the patient intention of increasing the walking speed, so changing the gait pattern. (C) Koninklijke Brill NV, Leiden, 2011

A hybrid Particle Swarm Optimization - Simplex algorithm (PSOS) for structural damage identification

This study proposes a new PSOS-model based damage identification procedure using frequency domain data. The formulation of the objective function for the minimization problem is based on the Frequency Response Functions (FRFs) of the system. A novel strategy for the control of the Particle Swarm Optimization (PSO) parameters based on the Nelder-Mead algorithm (Simplex method) is presented; consequently, the convergence of the PSOS becomes independent of the heuristic constants and its stability and confidence are enhanced. The formulated hybrid method performs better in different benchmark functions than the Simulated Annealing (SA) and the basic PSO (PSO(b)). Two damage identification problems, taking into consideration the effects of noisy and incomplete data, were studied: first, a 10-bar truss and second, a cracked free-free beam, both modeled with finite elements. In these cases, the damage location and extent were successfully determined. Finally, a non-linear oscillator (Duffing oscillator) was identified by PSOS providing good results. (C) 2009 Elsevier Ltd. All rights reserved

Robust Control of Flight Simulator Motion Base

The purpose of this study is to apply robust inverse dynamics control for a six-degree-of-freedom flight simulator motion system. From an implementation viewpoint, simplification of the inverse dynamics control law is introduced by assuming control law matrices as constants. The robust control strategy is applied in the outer loop of the inverse dynamic control to counteract the effects of imperfect compensation due this simplification. The control strategy is designed using the Lyapunov stability theory. Forward and inverse kinematics and a full dynamic model of a six-degree-of-freedom motion base driven by electromechanical actuators are briefly presented. A describing function, acceleration step response and some maneuvers computed from the washout filter were used to evaluate the performance of the controllers.

Hybrid Algorithms for Routing and Assignment Wavelengths in Optical Networks

This paper presents a strategy for the solution of the WDM optical networks planning. Specifically, the problem of Routing and Wavelength Allocation (RWA) in order to minimize the amount of wavelengths used. In this case, the problem is known as the Min-RWA. Two meta-heuristics (Tabu Search and Simulated Annealing) are applied to take solutions of good quality and high performance. The key point is the degradation of the maximum load on the virtual links in favor of minimization of number of wavelengths used; the objective is to find a good compromise between the metrics of virtual topology (load in Gb/s) and of the physical topology (quantity of wavelengths). The simulations suggest good results when compared to some existing in the literature.

Information Filtering and Array Algorithms for Discrete-Time Markovian Jump Linear Systems

This technical note develops information filter and array algorithms for a linear minimum mean square error estimator of discrete-time Markovian jump linear systems. A numerical example for a two-mode Markovian jump linear system, to show the advantage of using array algorithms to filter this class of systems, is provided.

Wavelet-Galerkin method for one-dimensional elastoplasticity and damage problems: Constitutive modeling and computational aspects

This work presents an analysis of the wavelet-Galerkin method for one-dimensional elastoplastic-damage problems. Time-stepping algorithm for non-linear dynamics is presented. Numerical treatment of the constitutive models is developed by the use of return-mapping algorithm. For spacial discretization we can use wavelet-Galerkin method instead of standard finite element method. This approach allows to locate singularities. The discrete formulation developed can be applied to the simulation of one-dimensional problems for elastic-plastic-damage models. (C) 2007 Elsevier Inc. All rights reserved.

A Taxonomy for Locality Algorithms on Peer-to-Peer Networks

The continuous growth of peer-to-peer networks has made them responsible for a considerable portion of the current Internet traffic. For this reason, improvements in P2P network resources usage are of central importance. One effective approach for addressing this issue is the deployment of locality algorithms, which allow the system to optimize the peers` selection policy for different network situations and, thus, maximize performance. To date, several locality algorithms have been proposed for use in P2P networks. However, they usually adopt heterogeneous criteria for measuring the proximity between peers, which hinders a coherent comparison between the different solutions. In this paper, we develop a thoroughly review of popular locality algorithms, based on three main characteristics: the adopted network architecture, distance metric, and resulting peer selection algorithm. As result of this study, we propose a novel and generic taxonomy for locality algorithms in peer-to-peer networks, aiming to enable a better and more coherent evaluation of any individual locality algorithm.

Reconfiguration of distribution networks to minimize loss and disruption costs using genetic algorithms

In this paper a computational implementation of an evolutionary algorithm (EA) is shown in order to tackle the problem of reconfiguring radial distribution systems. The developed module considers power quality indices such as long duration interruptions and customer process disruptions due to voltage sags, by using the Monte Carlo simulation method. Power quality costs are modeled into the mathematical problem formulation, which are added to the cost of network losses. As for the EA codification proposed, a decimal representation is used. The EA operators, namely selection, recombination and mutation, which are considered for the reconfiguration algorithm, are herein analyzed. A number of selection procedures are analyzed, namely tournament, elitism and a mixed technique using both elitism and tournament. The recombination operator was developed by considering a chromosome structure representation that maps the network branches and system radiality, and another structure that takes into account the network topology and feasibility of network operation to exchange genetic material. The topologies regarding the initial population are randomly produced so as radial configurations are produced through the Prim and Kruskal algorithms that rapidly build minimum spanning trees. (C) 2009 Elsevier B.V. All rights reserved.

A ductile damage criterion at various stress triaxialities

The paper discusses the effect of stress triaxiality on the onset and evolution of damage in ductile metals. A series of tests including shear tests and experiments oil smooth and pre-notched tension specimens wits carried Out for it wide range of stress triaxialities. The underlying continuum damage model is based oil kinematic definition of damage tensors. The modular structure of the approach is accomplished by the decomposition of strain rates into elastic, plastic and damage parts. Free energy functions with respect to fictitious undamaged configurations as well as damaged ones are introduced separately leading to elastic material laws which are affected by increasing damage. In addition, a macroscopic yield condition and a flow rule are used to adequately describe the plastic behavior. Numerical simulations of the experiments are performed and good correlation of tests and numerical results is achieved. Based oil experimental and numerical data the damage criterion formulated in stress space is quantified. Different branches of this function are taken into account corresponding to different damage modes depending oil stress triaxiality and Lode parameter. In addition, identification of material parameters is discussed ill detail. (C) 2007 Elsevier Ltd. All rights reserved.

Approximate algorithms for credal networks with binary variables

This paper presents a family of algorithms for approximate inference in credal networks (that is, models based on directed acyclic graphs and set-valued probabilities) that contain only binary variables. Such networks can represent incomplete or vague beliefs, lack of data, and disagreements among experts; they can also encode models based on belief functions and possibilistic measures. All algorithms for approximate inference in this paper rely on exact inferences in credal networks based on polytrees with binary variables, as these inferences have polynomial complexity. We are inspired by approximate algorithms for Bayesian networks; thus the Loopy 2U algorithm resembles Loopy Belief Propagation, while the Iterated Partial Evaluation and Structured Variational 2U algorithms are, respectively, based on Localized Partial Evaluation and variational techniques. (C) 2007 Elsevier Inc. All rights reserved.

Mesoscale plasticity anisotropy at the earliest stages of cavitation-erosion damage of a high nitrogen austenitic stainless steel

A high nitrogen austenitic stainless steel (0.9wt% N) and an ordinary 304 austenitic stainless steel were submitted to cavitation-erosion tests in a vibratory apparatus operating at a frequency of 20 kHz. The high nitrogen stainless steel was obtained by high temperature gas nitriding a 1-mm thick strip of an UNS 31803 duplex stainless steel. The 304 austenitic stainless steel was used for comparison purposes. The specimens were characterized by scanning electron microscopy and Electron Back Scatter Diffraction. The surface of the cavitation damaged specimens was analyzed trying to find out the regions where cavitation damage occurred preferentially. The distribution of sites where cavitation inception occurred was extremely heterogeneous, concentrating basically at (i) slip lines inside some grains and (ii) Sigma-3 coincidence site lattice (CSL) boundaries (twin boundaries). Furthermore, it was observed that the CE damage spread faster inside those grains which were more susceptible to damage incubation. The damage heterogeneity was addressed to plasticity anisotropy. Grains in which the crystallographic orientation leads to high resolved shear stress show intense damage at slip lines. Grain boundaries between grains with large differences in resolved shear stress where also intensely damaged. The relationship between crystallite orientation distributions, plasticity anisotropy and CE damage mechanisms are discussed. (C) 2009 Elsevier B.V. All rights reserved.

Cardiovascular Simulator Improvement: Pressure Versus Volume Loop Assessment

This article presents improvement on a physical cardiovascular simulator (PCS) system. Intraventricular pressure versus intraventricular volume (PxV) loop was obtained to evaluate performance of a pulsatile chamber mimicking the human left ventricle. PxV loop shows heart contractility and is normally used to evaluate heart performance. In many heart diseases, the stroke volume decreases because of low heart contractility. This pathological situation must be simulated by the PCS in order to evaluate the assistance provided by a ventricular assist device (VAD). The PCS system is automatically controlled by a computer and is an auxiliary tool for VAD control strategies development. This PCS system is according to a Windkessel model where lumped parameters are used for cardiovascular system analysis. Peripheral resistance, arteries compliance, and fluid inertance are simulated. The simulator has an actuator with a roller screw and brushless direct current motor, and the stroke volume is regulated by the actuator displacement. Internal pressure and volume measurements are monitored to obtain the PxV loop. Left chamber internal pressure is directly obtained by pressure transducer; however, internal volume has been obtained indirectly by using a linear variable differential transformer, which senses the diaphragm displacement. Correlations between the internal volume and diaphragm position are made. LabVIEW integrates these signals and shows the pressure versus internal volume loop. The results that have been obtained from the PCS system show PxV loops at different ventricle elastances, making possible the simulation of pathological situations. A preliminary test with a pulsatile VAD attached to PCS system was made.

Some heuristic algorithms for total tardiness minimization in a flowshop with blocking

The flowshop scheduling problem with blocking in-process is addressed in this paper. In this environment, there are no buffers between successive machines: therefore intermediate queues of jobs waiting in the system for their next operations are not allowed. Heuristic approaches are proposed to minimize the total tardiness criterion. A constructive heuristic that explores specific characteristics of the problem is presented. Moreover, a GRASP-based heuristic is proposed and Coupled with a path relinking strategy to search for better outcomes. Computational tests are presented and the comparisons made with an adaptation of the NEH algorithm and with a branch-and-bound algorithm indicate that the new approaches are promising. (c) 2007 Elsevier Ltd. All rights reserved.

Evaluation of damage caused on Coffea arabica by a population of Pratylenchus coffeae considered non-pathogenic on coffee

Evaluation of damage caused on Coffea arabica by a population of Pratylenchus coffeae considered non-pathogenic on coffee Two greenhouse experiments were carried out in order to evaluate the damage caused on Arabica coffee (Coffea arabica) by an M(2) population of Pratylenchus coffeae, apparently non-pathogenic to coffee. Experiment 1, with `Catua Vermelho` coffee at stage of two leaf pairs and with the initial nematode densities (Pi) of 0; 333; 1,000; 3.000; and 9,000 per plant, demonstrated that M(2) can damage young coffee plants, although it is unable to reproduce on coffee roots. Experiment 2, with the same coffee cultivar and nematode densities, but with plants at stage of six leaf pairs, showed that the M2 population was unable to cause damage. Therefore, it was established that M(2) is a population of P. coffeae without reproduction on Arabica coffee, which causes damage only in the first generation on young coffee below stages of six leaf pairs.