Multiscale computations with a wavelet-adaptive algorithm

NASA Astrophysics Data System (ADS)

Rastigejev, Yevgenii Anatolyevich

A wavelet-based adaptive multiresolution algorithm for the numerical solution of multiscale problems governed by partial differential equations is introduced. The main features of the method include fast algorithms for the calculation of wavelet coefficients and approximation of derivatives on nonuniform stencils. The connection between the wavelet order and the size of the stencil is established. The algorithm is based on the mathematically well established wavelet theory. This allows us to provide error estimates of the solution which are used in conjunction with an appropriate threshold criteria to adapt the collocation grid. The efficient data structures for grid representation as well as related computational algorithms to support grid rearrangement procedure are developed. The algorithm is applied to the simulation of phenomena described by Navier-Stokes equations. First, we undertake the study of the ignition and subsequent viscous detonation of a H2 : O2 : Ar mixture in a one-dimensional shock tube. Subsequently, we apply the algorithm to solve the two- and three-dimensional benchmark problem of incompressible flow in a lid-driven cavity at large Reynolds numbers. For these cases we show that solutions of comparable accuracy as the benchmarks are obtained with more than an order of magnitude reduction in degrees of freedom. The simulations show the striking ability of the algorithm to adapt to a solution having different scales at different spatial locations so as to produce accurate results at a relatively low computational cost.

Star adaptation for two-algorithms used on serial computers

NASA Technical Reports Server (NTRS)

Howser, L. M.; Lambiotte, J. J., Jr.

1974-01-01

Two representative algorithms used on a serial computer and presently executed on the Control Data Corporation 6000 computer were adapted to execute efficiently on the Control Data STAR-100 computer. Gaussian elimination for the solution of simultaneous linear equations and the Gauss-Legendre quadrature formula for the approximation of an integral are the two algorithms discussed. A description is given of how the programs were adapted for STAR and why these adaptations were necessary to obtain an efficient STAR program. Some points to consider when adapting an algorithm for STAR are discussed. Program listings of the 6000 version coded in 6000 FORTRAN, the adapted STAR version coded in 6000 FORTRAN, and the STAR version coded in STAR FORTRAN are presented in the appendices.

Adaptive algorithm of magnetic heading detection

NASA Astrophysics Data System (ADS)

Liu, Gong-Xu; Shi, Ling-Feng

2017-11-01

Magnetic data obtained from a magnetic sensor usually fluctuate in a certain range, which makes it difficult to estimate the magnetic heading accurately. In fact, magnetic heading information is usually submerged in noise because of all kinds of electromagnetic interference and the diversity of the pedestrian’s motion states. In order to solve this problem, a new adaptive algorithm based on the (typically) right-angled corridors of a building or residential buildings is put forward to process heading information. First, a 3D indoor localization platform is set up based on MPU9250. Then, several groups of data are measured by changing the experimental environment and pedestrian’s motion pace. The raw data from the attached inertial measurement unit are calibrated and arranged into a time-stamped array and written to a data file. Later, the data file is imported into MATLAB for processing and analysis using the proposed adaptive algorithm. Finally, the algorithm is verified by comparison with the existing algorithm. The experimental results show that the algorithm has strong robustness and good fault tolerance, which can detect the heading information accurately and in real-time.

Training product unit neural networks with genetic algorithms

NASA Technical Reports Server (NTRS)

Janson, D. J.; Frenzel, J. F.; Thelen, D. C.

1991-01-01

The training of product neural networks using genetic algorithms is discussed. Two unusual neural network techniques are combined; product units are employed instead of the traditional summing units and genetic algorithms train the network rather than backpropagation. As an example, a neural netork is trained to calculate the optimum width of transistors in a CMOS switch. It is shown how local minima affect the performance of a genetic algorithm, and one method of overcoming this is presented.

Method and system for training dynamic nonlinear adaptive filters which have embedded memory

NASA Technical Reports Server (NTRS)

Rabinowitz, Matthew (Inventor)

2002-01-01

Described herein is a method and system for training nonlinear adaptive filters (or neural networks) which have embedded memory. Such memory can arise in a multi-layer finite impulse response (FIR) architecture, or an infinite impulse response (IIR) architecture. We focus on filter architectures with separate linear dynamic components and static nonlinear components. Such filters can be structured so as to restrict their degrees of computational freedom based on a priori knowledge about the dynamic operation to be emulated. The method is detailed for an FIR architecture which consists of linear FIR filters together with nonlinear generalized single layer subnets. For the IIR case, we extend the methodology to a general nonlinear architecture which uses feedback. For these dynamic architectures, we describe how one can apply optimization techniques which make updates closer to the Newton direction than those of a steepest descent method, such as backpropagation. We detail a novel adaptive modified Gauss-Newton optimization technique, which uses an adaptive learning rate to determine both the magnitude and direction of update steps. For a wide range of adaptive filtering applications, the new training algorithm converges faster and to a smaller value of cost than both steepest-descent methods such as backpropagation-through-time, and standard quasi-Newton methods. We apply the algorithm to modeling the inverse of a nonlinear dynamic tracking system 5, as well as a nonlinear amplifier 6.

Multi-element array signal reconstruction with adaptive least-squares algorithms

NASA Technical Reports Server (NTRS)

Kumar, R.

1992-01-01

Two versions of the adaptive least-squares algorithm are presented for combining signals from multiple feeds placed in the focal plane of a mechanical antenna whose reflector surface is distorted due to various deformations. Coherent signal combining techniques based on the adaptive least-squares algorithm are examined for nearly optimally and adaptively combining the outputs of the feeds. The performance of the two versions is evaluated by simulations. It is demonstrated for the example considered that both of the adaptive least-squares algorithms are capable of offsetting most of the loss in the antenna gain incurred due to reflector surface deformations.

Genetic algorithm based adaptive neural network ensemble and its application in predicting carbon flux

USGS Publications Warehouse

Xue, Y.; Liu, S.; Hu, Y.; Yang, J.; Chen, Q.

2007-01-01

To improve the accuracy in prediction, Genetic Algorithm based Adaptive Neural Network Ensemble (GA-ANNE) is presented. Intersections are allowed between different training sets based on the fuzzy clustering analysis, which ensures the diversity as well as the accuracy of individual Neural Networks (NNs). Moreover, to improve the accuracy of the adaptive weights of individual NNs, GA is used to optimize the cluster centers. Empirical results in predicting carbon flux of Duke Forest reveal that GA-ANNE can predict the carbon flux more accurately than Radial Basis Function Neural Network (RBFNN), Bagging NN ensemble, and ANNE. ?? 2007 IEEE.

AMOBH: Adaptive Multiobjective Black Hole Algorithm.

PubMed

Wu, Chong; Wu, Tao; Fu, Kaiyuan; Zhu, Yuan; Li, Yongbo; He, Wangyong; Tang, Shengwen

2017-01-01

This paper proposes a new multiobjective evolutionary algorithm based on the black hole algorithm with a new individual density assessment (cell density), called "adaptive multiobjective black hole algorithm" (AMOBH). Cell density has the characteristics of low computational complexity and maintains a good balance of convergence and diversity of the Pareto front. The framework of AMOBH can be divided into three steps. Firstly, the Pareto front is mapped to a new objective space called parallel cell coordinate system. Then, to adjust the evolutionary strategies adaptively, Shannon entropy is employed to estimate the evolution status. At last, the cell density is combined with a dominance strength assessment called cell dominance to evaluate the fitness of solutions. Compared with the state-of-the-art methods SPEA-II, PESA-II, NSGA-II, and MOEA/D, experimental results show that AMOBH has a good performance in terms of convergence rate, population diversity, population convergence, subpopulation obtention of different Pareto regions, and time complexity to the latter in most cases.

Adaptive Two Dimensional RLS (Recursive Least Squares) Algorithms

DTIC Science & Technology

1989-03-01

in Monterey wonderful. IX I. INTRODUCTION Adaptive algorithms have been used successfully for many years in a wide range of digital signal...SIMULATION RESULTS The 2-D FRLS algorithm was tested both on computer-generated data and on digitized images. For a baseline reference the 2-D L:rv1S...Alexander, S. T. Adaptivt Signal Processing: Theory and Applications. Springer- Verlag, New York. 1986. 7. Bellanger, Maurice G. Adaptive Digital

An adaptive inverse kinematics algorithm for robot manipulators

NASA Technical Reports Server (NTRS)

Colbaugh, R.; Glass, K.; Seraji, H.

1990-01-01

An adaptive algorithm for solving the inverse kinematics problem for robot manipulators is presented. The algorithm is derived using model reference adaptive control (MRAC) theory and is computationally efficient for online applications. The scheme requires no a priori knowledge of the kinematics of the robot if Cartesian end-effector sensing is available, and it requires knowledge of only the forward kinematics if joint position sensing is used. Computer simulation results are given for the redundant seven-DOF robotics research arm, demonstrating that the proposed algorithm yields accurate joint angle trajectories for a given end-effector position/orientation trajectory.

Training Feedforward Neural Networks Using Symbiotic Organisms Search Algorithm.

PubMed

Wu, Haizhou; Zhou, Yongquan; Luo, Qifang; Basset, Mohamed Abdel

2016-01-01

Symbiotic organisms search (SOS) is a new robust and powerful metaheuristic algorithm, which stimulates the symbiotic interaction strategies adopted by organisms to survive and propagate in the ecosystem. In the supervised learning area, it is a challenging task to present a satisfactory and efficient training algorithm for feedforward neural networks (FNNs). In this paper, SOS is employed as a new method for training FNNs. To investigate the performance of the aforementioned method, eight different datasets selected from the UCI machine learning repository are employed for experiment and the results are compared among seven metaheuristic algorithms. The results show that SOS performs better than other algorithms for training FNNs in terms of converging speed. It is also proven that an FNN trained by the method of SOS has better accuracy than most algorithms compared.

Training Feedforward Neural Networks Using Symbiotic Organisms Search Algorithm

PubMed Central

Wu, Haizhou; Luo, Qifang

2016-01-01

Symbiotic organisms search (SOS) is a new robust and powerful metaheuristic algorithm, which stimulates the symbiotic interaction strategies adopted by organisms to survive and propagate in the ecosystem. In the supervised learning area, it is a challenging task to present a satisfactory and efficient training algorithm for feedforward neural networks (FNNs). In this paper, SOS is employed as a new method for training FNNs. To investigate the performance of the aforementioned method, eight different datasets selected from the UCI machine learning repository are employed for experiment and the results are compared among seven metaheuristic algorithms. The results show that SOS performs better than other algorithms for training FNNs in terms of converging speed. It is also proven that an FNN trained by the method of SOS has better accuracy than most algorithms compared. PMID:28105044

A parallel adaptive mesh refinement algorithm

NASA Technical Reports Server (NTRS)

Quirk, James J.; Hanebutte, Ulf R.

1993-01-01

Over recent years, Adaptive Mesh Refinement (AMR) algorithms which dynamically match the local resolution of the computational grid to the numerical solution being sought have emerged as powerful tools for solving problems that contain disparate length and time scales. In particular, several workers have demonstrated the effectiveness of employing an adaptive, block-structured hierarchical grid system for simulations of complex shock wave phenomena. Unfortunately, from the parallel algorithm developer's viewpoint, this class of scheme is quite involved; these schemes cannot be distilled down to a small kernel upon which various parallelizing strategies may be tested. However, because of their block-structured nature such schemes are inherently parallel, so all is not lost. In this paper we describe the method by which Quirk's AMR algorithm has been parallelized. This method is built upon just a few simple message passing routines and so it may be implemented across a broad class of MIMD machines. Moreover, the method of parallelization is such that the original serial code is left virtually intact, and so we are left with just a single product to support. The importance of this fact should not be underestimated given the size and complexity of the original algorithm.

Genetic algorithms in adaptive fuzzy control

NASA Technical Reports Server (NTRS)

Karr, C. Lucas; Harper, Tony R.

1992-01-01

Researchers at the U.S. Bureau of Mines have developed adaptive process control systems in which genetic algorithms (GA's) are used to augment fuzzy logic controllers (FLC's). GA's are search algorithms that rapidly locate near-optimum solutions to a wide spectrum of problems by modeling the search procedures of natural genetics. FLC's are rule based systems that efficiently manipulate a problem environment by modeling the 'rule-of-thumb' strategy used in human decision making. Together, GA's and FLC's possess the capabilities necessary to produce powerful, efficient, and robust adaptive control systems. To perform efficiently, such control systems require a control element to manipulate the problem environment, an analysis element to recognize changes in the problem environment, and a learning element to adjust fuzzy membership functions in response to the changes in the problem environment. Details of an overall adaptive control system are discussed. A specific computer-simulated chemical system is used to demonstrate the ideas presented.

Adaptive protection algorithm and system

DOEpatents

Hedrick, Paul [Pittsburgh, PA; Toms, Helen L [Irwin, PA; Miller, Roger M [Mars, PA

2009-04-28

An adaptive protection algorithm and system for protecting electrical distribution systems traces the flow of power through a distribution system, assigns a value (or rank) to each circuit breaker in the system and then determines the appropriate trip set points based on the assigned rank.

A Self Adaptive Differential Evolution Algorithm for Global Optimization

NASA Astrophysics Data System (ADS)

Kumar, Pravesh; Pant, Millie

This paper presents a new Differential Evolution algorithm based on hybridization of adaptive control parameters and trigonometric mutation. First we propose a self adaptive DE named ADE where choice of control parameter F and Cr is not fixed at some constant value but is taken iteratively. The proposed algorithm is further modified by applying trigonometric mutation in it and the corresponding algorithm is named as ATDE. The performance of ATDE is evaluated on the set of 8 benchmark functions and the results are compared with the classical DE algorithm in terms of average fitness function value, number of function evaluations, convergence time and success rate. The numerical result shows the competence of the proposed algorithm.

An Adaptive Tradeoff Algorithm for Multi-issue SLA Negotiation

NASA Astrophysics Data System (ADS)

Son, Seokho; Sim, Kwang Mong

Since participants in a Cloud may be independent bodies, mechanisms are necessary for resolving different preferences in leasing Cloud services. Whereas there are currently mechanisms that support service-level agreement negotiation, there is little or no negotiation support for concurrent price and timeslot for Cloud service reservations. For the concurrent price and timeslot negotiation, a tradeoff algorithm to generate and evaluate a proposal which consists of price and timeslot proposal is necessary. The contribution of this work is thus to design an adaptive tradeoff algorithm for multi-issue negotiation mechanism. The tradeoff algorithm referred to as "adaptive burst mode" is especially designed to increase negotiation speed and total utility and to reduce computational load by adaptively generating concurrent set of proposals. The empirical results obtained from simulations carried out using a testbed suggest that due to the concurrent price and timeslot negotiation mechanism with adaptive tradeoff algorithm: 1) both agents achieve the best performance in terms of negotiation speed and utility; 2) the number of evaluations of each proposal is comparatively lower than previous scheme (burst-N).

Properties of an adaptive feedback equalization algorithm.

PubMed

Engebretson, A M; French-St George, M

1993-01-01

This paper describes a new approach to feedback equalization for hearing aids. The method involves the use of an adaptive algorithm that estimates and tracks the characteristic of the hearing aid feedback path. The algorithm is described and the results of simulation studies and bench testing are presented.

Novel maximum-margin training algorithms for supervised neural networks.

PubMed

Ludwig, Oswaldo; Nunes, Urbano

2010-06-01

This paper proposes three novel training methods, two of them based on the backpropagation approach and a third one based on information theory for multilayer perceptron (MLP) binary classifiers. Both backpropagation methods are based on the maximal-margin (MM) principle. The first one, based on the gradient descent with adaptive learning rate algorithm (GDX) and named maximum-margin GDX (MMGDX), directly increases the margin of the MLP output-layer hyperplane. The proposed method jointly optimizes both MLP layers in a single process, backpropagating the gradient of an MM-based objective function, through the output and hidden layers, in order to create a hidden-layer space that enables a higher margin for the output-layer hyperplane, avoiding the testing of many arbitrary kernels, as occurs in case of support vector machine (SVM) training. The proposed MM-based objective function aims to stretch out the margin to its limit. An objective function based on Lp-norm is also proposed in order to take into account the idea of support vectors, however, overcoming the complexity involved in solving a constrained optimization problem, usually in SVM training. In fact, all the training methods proposed in this paper have time and space complexities O(N) while usual SVM training methods have time complexity O(N (3)) and space complexity O(N (2)) , where N is the training-data-set size. The second approach, named minimization of interclass interference (MICI), has an objective function inspired on the Fisher discriminant analysis. Such algorithm aims to create an MLP hidden output where the patterns have a desirable statistical distribution. In both training methods, the maximum area under ROC curve (AUC) is applied as stop criterion. The third approach offers a robust training framework able to take the best of each proposed training method. The main idea is to compose a neural model by using neurons extracted from three other neural networks, each one previously trained by

Promoting training adaptations through nutritional interventions.

PubMed

Hawley, John A; Tipton, Kevin D; Millard-Stafford, Mindy L

2006-07-01

Training and nutrition are highly interrelated in that optimal adaptation to the demands of repeated training sessions typically requires a diet that can sustain muscle energy reserves. As nutrient stores (i.e. muscle and liver glycogen) play a predominant role in the performance of prolonged, intense, intermittent exercise typical of the patterns of soccer match-play, and in the replenishment of energy reserves for subsequent training sessions, the extent to which acutely altering substrate availability might modify the training impulse has been a key research area among exercise physiologists and sport nutritionists for several decades. Although the major perturbations to cellular homeostasis and muscle substrate stores occur during exercise, the activation of several major signalling pathways important for chronic training adaptations take place during the first few hours of recovery, returning to baseline values within 24 h after exercise. This has led to the paradigm that many chronic training adaptations are generated by the cumulative effects of the transient events that occur during recovery from each (acute) exercise bout. Evidence is accumulating that nutrient supplementation can serve as a potent modulator of many of the acute responses to both endurance and resistance training. In this article, we review the molecular and cellular events that occur in skeletal muscle during exercise and subsequent recovery, and the potential for nutrient supplementation (e.g. carbohydrate, fat, protein) to affect many of the adaptive responses to training.

An arrhythmia classification algorithm using a dedicated wavelet adapted to different subjects.

PubMed

Kim, Jinkwon; Min, Se Dong; Lee, Myoungho

2011-06-27

Numerous studies have been conducted regarding a heartbeat classification algorithm over the past several decades. However, many algorithms have also been studied to acquire robust performance, as biosignals have a large amount of variation among individuals. Various methods have been proposed to reduce the differences coming from personal characteristics, but these expand the differences caused by arrhythmia. In this paper, an arrhythmia classification algorithm using a dedicated wavelet adapted to individual subjects is proposed. We reduced the performance variation using dedicated wavelets, as in the ECG morphologies of the subjects. The proposed algorithm utilizes morphological filtering and a continuous wavelet transform with a dedicated wavelet. A principal component analysis and linear discriminant analysis were utilized to compress the morphological data transformed by the dedicated wavelets. An extreme learning machine was used as a classifier in the proposed algorithm. A performance evaluation was conducted with the MIT-BIH arrhythmia database. The results showed a high sensitivity of 97.51%, specificity of 85.07%, accuracy of 97.94%, and a positive predictive value of 97.26%. The proposed algorithm achieves better accuracy than other state-of-the-art algorithms with no intrasubject between the training and evaluation datasets. And it significantly reduces the amount of intervention needed by physicians.

An arrhythmia classification algorithm using a dedicated wavelet adapted to different subjects

PubMed Central

2011-01-01

Background Numerous studies have been conducted regarding a heartbeat classification algorithm over the past several decades. However, many algorithms have also been studied to acquire robust performance, as biosignals have a large amount of variation among individuals. Various methods have been proposed to reduce the differences coming from personal characteristics, but these expand the differences caused by arrhythmia. Methods In this paper, an arrhythmia classification algorithm using a dedicated wavelet adapted to individual subjects is proposed. We reduced the performance variation using dedicated wavelets, as in the ECG morphologies of the subjects. The proposed algorithm utilizes morphological filtering and a continuous wavelet transform with a dedicated wavelet. A principal component analysis and linear discriminant analysis were utilized to compress the morphological data transformed by the dedicated wavelets. An extreme learning machine was used as a classifier in the proposed algorithm. Results A performance evaluation was conducted with the MIT-BIH arrhythmia database. The results showed a high sensitivity of 97.51%, specificity of 85.07%, accuracy of 97.94%, and a positive predictive value of 97.26%. Conclusions The proposed algorithm achieves better accuracy than other state-of-the-art algorithms with no intrasubject between the training and evaluation datasets. And it significantly reduces the amount of intervention needed by physicians. PMID:21707989

Adaptive Technologies for Training and Education

ERIC Educational Resources Information Center

Durlach, Paula J., Ed; Lesgold, Alan M., Ed.

2012-01-01

This edited volume provides an overview of the latest advancements in adaptive training technology. Intelligent tutoring has been deployed for well-defined and relatively static educational domains such as algebra and geometry. However, this adaptive approach to computer-based training has yet to come into wider usage for domains that are less…

Adaptive Decision Aiding in Computer-Assisted Instruction: Adaptive Computerized Training System (ACTS).

ERIC Educational Resources Information Center

Hopf-Weichel, Rosemarie; And Others

This report describes results of the first year of a three-year program to develop and evaluate a new Adaptive Computerized Training System (ACTS) for electronics maintenance training. (ACTS incorporates an adaptive computer program that learns the student's diagnostic and decision value structure, compares it to that of an expert, and adapts the…

Two algorithms for neural-network design and training with application to channel equalization.

PubMed

Sweatman, C Z; Mulgrew, B; Gibson, G J

1998-01-01

We describe two algorithms for designing and training neural-network classifiers. The first, the linear programming slab algorithm (LPSA), is motivated by the problem of reconstructing digital signals corrupted by passage through a dispersive channel and by additive noise. It constructs a multilayer perceptron (MLP) to separate two disjoint sets by using linear programming methods to identify network parameters. The second, the perceptron learning slab algorithm (PLSA), avoids the computational costs of linear programming by using an error-correction approach to identify parameters. Both algorithms operate in highly constrained parameter spaces and are able to exploit symmetry in the classification problem. Using these algorithms, we develop a number of procedures for the adaptive equalization of a complex linear 4-quadrature amplitude modulation (QAM) channel, and compare their performance in a simulation study. Results are given for both stationary and time-varying channels, the latter based on the COST 207 GSM propagation model.

An Algorithm for Automatically Modifying Train Crew Schedule

NASA Astrophysics Data System (ADS)

Takahashi, Satoru; Kataoka, Kenji; Kojima, Teruhito; Asami, Masayuki

Once the break-down of the train schedule occurs, the crew schedule as well as the train schedule has to be modified as quickly as possible to restore them. In this paper, we propose an algorithm for automatically modifying a crew schedule that takes all constraints into consideration, presenting a model of the combined problem of crews and trains. The proposed algorithm builds an initial solution by relaxing some of the constraint conditions, and then uses a Taboo-search method to revise this solution in order to minimize the degree of constraint violation resulting from these relaxed conditions. Then we show not only that the algorithm can generate a constraint satisfaction solution, but also that the solution will satisfy the experts. That is, we show the proposed algorithm is capable of producing a usable solution in a short time by applying to actual cases of train-schedule break-down, and that the solution is at least as good as those produced manually, by comparing the both solutions with several point of view.

Adaptive optics image restoration algorithm based on wavefront reconstruction and adaptive total variation method

NASA Astrophysics Data System (ADS)

Li, Dongming; Zhang, Lijuan; Wang, Ting; Liu, Huan; Yang, Jinhua; Chen, Guifen

2016-11-01

To improve the adaptive optics (AO) image's quality, we study the AO image restoration algorithm based on wavefront reconstruction technology and adaptive total variation (TV) method in this paper. Firstly, the wavefront reconstruction using Zernike polynomial is used for initial estimated for the point spread function (PSF). Then, we develop our proposed iterative solutions for AO images restoration, addressing the joint deconvolution issue. The image restoration experiments are performed to verify the image restoration effect of our proposed algorithm. The experimental results show that, compared with the RL-IBD algorithm and Wiener-IBD algorithm, we can see that GMG measures (for real AO image) from our algorithm are increased by 36.92%, and 27.44% respectively, and the computation time are decreased by 7.2%, and 3.4% respectively, and its estimation accuracy is significantly improved.

Comparison between iterative wavefront control algorithm and direct gradient wavefront control algorithm for adaptive optics system

NASA Astrophysics Data System (ADS)

Cheng, Sheng-Yi; Liu, Wen-Jin; Chen, Shan-Qiu; Dong, Li-Zhi; Yang, Ping; Xu, Bing

2015-08-01

Among all kinds of wavefront control algorithms in adaptive optics systems, the direct gradient wavefront control algorithm is the most widespread and common method. This control algorithm obtains the actuator voltages directly from wavefront slopes through pre-measuring the relational matrix between deformable mirror actuators and Hartmann wavefront sensor with perfect real-time characteristic and stability. However, with increasing the number of sub-apertures in wavefront sensor and deformable mirror actuators of adaptive optics systems, the matrix operation in direct gradient algorithm takes too much time, which becomes a major factor influencing control effect of adaptive optics systems. In this paper we apply an iterative wavefront control algorithm to high-resolution adaptive optics systems, in which the voltages of each actuator are obtained through iteration arithmetic, which gains great advantage in calculation and storage. For AO system with thousands of actuators, the computational complexity estimate is about O(n2) ˜ O(n3) in direct gradient wavefront control algorithm, while the computational complexity estimate in iterative wavefront control algorithm is about O(n) ˜ (O(n)3/2), in which n is the number of actuators of AO system. And the more the numbers of sub-apertures and deformable mirror actuators, the more significant advantage the iterative wavefront control algorithm exhibits. Project supported by the National Key Scientific and Research Equipment Development Project of China (Grant No. ZDYZ2013-2), the National Natural Science Foundation of China (Grant No. 11173008), and the Sichuan Provincial Outstanding Youth Academic Technology Leaders Program, China (Grant No. 2012JQ0012).

Nutritional strategies to influence adaptations to training.

PubMed

Spriet, Lawrence L; Gibala, Martin J

2004-01-01

This article highlights new nutritional concerns or practices that may influence the adaptation to training. The discussion is based on the assumption that the adaptation to repeated bouts of training occurs during recovery periods and that if one can train harder, the adaptation will be greater. The goal is to maximize with nutrition the recovery/adaptation that occurs in all rest periods, such that recovery before the next training session is complete. Four issues have been identified where recent scientific information will force sports nutritionists to embrace new issues and reassess old issues and, ultimately, alter the nutritional recommendations they give to athletes. These are: (1) caffeine ingestion; (2) creatine ingestion; (3) the use of intramuscular triacylglycerol (IMTG) as a fuel during exercise and the nutritional effects on IMTG repletion following exercise; and (4) the role nutrition may play in regulating the expression of genes during and after exercise training sessions. Recent findings suggest that low doses of caffeine exert significant ergogenic effects by directly affecting the central nervous system during exercise. Caffeine can cross the blood-brain barrier and antagonize the effects of adenosine, resulting in higher concentrations of stimulatory neurotransmitters. These new data strengthen the case for using low doses of caffeine during training. On the other hand, the data on the role that supplemental creatine ingestion plays in augmenting the increase in skeletal muscle mass and strength during resistance training remain equivocal. Some studies are able to demonstrate increases in muscle fibre size with creatine ingestion and some are not. The final two nutritional topics are new and have not progressed to the point that we can specifically identify strategies to enhance the adaptation to training. However, it is likely that nutritional strategies will be needed to replenish the IMTG that is used during endurance exercise. It is not

On-line training of recurrent neural networks with continuous topology adaptation.

PubMed

Obradovic, D

1996-01-01

This paper presents an online procedure for training dynamic neural networks with input-output recurrences whose topology is continuously adjusted to the complexity of the target system dynamics. This is accomplished by changing the number of the elements of the network hidden layer whenever the existing topology cannot capture the dynamics presented by the new data. The training mechanism is based on the suitably altered extended Kalman filter (EKF) algorithm which is simultaneously used for the network parameter adjustment and for its state estimation. The network consists of a single hidden layer with Gaussian radial basis functions (GRBF), and a linear output layer. The choice of the GRBF is induced by the requirements of the online learning. The latter implies the network architecture which permits only local influence of the new data point in order not to forget the previously learned dynamics. The continuous topology adaptation is implemented in our algorithm to avoid memory and computational problems of using a regular grid of GRBF'S which covers the network input space. Furthermore, we show that the resulting parameter increase can be handled "smoothly" without interfering with the already acquired information. If the target system dynamics are changing over time, we show that a suitable forgetting factor can be used to "unlearn" the no longer-relevant dynamics. The quality of the recurrent network training algorithm is demonstrated on the identification of nonlinear dynamic systems.

An adaptive grid algorithm for one-dimensional nonlinear equations

NASA Technical Reports Server (NTRS)

Gutierrez, William E.; Hills, Richard G.

1990-01-01

Richards' equation, which models the flow of liquid through unsaturated porous media, is highly nonlinear and difficult to solve. Step gradients in the field variables require the use of fine grids and small time step sizes. The numerical instabilities caused by the nonlinearities often require the use of iterative methods such as Picard or Newton interation. These difficulties result in large CPU requirements in solving Richards equation. With this in mind, adaptive and multigrid methods are investigated for use with nonlinear equations such as Richards' equation. Attention is focused on one-dimensional transient problems. To investigate the use of multigrid and adaptive grid methods, a series of problems are studied. First, a multigrid program is developed and used to solve an ordinary differential equation, demonstrating the efficiency with which low and high frequency errors are smoothed out. The multigrid algorithm and an adaptive grid algorithm is used to solve one-dimensional transient partial differential equations, such as the diffusive and convective-diffusion equations. The performance of these programs are compared to that of the Gauss-Seidel and tridiagonal methods. The adaptive and multigrid schemes outperformed the Gauss-Seidel algorithm, but were not as fast as the tridiagonal method. The adaptive grid scheme solved the problems slightly faster than the multigrid method. To solve nonlinear problems, Picard iterations are introduced into the adaptive grid and tridiagonal methods. Burgers' equation is used as a test problem for the two algorithms. Both methods obtain solutions of comparable accuracy for similar time increments. For the Burgers' equation, the adaptive grid method finds the solution approximately three times faster than the tridiagonal method. Finally, both schemes are used to solve the water content formulation of the Richards' equation. For this problem, the adaptive grid method obtains a more accurate solution in fewer work units and

An Adaptive Immune Genetic Algorithm for Edge Detection

NASA Astrophysics Data System (ADS)

Li, Ying; Bai, Bendu; Zhang, Yanning

An adaptive immune genetic algorithm (AIGA) based on cost minimization technique method for edge detection is proposed. The proposed AIGA recommends the use of adaptive probabilities of crossover, mutation and immune operation, and a geometric annealing schedule in immune operator to realize the twin goals of maintaining diversity in the population and sustaining the fast convergence rate in solving the complex problems such as edge detection. Furthermore, AIGA can effectively exploit some prior knowledge and information of the local edge structure in the edge image to make vaccines, which results in much better local search ability of AIGA than that of the canonical genetic algorithm. Experimental results on gray-scale images show the proposed algorithm perform well in terms of quality of the final edge image, rate of convergence and robustness to noise.

Estimating Position of Mobile Robots From Omnidirectional Vision Using an Adaptive Algorithm.

PubMed

Li, Luyang; Liu, Yun-Hui; Wang, Kai; Fang, Mu

2015-08-01

This paper presents a novel and simple adaptive algorithm for estimating the position of a mobile robot with high accuracy in an unknown and unstructured environment by fusing images of an omnidirectional vision system with measurements of odometry and inertial sensors. Based on a new derivation where the omnidirectional projection can be linearly parameterized by the positions of the robot and natural feature points, we propose a novel adaptive algorithm, which is similar to the Slotine-Li algorithm in model-based adaptive control, to estimate the robot's position by using the tracked feature points in image sequence, the robot's velocity, and orientation angles measured by odometry and inertial sensors. It is proved that the adaptive algorithm leads to global exponential convergence of the position estimation errors to zero. Simulations and real-world experiments are performed to demonstrate the performance of the proposed algorithm.

Fast algorithm of adaptive Fourier series

NASA Astrophysics Data System (ADS)

Gao, You; Ku, Min; Qian, Tao

2018-05-01

Adaptive Fourier decomposition (AFD, precisely 1-D AFD or Core-AFD) was originated for the goal of positive frequency representations of signals. It achieved the goal and at the same time offered fast decompositions of signals. There then arose several types of AFDs. AFD merged with the greedy algorithm idea, and in particular, motivated the so-called pre-orthogonal greedy algorithm (Pre-OGA) that was proven to be the most efficient greedy algorithm. The cost of the advantages of the AFD type decompositions is, however, the high computational complexity due to the involvement of maximal selections of the dictionary parameters. The present paper offers one formulation of the 1-D AFD algorithm by building the FFT algorithm into it. Accordingly, the algorithm complexity is reduced, from the original $\\mathcal{O}(M N^2)$ to $\\mathcal{O}(M N\\log_2 N)$, where $N$ denotes the number of the discretization points on the unit circle and $M$ denotes the number of points in $[0,1)$. This greatly enhances the applicability of AFD. Experiments are carried out to show the high efficiency of the proposed algorithm.

A New Adaptive H-Infinity Filtering Algorithm for the GPS/INS Integrated Navigation

PubMed Central

Jiang, Chen; Zhang, Shu-Bi; Zhang, Qiu-Zhao

2016-01-01

The Kalman filter is an optimal estimator with numerous applications in technology, especially in systems with Gaussian distributed noise. Moreover, the adaptive Kalman filtering algorithms, based on the Kalman filter, can control the influence of dynamic model errors. In contrast to the adaptive Kalman filtering algorithms, the H-infinity filter is able to address the interference of the stochastic model by minimization of the worst-case estimation error. In this paper, a novel adaptive H-infinity filtering algorithm, which integrates the adaptive Kalman filter and the H-infinity filter in order to perform a comprehensive filtering algorithm, is presented. In the proposed algorithm, a robust estimation method is employed to control the influence of outliers. In order to verify the proposed algorithm, experiments with real data of the Global Positioning System (GPS) and Inertial Navigation System (INS) integrated navigation, were conducted. The experimental results have shown that the proposed algorithm has multiple advantages compared to the other filtering algorithms. PMID:27999361

A New Adaptive H-Infinity Filtering Algorithm for the GPS/INS Integrated Navigation.

PubMed

Jiang, Chen; Zhang, Shu-Bi; Zhang, Qiu-Zhao

2016-12-19

The Kalman filter is an optimal estimator with numerous applications in technology, especially in systems with Gaussian distributed noise. Moreover, the adaptive Kalman filtering algorithms, based on the Kalman filter, can control the influence of dynamic model errors. In contrast to the adaptive Kalman filtering algorithms, the H-infinity filter is able to address the interference of the stochastic model by minimization of the worst-case estimation error. In this paper, a novel adaptive H-infinity filtering algorithm, which integrates the adaptive Kalman filter and the H-infinity filter in order to perform a comprehensive filtering algorithm, is presented. In the proposed algorithm, a robust estimation method is employed to control the influence of outliers. In order to verify the proposed algorithm, experiments with real data of the Global Positioning System (GPS) and Inertial Navigation System (INS) integrated navigation, were conducted. The experimental results have shown that the proposed algorithm has multiple advantages compared to the other filtering algorithms.

Algorithm for Training a Recurrent Multilayer Perceptron

NASA Technical Reports Server (NTRS)

Parlos, Alexander G.; Rais, Omar T.; Menon, Sunil K.; Atiya, Amir F.

2004-01-01

An improved algorithm has been devised for training a recurrent multilayer perceptron (RMLP) for optimal performance in predicting the behavior of a complex, dynamic, and noisy system multiple time steps into the future. [An RMLP is a computational neural network with self-feedback and cross-talk (both delayed by one time step) among neurons in hidden layers]. Like other neural-network-training algorithms, this algorithm adjusts network biases and synaptic-connection weights according to a gradient-descent rule. The distinguishing feature of this algorithm is a combination of global feedback (the use of predictions as well as the current output value in computing the gradient at each time step) and recursiveness. The recursive aspect of the algorithm lies in the inclusion of the gradient of predictions at each time step with respect to the predictions at the preceding time step; this recursion enables the RMLP to learn the dynamics. It has been conjectured that carrying the recursion to even earlier time steps would enable the RMLP to represent a noisier, more complex system.

Adaptive convergence nonuniformity correction algorithm.

PubMed

Qian, Weixian; Chen, Qian; Bai, Junqi; Gu, Guohua

2011-01-01

Nowadays, convergence and ghosting artifacts are common problems in scene-based nonuniformity correction (NUC) algorithms. In this study, we introduce the idea of space frequency to the scene-based NUC. Then the convergence speed factor is presented, which can adaptively change the convergence speed by a change of the scene dynamic range. In fact, the convergence speed factor role is to decrease the statistical data standard deviation. The nonuniformity space relativity characteristic was summarized by plenty of experimental statistical data. The space relativity characteristic was used to correct the convergence speed factor, which can make it more stable. Finally, real and simulated infrared image sequences were applied to demonstrate the positive effect of our algorithm.

Adaptive Training of Manual Control: 1. Comparison of Three Adaptive Variables and Two Logic Schemes.

ERIC Educational Resources Information Center

Norman, D. A.; And Others

"Machine controlled adaptive training is a promising concept. In adaptive training the task presented to the trainee varies as a function of how well he performs. In machine controlled training, adaptive logic performs a function analogous to that performed by a skilled operator." This study looks at the ways in which gain-effective time…

G/SPLINES: A hybrid of Friedman's Multivariate Adaptive Regression Splines (MARS) algorithm with Holland's genetic algorithm

NASA Technical Reports Server (NTRS)

Rogers, David

1991-01-01

G/SPLINES are a hybrid of Friedman's Multivariable Adaptive Regression Splines (MARS) algorithm with Holland's Genetic Algorithm. In this hybrid, the incremental search is replaced by a genetic search. The G/SPLINE algorithm exhibits performance comparable to that of the MARS algorithm, requires fewer least squares computations, and allows significantly larger problems to be considered.

Flight data processing with the F-8 adaptive algorithm

NASA Technical Reports Server (NTRS)

Hartmann, G.; Stein, G.; Petersen, K.

1977-01-01

An explicit adaptive control algorithm based on maximum likelihood estimation of parameters has been designed for NASA's DFBW F-8 aircraft. To avoid iterative calculations, the algorithm uses parallel channels of Kalman filters operating at fixed locations in parameter space. This algorithm has been implemented in NASA/DFRC's Remotely Augmented Vehicle (RAV) facility. Real-time sensor outputs (rate gyro, accelerometer and surface position) are telemetered to a ground computer which sends new gain values to an on-board system. Ground test data and flight records were used to establish design values of noise statistics and to verify the ground-based adaptive software. The software and its performance evaluation based on flight data are described

Adaptive Trajectory Prediction Algorithm for Climbing Flights

NASA Technical Reports Server (NTRS)

Schultz, Charles Alexander; Thipphavong, David P.; Erzberger, Heinz

2012-01-01

Aircraft climb trajectories are difficult to predict, and large errors in these predictions reduce the potential operational benefits of some advanced features for NextGen. The algorithm described in this paper improves climb trajectory prediction accuracy by adjusting trajectory predictions based on observed track data. It utilizes rate-of-climb and airspeed measurements derived from position data to dynamically adjust the aircraft weight modeled for trajectory predictions. In simulations with weight uncertainty, the algorithm is able to adapt to within 3 percent of the actual gross weight within two minutes of the initial adaptation. The root-mean-square of altitude errors for five-minute predictions was reduced by 73 percent. Conflict detection performance also improved, with a 15 percent reduction in missed alerts and a 10 percent reduction in false alerts. In a simulation with climb speed capture intent and weight uncertainty, the algorithm improved climb trajectory prediction accuracy by up to 30 percent and conflict detection performance, reducing missed and false alerts by up to 10 percent.

Adaptive firefly algorithm: parameter analysis and its application.

PubMed

Cheung, Ngaam J; Ding, Xue-Ming; Shen, Hong-Bin

2014-01-01

As a nature-inspired search algorithm, firefly algorithm (FA) has several control parameters, which may have great effects on its performance. In this study, we investigate the parameter selection and adaptation strategies in a modified firefly algorithm - adaptive firefly algorithm (AdaFa). There are three strategies in AdaFa including (1) a distance-based light absorption coefficient; (2) a gray coefficient enhancing fireflies to share difference information from attractive ones efficiently; and (3) five different dynamic strategies for the randomization parameter. Promising selections of parameters in the strategies are analyzed to guarantee the efficient performance of AdaFa. AdaFa is validated over widely used benchmark functions, and the numerical experiments and statistical tests yield useful conclusions on the strategies and the parameter selections affecting the performance of AdaFa. When applied to the real-world problem - protein tertiary structure prediction, the results demonstrated improved variants can rebuild the tertiary structure with the average root mean square deviation less than 0.4Å and 1.5Å from the native constrains with noise free and 10% Gaussian white noise.

Adaptive Firefly Algorithm: Parameter Analysis and its Application

PubMed Central

Shen, Hong-Bin

2014-01-01

As a nature-inspired search algorithm, firefly algorithm (FA) has several control parameters, which may have great effects on its performance. In this study, we investigate the parameter selection and adaptation strategies in a modified firefly algorithm — adaptive firefly algorithm (AdaFa). There are three strategies in AdaFa including (1) a distance-based light absorption coefficient; (2) a gray coefficient enhancing fireflies to share difference information from attractive ones efficiently; and (3) five different dynamic strategies for the randomization parameter. Promising selections of parameters in the strategies are analyzed to guarantee the efficient performance of AdaFa. AdaFa is validated over widely used benchmark functions, and the numerical experiments and statistical tests yield useful conclusions on the strategies and the parameter selections affecting the performance of AdaFa. When applied to the real-world problem — protein tertiary structure prediction, the results demonstrated improved variants can rebuild the tertiary structure with the average root mean square deviation less than 0.4Å and 1.5Å from the native constrains with noise free and 10% Gaussian white noise. PMID:25397812

Adaptive swarm cluster-based dynamic multi-objective synthetic minority oversampling technique algorithm for tackling binary imbalanced datasets in biomedical data classification.

PubMed

Li, Jinyan; Fong, Simon; Sung, Yunsick; Cho, Kyungeun; Wong, Raymond; Wong, Kelvin K L

2016-01-01

An imbalanced dataset is defined as a training dataset that has imbalanced proportions of data in both interesting and uninteresting classes. Often in biomedical applications, samples from the stimulating class are rare in a population, such as medical anomalies, positive clinical tests, and particular diseases. Although the target samples in the primitive dataset are small in number, the induction of a classification model over such training data leads to poor prediction performance due to insufficient training from the minority class. In this paper, we use a novel class-balancing method named adaptive swarm cluster-based dynamic multi-objective synthetic minority oversampling technique (ASCB_DmSMOTE) to solve this imbalanced dataset problem, which is common in biomedical applications. The proposed method combines under-sampling and over-sampling into a swarm optimisation algorithm. It adaptively selects suitable parameters for the rebalancing algorithm to find the best solution. Compared with the other versions of the SMOTE algorithm, significant improvements, which include higher accuracy and credibility, are observed with ASCB_DmSMOTE. Our proposed method tactfully combines two rebalancing techniques together. It reasonably re-allocates the majority class in the details and dynamically optimises the two parameters of SMOTE to synthesise a reasonable scale of minority class for each clustered sub-imbalanced dataset. The proposed methods ultimately overcome other conventional methods and attains higher credibility with even greater accuracy of the classification model.

Climate Adaptation Training for Natural Resource Professionals

NASA Astrophysics Data System (ADS)

Sorensen, H. L.; Meyer, N.

2016-02-01

The University of Minnesota Sea Grant Program and University of Minensota Extension are coordinating the development of a cohort-based training for natural resource professionals that prepares them with essential aptitude, resources and tools to lead climate adaptation activities in their organizations and municipalities. This course is geared toward the growing cadre of natural resources, water, municipal infrastructure, and human resources professionals who are called upon to lead climate adaptation initiatives but lack core training in climate change science, vulnerability assessment, and adaptation planning. Modeled on pre-existing UMN certificate programs, the online course encompasses approximately 40 contact hours of training. Content builds from basic climate mechanics to change science, vulnerability assessment, downscaled climate modeling, ecosystem response to climate change and strategies communicating climate change to diverse audiences. Minnesota as well as national case studies and expertise will anchor core climate adaptation concepts in a relevant context.

Prediction of cardiovascular risk in rheumatoid arthritis: performance of original and adapted SCORE algorithms.

PubMed

Arts, E E A; Popa, C D; Den Broeder, A A; Donders, R; Sandoo, A; Toms, T; Rollefstad, S; Ikdahl, E; Semb, A G; Kitas, G D; Van Riel, P L C M; Fransen, J

2016-04-01

Predictive performance of cardiovascular disease (CVD) risk calculators appears suboptimal in rheumatoid arthritis (RA). A disease-specific CVD risk algorithm may improve CVD risk prediction in RA. The objectives of this study are to adapt the Systematic COronary Risk Evaluation (SCORE) algorithm with determinants of CVD risk in RA and to assess the accuracy of CVD risk prediction calculated with the adapted SCORE algorithm. Data from the Nijmegen early RA inception cohort were used. The primary outcome was first CVD events. The SCORE algorithm was recalibrated by reweighing included traditional CVD risk factors and adapted by adding other potential predictors of CVD. Predictive performance of the recalibrated and adapted SCORE algorithms was assessed and the adapted SCORE was externally validated. Of the 1016 included patients with RA, 103 patients experienced a CVD event. Discriminatory ability was comparable across the original, recalibrated and adapted SCORE algorithms. The Hosmer-Lemeshow test results indicated that all three algorithms provided poor model fit (p<0.05) for the Nijmegen and external validation cohort. The adapted SCORE algorithm mainly improves CVD risk estimation in non-event cases and does not show a clear advantage in reclassifying patients with RA who develop CVD (event cases) into more appropriate risk groups. This study demonstrates for the first time that adaptations of the SCORE algorithm do not provide sufficient improvement in risk prediction of future CVD in RA to serve as an appropriate alternative to the original SCORE. Risk assessment using the original SCORE algorithm may underestimate CVD risk in patients with RA. Published by the BMJ Publishing Group Limited. For permission to use (where not already granted under a licence) please go to http://www.bmj.com/company/products-services/rights-and-licensing/

A novel adaptive, real-time algorithm to detect gait events from wearable sensors.

PubMed

Chia Bejarano, Noelia; Ambrosini, Emilia; Pedrocchi, Alessandra; Ferrigno, Giancarlo; Monticone, Marco; Ferrante, Simona

2015-05-01

A real-time, adaptive algorithm based on two inertial and magnetic sensors placed on the shanks was developed for gait-event detection. For each leg, the algorithm detected the Initial Contact (IC), as the minimum of the flexion/extension angle, and the End Contact (EC) and the Mid-Swing (MS), as minimum and maximum of the angular velocity, respectively. The algorithm consisted of calibration, real-time detection, and step-by-step update. Data collected from 22 healthy subjects (21 to 85 years) walking at three self-selected speeds were used to validate the algorithm against the GaitRite system. Comparable levels of accuracy and significantly lower detection delays were achieved with respect to other published methods. The algorithm robustness was tested on ten healthy subjects performing sudden speed changes and on ten stroke subjects (43 to 89 years). For healthy subjects, F1-scores of 1 and mean detection delays lower than 14 ms were obtained. For stroke subjects, F1-scores of 0.998 and 0.944 were obtained for IC and EC, respectively, with mean detection delays always below 31 ms. The algorithm accurately detected gait events in real time from a heterogeneous dataset of gait patterns and paves the way for the design of closed-loop controllers for customized gait trainings and/or assistive devices.

Adaptive backstepping control of train systems with traction/braking dynamics and uncertain resistive forces

NASA Astrophysics Data System (ADS)

Song, Qi; Song, Y. D.; Cai, Wenchuan

2011-09-01

Although backstepping control design approach has been widely utilised in many practical systems, little effort has been made in applying this useful method to train systems. The main purpose of this paper is to apply this popular control design technique to speed and position tracking control of high-speed trains. By integrating adaptive control with backstepping control, we develop a control scheme that is able to address not only the traction and braking dynamics ignored in most existing methods, but also the uncertain friction and aerodynamic drag forces arisen from uncertain resistance coefficients. As such, the resultant control algorithms are able to achieve high precision train position and speed tracking under varying operation railway conditions, as validated by theoretical analysis and numerical simulations.

Adaptive phase k-means algorithm for waveform classification

NASA Astrophysics Data System (ADS)

Song, Chengyun; Liu, Zhining; Wang, Yaojun; Xu, Feng; Li, Xingming; Hu, Guangmin

2018-01-01

Waveform classification is a powerful technique for seismic facies analysis that describes the heterogeneity and compartments within a reservoir. Horizon interpretation is a critical step in waveform classification. However, the horizon often produces inconsistent waveform phase, and thus results in an unsatisfied classification. To alleviate this problem, an adaptive phase waveform classification method called the adaptive phase k-means is introduced in this paper. Our method improves the traditional k-means algorithm using an adaptive phase distance for waveform similarity measure. The proposed distance is a measure with variable phases as it moves from sample to sample along the traces. Model traces are also updated with the best phase interference in the iterative process. Therefore, our method is robust to phase variations caused by the interpretation horizon. We tested the effectiveness of our algorithm by applying it to synthetic and real data. The satisfactory results reveal that the proposed method tolerates certain waveform phase variation and is a good tool for seismic facies analysis.

Fully implicit adaptive mesh refinement MHD algorithm

NASA Astrophysics Data System (ADS)

Philip, Bobby

2005-10-01

In the macroscopic simulation of plasmas, the numerical modeler is faced with the challenge of dealing with multiple time and length scales. The former results in stiffness due to the presence of very fast waves. The latter requires one to resolve the localized features that the system develops. Traditional approaches based on explicit time integration techniques and fixed meshes are not suitable for this challenge, as such approaches prevent the modeler from using realistic plasma parameters to keep the computation feasible. We propose here a novel approach, based on implicit methods and structured adaptive mesh refinement (SAMR). Our emphasis is on both accuracy and scalability with the number of degrees of freedom. To our knowledge, a scalable, fully implicit AMR algorithm has not been accomplished before for MHD. As a proof-of-principle, we focus on the reduced resistive MHD model as a basic MHD model paradigm, which is truly multiscale. The approach taken here is to adapt mature physics-based technologyootnotetextL. Chac'on et al., J. Comput. Phys. 178 (1), 15- 36 (2002) to AMR grids, and employ AMR-aware multilevel techniques (such as fast adaptive composite --FAC-- algorithms) for scalability. We will demonstrate that the concept is indeed feasible, featuring optimal scalability under grid refinement. Results of fully-implicit, dynamically-adaptive AMR simulations will be presented on a variety of problems.

A genetic-based algorithm for personalized resistance training

PubMed Central

Kiely, J; Suraci, B; Collins, DJ; de Lorenzo, D; Pickering, C; Grimaldi, KA

2016-01-01

Association studies have identified dozens of genetic variants linked to training responses and sport-related traits. However, no intervention studies utilizing the idea of personalised training based on athlete's genetic profile have been conducted. Here we propose an algorithm that allows achieving greater results in response to high- or low-intensity resistance training programs by predicting athlete's potential for the development of power and endurance qualities with the panel of 15 performance-associated gene polymorphisms. To develop and validate such an algorithm we performed two studies in independent cohorts of male athletes (study 1: athletes from different sports (n = 28); study 2: soccer players (n = 39)). In both studies athletes completed an eight-week high- or low-intensity resistance training program, which either matched or mismatched their individual genotype. Two variables of explosive power and aerobic fitness, as measured by the countermovement jump (CMJ) and aerobic 3-min cycle test (Aero3) were assessed pre and post 8 weeks of resistance training. In study 1, the athletes from the matched groups (i.e. high-intensity trained with power genotype or low-intensity trained with endurance genotype) significantly increased results in CMJ (P = 0.0005) and Aero3 (P = 0.0004). Whereas, athletes from the mismatched group (i.e. high-intensity trained with endurance genotype or low-intensity trained with power genotype) demonstrated non-significant improvements in CMJ (P = 0.175) and less prominent results in Aero3 (P = 0.0134). In study 2, soccer players from the matched group also demonstrated significantly greater (P < 0.0001) performance changes in both tests compared to the mismatched group. Among non- or low responders of both studies, 82% of athletes (both for CMJ and Aero3) were from the mismatched group (P < 0.0001). Our results indicate that matching the individual's genotype with the appropriate training modality leads to more effective

Weekly Time Course of Neuro-Muscular Adaptation to Intensive Strength Training.

PubMed

Brown, Niklas; Bubeck, Dieter; Haeufle, Daniel F B; Weickenmeier, Johannes; Kuhl, Ellen; Alt, Wilfried; Schmitt, Syn

2017-01-01

Detailed description of the time course of muscular adaptation is rarely found in literature. Thus, models of muscular adaptation are difficult to validate since no detailed data of adaptation are available. In this article, as an initial step toward a detailed description and analysis of muscular adaptation, we provide a case report of 8 weeks of intense strength training with two active, male participants. Muscular adaptations were analyzed on a morphological level with MRI scans of the right quadriceps muscle and the calculation of muscle volume, on a voluntary strength level by isometric voluntary contractions with doublet stimulation (interpolated twitch technique) and on a non-voluntary level by resting twitch torques. Further, training volume and isokinetic power were closely monitored during the training phase. Data were analyzed weekly for 1 week prior to training, pre-training, 8 weeks of training and 2 weeks of detraining (no strength training). Results show a very individual adaptation to the intense strength training protocol. While training volume and isokinetic power increased linearly during the training phase, resting twitch parameters decreased for both participants after the first week of training and stayed below baseline until de-training. Voluntary activation level showed an increase in the first 4 weeks of training, while maximum voluntary contraction showed only little increase compared to baseline. Muscle volume increased for both subjects. Especially training status seemed to influence the acute reaction to intense strength training. Fatigue had a major influence on performance and could only be overcome by one participant. The results give a first detailed insight into muscular adaptation to intense strength training on various levels, providing a basis of data for a validation of muscle fatigue and adaptation models.

A Hybrid Adaptive Routing Algorithm for Event-Driven Wireless Sensor Networks

PubMed Central

Figueiredo, Carlos M. S.; Nakamura, Eduardo F.; Loureiro, Antonio A. F.

2009-01-01

Routing is a basic function in wireless sensor networks (WSNs). For these networks, routing algorithms depend on the characteristics of the applications and, consequently, there is no self-contained algorithm suitable for every case. In some scenarios, the network behavior (traffic load) may vary a lot, such as an event-driven application, favoring different algorithms at different instants. This work presents a hybrid and adaptive algorithm for routing in WSNs, called Multi-MAF, that adapts its behavior autonomously in response to the variation of network conditions. In particular, the proposed algorithm applies both reactive and proactive strategies for routing infrastructure creation, and uses an event-detection estimation model to change between the strategies and save energy. To show the advantages of the proposed approach, it is evaluated through simulations. Comparisons with independent reactive and proactive algorithms show improvements on energy consumption. PMID:22423207

A hybrid adaptive routing algorithm for event-driven wireless sensor networks.

PubMed

Figueiredo, Carlos M S; Nakamura, Eduardo F; Loureiro, Antonio A F

2009-01-01

Routing is a basic function in wireless sensor networks (WSNs). For these networks, routing algorithms depend on the characteristics of the applications and, consequently, there is no self-contained algorithm suitable for every case. In some scenarios, the network behavior (traffic load) may vary a lot, such as an event-driven application, favoring different algorithms at different instants. This work presents a hybrid and adaptive algorithm for routing in WSNs, called Multi-MAF, that adapts its behavior autonomously in response to the variation of network conditions. In particular, the proposed algorithm applies both reactive and proactive strategies for routing infrastructure creation, and uses an event-detection estimation model to change between the strategies and save energy. To show the advantages of the proposed approach, it is evaluated through simulations. Comparisons with independent reactive and proactive algorithms show improvements on energy consumption.

Adaptively resizing populations: Algorithm, analysis, and first results

NASA Technical Reports Server (NTRS)

Smith, Robert E.; Smuda, Ellen

1993-01-01

Deciding on an appropriate population size for a given Genetic Algorithm (GA) application can often be critical to the algorithm's success. Too small, and the GA can fall victim to sampling error, affecting the efficacy of its search. Too large, and the GA wastes computational resources. Although advice exists for sizing GA populations, much of this advice involves theoretical aspects that are not accessible to the novice user. An algorithm for adaptively resizing GA populations is suggested. This algorithm is based on recent theoretical developments that relate population size to schema fitness variance. The suggested algorithm is developed theoretically, and simulated with expected value equations. The algorithm is then tested on a problem where population sizing can mislead the GA. The work presented suggests that the population sizing algorithm may be a viable way to eliminate the population sizing decision from the application of GA's.

A chaos wolf optimization algorithm with self-adaptive variable step-size

NASA Astrophysics Data System (ADS)

Zhu, Yong; Jiang, Wanlu; Kong, Xiangdong; Quan, Lingxiao; Zhang, Yongshun

2017-10-01

To explore the problem of parameter optimization for complex nonlinear function, a chaos wolf optimization algorithm (CWOA) with self-adaptive variable step-size was proposed. The algorithm was based on the swarm intelligence of wolf pack, which fully simulated the predation behavior and prey distribution way of wolves. It possessed three intelligent behaviors such as migration, summons and siege. And the competition rule as "winner-take-all" and the update mechanism as "survival of the fittest" were also the characteristics of the algorithm. Moreover, it combined the strategies of self-adaptive variable step-size search and chaos optimization. The CWOA was utilized in parameter optimization of twelve typical and complex nonlinear functions. And the obtained results were compared with many existing algorithms, including the classical genetic algorithm, the particle swarm optimization algorithm and the leader wolf pack search algorithm. The investigation results indicate that CWOA possess preferable optimization ability. There are advantages in optimization accuracy and convergence rate. Furthermore, it demonstrates high robustness and global searching ability.

Adaptive process control using fuzzy logic and genetic algorithms

NASA Technical Reports Server (NTRS)

Karr, C. L.

1993-01-01

Researchers at the U.S. Bureau of Mines have developed adaptive process control systems in which genetic algorithms (GA's) are used to augment fuzzy logic controllers (FLC's). GA's are search algorithms that rapidly locate near-optimum solutions to a wide spectrum of problems by modeling the search procedures of natural genetics. FLC's are rule based systems that efficiently manipulate a problem environment by modeling the 'rule-of-thumb' strategy used in human decision making. Together, GA's and FLC's possess the capabilities necessary to produce powerful, efficient, and robust adaptive control systems. To perform efficiently, such control systems require a control element to manipulate the problem environment, and a learning element to adjust to the changes in the problem environment. Details of an overall adaptive control system are discussed. A specific laboratory acid-base pH system is used to demonstrate the ideas presented.

Adaptive reference update (ARU) algorithm. A stochastic search algorithm for efficient optimization of multi-drug cocktails

PubMed Central

2012-01-01

Background Multi-target therapeutics has been shown to be effective for treating complex diseases, and currently, it is a common practice to combine multiple drugs to treat such diseases to optimize the therapeutic outcomes. However, considering the huge number of possible ways to mix multiple drugs at different concentrations, it is practically difficult to identify the optimal drug combination through exhaustive testing. Results In this paper, we propose a novel stochastic search algorithm, called the adaptive reference update (ARU) algorithm, that can provide an efficient and systematic way for optimizing multi-drug cocktails. The ARU algorithm iteratively updates the drug combination to improve its response, where the update is made by comparing the response of the current combination with that of a reference combination, based on which the beneficial update direction is predicted. The reference combination is continuously updated based on the drug response values observed in the past, thereby adapting to the underlying drug response function. To demonstrate the effectiveness of the proposed algorithm, we evaluated its performance based on various multi-dimensional drug functions and compared it with existing algorithms. Conclusions Simulation results show that the ARU algorithm significantly outperforms existing stochastic search algorithms, including the Gur Game algorithm. In fact, the ARU algorithm can more effectively identify potent drug combinations and it typically spends fewer iterations for finding effective combinations. Furthermore, the ARU algorithm is robust to random fluctuations and noise in the measured drug response, which makes the algorithm well-suited for practical drug optimization applications. PMID:23134742

On the use of harmony search algorithm in the training of wavelet neural networks

NASA Astrophysics Data System (ADS)

Lai, Kee Huong; Zainuddin, Zarita; Ong, Pauline

2015-10-01

Wavelet neural networks (WNNs) are a class of feedforward neural networks that have been used in a wide range of industrial and engineering applications to model the complex relationships between the given inputs and outputs. The training of WNNs involves the configuration of the weight values between neurons. The backpropagation training algorithm, which is a gradient-descent method, can be used for this training purpose. Nonetheless, the solutions found by this algorithm often get trapped at local minima. In this paper, a harmony search-based algorithm is proposed for the training of WNNs. The training of WNNs, thus can be formulated as a continuous optimization problem, where the objective is to maximize the overall classification accuracy. Each candidate solution proposed by the harmony search algorithm represents a specific WNN architecture. In order to speed up the training process, the solution space is divided into disjoint partitions during the random initialization step of harmony search algorithm. The proposed training algorithm is tested onthree benchmark problems from the UCI machine learning repository, as well as one real life application, namely, the classification of electroencephalography signals in the task of epileptic seizure detection. The results obtained show that the proposed algorithm outperforms the traditional harmony search algorithm in terms of overall classification accuracy.

Testing algorithms for a passenger train braking performance model.

DOT National Transportation Integrated Search

2011-09-01

"The Federal Railroad Administrations Office of Research and Development funded a project to establish performance model to develop, analyze, and test positive train control (PTC) braking algorithms for passenger train operations. With a good brak...

An Efficient Supervised Training Algorithm for Multilayer Spiking Neural Networks

PubMed Central

Xie, Xiurui; Qu, Hong; Liu, Guisong; Zhang, Malu; Kurths, Jürgen

2016-01-01

The spiking neural networks (SNNs) are the third generation of neural networks and perform remarkably well in cognitive tasks such as pattern recognition. The spike emitting and information processing mechanisms found in biological cognitive systems motivate the application of the hierarchical structure and temporal encoding mechanism in spiking neural networks, which have exhibited strong computational capability. However, the hierarchical structure and temporal encoding approach require neurons to process information serially in space and time respectively, which reduce the training efficiency significantly. For training the hierarchical SNNs, most existing methods are based on the traditional back-propagation algorithm, inheriting its drawbacks of the gradient diffusion and the sensitivity on parameters. To keep the powerful computation capability of the hierarchical structure and temporal encoding mechanism, but to overcome the low efficiency of the existing algorithms, a new training algorithm, the Normalized Spiking Error Back Propagation (NSEBP) is proposed in this paper. In the feedforward calculation, the output spike times are calculated by solving the quadratic function in the spike response model instead of detecting postsynaptic voltage states at all time points in traditional algorithms. Besides, in the feedback weight modification, the computational error is propagated to previous layers by the presynaptic spike jitter instead of the gradient decent rule, which realizes the layer-wised training. Furthermore, our algorithm investigates the mathematical relation between the weight variation and voltage error change, which makes the normalization in the weight modification applicable. Adopting these strategies, our algorithm outperforms the traditional SNN multi-layer algorithms in terms of learning efficiency and parameter sensitivity, that are also demonstrated by the comprehensive experimental results in this paper. PMID:27044001

Detecting an atomic clock frequency anomaly using an adaptive Kalman filter algorithm

NASA Astrophysics Data System (ADS)

Song, Huijie; Dong, Shaowu; Wu, Wenjun; Jiang, Meng; Wang, Weixiong

2018-06-01

The abnormal frequencies of an atomic clock mainly include frequency jump and frequency drift jump. Atomic clock frequency anomaly detection is a key technique in time-keeping. The Kalman filter algorithm, as a linear optimal algorithm, has been widely used in real-time detection for abnormal frequency. In order to obtain an optimal state estimation, the observation model and dynamic model of the Kalman filter algorithm should satisfy Gaussian white noise conditions. The detection performance is degraded if anomalies affect the observation model or dynamic model. The idea of the adaptive Kalman filter algorithm, applied to clock frequency anomaly detection, uses the residuals given by the prediction for building ‘an adaptive factor’ the prediction state covariance matrix is real-time corrected by the adaptive factor. The results show that the model error is reduced and the detection performance is improved. The effectiveness of the algorithm is verified by the frequency jump simulation, the frequency drift jump simulation and the measured data of the atomic clock by using the chi-square test.

Enhancing Functional Performance using Sensorimotor Adaptability Training Programs

NASA Technical Reports Server (NTRS)

Bloomberg, J. J.; Mulavara, A. P.; Peters, B. T.; Brady, R.; Audas, C.; Ruttley, T. M.; Cohen, H. S.

2009-01-01

During the acute phase of adaptation to novel gravitational environments, sensorimotor disturbances have the potential to disrupt the ability of astronauts to perform functional tasks. The goal of this project is to develop a sensorimotor adaptability (SA) training program designed to facilitate recovery of functional capabilities when astronauts transition to different gravitational environments. The project conducted a series of studies that investigated the efficacy of treadmill training combined with a variety of sensory challenges designed to increase adaptability including alterations in visual flow, body loading, and support surface stability.

Fast frequency acquisition via adaptive least squares algorithm

NASA Technical Reports Server (NTRS)

Kumar, R.

1986-01-01

A new least squares algorithm is proposed and investigated for fast frequency and phase acquisition of sinusoids in the presence of noise. This algorithm is a special case of more general, adaptive parameter-estimation techniques. The advantages of the algorithms are their conceptual simplicity, flexibility and applicability to general situations. For example, the frequency to be acquired can be time varying, and the noise can be nonGaussian, nonstationary and colored. As the proposed algorithm can be made recursive in the number of observations, it is not necessary to have a priori knowledge of the received signal-to-noise ratio or to specify the measurement time. This would be required for batch processing techniques, such as the fast Fourier transform (FFT). The proposed algorithm improves the frequency estimate on a recursive basis as more and more observations are obtained. When the algorithm is applied in real time, it has the extra advantage that the observations need not be stored. The algorithm also yields a real time confidence measure as to the accuracy of the estimator.

Smart algorithms and adaptive methods in computational fluid dynamics

NASA Astrophysics Data System (ADS)

Tinsley Oden, J.

1989-05-01

A review is presented of the use of smart algorithms which employ adaptive methods in processing large amounts of data in computational fluid dynamics (CFD). Smart algorithms use a rationally based set of criteria for automatic decision making in an attempt to produce optimal simulations of complex fluid dynamics problems. The information needed to make these decisions is not known beforehand and evolves in structure and form during the numerical solution of flow problems. Once the code makes a decision based on the available data, the structure of the data may change, and criteria may be reapplied in order to direct the analysis toward an acceptable end. Intelligent decisions are made by processing vast amounts of data that evolve unpredictably during the calculation. The basic components of adaptive methods and their application to complex problems of fluid dynamics are reviewed. The basic components of adaptive methods are: (1) data structures, that is what approaches are available for modifying data structures of an approximation so as to reduce errors; (2) error estimation, that is what techniques exist for estimating error evolution in a CFD calculation; and (3) solvers, what algorithms are available which can function in changing meshes. Numerical examples which demonstrate the viability of these approaches are presented.

Adaptive Process Control with Fuzzy Logic and Genetic Algorithms

NASA Technical Reports Server (NTRS)

Karr, C. L.

1993-01-01

Researchers at the U.S. Bureau of Mines have developed adaptive process control systems in which genetic algorithms (GA's) are used to augment fuzzy logic controllers (FLC's). GA's are search algorithms that rapidly locate near-optimum solutions to a wide spectrum of problems by modeling the search procedures of natural genetics. FLC's are rule based systems that efficiently manipulate a problem environment by modeling the 'rule-of-thumb' strategy used in human decision-making. Together, GA's and FLC's possess the capabilities necessary to produce powerful, efficient, and robust adaptive control systems. To perform efficiently, such control systems require a control element to manipulate the problem environment, an analysis element to recognize changes in the problem environment, and a learning element to adjust to the changes in the problem environment. Details of an overall adaptive control system are discussed. A specific laboratory acid-base pH system is used to demonstrate the ideas presented.

Improving GPU-accelerated adaptive IDW interpolation algorithm using fast kNN search.

PubMed

Mei, Gang; Xu, Nengxiong; Xu, Liangliang

2016-01-01

This paper presents an efficient parallel Adaptive Inverse Distance Weighting (AIDW) interpolation algorithm on modern Graphics Processing Unit (GPU). The presented algorithm is an improvement of our previous GPU-accelerated AIDW algorithm by adopting fast k-nearest neighbors (kNN) search. In AIDW, it needs to find several nearest neighboring data points for each interpolated point to adaptively determine the power parameter; and then the desired prediction value of the interpolated point is obtained by weighted interpolating using the power parameter. In this work, we develop a fast kNN search approach based on the space-partitioning data structure, even grid, to improve the previous GPU-accelerated AIDW algorithm. The improved algorithm is composed of the stages of kNN search and weighted interpolating. To evaluate the performance of the improved algorithm, we perform five groups of experimental tests. The experimental results indicate: (1) the improved algorithm can achieve a speedup of up to 1017 over the corresponding serial algorithm; (2) the improved algorithm is at least two times faster than our previous GPU-accelerated AIDW algorithm; and (3) the utilization of fast kNN search can significantly improve the computational efficiency of the entire GPU-accelerated AIDW algorithm.

Multi-objective Optimization Design of Gear Reducer Based on Adaptive Genetic Algorithms

NASA Astrophysics Data System (ADS)

Li, Rui; Chang, Tian; Wang, Jianwei; Wei, Xiaopeng; Wang, Jinming

2008-11-01

An adaptive Genetic Algorithm (GA) is introduced to solve the multi-objective optimized design of the reducer. Firstly, according to the structure, strength, etc. in a reducer, a multi-objective optimized model of the helical gear reducer is established. And then an adaptive GA based on a fuzzy controller is introduced, aiming at the characteristics of multi-objective, multi-parameter, multi-constraint conditions. Finally, a numerical example is illustrated to show the advantages of this approach and the effectiveness of an adaptive genetic algorithm used in optimized design of a reducer.

Intermediate view reconstruction using adaptive disparity search algorithm for real-time 3D processing

NASA Astrophysics Data System (ADS)

Bae, Kyung-hoon; Park, Changhan; Kim, Eun-soo

2008-03-01

In this paper, intermediate view reconstruction (IVR) using adaptive disparity search algorithm (ASDA) is for realtime 3-dimensional (3D) processing proposed. The proposed algorithm can reduce processing time of disparity estimation by selecting adaptive disparity search range. Also, the proposed algorithm can increase the quality of the 3D imaging. That is, by adaptively predicting the mutual correlation between stereo images pair using the proposed algorithm, the bandwidth of stereo input images pair can be compressed to the level of a conventional 2D image and a predicted image also can be effectively reconstructed using a reference image and disparity vectors. From some experiments, stereo sequences of 'Pot Plant' and 'IVO', it is shown that the proposed algorithm improves the PSNRs of a reconstructed image to about 4.8 dB by comparing with that of conventional algorithms, and reduces the Synthesizing time of a reconstructed image to about 7.02 sec by comparing with that of conventional algorithms.

Adaptive scenarios: a training model for today's public health workforce.

PubMed

Uden-Holman, Tanya; Bedet, Jennifer; Walkner, Laurie; Abd-Hamid, Nor Hashidah

2014-01-01

With the current economic climate, money for training is scarce. In addition, time is a major barrier to participation in trainings. To meet the public health workforce's rising demand for training, while struggling with less time and fewer resources, the Upper Midwest Preparedness and Emergency Response Learning Center has developed a model of online training that provides the public health workforce with individually customized, needs-based training experiences. Adaptive scenarios are rooted in case-based reasoning, a learning approach that focuses on the specific knowledge needed to solve a problem. Proponents of case-based reasoning argue that learners benefit from being able to remember previous similar situations and reusing information and knowledge from that situation. Adaptive scenarios based on true-to-life job performance provide an opportunity to assess skills by presenting the user with choices to make in a problem-solving context. A team approach was used to develop the adaptive scenarios. Storylines were developed that incorporated situations aligning with the knowledge, skills, and attitudes outlined in the Public Health Preparedness and Response Core Competency Model. This article examines 2 adaptive scenarios: "Ready or Not? A Family Preparedness Scenario" and "Responding to a Crisis: Managing Emotions and Stress Scenario." The scenarios are available on Upper Midwest Preparedness and Emergency Response Learning Center's Learning Management System, the Training Source (http://training-source.org). Evaluation data indicate that users' experiences have been positive. Integrating the assessment and training elements of the scenarios so that the training experience is uniquely adaptive to each user is one of the most efficient ways to provide training. The opportunity to provide individualized, needs-based training without having to administer separate assessments has the potential to save time and resources. These adaptive scenarios continue to be

A generalized LSTM-like training algorithm for second-order recurrent neural networks

PubMed Central

Monner, Derek; Reggia, James A.

2011-01-01

The Long Short Term Memory (LSTM) is a second-order recurrent neural network architecture that excels at storing sequential short-term memories and retrieving them many time-steps later. LSTM’s original training algorithm provides the important properties of spatial and temporal locality, which are missing from other training approaches, at the cost of limiting it’s applicability to a small set of network architectures. Here we introduce the Generalized Long Short-Term Memory (LSTM-g) training algorithm, which provides LSTM-like locality while being applicable without modification to a much wider range of second-order network architectures. With LSTM-g, all units have an identical set of operating instructions for both activation and learning, subject only to the configuration of their local environment in the network; this is in contrast to the original LSTM training algorithm, where each type of unit has its own activation and training instructions. When applied to LSTM architectures with peephole connections, LSTM-g takes advantage of an additional source of back-propagated error which can enable better performance than the original algorithm. Enabled by the broad architectural applicability of LSTM-g, we demonstrate that training recurrent networks engineered for specific tasks can produce better results than single-layer networks. We conclude that LSTM-g has the potential to both improve the performance and broaden the applicability of spatially and temporally local gradient-based training algorithms for recurrent neural networks. PMID:21803542

Developing Adaptive Training in the Classroom

DTIC Science & Technology

2009-09-01

change to a training course: a pretest / posttest design and the use of control groups.39 The pretest / posttest comparison would entail administering the...U.S. Army Research Institute for the Behavioral and Social Sciences Research Product 2009-10 Developing Adaptive Training in...the Classroom Rose A. Mueller-Hanson Personnel Decisions Research Institutes, Inc. Michelle M. Wisecarver U.S. Army Research Institute

Training adaptations in the behavior of human motor units.

PubMed

Duchateau, Jacques; Semmler, John G; Enoka, Roger M

2006-12-01

The purpose of this brief review is to examine the neural adaptations associated with training, by focusing on the behavior of single motor units. The review synthesizes current understanding on motor unit recruitment and rate coding during voluntary contractions, briefly describes the techniques used to record motor unit activity, and then evaluates the adaptations that have been observed in motor unit activity during maximal and submaximal contractions. Relatively few studies have directly compared motor unit behavior before and after training. Although some studies suggest that the voluntary activation of muscle can increase slightly with strength training, it is not known how the discharge of motor units changes to produce this increase in activation. The evidence indicates that the increase is not attributable to changes in motor unit synchronization. It has been demonstrated, however, that training can increase both the rate of torque development and the discharge rate of motor units. Furthermore, both strength training and practice of a force-matching task can evoke adaptations in the discharge characteristics of motor units. Because the variability in discharge rate has a significant influence on the fluctuations in force during submaximal contractions, the changes produced with training can influence motor performance during activities of daily living. Little is known, however, about the relative contributions of the descending drive, afferent feedback, spinal circuitry, and motor neuron properties to the observed adaptations in motor unit activity.

Adaptive Neural Network Algorithm for Power Control in Nuclear Power Plants

NASA Astrophysics Data System (ADS)

Masri Husam Fayiz, Al

2017-01-01

The aim of this paper is to design, test and evaluate a prototype of an adaptive neural network algorithm for the power controlling system of a nuclear power plant. The task of power control in nuclear reactors is one of the fundamental tasks in this field. Therefore, researches are constantly conducted to ameliorate the power reactor control process. Currently, in the Department of Automation in the National Research Nuclear University (NRNU) MEPhI, numerous studies are utilizing various methodologies of artificial intelligence (expert systems, neural networks, fuzzy systems and genetic algorithms) to enhance the performance, safety, efficiency and reliability of nuclear power plants. In particular, a study of an adaptive artificial intelligent power regulator in the control systems of nuclear power reactors is being undertaken to enhance performance and to minimize the output error of the Automatic Power Controller (APC) on the grounds of a multifunctional computer analyzer (simulator) of the Water-Water Energetic Reactor known as Vodo-Vodyanoi Energetichesky Reaktor (VVER) in Russian. In this paper, a block diagram of an adaptive reactor power controller was built on the basis of an intelligent control algorithm. When implementing intelligent neural network principles, it is possible to improve the quality and dynamic of any control system in accordance with the principles of adaptive control. It is common knowledge that an adaptive control system permits adjusting the controller’s parameters according to the transitions in the characteristics of the control object or external disturbances. In this project, it is demonstrated that the propitious options for an automatic power controller in nuclear power plants is a control system constructed on intelligent neural network algorithms.

SIMULATION OF A REACTING POLLUTANT PUFF USING AN ADAPTIVE GRID ALGORITHM

EPA Science Inventory

A new dynamic solution adaptive grid algorithm DSAGA-PPM, has been developed for use in air quality modeling. In this paper, this algorithm is described and evaluated with a test problem. Cone-shaped distributions of various chemical species undergoing chemical reactions are rota...

Neuromuscular adaptations induced by adjacent joint training.

PubMed

Ema, R; Saito, I; Akagi, R

2018-03-01

Effects of resistance training are well known to be specific to tasks that are involved during training. However, it remains unclear whether neuromuscular adaptations are induced after adjacent joint training. This study examined the effects of hip flexion training on maximal and explosive knee extension strength and neuromuscular performance of the rectus femoris (RF, hip flexor, and knee extensor) compared with the effects of knee extension training. Thirty-seven untrained young men were randomly assigned to hip flexion training, knee extension training, or a control group. Participants in the training groups completed 4 weeks of isometric hip flexion or knee extension training. Standardized differences in the mean change between the training groups and control group were interpreted as an effect size, and the substantial effect was assumed to be ≥0.20 of the between-participant standard deviation at baseline. Both types of training resulted in substantial increases in maximal (hip flexion training group: 6.2% ± 10.1%, effect size = 0.25; knee extension training group: 20.8% ± 9.9%, effect size = 1.11) and explosive isometric knee extension torques and muscle thickness of the RF in the proximal and distal regions. Improvements in strength were accompanied by substantial enhancements in voluntary activation, which was determined using the twitch interpolation technique and RF activation. Differences in training effects on explosive torques and neural variables between the two training groups were trivial. Our findings indicate that hip flexion training results in substantial neuromuscular adaptations during knee extensions similar to those induced by knee extension training. © 2017 The Authors. Scandinavian Journal of Medicine & Science In Sports Published by John Wiley & Sons Ltd.

Three-dimensional geoelectric modelling with optimal work/accuracy rate using an adaptive wavelet algorithm

NASA Astrophysics Data System (ADS)

Plattner, A.; Maurer, H. R.; Vorloeper, J.; Dahmen, W.

2010-08-01

Despite the ever-increasing power of modern computers, realistic modelling of complex 3-D earth models is still a challenging task and requires substantial computing resources. The overwhelming majority of current geophysical modelling approaches includes either finite difference or non-adaptive finite element algorithms and variants thereof. These numerical methods usually require the subsurface to be discretized with a fine mesh to accurately capture the behaviour of the physical fields. However, this may result in excessive memory consumption and computing times. A common feature of most of these algorithms is that the modelled data discretizations are independent of the model complexity, which may be wasteful when there are only minor to moderate spatial variations in the subsurface parameters. Recent developments in the theory of adaptive numerical solvers have the potential to overcome this problem. Here, we consider an adaptive wavelet-based approach that is applicable to a large range of problems, also including nonlinear problems. In comparison with earlier applications of adaptive solvers to geophysical problems we employ here a new adaptive scheme whose core ingredients arose from a rigorous analysis of the overall asymptotically optimal computational complexity, including in particular, an optimal work/accuracy rate. Our adaptive wavelet algorithm offers several attractive features: (i) for a given subsurface model, it allows the forward modelling domain to be discretized with a quasi minimal number of degrees of freedom, (ii) sparsity of the associated system matrices is guaranteed, which makes the algorithm memory efficient and (iii) the modelling accuracy scales linearly with computing time. We have implemented the adaptive wavelet algorithm for solving 3-D geoelectric problems. To test its performance, numerical experiments were conducted with a series of conductivity models exhibiting varying degrees of structural complexity. Results were compared

Analysis of adaptive algorithms for an integrated communication network

NASA Technical Reports Server (NTRS)

Reed, Daniel A.; Barr, Matthew; Chong-Kwon, Kim

1985-01-01

Techniques were examined that trade communication bandwidth for decreased transmission delays. When the network is lightly used, these schemes attempt to use additional network resources to decrease communication delays. As the network utilization rises, the schemes degrade gracefully, still providing service but with minimal use of the network. Because the schemes use a combination of circuit and packet switching, they should respond to variations in the types and amounts of network traffic. Also, a combination of circuit and packet switching to support the widely varying traffic demands imposed on an integrated network was investigated. The packet switched component is best suited to bursty traffic where some delays in delivery are acceptable. The circuit switched component is reserved for traffic that must meet real time constraints. Selected packet routing algorithms that might be used in an integrated network were simulated. An integrated traffic places widely varying workload demands on a network. Adaptive algorithms were identified, ones that respond to both the transient and evolutionary changes that arise in integrated networks. A new algorithm was developed, hybrid weighted routing, that adapts to workload changes.

Active Recovery After High-Intensity Interval-Training Does Not Attenuate Training Adaptation.

PubMed

Wiewelhove, Thimo; Schneider, Christoph; Schmidt, Alina; Döweling, Alexander; Meyer, Tim; Kellmann, Michael; Pfeiffer, Mark; Ferrauti, Alexander

2018-01-01

Objective: High-intensity interval training (HIIT) can be extremely demanding and can consequently produce high blood lactate levels. Previous studies have shown that lactate is a potent metabolic stimulus, which is important for adaptation. Active recovery (ACT) after intensive exercise, however, enhances blood lactate removal in comparison with passive recovery (PAS) and, consequently, may attenuate endurance performance improvements. Therefore, the aim of this study was to examine the influence of regular ACT on training adaptations during a HIIT mesocycle. Methods: Twenty-six well-trained male intermittent sport athletes (age: 23.5 ± 2.5 years; O 2 max: 55.36 ± 3.69 ml min kg -1 ) participated in a randomized controlled trial consisting of 4 weeks of a running-based HIIT mesocycle with a total of 12 HIIT sessions. After each training session, participants completed 15 min of either moderate jogging (ACT) or PAS. Subjects were matched to the ACT or PAS groups according to age and performance. Before the HIIT program and 1 week after the last training session, the athletes performed a progressive incremental exercise test on a motor-driven treadmill to determine O 2 max, maximum running velocity (vmax), the running velocity at which O 2 max occurs (vO 2 max), and anaerobic lactate threshold (AT). Furthermore, repeated sprint ability (RSA) were determined. Results: In the whole group the HIIT mesocycle induced significant or small to moderate changes in vmax ( p < 0.001, effect size [ES] = 0.65,), vO 2 max ( p < 0.001, ES = 0.62), and AT ( p < 0.001, ES = 0.56) compared with the values before the intervention. O 2 max and RSA remained unchanged throughout the study. In addition, no significant differences in the changes were noted in any of the parameters between ACT and PAS except for AT ( p < 0.05, ES = 0.57). Conclusion: Regular use of individualized ACT did not attenuate training adaptations during a HIIT mesocycle compared to PAS. Interestingly, we found

Active Recovery After High-Intensity Interval-Training Does Not Attenuate Training Adaptation

PubMed Central

Wiewelhove, Thimo; Schneider, Christoph; Schmidt, Alina; Döweling, Alexander; Meyer, Tim; Kellmann, Michael; Pfeiffer, Mark; Ferrauti, Alexander

2018-01-01

Objective: High-intensity interval training (HIIT) can be extremely demanding and can consequently produce high blood lactate levels. Previous studies have shown that lactate is a potent metabolic stimulus, which is important for adaptation. Active recovery (ACT) after intensive exercise, however, enhances blood lactate removal in comparison with passive recovery (PAS) and, consequently, may attenuate endurance performance improvements. Therefore, the aim of this study was to examine the influence of regular ACT on training adaptations during a HIIT mesocycle. Methods: Twenty-six well-trained male intermittent sport athletes (age: 23.5 ± 2.5 years; O2max: 55.36 ± 3.69 ml min kg-1) participated in a randomized controlled trial consisting of 4 weeks of a running-based HIIT mesocycle with a total of 12 HIIT sessions. After each training session, participants completed 15 min of either moderate jogging (ACT) or PAS. Subjects were matched to the ACT or PAS groups according to age and performance. Before the HIIT program and 1 week after the last training session, the athletes performed a progressive incremental exercise test on a motor-driven treadmill to determine O2max, maximum running velocity (vmax), the running velocity at which O2max occurs (vO2max), and anaerobic lactate threshold (AT). Furthermore, repeated sprint ability (RSA) were determined. Results: In the whole group the HIIT mesocycle induced significant or small to moderate changes in vmax (p < 0.001, effect size [ES] = 0.65,), vO2max (p < 0.001, ES = 0.62), and AT (p < 0.001, ES = 0.56) compared with the values before the intervention. O2max and RSA remained unchanged throughout the study. In addition, no significant differences in the changes were noted in any of the parameters between ACT and PAS except for AT (p < 0.05, ES = 0.57). Conclusion: Regular use of individualized ACT did not attenuate training adaptations during a HIIT mesocycle compared to PAS. Interestingly, we found that the ACT group

An adaptive tensor voting algorithm combined with texture spectrum

NASA Astrophysics Data System (ADS)

Wang, Gang; Su, Qing-tang; Lü, Gao-huan; Zhang, Xiao-feng; Liu, Yu-huan; He, An-zhi

2015-01-01

An adaptive tensor voting algorithm combined with texture spectrum is proposed. The image texture spectrum is used to get the adaptive scale parameter of voting field. Then the texture information modifies both the attenuation coefficient and the attenuation field so that we can use this algorithm to create more significant and correct structures in the original image according to the human visual perception. At the same time, the proposed method can improve the edge extraction quality, which includes decreasing the flocculent region efficiently and making image clear. In the experiment for extracting pavement cracks, the original pavement image is processed by the proposed method which is combined with the significant curve feature threshold procedure, and the resulted image displays the faint crack signals submerged in the complicated background efficiently and clearly.

An adaptive clustering algorithm for image matching based on corner feature

NASA Astrophysics Data System (ADS)

Wang, Zhe; Dong, Min; Mu, Xiaomin; Wang, Song

2018-04-01

The traditional image matching algorithm always can not balance the real-time and accuracy better, to solve the problem, an adaptive clustering algorithm for image matching based on corner feature is proposed in this paper. The method is based on the similarity of the matching pairs of vector pairs, and the adaptive clustering is performed on the matching point pairs. Harris corner detection is carried out first, the feature points of the reference image and the perceived image are extracted, and the feature points of the two images are first matched by Normalized Cross Correlation (NCC) function. Then, using the improved algorithm proposed in this paper, the matching results are clustered to reduce the ineffective operation and improve the matching speed and robustness. Finally, the Random Sample Consensus (RANSAC) algorithm is used to match the matching points after clustering. The experimental results show that the proposed algorithm can effectively eliminate the most wrong matching points while the correct matching points are retained, and improve the accuracy of RANSAC matching, reduce the computation load of whole matching process at the same time.

Estimating meme fitness in adaptive memetic algorithms for combinatorial problems.

PubMed

Smith, J E

2012-01-01

Among the most promising and active research areas in heuristic optimisation is the field of adaptive memetic algorithms (AMAs). These gain much of their reported robustness by adapting the probability with which each of a set of local improvement operators is applied, according to an estimate of their current value to the search process. This paper addresses the issue of how the current value should be estimated. Assuming the estimate occurs over several applications of a meme, we consider whether the extreme or mean improvements should be used, and whether this aggregation should be global, or local to some part of the solution space. To investigate these issues, we use the well-established COMA framework that coevolves the specification of a population of memes (representing different local search algorithms) alongside a population of candidate solutions to the problem at hand. Two very different memetic algorithms are considered: the first using adaptive operator pursuit to adjust the probabilities of applying a fixed set of memes, and a second which applies genetic operators to dynamically adapt and create memes and their functional definitions. For the latter, especially on combinatorial problems, credit assignment mechanisms based on historical records, or on notions of landscape locality, will have limited application, and it is necessary to estimate the value of a meme via some form of sampling. The results on a set of binary encoded combinatorial problems show that both methods are very effective, and that for some problems it is necessary to use thousands of variables in order to tease apart the differences between different reward schemes. However, for both memetic algorithms, a significant pattern emerges that reward based on mean improvement is better than that based on extreme improvement. This contradicts recent findings from adapting the parameters of operators involved in global evolutionary search. The results also show that local reward schemes

Fast Adapting Ensemble: A New Algorithm for Mining Data Streams with Concept Drift

PubMed Central

Ortíz Díaz, Agustín; Ramos-Jiménez, Gonzalo; Frías Blanco, Isvani; Caballero Mota, Yailé; Morales-Bueno, Rafael

2015-01-01

The treatment of large data streams in the presence of concept drifts is one of the main challenges in the field of data mining, particularly when the algorithms have to deal with concepts that disappear and then reappear. This paper presents a new algorithm, called Fast Adapting Ensemble (FAE), which adapts very quickly to both abrupt and gradual concept drifts, and has been specifically designed to deal with recurring concepts. FAE processes the learning examples in blocks of the same size, but it does not have to wait for the batch to be complete in order to adapt its base classification mechanism. FAE incorporates a drift detector to improve the handling of abrupt concept drifts and stores a set of inactive classifiers that represent old concepts, which are activated very quickly when these concepts reappear. We compare our new algorithm with various well-known learning algorithms, taking into account, common benchmark datasets. The experiments show promising results from the proposed algorithm (regarding accuracy and runtime), handling different types of concept drifts. PMID:25879051

A Demons algorithm for image registration with locally adaptive regularization.

PubMed

Cahill, Nathan D; Noble, J Alison; Hawkes, David J

2009-01-01

Thirion's Demons is a popular algorithm for nonrigid image registration because of its linear computational complexity and ease of implementation. It approximately solves the diffusion registration problem by successively estimating force vectors that drive the deformation toward alignment and smoothing the force vectors by Gaussian convolution. In this article, we show how the Demons algorithm can be generalized to allow image-driven locally adaptive regularization in a manner that preserves both the linear complexity and ease of implementation of the original Demons algorithm. We show that the proposed algorithm exhibits lower target registration error and requires less computational effort than the original Demons algorithm on the registration of serial chest CT scans of patients with lung nodules.

Performance study of LMS based adaptive algorithms for unknown system identification

NASA Astrophysics Data System (ADS)

Javed, Shazia; Ahmad, Noor Atinah

2014-07-01

Adaptive filtering techniques have gained much popularity in the modeling of unknown system identification problem. These techniques can be classified as either iterative or direct. Iterative techniques include stochastic descent method and its improved versions in affine space. In this paper we present a comparative study of the least mean square (LMS) algorithm and some improved versions of LMS, more precisely the normalized LMS (NLMS), LMS-Newton, transform domain LMS (TDLMS) and affine projection algorithm (APA). The performance evaluation of these algorithms is carried out using adaptive system identification (ASI) model with random input signals, in which the unknown (measured) signal is assumed to be contaminated by output noise. Simulation results are recorded to compare the performance in terms of convergence speed, robustness, misalignment, and their sensitivity to the spectral properties of input signals. Main objective of this comparative study is to observe the effects of fast convergence rate of improved versions of LMS algorithms on their robustness and misalignment.

Performance study of LMS based adaptive algorithms for unknown system identification

DOE Office of Scientific and Technical Information (OSTI.GOV)

Javed, Shazia; Ahmad, Noor Atinah

Adaptive filtering techniques have gained much popularity in the modeling of unknown system identification problem. These techniques can be classified as either iterative or direct. Iterative techniques include stochastic descent method and its improved versions in affine space. In this paper we present a comparative study of the least mean square (LMS) algorithm and some improved versions of LMS, more precisely the normalized LMS (NLMS), LMS-Newton, transform domain LMS (TDLMS) and affine projection algorithm (APA). The performance evaluation of these algorithms is carried out using adaptive system identification (ASI) model with random input signals, in which the unknown (measured) signalmore » is assumed to be contaminated by output noise. Simulation results are recorded to compare the performance in terms of convergence speed, robustness, misalignment, and their sensitivity to the spectral properties of input signals. Main objective of this comparative study is to observe the effects of fast convergence rate of improved versions of LMS algorithms on their robustness and misalignment.« less

Specific Stimuli Induce Specific Adaptations: Sensorimotor Training vs. Reactive Balance Training

PubMed Central

Freyler, Kathrin; Krause, Anne; Gollhofer, Albert; Ritzmann, Ramona

2016-01-01

Typically, balance training has been used as an intervention paradigm either as static or as reactive balance training. Possible differences in functional outcomes between the two modalities have not been profoundly studied. The objective of the study was to investigate the specificity of neuromuscular adaptations in response to two balance intervention modalities within test and intervention paradigms containing characteristics of both profiles: classical sensorimotor training (SMT) referring to a static ledger pivoting around the ankle joint vs. reactive balance training (RBT) using externally applied perturbations to deteriorate body equilibrium. Thirty-eight subjects were assigned to either SMT or RBT. Before and after four weeks of intervention training, postural sway and electromyographic activities of shank and thigh muscles were recorded and co-contraction indices (CCI) were calculated. We argue that specificity of training interventions could be transferred into corresponding test settings containing properties of SMT and RBT, respectively. The results revealed that i) postural sway was reduced in both intervention groups in all test paradigms; magnitude of changes and effect sizes differed dependent on the paradigm: when training and paradigm coincided most, effects were augmented (P<0.05). ii) These specificities were accompanied by segmental modulations in the amount of CCI, with a greater reduction within the CCI of thigh muscles after RBT compared to the shank muscles after SMT (P<0.05). The results clearly indicate the relationship between test and intervention specificity in balance performance. Hence, specific training modalities of postural control cause multi-segmental and context-specific adaptations, depending upon the characteristics of the trained postural strategy. In relation to fall prevention, perturbation training could serve as an extension to SMT to include the proximal segment, and thus the control of structures near to the body�

Formulation and implementation of nonstationary adaptive estimation algorithm with applications to air-data reconstruction

NASA Technical Reports Server (NTRS)

Whitmore, S. A.

1985-01-01

The dynamics model and data sources used to perform air-data reconstruction are discussed, as well as the Kalman filter. The need for adaptive determination of the noise statistics of the process is indicated. The filter innovations are presented as a means of developing the adaptive criterion, which is based on the true mean and covariance of the filter innovations. A method for the numerical approximation of the mean and covariance of the filter innovations is presented. The algorithm as developed is applied to air-data reconstruction for the space shuttle, and data obtained from the third landing are presented. To verify the performance of the adaptive algorithm, the reconstruction is also performed using a constant covariance Kalman filter. The results of the reconstructions are compared, and the adaptive algorithm exhibits better performance.

Parameter estimation for chaotic systems using a hybrid adaptive cuckoo search with simulated annealing algorithm

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sheng, Zheng, E-mail: 19994035@sina.com; Wang, Jun; Zhou, Bihua

2014-03-15

This paper introduces a novel hybrid optimization algorithm to establish the parameters of chaotic systems. In order to deal with the weaknesses of the traditional cuckoo search algorithm, the proposed adaptive cuckoo search with simulated annealing algorithm is presented, which incorporates the adaptive parameters adjusting operation and the simulated annealing operation in the cuckoo search algorithm. Normally, the parameters of the cuckoo search algorithm are kept constant that may result in decreasing the efficiency of the algorithm. For the purpose of balancing and enhancing the accuracy and convergence rate of the cuckoo search algorithm, the adaptive operation is presented tomore » tune the parameters properly. Besides, the local search capability of cuckoo search algorithm is relatively weak that may decrease the quality of optimization. So the simulated annealing operation is merged into the cuckoo search algorithm to enhance the local search ability and improve the accuracy and reliability of the results. The functionality of the proposed hybrid algorithm is investigated through the Lorenz chaotic system under the noiseless and noise condition, respectively. The numerical results demonstrate that the method can estimate parameters efficiently and accurately in the noiseless and noise condition. Finally, the results are compared with the traditional cuckoo search algorithm, genetic algorithm, and particle swarm optimization algorithm. Simulation results demonstrate the effectiveness and superior performance of the proposed algorithm.« less

Adaptive Load-Balancing Algorithms Using Symmetric Broadcast Networks

NASA Technical Reports Server (NTRS)

Das, Sajal K.; Biswas, Rupak; Chancellor, Marisa K. (Technical Monitor)

1997-01-01

In a distributed-computing environment, it is important to ensure that the processor workloads are adequately balanced. Among numerous load-balancing algorithms, a unique approach due to Dam and Prasad defines a symmetric broadcast network (SBN) that provides a robust communication pattern among the processors in a topology-independent manner. In this paper, we propose and analyze three novel SBN-based load-balancing algorithms, and implement them on an SP2. A thorough experimental study with Poisson-distributed synthetic loads demonstrates that these algorithms are very effective in balancing system load while minimizing processor idle time. They also compare favorably with several other existing load-balancing techniques. Additional experiments performed with real data demonstrate that the SBN approach is effective in adaptive computational science and engineering applications where dynamic load balancing is extremely crucial.

A kernel adaptive algorithm for quaternion-valued inputs.

PubMed

Paul, Thomas K; Ogunfunmi, Tokunbo

2015-10-01

The use of quaternion data can provide benefit in applications like robotics and image recognition, and particularly for performing transforms in 3-D space. Here, we describe a kernel adaptive algorithm for quaternions. A least mean square (LMS)-based method was used, resulting in the derivation of the quaternion kernel LMS (Quat-KLMS) algorithm. Deriving this algorithm required describing the idea of a quaternion reproducing kernel Hilbert space (RKHS), as well as kernel functions suitable with quaternions. A modified HR calculus for Hilbert spaces was used to find the gradient of cost functions defined on a quaternion RKHS. In addition, the use of widely linear (or augmented) filtering is proposed to improve performance. The benefit of the Quat-KLMS and widely linear forms in learning nonlinear transformations of quaternion data are illustrated with simulations.

Establishing a Dynamic Self-Adaptation Learning Algorithm of the BP Neural Network and Its Applications

NASA Astrophysics Data System (ADS)

Li, Xiaofeng; Xiang, Suying; Zhu, Pengfei; Wu, Min

2015-12-01

In order to avoid the inherent deficiencies of the traditional BP neural network, such as slow convergence speed, that easily leading to local minima, poor generalization ability and difficulty in determining the network structure, the dynamic self-adaptive learning algorithm of the BP neural network is put forward to improve the function of the BP neural network. The new algorithm combines the merit of principal component analysis, particle swarm optimization, correlation analysis and self-adaptive model, hence can effectively solve the problems of selecting structural parameters, initial connection weights and thresholds and learning rates of the BP neural network. This new algorithm not only reduces the human intervention, optimizes the topological structures of BP neural networks and improves the network generalization ability, but also accelerates the convergence speed of a network, avoids trapping into local minima, and enhances network adaptation ability and prediction ability. The dynamic self-adaptive learning algorithm of the BP neural network is used to forecast the total retail sale of consumer goods of Sichuan Province, China. Empirical results indicate that the new algorithm is superior to the traditional BP network algorithm in predicting accuracy and time consumption, which shows the feasibility and effectiveness of the new algorithm.

Closed-Loop Task Difficulty Adaptation during Virtual Reality Reach-to-Grasp Training Assisted with an Exoskeleton for Stroke Rehabilitation

PubMed Central

Grimm, Florian; Naros, Georgios; Gharabaghi, Alireza

2016-01-01

Stroke patients with severe motor deficits of the upper extremity may practice rehabilitation exercises with the assistance of a multi-joint exoskeleton. Although this technology enables intensive task-oriented training, it may also lead to slacking when the assistance is too supportive. Preserving the engagement of the patients while providing “assistance-as-needed” during the exercises, therefore remains an ongoing challenge. We applied a commercially available seven degree-of-freedom arm exoskeleton to provide passive gravity compensation during task-oriented training in a virtual environment. During this 4-week pilot study, five severely affected chronic stroke patients performed reach-to-grasp exercises resembling activities of daily living. The subjects received virtual reality feedback from their three-dimensional movements. The level of difficulty for the exercise was adjusted by a performance-dependent real-time adaptation algorithm. The goal of this algorithm was the automated improvement of the range of motion. In the course of 20 training and feedback sessions, this unsupervised adaptive training concept led to a progressive increase of the virtual training space (p < 0.001) in accordance with the subjects' abilities. This learning curve was paralleled by a concurrent improvement of real world kinematic parameters, i.e., range of motion (p = 0.008), accuracy of movement (p = 0.01), and movement velocity (p < 0.001). Notably, these kinematic gains were paralleled by motor improvements such as increased elbow movement (p = 0.001), grip force (p < 0.001), and upper extremity Fugl-Meyer-Assessment score from 14.3 ± 5 to 16.9 ± 6.1 (p = 0.026). Combining gravity-compensating assistance with adaptive closed-loop feedback in virtual reality provides customized rehabilitation environments for severely affected stroke patients. This approach may facilitate motor learning by progressively challenging the subject in accordance with the individual capacity

Closed-Loop Task Difficulty Adaptation during Virtual Reality Reach-to-Grasp Training Assisted with an Exoskeleton for Stroke Rehabilitation.

PubMed

Grimm, Florian; Naros, Georgios; Gharabaghi, Alireza

2016-01-01

Stroke patients with severe motor deficits of the upper extremity may practice rehabilitation exercises with the assistance of a multi-joint exoskeleton. Although this technology enables intensive task-oriented training, it may also lead to slacking when the assistance is too supportive. Preserving the engagement of the patients while providing "assistance-as-needed" during the exercises, therefore remains an ongoing challenge. We applied a commercially available seven degree-of-freedom arm exoskeleton to provide passive gravity compensation during task-oriented training in a virtual environment. During this 4-week pilot study, five severely affected chronic stroke patients performed reach-to-grasp exercises resembling activities of daily living. The subjects received virtual reality feedback from their three-dimensional movements. The level of difficulty for the exercise was adjusted by a performance-dependent real-time adaptation algorithm. The goal of this algorithm was the automated improvement of the range of motion. In the course of 20 training and feedback sessions, this unsupervised adaptive training concept led to a progressive increase of the virtual training space ( p < 0.001) in accordance with the subjects' abilities. This learning curve was paralleled by a concurrent improvement of real world kinematic parameters, i.e., range of motion ( p = 0.008), accuracy of movement ( p = 0.01), and movement velocity ( p < 0.001). Notably, these kinematic gains were paralleled by motor improvements such as increased elbow movement ( p = 0.001), grip force ( p < 0.001), and upper extremity Fugl-Meyer-Assessment score from 14.3 ± 5 to 16.9 ± 6.1 ( p = 0.026). Combining gravity-compensating assistance with adaptive closed-loop feedback in virtual reality provides customized rehabilitation environments for severely affected stroke patients. This approach may facilitate motor learning by progressively challenging the subject in accordance with the individual capacity

Fully implicit moving mesh adaptive algorithm

NASA Astrophysics Data System (ADS)

Chacon, Luis

2005-10-01

In many problems of interest, the numerical modeler is faced with the challenge of dealing with multiple time and length scales. The former is best dealt with with fully implicit methods, which are able to step over fast frequencies to resolve the dynamical time scale of interest. The latter requires grid adaptivity for efficiency. Moving-mesh grid adaptive methods are attractive because they can be designed to minimize the numerical error for a given resolution. However, the required grid governing equations are typically very nonlinear and stiff, and of considerably difficult numerical treatment. Not surprisingly, fully coupled, implicit approaches where the grid and the physics equations are solved simultaneously are rare in the literature, and circumscribed to 1D geometries. In this study, we present a fully implicit algorithm for moving mesh methods that is feasible for multidimensional geometries. A crucial element is the development of an effective multilevel treatment of the grid equation.ootnotetextL. Chac'on, G. Lapenta, A fully implicit, nonlinear adaptive grid strategy, J. Comput. Phys., accepted (2005) We will show that such an approach is competitive vs. uniform grids both from the accuracy (due to adaptivity) and the efficiency standpoints. Results for a variety of models 1D and 2D geometries, including nonlinear diffusion, radiation-diffusion, Burgers equation, and gas dynamics will be presented.

An analysis of neural receptive field plasticity by point process adaptive filtering

PubMed Central

Brown, Emery N.; Nguyen, David P.; Frank, Loren M.; Wilson, Matthew A.; Solo, Victor

2001-01-01

Neural receptive fields are plastic: with experience, neurons in many brain regions change their spiking responses to relevant stimuli. Analysis of receptive field plasticity from experimental measurements is crucial for understanding how neural systems adapt their representations of relevant biological information. Current analysis methods using histogram estimates of spike rate functions in nonoverlapping temporal windows do not track the evolution of receptive field plasticity on a fine time scale. Adaptive signal processing is an established engineering paradigm for estimating time-varying system parameters from experimental measurements. We present an adaptive filter algorithm for tracking neural receptive field plasticity based on point process models of spike train activity. We derive an instantaneous steepest descent algorithm by using as the criterion function the instantaneous log likelihood of a point process spike train model. We apply the point process adaptive filter algorithm in a study of spatial (place) receptive field properties of simulated and actual spike train data from rat CA1 hippocampal neurons. A stability analysis of the algorithm is sketched in the Appendix. The adaptive algorithm can update the place field parameter estimates on a millisecond time scale. It reliably tracked the migration, changes in scale, and changes in maximum firing rate characteristic of hippocampal place fields in a rat running on a linear track. Point process adaptive filtering offers an analytic method for studying the dynamics of neural receptive fields. PMID:11593043

Impedance computed tomography using an adaptive smoothing coefficient algorithm.

PubMed

Suzuki, A; Uchiyama, A

2001-01-01

In impedance computed tomography, a fixed coefficient regularization algorithm has been frequently used to improve the ill-conditioning problem of the Newton-Raphson algorithm. However, a lot of experimental data and a long period of computation time are needed to determine a good smoothing coefficient because a good smoothing coefficient has to be manually chosen from a number of coefficients and is a constant for each iteration calculation. Thus, sometimes the fixed coefficient regularization algorithm distorts the information or fails to obtain any effect. In this paper, a new adaptive smoothing coefficient algorithm is proposed. This algorithm automatically calculates the smoothing coefficient from the eigenvalue of the ill-conditioned matrix. Therefore, the effective images can be obtained within a short computation time. Also the smoothing coefficient is automatically adjusted by the information related to the real resistivity distribution and the data collection method. In our impedance system, we have reconstructed the resistivity distributions of two phantoms using this algorithm. As a result, this algorithm only needs one-fifth the computation time compared to the fixed coefficient regularization algorithm. When compared to the fixed coefficient regularization algorithm, it shows that the image is obtained more rapidly and applicable in real-time monitoring of the blood vessel.

An adaptive bit synchronization algorithm under time-varying environment.

NASA Technical Reports Server (NTRS)

Chow, L. R.; Owen, H. A., Jr.; Wang, P. P.

1973-01-01

This paper presents an adaptive estimation algorithm for bit synchronization, assuming that the parameters of the incoming data process are time-varying. Experiment results have proved that this synchronizer is workable either judged by the amount of data required or the speed of convergence.

Adaptive Numerical Algorithms in Space Weather Modeling

NASA Technical Reports Server (NTRS)

Toth, Gabor; vanderHolst, Bart; Sokolov, Igor V.; DeZeeuw, Darren; Gombosi, Tamas I.; Fang, Fang; Manchester, Ward B.; Meng, Xing; Nakib, Dalal; Powell, Kenneth G.;

Control algorithms and applications of the wavefront sensorless adaptive optics

NASA Astrophysics Data System (ADS)

Ma, Liang; Wang, Bin; Zhou, Yuanshen; Yang, Huizhen

2017-10-01

Compared with the conventional adaptive optics (AO) system, the wavefront sensorless (WFSless) AO system need not to measure the wavefront and reconstruct it. It is simpler than the conventional AO in system architecture and can be applied to the complex conditions. Based on the analysis of principle and system model of the WFSless AO system, wavefront correction methods of the WFSless AO system were divided into two categories: model-free-based and model-based control algorithms. The WFSless AO system based on model-free-based control algorithms commonly considers the performance metric as a function of the control parameters and then uses certain control algorithm to improve the performance metric. The model-based control algorithms include modal control algorithms, nonlinear control algorithms and control algorithms based on geometrical optics. Based on the brief description of above typical control algorithms, hybrid methods combining the model-free-based control algorithm with the model-based control algorithm were generalized. Additionally, characteristics of various control algorithms were compared and analyzed. We also discussed the extensive applications of WFSless AO system in free space optical communication (FSO), retinal imaging in the human eye, confocal microscope, coherent beam combination (CBC) techniques and extended objects.

Thermoregulatory adaptations associated with training and heat acclimation.

PubMed

Geor, R J; McCutcheon, L J

1998-04-01

The large metabolic heat load generated as a consequence of muscular work requires activation of thermoregulatory mechanisms in order to prevent an excessive and potentially dangerous rise in body temperature during exercise. Although the horse has highly efficient heat dissipatory mechanisms, there are a number of circumstances in which the thermoregulatory system may be overwhelmed, resulting in the development of critical hyperthermia. The risk for development of life-threatening hyperthermia is greatest when (1) the horse is inadequately conditioned for the required level of physical performance; (2) exercise is undertaken in hot and particularly, in hot and humid ambient conditions; and (3) there is an impairment to thermoregulatory mechanisms (e.g., severe dehydration, anhidrosis). Both exercise training under cool to moderate ambient conditions and a period of repeated exposure to, and exercise in, hot ambient conditions (heat acclimation) will result in a number of physiologic adaptations conferring improved thermoregulatory ability. These adaptations include an expanded plasma volume, greater stability of cardiovascular function during exercise, and an improved efficiency of evaporative heat loss as a result of alterations in the sweating response. Collectively, these adjustments serve to attenuate the rise in core body temperature in response to a given intensity of exercise. The magnitude of the physiologic adaptations occurring during exercise training and heat acclimation is a reflection of the thermal load imposed on the horse. Therefore, when compared with a period of training in cool conditions, the larger thermal stimulus associated with repeated exercise in hot ambient conditions will invoke proportionally greater thermoregulatory adaptations. Although it is not possible to eliminate the effects of adverse environmental conditions on exercise performance, it is clear that a thorough exercise training program together with a subsequent period of

Training to Facilitate Adaptation to Novel Sensory Environments

NASA Technical Reports Server (NTRS)

Bloomberg, J. J.; Peters, B. T.; Mulavara, A. P.; Brady, R. A.; Batson, C. D.; Ploutz-Snyder, R. J.; Cohen, H. S.

2010-01-01

After spaceflight, the process of readapting to Earth s gravity causes locomotor dysfunction. We are developing a gait training countermeasure to facilitate adaptive responses in locomotor function. Our training system is comprised of a treadmill placed on a motion-base facing a virtual visual scene that provides an unstable walking surface combined with incongruent visual flow designed to train subjects to rapidly adapt their gait patterns to changes in the sensory environment. The goal of our present study was to determine if training improved both the locomotor and dual-tasking ability responses to a novel sensory environment and to quantify the retention of training. Subjects completed three, 30-minute training sessions during which they walked on the treadmill while receiving discordant support surface and visual input. Control subjects walked on the treadmill without any support surface or visual alterations. To determine the efficacy of training, all subjects were then tested using a novel visual flow and support surface movement not previously experienced during training. This test was performed 20 minutes, 1 week, and 1, 3, and 6 months after the final training session. Stride frequency and auditory reaction time were collected as measures of postural stability and cognitive effort, respectively. Subjects who received training showed less alteration in stride frequency and auditory reaction time compared to controls. Trained subjects maintained their level of performance over 6 months. We conclude that, with training, individuals became more proficient at walking in novel discordant sensorimotor conditions and were able to devote more attention to competing tasks.

CHAMP: a locally adaptive unmixing-based hyperspectral anomaly detection algorithm

NASA Astrophysics Data System (ADS)

Crist, Eric P.; Thelen, Brian J.; Carrara, David A.

1998-10-01

Anomaly detection offers a means by which to identify potentially important objects in a scene without prior knowledge of their spectral signatures. As such, this approach is less sensitive to variations in target class composition, atmospheric and illumination conditions, and sensor gain settings than would be a spectral matched filter or similar algorithm. The best existing anomaly detectors generally fall into one of two categories: those based on local Gaussian statistics, and those based on linear mixing moles. Unmixing-based approaches better represent the real distribution of data in a scene, but are typically derived and applied on a global or scene-wide basis. Locally adaptive approaches allow detection of more subtle anomalies by accommodating the spatial non-homogeneity of background classes in a typical scene, but provide a poorer representation of the true underlying background distribution. The CHAMP algorithm combines the best attributes of both approaches, applying a linear-mixing model approach in a spatially adaptive manner. The algorithm itself, and teste results on simulated and actual hyperspectral image data, are presented in this paper.

Adapting a perinatal empathic training method from South Africa to Germany.

PubMed

Knapp, Caprice; Honikman, Simone; Wirsching, Michael; Husni-Pascha, Gidah; Hänselmann, Eva

2018-01-01

Maternal mental health conditions are prevalent across the world. For women, the perinatal period is associated with increased rates of depression and anxiety. At the same time, there is widespread documentation of disrespectful care for women by maternity health staff. Improving the empathic engagement skills of maternity healthcare workers may enable them to respond to the mental health needs of their clients more effectively. In South Africa, a participatory empathic training method, the "Secret History" has been used as part of a national Department of Health training program with maternity staff and has showed promising results. For this paper, we aimed to describe an adaptation of the Secret History empathic training method from the South African to the German setting and to evaluate the adapted training. The pilot study occurred in an academic medical center in Germany. A focus group ( n  = 8) was used to adapt the training by describing the local context and changing the materials to be relevant to Germany. After adapting the materials, the pilot training was conducted with a mixed group of professionals ( n  = 15), many of whom were trainers themselves. A pre-post survey assessed the participants' empathy levels and attitudes towards the training method. In adapting the materials, the focus group discussion generated several experiences that were considered to be typical interpersonal and structural challenges facing healthcare workers in maternal care in Germany. These experiences were crafted into case scenarios that then formed the basis of the activities used in the Secret History empathic training pilot. Evaluation of the pilot training showed that although the participants had high levels of empathy in the pre-phase (100% estimated their empathic ability as high or very high), 69% became more aware of their own emotional experiences with patients and the need for self-care after the training. A majority, or 85%, indicated that the training

Cardiovascular Adaptations Induced by Resistance Training in Animal Models.

PubMed

Melo, S F S; da Silva Júnior, N D; Barauna, V G; Oliveira, E M

2018-01-01

In the last 10 years the number of studies showing the benefits of resistance training (RT) to the cardiovascular system, have grown. In comparison to aerobic training, RT-induced favorable adaptations to the cardiovascular system have been ignored for many years, thus the mechanisms of the RT-induced cardiovascular adaptations are still uncovered. The lack of animal models with comparable protocols to the RT performed by humans hampers the knowledge. We have used squat-exercise model, which is widely used by many others laboratories. However, to a lesser extent, other models are also employed to investigate the cardiovascular adaptations. In the subsequent sections we will review the information regarding cardiac morphological adaptations, signaling pathway of the cardiac cell, cardiac function and the vascular adaptation induced by RT using this animal model developed by Tamaki et al. in 1992. Furthermore, we also describe cardiovascular findings observed using other animal models of RT.

Landsat ecosystem disturbance adaptive processing system (LEDAPS) algorithm description

USGS Publications Warehouse

Schmidt, Gail; Jenkerson, Calli B.; Masek, Jeffrey; Vermote, Eric; Gao, Feng

2013-01-01

The Landsat Ecosystem Disturbance Adaptive Processing System (LEDAPS) software was originally developed by the National Aeronautics and Space Administration–Goddard Space Flight Center and the University of Maryland to produce top-of-atmosphere reflectance from LandsatThematic Mapper and Enhanced Thematic Mapper Plus Level 1 digital numbers and to apply atmospheric corrections to generate a surface-reflectance product.The U.S. Geological Survey (USGS) has adopted the LEDAPS algorithm for producing the Landsat Surface Reflectance Climate Data Record.This report discusses the LEDAPS algorithm, which was implemented by the USGS.

Manifold absolute pressure estimation using neural network with hybrid training algorithm

PubMed Central

Selamat, Hazlina; Alimin, Ahmad Jais; Haniff, Mohamad Fadzli

2017-01-01

In a modern small gasoline engine fuel injection system, the load of the engine is estimated based on the measurement of the manifold absolute pressure (MAP) sensor, which took place in the intake manifold. This paper present a more economical approach on estimating the MAP by using only the measurements of the throttle position and engine speed, resulting in lower implementation cost. The estimation was done via two-stage multilayer feed-forward neural network by combining Levenberg-Marquardt (LM) algorithm, Bayesian Regularization (BR) algorithm and Particle Swarm Optimization (PSO) algorithm. Based on the results found in 20 runs, the second variant of the hybrid algorithm yields a better network performance than the first variant of hybrid algorithm, LM, LM with BR and PSO by estimating the MAP closely to the simulated MAP values. By using a valid experimental training data, the estimator network that trained with the second variant of the hybrid algorithm showed the best performance among other algorithms when used in an actual retrofit fuel injection system (RFIS). The performance of the estimator was also validated in steady-state and transient condition by showing a closer MAP estimation to the actual value. PMID:29190779

An adaptive displacement estimation algorithm for improved reconstruction of thermal strain.

PubMed

Ding, Xuan; Dutta, Debaditya; Mahmoud, Ahmed M; Tillman, Bryan; Leers, Steven A; Kim, Kang

2015-01-01

Thermal strain imaging (TSI) can be used to differentiate between lipid and water-based tissues in atherosclerotic arteries. However, detecting small lipid pools in vivo requires accurate and robust displacement estimation over a wide range of displacement magnitudes. Phase-shift estimators such as Loupas' estimator and time-shift estimators such as normalized cross-correlation (NXcorr) are commonly used to track tissue displacements. However, Loupas' estimator is limited by phase-wrapping and NXcorr performs poorly when the SNR is low. In this paper, we present an adaptive displacement estimation algorithm that combines both Loupas' estimator and NXcorr. We evaluated this algorithm using computer simulations and an ex vivo human tissue sample. Using 1-D simulation studies, we showed that when the displacement magnitude induced by thermal strain was >λ/8 and the electronic system SNR was >25.5 dB, the NXcorr displacement estimate was less biased than the estimate found using Loupas' estimator. On the other hand, when the displacement magnitude was ≤λ/4 and the electronic system SNR was ≤25.5 dB, Loupas' estimator had less variance than NXcorr. We used these findings to design an adaptive displacement estimation algorithm. Computer simulations of TSI showed that the adaptive displacement estimator was less biased than either Loupas' estimator or NXcorr. Strain reconstructed from the adaptive displacement estimates improved the strain SNR by 43.7 to 350% and the spatial accuracy by 1.2 to 23.0% (P < 0.001). An ex vivo human tissue study provided results that were comparable to computer simulations. The results of this study showed that a novel displacement estimation algorithm, which combines two different displacement estimators, yielded improved displacement estimation and resulted in improved strain reconstruction.

An Adaptive Displacement Estimation Algorithm for Improved Reconstruction of Thermal Strain

PubMed Central

Ding, Xuan; Dutta, Debaditya; Mahmoud, Ahmed M.; Tillman, Bryan; Leers, Steven A.; Kim, Kang

2014-01-01

Thermal strain imaging (TSI) can be used to differentiate between lipid and water-based tissues in atherosclerotic arteries. However, detecting small lipid pools in vivo requires accurate and robust displacement estimation over a wide range of displacement magnitudes. Phase-shift estimators such as Loupas’ estimator and time-shift estimators like normalized cross-correlation (NXcorr) are commonly used to track tissue displacements. However, Loupas’ estimator is limited by phase-wrapping and NXcorr performs poorly when the signal-to-noise ratio (SNR) is low. In this paper, we present an adaptive displacement estimation algorithm that combines both Loupas’ estimator and NXcorr. We evaluated this algorithm using computer simulations and an ex-vivo human tissue sample. Using 1-D simulation studies, we showed that when the displacement magnitude induced by thermal strain was >λ/8 and the electronic system SNR was >25.5 dB, the NXcorr displacement estimate was less biased than the estimate found using Loupas’ estimator. On the other hand, when the displacement magnitude was ≤λ/4 and the electronic system SNR was ≤25.5 dB, Loupas’ estimator had less variance than NXcorr. We used these findings to design an adaptive displacement estimation algorithm. Computer simulations of TSI using Field II showed that the adaptive displacement estimator was less biased than either Loupas’ estimator or NXcorr. Strain reconstructed from the adaptive displacement estimates improved the strain SNR by 43.7–350% and the spatial accuracy by 1.2–23.0% (p < 0.001). An ex-vivo human tissue study provided results that were comparable to computer simulations. The results of this study showed that a novel displacement estimation algorithm, which combines two different displacement estimators, yielded improved displacement estimation and results in improved strain reconstruction. PMID:25585398

Training-specific functional, neural, and hypertrophic adaptations to explosive- vs. sustained-contraction strength training.

PubMed

Balshaw, Thomas G; Massey, Garry J; Maden-Wilkinson, Thomas M; Tillin, Neale A; Folland, Jonathan P

2016-06-01

Training specificity is considered important for strength training, although the functional and underpinning physiological adaptations to different types of training, including brief explosive contractions, are poorly understood. This study compared the effects of 12 wk of explosive-contraction (ECT, n = 13) vs. sustained-contraction (SCT, n = 16) strength training vs. control (n = 14) on the functional, neural, hypertrophic, and intrinsic contractile characteristics of healthy young men. Training involved 40 isometric knee extension repetitions (3 times/wk): contracting as fast and hard as possible for ∼1 s (ECT) or gradually increasing to 75% of maximum voluntary torque (MVT) before holding for 3 s (SCT). Torque and electromyography during maximum and explosive contractions, torque during evoked octet contractions, and total quadriceps muscle volume (QUADSVOL) were quantified pre and post training. MVT increased more after SCT than ECT [23 vs. 17%; effect size (ES) = 0.69], with similar increases in neural drive, but greater QUADSVOL changes after SCT (8.1 vs. 2.6%; ES = 0.74). ECT improved explosive torque at all time points (17-34%; 0.54 ≤ ES ≤ 0.76) because of increased neural drive (17-28%), whereas only late-phase explosive torque (150 ms, 12%; ES = 1.48) and corresponding neural drive (18%) increased after SCT. Changes in evoked torque indicated slowing of the contractile properties of the muscle-tendon unit after both training interventions. These results showed training-specific functional changes that appeared to be due to distinct neural and hypertrophic adaptations. ECT produced a wider range of functional adaptations than SCT, and given the lesser demands of ECT, this type of training provides a highly efficient means of increasing function. Copyright © 2016 the American Physiological Society.

A linear recurrent kernel online learning algorithm with sparse updates.

PubMed

Fan, Haijin; Song, Qing

2014-02-01

In this paper, we propose a recurrent kernel algorithm with selectively sparse updates for online learning. The algorithm introduces a linear recurrent term in the estimation of the current output. This makes the past information reusable for updating of the algorithm in the form of a recurrent gradient term. To ensure that the reuse of this recurrent gradient indeed accelerates the convergence speed, a novel hybrid recurrent training is proposed to switch on or off learning the recurrent information according to the magnitude of the current training error. Furthermore, the algorithm includes a data-dependent adaptive learning rate which can provide guaranteed system weight convergence at each training iteration. The learning rate is set as zero when the training violates the derived convergence conditions, which makes the algorithm updating process sparse. Theoretical analyses of the weight convergence are presented and experimental results show the good performance of the proposed algorithm in terms of convergence speed and estimation accuracy. Copyright © 2013 Elsevier Ltd. All rights reserved.

Training Enhances Both Locomotor and Cognitive Adaptability to a Novel Sensory Environment

NASA Technical Reports Server (NTRS)

Bloomberg, J. J.; Peters, B. T.; Mulavara, A. P.; Brady, R. A.; Batson, C. D.; Ploutz-Snyder, R. J.; Cohen, H. S.

2010-01-01

During adaptation to novel gravitational environments, sensorimotor disturbances have the potential to disrupt the ability of astronauts to perform required mission tasks. The goal of this project is to develop a sensorimotor adaptability (SA) training program to facilitate rapid adaptation. We have developed a unique training system comprised of a treadmill placed on a motion-base facing a virtual visual scene that provides an unstable walking surface combined with incongruent visual flow designed to enhance sensorimotor adaptability. The goal of our present study was to determine if SA training improved both the locomotor and cognitive responses to a novel sensory environment and to quantify the extent to which training would be retained. Methods: Twenty subjects (10 training, 10 control) completed three, 30-minute training sessions during which they walked on the treadmill while receiving discordant support surface and visual input. Control subjects walked on the treadmill but did not receive any support surface or visual alterations. To determine the efficacy of training all subjects performed the Transfer Test upon completion of training. For this test, subjects were exposed to novel visual flow and support surface movement, not previously experienced during training. The Transfer Test was performed 20 minutes, 1 week, 1, 3 and 6 months after the final training session. Stride frequency, auditory reaction time, and heart rate data were collected as measures of postural stability, cognitive effort and anxiety, respectively. Results: Using mixed effects regression methods we determined that subjects who received SA training showed less alterations in stride frequency, auditory reaction time and heart rate compared to controls. Conclusion: Subjects who received SA training improved performance across a number of modalities including enhanced locomotor function, increased multi-tasking capability and reduced anxiety during adaptation to novel discordant sensory

Study on a low complexity adaptive modulation algorithm in OFDM-ROF system with sub-carrier grouping technology

NASA Astrophysics Data System (ADS)

Liu, Chong-xin; Liu, Bo; Zhang, Li-jia; Xin, Xiang-jun; Tian, Qing-hua; Tian, Feng; Wang, Yong-jun; Rao, Lan; Mao, Yaya; Li, Deng-ao

2018-01-01

During the last decade, the orthogonal frequency division multiplexing radio-over-fiber (OFDM-ROF) system with adaptive modulation technology is of great interest due to its capability of raising the spectral efficiency dramatically, reducing the effects of fiber link or wireless channel, and improving the communication quality. In this study, according to theoretical analysis of nonlinear distortion and frequency selective fading on the transmitted signal, a low-complexity adaptive modulation algorithm is proposed in combination with sub-carrier grouping technology. This algorithm achieves the optimal performance of the system by calculating the average combined signal-to-noise ratio of each group and dynamically adjusting the origination modulation format according to the preset threshold and user's requirements. At the same time, this algorithm takes the sub-carrier group as the smallest unit in the initial bit allocation and the subsequent bit adjustment. So, the algorithm complexity is only 1 /M (M is the number of sub-carriers in each group) of Fischer algorithm, which is much smaller than many classic adaptive modulation algorithms, such as Hughes-Hartogs algorithm, Chow algorithm, and is in line with the development direction of green and high speed communication. Simulation results show that the performance of OFDM-ROF system with the improved algorithm is much better than those without adaptive modulation, and the BER of the former achieves 10e1 to 10e2 times lower than the latter when SNR values gets larger. We can obtain that this low complexity adaptive modulation algorithm is extremely useful for the OFDM-ROF system.

Adaptive neuron-to-EMG decoder training for FES neuroprostheses

NASA Astrophysics Data System (ADS)

Ethier, Christian; Acuna, Daniel; Solla, Sara A.; Miller, Lee E.

2016-08-01

Objective. We have previously demonstrated a brain-machine interface neuroprosthetic system that provided continuous control of functional electrical stimulation (FES) and restoration of grasp in a primate model of spinal cord injury (SCI). Predicting intended EMG directly from cortical recordings provides a flexible high-dimensional control signal for FES. However, no peripheral signal such as force or EMG is available for training EMG decoders in paralyzed individuals. Approach. Here we present a method for training an EMG decoder in the absence of muscle activity recordings; the decoder relies on mapping behaviorally relevant cortical activity to the inferred EMG activity underlying an intended action. Monkeys were trained at a 2D isometric wrist force task to control a computer cursor by applying force in the flexion, extension, ulnar, and radial directions and execute a center-out task. We used a generic muscle force-to-endpoint force model based on muscle pulling directions to relate each target force to an optimal EMG pattern that attained the target force while minimizing overall muscle activity. We trained EMG decoders during the target hold periods using a gradient descent algorithm that compared EMG predictions to optimal EMG patterns. Main results. We tested this method both offline and online. We quantified both the accuracy of offline force predictions and the ability of a monkey to use these real-time force predictions for closed-loop cursor control. We compared both offline and online results to those obtained with several other direct force decoders, including an optimal decoder computed from concurrently measured neural and force signals. Significance. This novel approach to training an adaptive EMG decoder could make a brain-control FES neuroprosthesis an effective tool to restore the hand function of paralyzed individuals. Clinical implementation would make use of individualized EMG-to-force models. Broad generalization could be achieved by

Adaptivity and smart algorithms for fluid-structure interaction

NASA Technical Reports Server (NTRS)

Oden, J. Tinsley

1990-01-01

This paper reviews new approaches in CFD which have the potential for significantly increasing current capabilities of modeling complex flow phenomena and of treating difficult problems in fluid-structure interaction. These approaches are based on the notions of adaptive methods and smart algorithms, which use instantaneous measures of the quality and other features of the numerical flowfields as a basis for making changes in the structure of the computational grid and of algorithms designed to function on the grid. The application of these new techniques to several problem classes are addressed, including problems with moving boundaries, fluid-structure interaction in high-speed turbine flows, flow in domains with receding boundaries, and related problems.

The Effectiveness of Neurofeedback Training in Algorithmic Thinking Skills Enhancement.

PubMed

Plerou, Antonia; Vlamos, Panayiotis; Triantafillidis, Chris

2017-01-01

Although research on learning difficulties are overall in an advanced stage, studies related to algorithmic thinking difficulties are limited, since interest in this field has been recently raised. In this paper, an interactive evaluation screener enhanced with neurofeedback elements, referring to algorithmic tasks solving evaluation, is proposed. The effect of HCI, color, narration and neurofeedback elements effect was evaluated in the case of algorithmic tasks assessment. Results suggest the enhanced performance in the case of neurofeedback trained group in terms of total correct and optimal algorithmic tasks solution. Furthermore, findings suggest that skills, concerning the way that an algorithm is conceived, designed, applied and evaluated are essentially improved.

General purpose graphic processing unit implementation of adaptive pulse compression algorithms

NASA Astrophysics Data System (ADS)

Cai, Jingxiao; Zhang, Yan

2017-07-01

This study introduces a practical approach to implement real-time signal processing algorithms for general surveillance radar based on NVIDIA graphical processing units (GPUs). The pulse compression algorithms are implemented using compute unified device architecture (CUDA) libraries such as CUDA basic linear algebra subroutines and CUDA fast Fourier transform library, which are adopted from open source libraries and optimized for the NVIDIA GPUs. For more advanced, adaptive processing algorithms such as adaptive pulse compression, customized kernel optimization is needed and investigated. A statistical optimization approach is developed for this purpose without needing much knowledge of the physical configurations of the kernels. It was found that the kernel optimization approach can significantly improve the performance. Benchmark performance is compared with the CPU performance in terms of processing accelerations. The proposed implementation framework can be used in various radar systems including ground-based phased array radar, airborne sense and avoid radar, and aerospace surveillance radar.

An adaptive importance sampling algorithm for Bayesian inversion with multimodal distributions

DOE PAGES

Li, Weixuan; Lin, Guang

2015-03-21

Parametric uncertainties are encountered in the simulations of many physical systems, and may be reduced by an inverse modeling procedure that calibrates the simulation results to observations on the real system being simulated. Following Bayes’ rule, a general approach for inverse modeling problems is to sample from the posterior distribution of the uncertain model parameters given the observations. However, the large number of repetitive forward simulations required in the sampling process could pose a prohibitive computational burden. This difficulty is particularly challenging when the posterior is multimodal. We present in this paper an adaptive importance sampling algorithm to tackle thesemore » challenges. Two essential ingredients of the algorithm are: 1) a Gaussian mixture (GM) model adaptively constructed as the proposal distribution to approximate the possibly multimodal target posterior, and 2) a mixture of polynomial chaos (PC) expansions, built according to the GM proposal, as a surrogate model to alleviate the computational burden caused by computational-demanding forward model evaluations. In three illustrative examples, the proposed adaptive importance sampling algorithm demonstrates its capabilities of automatically finding a GM proposal with an appropriate number of modes for the specific problem under study, and obtaining a sample accurately and efficiently representing the posterior with limited number of forward simulations.« less

An adaptive importance sampling algorithm for Bayesian inversion with multimodal distributions

DOE Office of Scientific and Technical Information (OSTI.GOV)

Li, Weixuan; Lin, Guang, E-mail: guanglin@purdue.edu

2015-08-01

Parametric uncertainties are encountered in the simulations of many physical systems, and may be reduced by an inverse modeling procedure that calibrates the simulation results to observations on the real system being simulated. Following Bayes' rule, a general approach for inverse modeling problems is to sample from the posterior distribution of the uncertain model parameters given the observations. However, the large number of repetitive forward simulations required in the sampling process could pose a prohibitive computational burden. This difficulty is particularly challenging when the posterior is multimodal. We present in this paper an adaptive importance sampling algorithm to tackle thesemore » challenges. Two essential ingredients of the algorithm are: 1) a Gaussian mixture (GM) model adaptively constructed as the proposal distribution to approximate the possibly multimodal target posterior, and 2) a mixture of polynomial chaos (PC) expansions, built according to the GM proposal, as a surrogate model to alleviate the computational burden caused by computational-demanding forward model evaluations. In three illustrative examples, the proposed adaptive importance sampling algorithm demonstrates its capabilities of automatically finding a GM proposal with an appropriate number of modes for the specific problem under study, and obtaining a sample accurately and efficiently representing the posterior with limited number of forward simulations.« less

Optimization of genomic selection training populations with a genetic algorithm

USDA-ARS?s Scientific Manuscript database

In this article, we derive a computationally efficient statistic to measure the reliability of estimates of genetic breeding values for a fixed set of genotypes based on a given training set of genotypes and phenotypes. We adopt a genetic algorithm scheme to find a training set of certain size from ...

The combined effects of action observation and passive proprioceptive training on adaptive motor learning.

PubMed

Lei, Yuming; Bao, Shancheng; Wang, Jinsung

2016-09-07

Sensorimotor adaptation can be induced by action observation, and also by passive training. Here, we investigated the effect of a protocol that combined action observation and passive training on visuomotor adaptation, by comparing it with the effect of action observation or passive training alone. Subjects were divided into five conditions during the training session: (1) action observation, in which the subjects watched a video of a model who adapted to a novel visuomotor rotation; (2) proprioceptive training, in which the subject's arm was moved passively to target locations that were associated with desired trajectories; (3) combined training, in which the subjects watched the video of a model during a half of the session and experienced passive movements during the other half; (4) active training, in which the subjects adapted actively to the rotation; and (5) a control condition, in which the subjects did not perform any task. Following that session, all subjects adapted to the same visuomotor rotation. Results showed that the subjects in the combined training condition adapted to the rotation significantly better than those in the observation or proprioceptive training condition, although their performance was not as good as that of those who adapted actively. These findings suggest that although a protocol that combines action observation and passive training consists of all the processes involved in active training (error detection and correction, effector-specific and proprioceptively based reaching movements), these processes in that protocol may work differently as compared to a protocol in which the same processes are engaged actively. Copyright © 2016 IBRO. Published by Elsevier Ltd. All rights reserved.

Virtual Reality as a Medium for Sensorimotor Adaptation Training and Spaceflight Countermeasures

NASA Technical Reports Server (NTRS)

Madansingh, S.; Bloomberg, J. J.

2015-01-01

With the upcoming shift to extra-long duration missions (1 year) aboard the ISS, sensorimotor adaptations during transitory periods in-and-out of microgravity are more important to understand and prepare for. Advances in virtual reality technology enables everyday adoption of these tools for entertainment and use in training. Experiencing virtual environments (VE) allows for the manipulation of visual flow to elicit automatic motor behavior and produce sensorimotor adaptation (SA). Recently, the ability to train individuals using repeatable and varied exposures to SA challenges has shown success by improving performance during exposure to a novel environment (Batson 2011). This capacity to 'learn to learn' is referred to as sensorimotor adaptive generalizability and, through the use of treadmill training, represents an untapped potential for individualized countermeasures. The goal of this study is to determine the feasibility of present head mounted displays (HMDs) to produce compelling visual flow information and the expected adaptations for use in future SA treadmill-based countermeasures. Participants experience infinite hallways providing congruent (baseline) or incongruent visual information (half or double speed) via HMD while walking on an instrumented treadmill at 1.1m/s. As gait performance approaches baseline levels, an adaptation time constant is derived to establish individual time-to-adapt (TTA). It is hypothesized that decreasing the TTA through SA treadmill training will facilitate sensorimotor adaptation during gravitational transitions. In this way, HMD technology represents a novel platform for SA training using off-the-shelf consumer products for greater training flexibility in astronaut and terrestrial applications alike.

Adaptive thinking & leadership simulation game training for special forces officers.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Raybourn, Elaine Marie; Mendini, Kip; Heneghan, Jerry

Complex problem solving approaches and novel strategies employed by the military at the squad, team, and commander level are often best learned experimentally. Since live action exercises can be costly, advances in simulation game training technology offer exciting ways to enhance current training. Computer games provide an environment for active, critical learning. Games open up possibilities for simultaneous learning on multiple levels; players may learn from contextual information embedded in the dynamics of the game, the organic process generated by the game, and through the risks, benefits, costs, outcomes, and rewards of alternative strategies that result from decision making. Inmore » the present paper we discuss a multiplayer computer game simulation created for the Adaptive Thinking & Leadership (ATL) Program to train Special Forces Team Leaders. The ATL training simulation consists of a scripted single-player and an immersive multiplayer environment for classroom use which leverages immersive computer game technology. We define adaptive thinking as consisting of competencies such as negotiation and consensus building skills, the ability to communicate effectively, analyze ambiguous situations, be self-aware, think innovatively, and critically use effective problem solving skills. Each of these competencies is an essential element of leader development training for the U.S. Army Special Forces. The ATL simulation is used to augment experiential learning in the curriculum for the U.S. Army JFK Special Warfare Center & School (SWCS) course in Adaptive Thinking & Leadership. The school is incorporating the ATL simulation game into two additional training pipelines (PSYOPS and Civil Affairs Qualification Courses) that are also concerned with developing cultural awareness, interpersonal communication adaptability, and rapport-building skills. In the present paper, we discuss the design, development, and deployment of the training simulation, and emphasize how

A Context-Adaptive Teacher Training Model in a Ubiquitous Learning Environment

ERIC Educational Resources Information Center

Chen, Min; Chiang, Feng Kuang; Jiang, Ya Na; Yu, Sheng Quan

2017-01-01

In view of the discrepancies in teacher training and teaching practice, this paper put forward a context-adaptive teacher training model in a ubiquitous learning (u-learning) environment. The innovative model provides teachers of different subjects with adaptive and personalized learning content in a u-learning environment, implements intra- and…

A new adaptive videogame for training attention and executive functions: design principles and initial validation.

PubMed

Montani, Veronica; De Filippo De Grazia, Michele; Zorzi, Marco

2014-01-01

A growing body of evidence suggests that action videogames could enhance a variety of cognitive skills and more specifically attention skills. The aim of this study was to develop a novel adaptive videogame to support the rehabilitation of the most common consequences of traumatic brain injury (TBI), that is the impairment of attention and executive functions. TBI patients can be affected by psychomotor slowness and by difficulties in dealing with distraction, maintain a cognitive set for a long time, processing different simultaneously presented stimuli, and planning purposeful behavior. Accordingly, we designed a videogame that was specifically conceived to activate those functions. Playing involves visuospatial planning and selective attention, active maintenance of the cognitive set representing the goal, and error monitoring. Moreover, different game trials require to alternate between two tasks (i.e., task switching) or to perform the two tasks simultaneously (i.e., divided attention/dual-tasking). The videogame is controlled by a multidimensional adaptive algorithm that calibrates task difficulty on-line based on a model of user performance that is updated on a trial-by-trial basis. We report simulations of user performance designed to test the adaptive game as well as a validation study with healthy participants engaged in a training protocol. The results confirmed the involvement of the cognitive abilities that the game is supposed to enhance and suggested that training improved attentional control during play.

A new adaptive videogame for training attention and executive functions: design principles and initial validation

PubMed Central

Montani, Veronica; De Filippo De Grazia, Michele; Zorzi, Marco

2014-01-01

A growing body of evidence suggests that action videogames could enhance a variety of cognitive skills and more specifically attention skills. The aim of this study was to develop a novel adaptive videogame to support the rehabilitation of the most common consequences of traumatic brain injury (TBI), that is the impairment of attention and executive functions. TBI patients can be affected by psychomotor slowness and by difficulties in dealing with distraction, maintain a cognitive set for a long time, processing different simultaneously presented stimuli, and planning purposeful behavior. Accordingly, we designed a videogame that was specifically conceived to activate those functions. Playing involves visuospatial planning and selective attention, active maintenance of the cognitive set representing the goal, and error monitoring. Moreover, different game trials require to alternate between two tasks (i.e., task switching) or to perform the two tasks simultaneously (i.e., divided attention/dual-tasking). The videogame is controlled by a multidimensional adaptive algorithm that calibrates task difficulty on-line based on a model of user performance that is updated on a trial-by-trial basis. We report simulations of user performance designed to test the adaptive game as well as a validation study with healthy participants engaged in a training protocol. The results confirmed the involvement of the cognitive abilities that the game is supposed to enhance and suggested that training improved attentional control during play. PMID:24860529

Office of Land and Emergency Management (OLEM) Climate Change Adaptation Training

EPA Pesticide Factsheets

This training discusses climate vulnerabilities and methods for incorporating adaptation measures into OLEM programs. This training is meant to follow completion of EPA's Introductory Climate Change Training.

A family of variable step-size affine projection adaptive filter algorithms using statistics of channel impulse response

NASA Astrophysics Data System (ADS)

Shams Esfand Abadi, Mohammad; AbbasZadeh Arani, Seyed Ali Asghar

2011-12-01

This paper extends the recently introduced variable step-size (VSS) approach to the family of adaptive filter algorithms. This method uses prior knowledge of the channel impulse response statistic. Accordingly, optimal step-size vector is obtained by minimizing the mean-square deviation (MSD). The presented algorithms are the VSS affine projection algorithm (VSS-APA), the VSS selective partial update NLMS (VSS-SPU-NLMS), the VSS-SPU-APA, and the VSS selective regressor APA (VSS-SR-APA). In VSS-SPU adaptive algorithms the filter coefficients are partially updated which reduce the computational complexity. In VSS-SR-APA, the optimal selection of input regressors is performed during the adaptation. The presented algorithms have good convergence speed, low steady state mean square error (MSE), and low computational complexity features. We demonstrate the good performance of the proposed algorithms through several simulations in system identification scenario.

Inversion for Refractivity Parameters Using a Dynamic Adaptive Cuckoo Search with Crossover Operator Algorithm

PubMed Central

Zhang, Zhihua; Sheng, Zheng; Shi, Hanqing; Fan, Zhiqiang

2016-01-01

Using the RFC technique to estimate refractivity parameters is a complex nonlinear optimization problem. In this paper, an improved cuckoo search (CS) algorithm is proposed to deal with this problem. To enhance the performance of the CS algorithm, a parameter dynamic adaptive operation and crossover operation were integrated into the standard CS (DACS-CO). Rechenberg's 1/5 criteria combined with learning factor were used to control the parameter dynamic adaptive adjusting process. The crossover operation of genetic algorithm was utilized to guarantee the population diversity. The new hybrid algorithm has better local search ability and contributes to superior performance. To verify the ability of the DACS-CO algorithm to estimate atmospheric refractivity parameters, the simulation data and real radar clutter data are both implemented. The numerical experiments demonstrate that the DACS-CO algorithm can provide an effective method for near-real-time estimation of the atmospheric refractivity profile from radar clutter. PMID:27212938

Nutritional strategies to modulate the adaptive response to endurance training.

PubMed

Hawley, John A

2013-01-01

In recent years, advances in molecular biology have allowed scientists to elucidate how endurance exercise training stimulates skeletal muscle remodeling (i.e. promotes mitochondrial biogenesis). A growing field of interest directly arising from our understanding of the molecular bases of training adaptation is how nutrient availability can alter the regulation of many contraction-induced events in muscle in response to endurance exercise. Acutely manipulating substrate availability can exert profound effects on muscle energy stores and patterns of fuel metabolism during exercise, as well as many processes activating gene expression and cell signaling. Accordingly, such interventions when repeated over weeks and months have the potential to modulate numerous adaptive processes in skeletal muscle that ultimately drive the phenotype-specific characteristics observed in highly trained athletes. In this review, the molecular and cellular events that occur in skeletal muscle during and after endurance exercise are discussed and evidence provided to demonstrate that nutrient availability plays an important role in modulating many of the adaptive responses to training. Emphasis is on human studies that have determined the regulatory role of muscle glycogen availability on cell metabolism, endurance training capacity and performance. Copyright © 2013 Nestec Ltd., Vevey/S. Karger AG, Basel.

Automatic classification of schizophrenia using resting-state functional language network via an adaptive learning algorithm

NASA Astrophysics Data System (ADS)

Zhu, Maohu; Jie, Nanfeng; Jiang, Tianzi

2014-03-01

A reliable and precise classification of schizophrenia is significant for its diagnosis and treatment of schizophrenia. Functional magnetic resonance imaging (fMRI) is a novel tool increasingly used in schizophrenia research. Recent advances in statistical learning theory have led to applying pattern classification algorithms to access the diagnostic value of functional brain networks, discovered from resting state fMRI data. The aim of this study was to propose an adaptive learning algorithm to distinguish schizophrenia patients from normal controls using resting-state functional language network. Furthermore, here the classification of schizophrenia was regarded as a sample selection problem where a sparse subset of samples was chosen from the labeled training set. Using these selected samples, which we call informative vectors, a classifier for the clinic diagnosis of schizophrenia was established. We experimentally demonstrated that the proposed algorithm incorporating resting-state functional language network achieved 83.6% leaveone- out accuracy on resting-state fMRI data of 27 schizophrenia patients and 28 normal controls. In contrast with KNearest- Neighbor (KNN), Support Vector Machine (SVM) and l1-norm, our method yielded better classification performance. Moreover, our results suggested that a dysfunction of resting-state functional language network plays an important role in the clinic diagnosis of schizophrenia.

SIMULATION OF DISPERSION OF A POWER PLANT PLUME USING AN ADAPTIVE GRID ALGORITHM

EPA Science Inventory

A new dynamic adaptive grid algorithm has been developed for use in air quality modeling. This algorithm uses a higher order numerical scheme?the piecewise parabolic method (PPM)?for computing advective solution fields; a weight function capable of promoting grid node clustering ...

An environment-adaptive management algorithm for hearing-support devices incorporating listening situation and noise type classifiers.

PubMed

Yook, Sunhyun; Nam, Kyoung Won; Kim, Heepyung; Hong, Sung Hwa; Jang, Dong Pyo; Kim, In Young

2015-04-01

In order to provide more consistent sound intelligibility for the hearing-impaired person, regardless of environment, it is necessary to adjust the setting of the hearing-support (HS) device to accommodate various environmental circumstances. In this study, a fully automatic HS device management algorithm that can adapt to various environmental situations is proposed; it is composed of a listening-situation classifier, a noise-type classifier, an adaptive noise-reduction algorithm, and a management algorithm that can selectively turn on/off one or more of the three basic algorithms-beamforming, noise-reduction, and feedback cancellation-and can also adjust internal gains and parameters of the wide-dynamic-range compression (WDRC) and noise-reduction (NR) algorithms in accordance with variations in environmental situations. Experimental results demonstrated that the implemented algorithms can classify both listening situation and ambient noise type situations with high accuracies (92.8-96.4% and 90.9-99.4%, respectively), and the gains and parameters of the WDRC and NR algorithms were successfully adjusted according to variations in environmental situation. The average values of signal-to-noise ratio (SNR), frequency-weighted segmental SNR, Perceptual Evaluation of Speech Quality, and mean opinion test scores of 10 normal-hearing volunteers of the adaptive multiband spectral subtraction (MBSS) algorithm were improved by 1.74 dB, 2.11 dB, 0.49, and 0.68, respectively, compared to the conventional fixed-parameter MBSS algorithm. These results indicate that the proposed environment-adaptive management algorithm can be applied to HS devices to improve sound intelligibility for hearing-impaired individuals in various acoustic environments. Copyright © 2014 International Center for Artificial Organs and Transplantation and Wiley Periodicals, Inc.

Adapting the Training Site to Training Needs. Self-Paced Instructional Module. Module Number VII-A.

ERIC Educational Resources Information Center

King, Sylvester; Brooks, Kent

One of 33 self-paced instructional modules for training industry services leaders to provide guidance in the performance of manpower services by public agencies to new and expanding private industry, this module contains three sequential learning activities on adapting the training site to training needs. The first learning activity is designed to…

An adaptive DPCM algorithm for predicting contours in NTSC composite video signals

NASA Astrophysics Data System (ADS)

Cox, N. R.

An adaptive DPCM algorithm is proposed for encoding digitized National Television Systems Committee (NTSC) color video signals. This algorithm essentially predicts picture contours in the composite signal without resorting to component separation. The contour parameters (slope thresholds) are optimized using four 'typical' television frames that have been sampled at three times the color subcarrier frequency. Three variations of the basic predictor are simulated and compared quantitatively with three non-adaptive predictors of similar complexity. By incorporating a dual-word-length coder and buffer memory, high quality color pictures can be encoded at 4.0 bits/pel or 42.95 Mbit/s. The effect of channel error propagation is also investigated.

Adaptive Personalized Training Games for Individual and Collaborative Rehabilitation of People with Multiple Sclerosis

PubMed Central

2014-01-01

Any rehabilitation involves people who are unique individuals with their own characteristics and rehabilitation needs, including patients suffering from Multiple Sclerosis (MS). The prominent variation of MS symptoms and the disease severity elevate a need to accommodate the patient diversity and support adaptive personalized training to meet every patient's rehabilitation needs. In this paper, we focus on integrating adaptivity and personalization in rehabilitation training for MS patients. We introduced the automatic adjustment of difficulty levels as an adaptation that can be provided in individual and collaborative rehabilitation training exercises for MS patients. Two user studies have been carried out with nine MS patients to investigate the outcome of this adaptation. The findings showed that adaptive personalized training trajectories have been successfully provided to MS patients according to their individual training progress, which was appreciated by the patients and the therapist. They considered the automatic adjustment of difficulty levels to provide more variety in the training and to minimize the therapists involvement in setting up the training. With regard to social interaction in the collaborative training exercise, we have observed some social behaviors between the patients and their training partner which indicated the development of social interaction during the training. PMID:24982862

Noise-shaping gradient descent-based online adaptation algorithms for digital calibration of analog circuits.

PubMed

Chakrabartty, Shantanu; Shaga, Ravi K; Aono, Kenji

2013-04-01

Analog circuits that are calibrated using digital-to-analog converters (DACs) use a digital signal processor-based algorithm for real-time adaptation and programming of system parameters. In this paper, we first show that this conventional framework for adaptation yields suboptimal calibration properties because of artifacts introduced by quantization noise. We then propose a novel online stochastic optimization algorithm called noise-shaping or ΣΔ gradient descent, which can shape the quantization noise out of the frequency regions spanning the parameter adaptation trajectories. As a result, the proposed algorithms demonstrate superior parameter search properties compared to floating-point gradient methods and better convergence properties than conventional quantized gradient-methods. In the second part of this paper, we apply the ΣΔ gradient descent algorithm to two examples of real-time digital calibration: 1) balancing and tracking of bias currents, and 2) frequency calibration of a band-pass Gm-C biquad filter biased in weak inversion. For each of these examples, the circuits have been prototyped in a 0.5-μm complementary metal-oxide-semiconductor process, and we demonstrate that the proposed algorithm is able to find the optimal solution even in the presence of spurious local minima, which are introduced by the nonlinear and non-monotonic response of calibration DACs.

Unsupervised Cryo-EM Data Clustering through Adaptively Constrained K-Means Algorithm.

PubMed

Xu, Yaofang; Wu, Jiayi; Yin, Chang-Cheng; Mao, Youdong

2016-01-01

In single-particle cryo-electron microscopy (cryo-EM), K-means clustering algorithm is widely used in unsupervised 2D classification of projection images of biological macromolecules. 3D ab initio reconstruction requires accurate unsupervised classification in order to separate molecular projections of distinct orientations. Due to background noise in single-particle images and uncertainty of molecular orientations, traditional K-means clustering algorithm may classify images into wrong classes and produce classes with a large variation in membership. Overcoming these limitations requires further development on clustering algorithms for cryo-EM data analysis. We propose a novel unsupervised data clustering method building upon the traditional K-means algorithm. By introducing an adaptive constraint term in the objective function, our algorithm not only avoids a large variation in class sizes but also produces more accurate data clustering. Applications of this approach to both simulated and experimental cryo-EM data demonstrate that our algorithm is a significantly improved alterative to the traditional K-means algorithm in single-particle cryo-EM analysis.

Improved adaptive genetic algorithm with sparsity constraint applied to thermal neutron CT reconstruction of two-phase flow

NASA Astrophysics Data System (ADS)

Yan, Mingfei; Hu, Huasi; Otake, Yoshie; Taketani, Atsushi; Wakabayashi, Yasuo; Yanagimachi, Shinzo; Wang, Sheng; Pan, Ziheng; Hu, Guang

2018-05-01

Thermal neutron computer tomography (CT) is a useful tool for visualizing two-phase flow due to its high imaging contrast and strong penetrability of neutrons for tube walls constructed with metallic material. A novel approach for two-phase flow CT reconstruction based on an improved adaptive genetic algorithm with sparsity constraint (IAGA-SC) is proposed in this paper. In the algorithm, the neighborhood mutation operator is used to ensure the continuity of the reconstructed object. The adaptive crossover probability P c and mutation probability P m are improved to help the adaptive genetic algorithm (AGA) achieve the global optimum. The reconstructed results for projection data, obtained from Monte Carlo simulation, indicate that the comprehensive performance of the IAGA-SC algorithm exceeds the adaptive steepest descent-projection onto convex sets (ASD-POCS) algorithm in restoring typical and complex flow regimes. It especially shows great advantages in restoring the simply connected flow regimes and the shape of object. In addition, the CT experiment for two-phase flow phantoms was conducted on the accelerator-driven neutron source to verify the performance of the developed IAGA-SC algorithm.

Self-adaptive predictor-corrector algorithm for static nonlinear structural analysis

NASA Technical Reports Server (NTRS)

Padovan, J.

1981-01-01

A multiphase selfadaptive predictor corrector type algorithm was developed. This algorithm enables the solution of highly nonlinear structural responses including kinematic, kinetic and material effects as well as pro/post buckling behavior. The strategy involves three main phases: (1) the use of a warpable hyperelliptic constraint surface which serves to upperbound dependent iterate excursions during successive incremental Newton Ramphson (INR) type iterations; (20 uses an energy constraint to scale the generation of successive iterates so as to maintain the appropriate form of local convergence behavior; (3) the use of quality of convergence checks which enable various self adaptive modifications of the algorithmic structure when necessary. The restructuring is achieved by tightening various conditioning parameters as well as switch to different algorithmic levels to improve the convergence process. The capabilities of the procedure to handle various types of static nonlinear structural behavior are illustrated.

A conjugate gradients/trust regions algorithms for training multilayer perceptrons for nonlinear mapping

NASA Technical Reports Server (NTRS)

Madyastha, Raghavendra K.; Aazhang, Behnaam; Henson, Troy F.; Huxhold, Wendy L.

1992-01-01

This paper addresses the issue of applying a globally convergent optimization algorithm to the training of multilayer perceptrons, a class of Artificial Neural Networks. The multilayer perceptrons are trained towards the solution of two highly nonlinear problems: (1) signal detection in a multi-user communication network, and (2) solving the inverse kinematics for a robotic manipulator. The research is motivated by the fact that a multilayer perceptron is theoretically capable of approximating any nonlinear function to within a specified accuracy. The algorithm that has been employed in this study combines the merits of two well known optimization algorithms, the Conjugate Gradients and the Trust Regions Algorithms. The performance is compared to a widely used algorithm, the Backpropagation Algorithm, that is basically a gradient-based algorithm, and hence, slow in converging. The performances of the two algorithms are compared with the convergence rate. Furthermore, in the case of the signal detection problem, performances are also benchmarked by the decision boundaries drawn as well as the probability of error obtained in either case.

An adaptive SVSF-SLAM algorithm to improve the success and solving the UGVs cooperation problem

NASA Astrophysics Data System (ADS)

Demim, Fethi; Nemra, Abdelkrim; Louadj, Kahina; Hamerlain, Mustapha; Bazoula, Abdelouahab

2018-05-01

This paper aims to present a Decentralised Cooperative Simultaneous Localization and Mapping (DCSLAM) solution based on 2D laser data using an Adaptive Covariance Intersection (ACI). The ACI-DCSLAM algorithm will be validated on a swarm of Unmanned Ground Vehicles (UGVs) receiving features to estimate the position and covariance of shared features before adding them to the global map. With the proposed solution, a group of (UGVs) will be able to construct a large reliable map and localise themselves within this map without any user intervention. The most popular solutions to this problem are the EKF-SLAM, Nonlinear H-infinity ? SLAM and the FAST-SLAM. The former suffers from two important problems which are the poor consistency caused by the linearization problem and the calculation of Jacobian. The second solution is the ? which is a very promising filter because it doesn't make any assumption about noise characteristics, while the latter is not suitable for real time implementation. Therefore, a new alternative solution based on the smooth variable structure filter (SVSF) is adopted. Cooperative adaptive SVSF-SLAM algorithm is proposed in this paper to solve the UGVs SLAM problem. Our main contribution consists in adapting the SVSF filter to solve the Decentralised Cooperative SLAM problem for multiple UGVs. The algorithms developed in this paper were implemented using two mobile robots Pioneer ?, equiped with 2D laser telemetry sensors. Good results are obtained by the Cooperative adaptive SVSF-SLAM algorithm compared to the Cooperative EKF/?-SLAM algorithms, especially when the noise is colored or affected by a variable bias. Simulation results confirm and show the efficiency of the proposed algorithm which is more robust, stable and adapted to real time applications.

Real time optimization algorithm for wavefront sensorless adaptive optics OCT (Conference Presentation)

NASA Astrophysics Data System (ADS)

Verstraete, Hans R. G. W.; Heisler, Morgan; Ju, Myeong Jin; Wahl, Daniel J.; Bliek, Laurens; Kalkman, Jeroen; Bonora, Stefano; Sarunic, Marinko V.; Verhaegen, Michel; Jian, Yifan

2017-02-01

Optical Coherence Tomography (OCT) has revolutionized modern ophthalmology, providing depth resolved images of the retinal layers in a system that is suited to a clinical environment. A limitation of the performance and utilization of the OCT systems has been the lateral resolution. Through the combination of wavefront sensorless adaptive optics with dual variable optical elements, we present a compact lens based OCT system that is capable of imaging the photoreceptor mosaic. We utilized a commercially available variable focal length lens to correct for a wide range of defocus commonly found in patient eyes, and a multi-actuator adaptive lens after linearization of the hysteresis in the piezoelectric actuators for aberration correction to obtain near diffraction limited imaging at the retina. A parallel processing computational platform permitted real-time image acquisition and display. The Data-based Online Nonlinear Extremum seeker (DONE) algorithm was used for real time optimization of the wavefront sensorless adaptive optics OCT, and the performance was compared with a coordinate search algorithm. Cross sectional images of the retinal layers and en face images of the cone photoreceptor mosaic acquired in vivo from research volunteers before and after WSAO optimization are presented. Applying the DONE algorithm in vivo for wavefront sensorless AO-OCT demonstrates that the DONE algorithm succeeds in drastically improving the signal while achieving a computational time of 1 ms per iteration, making it applicable for high speed real time applications.

Adaptive working-memory training benefits reading, but not mathematics in middle childhood.

PubMed

Karbach, Julia; Strobach, Tilo; Schubert, Torsten

2015-01-01

Working memory (WM) capacity is highly correlated with general cognitive ability and has proven to be an excellent predictor for academic success. Given that WM can be improved by training, our aim was to test whether WM training benefited academic abilities in elementary-school children. We examined 28 participants (mean age = 8.3 years, SD = 0.4) in a pretest-training-posttest-follow-up design. Over 14 training sessions, children either performed adaptive WM training (training group, n = 14) or nonadaptive low-level training (active control group, n = 14) on the same tasks. Pretest, posttest, and follow-up at 3 months after posttest included a neurocognitive test battery (WM, task switching, inhibition) and standardized tests for math and reading abilities. Adaptive WM training resulted in larger training gains than nonadaptive low-level training. The benefits induced by the adaptive training transferred to an untrained WM task and a standardized test for reading ability, but not to task switching, inhibition, or performance on a standardized math test. Transfer to the untrained WM task was maintained over 3 months. The analysis of individual differences revealed compensatory effects with larger gains in children with lower WM and reading scores at pretest. These training and transfer effects are discussed against the background of cognitive processing resulting from WM span training and the nature of the intervention.

Sensorimotor Adaptability Training Improves Motor and Dual-Task Performance

NASA Technical Reports Server (NTRS)

Bloomberg, J.J.; Peters, B.T.; Mulavara, A.P.; Brady, R.; Batson, C.; Cohen, H.S.

2009-01-01

The overall objective of our project is to develop a sensorimotor adaptability (SA) training program designed to facilitate recovery of functional capabilities when astronauts transition to different gravitational environments. The goal of our current study was to determine if SA training using variation in visual flow and support surface motion produces improved performance in a novel sensory environment and demonstrate the retention characteristics of SA training.

Concluding remarks: nutritional strategies to support the adaptive response to prolonged exercise training.

PubMed

van Loon, Luc J C; Tipton, Kevin D

2013-01-01

Nutrition plays a key role in allowing the numerous training hours to be translated into useful adaptive responses of various tissues in the individual athlete. Research over the last decade has shown many examples of the impact of dietary interventions to modulate the skeletal muscle adaptive response to prolonged exercise training. Proper nutritional coaching should be applied throughout both training and competition, each with their specific requirements regarding nutrient provision. Such dietary support will improve exercise training efficiency and, as such, further increase performance capacity. Here, we provide an overview on the properties of various nutritional interventions that may be useful to support the adaptive response to exercise training and competition and, as such, to augment exercise training efficiency. Copyright © 2013 Nestec Ltd., Vevey/S. Karger AG, Basel.

Gait adaptability training is affected by visual dependency.

PubMed

Brady, Rachel A; Peters, Brian T; Batson, Crystal D; Ploutz-Snyder, Robert; Mulavara, Ajitkumar P; Bloomberg, Jacob J

2012-07-01

As part of a larger gait adaptability training study, we designed a program that presented combinations of visual flow and support-surface manipulations to investigate the response of healthy adults to walking on a treadmill in novel discordant sensorimotor conditions. A visual dependence score was determined for each subject, and this score was used to explore how visual dependency was linked to locomotor performance (1) during three training sessions and (2) in a new discordant environment presented at the conclusion of training. Performance measures included reaction time (RT), stride frequency (SF), and heart rate (HR), which respectively served as indicators of cognitive load, postural stability, and anxiety. We hypothesized that training would affect performance measures differently for highly visually dependent individuals than for their less visually dependent counterparts. A seemingly unrelated estimation analysis of RT, SF, and HR revealed a significant omnibus interaction of visual dependency by session (p < 0.001), suggesting that the magnitude of differences in these measures across training day 1 (TD1), training day 3 (TD3), and exposure to a novel test is dependent on subjects' levels of visual dependency. The RT result, in particular, suggested that highly visually dependent subjects successfully trained to one set of sensory discordant conditions but were unable to apply their adapted skills when introduced to a new sensory discordant environment. This finding augments rationale for developing customized gait training programs that are tailored to an individual. It highlights one factor--personal level of visual dependency--to consider when designing training conditions for a subject or patient. Finally, the link between visual dependency and locomotor performance may offer predictive insight regarding which subjects in a normal population will require more training when preparing for specific novel locomotor conditions.

Enhancing astronaut performance using sensorimotor adaptability training.

PubMed

Bloomberg, Jacob J; Peters, Brian T; Cohen, Helen S; Mulavara, Ajitkumar P

2015-01-01

Astronauts experience disturbances in balance and gait function when they return to Earth. The highly plastic human brain enables individuals to modify their behavior to match the prevailing environment. Subjects participating in specially designed variable sensory challenge training programs can enhance their ability to rapidly adapt to novel sensory situations. This is useful in our application because we aim to train astronauts to rapidly formulate effective strategies to cope with the balance and locomotor challenges associated with new gravitational environments-enhancing their ability to "learn to learn." We do this by coupling various combinations of sensorimotor challenges with treadmill walking. A unique training system has been developed that is comprised of a treadmill mounted on a motion base to produce movement of the support surface during walking. This system provides challenges to gait stability. Additional sensory variation and challenge are imposed with a virtual visual scene that presents subjects with various combinations of discordant visual information during treadmill walking. This experience allows them to practice resolving challenging and conflicting novel sensory information to improve their ability to adapt rapidly. Information obtained from this work will inform the design of the next generation of sensorimotor countermeasures for astronauts.

Adaptive optics compensation of orbital angular momentum beams with a modified Gerchberg-Saxton-based phase retrieval algorithm

NASA Astrophysics Data System (ADS)

Chang, Huan; Yin, Xiao-li; Cui, Xiao-zhou; Zhang, Zhi-chao; Ma, Jian-xin; Wu, Guo-hua; Zhang, Li-jia; Xin, Xiang-jun

2017-12-01

Practical orbital angular momentum (OAM)-based free-space optical (FSO) communications commonly experience serious performance degradation and crosstalk due to atmospheric turbulence. In this paper, we propose a wave-front sensorless adaptive optics (WSAO) system with a modified Gerchberg-Saxton (GS)-based phase retrieval algorithm to correct distorted OAM beams. We use the spatial phase perturbation (SPP) GS algorithm with a distorted probe Gaussian beam as the only input. The principle and parameter selections of the algorithm are analyzed, and the performance of the algorithm is discussed. The simulation results show that the proposed adaptive optics (AO) system can significantly compensate for distorted OAM beams in single-channel or multiplexed OAM systems, which provides new insights into adaptive correction systems using OAM beams.

Adaptive control and noise suppression by a variable-gain gradient algorithm

NASA Technical Reports Server (NTRS)

Merhav, S. J.; Mehta, R. S.

1987-01-01

An adaptive control system based on normalized LMS filters is investigated. The finite impulse response of the nonparametric controller is adaptively estimated using a given reference model. Specifically, the following issues are addressed: The stability of the closed loop system is analyzed and heuristically established. Next, the adaptation process is studied for piecewise constant plant parameters. It is shown that by introducing a variable-gain in the gradient algorithm, a substantial reduction in the LMS adaptation rate can be achieved. Finally, process noise at the plant output generally causes a biased estimate of the controller. By introducing a noise suppression scheme, this bias can be substantially reduced and the response of the adapted system becomes very close to that of the reference model. Extensive computer simulations validate these and demonstrate assertions that the system can rapidly adapt to random jumps in plant parameters.

Development of an operationally efficient PTC braking enforcement algorithm for freight trains.

DOT National Transportation Integrated Search

2013-08-01

Software algorithms used in positive train control (PTC) systems designed to predict freight train stopping distance and enforce a penalty brake application have been shown to be overly conservative, which can lead to operational inefficiencies by in...

Resistance Training: Physiological Responses and Adaptations (Part 3 of 4).

ERIC Educational Resources Information Center

Fleck, Steven J.; Kraemer, William J.

1988-01-01

The physiological responses and adaptations which occur as a result of resistance training, such as cardiovascular responses, serum lipid count, body composition, and neural adaptations are discussed. Changes in the endocrine system are also described. (JL)

Visuomotor adaptation in head-mounted virtual reality versus conventional training

PubMed Central

Anglin, J. M.; Sugiyama, T.; Liew, S.-L.

2017-01-01

Immersive, head-mounted virtual reality (HMD-VR) provides a unique opportunity to understand how changes in sensory environments affect motor learning. However, potential differences in mechanisms of motor learning and adaptation in HMD-VR versus a conventional training (CT) environment have not been extensively explored. Here, we investigated whether adaptation on a visuomotor rotation task in HMD-VR yields similar adaptation effects in CT and whether these effects are achieved through similar mechanisms. Specifically, recent work has shown that visuomotor adaptation may occur via both an implicit, error-based internal model and a more cognitive, explicit strategic component. We sought to measure both overall adaptation and balance between implicit and explicit mechanisms in HMD-VR versus CT. Twenty-four healthy individuals were placed in either HMD-VR or CT and trained on an identical visuomotor adaptation task that measured both implicit and explicit components. Our results showed that the overall timecourse of adaption was similar in both HMD-VR and CT. However, HMD-VR participants utilized a greater cognitive strategy than CT, while CT participants engaged in greater implicit learning. These results suggest that while both conditions produce similar results in overall adaptation, the mechanisms by which visuomotor adaption occurs in HMD-VR appear to be more reliant on cognitive strategies. PMID:28374808

Central adaptations in aerobic circuit versus walking/jogging trained cardiac patients.

PubMed

Goodman, L S; McKenzie, D C; Nath, C R; Schamberger, W; Taunton, J E; Ammann, W C

1995-06-01

This study was done to determine (a) whether in coronary artery disease (CAD) left ventricular (LV) adaptations differed after 6 months of walking/jogging (legs-only, LO) versus aerobic circuit training (arms and legs, AL) versus a control group, and (b) whether a transfer of fitness to the untrained arms in the LO group was related to superior LV adaptations. Peak oxygen uptake for arm and leg ergometry and for cycle ergometry using radionuclide cardiac angiography were performed before and after training. Leg and arm VO2peak increased significantly by 13% in the AL group, and by 13% and 7%, respectively, for the LO group. LV function was greater after training for the LO versus the AL group. Improvements in systolic and diastolic function and a speculated hypervolemia explain these LV adaptations. In CAD patients, walking/jogging produces greater LV function improvements versus circuit training, possibly due to differences in the exercised muscle mass.

Training complexity is not decisive factor for improving adaptation to visual sensory conflict.

PubMed

Yang, Yang; Pu, Fang; Li, Shuyu; Li, Yan; Li, Deyu; Fan, Yubo

2012-01-01

Ground-based preflight training utilizing unusual visual stimuli is useful for decreasing the susceptibility to space motion sickness (SMS). The effectiveness of the sensorimotor adaptation training is affected by the training tasks, but what kind of task is more effective remains unknown. Whether the complexity is the decisive factor to consider for designing the training and if other factors are more important need to be analyzed. The results from the analysis can help to optimize the preflight training tasks for astronauts. Twenty right-handed subjects were asked to draw the right path of 45° rotated maze before and after 30 min training. Subjects wore an up-down reversing prism spectacle in test and training sessions. Two training tasks were performed: drawing the right path of the horizontal maze (complex task but with different orientation feature) and drawing the L-shape lines (easy task with same orientation feature). The error rate and the executing time were measured during the test. Paired samples t test was used to compare the effects of the two training tasks. After each training, the error rate and the executing time were significantly decreased. However, the training effectiveness of the easy task was better as the test was finished more quickly and accurately. The complexity is not always the decisive factor for designing the adaptation training task, e.g. the orientation feature is more important in this study. In order to accelerate the adaptation and to counter SMS, the task for astronauts preflight adaptation training could be simple activities with the key features.

An algorithm of adaptive scale object tracking in occlusion

NASA Astrophysics Data System (ADS)

Zhao, Congmei

2017-05-01

Although the correlation filter-based trackers achieve the competitive results both on accuracy and robustness, there are still some problems in handling scale variations, object occlusion, fast motions and so on. In this paper, a multi-scale kernel correlation filter algorithm based on random fern detector was proposed. The tracking task was decomposed into the target scale estimation and the translation estimation. At the same time, the Color Names features and HOG features were fused in response level to further improve the overall tracking performance of the algorithm. In addition, an online random fern classifier was trained to re-obtain the target after the target was lost. By comparing with some algorithms such as KCF, DSST, TLD, MIL, CT and CSK, experimental results show that the proposed approach could estimate the object state accurately and handle the object occlusion effectively.

A Structure-Adaptive Hybrid RBF-BP Classifier with an Optimized Learning Strategy

PubMed Central

Wen, Hui; Xie, Weixin; Pei, Jihong

2016-01-01

This paper presents a structure-adaptive hybrid RBF-BP (SAHRBF-BP) classifier with an optimized learning strategy. SAHRBF-BP is composed of a structure-adaptive RBF network and a BP network of cascade, where the number of RBF hidden nodes is adjusted adaptively according to the distribution of sample space, the adaptive RBF network is used for nonlinear kernel mapping and the BP network is used for nonlinear classification. The optimized learning strategy is as follows: firstly, a potential function is introduced into training sample space to adaptively determine the number of initial RBF hidden nodes and node parameters, and a form of heterogeneous samples repulsive force is designed to further optimize each generated RBF hidden node parameters, the optimized structure-adaptive RBF network is used for adaptively nonlinear mapping the sample space; then, according to the number of adaptively generated RBF hidden nodes, the number of subsequent BP input nodes can be determined, and the overall SAHRBF-BP classifier is built up; finally, different training sample sets are used to train the BP network parameters in SAHRBF-BP. Compared with other algorithms applied to different data sets, experiments show the superiority of SAHRBF-BP. Especially on most low dimensional and large number of data sets, the classification performance of SAHRBF-BP outperforms other training SLFNs algorithms. PMID:27792737

Sequential Insertion Heuristic with Adaptive Bee Colony Optimisation Algorithm for Vehicle Routing Problem with Time Windows

PubMed Central

Jawarneh, Sana; Abdullah, Salwani

2015-01-01

This paper presents a bee colony optimisation (BCO) algorithm to tackle the vehicle routing problem with time window (VRPTW). The VRPTW involves recovering an ideal set of routes for a fleet of vehicles serving a defined number of customers. The BCO algorithm is a population-based algorithm that mimics the social communication patterns of honeybees in solving problems. The performance of the BCO algorithm is dependent on its parameters, so the online (self-adaptive) parameter tuning strategy is used to improve its effectiveness and robustness. Compared with the basic BCO, the adaptive BCO performs better. Diversification is crucial to the performance of the population-based algorithm, but the initial population in the BCO algorithm is generated using a greedy heuristic, which has insufficient diversification. Therefore the ways in which the sequential insertion heuristic (SIH) for the initial population drives the population toward improved solutions are examined. Experimental comparisons indicate that the proposed adaptive BCO-SIH algorithm works well across all instances and is able to obtain 11 best results in comparison with the best-known results in the literature when tested on Solomon’s 56 VRPTW 100 customer instances. Also, a statistical test shows that there is a significant difference between the results. PMID:26132158

Fully implicit moving mesh adaptive algorithm

NASA Astrophysics Data System (ADS)

Serazio, C.; Chacon, L.; Lapenta, G.

2006-10-01

In many problems of interest, the numerical modeler is faced with the challenge of dealing with multiple time and length scales. The former is best dealt with with fully implicit methods, which are able to step over fast frequencies to resolve the dynamical time scale of interest. The latter requires grid adaptivity for efficiency. Moving-mesh grid adaptive methods are attractive because they can be designed to minimize the numerical error for a given resolution. However, the required grid governing equations are typically very nonlinear and stiff, and of considerably difficult numerical treatment. Not surprisingly, fully coupled, implicit approaches where the grid and the physics equations are solved simultaneously are rare in the literature, and circumscribed to 1D geometries. In this study, we present a fully implicit algorithm for moving mesh methods that is feasible for multidimensional geometries. Crucial elements are the development of an effective multilevel treatment of the grid equation, and a robust, rigorous error estimator. For the latter, we explore the effectiveness of a coarse grid correction error estimator, which faithfully reproduces spatial truncation errors for conservative equations. We will show that the moving mesh approach is competitive vs. uniform grids both in accuracy (due to adaptivity) and efficiency. Results for a variety of models 1D and 2D geometries will be presented. L. Chac'on, G. Lapenta, J. Comput. Phys., 212 (2), 703 (2006) G. Lapenta, L. Chac'on, J. Comput. Phys., accepted (2006)

Identification of robust adaptation gene regulatory network parameters using an improved particle swarm optimization algorithm.

PubMed

Huang, X N; Ren, H P

2016-05-13

Robust adaptation is a critical ability of gene regulatory network (GRN) to survive in a fluctuating environment, which represents the system responding to an input stimulus rapidly and then returning to its pre-stimulus steady state timely. In this paper, the GRN is modeled using the Michaelis-Menten rate equations, which are highly nonlinear differential equations containing 12 undetermined parameters. The robust adaption is quantitatively described by two conflicting indices. To identify the parameter sets in order to confer the GRNs with robust adaptation is a multi-variable, multi-objective, and multi-peak optimization problem, which is difficult to acquire satisfactory solutions especially high-quality solutions. A new best-neighbor particle swarm optimization algorithm is proposed to implement this task. The proposed algorithm employs a Latin hypercube sampling method to generate the initial population. The particle crossover operation and elitist preservation strategy are also used in the proposed algorithm. The simulation results revealed that the proposed algorithm could identify multiple solutions in one time running. Moreover, it demonstrated a superior performance as compared to the previous methods in the sense of detecting more high-quality solutions within an acceptable time. The proposed methodology, owing to its universality and simplicity, is useful for providing the guidance to design GRN with superior robust adaptation.

The importance of training strategy adaptation: a learner-oriented approach for improving older adults' memory and transfer.

PubMed

Bottiroli, Sara; Cavallini, Elena; Dunlosky, John; Vecchi, Tomaso; Hertzog, Christopher

2013-09-01

We investigated the benefits of strategy-adaptation training for promoting transfer effects. This learner-oriented approach--which directly encourages the learner to generalize strategic behavior to new tasks--helps older adults appraise new tasks and adapt trained strategies to them. In Experiment 1, older adults in a strategy-adaptation training group used 2 strategies (imagery and sentence generation) while practicing 2 tasks (list and associative learning); they were then instructed on how to do a simple task analysis to help them adapt the trained strategies for 2 different unpracticed tasks (place learning and text learning) that were discussed during training. Two additional criterion tasks (name-face associative learning and grocery-list learning) were never mentioned during training. Two other groups were included: A strategy training group (who received strategy training and transfer instructions but not strategy-adaptation training) and a waiting-list control group. Both training procedures enhanced older adults' performance on the trained tasks and those tasks that were discussed during training, but transfer was greatest after strategy-adaptation training. Experiment 2 found that strategy-adaptation training conducted via a manual that older adults used at home also promoted transfer. These findings demonstrate the importance of adopting a learner-oriented approach to promote transfer of strategy training. PsycINFO Database Record (c) 2013 APA, all rights reserved.

A parallel second-order adaptive mesh algorithm for incompressible flow in porous media.

PubMed

Pau, George S H; Almgren, Ann S; Bell, John B; Lijewski, Michael J

2009-11-28

In this paper, we present a second-order accurate adaptive algorithm for solving multi-phase, incompressible flow in porous media. We assume a multi-phase form of Darcy's law with relative permeabilities given as a function of the phase saturation. The remaining equations express conservation of mass for the fluid constituents. In this setting, the total velocity, defined to be the sum of the phase velocities, is divergence free. The basic integration method is based on a total-velocity splitting approach in which we solve a second-order elliptic pressure equation to obtain a total velocity. This total velocity is then used to recast component conservation equations as nonlinear hyperbolic equations. Our approach to adaptive refinement uses a nested hierarchy of logically rectangular grids with simultaneous refinement of the grids in both space and time. The integration algorithm on the grid hierarchy is a recursive procedure in which coarse grids are advanced in time, fine grids are advanced multiple steps to reach the same time as the coarse grids and the data at different levels are then synchronized. The single-grid algorithm is described briefly, but the emphasis here is on the time-stepping procedure for the adaptive hierarchy. Numerical examples are presented to demonstrate the algorithm's accuracy and convergence properties and to illustrate the behaviour of the method.

The effects of working memory resource depletion and training on sensorimotor adaptation

PubMed Central

Anguera, Joaquin A.; Bernard, Jessica A.; Jaeggi, Susanne M.; Buschkuehl, Martin; Benson, Bryan L.; Jennett, Sarah; Humfleet, Jennifer; Reuter-Lorenz, Patricia; Jonides, John; Seidler, Rachael D.

2011-01-01

We have recently demonstrated that visuospatial working memory performance predicts the rate of motor skill learning, particularly during the early phase of visuomotor adaptation. Here, we follow up these correlational findings with direct manipulations of working memory resources to determine the impact on visuomotor adaptation, a form of motor learning. We conducted two separate experiments. In the first one, we used a resource depletion strategy to investigate whether the rate of early visuomotor adaptation would be negatively affected by fatigue of spatial working memory resources. In the second study, we employed a dual n-back task training paradigm that has been shown to result in transfer effects [1] over five weeks to determine whether training-related improvements would boost the rate of early visuomotor adaptation. The depletion of spatial working memory resources negatively affected the rate of early visuomotor adaptation. However, enhancing working memory capacity via training did not lead to improved rates of visuomotor adaptation, suggesting that working memory capacity may not be the factor limiting maximal rate of visuomotor adaptation in young adults. These findings are discussed from a resource limitation / capacity framework with respect to current views of motor learning. PMID:22155489

Adjoint-Based Algorithms for Adaptation and Design Optimizations on Unstructured Grids

NASA Technical Reports Server (NTRS)

Nielsen, Eric J.

2006-01-01

Schemes based on discrete adjoint algorithms present several exciting opportunities for significantly advancing the current state of the art in computational fluid dynamics. Such methods provide an extremely efficient means for obtaining discretely consistent sensitivity information for hundreds of design variables, opening the door to rigorous, automated design optimization of complex aerospace configuration using the Navier-Stokes equation. Moreover, the discrete adjoint formulation provides a mathematically rigorous foundation for mesh adaptation and systematic reduction of spatial discretization error. Error estimates are also an inherent by-product of an adjoint-based approach, valuable information that is virtually non-existent in today's large-scale CFD simulations. An overview of the adjoint-based algorithm work at NASA Langley Research Center is presented, with examples demonstrating the potential impact on complex computational problems related to design optimization as well as mesh adaptation.

Unsupervised Cryo-EM Data Clustering through Adaptively Constrained K-Means Algorithm

PubMed Central

Xu, Yaofang; Wu, Jiayi; Yin, Chang-Cheng; Mao, Youdong

2016-01-01

In single-particle cryo-electron microscopy (cryo-EM), K-means clustering algorithm is widely used in unsupervised 2D classification of projection images of biological macromolecules. 3D ab initio reconstruction requires accurate unsupervised classification in order to separate molecular projections of distinct orientations. Due to background noise in single-particle images and uncertainty of molecular orientations, traditional K-means clustering algorithm may classify images into wrong classes and produce classes with a large variation in membership. Overcoming these limitations requires further development on clustering algorithms for cryo-EM data analysis. We propose a novel unsupervised data clustering method building upon the traditional K-means algorithm. By introducing an adaptive constraint term in the objective function, our algorithm not only avoids a large variation in class sizes but also produces more accurate data clustering. Applications of this approach to both simulated and experimental cryo-EM data demonstrate that our algorithm is a significantly improved alterative to the traditional K-means algorithm in single-particle cryo-EM analysis. PMID:27959895

An improved multi-domain convolution tracking algorithm

NASA Astrophysics Data System (ADS)

Sun, Xin; Wang, Haiying; Zeng, Yingsen

2018-04-01

Along with the wide application of the Deep Learning in the field of Computer vision, Deep learning has become a mainstream direction in the field of object tracking. The tracking algorithm in this paper is based on the improved multidomain convolution neural network, and the VOT video set is pre-trained on the network by multi-domain training strategy. In the process of online tracking, the network evaluates candidate targets sampled from vicinity of the prediction target in the previous with Gaussian distribution, and the candidate target with the highest score is recognized as the prediction target of this frame. The Bounding Box Regression model is introduced to make the prediction target closer to the ground-truths target box of the test set. Grouping-update strategy is involved to extract and select useful update samples in each frame, which can effectively prevent over fitting. And adapt to changes in both target and environment. To improve the speed of the algorithm while maintaining the performance, the number of candidate target succeed in adjusting dynamically with the help of Self-adaption parameter Strategy. Finally, the algorithm is tested by OTB set, compared with other high-performance tracking algorithms, and the plot of success rate and the accuracy are drawn. which illustrates outstanding performance of the tracking algorithm in this paper.

A High Fuel Consumption Efficiency Management Scheme for PHEVs Using an Adaptive Genetic Algorithm

PubMed Central

Lee, Wah Ching; Tsang, Kim Fung; Chi, Hao Ran; Hung, Faan Hei; Wu, Chung Kit; Chui, Kwok Tai; Lau, Wing Hong; Leung, Yat Wah

2015-01-01

A high fuel efficiency management scheme for plug-in hybrid electric vehicles (PHEVs) has been developed. In order to achieve fuel consumption reduction, an adaptive genetic algorithm scheme has been designed to adaptively manage the energy resource usage. The objective function of the genetic algorithm is implemented by designing a fuzzy logic controller which closely monitors and resembles the driving conditions and environment of PHEVs, thus trading off between petrol versus electricity for optimal driving efficiency. Comparison between calculated results and publicized data shows that the achieved efficiency of the fuzzified genetic algorithm is better by 10% than existing schemes. The developed scheme, if fully adopted, would help reduce over 600 tons of CO2 emissions worldwide every day. PMID:25587974

An Adaptive Reputation-Based Algorithm for Grid Virtual Organization Formation

NASA Astrophysics Data System (ADS)

Cui, Yongrui; Li, Mingchu; Ren, Yizhi; Sakurai, Kouichi

A novel adaptive reputation-based virtual organization formation is proposed. It restrains the bad performers effectively based on the consideration of the global experience of the evaluator and evaluates the direct trust relation between two grid nodes accurately by consulting the previous trust value rationally. It also consults and improves the reputation evaluation process in PathTrust model by taking account of the inter-organizational trust relationship and combines it with direct and recommended trust in a weighted way, which makes the algorithm more robust against collusion attacks. Additionally, the proposed algorithm considers the perspective of the VO creator and takes required VO services as one of the most important fine-grained evaluation criterion, which makes the algorithm more suitable for constructing VOs in grid environments that include autonomous organizations. Simulation results show that our algorithm restrains the bad performers and resists against fake transaction attacks and badmouth attacks effectively. It provides a clear advantage in the design of a VO infrastructure.

Enhancing astronaut performance using sensorimotor adaptability training

PubMed Central

Bloomberg, Jacob J.; Peters, Brian T.; Cohen, Helen S.; Mulavara, Ajitkumar P.

2015-01-01

Astronauts experience disturbances in balance and gait function when they return to Earth. The highly plastic human brain enables individuals to modify their behavior to match the prevailing environment. Subjects participating in specially designed variable sensory challenge training programs can enhance their ability to rapidly adapt to novel sensory situations. This is useful in our application because we aim to train astronauts to rapidly formulate effective strategies to cope with the balance and locomotor challenges associated with new gravitational environments—enhancing their ability to “learn to learn.” We do this by coupling various combinations of sensorimotor challenges with treadmill walking. A unique training system has been developed that is comprised of a treadmill mounted on a motion base to produce movement of the support surface during walking. This system provides challenges to gait stability. Additional sensory variation and challenge are imposed with a virtual visual scene that presents subjects with various combinations of discordant visual information during treadmill walking. This experience allows them to practice resolving challenging and conflicting novel sensory information to improve their ability to adapt rapidly. Information obtained from this work will inform the design of the next generation of sensorimotor countermeasures for astronauts. PMID:26441561

An Adaptive Cultural Algorithm with Improved Quantum-behaved Particle Swarm Optimization for Sonar Image Detection.

PubMed

Wang, Xingmei; Hao, Wenqian; Li, Qiming

2017-12-18

This paper proposes an adaptive cultural algorithm with improved quantum-behaved particle swarm optimization (ACA-IQPSO) to detect the underwater sonar image. In the population space, to improve searching ability of particles, iterative times and the fitness value of particles are regarded as factors to adaptively adjust the contraction-expansion coefficient of the quantum-behaved particle swarm optimization algorithm (QPSO). The improved quantum-behaved particle swarm optimization algorithm (IQPSO) can make particles adjust their behaviours according to their quality. In the belief space, a new update strategy is adopted to update cultural individuals according to the idea of the update strategy in shuffled frog leaping algorithm (SFLA). Moreover, to enhance the utilization of information in the population space and belief space, accept function and influence function are redesigned in the new communication protocol. The experimental results show that ACA-IQPSO can obtain good clustering centres according to the grey distribution information of underwater sonar images, and accurately complete underwater objects detection. Compared with other algorithms, the proposed ACA-IQPSO has good effectiveness, excellent adaptability, a powerful searching ability and high convergence efficiency. Meanwhile, the experimental results of the benchmark functions can further demonstrate that the proposed ACA-IQPSO has better searching ability, convergence efficiency and stability.

Adapting Aquatic Circuit Training for Special Populations.

ERIC Educational Resources Information Center

Thome, Kathleen

1980-01-01

The author discusses how land activities can be adapted to water so that individuals with handicapping conditions can participate in circuit training activities. An initial section lists such organizational procedures as providing vocal and/or visual cues for activities, having assistants accompany the performers throughout the circuit, and…

An Adaptive Numeric Predictor-corrector Guidance Algorithm for Atmospheric Entry Vehicles. M.S. Thesis - MIT, Cambridge

NASA Technical Reports Server (NTRS)

Spratlin, Kenneth Milton

1987-01-01

An adaptive numeric predictor-corrector guidance is developed for atmospheric entry vehicles which utilize lift to achieve maximum footprint capability. Applicability of the guidance design to vehicles with a wide range of performance capabilities is desired so as to reduce the need for algorithm redesign with each new vehicle. Adaptability is desired to minimize mission-specific analysis and planning. The guidance algorithm motivation and design are presented. Performance is assessed for application of the algorithm to the NASA Entry Research Vehicle (ERV). The dispersions the guidance must be designed to handle are presented. The achievable operational footprint for expected worst-case dispersions is presented. The algorithm performs excellently for the expected dispersions and captures most of the achievable footprint.

Implementations of back propagation algorithm in ecosystems applications

NASA Astrophysics Data System (ADS)

Ali, Khalda F.; Sulaiman, Riza; Elamir, Amir Mohamed

2015-05-01

Artificial Neural Networks (ANNs) have been applied to an increasing number of real world problems of considerable complexity. Their most important advantage is in solving problems which are too complex for conventional technologies, that do not have an algorithmic solutions or their algorithmic Solutions is too complex to be found. In general, because of their abstraction from the biological brain, ANNs are developed from concept that evolved in the late twentieth century neuro-physiological experiments on the cells of the human brain to overcome the perceived inadequacies with conventional ecological data analysis methods. ANNs have gained increasing attention in ecosystems applications, because of ANN's capacity to detect patterns in data through non-linear relationships, this characteristic confers them a superior predictive ability. In this research, ANNs is applied in an ecological system analysis. The neural networks use the well known Back Propagation (BP) Algorithm with the Delta Rule for adaptation of the system. The Back Propagation (BP) training Algorithm is an effective analytical method for adaptation of the ecosystems applications, the main reason because of their capacity to detect patterns in data through non-linear relationships. This characteristic confers them a superior predicting ability. The BP algorithm uses supervised learning, which means that we provide the algorithm with examples of the inputs and outputs we want the network to compute, and then the error is calculated. The idea of the back propagation algorithm is to reduce this error, until the ANNs learns the training data. The training begins with random weights, and the goal is to adjust them so that the error will be minimal. This research evaluated the use of artificial neural networks (ANNs) techniques in an ecological system analysis and modeling. The experimental results from this research demonstrate that an artificial neural network system can be trained to act as an expert

A semi-supervised classification algorithm using the TAD-derived background as training data

NASA Astrophysics Data System (ADS)

Fan, Lei; Ambeau, Brittany; Messinger, David W.

2013-05-01

In general, spectral image classification algorithms fall into one of two categories: supervised and unsupervised. In unsupervised approaches, the algorithm automatically identifies clusters in the data without a priori information about those clusters (except perhaps the expected number of them). Supervised approaches require an analyst to identify training data to learn the characteristics of the clusters such that they can then classify all other pixels into one of the pre-defined groups. The classification algorithm presented here is a semi-supervised approach based on the Topological Anomaly Detection (TAD) algorithm. The TAD algorithm defines background components based on a mutual k-Nearest Neighbor graph model of the data, along with a spectral connected components analysis. Here, the largest components produced by TAD are used as regions of interest (ROI's),or training data for a supervised classification scheme. By combining those ROI's with a Gaussian Maximum Likelihood (GML) or a Minimum Distance to the Mean (MDM) algorithm, we are able to achieve a semi supervised classification method. We test this classification algorithm against data collected by the HyMAP sensor over the Cooke City, MT area and University of Pavia scene.

Robustness of continuous-time adaptive control algorithms in the presence of unmodeled dynamics

NASA Technical Reports Server (NTRS)

Rohrs, C. E.; Valavani, L.; Athans, M.; Stein, G.

1985-01-01

This paper examines the robustness properties of existing adaptive control algorithms to unmodeled plant high-frequency dynamics and unmeasurable output disturbances. It is demonstrated that there exist two infinite-gain operators in the nonlinear dynamic system which determines the time-evolution of output and parameter errors. The pragmatic implications of the existence of such infinite-gain operators is that: (1) sinusoidal reference inputs at specific frequencies and/or (2) sinusoidal output disturbances at any frequency (including dc), can cause the loop gain to increase without bound, thereby exciting the unmodeled high-frequency dynamics, and yielding an unstable control system. Hence, it is concluded that existing adaptive control algorithms as they are presented in the literature referenced in this paper, cannot be used with confidence in practical designs where the plant contains unmodeled dynamics because instability is likely to result. Further understanding is required to ascertain how the currently implemented adaptive systems differ from the theoretical systems studied here and how further theoretical development can improve the robustness of adaptive controllers.

Robust Adaptive Modified Newton Algorithm for Generalized Eigendecomposition and Its Application

NASA Astrophysics Data System (ADS)

Yang, Jian; Yang, Feng; Xi, Hong-Sheng; Guo, Wei; Sheng, Yanmin

2007-12-01

We propose a robust adaptive algorithm for generalized eigendecomposition problems that arise in modern signal processing applications. To that extent, the generalized eigendecomposition problem is reinterpreted as an unconstrained nonlinear optimization problem. Starting from the proposed cost function and making use of an approximation of the Hessian matrix, a robust modified Newton algorithm is derived. A rigorous analysis of its convergence properties is presented by using stochastic approximation theory. We also apply this theory to solve the signal reception problem of multicarrier DS-CDMA to illustrate its practical application. The simulation results show that the proposed algorithm has fast convergence and excellent tracking capability, which are important in a practical time-varying communication environment.

Algorithm design, user interface, and optimization procedure for a fuzzy logic ramp metering algorithm : a training manual for freeway operations engineers

DOT National Transportation Integrated Search

2000-02-01

This training manual describes the fuzzy logic ramp metering algorithm in detail, as implemented system-wide in the greater Seattle area. The method of defining the inputs to the controller and optimizing the performance of the algorithm is explained...

QUEST: Eliminating Online Supervised Learning for Efficient Classification Algorithms.

PubMed

Zwartjes, Ardjan; Havinga, Paul J M; Smit, Gerard J M; Hurink, Johann L

2016-10-01

In this work, we introduce QUEST (QUantile Estimation after Supervised Training), an adaptive classification algorithm for Wireless Sensor Networks (WSNs) that eliminates the necessity for online supervised learning. Online processing is important for many sensor network applications. Transmitting raw sensor data puts high demands on the battery, reducing network life time. By merely transmitting partial results or classifications based on the sampled data, the amount of traffic on the network can be significantly reduced. Such classifications can be made by learning based algorithms using sampled data. An important issue, however, is the training phase of these learning based algorithms. Training a deployed sensor network requires a lot of communication and an impractical amount of human involvement. QUEST is a hybrid algorithm that combines supervised learning in a controlled environment with unsupervised learning on the location of deployment. Using the SITEX02 dataset, we demonstrate that the presented solution works with a performance penalty of less than 10% in 90% of the tests. Under some circumstances, it even outperforms a network of classifiers completely trained with supervised learning. As a result, the need for on-site supervised learning and communication for training is completely eliminated by our solution.

Adaptive Swarm Balancing Algorithms for rare-event prediction in imbalanced healthcare data

PubMed Central

Wong, Raymond K.; Mohammed, Sabah; Fiaidhi, Jinan; Sung, Yunsick

2017-01-01

Clinical data analysis and forecasting have made substantial contributions to disease control, prevention and detection. However, such data usually suffer from highly imbalanced samples in class distributions. In this paper, we aim to formulate effective methods to rebalance binary imbalanced dataset, where the positive samples take up only the minority. We investigate two different meta-heuristic algorithms, particle swarm optimization and bat algorithm, and apply them to empower the effects of synthetic minority over-sampling technique (SMOTE) for pre-processing the datasets. One approach is to process the full dataset as a whole. The other is to split up the dataset and adaptively process it one segment at a time. The experimental results reported in this paper reveal that the performance improvements obtained by the former methods are not scalable to larger data scales. The latter methods, which we call Adaptive Swarm Balancing Algorithms, lead to significant efficiency and effectiveness improvements on large datasets while the first method is invalid. We also find it more consistent with the practice of the typical large imbalanced medical datasets. We further use the meta-heuristic algorithms to optimize two key parameters of SMOTE. The proposed methods lead to more credible performances of the classifier, and shortening the run time compared to brute-force method. PMID:28753613

Analysis of Online DBA Algorithm with Adaptive Sleep Cycle in WDM EPON

NASA Astrophysics Data System (ADS)

Pajčin, Bojan; Matavulj, Petar; Radivojević, Mirjana

2018-05-01

In order to manage Quality of Service (QoS) and energy efficiency in the optical access network, an online Dynamic Bandwidth Allocation (DBA) algorithm with adaptive sleep cycle is presented. This DBA algorithm has the ability to allocate an additional bandwidth to the end user within a single sleep cycle whose duration changes depending on the current buffers occupancy. The purpose of this DBA algorithm is to tune the duration of the sleep cycle depending on the network load in order to provide service to the end user without violating strict QoS requests in all network operating conditions.

Physiological adaptations to interval training and the role of exercise intensity

PubMed Central

MacInnis, Martin J.

2016-01-01

Abstract Interval exercise typically involves repeated bouts of relatively intense exercise interspersed by short periods of recovery. A common classification scheme subdivides this method into high‐intensity interval training (HIIT; ‘near maximal’ efforts) and sprint interval training (SIT; ‘supramaximal’ efforts). Both forms of interval training induce the classic physiological adaptations characteristic of moderate‐intensity continuous training (MICT) such as increased aerobic capacity (V˙O2 max ) and mitochondrial content. This brief review considers the role of exercise intensity in mediating physiological adaptations to training, with a focus on the capacity for aerobic energy metabolism. With respect to skeletal muscle adaptations, cellular stress and the resultant metabolic signals for mitochondrial biogenesis depend largely on exercise intensity, with limited work suggesting that increases in mitochondrial content are superior after HIIT compared to MICT, at least when matched‐work comparisons are made within the same individual. It is well established that SIT increases mitochondrial content to a similar extent to MICT despite a reduced exercise volume. At the whole‐body level, V˙O2 max is generally increased more by HIIT than MICT for a given training volume, whereas SIT and MICT similarly improve V˙O2 max despite differences in training volume. There is less evidence available regarding the role of exercise intensity in mediating changes in skeletal muscle capillary density, maximum stroke volume and cardiac output, and blood volume. Furthermore, the interactions between intensity and duration and frequency have not been thoroughly explored. While interval training is clearly a potent stimulus for physiological remodelling in humans, the integrative response to this type of exercise warrants further attention, especially in comparison to traditional endurance training. PMID:27748956

An Adaptive Evolutionary Algorithm for Traveling Salesman Problem with Precedence Constraints

PubMed Central

Sung, Jinmo; Jeong, Bongju

2014-01-01

Traveling sales man problem with precedence constraints is one of the most notorious problems in terms of the efficiency of its solution approach, even though it has very wide range of industrial applications. We propose a new evolutionary algorithm to efficiently obtain good solutions by improving the search process. Our genetic operators guarantee the feasibility of solutions over the generations of population, which significantly improves the computational efficiency even when it is combined with our flexible adaptive searching strategy. The efficiency of the algorithm is investigated by computational experiments. PMID:24701158

An adaptive evolutionary algorithm for traveling salesman problem with precedence constraints.

PubMed

Sung, Jinmo; Jeong, Bongju

2014-01-01

Traveling sales man problem with precedence constraints is one of the most notorious problems in terms of the efficiency of its solution approach, even though it has very wide range of industrial applications. We propose a new evolutionary algorithm to efficiently obtain good solutions by improving the search process. Our genetic operators guarantee the feasibility of solutions over the generations of population, which significantly improves the computational efficiency even when it is combined with our flexible adaptive searching strategy. The efficiency of the algorithm is investigated by computational experiments.

An on-line modified least-mean-square algorithm for training neurofuzzy controllers.

PubMed

Tan, Woei Wan

2007-04-01

The problem hindering the use of data-driven modelling methods for training controllers on-line is the lack of control over the amount by which the plant is excited. As the operating schedule determines the information available on-line, the knowledge of the process may degrade if the setpoint remains constant for an extended period. This paper proposes an identification algorithm that alleviates "learning interference" by incorporating fuzzy theory into the normalized least-mean-square update rule. The ability of the proposed methodology to achieve faster learning is examined by employing the algorithm to train a neurofuzzy feedforward controller for controlling a liquid level process. Since the proposed identification strategy has similarities with the normalized least-mean-square update rule and the recursive least-square estimator, the on-line learning rates of these algorithms are also compared.

Do antioxidant supplements interfere with skeletal muscle adaptation to exercise training?

PubMed Central

Ristow, Michael

2016-01-01

Abstract A popular belief is that reactive oxygen species (ROS) and reactive nitrogen species (RNS) produced during exercise by the mitochondria and other subcellular compartments ubiquitously cause skeletal muscle damage, fatigue and impair recovery. However, the importance of ROS and RNS as signals in the cellular adaptation process to stress is now evident. In an effort to combat the perceived deleterious effects of ROS and RNS it has become common practice for active individuals to ingest supplements with antioxidant properties, but interfering with ROS/RNS signalling in skeletal muscle during acute exercise may blunt favourable adaptation. There is building evidence that antioxidant supplementation can attenuate endurance training‐induced and ROS/RNS‐mediated enhancements in antioxidant capacity, mitochondrial biogenesis, cellular defence mechanisms and insulin sensitivity. However, this is not a universal finding, potentially indicating that there is redundancy in the mechanisms controlling skeletal muscle adaptation to exercise, meaning that in some circumstances the negative impact of antioxidants on acute exercise response can be overcome by training. Antioxidant supplementation has been more consistently reported to have deleterious effects on the response to overload stress and high‐intensity training, suggesting that remodelling of skeletal muscle following resistance and high‐intensity exercise is more dependent on ROS/RNS signalling. Importantly there is no convincing evidence to suggest that antioxidant supplementation enhances exercise‐training adaptions. Overall, ROS/RNS are likely to exhibit a non‐linear (hormetic) pattern on exercise adaptations, where physiological doses are beneficial and high exposure (which would seldom be achieved during normal exercise training) may be detrimental. PMID:26638792

Wavefront sensorless adaptive optics OCT with the DONE algorithm for in vivo human retinal imaging [Invited].

PubMed

Verstraete, Hans R G W; Heisler, Morgan; Ju, Myeong Jin; Wahl, Daniel; Bliek, Laurens; Kalkman, Jeroen; Bonora, Stefano; Jian, Yifan; Verhaegen, Michel; Sarunic, Marinko V

2017-04-01

In this report, which is an international collaboration of OCT, adaptive optics, and control research, we demonstrate the Data-based Online Nonlinear Extremum-seeker (DONE) algorithm to guide the image based optimization for wavefront sensorless adaptive optics (WFSL-AO) OCT for in vivo human retinal imaging. The ocular aberrations were corrected using a multi-actuator adaptive lens after linearization of the hysteresis in the piezoelectric actuators. The DONE algorithm succeeded in drastically improving image quality and the OCT signal intensity, up to a factor seven, while achieving a computational time of 1 ms per iteration, making it applicable for many high speed applications. We demonstrate the correction of five aberrations using 70 iterations of the DONE algorithm performed over 2.8 s of continuous volumetric OCT acquisition. Data acquired from an imaging phantom and in vivo from human research volunteers are presented.

Adaptive model training system and method

DOEpatents

Bickford, Randall L; Palnitkar, Rahul M; Lee, Vo

2014-04-15

An adaptive model training system and method for filtering asset operating data values acquired from a monitored asset for selectively choosing asset operating data values that meet at least one predefined criterion of good data quality while rejecting asset operating data values that fail to meet at least the one predefined criterion of good data quality; and recalibrating a previously trained or calibrated model having a learned scope of normal operation of the asset by utilizing the asset operating data values that meet at least the one predefined criterion of good data quality for adjusting the learned scope of normal operation of the asset for defining a recalibrated model having the adjusted learned scope of normal operation of the asset.

Adaptive model training system and method

DOEpatents

Bickford, Randall L; Palnitkar, Rahul M

2014-11-18

An adaptive model training system and method for filtering asset operating data values acquired from a monitored asset for selectively choosing asset operating data values that meet at least one predefined criterion of good data quality while rejecting asset operating data values that fail to meet at least the one predefined criterion of good data quality; and recalibrating a previously trained or calibrated model having a learned scope of normal operation of the asset by utilizing the asset operating data values that meet at least the one predefined criterion of good data quality for adjusting the learned scope of normal operation of the asset for defining a recalibrated model having the adjusted learned scope of normal operation of the asset.

Autonomic adaptation after traditional and reverse swimming training periodizations.

PubMed

Clemente-Suárez, Vicente Javier; Fernandes, R J; Arroyo-Toledo, J J; Figueiredo, P; González-Ravé, J M; Vilas-Boas, J P

2015-03-01

The objective of the present study was to analyze the autonomic response of trained swimmers to traditional and reverse training periodization models. Seventeen swimmers were divided in two groups, performing a traditional periodization (TPG) or a reverse periodization (RPG) during a period of 10 weeks. Heart rate variability and 50 m swimming performance were analyzed before and after the training programs. After training, the TPG decreased the values of the high frequency band (HF), the number of differences between adjacent normal R-R intervals longer than 50 ms (NN50) and the percentage of differences between adjacent normal R-R intervals more than 50 ms (pNN50), and the RPG increased the values of HF and square root of the mean of the sum of the squared differences between adjacent normal R-R intervals (RMSSD). None of the groups improved significantly their performance in the 50-m test. The autonomic response of swimmers was different depending on the periodization performed, with the reverse periodization model leading to higher autonomic adaption. Complementary, the data suggests that autonomic adaptations were not critical for the 50-m swimming performance.

Efficient generation of image chips for training deep learning algorithms

NASA Astrophysics Data System (ADS)

Han, Sanghui; Fafard, Alex; Kerekes, John; Gartley, Michael; Ientilucci, Emmett; Savakis, Andreas; Law, Charles; Parhan, Jason; Turek, Matt; Fieldhouse, Keith; Rovito, Todd

2017-05-01

Training deep convolutional networks for satellite or aerial image analysis often requires a large amount of training data. For a more robust algorithm, training data need to have variations not only in the background and target, but also radiometric variations in the image such as shadowing, illumination changes, atmospheric conditions, and imaging platforms with different collection geometry. Data augmentation is a commonly used approach to generating additional training data. However, this approach is often insufficient in accounting for real world changes in lighting, location or viewpoint outside of the collection geometry. Alternatively, image simulation can be an efficient way to augment training data that incorporates all these variations, such as changing backgrounds, that may be encountered in real data. The Digital Imaging and Remote Sensing Image Image Generation (DIRSIG) model is a tool that produces synthetic imagery using a suite of physics-based radiation propagation modules. DIRSIG can simulate images taken from different sensors with variation in collection geometry, spectral response, solar elevation and angle, atmospheric models, target, and background. Simulation of Urban Mobility (SUMO) is a multi-modal traffic simulation tool that explicitly models vehicles that move through a given road network. The output of the SUMO model was incorporated into DIRSIG to generate scenes with moving vehicles. The same approach was used when using helicopters as targets, but with slight modifications. Using the combination of DIRSIG and SUMO, we quickly generated many small images, with the target at the center with different backgrounds. The simulations generated images with vehicles and helicopters as targets, and corresponding images without targets. Using parallel computing, 120,000 training images were generated in about an hour. Some preliminary results show an improvement in the deep learning algorithm when real image training data are augmented with

Effects of different volume-equated resistance training loading strategies on muscular adaptations in well-trained men.

PubMed

Schoenfeld, Brad J; Ratamess, Nicholas A; Peterson, Mark D; Contreras, Bret; Sonmez, G T; Alvar, Brent A

2014-10-01

Regimented resistance training has been shown to promote marked increases in skeletal muscle mass. Although muscle hypertrophy can be attained through a wide range of resistance training programs, the principle of specificity, which states that adaptations are specific to the nature of the applied stimulus, dictates that some programs will promote greater hypertrophy than others. Research is lacking, however, as to the best combination of variables required to maximize hypertophic gains. The purpose of this study was to investigate muscular adaptations to a volume-equated bodybuilding-type training program vs. a powerlifting-type routine in well-trained subjects. Seventeen young men were randomly assigned to either a hypertrophy-type resistance training group that performed 3 sets of 10 repetition maximum (RM) with 90 seconds rest or a strength-type resistance training (ST) group that performed 7 sets of 3RM with a 3-minute rest interval. After 8 weeks, no significant differences were noted in muscle thickness of the biceps brachii. Significant strength differences were found in favor of ST for the 1RM bench press, and a trend was found for greater increases in the 1RM squat. In conclusion, this study showed that both bodybuilding- and powerlifting-type training promote similar increases in muscular size, but powerlifting-type training is superior for enhancing maximal strength.

Adaptive training diminishes distractibility in aging across species.

PubMed

Mishra, Jyoti; de Villers-Sidani, Etienne; Merzenich, Michael; Gazzaley, Adam

2014-12-03

Aging is associated with deficits in the ability to ignore distractions, which has not yet been remediated by any neurotherapeutic approach. Here, in parallel auditory experiments with older rats and humans, we evaluated a targeted cognitive training approach that adaptively manipulated distractor challenge. Training resulted in enhanced discrimination abilities in the setting of irrelevant information in both species that was driven by selectively diminished distraction-related errors. Neural responses to distractors in auditory cortex were selectively reduced in both species, mimicking the behavioral effects. Sensory receptive fields in trained rats exhibited improved spectral and spatial selectivity. Frontal theta measures of top-down engagement with distractors were selectively restrained in trained humans. Finally, training gains generalized to group and individual level benefits in aspects of working memory and sustained attention. Thus, we demonstrate converging cross-species evidence for training-induced selective plasticity of distractor processing at multiple neural scales, benefitting distractor suppression and cognitive control. Copyright © 2014 Elsevier Inc. All rights reserved.

Smell Detection Agent Based Optimization Algorithm

NASA Astrophysics Data System (ADS)

Vinod Chandra, S. S.

2016-09-01

In this paper, a novel nature-inspired optimization algorithm has been employed and the trained behaviour of dogs in detecting smell trails is adapted into computational agents for problem solving. The algorithm involves creation of a surface with smell trails and subsequent iteration of the agents in resolving a path. This algorithm can be applied in different computational constraints that incorporate path-based problems. Implementation of the algorithm can be treated as a shortest path problem for a variety of datasets. The simulated agents have been used to evolve the shortest path between two nodes in a graph. This algorithm is useful to solve NP-hard problems that are related to path discovery. This algorithm is also useful to solve many practical optimization problems. The extensive derivation of the algorithm can be enabled to solve shortest path problems.

[A study on training method for increasing adaptability to blood redistribution in human].

PubMed

Wu, Bin; You, Guang-xing; Wu, Ping; Xue, Yue-ying; Liu, Xing-hua; Su, Shuang-ning

2003-01-01

To verify validity of the increase in adaptability of blood redistribution in human body with repeated body position change training and to find preferable training method for increasing astronaut's adaptability of blood redistribution. Twelve subjects were randomly divided into group A and B. Six subjects in each group were trained with mode A and B repeated position change (9 times in 11 d) respectively. Their head-down tilt (HDT -30 degrees/30 min) tolerance and orthostatic tolerance were determined before and after training to verify training effects. 1) Two kinds of repeated body position change training modes increased all subjects' HDT tolerance. Compared with pre-training, during HDT test subjects' symptom scores in group B were significantly lower than those in group A (P<0.05) and after training decreasing magnitude of heart rate in group B increased significantly (P<0.01). Then mode B to be preferable training method in increasing HDT tolerance was suggested. 2) Two kinds of training modes improved all subjects' orthostatic tolerance. Compared with pre-training, during orthostatic tolerance test increasing magnitude of mean arterial blood pressure in group B increased significantly (P<0.05) and a trend of increasing magnitude of heart rate in group B was appeared smaller than in group A (P<0.10). Mode B to be preferable training method in increasing orthostatic tolerance was suggested too. Repeated body position change training could increase adaptability to blood redistribution in human body. Mode B was preferable training method and would be hopeful to be used in astronaut training.

SIMULATION OF DISPERSION OF A POWER PLANT PLUME USING AN ADAPTIVE GRID ALGORITHM. (R827028)

EPA Science Inventory

A new dynamic adaptive grid algorithm has been developed for use in air quality modeling. This algorithm uses a higher order numerical scheme––the piecewise parabolic method (PPM)––for computing advective solution fields; a weight function capable o...

Single neural adaptive controller and neural network identifier based on PSO algorithm for spherical actuators with 3D magnet array

NASA Astrophysics Data System (ADS)

Yan, Liang; Zhang, Lu; Zhu, Bo; Zhang, Jingying; Jiao, Zongxia

2017-10-01

Permanent magnet spherical actuator (PMSA) is a multi-variable featured and inter-axis coupled nonlinear system, which unavoidably compromises its motion control implementation. Uncertainties such as external load and friction torque of ball bearing and manufacturing errors also influence motion performance significantly. Therefore, the objective of this paper is to propose a controller based on a single neural adaptive (SNA) algorithm and a neural network (NN) identifier optimized with a particle swarm optimization (PSO) algorithm to improve the motion stability of PMSA with three-dimensional magnet arrays. The dynamic model and computed torque model are formulated for the spherical actuator, and a dynamic decoupling control algorithm is developed. By utilizing the global-optimization property of the PSO algorithm, the NN identifier is trained to avoid locally optimal solution and achieve high-precision compensations to uncertainties. The employment of the SNA controller helps to reduce the effect of compensation errors and convert the system to a stable one, even if there is difference between the compensations and uncertainties due to external disturbances. A simulation model is established, and experiments are conducted on the research prototype to validate the proposed control algorithm. The amplitude of the parameter perturbation is set to 5%, 10%, and 15%, respectively. The strong robustness of the proposed hybrid algorithm is validated by the abundant simulation data. It shows that the proposed algorithm can effectively compensate the influence of uncertainties and eliminate the effect of inter-axis couplings of the spherical actuator.

Analysis of convergence of an evolutionary algorithm with self-adaptation using a stochastic Lyapunov function.

PubMed

Semenov, Mikhail A; Terkel, Dmitri A

2003-01-01

This paper analyses the convergence of evolutionary algorithms using a technique which is based on a stochastic Lyapunov function and developed within the martingale theory. This technique is used to investigate the convergence of a simple evolutionary algorithm with self-adaptation, which contains two types of parameters: fitness parameters, belonging to the domain of the objective function; and control parameters, responsible for the variation of fitness parameters. Although both parameters mutate randomly and independently, they converge to the "optimum" due to the direct (for fitness parameters) and indirect (for control parameters) selection. We show that the convergence velocity of the evolutionary algorithm with self-adaptation is asymptotically exponential, similar to the velocity of the optimal deterministic algorithm on the class of unimodal functions. Although some martingale inequalities have not be proved analytically, they have been numerically validated with 0.999 confidence using Monte-Carlo simulations.

Advanced Dynamically Adaptive Algorithms for Stochastic Simulations on Extreme Scales

DOE Office of Scientific and Technical Information (OSTI.GOV)

Xiu, Dongbin

2017-03-03

The focus of the project is the development of mathematical methods and high-performance computational tools for stochastic simulations, with a particular emphasis on computations on extreme scales. The core of the project revolves around the design of highly efficient and scalable numerical algorithms that can adaptively and accurately, in high dimensional spaces, resolve stochastic problems with limited smoothness, even containing discontinuities.

The influence of taekwondo training on school-life adaptation and exercise value in the United States

PubMed Central

Cho, Ik Rae; Park, Hyo Joo; Lee, Taek Kyun

2018-01-01

Previous experience has shown that school-based taekwondo training in the United States (US) results in many beneficial effect sregarding school education and the physical health of the adolescent participants; of especial significance, the training plays an important role in terms of exercise value and school-life adaptation. To explore this overall effect, a self-administered questionnaire was distributed to 401 adolescents over the age of 10 years. The survey comprisesa total of 29 questions that consist of 17 exercise-value-related questions (general, moral, and status) and 12 questions that are related to school-life adaptation (adaptation to teachers, adaptation to academic activities, adaptation to rule compliance, and adaptation to school activities). The survey results show that taekwondo training affects school-life adaptation by helping to improve student morality and by bolstering the students compliance with school rules during their schooling. The exercise value of taekwondo training is considered a necessity for US adolescents due to the corresponding educational aspects; in particular, the training plays a very important role in the maintenance of amenable student-teacher and student-peer relationships. From the previously mentioned findings, and if taekwondo teachers train their students carefully with educational missions in mind, it is expected that taekwondo training will play a very important role in the cultivation of anappropriate education value among US adolescents. PMID:29740554

The influence of taekwondo training on school-life adaptation and exercise value in the United States.

PubMed

Cho, Ik Rae; Park, Hyo Joo; Lee, Taek Kyun

2018-04-01

Previous experience has shown that school-based taekwondo training in the United States (US) results in many beneficial effect sregarding school education and the physical health of the adolescent participants; of especial significance, the training plays an important role in terms of exercise value and school-life adaptation. To explore this overall effect, a self-administered questionnaire was distributed to 401 adolescents over the age of 10 years. The survey comprisesa total of 29 questions that consist of 17 exercise-value-related questions (general, moral, and status) and 12 questions that are related to school-life adaptation (adaptation to teachers, adaptation to academic activities, adaptation to rule compliance, and adaptation to school activities). The survey results show that taekwondo training affects school-life adaptation by helping to improve student morality and by bolstering the students compliance with school rules during their schooling. The exercise value of taekwondo training is considered a necessity for US adolescents due to the corresponding educational aspects; in particular, the training plays a very important role in the maintenance of amenable student-teacher and student-peer relationships. From the previously mentioned findings, and if taekwondo teachers train their students carefully with educational missions in mind, it is expected that taekwondo training will play a very important role in the cultivation of anappropriate education value among US adolescents.

Physiological adaptations to interval training and the role of exercise intensity.

PubMed

MacInnis, Martin J; Gibala, Martin J

2017-05-01

Interval exercise typically involves repeated bouts of relatively intense exercise interspersed by short periods of recovery. A common classification scheme subdivides this method into high-intensity interval training (HIIT; 'near maximal' efforts) and sprint interval training (SIT; 'supramaximal' efforts). Both forms of interval training induce the classic physiological adaptations characteristic of moderate-intensity continuous training (MICT) such as increased aerobic capacity (V̇O2 max ) and mitochondrial content. This brief review considers the role of exercise intensity in mediating physiological adaptations to training, with a focus on the capacity for aerobic energy metabolism. With respect to skeletal muscle adaptations, cellular stress and the resultant metabolic signals for mitochondrial biogenesis depend largely on exercise intensity, with limited work suggesting that increases in mitochondrial content are superior after HIIT compared to MICT, at least when matched-work comparisons are made within the same individual. It is well established that SIT increases mitochondrial content to a similar extent to MICT despite a reduced exercise volume. At the whole-body level, V̇O2 max is generally increased more by HIIT than MICT for a given training volume, whereas SIT and MICT similarly improve V̇O2 max despite differences in training volume. There is less evidence available regarding the role of exercise intensity in mediating changes in skeletal muscle capillary density, maximum stroke volume and cardiac output, and blood volume. Furthermore, the interactions between intensity and duration and frequency have not been thoroughly explored. While interval training is clearly a potent stimulus for physiological remodelling in humans, the integrative response to this type of exercise warrants further attention, especially in comparison to traditional endurance training. © 2016 The Authors. The Journal of Physiology © 2016 The Physiological Society.

Recursive least-squares learning algorithms for neural networks

NASA Astrophysics Data System (ADS)

Lewis, Paul S.; Hwang, Jenq N.

1990-11-01

backpropagation algorithm. However in this paper we will use the term backpropagation to refer only to the process of computing error derivatives. While multilayer perceptrons provide a very powerful nonlinear modeling capability GDR training can be very slow and inefficient. In linear adaptive filtering the analog of the GDR algorithm is the leastmean- squares (LMS) algorithm. Steepest descent-based algorithms such as GDR or LMS are first order because they use only first derivative or gradient information about the training error to be minimized. To speed up the training process second order algorithms may be employed that take advantage of second derivative or Hessian matrix information. Second order information can be incorporated into MLP training in different ways. In many applications especially in the area of pattern recognition the training set is finite. In these cases block learning can be applied using standard nonlinear optimization techniques [3 4 5].

Adaptive training algorithm for robot-assisted upper-arm rehabilitation, applicable to individualised and therapeutic human-robot interaction.

PubMed

Chemuturi, Radhika; Amirabdollahian, Farshid; Dautenhahn, Kerstin

2013-09-28

Rehabilitation robotics is progressing towards developing robots that can be used as advanced tools to augment the role of a therapist. These robots are capable of not only offering more frequent and more accessible therapies but also providing new insights into treatment effectiveness based on their ability to measure interaction parameters. A requirement for having more advanced therapies is to identify how robots can 'adapt' to each individual's needs at different stages of recovery. Hence, our research focused on developing an adaptive interface for the GENTLE/A rehabilitation system. The interface was based on a lead-lag performance model utilising the interaction between the human and the robot. The goal of the present study was to test the adaptability of the GENTLE/A system to the performance of the user. Point-to-point movements were executed using the HapticMaster (HM) robotic arm, the main component of the GENTLE/A rehabilitation system. The points were displayed as balls on the screen and some of the points also had a real object, providing a test-bed for the human-robot interaction (HRI) experiment. The HM was operated in various modes to test the adaptability of the GENTLE/A system based on the leading/lagging performance of the user. Thirty-two healthy participants took part in the experiment comprising of a training phase followed by the actual-performance phase. The leading or lagging role of the participant could be used successfully to adjust the duration required by that participant to execute point-to-point movements, in various modes of robot operation and under various conditions. The adaptability of the GENTLE/A system was clearly evident from the durations recorded. The regression results showed that the participants required lower execution times with the help from a real object when compared to just a virtual object. The 'reaching away' movements were longer to execute when compared to the 'returning towards' movements irrespective of the

Development of an Integrated Team Training Design and Assessment Architecture to Support Adaptability in Healthcare Teams

DTIC Science & Technology

2016-10-01

and implementation of embedded, adaptive feedback and performance assessment. The investigators also initiated work designing a Bayesian Belief ...training; Teamwork; Adaptive performance; Leadership; Simulation; Modeling; Bayesian belief networks (BBN) 16. SECURITY CLASSIFICATION OF: 17. LIMITATION...Trauma teams Team training Teamwork Adaptability Adaptive performance Leadership Simulation Modeling Bayesian belief networks (BBN) 6

[Endurance training and cardial adaptation (athlete's heart)].

PubMed

Dickhuth, Hans-Hermann; Röcker, Kai; Mayer, Frank; König, Daniel; Korsten-Reck, Ulrike

2004-06-01

One essential function of the cardiovascular system is to provide an adequate blood supply to all organs, including the skeletal muscles at rest and during exercise. Adaptation to chronic exercise proceeds mainly via the autonomic nervous system. On the one hand, peripheral muscles influence the autonomic reactions through "feedback" control via ergoreceptors, in particular, mechano- and chemoreceptors. On the other hand, there is central control in the sense of a "feed forward" regulation, e. g., the reaction of an athlete before competition. Along with other influential factors, such as circulatory presso-, chemo-, and volume receptors, the incoming impulses are processed in vegetative centers.A cardiovascular reaction, then, is the result of nerval and humoral sympathetic and parasympathetic activity. At rest, the parasympathetic tone dominates. It reduces heart frequency and conduction velocity. The high vagal tone is initially reduced with increasing physical exertion and switches at higher intensity to increasingly sympathetic activation. This mechanism of reaction to exercise is supported by inverse central and peripheral transmissions.Chronic endurance training leads to an improved local aerobic capacity of the exercised musculature. At rest, it augments parasympathetic activity when the muscle mass is sufficiently large, i. e., 20-30% of the skeletal musculature. The extent of the adaptation depends on individual factors, such as scope, intensity of training, and type of muscle fiber. A higher vagal tone delays the increase in the sympathetic tone during physical exertion. The regulatory range of heart rate, contractility, diastolic function, and blood pressure is increased. In addition, adaptation results in functional and structural changes in the vascular system. Cardiocirculatory work is economized, and maximum performance and oxygen uptake are improved. Endurance training exceeding an individual limit causes harmonic enlargement and hypertrophy of the

EMD self-adaptive selecting relevant modes algorithm for FBG spectrum signal

NASA Astrophysics Data System (ADS)

Chen, Yong; Wu, Chun-ting; Liu, Huan-lin

2017-07-01

Noise may reduce the demodulation accuracy of fiber Bragg grating (FBG) sensing signal so as to affect the quality of sensing detection. Thus, the recovery of a signal from observed noisy data is necessary. In this paper, a precise self-adaptive algorithm of selecting relevant modes is proposed to remove the noise of signal. Empirical mode decomposition (EMD) is first used to decompose a signal into a set of modes. The pseudo modes cancellation is introduced to identify and eliminate false modes, and then the Mutual Information (MI) of partial modes is calculated. MI is used to estimate the critical point of high and low frequency components. Simulation results show that the proposed algorithm estimates the critical point more accurately than the traditional algorithms for FBG spectral signal. While, compared to the similar algorithms, the signal noise ratio of the signal can be improved more than 10 dB after processing by the proposed algorithm, and correlation coefficient can be increased by 0.5, so it demonstrates better de-noising effect.

Wavefront sensorless adaptive optics OCT with the DONE algorithm for in vivo human retinal imaging [Invited

PubMed Central

Verstraete, Hans R. G. W.; Heisler, Morgan; Ju, Myeong Jin; Wahl, Daniel; Bliek, Laurens; Kalkman, Jeroen; Bonora, Stefano; Jian, Yifan; Verhaegen, Michel; Sarunic, Marinko V.

2017-01-01

In this report, which is an international collaboration of OCT, adaptive optics, and control research, we demonstrate the Data-based Online Nonlinear Extremum-seeker (DONE) algorithm to guide the image based optimization for wavefront sensorless adaptive optics (WFSL-AO) OCT for in vivo human retinal imaging. The ocular aberrations were corrected using a multi-actuator adaptive lens after linearization of the hysteresis in the piezoelectric actuators. The DONE algorithm succeeded in drastically improving image quality and the OCT signal intensity, up to a factor seven, while achieving a computational time of 1 ms per iteration, making it applicable for many high speed applications. We demonstrate the correction of five aberrations using 70 iterations of the DONE algorithm performed over 2.8 s of continuous volumetric OCT acquisition. Data acquired from an imaging phantom and in vivo from human research volunteers are presented. PMID:28736670

Research on adaptive optics image restoration algorithm based on improved joint maximum a posteriori method

NASA Astrophysics Data System (ADS)

Zhang, Lijuan; Li, Yang; Wang, Junnan; Liu, Ying

2018-03-01

In this paper, we propose a point spread function (PSF) reconstruction method and joint maximum a posteriori (JMAP) estimation method for the adaptive optics image restoration. Using the JMAP method as the basic principle, we establish the joint log likelihood function of multi-frame adaptive optics (AO) images based on the image Gaussian noise models. To begin with, combining the observed conditions and AO system characteristics, a predicted PSF model for the wavefront phase effect is developed; then, we build up iterative solution formulas of the AO image based on our proposed algorithm, addressing the implementation process of multi-frame AO images joint deconvolution method. We conduct a series of experiments on simulated and real degraded AO images to evaluate our proposed algorithm. Compared with the Wiener iterative blind deconvolution (Wiener-IBD) algorithm and Richardson-Lucy IBD algorithm, our algorithm has better restoration effects including higher peak signal-to-noise ratio ( PSNR) and Laplacian sum ( LS) value than the others. The research results have a certain application values for actual AO image restoration.

Experimental Evaluation of a Braille-Reading-Inspired Finger Motion Adaptive Algorithm.

PubMed

Ulusoy, Melda; Sipahi, Rifat

2016-01-01

Braille reading is a complex process involving intricate finger-motion patterns and finger-rubbing actions across Braille letters for the stimulation of appropriate nerves. Although Braille reading is performed by smoothly moving the finger from left-to-right, research shows that even fluent reading requires right-to-left movements of the finger, known as "reversal". Reversals are crucial as they not only enhance stimulation of nerves for correctly reading the letters, but they also show one to re-read the letters that were missed in the first pass. Moreover, it is known that reversals can be performed as often as in every sentence and can start at any location in a sentence. Here, we report experimental results on the feasibility of an algorithm that can render a machine to automatically adapt to reversal gestures of one's finger. Through Braille-reading-analogous tasks, the algorithm is tested with thirty sighted subjects that volunteered in the study. We find that the finger motion adaptive algorithm (FMAA) is useful in achieving cooperation between human finger and the machine. In the presence of FMAA, subjects' performance metrics associated with the tasks have significantly improved as supported by statistical analysis. In light of these encouraging results, preliminary experiments are carried out with five blind subjects with the aim to put the algorithm to test. Results obtained from carefully designed experiments showed that subjects' Braille reading accuracy in the presence of FMAA was more favorable then when FMAA was turned off. Utilization of FMAA in future generation Braille reading devices thus holds strong promise.

Experimental Evaluation of a Braille-Reading-Inspired Finger Motion Adaptive Algorithm

PubMed Central

2016-01-01

Braille reading is a complex process involving intricate finger-motion patterns and finger-rubbing actions across Braille letters for the stimulation of appropriate nerves. Although Braille reading is performed by smoothly moving the finger from left-to-right, research shows that even fluent reading requires right-to-left movements of the finger, known as “reversal”. Reversals are crucial as they not only enhance stimulation of nerves for correctly reading the letters, but they also show one to re-read the letters that were missed in the first pass. Moreover, it is known that reversals can be performed as often as in every sentence and can start at any location in a sentence. Here, we report experimental results on the feasibility of an algorithm that can render a machine to automatically adapt to reversal gestures of one’s finger. Through Braille-reading-analogous tasks, the algorithm is tested with thirty sighted subjects that volunteered in the study. We find that the finger motion adaptive algorithm (FMAA) is useful in achieving cooperation between human finger and the machine. In the presence of FMAA, subjects’ performance metrics associated with the tasks have significantly improved as supported by statistical analysis. In light of these encouraging results, preliminary experiments are carried out with five blind subjects with the aim to put the algorithm to test. Results obtained from carefully designed experiments showed that subjects’ Braille reading accuracy in the presence of FMAA was more favorable then when FMAA was turned off. Utilization of FMAA in future generation Braille reading devices thus holds strong promise. PMID:26849058

A globally convergent MC algorithm with an adaptive learning rate.

PubMed

Peng, Dezhong; Yi, Zhang; Xiang, Yong; Zhang, Haixian

2012-02-01

This brief deals with the problem of minor component analysis (MCA). Artificial neural networks can be exploited to achieve the task of MCA. Recent research works show that convergence of neural networks based MCA algorithms can be guaranteed if the learning rates are less than certain thresholds. However, the computation of these thresholds needs information about the eigenvalues of the autocorrelation matrix of data set, which is unavailable in online extraction of minor component from input data stream. In this correspondence, we introduce an adaptive learning rate into the OJAn MCA algorithm, such that its convergence condition does not depend on any unobtainable information, and can be easily satisfied in practical applications.

Angular-contact ball-bearing internal load estimation algorithm using runtime adaptive relaxation

NASA Astrophysics Data System (ADS)

Medina, H.; Mutu, R.

2017-07-01

An algorithm to estimate internal loads for single-row angular contact ball bearings due to externally applied thrust loads and high-operating speeds is presented. A new runtime adaptive relaxation procedure and blending function is proposed which ensures algorithm stability whilst also reducing the number of iterations needed to reach convergence, leading to an average reduction in computation time in excess of approximately 80%. The model is validated based on a 218 angular contact bearing and shows excellent agreement compared to published results.

Reconstruction of sparse-view X-ray computed tomography using adaptive iterative algorithms.

PubMed

Liu, Li; Lin, Weikai; Jin, Mingwu

2015-01-01

In this paper, we propose two reconstruction algorithms for sparse-view X-ray computed tomography (CT). Treating the reconstruction problems as data fidelity constrained total variation (TV) minimization, both algorithms adapt the alternate two-stage strategy: projection onto convex sets (POCS) for data fidelity and non-negativity constraints and steepest descent for TV minimization. The novelty of this work is to determine iterative parameters automatically from data, thus avoiding tedious manual parameter tuning. In TV minimization, the step sizes of steepest descent are adaptively adjusted according to the difference from POCS update in either the projection domain or the image domain, while the step size of algebraic reconstruction technique (ART) in POCS is determined based on the data noise level. In addition, projection errors are used to compare with the error bound to decide whether to perform ART so as to reduce computational costs. The performance of the proposed methods is studied and evaluated using both simulated and physical phantom data. Our methods with automatic parameter tuning achieve similar, if not better, reconstruction performance compared to a representative two-stage algorithm. Copyright © 2014 Elsevier Ltd. All rights reserved.

Convergence analyses on on-line weight noise injection-based training algorithms for MLPs.

PubMed

Sum, John; Leung, Chi-Sing; Ho, Kevin

2012-11-01

Injecting weight noise during training is a simple technique that has been proposed for almost two decades. However, little is known about its convergence behavior. This paper studies the convergence of two weight noise injection-based training algorithms, multiplicative weight noise injection with weight decay and additive weight noise injection with weight decay. We consider that they are applied to multilayer perceptrons either with linear or sigmoid output nodes. Let w(t) be the weight vector, let V(w) be the corresponding objective function of the training algorithm, let α >; 0 be the weight decay constant, and let μ(t) be the step size. We show that if μ(t)→ 0, then with probability one E[||w(t)||2(2)] is bound and lim(t) → ∞ ||w(t)||2 exists. Based on these two properties, we show that if μ(t)→ 0, Σtμ(t)=∞, and Σtμ(t)(2) <; ∞, then with probability one these algorithms converge. Moreover, w(t) converges with probability one to a point where ∇wV(w)=0.

Should the parameters of a BCI translation algorithm be continually adapted?

PubMed

McFarland, Dennis J; Sarnacki, William A; Wolpaw, Jonathan R

2011-07-15

People with or without motor disabilities can learn to control sensorimotor rhythms (SMRs) recorded from the scalp to move a computer cursor in one or more dimensions or can use the P300 event-related potential as a control signal to make discrete selections. Data collected from individuals using an SMR-based or P300-based BCI were evaluated offline to estimate the impact on performance of continually adapting the parameters of the translation algorithm during BCI operation. The performance of the SMR-based BCI was enhanced by adaptive updating of the feature weights or adaptive normalization of the features. In contrast, P300 performance did not benefit from either of these procedures. Copyright © 2011 Elsevier B.V. All rights reserved.

A General, Adaptive, Roadmap-Based Algorithm for Protein Motion Computation.

PubMed

Molloy, Kevin; Shehu, Amarda

2016-03-01

Precious information on protein function can be extracted from a detailed characterization of protein equilibrium dynamics. This remains elusive in wet and dry laboratories, as function-modulating transitions of a protein between functionally-relevant, thermodynamically-stable and meta-stable structural states often span disparate time scales. In this paper we propose a novel, robotics-inspired algorithm that circumvents time-scale challenges by drawing analogies between protein motion and robot motion. The algorithm adapts the popular roadmap-based framework in robot motion computation to handle the more complex protein conformation space and its underlying rugged energy surface. Given known structures representing stable and meta-stable states of a protein, the algorithm yields a time- and energy-prioritized list of transition paths between the structures, with each path represented as a series of conformations. The algorithm balances computational resources between a global search aimed at obtaining a global view of the network of protein conformations and their connectivity and a detailed local search focused on realizing such connections with physically-realistic models. Promising results are presented on a variety of proteins that demonstrate the general utility of the algorithm and its capability to improve the state of the art without employing system-specific insight.

An improved cooperative adaptive cruise control (CACC) algorithm considering invalid communication

NASA Astrophysics Data System (ADS)

Wang, Pangwei; Wang, Yunpeng; Yu, Guizhen; Tang, Tieqiao

2014-05-01

For the Cooperative Adaptive Cruise Control (CACC) Algorithm, existing research studies mainly focus on how inter-vehicle communication can be used to develop CACC controller, the influence of the communication delays and lags of the actuators to the string stability. However, whether the string stability can be guaranteed when inter-vehicle communication is invalid partially has hardly been considered. This paper presents an improved CACC algorithm based on the sliding mode control theory and analyses the range of CACC controller parameters to maintain string stability. A dynamic model of vehicle spacing deviation in a platoon is then established, and the string stability conditions under improved CACC are analyzed. Unlike the traditional CACC algorithms, the proposed algorithm can ensure the functionality of the CACC system even if inter-vehicle communication is partially invalid. Finally, this paper establishes a platoon of five vehicles to simulate the improved CACC algorithm in MATLAB/Simulink, and the simulation results demonstrate that the improved CACC algorithm can maintain the string stability of a CACC platoon through adjusting the controller parameters and enlarging the spacing to prevent accidents. With guaranteed string stability, the proposed CACC algorithm can prevent oscillation of vehicle spacing and reduce chain collision accidents under real-world circumstances. This research proposes an improved CACC algorithm, which can guarantee the string stability when inter-vehicle communication is invalid.

Feasibility of the adaptive and automatic presentation of tasks (ADAPT) system for rehabilitation of upper extremity function post-stroke

PubMed Central

2011-01-01

Background Current guidelines for rehabilitation of arm and hand function after stroke recommend that motor training focus on realistic tasks that require reaching and manipulation and engage the patient intensively, actively, and adaptively. Here, we investigated the feasibility of a novel robotic task-practice system, ADAPT, designed in accordance with such guidelines. At each trial, ADAPT selects a functional task according to a training schedule and with difficulty based on previous performance. Once the task is selected, the robot picks up and presents the corresponding tool, simulates the dynamics of the tasks, and the patient interacts with the tool to perform the task. Methods Five participants with chronic stroke with mild to moderate impairments (> 9 months post-stroke; Fugl-Meyer arm score 49.2 ± 5.6) practiced four functional tasks (selected out of six in a pre-test) with ADAPT for about one and half hour and 144 trials in a pseudo-random schedule of 3-trial blocks per task. Results No adverse events occurred and ADAPT successfully presented the six functional tasks without human intervention for a total of 900 trials. Qualitative analysis of trajectories showed that ADAPT simulated the desired task dynamics adequately, and participants reported good, although not excellent, task fidelity. During training, the adaptive difficulty algorithm progressively increased task difficulty leading towards an optimal challenge point based on performance; difficulty was then continuously adjusted to keep performance around the challenge point. Furthermore, the time to complete all trained tasks decreased significantly from pretest to one-hour post-test. Finally, post-training questionnaires demonstrated positive patient acceptance of ADAPT. Conclusions ADAPT successfully provided adaptive progressive training for multiple functional tasks based on participant's performance. Our encouraging results establish the feasibility of ADAPT; its efficacy will next be tested

Feasibility of the adaptive and automatic presentation of tasks (ADAPT) system for rehabilitation of upper extremity function post-stroke.

PubMed

Choi, Younggeun; Gordon, James; Park, Hyeshin; Schweighofer, Nicolas

2011-08-03

Current guidelines for rehabilitation of arm and hand function after stroke recommend that motor training focus on realistic tasks that require reaching and manipulation and engage the patient intensively, actively, and adaptively. Here, we investigated the feasibility of a novel robotic task-practice system, ADAPT, designed in accordance with such guidelines. At each trial, ADAPT selects a functional task according to a training schedule and with difficulty based on previous performance. Once the task is selected, the robot picks up and presents the corresponding tool, simulates the dynamics of the tasks, and the patient interacts with the tool to perform the task. Five participants with chronic stroke with mild to moderate impairments (> 9 months post-stroke; Fugl-Meyer arm score 49.2 ± 5.6) practiced four functional tasks (selected out of six in a pre-test) with ADAPT for about one and half hour and 144 trials in a pseudo-random schedule of 3-trial blocks per task. No adverse events occurred and ADAPT successfully presented the six functional tasks without human intervention for a total of 900 trials. Qualitative analysis of trajectories showed that ADAPT simulated the desired task dynamics adequately, and participants reported good, although not excellent, task fidelity. During training, the adaptive difficulty algorithm progressively increased task difficulty leading towards an optimal challenge point based on performance; difficulty was then continuously adjusted to keep performance around the challenge point. Furthermore, the time to complete all trained tasks decreased significantly from pretest to one-hour post-test. Finally, post-training questionnaires demonstrated positive patient acceptance of ADAPT. ADAPT successfully provided adaptive progressive training for multiple functional tasks based on participant's performance. Our encouraging results establish the feasibility of ADAPT; its efficacy will next be tested in a clinical trial.

Object tracking with adaptive HOG detector and adaptive Rao-Blackwellised particle filter

NASA Astrophysics Data System (ADS)

Rosa, Stefano; Paleari, Marco; Ariano, Paolo; Bona, Basilio

2012-01-01

Scenarios for a manned mission to the Moon or Mars call for astronaut teams to be accompanied by semiautonomous robots. A prerequisite for human-robot interaction is the capability of successfully tracking humans and objects in the environment. In this paper we present a system for real-time visual object tracking in 2D images for mobile robotic systems. The proposed algorithm is able to specialize to individual objects and to adapt to substantial changes in illumination and object appearance during tracking. The algorithm is composed by two main blocks: a detector based on Histogram of Oriented Gradient (HOG) descriptors and linear Support Vector Machines (SVM), and a tracker which is implemented by an adaptive Rao-Blackwellised particle filter (RBPF). The SVM is re-trained online on new samples taken from previous predicted positions. We use the effective sample size to decide when the classifier needs to be re-trained. Position hypotheses for the tracked object are the result of a clustering procedure applied on the set of particles. The algorithm has been tested on challenging video sequences presenting strong changes in object appearance, illumination, and occlusion. Experimental tests show that the presented method is able to achieve near real-time performances with a precision of about 7 pixels on standard video sequences of dimensions 320 × 240.

An improved contrast enhancement algorithm for infrared images based on adaptive double plateaus histogram equalization

NASA Astrophysics Data System (ADS)

Li, Shuo; Jin, Weiqi; Li, Li; Li, Yiyang

2018-05-01

Infrared thermal images can reflect the thermal-radiation distribution of a particular scene. However, the contrast of the infrared images is usually low. Hence, it is generally necessary to enhance the contrast of infrared images in advance to facilitate subsequent recognition and analysis. Based on the adaptive double plateaus histogram equalization, this paper presents an improved contrast enhancement algorithm for infrared thermal images. In the proposed algorithm, the normalized coefficient of variation of the histogram, which characterizes the level of contrast enhancement, is introduced as feedback information to adjust the upper and lower plateau thresholds. The experiments on actual infrared images show that compared to the three typical contrast-enhancement algorithms, the proposed algorithm has better scene adaptability and yields better contrast-enhancement results for infrared images with more dark areas or a higher dynamic range. Hence, it has high application value in contrast enhancement, dynamic range compression, and digital detail enhancement for infrared thermal images.

Adaptive Cross-correlation Algorithm and Experiment of Extended Scene Shack-Hartmann Wavefront Sensing

NASA Technical Reports Server (NTRS)

Sidick, Erkin; Morgan, Rhonda M.; Green, Joseph J.; Ohara, Catherine M.; Redding, David C.

2007-01-01

We have developed a new, adaptive cross-correlation (ACC) algorithm to estimate with high accuracy the shift as large as several pixels in two extended-scene images captured by a Shack-Hartmann wavefront sensor (SH-WFS). It determines the positions of all of the extended-scene image cells relative to a reference cell using an FFT-based iterative image shifting algorithm. It works with both point-source spot images as well as extended scene images. We have also set up a testbed for extended0scene SH-WFS, and tested the ACC algorithm with the measured data of both point-source and extended-scene images. In this paper we describe our algorithm and present out experimental results.

An implicit adaptation algorithm for a linear model reference control system

NASA Technical Reports Server (NTRS)

Mabius, L.; Kaufman, H.

1975-01-01

This paper presents a stable implicit adaptation algorithm for model reference control. The constraints for stability are found using Lyapunov's second method and do not depend on perfect model following between the system and the reference model. Methods are proposed for satisfying these constraints without estimating the parameters on which the constraints depend.

Path Planning Algorithms for the Adaptive Sensor Fleet

NASA Technical Reports Server (NTRS)

Stoneking, Eric; Hosler, Jeff

2005-01-01

The Adaptive Sensor Fleet (ASF) is a general purpose fleet management and planning system being developed by NASA in coordination with NOAA. The current mission of ASF is to provide the capability for autonomous cooperative survey and sampling of dynamic oceanographic phenomena such as current systems and algae blooms. Each ASF vessel is a software model that represents a real world platform that carries a variety of sensors. The OASIS platform will provide the first physical vessel, outfitted with the systems and payloads necessary to execute the oceanographic observations described in this paper. The ASF architecture is being designed for extensibility to accommodate heterogenous fleet elements, and is not limited to using the OASIS platform to acquire data. This paper describes the path planning algorithms developed for the acquisition phase of a typical ASF task. Given a polygonal target region to be surveyed, the region is subdivided according to the number of vessels in the fleet. The subdivision algorithm seeks a solution in which all subregions have equal area and minimum mean radius. Once the subregions are defined, a dynamic programming method is used to find a minimum-time path for each vessel from its initial position to its assigned region. This path plan includes the effects of water currents as well as avoidance of known obstacles. A fleet-level planning algorithm then shuffles the individual vessel assignments to find the overall solution which puts all vessels in their assigned regions in the minimum time. This shuffle algorithm may be described as a process of elimination on the sorted list of permutations of a cost matrix. All these path planning algorithms are facilitated by discretizing the region of interest onto a hexagonal tiling.

Training Recurrent Neural Networks With the Levenberg-Marquardt Algorithm for Optimal Control of a Grid-Connected Converter.

PubMed

Fu, Xingang; Li, Shuhui; Fairbank, Michael; Wunsch, Donald C; Alonso, Eduardo

2015-09-01

This paper investigates how to train a recurrent neural network (RNN) using the Levenberg-Marquardt (LM) algorithm as well as how to implement optimal control of a grid-connected converter (GCC) using an RNN. To successfully and efficiently train an RNN using the LM algorithm, a new forward accumulation through time (FATT) algorithm is proposed to calculate the Jacobian matrix required by the LM algorithm. This paper explores how to incorporate FATT into the LM algorithm. The results show that the combination of the LM and FATT algorithms trains RNNs better than the conventional backpropagation through time algorithm. This paper presents an analytical study on the optimal control of GCCs, including theoretically ideal optimal and suboptimal controllers. To overcome the inapplicability of the optimal GCC controller under practical conditions, a new RNN controller with an improved input structure is proposed to approximate the ideal optimal controller. The performance of an ideal optimal controller and a well-trained RNN controller was compared in close to real-life power converter switching environments, demonstrating that the proposed RNN controller can achieve close to ideal optimal control performance even under low sampling rate conditions. The excellent performance of the proposed RNN controller under challenging and distorted system conditions further indicates the feasibility of using an RNN to approximate optimal control in practical applications.

Effects of systemic hypoxia on human muscular adaptations to resistance exercise training

PubMed Central

Kon, Michihiro; Ohiwa, Nao; Honda, Akiko; Matsubayashi, Takeo; Ikeda, Tatsuaki; Akimoto, Takayuki; Suzuki, Yasuhiro; Hirano, Yuichi; Russell, Aaron P.

2014-01-01

Abstract Hypoxia is an important modulator of endurance exercise‐induced oxidative adaptations in skeletal muscle. However, whether hypoxia affects resistance exercise‐induced muscle adaptations remains unknown. Here, we determined the effect of resistance exercise training under systemic hypoxia on muscular adaptations known to occur following both resistance and endurance exercise training, including muscle cross‐sectional area (CSA), one‐repetition maximum (1RM), muscular endurance, and makers of mitochondrial biogenesis and angiogenesis, such as peroxisome proliferator‐activated receptor‐γ coactivator‐1α (PGC‐1α), citrate synthase (CS) activity, nitric oxide synthase (NOS), vascular endothelial growth factor (VEGF), hypoxia‐inducible factor‐1 (HIF‐1), and capillary‐to‐fiber ratio. Sixteen healthy male subjects were randomly assigned to either a normoxic resistance training group (NRT, n =7) or a hypoxic (14.4% oxygen) resistance training group (HRT, n =9) and performed 8 weeks of resistance training. Blood and muscle biopsy samples were obtained before and after training. After training muscle CSA of the femoral region, 1RM for bench‐press and leg‐press, muscular endurance, and skeletal muscle VEGF protein levels significantly increased in both groups. The increase in muscular endurance was significantly higher in the HRT group. Plasma VEGF concentration and skeletal muscle capillary‐to‐fiber ratio were significantly higher in the HRT group than the NRT group following training. Our results suggest that, in addition to increases in muscle size and strength, HRT may also lead to increased muscular endurance and the promotion of angiogenesis in skeletal muscle. PMID:24907297

Self-guided strategy-adaption training for older adults: Transfer effects to everyday tasks.

PubMed

Bottiroli, Sara; Cavallini, Elena; Dunlosky, John; Vecchi, Tomaso; Hertzog, Christopher

2017-09-01

The goal of the present research was to examine the potential of a learner-oriented approach to improving older adults' performance in tasks that are similar to real-life situations that require strategic deployment of cognitive resources. A crucial element of this approach involves encouraging older adults to explicitly analyze tasks to consider how to adapt trained skills to a new task context. In an earlier study, a specialist-directed intervention produced training gains and transfer to some untrained memory tasks. In the present study, older adults received a manual instructing them about principles of task analysis, two memory strategies, and strategy adaptation. Self-guided strategy-adaption training involved practicing some memory tasks as well as instructions on how the trained skills could be applied to new tasks that were not practiced. The criterion tasks involved practice tasks, non-practiced tasks that were discussed in the manual, and transfer tasks that were never mentioned in the manual. Two of the tests were from the Everyday Cognition Battery (inductive reasoning and working memory). As compared to a waiting-list control group, older adults assigned to self-guided strategy-adaption training showed memory improvements on tasks that were practiced or discussed during training. Most important, the learner-oriented approach produced transfer to the everyday tasks. Our findings show the potential of instructing task appraisal processes as a basis for fostering transfer, including improving older adults' performance in simulated everyday tasks. Copyright © 2017 Elsevier B.V. All rights reserved.

Dynamic game balancing implementation using adaptive algorithm in mobile-based Safari Indonesia game

NASA Astrophysics Data System (ADS)

Yuniarti, Anny; Nata Wardanie, Novita; Kuswardayan, Imam

2018-03-01

In developing a game there is one method that should be applied to maintain the interest of players, namely dynamic game balancing. Dynamic game balancing is a process to match a player’s playing style with the behaviour, attributes, and game environment. This study applies dynamic game balancing using adaptive algorithm in scrolling shooter game type called Safari Indonesia which developed using Unity. The game of this type is portrayed by a fighter aircraft character trying to defend itself from insistent enemy attacks. This classic game is chosen to implement adaptive algorithms because it has quite complex attributes to be developed using dynamic game balancing. Tests conducted by distributing questionnaires to a number of players indicate that this method managed to reduce frustration and increase the pleasure factor in playing.

A parallel adaptive quantum genetic algorithm for the controllability of arbitrary networks.

PubMed

Li, Yuhong; Gong, Guanghong; Li, Ni

2018-01-01

In this paper, we propose a novel algorithm-parallel adaptive quantum genetic algorithm-which can rapidly determine the minimum control nodes of arbitrary networks with both control nodes and state nodes. The corresponding network can be fully controlled with the obtained control scheme. We transformed the network controllability issue into a combinational optimization problem based on the Popov-Belevitch-Hautus rank condition. A set of canonical networks and a list of real-world networks were experimented. Comparison results demonstrated that the algorithm was more ideal to optimize the controllability of networks, especially those larger-size networks. We demonstrated subsequently that there were links between the optimal control nodes and some network statistical characteristics. The proposed algorithm provides an effective approach to improve the controllability optimization of large networks or even extra-large networks with hundreds of thousands nodes.

The effects of adaptive working memory training and mindfulness meditation training on processing efficiency and worry in high worriers.

PubMed

Course-Choi, Jenna; Saville, Harry; Derakshan, Nazanin

2017-02-01

Worry is the principle characteristic of generalised anxiety disorder, and has been linked to deficient attentional control, a main function of working memory (WM). Adaptive WM training and mindfulness meditation practice (MMP) have both shown potential to increase attentional control. The present study hence investigates the individual and combined effects of MMP and a dual adaptive n-back task on a non-clinical, randomised sample of high worriers. 60 participants were tested before and after seven days of training. Assessment included self-report questionnaires, as well as performance tasks measuring attentional control and working memory capacity. Combined training resulted in continued reduction in worry in the week after training, highlighting the potential of utilising n-back training as an adjunct to established clinical treatment. Engagement with WM training correlated with immediate improvements in attentional control and resilience, with worry decreasing over time. Implications of these findings and suggestions for future research are discussed. Crown Copyright © 2016. Published by Elsevier Ltd. All rights reserved.

Adaptive Residual Interpolation for Color and Multispectral Image Demosaicking.

PubMed

Monno, Yusuke; Kiku, Daisuke; Tanaka, Masayuki; Okutomi, Masatoshi

2017-12-01

Color image demosaicking for the Bayer color filter array is an essential image processing operation for acquiring high-quality color images. Recently, residual interpolation (RI)-based algorithms have demonstrated superior demosaicking performance over conventional color difference interpolation-based algorithms. In this paper, we propose adaptive residual interpolation (ARI) that improves existing RI-based algorithms by adaptively combining two RI-based algorithms and selecting a suitable iteration number at each pixel. These are performed based on a unified criterion that evaluates the validity of an RI-based algorithm. Experimental comparisons using standard color image datasets demonstrate that ARI can improve existing RI-based algorithms by more than 0.6 dB in the color peak signal-to-noise ratio and can outperform state-of-the-art algorithms based on training images. We further extend ARI for a multispectral filter array, in which more than three spectral bands are arrayed, and demonstrate that ARI can achieve state-of-the-art performance also for the task of multispectral image demosaicking.

Acute and chronic neuromuscular adaptations to local vibration training.

PubMed

Souron, Robin; Besson, Thibault; Millet, Guillaume Y; Lapole, Thomas

2017-10-01

Vibratory stimuli are thought to have the potential to promote neural and/or muscular (re)conditioning. This has been well described for whole-body vibration (WBV), which is commonly used as a training method to improve strength and/or functional abilities. Yet, this technique may present some limitations, especially in clinical settings where patients are unable to maintain an active position during the vibration exposure. Thus, a local vibration (LV) technique, which consists of applying portable vibrators directly over the tendon or muscle belly without active contribution from the participant, may present an alternative to WBV. The purpose of this narrative review is (1) to provide a comprehensive overview of the literature related to the acute and chronic neuromuscular changes associated with LV, and (2) to show that LV training may be an innovative and efficient alternative method to the 'classic' training programs, including in the context of muscle deconditioning prevention or rehabilitation. An acute LV application (one bout of 20-60 min) may be considered as a significant neuromuscular workload, as demonstrated by an impairment of force generating capacity and LV-induced neural changes. Accordingly, it has been reported that a training period of LV is efficient in improving muscular performance over a wide range of training (duration, number of session) and vibration (frequency, amplitude, site of application) parameters. The functional improvements are principally triggered by adaptations within the central nervous system. A model illustrating the current research on LV-induced adaptations is provided.

A Controlled Study of the Effectiveness of an Adaptive Closed-Loop Algorithm to Minimize Corticosteroid-Induced Stress Hyperglycemia in Type 1 Diabetes

PubMed Central

Youssef, Joseph El; Castle, Jessica R; Branigan, Deborah L; Massoud, Ryan G; Breen, Matthew E; Jacobs, Peter G; Bequette, B Wayne; Ward, W Kenneth

2011-01-01

To be effective in type 1 diabetes, algorithms must be able to limit hyperglycemic excursions resulting from medical and emotional stress. We tested an algorithm that estimates insulin sensitivity at regular intervals and continually adjusts gain factors of a fading memory proportional-derivative (FMPD) algorithm. In order to assess whether the algorithm could appropriately adapt and limit the degree of hyperglycemia, we administered oral hydrocortisone repeatedly to create insulin resistance. We compared this indirect adaptive proportional-derivative (APD) algorithm to the FMPD algorithm, which used fixed gain parameters. Each subject with type 1 diabetes (n = 14) was studied on two occasions, each for 33 h. The APD algorithm consistently identified a fall in insulin sensitivity after hydrocortisone. The gain factors and insulin infusion rates were appropriately increased, leading to satisfactory glycemic control after adaptation (premeal glucose on day 2, 148 ± 6 mg/dl). After sufficient time was allowed for adaptation, the late postprandial glucose increment was significantly lower than when measured shortly after the onset of the steroid effect. In addition, during the controlled comparison, glycemia was significantly lower with the APD algorithm than with the FMPD algorithm. No increase in hypoglycemic frequency was found in the APD-only arm. An afferent system of duplicate amperometric sensors demonstrated a high degree of accuracy; the mean absolute relative difference of the sensor used to control the algorithm was 9.6 ± 0.5%. We conclude that an adaptive algorithm that frequently estimates insulin sensitivity and adjusts gain factors is capable of minimizing corticosteroid-induced stress hyperglycemia. PMID:22226248

An Adaptive Image Enhancement Technique by Combining Cuckoo Search and Particle Swarm Optimization Algorithm

PubMed Central

Ye, Zhiwei; Wang, Mingwei; Hu, Zhengbing; Liu, Wei

2015-01-01

Image enhancement is an important procedure of image processing and analysis. This paper presents a new technique using a modified measure and blending of cuckoo search and particle swarm optimization (CS-PSO) for low contrast images to enhance image adaptively. In this way, contrast enhancement is obtained by global transformation of the input intensities; it employs incomplete Beta function as the transformation function and a novel criterion for measuring image quality considering three factors which are threshold, entropy value, and gray-level probability density of the image. The enhancement process is a nonlinear optimization problem with several constraints. CS-PSO is utilized to maximize the objective fitness criterion in order to enhance the contrast and detail in an image by adapting the parameters of a novel extension to a local enhancement technique. The performance of the proposed method has been compared with other existing techniques such as linear contrast stretching, histogram equalization, and evolutionary computing based image enhancement methods like backtracking search algorithm, differential search algorithm, genetic algorithm, and particle swarm optimization in terms of processing time and image quality. Experimental results demonstrate that the proposed method is robust and adaptive and exhibits the better performance than other methods involved in the paper. PMID:25784928

An adaptive image enhancement technique by combining cuckoo search and particle swarm optimization algorithm.

PubMed

Ye, Zhiwei; Wang, Mingwei; Hu, Zhengbing; Liu, Wei

2015-01-01

Image enhancement is an important procedure of image processing and analysis. This paper presents a new technique using a modified measure and blending of cuckoo search and particle swarm optimization (CS-PSO) for low contrast images to enhance image adaptively. In this way, contrast enhancement is obtained by global transformation of the input intensities; it employs incomplete Beta function as the transformation function and a novel criterion for measuring image quality considering three factors which are threshold, entropy value, and gray-level probability density of the image. The enhancement process is a nonlinear optimization problem with several constraints. CS-PSO is utilized to maximize the objective fitness criterion in order to enhance the contrast and detail in an image by adapting the parameters of a novel extension to a local enhancement technique. The performance of the proposed method has been compared with other existing techniques such as linear contrast stretching, histogram equalization, and evolutionary computing based image enhancement methods like backtracking search algorithm, differential search algorithm, genetic algorithm, and particle swarm optimization in terms of processing time and image quality. Experimental results demonstrate that the proposed method is robust and adaptive and exhibits the better performance than other methods involved in the paper.

Sensemaking Training Requirements for the Adaptive Battlestaff

DTIC Science & Technology

2007-06-01

for the Adaptive Battlestaff Topic: Cognitive and Social Issues Celestine A. Ntuen1& Dennis Leedom2 1Army Center for Human-Centric Command...intelligent analysts. We need a new training strategy, paradigms, and methods for this purpose. The sensemaking trainability factors o must be identified...juxtapositions of social forces—a complex of network of information systems with people, technology, and domains of adversaries (tasks) that have been

An Energy Efficient Adaptive Sampling Algorithm in a Sensor Network for Automated Water Quality Monitoring.

PubMed

Shu, Tongxin; Xia, Min; Chen, Jiahong; Silva, Clarence de

2017-11-05

Power management is crucial in the monitoring of a remote environment, especially when long-term monitoring is needed. Renewable energy sources such as solar and wind may be harvested to sustain a monitoring system. However, without proper power management, equipment within the monitoring system may become nonfunctional and, as a consequence, the data or events captured during the monitoring process will become inaccurate as well. This paper develops and applies a novel adaptive sampling algorithm for power management in the automated monitoring of the quality of water in an extensive and remote aquatic environment. Based on the data collected on line using sensor nodes, a data-driven adaptive sampling algorithm (DDASA) is developed for improving the power efficiency while ensuring the accuracy of sampled data. The developed algorithm is evaluated using two distinct key parameters, which are dissolved oxygen (DO) and turbidity. It is found that by dynamically changing the sampling frequency, the battery lifetime can be effectively prolonged while maintaining a required level of sampling accuracy. According to the simulation results, compared to a fixed sampling rate, approximately 30.66% of the battery energy can be saved for three months of continuous water quality monitoring. Using the same dataset to compare with a traditional adaptive sampling algorithm (ASA), while achieving around the same Normalized Mean Error (NME), DDASA is superior in saving 5.31% more battery energy.

An Energy Efficient Adaptive Sampling Algorithm in a Sensor Network for Automated Water Quality Monitoring

PubMed Central

Shu, Tongxin; Xia, Min; Chen, Jiahong; de Silva, Clarence

2017-01-01

Power management is crucial in the monitoring of a remote environment, especially when long-term monitoring is needed. Renewable energy sources such as solar and wind may be harvested to sustain a monitoring system. However, without proper power management, equipment within the monitoring system may become nonfunctional and, as a consequence, the data or events captured during the monitoring process will become inaccurate as well. This paper develops and applies a novel adaptive sampling algorithm for power management in the automated monitoring of the quality of water in an extensive and remote aquatic environment. Based on the data collected on line using sensor nodes, a data-driven adaptive sampling algorithm (DDASA) is developed for improving the power efficiency while ensuring the accuracy of sampled data. The developed algorithm is evaluated using two distinct key parameters, which are dissolved oxygen (DO) and turbidity. It is found that by dynamically changing the sampling frequency, the battery lifetime can be effectively prolonged while maintaining a required level of sampling accuracy. According to the simulation results, compared to a fixed sampling rate, approximately 30.66% of the battery energy can be saved for three months of continuous water quality monitoring. Using the same dataset to compare with a traditional adaptive sampling algorithm (ASA), while achieving around the same Normalized Mean Error (NME), DDASA is superior in saving 5.31% more battery energy. PMID:29113087

Adaptations in athletic performance after ballistic power versus strength training.

PubMed

Cormie, Prue; McGuigan, Michael R; Newton, Robert U

2010-08-01

To determine whether the magnitude of improvement in athletic performance and the mechanisms driving these adaptations differ in relatively weak individuals exposed to either ballistic power training or heavy strength training. Relatively weak men (n = 24) who could perform the back squat with proficient technique were randomized into three groups: strength training (n = 8; ST), power training (n = 8; PT), or control (n = 8). Training involved three sessions per week for 10 wk in which subjects performed back squats with 75%-90% of one-repetition maximum (1RM; ST) or maximal-effort jump squats with 0%-30% 1RM (PT). Jump and sprint performances were assessed as well as measures of the force-velocity relationship, jumping mechanics, muscle architecture, and neural drive. Both experimental groups showed significant (P < or = 0.05) improvements in jump and sprint performances after training with no significant between-group differences evident in either jump (peak power: ST = 17.7% +/- 9.3%, PT = 17.6% +/- 4.5%) or sprint performance (40-m sprint: ST = 2.2% +/- 1.9%, PT = 3.6% +/- 2.3%). ST also displayed a significant increase in maximal strength that was significantly greater than the PT group (squat 1RM: ST = 31.2% +/- 11.3%, PT = 4.5% +/- 7.1%). The mechanisms driving these improvements included significant (P < or = 0.05) changes in the force-velocity relationship, jump mechanics, muscle architecture, and neural activation that showed a degree of specificity to the different training stimuli. Improvements in athletic performance were similar in relatively weak individuals exposed to either ballistic power training or heavy strength training for 10 wk. These performance improvements were mediated through neuromuscular adaptations specific to the training stimulus. The ability of strength training to render similar short-term improvements in athletic performance as ballistic power training, coupled with the potential long-term benefits of improved maximal strength

An Adaptive Cross-Correlation Algorithm for Extended-Scene Shack-Hartmann Wavefront Sensing

NASA Technical Reports Server (NTRS)

Sidick, Erkin; Green, Joseph J.; Ohara, Catherine M.; Redding, David C.

2007-01-01

This viewgraph presentation reviews the Adaptive Cross-Correlation (ACC) Algorithm for extended scene-Shack Hartmann wavefront (WF) sensing. A Shack-Hartmann sensor places a lenslet array at a plane conjugate to the WF error source. Each sub-aperture lenslet samples the WF in the corresponding patch of the WF. A description of the ACC algorithm is included. The ACC has several benefits; amongst them are: ACC requires only about 4 image-shifting iterations to achieve 0.01 pixel accuracy and ACC is insensitive to both background light and noise much more robust than centroiding,

Wireless rake-receiver using adaptive filter with a family of partial update algorithms in noise cancellation applications

NASA Astrophysics Data System (ADS)

Fayadh, Rashid A.; Malek, F.; Fadhil, Hilal A.; Aldhaibani, Jaafar A.; Salman, M. K.; Abdullah, Farah Salwani

2015-05-01

For high data rate propagation in wireless ultra-wideband (UWB) communication systems, the inter-symbol interference (ISI), multiple-access interference (MAI), and multiple-users interference (MUI) are influencing the performance of the wireless systems. In this paper, the rake-receiver was presented with the spread signal by direct sequence spread spectrum (DS-SS) technique. The adaptive rake-receiver structure was shown with adjusting the receiver tap weights using least mean squares (LMS), normalized least mean squares (NLMS), and affine projection algorithms (APA) to support the weak signals by noise cancellation and mitigate the interferences. To minimize the data convergence speed and to reduce the computational complexity by the previous algorithms, a well-known approach of partial-updates (PU) adaptive filters were employed with algorithms, such as sequential-partial, periodic-partial, M-max-partial, and selective-partial updates (SPU) in the proposed system. The simulation results of bit error rate (BER) versus signal-to-noise ratio (SNR) are illustrated to show the performance of partial-update algorithms that have nearly comparable performance with the full update adaptive filters. Furthermore, the SPU-partial has closed performance to the full-NLMS and full-APA while the M-max-partial has closed performance to the full-LMS updates algorithms.

Neuromuscular adaptations to training, injury and passive interventions: implications for running economy.

PubMed

Bonacci, Jason; Chapman, Andrew; Blanch, Peter; Vicenzino, Bill

2009-01-01

Performance in endurance sports such as running, cycling and triathlon has long been investigated from a physiological perspective. A strong relationship between running economy and distance running performance is well established in the literature. From this established base, improvements in running economy have traditionally been achieved through endurance training. More recently, research has demonstrated short-term resistance and plyometric training has resulted in enhanced running economy. This improvement in running economy has been hypothesized to be a result of enhanced neuromuscular characteristics such as improved muscle power development and more efficient use of stored elastic energy during running. Changes in indirect measures of neuromuscular control (i.e. stance phase contact times, maximal forward jumps) have been used to support this hypothesis. These results suggest that neuromuscular adaptations in response to training (i.e. neuromuscular learning effects) are an important contributor to enhancements in running economy. However, there is no direct evidence to suggest that these adaptations translate into more efficient muscle recruitment patterns during running. Optimization of training and run performance may be facilitated through direct investigation of muscle recruitment patterns before and after training interventions. There is emerging evidence that demonstrates neuromuscular adaptations during running and cycling vary with training status. Highly trained runners and cyclists display more refined patterns of muscle recruitment than their novice counterparts. In contrast, interference with motor learning and neuromuscular adaptation may occur as a result of ongoing multidiscipline training (e.g. triathlon). In the sport of triathlon, impairments in running economy are frequently observed after cycling. This impairment is related mainly to physiological stress, but an alteration in lower limb muscle coordination during running after cycling

[Application of an Adaptive Inertia Weight Particle Swarm Algorithm in the Magnetic Resonance Bias Field Correction].

PubMed

Wang, Chang; Qin, Xin; Liu, Yan; Zhang, Wenchao

2016-06-01

An adaptive inertia weight particle swarm algorithm is proposed in this study to solve the local optimal problem with the method of traditional particle swarm optimization in the process of estimating magnetic resonance(MR)image bias field.An indicator measuring the degree of premature convergence was designed for the defect of traditional particle swarm optimization algorithm.The inertia weight was adjusted adaptively based on this indicator to ensure particle swarm to be optimized globally and to avoid it from falling into local optimum.The Legendre polynomial was used to fit bias field,the polynomial parameters were optimized globally,and finally the bias field was estimated and corrected.Compared to those with the improved entropy minimum algorithm,the entropy of corrected image was smaller and the estimated bias field was more accurate in this study.Then the corrected image was segmented and the segmentation accuracy obtained in this research was 10% higher than that with improved entropy minimum algorithm.This algorithm can be applied to the correction of MR image bias field.

STAR adaptation of QR algorithm. [program for solving over-determined systems of linear equations

NASA Technical Reports Server (NTRS)

Shah, S. N.

1981-01-01

The QR algorithm used on a serial computer and executed on the Control Data Corporation 6000 Computer was adapted to execute efficiently on the Control Data STAR-100 computer. How the scalar program was adapted for the STAR-100 and why these adaptations yielded an efficient STAR program is described. Program listings of the old scalar version and the vectorized SL/1 version are presented in the appendices. Execution times for the two versions applied to the same system of linear equations, are compared.

Fully implicit adaptive mesh refinement algorithm for reduced MHD

NASA Astrophysics Data System (ADS)

Philip, Bobby; Pernice, Michael; Chacon, Luis

2006-10-01

In the macroscopic simulation of plasmas, the numerical modeler is faced with the challenge of dealing with multiple time and length scales. Traditional approaches based on explicit time integration techniques and fixed meshes are not suitable for this challenge, as such approaches prevent the modeler from using realistic plasma parameters to keep the computation feasible. We propose here a novel approach, based on implicit methods and structured adaptive mesh refinement (SAMR). Our emphasis is on both accuracy and scalability with the number of degrees of freedom. As a proof-of-principle, we focus on the reduced resistive MHD model as a basic MHD model paradigm, which is truly multiscale. The approach taken here is to adapt mature physics-based technology to AMR grids, and employ AMR-aware multilevel techniques (such as fast adaptive composite grid --FAC-- algorithms) for scalability. We demonstrate that the concept is indeed feasible, featuring near-optimal scalability under grid refinement. Results of fully-implicit, dynamically-adaptive AMR simulations in challenging dissipation regimes will be presented on a variety of problems that benefit from this capability, including tearing modes, the island coalescence instability, and the tilt mode instability. L. Chac'on et al., J. Comput. Phys. 178 (1), 15- 36 (2002) B. Philip, M. Pernice, and L. Chac'on, Lecture Notes in Computational Science and Engineering, accepted (2006)

ADART: an adaptive algebraic reconstruction algorithm for discrete tomography.

PubMed

Maestre-Deusto, F Javier; Scavello, Giovanni; Pizarro, Joaquín; Galindo, Pedro L

2011-08-01

In this paper we suggest an algorithm based on the Discrete Algebraic Reconstruction Technique (DART) which is capable of computing high quality reconstructions from substantially fewer projections than required for conventional continuous tomography. Adaptive DART (ADART) goes a step further than DART on the reduction of the number of unknowns of the associated linear system achieving a significant reduction in the pixel error rate of reconstructed objects. The proposed methodology automatically adapts the border definition criterion at each iteration, resulting in a reduction of the number of pixels belonging to the border, and consequently of the number of unknowns in the general algebraic reconstruction linear system to be solved, being this reduction specially important at the final stage of the iterative process. Experimental results show that reconstruction errors are considerably reduced using ADART when compared to original DART, both in clean and noisy environments.

Processing of fetal heart rate through non-invasive adaptive system based on recursive least squares algorithm

NASA Astrophysics Data System (ADS)

Fajkus, Marcel; Nedoma, Jan; Martinek, Radek; Vasinek, Vladimir

2017-10-01

In this article, we describe an innovative non-invasive method of Fetal Phonocardiography (fPCG) using fiber-optic sensors and adaptive algorithm for the measurement of fetal heart rate (fHR). Conventional PCG is based on a noninvasive scanning of acoustic signals by means of a microphone placed on the thorax. As for fPCG, the microphone is placed on the maternal abdomen. Our solution is based on patent pending non-invasive scanning of acoustic signals by means of a fiber-optic interferometer. Fiber-optic sensors are resistant to technical artifacts such as electromagnetic interferences (EMI), thus they can be used in situations where it is impossible to use conventional EFM methods, e.g. during Magnetic Resonance Imaging (MRI) examination or in case of delivery in water. The adaptive evaluation system is based on Recursive least squares (RLS) algorithm. Based on real measurements provided on five volunteers with their written consent, we created a simplified dynamic signal model of a distribution of heartbeat sounds (HS) through the human body. Our created model allows us to verification of the proposed adaptive system RLS algorithm. The functionality of the proposed non-invasive adaptive system was verified by objective parameters such as Sensitivity (S+) and Signal to Noise Ratio (SNR).

An improved self-adaptive ant colony algorithm based on genetic strategy for the traveling salesman problem

NASA Astrophysics Data System (ADS)

Wang, Pan; Zhang, Yi; Yan, Dong

2018-05-01

Ant Colony Algorithm (ACA) is a powerful and effective algorithm for solving the combination optimization problem. Moreover, it was successfully used in traveling salesman problem (TSP). But it is easy to prematurely converge to the non-global optimal solution and the calculation time is too long. To overcome those shortcomings, a new method is presented-An improved self-adaptive Ant Colony Algorithm based on genetic strategy. The proposed method adopts adaptive strategy to adjust the parameters dynamically. And new crossover operation and inversion operation in genetic strategy was used in this method. We also make an experiment using the well-known data in TSPLIB. The experiment results show that the performance of the proposed method is better than the basic Ant Colony Algorithm and some improved ACA in both the result and the convergence time. The numerical results obtained also show that the proposed optimization method can achieve results close to the theoretical best known solutions at present.

A decentralized training algorithm for Echo State Networks in distributed big data applications.

PubMed

Scardapane, Simone; Wang, Dianhui; Panella, Massimo

2016-06-01

The current big data deluge requires innovative solutions for performing efficient inference on large, heterogeneous amounts of information. Apart from the known challenges deriving from high volume and velocity, real-world big data applications may impose additional technological constraints, including the need for a fully decentralized training architecture. While several alternatives exist for training feed-forward neural networks in such a distributed setting, less attention has been devoted to the case of decentralized training of recurrent neural networks (RNNs). In this paper, we propose such an algorithm for a class of RNNs known as Echo State Networks. The algorithm is based on the well-known Alternating Direction Method of Multipliers optimization procedure. It is formulated only in terms of local exchanges between neighboring agents, without reliance on a coordinating node. Additionally, it does not require the communication of training patterns, which is a crucial component in realistic big data implementations. Experimental results on large scale artificial datasets show that it compares favorably with a fully centralized implementation, in terms of speed, efficiency and generalization accuracy. Copyright © 2015 Elsevier Ltd. All rights reserved.

On an adaptive preconditioned Crank-Nicolson MCMC algorithm for infinite dimensional Bayesian inference

NASA Astrophysics Data System (ADS)

Hu, Zixi; Yao, Zhewei; Li, Jinglai

2017-03-01

Many scientific and engineering problems require to perform Bayesian inference for unknowns of infinite dimension. In such problems, many standard Markov Chain Monte Carlo (MCMC) algorithms become arbitrary slow under the mesh refinement, which is referred to as being dimension dependent. To this end, a family of dimensional independent MCMC algorithms, known as the preconditioned Crank-Nicolson (pCN) methods, were proposed to sample the infinite dimensional parameters. In this work we develop an adaptive version of the pCN algorithm, where the covariance operator of the proposal distribution is adjusted based on sampling history to improve the simulation efficiency. We show that the proposed algorithm satisfies an important ergodicity condition under some mild assumptions. Finally we provide numerical examples to demonstrate the performance of the proposed method.

A comparison of two adaptive algorithms for the control of active engine mounts

NASA Astrophysics Data System (ADS)

Hillis, A. J.; Harrison, A. J. L.; Stoten, D. P.

2005-08-01

This paper describes work conducted in order to control automotive active engine mounts, consisting of a conventional passive mount and an internal electromagnetic actuator. Active engine mounts seek to cancel the oscillatory forces generated by the rotation of out-of-balance masses within the engine. The actuator generates a force dependent on a control signal from an algorithm implemented with a real-time DSP. The filtered-x least-mean-square (FXLMS) adaptive filter is used as a benchmark for comparison with a new implementation of the error-driven minimal controller synthesis (Er-MCSI) adaptive controller. Both algorithms are applied to an active mount fitted to a saloon car equipped with a four-cylinder turbo-diesel engine, and have no a priori knowledge of the system dynamics. The steady-state and transient performance of the two algorithms are compared and the relative merits of the two approaches are discussed. The Er-MCSI strategy offers significant computational advantages as it requires no cancellation path modelling. The Er-MCSI controller is found to perform in a fashion similar to the FXLMS filter—typically reducing chassis vibration by 50-90% under normal driving conditions.

Learning algorithms for human-machine interfaces.

PubMed

Danziger, Zachary; Fishbach, Alon; Mussa-Ivaldi, Ferdinando A

2009-05-01

The goal of this study is to create and examine machine learning algorithms that adapt in a controlled and cadenced way to foster a harmonious learning environment between the user and the controlled device. To evaluate these algorithms, we have developed a simple experimental framework. Subjects wear an instrumented data glove that records finger motions. The high-dimensional glove signals remotely control the joint angles of a simulated planar two-link arm on a computer screen, which is used to acquire targets. A machine learning algorithm was applied to adaptively change the transformation between finger motion and the simulated robot arm. This algorithm was either LMS gradient descent or the Moore-Penrose (MP) pseudoinverse transformation. Both algorithms modified the glove-to-joint angle map so as to reduce the endpoint errors measured in past performance. The MP group performed worse than the control group (subjects not exposed to any machine learning), while the LMS group outperformed the control subjects. However, the LMS subjects failed to achieve better generalization than the control subjects, and after extensive training converged to the same level of performance as the control subjects. These results highlight the limitations of coadaptive learning using only endpoint error reduction.

Learning Algorithms for Human–Machine Interfaces

PubMed Central

Fishbach, Alon; Mussa-Ivaldi, Ferdinando A.

2012-01-01

The goal of this study is to create and examine machine learning algorithms that adapt in a controlled and cadenced way to foster a harmonious learning environment between the user and the controlled device. To evaluate these algorithms, we have developed a simple experimental framework. Subjects wear an instrumented data glove that records finger motions. The high-dimensional glove signals remotely control the joint angles of a simulated planar two-link arm on a computer screen, which is used to acquire targets. A machine learning algorithm was applied to adaptively change the transformation between finger motion and the simulated robot arm. This algorithm was either LMS gradient descent or the Moore–Penrose (MP) pseudoinverse transformation. Both algorithms modified the glove-to-joint angle map so as to reduce the endpoint errors measured in past performance. The MP group performed worse than the control group (subjects not exposed to any machine learning), while the LMS group outperformed the control subjects. However, the LMS subjects failed to achieve better generalization than the control subjects, and after extensive training converged to the same level of performance as the control subjects. These results highlight the limitations of coadaptive learning using only endpoint error reduction. PMID:19203886

An SDR-Based Real-Time Testbed for GNSS Adaptive Array Anti-Jamming Algorithms Accelerated by GPU.

PubMed

Xu, Hailong; Cui, Xiaowei; Lu, Mingquan

2016-03-11

Nowadays, software-defined radio (SDR) has become a common approach to evaluate new algorithms. However, in the field of Global Navigation Satellite System (GNSS) adaptive array anti-jamming, previous work has been limited due to the high computational power demanded by adaptive algorithms, and often lack flexibility and configurability. In this paper, the design and implementation of an SDR-based real-time testbed for GNSS adaptive array anti-jamming accelerated by a Graphics Processing Unit (GPU) are documented. This testbed highlights itself as a feature-rich and extendible platform with great flexibility and configurability, as well as high computational performance. Both Space-Time Adaptive Processing (STAP) and Space-Frequency Adaptive Processing (SFAP) are implemented with a wide range of parameters. Raw data from as many as eight antenna elements can be processed in real-time in either an adaptive nulling or beamforming mode. To fully take advantage of the parallelism resource provided by the GPU, a batched method in programming is proposed. Tests and experiments are conducted to evaluate both the computational and anti-jamming performance. This platform can be used for research and prototyping, as well as a real product in certain applications.

An SDR-Based Real-Time Testbed for GNSS Adaptive Array Anti-Jamming Algorithms Accelerated by GPU

PubMed Central

Xu, Hailong; Cui, Xiaowei; Lu, Mingquan

2016-01-01

Nowadays, software-defined radio (SDR) has become a common approach to evaluate new algorithms. However, in the field of Global Navigation Satellite System (GNSS) adaptive array anti-jamming, previous work has been limited due to the high computational power demanded by adaptive algorithms, and often lack flexibility and configurability. In this paper, the design and implementation of an SDR-based real-time testbed for GNSS adaptive array anti-jamming accelerated by a Graphics Processing Unit (GPU) are documented. This testbed highlights itself as a feature-rich and extendible platform with great flexibility and configurability, as well as high computational performance. Both Space-Time Adaptive Processing (STAP) and Space-Frequency Adaptive Processing (SFAP) are implemented with a wide range of parameters. Raw data from as many as eight antenna elements can be processed in real-time in either an adaptive nulling or beamforming mode. To fully take advantage of the parallelism resource provided by the GPU, a batched method in programming is proposed. Tests and experiments are conducted to evaluate both the computational and anti-jamming performance. This platform can be used for research and prototyping, as well as a real product in certain applications. PMID:26978363

Performance Evaluation of Multichannel Adaptive Algorithms for Local Active Noise Control

NASA Astrophysics Data System (ADS)

DE DIEGO, M.; GONZALEZ, A.

2001-07-01

This paper deals with the development of a multichannel active noise control (ANC) system inside an enclosed space. The purpose is to design a real practical system which works well in local ANC applications. Moreover, the algorithm implemented in the adaptive controller should be robust, of low computational complexity and it should manage to generate a uniform useful-size zone of quite in order to allow the head motion of a person seated on a seat inside a car. Experiments were carried out under semi-anechoic and listening room conditions to verify the successful implementation of the multichannel system. The developed prototype consists of an array of up to four microphones used as error sensors mounted on the headrest of a seat place inside the enclosure. One loudspeaker was used as single primary source and two secondary sources were placed facing the seat. The aim of this multichannel system is to reduce the sound pressure levels in an area around the error sensors, following a local control strategy. When using this technique, the cancellation points are not only the error sensor positions but an area around them, which is measured by using a monitoring microphone. Different multichannel adaptive algorithms for ANC have been analyzed and their performance verified. Multiple error algorithms are used in order to cancel out different types of primary noise (engine noise and random noise) with several configurations (up to four channels system). As an alternative to the multiple error LMS algorithm (multichannel version of the filtered-X LMS algorithm, MELMS), the least maximum mean squares (LMMS) and the scanning error-LMS algorithm have been developed in this work in order to reduce computational complexity and achieve a more uniform residual field. The ANC algorithms were programmed on a digital signal processing board equipped with a TMS320C40 floating point DSP processor. Measurements concerning real-time experiments on local noise reduction in two

Novel Near-Lossless Compression Algorithm for Medical Sequence Images with Adaptive Block-Based Spatial Prediction.

PubMed

Song, Xiaoying; Huang, Qijun; Chang, Sheng; He, Jin; Wang, Hao

2016-12-01

To address the low compression efficiency of lossless compression and the low image quality of general near-lossless compression, a novel near-lossless compression algorithm based on adaptive spatial prediction is proposed for medical sequence images for possible diagnostic use in this paper. The proposed method employs adaptive block size-based spatial prediction to predict blocks directly in the spatial domain and Lossless Hadamard Transform before quantization to improve the quality of reconstructed images. The block-based prediction breaks the pixel neighborhood constraint and takes full advantage of the local spatial correlations found in medical images. The adaptive block size guarantees a more rational division of images and the improved use of the local structure. The results indicate that the proposed algorithm can efficiently compress medical images and produces a better peak signal-to-noise ratio (PSNR) under the same pre-defined distortion than other near-lossless methods.

Robust Multi-Frame Adaptive Optics Image Restoration Algorithm Using Maximum Likelihood Estimation with Poisson Statistics.

PubMed

Li, Dongming; Sun, Changming; Yang, Jinhua; Liu, Huan; Peng, Jiaqi; Zhang, Lijuan

2017-04-06

An adaptive optics (AO) system provides real-time compensation for atmospheric turbulence. However, an AO image is usually of poor contrast because of the nature of the imaging process, meaning that the image contains information coming from both out-of-focus and in-focus planes of the object, which also brings about a loss in quality. In this paper, we present a robust multi-frame adaptive optics image restoration algorithm via maximum likelihood estimation. Our proposed algorithm uses a maximum likelihood method with image regularization as the basic principle, and constructs the joint log likelihood function for multi-frame AO images based on a Poisson distribution model. To begin with, a frame selection method based on image variance is applied to the observed multi-frame AO images to select images with better quality to improve the convergence of a blind deconvolution algorithm. Then, by combining the imaging conditions and the AO system properties, a point spread function estimation model is built. Finally, we develop our iterative solutions for AO image restoration addressing the joint deconvolution issue. We conduct a number of experiments to evaluate the performances of our proposed algorithm. Experimental results show that our algorithm produces accurate AO image restoration results and outperforms the current state-of-the-art blind deconvolution methods.

Robust Multi-Frame Adaptive Optics Image Restoration Algorithm Using Maximum Likelihood Estimation with Poisson Statistics

PubMed Central

Li, Dongming; Sun, Changming; Yang, Jinhua; Liu, Huan; Peng, Jiaqi; Zhang, Lijuan

2017-01-01

An adaptive optics (AO) system provides real-time compensation for atmospheric turbulence. However, an AO image is usually of poor contrast because of the nature of the imaging process, meaning that the image contains information coming from both out-of-focus and in-focus planes of the object, which also brings about a loss in quality. In this paper, we present a robust multi-frame adaptive optics image restoration algorithm via maximum likelihood estimation. Our proposed algorithm uses a maximum likelihood method with image regularization as the basic principle, and constructs the joint log likelihood function for multi-frame AO images based on a Poisson distribution model. To begin with, a frame selection method based on image variance is applied to the observed multi-frame AO images to select images with better quality to improve the convergence of a blind deconvolution algorithm. Then, by combining the imaging conditions and the AO system properties, a point spread function estimation model is built. Finally, we develop our iterative solutions for AO image restoration addressing the joint deconvolution issue. We conduct a number of experiments to evaluate the performances of our proposed algorithm. Experimental results show that our algorithm produces accurate AO image restoration results and outperforms the current state-of-the-art blind deconvolution methods. PMID:28383503

A Constrained Genetic Algorithm with Adaptively Defined Fitness Function in MRS Quantification

NASA Astrophysics Data System (ADS)

Papakostas, G. A.; Karras, D. A.; Mertzios, B. G.; Graveron-Demilly, D.; van Ormondt, D.

MRS Signal quantification is a rather involved procedure and has attracted the interest of the medical engineering community, regarding the development of computationally efficient methodologies. Significant contributions based on Computational Intelligence tools, such as Neural Networks (NNs), demonstrated a good performance but not without drawbacks already discussed by the authors. On the other hand preliminary application of Genetic Algorithms (GA) has already been reported in the literature by the authors regarding the peak detection problem encountered in MRS quantification using the Voigt line shape model. This paper investigates a novel constrained genetic algorithm involving a generic and adaptively defined fitness function which extends the simple genetic algorithm methodology in case of noisy signals. The applicability of this new algorithm is scrutinized through experimentation in artificial MRS signals interleaved with noise, regarding its signal fitting capabilities. Although extensive experiments with real world MRS signals are necessary, the herein shown performance illustrates the method's potential to be established as a generic MRS metabolites quantification procedure.

Aerobic Exercise Training Adaptations Are Increased by Postexercise Carbohydrate-Protein Supplementation

PubMed Central

Ferguson-Stegall, Lisa; McCleave, Erin; Ding, Zhenping; Doerner III, Phillip G.; Liu, Yang; Wang, Bei; Healy, Marin; Kleinert, Maximilian; Dessard, Benjamin; Lassiter, David G.; Kammer, Lynne; Ivy, John L.

2011-01-01

Carbohydrate-protein supplementation has been found to increase the rate of training adaptation when provided postresistance exercise. The present study compared the effects of a carbohydrate and protein supplement in the form of chocolate milk (CM), isocaloric carbohydrate (CHO), and placebo on training adaptations occurring over 4.5 weeks of aerobic exercise training. Thirty-two untrained subjects cycled 60 min/d, 5 d/wk for 4.5 wks at 75–80% of maximal oxygen consumption (VO2 max). Supplements were ingested immediately and 1 h after each exercise session. VO2 max and body composition were assessed before the start and end of training. VO2 max improvements were significantly greater in CM than CHO and placebo. Greater improvements in body composition, represented by a calculated lean and fat mass differential for whole body and trunk, were found in the CM group compared to CHO. We conclude supplementing with CM postexercise improves aerobic power and body composition more effectively than CHO alone. PMID:21773022

A systematic review of gait analysis methods based on inertial sensors and adaptive algorithms.

PubMed

Caldas, Rafael; Mundt, Marion; Potthast, Wolfgang; Buarque de Lima Neto, Fernando; Markert, Bernd

2017-09-01

The conventional methods to assess human gait are either expensive or complex to be applied regularly in clinical practice. To reduce the cost and simplify the evaluation, inertial sensors and adaptive algorithms have been utilized, respectively. This paper aims to summarize studies that applied adaptive also called artificial intelligence (AI) algorithms to gait analysis based on inertial sensor data, verifying if they can support the clinical evaluation. Articles were identified through searches of the main databases, which were encompassed from 1968 to October 2016. We have identified 22 studies that met the inclusion criteria. The included papers were analyzed due to their data acquisition and processing methods with specific questionnaires. Concerning the data acquisition, the mean score is 6.1±1.62, what implies that 13 of 22 papers failed to report relevant outcomes. The quality assessment of AI algorithms presents an above-average rating (8.2±1.84). Therefore, AI algorithms seem to be able to support gait analysis based on inertial sensor data. Further research, however, is necessary to enhance and standardize the application in patients, since most of the studies used distinct methods to evaluate healthy subjects. Copyright © 2017 Elsevier B.V. All rights reserved.

Space motion sickness preflight adaptation training: preliminary studies with prototype trainers

NASA Technical Reports Server (NTRS)

Parker, D. E.; Rock, J. C.; von Gierke, H. E.; Ouyang, L.; Reschke, M. F.; Arrott, A. P.

1987-01-01

Preflight training frequently has been proposed as a potential solution to the problem of space motion sickness. The paper considers successively the otolith reinterpretation, the concept for a preflight adaptation trainer and the research with the Miami University Seesaw, the Wright Patterson Air-Force Base Dynamic Environment Simulator and the Visually Coupled Airborne Systems Simulator prototype adaptation trainers.

Adaptive sleep-wake discrimination for wearable devices.

PubMed

Karlen, Walter; Floreano, Dario

2011-04-01

Sleep/wake classification systems that rely on physiological signals suffer from intersubject differences that make accurate classification with a single, subject-independent model difficult. To overcome the limitations of intersubject variability, we suggest a novel online adaptation technique that updates the sleep/wake classifier in real time. The objective of the present study was to evaluate the performance of a newly developed adaptive classification algorithm that was embedded on a wearable sleep/wake classification system called SleePic. The algorithm processed ECG and respiratory effort signals for the classification task and applied behavioral measurements (obtained from accelerometer and press-button data) for the automatic adaptation task. When trained as a subject-independent classifier algorithm, the SleePic device was only able to correctly classify 74.94 ± 6.76% of the human-rated sleep/wake data. By using the suggested automatic adaptation method, the mean classification accuracy could be significantly improved to 92.98 ± 3.19%. A subject-independent classifier based on activity data only showed a comparable accuracy of 90.44 ± 3.57%. We demonstrated that subject-independent models used for online sleep-wake classification can successfully be adapted to previously unseen subjects without the intervention of human experts or off-line calibration.

Fast adaptive diamond search algorithm for block-matching motion estimation using spatial correlation

NASA Astrophysics Data System (ADS)

Park, Sang-Gon; Jeong, Dong-Seok

2000-12-01

In this paper, we propose a fast adaptive diamond search algorithm (FADS) for block matching motion estimation. Many fast motion estimation algorithms reduce the computational complexity by the UESA (Unimodal Error Surface Assumption) where the matching error monotonically increases as the search moves away from the global minimum point. Recently, many fast BMAs (Block Matching Algorithms) make use of the fact that global minimum points in real world video sequences are centered at the position of zero motion. But these BMAs, especially in large motion, are easily trapped into the local minima and result in poor matching accuracy. So, we propose a new motion estimation algorithm using the spatial correlation among the neighboring blocks. We move the search origin according to the motion vectors of the spatially neighboring blocks and their MAEs (Mean Absolute Errors). The computer simulation shows that the proposed algorithm has almost the same computational complexity with DS (Diamond Search), but enhances PSNR. Moreover, the proposed algorithm gives almost the same PSNR as that of FS (Full Search), even for the large motion with half the computational load.

Carbohydrate availability and exercise training adaptation: too much of a good thing?

PubMed

Bartlett, Jonathan D; Hawley, John A; Morton, James P

2015-01-01

Traditional nutritional approaches to endurance training have typically promoted high carbohydrate (CHO) availability before, during and after training sessions to ensure adequate muscle substrate to meet the demands of high daily training intensities and volumes. However, during the past decade, data from our laboratories and others have demonstrated that deliberately training in conditions of reduced CHO availability can promote training-induced adaptations of human skeletal muscle (i.e. increased maximal mitochondrial enzyme activities and/or mitochondrial content, increased rates of lipid oxidation and, in some instances, improved exercise capacity). Such data have led to the concept of 'training low, but competing high' whereby selected training sessions are completed in conditions of reduced CHO availability (so as to promote training adaptation), but CHO reserves are restored immediately prior to an important competition. The augmented training response observed with training-low strategies is likely regulated by enhanced activation of key cell signalling kinases (e.g. AMPK, p38MAPK), transcription factors (e.g. p53, PPARδ) and transcriptional co-activators (e.g. PGC-1α), such that a co-ordinated up-regulation of both the nuclear and mitochondrial genomes occurs. Although the optimal practical strategies to train low are not currently known, consuming additional caffeine, protein, and practising CHO mouth-rinsing before and/or during training may help to rescue the reduced training intensities that typically occur when 'training low', in addition to preventing protein breakdown and maintaining optimal immune function. Finally, athletes should practise 'train-low' workouts in conjunction with sessions undertaken with normal or high CHO availability so that their capacity to oxidise CHO is not blunted on race day.

Demonstration of the use of ADAPT to derive predictive maintenance algorithms for the KSC central heat plant

NASA Technical Reports Server (NTRS)

Hunter, H. E.

1972-01-01

The Avco Data Analysis and Prediction Techniques (ADAPT) were employed to determine laws capable of detecting failures in a heat plant up to three days in advance of the occurrence of the failure. The projected performance of algorithms yielded a detection probability of 90% with false alarm rates of the order of 1 per year for a sample rate of 1 per day with each detection, followed by 3 hourly samplings. This performance was verified on 173 independent test cases. The program also demonstrated diagnostic algorithms and the ability to predict the time of failure to approximately plus or minus 8 hours up to three days in advance of the failure. The ADAPT programs produce simple algorithms which have a unique possibility of a relatively low cost updating procedure. The algorithms were implemented on general purpose computers at Kennedy Space Flight Center and tested against current data.

Unsupervised Domain Adaptation with Multiple Acoustic Models

DTIC Science & Technology

2010-12-01

Discriminative MAP Adaptation Standard ML-MAP has been extended to incorporate discrim- inative training criteria such as MMI and MPE [10]. Dis- criminative MAP...smoothing variable I . For example, the MMI - MAP mean is given by ( mmi -map) jm = fnumjm (O) den jm(O)g+Djm̂jm + I (ml-map) jm f numjm den... MMI training, and Djm is the Gaussian-dependent parameter for the extended Baum-Welch (EBW) algorithm. MMI -MAP has been successfully applied in

Massively parallel algorithms for real-time wavefront control of a dense adaptive optics system

DOE Office of Scientific and Technical Information (OSTI.GOV)

Fijany, A.; Milman, M.; Redding, D.

1994-12-31

In this paper massively parallel algorithms and architectures for real-time wavefront control of a dense adaptive optic system (SELENE) are presented. The authors have already shown that the computation of a near optimal control algorithm for SELENE can be reduced to the solution of a discrete Poisson equation on a regular domain. Although, this represents an optimal computation, due the large size of the system and the high sampling rate requirement, the implementation of this control algorithm poses a computationally challenging problem since it demands a sustained computational throughput of the order of 10 GFlops. They develop a novel algorithm,more » designated as Fast Invariant Imbedding algorithm, which offers a massive degree of parallelism with simple communication and synchronization requirements. Due to these features, this algorithm is significantly more efficient than other Fast Poisson Solvers for implementation on massively parallel architectures. The authors also discuss two massively parallel, algorithmically specialized, architectures for low-cost and optimal implementation of the Fast Invariant Imbedding algorithm.« less

Flight Testing of the Space Launch System (SLS) Adaptive Augmenting Control (AAC) Algorithm on an F/A-18

NASA Technical Reports Server (NTRS)

Dennehy, Cornelius J.; VanZwieten, Tannen S.; Hanson, Curtis E.; Wall, John H.; Miller, Chris J.; Gilligan, Eric T.; Orr, Jeb S.

2014-01-01

The Marshall Space Flight Center (MSFC) Flight Mechanics and Analysis Division developed an adaptive augmenting control (AAC) algorithm for launch vehicles that improves robustness and performance on an as-needed basis by adapting a classical control algorithm to unexpected environments or variations in vehicle dynamics. This was baselined as part of the Space Launch System (SLS) flight control system. The NASA Engineering and Safety Center (NESC) was asked to partner with the SLS Program and the Space Technology Mission Directorate (STMD) Game Changing Development Program (GCDP) to flight test the AAC algorithm on a manned aircraft that can achieve a high level of dynamic similarity to a launch vehicle and raise the technology readiness of the algorithm early in the program. This document reports the outcome of the NESC assessment.

Brain-Inspired Constructive Learning Algorithms with Evolutionally Additive Nonlinear Neurons

NASA Astrophysics Data System (ADS)

Fang, Le-Heng; Lin, Wei; Luo, Qiang

In this article, inspired partially by the physiological evidence of brain’s growth and development, we developed a new type of constructive learning algorithm with evolutionally additive nonlinear neurons. The new algorithms have remarkable ability in effective regression and accurate classification. In particular, the algorithms are able to sustain a certain reduction of the loss function when the dynamics of the trained network are bogged down in the vicinity of the local minima. The algorithm augments the neural network by adding only a few connections as well as neurons whose activation functions are nonlinear, nonmonotonic, and self-adapted to the dynamics of the loss functions. Indeed, we analytically demonstrate the reduction dynamics of the algorithm for different problems, and further modify the algorithms so as to obtain an improved generalization capability for the augmented neural networks. Finally, through comparing with the classical algorithm and architecture for neural network construction, we show that our constructive learning algorithms as well as their modified versions have better performances, such as faster training speed and smaller network size, on several representative benchmark datasets including the MNIST dataset for handwriting digits.

Physiological Adaptations to Resistance Training in Prepubertal Boys

ERIC Educational Resources Information Center

dos Santos Cunha, Giovani; Sant'anna, Marcelo Morganti; Cadore, Eduardo Lusa; de Oliveira, Norton Luis; dos Santos, Cinara Bos; Pinto, Ronei Silveira; Reischak-Oliveira, Alvaro

2015-01-01

Purpose: The purpose of this study was to investigate the physiological adaptations of resistance training (RT) in prepubertal boys. Methods: Eighteen healthy boys were divided into RT (n = 9, M[subscript age] = 10.4 ± 0.5 years) and control (CTR; n = 9, M[subscript age] = 10.9 ± 0.7 years) groups. The RT group underwent a resistance training…

On-line node fault injection training algorithm for MLP networks: objective function and convergence analysis.

PubMed

Sum, John Pui-Fai; Leung, Chi-Sing; Ho, Kevin I-J

2012-02-01

Improving fault tolerance of a neural network has been studied for more than two decades. Various training algorithms have been proposed in sequel. The on-line node fault injection-based algorithm is one of these algorithms, in which hidden nodes randomly output zeros during training. While the idea is simple, theoretical analyses on this algorithm are far from complete. This paper presents its objective function and the convergence proof. We consider three cases for multilayer perceptrons (MLPs). They are: (1) MLPs with single linear output node; (2) MLPs with multiple linear output nodes; and (3) MLPs with single sigmoid output node. For the convergence proof, we show that the algorithm converges with probability one. For the objective function, we show that the corresponding objective functions of cases (1) and (2) are of the same form. They both consist of a mean square errors term, a regularizer term, and a weight decay term. For case (3), the objective function is slight different from that of cases (1) and (2). With the objective functions derived, we can compare the similarities and differences among various algorithms and various cases.

Motion Cueing Algorithm Development: Initial Investigation and Redesign of the Algorithms

NASA Technical Reports Server (NTRS)

Telban, Robert J.; Wu, Weimin; Cardullo, Frank M.; Houck, Jacob A. (Technical Monitor)

2000-01-01

In this project four motion cueing algorithms were initially investigated. The classical algorithm generated results with large distortion and delay and low magnitude. The NASA adaptive algorithm proved to be well tuned with satisfactory performance, while the UTIAS adaptive algorithm produced less desirable results. Modifications were made to the adaptive algorithms to reduce the magnitude of undesirable spikes. The optimal algorithm was found to have the potential for improved performance with further redesign. The center of simulator rotation was redefined. More terms were added to the cost function to enable more tuning flexibility. A new design approach using a Fortran/Matlab/Simulink setup was employed. A new semicircular canals model was incorporated in the algorithm. With these changes results show the optimal algorithm has some advantages over the NASA adaptive algorithm. Two general problems observed in the initial investigation required solutions. A nonlinear gain algorithm was developed that scales the aircraft inputs by a third-order polynomial, maximizing the motion cues while remaining within the operational limits of the motion system. A braking algorithm was developed to bring the simulator to a full stop at its motion limit and later release the brake to follow the cueing algorithm output.

Chronic condition self-management support for Aboriginal people: Adapting tools and training.

PubMed

Battersby, Malcolm; Lawn, Sharon; Kowanko, Inge; Bertossa, Sue; Trowbridge, Coral; Liddicoat, Raylene

2018-04-22

Chronic conditions are major health problems for Australian Aboriginal people. Self-management programs can improve health outcomes. However, few health workers are skilled in self-management support and existing programs are not always appropriate in Australian Aboriginal contexts. The goal was to increase the capacity of the Australian health workforce to support Australian Aboriginal people to self-manage their chronic conditions by adapting the Flinders Program of chronic condition self-management support for Australian Aboriginal clients and develop and deliver training for health professionals to implement the program. Feedback from health professionals highlighted that the Flinders Program assessment and care planning tools needed to be adapted to suit Australian Aboriginal contexts. Through consultation with Australian Aboriginal Elders and other experts, the tools were condensed into an illustrated booklet called 'My Health Story'. Associated training courses and resources focusing on cultural safety and effective engagement were developed. A total of 825 health professionals  across Australia was trained and 61 people qualified as accredited trainers in the program, ensuring sustainability. The capacity and skills of the Australian health workforce to engage with and support Australian Aboriginal people to self-manage their chronic health problems significantly increased as a result of this project. The adapted tools and training were popular and appreciated by the health care organisations, health professionals and clients involved. The adapted tools have widespread appeal for cultures that do not have Western models of health care and where there are health literacy challenges. My Health Story has already been used internationally. © 2018 National Rural Health Alliance Ltd.

Layer-oriented multigrid wavefront reconstruction algorithms for multi-conjugate adaptive optics

NASA Astrophysics Data System (ADS)

Gilles, Luc; Ellerbroek, Brent L.; Vogel, Curtis R.

2003-02-01

Multi-conjugate adaptive optics (MCAO) systems with 104-105 degrees of freedom have been proposed for future giant telescopes. Using standard matrix methods to compute, optimize, and implement wavefront control algorithms for these systems is impractical, since the number of calculations required to compute and apply the reconstruction matrix scales respectively with the cube and the square of the number of AO degrees of freedom. In this paper, we develop an iterative sparse matrix implementation of minimum variance wavefront reconstruction for telescope diameters up to 32m with more than 104 actuators. The basic approach is the preconditioned conjugate gradient method, using a multigrid preconditioner incorporating a layer-oriented (block) symmetric Gauss-Seidel iterative smoothing operator. We present open-loop numerical simulation results to illustrate algorithm convergence.

RZA-NLMF algorithm-based adaptive sparse sensing for realizing compressive sensing

NASA Astrophysics Data System (ADS)

Gui, Guan; Xu, Li; Adachi, Fumiyuki

2014-12-01

Nonlinear sparse sensing (NSS) techniques have been adopted for realizing compressive sensing in many applications such as radar imaging. Unlike the NSS, in this paper, we propose an adaptive sparse sensing (ASS) approach using the reweighted zero-attracting normalized least mean fourth (RZA-NLMF) algorithm which depends on several given parameters, i.e., reweighted factor, regularization parameter, and initial step size. First, based on the independent assumption, Cramer-Rao lower bound (CRLB) is derived as for the performance comparisons. In addition, reweighted factor selection method is proposed for achieving robust estimation performance. Finally, to verify the algorithm, Monte Carlo-based computer simulations are given to show that the ASS achieves much better mean square error (MSE) performance than the NSS.

Clustering of tethered satellite system simulation data by an adaptive neuro-fuzzy algorithm

NASA Technical Reports Server (NTRS)

Mitra, Sunanda; Pemmaraju, Surya

1992-01-01

Recent developments in neuro-fuzzy systems indicate that the concepts of adaptive pattern recognition, when used to identify appropriate control actions corresponding to clusters of patterns representing system states in dynamic nonlinear control systems, may result in innovative designs. A modular, unsupervised neural network architecture, in which fuzzy learning rules have been embedded is used for on-line identification of similar states. The architecture and control rules involved in Adaptive Fuzzy Leader Clustering (AFLC) allow this system to be incorporated in control systems for identification of system states corresponding to specific control actions. We have used this algorithm to cluster the simulation data of Tethered Satellite System (TSS) to estimate the range of delta voltages necessary to maintain the desired length rate of the tether. The AFLC algorithm is capable of on-line estimation of the appropriate control voltages from the corresponding length error and length rate error without a priori knowledge of their membership functions and familarity with the behavior of the Tethered Satellite System.

Magnetic resonance image restoration via dictionary learning under spatially adaptive constraints.

PubMed

Wang, Shanshan; Xia, Yong; Dong, Pei; Feng, David Dagan; Luo, Jianhua; Huang, Qiu

2013-01-01

This paper proposes a spatially adaptive constrained dictionary learning (SAC-DL) algorithm for Rician noise removal in magnitude magnetic resonance (MR) images. This algorithm explores both the strength of dictionary learning to preserve image structures and the robustness of local variance estimation to remove signal-dependent Rician noise. The magnitude image is first separated into a number of partly overlapping image patches. The statistics of each patch are collected and analyzed to obtain a local noise variance. To better adapt to Rician noise, a correction factor is formulated with the local signal-to-noise ratio (SNR). Finally, the trained dictionary is used to denoise each image patch under spatially adaptive constraints. The proposed algorithm has been compared to the popular nonlocal means (NLM) filtering and unbiased NLM (UNLM) algorithm on simulated T1-weighted, T2-weighted and PD-weighted MR images. Our results suggest that the SAC-DL algorithm preserves more image structures while effectively removing the noise than NLM and it is also superior to UNLM at low noise levels.

Limited-memory adaptive snapshot selection for proper orthogonal decomposition

DOE Office of Scientific and Technical Information (OSTI.GOV)

Oxberry, Geoffrey M.; Kostova-Vassilevska, Tanya; Arrighi, Bill

2015-04-02

Reduced order models are useful for accelerating simulations in many-query contexts, such as optimization, uncertainty quantification, and sensitivity analysis. However, offline training of reduced order models can have prohibitively expensive memory and floating-point operation costs in high-performance computing applications, where memory per core is limited. To overcome this limitation for proper orthogonal decomposition, we propose a novel adaptive selection method for snapshots in time that limits offline training costs by selecting snapshots according an error control mechanism similar to that found in adaptive time-stepping ordinary differential equation solvers. The error estimator used in this work is related to theory boundingmore » the approximation error in time of proper orthogonal decomposition-based reduced order models, and memory usage is minimized by computing the singular value decomposition using a single-pass incremental algorithm. Results for a viscous Burgers’ test problem demonstrate convergence in the limit as the algorithm error tolerances go to zero; in this limit, the full order model is recovered to within discretization error. The resulting method can be used on supercomputers to generate proper orthogonal decomposition-based reduced order models, or as a subroutine within hyperreduction algorithms that require taking snapshots in time, or within greedy algorithms for sampling parameter space.« less

Adaptive receiver structures for asynchronous CDMA systems

NASA Astrophysics Data System (ADS)

Rapajic, Predrag B.; Vucetic, Branka S.

1994-05-01

Adaptive linear and decision feedback receiver structures for coherent demodulation in asynchronous code division multiple access (CDMA) systems are considered. It is assumed that the adaptive receiver has no knowledge of the signature waveforms and timing of other users. The receiver is trained by a known training sequence prior to data transmission and continuously adjusted by an adaptive algorithm during data transmission. The proposed linear receiver is as simple as a standard single-user detector receiver consisting of a matched filter with constant coefficients, but achieves essential advantages with respect to timing recovery, multiple access interference elimination, near/far effect, narrowband and frequency-selective fading interference suppression, and user privacy. An adaptive centralized decision feedback receiver has the same advantages of the linear receiver but, in addition, achieves a further improvement in multiple access interference cancellation at the expense of higher complexity. The proposed receiver structures are tested by simulation over a channel with multipath propagation, multiple access interference, narrowband interference, and additive white Gaussian noise.

Altitude negates the benefits of aerobic training on the vascular adaptations in rats.

PubMed

Reboul, Cyril; Tanguy, Stephane; Dauzat, Michel; Obert, Philippe

2005-06-01

This study questioned the effect of living and training at moderate altitude on aortic vasoreactivity. Considering that chronic hypoxia exposure and endurance training are able to generate opposite effects on the systemic vascular reactivity, it was hypothesized that endurance training benefits on the vascular function could be limited by chronic hypoxia. Sea-level native rats were randomly assigned to N (living in normoxia), NT (living and training 5 d.wk for 5 wk in normoxia), CH (living in hypoxia, 2800 m), and CHT (living and training 5 d.wk for 5 wk in hypoxia, 2800 m) groups. Concentration response curves to epinephrine, norepinephrine, endothelin-1, acetylcholine, and sodium nitro-prusside were assessed on aortic isolated rings. Left ventricular resting and maximal (during Tyrode's infusion) stroke volumes were evaluated by Doppler-echocardiography and used as indexes of chronic aortic volume overload. The main finding was that favorable aortic vasoreactivity adaptations consecutive to sea-level training were not observed when training was conducted at altitude. An improvement in the endothelium-dependent vasorelaxation (maximal relaxation, R(max), N = 60.4 +/- 10.0 vs NT = 91.7 +/- 3.2%; P < 0.05) and a reduced sensitivity to ET-1 were observed in NT rats. Such an enhancement in endothelium-dependent vasorelaxation was not found in CHT rats (R(max): 48.4 +/- 7.8%). Moreover, a higher sensitivity to ET-1 was reported in this group. Altitude-induced limitation in aortic blood flow and shear stress could play a major role in the explanation of these specific altitude-training adaptations. If extrapolated to the peripheral vascular bed, our results have practical significance for aerobic performance as aortic vasoreactivity adaptations after altitude training could contribute to limit blood delivery to exercising muscles.

An Adaptive and Time-Efficient ECG R-Peak Detection Algorithm.

PubMed

Qin, Qin; Li, Jianqing; Yue, Yinggao; Liu, Chengyu

2017-01-01

R-peak detection is crucial in electrocardiogram (ECG) signal analysis. This study proposed an adaptive and time-efficient R-peak detection algorithm for ECG processing. First, wavelet multiresolution analysis was applied to enhance the ECG signal representation. Then, ECG was mirrored to convert large negative R-peaks to positive ones. After that, local maximums were calculated by the first-order forward differential approach and were truncated by the amplitude and time interval thresholds to locate the R-peaks. The algorithm performances, including detection accuracy and time consumption, were tested on the MIT-BIH arrhythmia database and the QT database. Experimental results showed that the proposed algorithm achieved mean sensitivity of 99.39%, positive predictivity of 99.49%, and accuracy of 98.89% on the MIT-BIH arrhythmia database and 99.83%, 99.90%, and 99.73%, respectively, on the QT database. By processing one ECG record, the mean time consumptions were 0.872 s and 0.763 s for the MIT-BIH arrhythmia database and QT database, respectively, yielding 30.6% and 32.9% of time reduction compared to the traditional Pan-Tompkins method.

An Adaptive and Time-Efficient ECG R-Peak Detection Algorithm

PubMed Central

Qin, Qin

2017-01-01

R-peak detection is crucial in electrocardiogram (ECG) signal analysis. This study proposed an adaptive and time-efficient R-peak detection algorithm for ECG processing. First, wavelet multiresolution analysis was applied to enhance the ECG signal representation. Then, ECG was mirrored to convert large negative R-peaks to positive ones. After that, local maximums were calculated by the first-order forward differential approach and were truncated by the amplitude and time interval thresholds to locate the R-peaks. The algorithm performances, including detection accuracy and time consumption, were tested on the MIT-BIH arrhythmia database and the QT database. Experimental results showed that the proposed algorithm achieved mean sensitivity of 99.39%, positive predictivity of 99.49%, and accuracy of 98.89% on the MIT-BIH arrhythmia database and 99.83%, 99.90%, and 99.73%, respectively, on the QT database. By processing one ECG record, the mean time consumptions were 0.872 s and 0.763 s for the MIT-BIH arrhythmia database and QT database, respectively, yielding 30.6% and 32.9% of time reduction compared to the traditional Pan-Tompkins method. PMID:29104745

Adaptations of mouse skeletal muscle to low intensity vibration training

PubMed Central

McKeehen, James N.; Novotny, Susan A.; Baltgalvis, Kristen A.; Call, Jarrod A.; Nuckley, David J.; Lowe, Dawn A.

2013-01-01

Purpose We tested the hypothesis that low intensity vibration training in mice improves contractile function of hindlimb skeletal muscles and promotes exercise-related cellular adaptations. Methods We subjected C57BL/6J mice to 6 wk, 5 d·wk−1, 15 min·d−1 of sham or low intensity vibration (45 Hz, 1.0 g) while housed in traditional cages (Sham-Active, n=8; Vibrated-Active, n=10) or in small cages to restrict physical activity (Sham-Restricted, n=8; Vibrated-Restricted, n=8). Contractile function and resistance to fatigue were tested in vivo (anterior and posterior crural muscles) and ex vivo on the soleus muscle. Tibialis anterior and soleus muscles were evaluated histologically for alterations in oxidative metabolism, capillarity, and fiber types. Epididymal fat pad and hindlimb muscle masses were measured. Two-way ANOVAs were used to determine effects of vibration and physical inactivity. Results Vibration training resulted in a 10% increase in maximal isometric torque (P=0.038) and 16% faster maximal rate of relaxation (P=0.030) of the anterior crural muscles. Posterior crural muscles were unaffected by vibration, with the exception of greater rates of contraction in Vibrated-Restricted mice compared to Vibrated-Active and Sham-Restricted mice (P=0.022). Soleus muscle maximal isometric tetanic force tended to be greater (P=0.057) and maximal relaxation was 20% faster (P=0.005) in Vibrated compared to Sham mice. Restriction of physical activity induced muscle weakness but was not required for vibration to be effective in improving strength or relaxation. Vibration training did not impact muscle fatigability or any indicator of cellular adaptation investigated (P≥0.431). Fat pad but not hindlimb muscle masses were affected by vibration training. Conclusion Vibration training in mice improved muscle contractility, specifically strength and relaxation rates, with no indication of adverse effects to muscle function or cellular adaptations. PMID:23274599

A new interferential multispectral image compression algorithm based on adaptive classification and curve-fitting

NASA Astrophysics Data System (ADS)

Wang, Ke-Yan; Li, Yun-Song; Liu, Kai; Wu, Cheng-Ke

2008-08-01

A novel compression algorithm for interferential multispectral images based on adaptive classification and curve-fitting is proposed. The image is first partitioned adaptively into major-interference region and minor-interference region. Different approximating functions are then constructed for two kinds of regions respectively. For the major interference region, some typical interferential curves are selected to predict other curves. These typical curves are then processed by curve-fitting method. For the minor interference region, the data of each interferential curve are independently approximated. Finally the approximating errors of two regions are entropy coded. The experimental results show that, compared with JPEG2000, the proposed algorithm not only decreases the average output bit-rate by about 0.2 bit/pixel for lossless compression, but also improves the reconstructed images and reduces the spectral distortion greatly, especially at high bit-rate for lossy compression.

Error bounds of adaptive dynamic programming algorithms for solving undiscounted optimal control problems.

PubMed

Liu, Derong; Li, Hongliang; Wang, Ding

2015-06-01

In this paper, we establish error bounds of adaptive dynamic programming algorithms for solving undiscounted infinite-horizon optimal control problems of discrete-time deterministic nonlinear systems. We consider approximation errors in the update equations of both value function and control policy. We utilize a new assumption instead of the contraction assumption in discounted optimal control problems. We establish the error bounds for approximate value iteration based on a new error condition. Furthermore, we also establish the error bounds for approximate policy iteration and approximate optimistic policy iteration algorithms. It is shown that the iterative approximate value function can converge to a finite neighborhood of the optimal value function under some conditions. To implement the developed algorithms, critic and action neural networks are used to approximate the value function and control policy, respectively. Finally, a simulation example is given to demonstrate the effectiveness of the developed algorithms.

Experiment on a three-beam adaptive array for EHF frequency-hopped signals using a fast algorithm, phase-D

NASA Astrophysics Data System (ADS)

Yen, J. L.; Kremer, P.; Amin, N.; Fung, J.

1989-05-01

The Department of National Defence (Canada) has been conducting studies into multi-beam adaptive arrays for extremely high frequency (EHF) frequency hopped signals. A three-beam 43 GHz adaptive antenna and a beam control processor is under development. An interactive software package for the operation of the array, capable of applying different control algorithms is being written. A maximum signal to jammer plus noise ratio (SJNR) was found to provide superior performance in preventing degradation of user signals in the presence of nearby jammers. A new fast algorithm using a modified conjugate gradient approach was found to be a very efficient way to implement anti-jamming arrays based on maximum SJNR criterion. The present study was intended to refine and simplify this algorithm and to implement the algorithm on an experimental array for real-time evaluation of anti-jamming performance. A three-beam adaptive array was used. A simulation package was used in the evaluation of multi-beam systems using more than three beams and different user-jammer scenarios. An attempt to further reduce the computation burden through continued analysis of maximum SJNR met with limited success. A method to acquire and track an incoming laser beam is proposed.

A Self-Adaptive Fuzzy c-Means Algorithm for Determining the Optimal Number of Clusters

PubMed Central

Wang, Zhihao; Yi, Jing

2016-01-01

For the shortcoming of fuzzy c-means algorithm (FCM) needing to know the number of clusters in advance, this paper proposed a new self-adaptive method to determine the optimal number of clusters. Firstly, a density-based algorithm was put forward. The algorithm, according to the characteristics of the dataset, automatically determined the possible maximum number of clusters instead of using the empirical rule n and obtained the optimal initial cluster centroids, improving the limitation of FCM that randomly selected cluster centroids lead the convergence result to the local minimum. Secondly, this paper, by introducing a penalty function, proposed a new fuzzy clustering validity index based on fuzzy compactness and separation, which ensured that when the number of clusters verged on that of objects in the dataset, the value of clustering validity index did not monotonically decrease and was close to zero, so that the optimal number of clusters lost robustness and decision function. Then, based on these studies, a self-adaptive FCM algorithm was put forward to estimate the optimal number of clusters by the iterative trial-and-error process. At last, experiments were done on the UCI, KDD Cup 1999, and synthetic datasets, which showed that the method not only effectively determined the optimal number of clusters, but also reduced the iteration of FCM with the stable clustering result. PMID:28042291

Greater Neural Adaptations following High- vs. Low-Load Resistance Training

PubMed Central

Jenkins, Nathaniel D. M.; Miramonti, Amelia A.; Hill, Ethan C.; Smith, Cory M.; Cochrane-Snyman, Kristen C.; Housh, Terry J.; Cramer, Joel T.

2017-01-01

We examined the neuromuscular adaptations following 3 and 6 weeks of 80 vs. 30% one repetition maximum (1RM) resistance training to failure in the leg extensors. Twenty-six men (age = 23.1 ± 4.7 years) were randomly assigned to a high- (80% 1RM; n = 13) or low-load (30% 1RM; n = 13) resistance training group and completed leg extension resistance training to failure 3 times per week for 6 weeks. Testing was completed at baseline, 3, and 6 weeks of training. During each testing session, ultrasound muscle thickness and echo intensity, 1RM strength, maximal voluntary isometric contraction (MVIC) strength, and contractile properties of the quadriceps femoris were measured. Percent voluntary activation (VA) and electromyographic (EMG) amplitude were measured during MVIC, and during randomly ordered isometric step muscle actions at 10–100% of baseline MVIC. There were similar increases in muscle thickness from Baseline to Week 3 and 6 in the 80 and 30% 1RM groups. However, both 1RM and MVIC strength increased from Baseline to Week 3 and 6 to a greater degree in the 80% than 30% 1RM group. VA during MVIC was also greater in the 80 vs. 30% 1RM group at Week 6, and only training at 80% 1RM elicited a significant increase in EMG amplitude during MVIC. The peak twitch torque to MVIC ratio was also significantly reduced in the 80%, but not 30% 1RM group, at Week 3 and 6. Finally, VA and EMG amplitude were reduced during submaximal torque production as a result of training at 80% 1RM, but not 30% 1RM. Despite eliciting similar hypertrophy, 80% 1RM improved muscle strength more than 30% 1RM, and was accompanied by increases in VA and EMG amplitude during maximal force production. Furthermore, training at 80% 1RM resulted in a decreased neural cost to produce the same relative submaximal torques after training, whereas training at 30% 1RM did not. Therefore, our data suggest that high-load training results in greater neural adaptations that may explain the disparate increases

Physiological Adaptations to Hypoxic vs. Normoxic Training during Intermittent Living High

PubMed Central

De Smet, Stefan; van Herpt, Paul; D'Hulst, Gommaar; Van Thienen, Ruud; Van Leemputte, Marc; Hespel, Peter

2017-01-01

In the setting of “living high,” it is unclear whether high-intensity interval training (HIIT) should be performed “low” or “high” to stimulate muscular and performance adaptations. Therefore, 10 physically active males participated in a 5-week “live high-train low or high” program (TR), whilst eight subjects were not engaged in any altitude or training intervention (CON). Five days per week (~15.5 h per day), TR was exposed to normobaric hypoxia simulating progressively increasing altitude of ~2,000–3,250 m. Three times per week, TR performed HIIT, administered as unilateral knee-extension training, with one leg in normobaric hypoxia (~4,300 m; TRHYP) and with the other leg in normoxia (TRNOR). “Living high” elicited a consistent elevation in serum erythropoietin concentrations which adequately predicted the increase in hemoglobin mass (r = 0.78, P < 0.05; TR: +2.6%, P < 0.05; CON: −0.7%, P > 0.05). Muscle oxygenation during training was lower in TRHYP vs. TRNOR (P < 0.05). Muscle homogenate buffering capacity and pH-regulating protein abundance were similar between pretest and posttest. Oscillations in muscle blood volume during repeated sprints, as estimated by oscillations in NIRS-derived tHb, increased from pretest to posttest in TRHYP (~80%, P < 0.01) but not in TRNOR (~50%, P = 0.08). Muscle capillarity (~15%) as well as repeated-sprint ability (~8%) and 3-min maximal performance (~10–15%) increased similarly in both legs (P < 0.05). Maximal isometric strength increased in TRHYP (~8%, P < 0.05) but not in TRNOR (~4%, P > 0.05). In conclusion, muscular and performance adaptations were largely similar following normoxic vs. hypoxic HIIT. However, hypoxic HIIT stimulated adaptations in isometric strength and muscle perfusion during intermittent sprinting. PMID:28620311

Accelerating adaptive inverse distance weighting interpolation algorithm on a graphics processing unit

PubMed Central

Xu, Liangliang; Xu, Nengxiong

2017-01-01

This paper focuses on designing and implementing parallel adaptive inverse distance weighting (AIDW) interpolation algorithms by using the graphics processing unit (GPU). The AIDW is an improved version of the standard IDW, which can adaptively determine the power parameter according to the data points’ spatial distribution pattern and achieve more accurate predictions than those predicted by IDW. In this paper, we first present two versions of the GPU-accelerated AIDW, i.e. the naive version without profiting from the shared memory and the tiled version taking advantage of the shared memory. We also implement the naive version and the tiled version using two data layouts, structure of arrays and array of aligned structures, on both single and double precision. We then evaluate the performance of parallel AIDW by comparing it with its corresponding serial algorithm on three different machines equipped with the GPUs GT730M, M5000 and K40c. The experimental results indicate that: (i) there is no significant difference in the computational efficiency when different data layouts are employed; (ii) the tiled version is always slightly faster than the naive version; and (iii) on single precision the achieved speed-up can be up to 763 (on the GPU M5000), while on double precision the obtained highest speed-up is 197 (on the GPU K40c). To benefit the community, all source code and testing data related to the presented parallel AIDW algorithm are publicly available. PMID:28989754

Accelerating adaptive inverse distance weighting interpolation algorithm on a graphics processing unit.

PubMed

Mei, Gang; Xu, Liangliang; Xu, Nengxiong

2017-09-01

This paper focuses on designing and implementing parallel adaptive inverse distance weighting (AIDW) interpolation algorithms by using the graphics processing unit (GPU). The AIDW is an improved version of the standard IDW, which can adaptively determine the power parameter according to the data points' spatial distribution pattern and achieve more accurate predictions than those predicted by IDW. In this paper, we first present two versions of the GPU-accelerated AIDW, i.e. the naive version without profiting from the shared memory and the tiled version taking advantage of the shared memory. We also implement the naive version and the tiled version using two data layouts, structure of arrays and array of aligned structures, on both single and double precision. We then evaluate the performance of parallel AIDW by comparing it with its corresponding serial algorithm on three different machines equipped with the GPUs GT730M, M5000 and K40c. The experimental results indicate that: (i) there is no significant difference in the computational efficiency when different data layouts are employed; (ii) the tiled version is always slightly faster than the naive version; and (iii) on single precision the achieved speed-up can be up to 763 (on the GPU M5000), while on double precision the obtained highest speed-up is 197 (on the GPU K40c). To benefit the community, all source code and testing data related to the presented parallel AIDW algorithm are publicly available.

Behavioral training promotes multiple adaptive processes following acute hearing loss.

PubMed

Keating, Peter; Rosenior-Patten, Onayomi; Dahmen, Johannes C; Bell, Olivia; King, Andrew J

2016-03-23

The brain possesses a remarkable capacity to compensate for changes in inputs resulting from a range of sensory impairments. Developmental studies of sound localization have shown that adaptation to asymmetric hearing loss can be achieved either by reinterpreting altered spatial cues or by relying more on those cues that remain intact. Adaptation to monaural deprivation in adulthood is also possible, but appears to lack such flexibility. Here we show, however, that appropriate behavioral training enables monaurally-deprived adult humans to exploit both of these adaptive processes. Moreover, cortical recordings in ferrets reared with asymmetric hearing loss suggest that these forms of plasticity have distinct neural substrates. An ability to adapt to asymmetric hearing loss using multiple adaptive processes is therefore shared by different species and may persist throughout the lifespan. This highlights the fundamental flexibility of neural systems, and may also point toward novel therapeutic strategies for treating sensory disorders.

Adaptive Virtual Reality Training to Optimize Military Medical Skills Acquisition and Retention.

PubMed

Siu, Ka-Chun; Best, Bradley J; Kim, Jong Wook; Oleynikov, Dmitry; Ritter, Frank E

2016-05-01

The Department of Defense has pursued the integration of virtual reality simulation into medical training and applications to fulfill the need to train 100,000 military health care personnel annually. Medical personnel transitions, both when entering an operational area and returning to the civilian theater, are characterized by the need to rapidly reacquire skills that are essential but have decayed through disuse or infrequent use. Improved efficiency in reacquiring such skills is critical to avoid the likelihood of mistakes that may result in mortality and morbidity. We focus here on a study testing a theory of how the skills required for minimally invasive surgery for military surgeons are learned and retained. Our adaptive virtual reality surgical training system will incorporate an intelligent mechanism for tracking performance that will recognize skill deficiencies and generate an optimal adaptive training schedule. Our design is modeling skill acquisition based on a skill retention theory. The complexity of appropriate training tasks is adjusted according to the level of retention and/or surgical experience. Based on preliminary work, our system will improve the capability to interactively assess the level of skills learning and decay, optimizes skill relearning across levels of surgical experience, and positively impact skill maintenance. Our system could eventually reduce mortality and morbidity by providing trainees with the reexperience they need to help make a transition between operating theaters. This article reports some data that will support adaptive tutoring of minimally invasive surgery and similar surgical skills. Reprint & Copyright © 2016 Association of Military Surgeons of the U.S.

EEG/ERP adaptive noise canceller design with controlled search space (CSS) approach in cuckoo and other optimization algorithms.

PubMed

Ahirwal, M K; Kumar, Anil; Singh, G K

2013-01-01

This paper explores the migration of adaptive filtering with swarm intelligence/evolutionary techniques employed in the field of electroencephalogram/event-related potential noise cancellation or extraction. A new approach is proposed in the form of controlled search space to stabilize the randomness of swarm intelligence techniques especially for the EEG signal. Swarm-based algorithms such as Particles Swarm Optimization, Artificial Bee Colony, and Cuckoo Optimization Algorithm with their variants are implemented to design optimized adaptive noise canceler. The proposed controlled search space technique is tested on each of the swarm intelligence techniques and is found to be more accurate and powerful. Adaptive noise canceler with traditional algorithms such as least-mean-square, normalized least-mean-square, and recursive least-mean-square algorithms are also implemented to compare the results. ERP signals such as simulated visual evoked potential, real visual evoked potential, and real sensorimotor evoked potential are used, due to their physiological importance in various EEG studies. Average computational time and shape measures of evolutionary techniques are observed 8.21E-01 sec and 1.73E-01, respectively. Though, traditional algorithms take negligible time consumption, but are unable to offer good shape preservation of ERP, noticed as average computational time and shape measure difference, 1.41E-02 sec and 2.60E+00, respectively.

Hypoxia and training-induced adaptation of hormonal responses to exercise in humans.

PubMed

Engfred, K; Kjaer, M; Secher, N H; Friedman, D B; Hanel, B; Nielsen, O J; Bach, F W; Galbo, H; Levine, B D

1994-01-01

To establish whether or not hypoxia influences the training-induced adaptation of hormonal responses to exercise, 21 healthy, untrained subjects (2) years, mean (SE)] were studied in three groups before and after 5 weeks' training (cycle ergometer, 45 min.day-1, 5 days.week-1). Group 1 trained at sea level at 70% maximal oxygen uptake (VO2max), group 2 in a hypobaric chamber at a simulated altitude of 2500 m at 70% of altitude VO2max, and group 3 at a simulated altitude of 2500 m at the same absolute work rate as group 1. Arterial blood was sampled before, during and at the end of exhaustive cycling at sea level (85% of pretraining VO2max). VO2max increased by 12 (2)% with no significant difference between groups, whereas endurance improved most in group 1 (P < 0.05). Training-induced changes in response to exercise of noradrenaline, adrenaline, growth hormone, beta-endorphin, glucagon, and insulin were similar in the three groups. Concentrations of erythropoietin and 2,3-diphosphoglycerate at rest did not change over the training period. In conclusion, within 5 weeks of training, no further adaptation of hormonal exercise responses takes place if intensity is increased above 70% VO2max. Furthermore, hypoxia per se does not add to the training-induced hormonal responses to exercise.

Communication skills training: Adapting to the trends and moving forward.

PubMed

Liu, Ye; Huang, Yiqin; Gao, Hong; Cheng, Xunjia

2017-05-23

Communication ability is one of the core requirements of doctors' competency. Teaching communication to medical students and junior doctors has attracted much attention. With the challenge of escalating demands, the status of training communication skills has been promoted in the past several decades. The training content was integrated with other courses and various pedagogic approaches have been applied and proved to be effective. Practical strategies and mixed types were highly recommended. However, there are still many problems, including the fragmentation of the training, insufficient practice, inadequate qualified teachers, case adaptation, course localization and impediment from the environment. This paper proposes some suggestions to solve the problems.

Dependence of Adaptive Cross-correlation Algorithm Performance on the Extended Scene Image Quality

NASA Technical Reports Server (NTRS)

Sidick, Erkin

2008-01-01

Recently, we reported an adaptive cross-correlation (ACC) algorithm to estimate with high accuracy the shift as large as several pixels between two extended-scene sub-images captured by a Shack-Hartmann wavefront sensor. It determines the positions of all extended-scene image cells relative to a reference cell in the same frame using an FFT-based iterative image-shifting algorithm. It works with both point-source spot images as well as extended scene images. We have demonstrated previously based on some measured images that the ACC algorithm can determine image shifts with as high an accuracy as 0.01 pixel for shifts as large 3 pixels, and yield similar results for both point source spot images and extended scene images. The shift estimate accuracy of the ACC algorithm depends on illumination level, background, and scene content in addition to the amount of the shift between two image cells. In this paper we investigate how the performance of the ACC algorithm depends on the quality and the frequency content of extended scene images captured by a Shack-Hatmann camera. We also compare the performance of the ACC algorithm with those of several other approaches, and introduce a failsafe criterion for the ACC algorithm-based extended scene Shack-Hatmann sensors.

Adaptive Residual Interpolation for Color and Multispectral Image Demosaicking †

PubMed Central

Kiku, Daisuke; Okutomi, Masatoshi

2017-01-01

Color image demosaicking for the Bayer color filter array is an essential image processing operation for acquiring high-quality color images. Recently, residual interpolation (RI)-based algorithms have demonstrated superior demosaicking performance over conventional color difference interpolation-based algorithms. In this paper, we propose adaptive residual interpolation (ARI) that improves existing RI-based algorithms by adaptively combining two RI-based algorithms and selecting a suitable iteration number at each pixel. These are performed based on a unified criterion that evaluates the validity of an RI-based algorithm. Experimental comparisons using standard color image datasets demonstrate that ARI can improve existing RI-based algorithms by more than 0.6 dB in the color peak signal-to-noise ratio and can outperform state-of-the-art algorithms based on training images. We further extend ARI for a multispectral filter array, in which more than three spectral bands are arrayed, and demonstrate that ARI can achieve state-of-the-art performance also for the task of multispectral image demosaicking. PMID:29194407

A hybrid linear/nonlinear training algorithm for feedforward neural networks.

PubMed

McLoone, S; Brown, M D; Irwin, G; Lightbody, A

1998-01-01

This paper presents a new hybrid optimization strategy for training feedforward neural networks. The algorithm combines gradient-based optimization of nonlinear weights with singular value decomposition (SVD) computation of linear weights in one integrated routine. It is described for the multilayer perceptron (MLP) and radial basis function (RBF) networks and then extended to the local model network (LMN), a new feedforward structure in which a global nonlinear model is constructed from a set of locally valid submodels. Simulation results are presented demonstrating the superiority of the new hybrid training scheme compared to second-order gradient methods. It is particularly effective for the LMN architecture where the linear to nonlinear parameter ratio is large.

Current Practice in Designing Training for Complex Skills: Implications for Design and Evaluation of ADAPT[IT].

ERIC Educational Resources Information Center

Eseryel, Deniz; Schuver-van Blanken, Marian J.; Spector, J. Michael

ADAPT[IT] (Advanced Design Approach for Personalized Training-Interactive Tools is a European project coordinated by the Dutch National Aerospace Laboratory. The aim of ADAPT[IT] is to create and validate an effective training design methodology, based on cognitive science and leading to the integration of advanced technologies, so that the…

Robust fundamental frequency estimation in sustained vowels: Detailed algorithmic comparisons and information fusion with adaptive Kalman filtering

PubMed Central

Tsanas, Athanasios; Zañartu, Matías; Little, Max A.; Fox, Cynthia; Ramig, Lorraine O.; Clifford, Gari D.

2014-01-01

There has been consistent interest among speech signal processing researchers in the accurate estimation of the fundamental frequency (F0) of speech signals. This study examines ten F0 estimation algorithms (some well-established and some proposed more recently) to determine which of these algorithms is, on average, better able to estimate F0 in the sustained vowel /a/. Moreover, a robust method for adaptively weighting the estimates of individual F0 estimation algorithms based on quality and performance measures is proposed, using an adaptive Kalman filter (KF) framework. The accuracy of the algorithms is validated using (a) a database of 117 synthetic realistic phonations obtained using a sophisticated physiological model of speech production and (b) a database of 65 recordings of human phonations where the glottal cycles are calculated from electroglottograph signals. On average, the sawtooth waveform inspired pitch estimator and the nearly defect-free algorithms provided the best individual F0 estimates, and the proposed KF approach resulted in a ∼16% improvement in accuracy over the best single F0 estimation algorithm. These findings may be useful in speech signal processing applications where sustained vowels are used to assess vocal quality, when very accurate F0 estimation is required. PMID:24815269

Adaptive Training Considerations for Use in Simulation-Based Systems

DTIC Science & Technology

2010-09-01

their rulings were given and three cases were used for both the pretest and posttest . In the fully adaptive condition, the number of instances...Mercado Anthony J. Aakre KAEGAN Corporation NAVAL AIR WARFARE CENTER TRAINING SYSTEMS DIVISION 12350 Research Parkway Orlando, FL, 32826-3275...Engineering Director, Research & Technology Division Department Special Report 2010-001 2

Neuromuscular adaptations to 4 weeks of intensive drop jump training in well-trained athletes

PubMed Central

Alkjaer, Tine; Meyland, Jacob; Raffalt, Peter C; Lundbye-Jensen, Jesper; Simonsen, Erik B

2013-01-01

This study examined the effects of 4 weeks of intensive drop jump training in well-trained athletes on jumping performance and underlying changes in biomechanics and neuromuscular adaptations. Nine well-trained athletes at high national competition level within sprinting and jumping disciplines participated in the study. The training was supervised and augmented feedback on performance was used to ensure maximal training intensity. The drop jumps were performed with minimal contact time and maximal jumping height. Assessment of performance during training showed effects of motor learning. Before and after the training intervention maximal isometric muscle strength, the biomechanics, muscle activity pattern of the lower extremities and the soleus H-reflex and V-wave during drop jumping were measured. Maximal jump height and performance index (PI) defined as jumping height divided by contact time improved significantly by 11.9% (P = 0.024) and 16.2% (P = 0.009), respectively. Combined ankle and knee joint peak power was significantly increased by 7% after training (P = 0.047). The preactivity in the soleus muscle decreased 16% (P = 0.015). The soleus H-reflex was unchanged after training, while the soleus V-wave increased significantly at 45 msec after touchdown. This may indicate an increased drive to the α-motor neuron pool following training. Muscle strength parameters were unaffected by the training. The results demonstrate that 4 weeks of intensive drop jump training can improve jumping performance also in well-trained athletes without concomitant changes in muscle strength. It is suggested that the behavioral improvement is primarily due to neural factors regulating the activation pattern controlling the drop jump movement. PMID:24303171

Neuroprosthetic Decoder Training as Imitation Learning.

PubMed

Merel, Josh; Carlson, David; Paninski, Liam; Cunningham, John P

2016-05-01

Neuroprosthetic brain-computer interfaces function via an algorithm which decodes neural activity of the user into movements of an end effector, such as a cursor or robotic arm. In practice, the decoder is often learned by updating its parameters while the user performs a task. When the user's intention is not directly observable, recent methods have demonstrated value in training the decoder against a surrogate for the user's intended movement. Here we show that training a decoder in this way is a novel variant of an imitation learning problem, where an oracle or expert is employed for supervised training in lieu of direct observations, which are not available. Specifically, we describe how a generic imitation learning meta-algorithm, dataset aggregation (DAgger), can be adapted to train a generic brain-computer interface. By deriving existing learning algorithms for brain-computer interfaces in this framework, we provide a novel analysis of regret (an important metric of learning efficacy) for brain-computer interfaces. This analysis allows us to characterize the space of algorithmic variants and bounds on their regret rates. Existing approaches for decoder learning have been performed in the cursor control setting, but the available design principles for these decoders are such that it has been impossible to scale them to naturalistic settings. Leveraging our findings, we then offer an algorithm that combines imitation learning with optimal control, which should allow for training of arbitrary effectors for which optimal control can generate goal-oriented control. We demonstrate this novel and general BCI algorithm with simulated neuroprosthetic control of a 26 degree-of-freedom model of an arm, a sophisticated and realistic end effector.

Neuroprosthetic Decoder Training as Imitation Learning

PubMed Central

Merel, Josh; Paninski, Liam; Cunningham, John P.

2016-01-01

Neuroprosthetic brain-computer interfaces function via an algorithm which decodes neural activity of the user into movements of an end effector, such as a cursor or robotic arm. In practice, the decoder is often learned by updating its parameters while the user performs a task. When the user’s intention is not directly observable, recent methods have demonstrated value in training the decoder against a surrogate for the user’s intended movement. Here we show that training a decoder in this way is a novel variant of an imitation learning problem, where an oracle or expert is employed for supervised training in lieu of direct observations, which are not available. Specifically, we describe how a generic imitation learning meta-algorithm, dataset aggregation (DAgger), can be adapted to train a generic brain-computer interface. By deriving existing learning algorithms for brain-computer interfaces in this framework, we provide a novel analysis of regret (an important metric of learning efficacy) for brain-computer interfaces. This analysis allows us to characterize the space of algorithmic variants and bounds on their regret rates. Existing approaches for decoder learning have been performed in the cursor control setting, but the available design principles for these decoders are such that it has been impossible to scale them to naturalistic settings. Leveraging our findings, we then offer an algorithm that combines imitation learning with optimal control, which should allow for training of arbitrary effectors for which optimal control can generate goal-oriented control. We demonstrate this novel and general BCI algorithm with simulated neuroprosthetic control of a 26 degree-of-freedom model of an arm, a sophisticated and realistic end effector. PMID:27191387

On adaptive learning rate that guarantees convergence in feedforward networks.

PubMed

Behera, Laxmidhar; Kumar, Swagat; Patnaik, Awhan

2006-09-01

This paper investigates new learning algorithms (LF I and LF II) based on Lyapunov function for the training of feedforward neural networks. It is observed that such algorithms have interesting parallel with the popular backpropagation (BP) algorithm where the fixed learning rate is replaced by an adaptive learning rate computed using convergence theorem based on Lyapunov stability theory. LF II, a modified version of LF I, has been introduced with an aim to avoid local minima. This modification also helps in improving the convergence speed in some cases. Conditions for achieving global minimum for these kind of algorithms have been studied in detail. The performances of the proposed algorithms are compared with BP algorithm and extended Kalman filtering (EKF) on three bench-mark function approximation problems: XOR, 3-bit parity, and 8-3 encoder. The comparisons are made in terms of number of learning iterations and computational time required for convergence. It is found that the proposed algorithms (LF I and II) are much faster in convergence than other two algorithms to attain same accuracy. Finally, the comparison is made on a complex two-dimensional (2-D) Gabor function and effect of adaptive learning rate for faster convergence is verified. In a nutshell, the investigations made in this paper help us better understand the learning procedure of feedforward neural networks in terms of adaptive learning rate, convergence speed, and local minima.

Design of infrasound-detection system via adaptive LMSTDE algorithm

NASA Technical Reports Server (NTRS)

Khalaf, C. S.; Stoughton, J. W.

1984-01-01

A proposed solution to an aviation safety problem is based on passive detection of turbulent weather phenomena through their infrasonic emission. This thesis describes a system design that is adequate for detection and bearing evaluation of infrasounds. An array of four sensors, with the appropriate hardware, is used for the detection part. Bearing evaluation is based on estimates of time delays between sensor outputs. The generalized cross correlation (GCC), as the conventional time-delay estimation (TDE) method, is first reviewed. An adaptive TDE approach, using the least mean square (LMS) algorithm, is then discussed. A comparison between the two techniques is made and the advantages of the adaptive approach are listed. The behavior of the GCC, as a Roth processor, is examined for the anticipated signals. It is shown that the Roth processor has the desired effect of sharpening the peak of the correlation function. It is also shown that the LMSTDE technique is an equivalent implementation of the Roth processor in the time domain. A LMSTDE lead-lag model, with a variable stability coefficient and a convergence criterion, is designed.

Complexity control algorithm based on adaptive mode selection for interframe coding in high efficiency video coding

NASA Astrophysics Data System (ADS)

Chen, Gang; Yang, Bing; Zhang, Xiaoyun; Gao, Zhiyong

2017-07-01

The latest high efficiency video coding (HEVC) standard significantly increases the encoding complexity for improving its coding efficiency. Due to the limited computational capability of handheld devices, complexity constrained video coding has drawn great attention in recent years. A complexity control algorithm based on adaptive mode selection is proposed for interframe coding in HEVC. Considering the direct proportionality between encoding time and computational complexity, the computational complexity is measured in terms of encoding time. First, complexity is mapped to a target in terms of prediction modes. Then, an adaptive mode selection algorithm is proposed for the mode decision process. Specifically, the optimal mode combination scheme that is chosen through offline statistics is developed at low complexity. If the complexity budget has not been used up, an adaptive mode sorting method is employed to further improve coding efficiency. The experimental results show that the proposed algorithm achieves a very large complexity control range (as low as 10%) for the HEVC encoder while maintaining good rate-distortion performance. For the lowdelayP condition, compared with the direct resource allocation method and the state-of-the-art method, an average gain of 0.63 and 0.17 dB in BDPSNR is observed for 18 sequences when the target complexity is around 40%.

Adaptive Working Memory Training Reduces the Negative Impact of Anxiety on Competitive Motor Performance.

PubMed

Ducrocq, Emmanuel; Wilson, Mark; Smith, Tim J; Derakshan, Nazanin

2017-12-01

Optimum levels of attentional control are essential to prevent athletes from experiencing performance breakdowns under pressure. The current study explored whether training attentional control using the adaptive dual n-back paradigm, designed to directly target processing efficiency of the main executive functions of working memory (WM), would result in transferrable effects on sports performance outcomes. A total of 30 tennis players were allocated to an adaptive WM training or active control group and underwent 10 days of training. Measures of WM capacity as well as performance and objective gaze indices of attentional control in a tennis volley task were assessed in low- and high-pressure posttraining conditions. Results revealed significant benefits of training on WM capacity, quiet eye offset, and tennis performance in the high-pressure condition. Our results confirm and extend previous findings supporting the transfer of cognitive training benefits to objective measures of sports performance under pressure.

Finite element analysis and genetic algorithm optimization design for the actuator placement on a large adaptive structure

NASA Astrophysics Data System (ADS)

Sheng, Lizeng

The dissertation focuses on one of the major research needs in the area of adaptive/intelligent/smart structures, the development and application of finite element analysis and genetic algorithms for optimal design of large-scale adaptive structures. We first review some basic concepts in finite element method and genetic algorithms, along with the research on smart structures. Then we propose a solution methodology for solving a critical problem in the design of a next generation of large-scale adaptive structures---optimal placements of a large number of actuators to control thermal deformations. After briefly reviewing the three most frequently used general approaches to derive a finite element formulation, the dissertation presents techniques associated with general shell finite element analysis using flat triangular laminated composite elements. The element used here has three nodes and eighteen degrees of freedom and is obtained by combining a triangular membrane element and a triangular plate bending element. The element includes the coupling effect between membrane deformation and bending deformation. The membrane element is derived from the linear strain triangular element using Cook's transformation. The discrete Kirchhoff triangular (DKT) element is used as the plate bending element. For completeness, a complete derivation of the DKT is presented. Geometrically nonlinear finite element formulation is derived for the analysis of adaptive structures under the combined thermal and electrical loads. Next, we solve the optimization problems of placing a large number of piezoelectric actuators to control thermal distortions in a large mirror in the presence of four different thermal loads. We then extend this to a multi-objective optimization problem of determining only one set of piezoelectric actuator locations that can be used to control the deformation in the same mirror under the action of any one of the four thermal loads. A series of genetic algorithms

Methodology: Adapting the 'Training and Visit' System to Population Programmes.

ERIC Educational Resources Information Center

Asian-Pacific Population Programme News, 1985

1985-01-01

Provides suggestions for adapting the "training and visit" (T&V) system to population programs. Summarizes six main elements of a T&V system for population, health, and nutrition programs and describes four principles of agricultural extension programs. Implications of this process are also reviewed. (ML)

Second-order sliding mode controller with model reference adaptation for automatic train operation

NASA Astrophysics Data System (ADS)

Ganesan, M.; Ezhilarasi, D.; Benni, Jijo

2017-11-01

In this paper, a new approach to model reference based adaptive second-order sliding mode control together with adaptive state feedback is presented to control the longitudinal dynamic motion of a high speed train for automatic train operation with the objective of minimal jerk travel by the passengers. The nonlinear dynamic model for the longitudinal motion of the train comprises of a locomotive and coach subsystems is constructed using multiple point-mass model by considering the forces acting on the vehicle. An adaptation scheme using Lyapunov criterion is derived to tune the controller gains by considering a linear, stable reference model that ensures the stability of the system in closed loop. The effectiveness of the controller tracking performance is tested under uncertain passenger load, coupler-draft gear parameters, propulsion resistance coefficients variations and environmental disturbances due to side wind and wet rail conditions. The results demonstrate improved tracking performance of the proposed control scheme with a least jerk under maximum parameter uncertainties when compared to constant gain second-order sliding mode control.

The Optimization of Trained and Untrained Image Classification Algorithms for Use on Large Spatial Datasets

NASA Technical Reports Server (NTRS)

Kocurek, Michael J.

2005-01-01

The HARVIST project seeks to automatically provide an accurate, interactive interface to predict crop yield over the entire United States. In order to accomplish this goal, large images must be quickly and automatically classified by crop type. Current trained and untrained classification algorithms, while accurate, are highly inefficient when operating on large datasets. This project sought to develop new variants of two standard trained and untrained classification algorithms that are optimized to take advantage of the spatial nature of image data. The first algorithm, harvist-cluster, utilizes divide-and-conquer techniques to precluster an image in the hopes of increasing overall clustering speed. The second algorithm, harvistSVM, utilizes support vector machines (SVMs), a type of trained classifier. It seeks to increase classification speed by applying a "meta-SVM" to a quick (but inaccurate) SVM to approximate a slower, yet more accurate, SVM. Speedups were achieved by tuning the algorithm to quickly identify when the quick SVM was incorrect, and then reclassifying low-confidence pixels as necessary. Comparing the classification speeds of both algorithms to known baselines showed a slight speedup for large values of k (the number of clusters) for harvist-cluster, and a significant speedup for harvistSVM. Future work aims to automate the parameter tuning process required for harvistSVM, and further improve classification accuracy and speed. Additionally, this research will move documents created in Canvas into ArcGIS. The launch of the Mars Reconnaissance Orbiter (MRO) will provide a wealth of image data such as global maps of Martian weather and high resolution global images of Mars. The ability to store this new data in a georeferenced format will support future Mars missions by providing data for landing site selection and the search for water on Mars.

Using patient-specific phantoms to evaluate deformable image registration algorithms for adaptive radiation therapy

PubMed Central

Stanley, Nick; Glide-Hurst, Carri; Kim, Jinkoo; Adams, Jeffrey; Li, Shunshan; Wen, Ning; Chetty, Indrin J.; Zhong, Hualiang

2014-01-01

The quality of adaptive treatment planning depends on the accuracy of its underlying deformable image registration (DIR). The purpose of this study is to evaluate the performance of two DIR algorithms, B-spline–based deformable multipass (DMP) and deformable demons (Demons), implemented in a commercial software package. Evaluations were conducted using both computational and physical deformable phantoms. Based on a finite element method (FEM), a total of 11 computational models were developed from a set of CT images acquired from four lung and one prostate cancer patients. FEM generated displacement vector fields (DVF) were used to construct the lung and prostate image phantoms. Based on a fast-Fourier transform technique, image noise power spectrum was incorporated into the prostate image phantoms to create simulated CBCT images. The FEM-DVF served as a gold standard for verification of the two registration algorithms performed on these phantoms. The registration algorithms were also evaluated at the homologous points quantified in the CT images of a physical lung phantom. The results indicated that the mean errors of the DMP algorithm were in the range of 1.0 ~ 3.1 mm for the computational phantoms and 1.9 mm for the physical lung phantom. For the computational prostate phantoms, the corresponding mean error was 1.0–1.9 mm in the prostate, 1.9–2.4 mm in the rectum, and 1.8–2.1 mm over the entire patient body. Sinusoidal errors induced by B-spline interpolations were observed in all the displacement profiles of the DMP registrations. Regions of large displacements were observed to have more registration errors. Patient-specific FEM models have been developed to evaluate the DIR algorithms implemented in the commercial software package. It has been found that the accuracy of these algorithms is patient-dependent and related to various factors including tissue deformation magnitudes and image intensity gradients across the regions of interest. This may

Experiment on a three-beam adaptive array for EHF frequency-hopped signals using a fast algorithm, phase E

NASA Astrophysics Data System (ADS)

Yen, J. L.; Kremer, P.; Fung, J.

1990-05-01

The Department of National Defence (Canada) has been conducting studies into multi-beam adaptive arrays for extremely high frequency (EHF) frequency hopped signals. A three-beam 43 GHz adaptive antenna and a beam control processor is under development. An interactive software package for the operation of the array, capable of applying different control algorithms is being written. A maximum signal to jammer plus noise ratio (SJNR) has been found to provide superior performance in preventing degradation of user signals in the presence of nearby jammers. A new fast algorithm using a modified conjugate gradient approach has been found to be a very efficient way to implement anti-jamming arrays based on maximum SJNR criterion. The present study was intended to refine and simplify this algorithm and to implement the algorithm on an experimental array for real-time evaluation of anti-jamming performance. A three-beam adaptive array was used. A simulation package was used in the evaluation of multi-beam systems using more than three beams and different user-jammer scenarios. An attempt to further reduce the computation burden through further analysis of maximum SJNR met with limited success. The investigation of a new angle detector for spatial tracking in heterodyne laser space communications was completed.

Adaptation to novel foreign-accented speech and retention of benefit following training: Influence of aging and hearing loss

PubMed Central

Bieber, Rebecca E.; Gordon-Salant, Sandra

2017-01-01

Adaptation to speech with a foreign accent is possible through prior exposure to talkers with that same accent. For young listeners with normal hearing, short term, accent-independent adaptation to a novel foreign accent is also facilitated through exposure training with multiple foreign accents. In the present study, accent-independent adaptation is examined in younger and older listeners with normal hearing and older listeners with hearing loss. Retention of training benefit is additionally explored. Stimuli for testing and training were HINT sentences recorded by talkers with nine distinctly different accents. Following two training sessions, all listener groups showed a similar increase in speech perception for a novel foreign accent. While no group retained this benefit at one week post-training, results of a secondary reaction time task revealed a decrease in reaction time following training, suggesting reduced listening effort. Examination of listeners' cognitive skills reveals a positive relationship between working memory and speech recognition ability. The present findings indicate that, while this no-feedback training paradigm for foreign-accented English is successful in promoting short term adaptation for listeners, this paradigm is not sufficient in facilitation of perceptual learning with lasting benefits for younger or older listeners. PMID:28464671

Training adaptation and heart rate variability in elite endurance athletes: opening the door to effective monitoring.

PubMed

Plews, Daniel J; Laursen, Paul B; Stanley, Jamie; Kilding, Andrew E; Buchheit, Martin

2013-09-01

The measurement of heart rate variability (HRV) is often considered a convenient non-invasive assessment tool for monitoring individual adaptation to training. Decreases and increases in vagal-derived indices of HRV have been suggested to indicate negative and positive adaptations, respectively, to endurance training regimens. However, much of the research in this area has involved recreational and well-trained athletes, with the small number of studies conducted in elite athletes revealing equivocal outcomes. For example, in elite athletes, studies have revealed both increases and decreases in HRV to be associated with negative adaptation. Additionally, signs of positive adaptation, such as increases in cardiorespiratory fitness, have been observed with atypical concomitant decreases in HRV. As such, practical ways by which HRV can be used to monitor training status in elites are yet to be established. This article addresses the current literature that has assessed changes in HRV in response to training loads and the likely positive and negative adaptations shown. We reveal limitations with respect to how the measurement of HRV has been interpreted to assess positive and negative adaptation to endurance training regimens and subsequent physical performance. We offer solutions to some of the methodological issues associated with using HRV as a day-to-day monitoring tool. These include the use of appropriate averaging techniques, and the use of specific HRV indices to overcome the issue of HRV saturation in elite athletes (i.e., reductions in HRV despite decreases in resting heart rate). Finally, we provide examples in Olympic and World Champion athletes showing how these indices can be practically applied to assess training status and readiness to perform in the period leading up to a pinnacle event. The paper reveals how longitudinal HRV monitoring in elites is required to understand their unique individual HRV fingerprint. For the first time, we demonstrate how

Enhancing Cultural Adaptation through Friendship Training: A Single-Case Study.

ERIC Educational Resources Information Center

Liu, Yi-Ching; Baker, Stanley B.

1993-01-01

Four-year-old girl from mainland China experienced culture shock when attending American university day-care center. Counseling intern from Taiwan designed friendship training program based on assumptions concerning adaptation, acculturation, and peer relationships. Evaluated as intensive single-case study, findings indicated the program may be…

A new adaptive algorithm for automated feature extraction in exponentially damped signals for health monitoring of smart structures

NASA Astrophysics Data System (ADS)

Qarib, Hossein; Adeli, Hojjat

2015-12-01

In this paper authors introduce a new adaptive signal processing technique for feature extraction and parameter estimation in noisy exponentially damped signals. The iterative 3-stage method is based on the adroit integration of the strengths of parametric and nonparametric methods such as multiple signal categorization, matrix pencil, and empirical mode decomposition algorithms. The first stage is a new adaptive filtration or noise removal scheme. The second stage is a hybrid parametric-nonparametric signal parameter estimation technique based on an output-only system identification technique. The third stage is optimization of estimated parameters using a combination of the primal-dual path-following interior point algorithm and genetic algorithm. The methodology is evaluated using a synthetic signal and a signal obtained experimentally from transverse vibrations of a steel cantilever beam. The method is successful in estimating the frequencies accurately. Further, it estimates the damping exponents. The proposed adaptive filtration method does not include any frequency domain manipulation. Consequently, the time domain signal is not affected as a result of frequency domain and inverse transformations.

Making neurorehabilitation fun: Multiplayer training via damping forces balancing differences in skill levels.

PubMed

Baur, Kilian; Wolf, Peter; Riener, Robert; Duarte, Jaime E

2017-07-01

Multiplayer environments are thought to increase the training intensity in robot-aided rehabilitation therapy after stroke. We developed a haptic-based environment to investigate the dynamics of two-player training performing time-constrained reaching movements using the ARMin rehabilitation robot. We implemented a challenge level adaptation algorithm that controlled a virtual damping coefficient to reach a desired success rate. We tested the algorithm's effectiveness in regulating the success rate during game play in a simulation with computer-controlled players, in a feasibility study with six unimpaired players, and in a single session with one stroke patient. The algorithm demonstrated its capacity to adjust the damping coefficient to reach three levels of success rate (low [50%], moderate [70%], and high [90%]) during singleplayer and multiplayer training. For the patient - tested in single-player mode at the moderate success rate only - the algorithm showed also promising behavior. Results of the feasibility study showed that to increase the player's willingness to play at a more challenging task condition, the effect of the challenge level adaptation - regardless of being played in single player or multiplayer mode - might be more important than the provision of multiplayer setting alone. Furthermore, the multiplayer setting tends to be a motivating and encouraging therapy component. Based on these results we will optimize and expand the multiplayer training platform and further investigate multiplayer settings in stroke therapy.

Effects of arachidonic acid supplementation on training adaptations in resistance-trained males

PubMed Central

Roberts, Michael D; Iosia, Mike; Kerksick, Chad M; Taylor, Lem W; Campbell, Bill; Wilborn, Colin D; Harvey, Travis; Cooke, Matthew; Rasmussen, Chris; Greenwood, Mike; Wilson, Ronald; Jitomir, Jean; Willoughby, Darryn; Kreider, Richard B

2007-01-01

Background To determine the impact of AA supplementation during resistance training on body composition, training adaptations, and markers of muscle hypertrophy in resistance-trained males. Methods In a randomized and double blind manner, 31 resistance-trained male subjects (22.1 ± 5.0 years, 180 ± 0.1 cm, 86.1 ± 13.0 kg, 18.1 ± 6.4% body fat) ingested either a placebo (PLA: 1 g·day-1 corn oil, n = 16) or AA (AA: 1 g·day-1 AA, n = 15) while participating in a standardized 4 day·week-1 resistance training regimen. Fasting blood samples, body composition, bench press one-repetition maximum (1RM), leg press 1RM and Wingate anaerobic capacity sprint tests were completed after 0, 25, and 50 days of supplementation. Percutaneous muscle biopsies were taken from the vastus lateralis on days 0 and 50. Results Wingate relative peak power was significantly greater after 50 days of supplementation while the inflammatory cytokine IL-6 was significantly lower after 25 days of supplementation in the AA group. PGE2 levels tended to be greater in the AA group. However, no statistically significant differences were observed between groups in body composition, strength, anabolic and catabolic hormones, or markers of muscle hypertrophy (i.e. total protein content or MHC type I, IIa, and IIx protein content) and other intramuscular markers (i.e. FP and EP3 receptor density or MHC type I, IIa, and IIx mRNA expression). Conclusion AA supplementation during resistance-training may enhance anaerobic capacity and lessen the inflammatory response to training. However, AA supplementation did not promote statistically greater gains in strength, muscle mass, or influence markers of muscle hypertrophy. PMID:18045476

Modified artificial fish school algorithm for free space optical communication with sensor-less adaptive optics system

NASA Astrophysics Data System (ADS)

Cao, Jingtai; Zhao, Xiaohui; Li, Zhaokun; Liu, Wei; Gu, Haijun

2017-11-01

The performance of free space optical (FSO) communication system is limited by atmospheric turbulent extremely. Adaptive optics (AO) is the significant method to overcome the atmosphere disturbance. Especially, for the strong scintillation effect, the sensor-less AO system plays a major role for compensation. In this paper, a modified artificial fish school (MAFS) algorithm is proposed to compensate the aberrations in the sensor-less AO system. Both the static and dynamic aberrations compensations are analyzed and the performance of FSO communication before and after aberrations compensations is compared. In addition, MAFS algorithm is compared with artificial fish school (AFS) algorithm, stochastic parallel gradient descent (SPGD) algorithm and simulated annealing (SA) algorithm. It is shown that the MAFS algorithm has a higher convergence speed than SPGD algorithm and SA algorithm, and reaches the better convergence value than AFS algorithm, SPGD algorithm and SA algorithm. The sensor-less AO system with MAFS algorithm effectively increases the coupling efficiency at the receiving terminal with fewer numbers of iterations. In conclusion, the MAFS algorithm has great significance for sensor-less AO system to compensate atmospheric turbulence in FSO communication system.

Evolving RBF neural networks for adaptive soft-sensor design.

PubMed

Alexandridis, Alex

2013-12-01

This work presents an adaptive framework for building soft-sensors based on radial basis function (RBF) neural network models. The adaptive fuzzy means algorithm is utilized in order to evolve an RBF network, which approximates the unknown system based on input-output data from it. The methodology gradually builds the RBF network model, based on two separate levels of adaptation: On the first level, the structure of the hidden layer is modified by adding or deleting RBF centers, while on the second level, the synaptic weights are adjusted with the recursive least squares with exponential forgetting algorithm. The proposed approach is tested on two different systems, namely a simulated nonlinear DC Motor and a real industrial reactor. The results show that the produced soft-sensors can be successfully applied to model the two nonlinear systems. A comparison with two different adaptive modeling techniques, namely a dynamic evolving neural-fuzzy inference system (DENFIS) and neural networks trained with online backpropagation, highlights the advantages of the proposed methodology.

Stress inoculation training supported by physiology-driven adaptive virtual reality stimulation.

PubMed

Popović, Sinisa; Horvat, Marko; Kukolja, Davor; Dropuljić, Branimir; Cosić, Kresimir

2009-01-01

Significant proportion of psychological problems related to combat stress in recent large peacekeeping operations underscores importance of effective methods for strengthening the stress resistance of military personnel. Adaptive control of virtual reality (VR) stimulation, based on estimation of the subject's emotional state from physiological signals, may enhance existing stress inoculation training (SIT). Physiology-driven adaptive VR stimulation can tailor the progress of stressful stimuli delivery to the physiological characteristics of each individual, which is indicated for improvement in stress resistance. Therefore, following an overview of SIT and its applications in the military setting, generic concept of physiology-driven adaptive VR stimulation is presented in the paper. Toward the end of the paper, closed-loop adaptive control strategy applicable to SIT is outlined.

FPGA implementation of ICA algorithm for blind signal separation and adaptive noise canceling.

PubMed

Kim, Chang-Min; Park, Hyung-Min; Kim, Taesu; Choi, Yoon-Kyung; Lee, Soo-Young

2003-01-01

An field programmable gate array (FPGA) implementation of independent component analysis (ICA) algorithm is reported for blind signal separation (BSS) and adaptive noise canceling (ANC) in real time. In order to provide enormous computing power for ICA-based algorithms with multipath reverberation, a special digital processor is designed and implemented in FPGA. The chip design fully utilizes modular concept and several chips may be put together for complex applications with a large number of noise sources. Experimental results with a fabricated test board are reported for ANC only, BSS only, and simultaneous ANC/BSS, which demonstrates successful speech enhancement in real environments in real time.

Adaptive Inferential Feedback Partner Training for Depression: A Pilot Study

ERIC Educational Resources Information Center

Dobkin, Roseanne DeFronzo; Allen, Lesley A.; Alloy, Lauren B.; Menza, Matthew; Gara, Michael A.; Panzarella, Catherine

2007-01-01

Adaptive inferential feedback (AIF) partner training is a cognitive technique that teaches the friends and family members of depressed patients to respond to the patients' dysfunctional thoughts in a targeted manner. These dysfunctional attributions, which AIF addresses, are a common residual feature of depression amongst remitted patients, and…

An adaptive multi-level simulation algorithm for stochastic biological systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lester, C., E-mail: lesterc@maths.ox.ac.uk; Giles, M. B.; Baker, R. E.

2015-01-14

Discrete-state, continuous-time Markov models are widely used in the modeling of biochemical reaction networks. Their complexity often precludes analytic solution, and we rely on stochastic simulation algorithms (SSA) to estimate system statistics. The Gillespie algorithm is exact, but computationally costly as it simulates every single reaction. As such, approximate stochastic simulation algorithms such as the tau-leap algorithm are often used. Potentially computationally more efficient, the system statistics generated suffer from significant bias unless tau is relatively small, in which case the computational time can be comparable to that of the Gillespie algorithm. The multi-level method [Anderson and Higham, “Multi-level Montemore » Carlo for continuous time Markov chains, with applications in biochemical kinetics,” SIAM Multiscale Model. Simul. 10(1), 146–179 (2012)] tackles this problem. A base estimator is computed using many (cheap) sample paths at low accuracy. The bias inherent in this estimator is then reduced using a number of corrections. Each correction term is estimated using a collection of paired sample paths where one path of each pair is generated at a higher accuracy compared to the other (and so more expensive). By sharing random variables between these paired paths, the variance of each correction estimator can be reduced. This renders the multi-level method very efficient as only a relatively small number of paired paths are required to calculate each correction term. In the original multi-level method, each sample path is simulated using the tau-leap algorithm with a fixed value of τ. This approach can result in poor performance when the reaction activity of a system changes substantially over the timescale of interest. By introducing a novel adaptive time-stepping approach where τ is chosen according to the stochastic behaviour of each sample path, we extend the applicability of the multi-level method to such cases. We

Effect of speed endurance and strength training on performance, running economy and muscular adaptations in endurance-trained runners.

PubMed

Vorup, Jacob; Tybirk, Jonas; Gunnarsson, Thomas P; Ravnholt, Tanja; Dalsgaard, Sarah; Bangsbo, Jens

2016-07-01

To investigate the effects of combined strength and speed endurance (SE) training along with a reduced training volume on performance, running economy and muscular adaptations in endurance-trained runners. Sixteen male endurance runners (VO2-max: ~60 ml kg(-1) min(-1)) were randomly assigned to either a combined strength and SE training (CSS; n = 9) or a control (CON; n = 7) group. For 8 weeks, CSS replaced their normal moderate-intensity training (~63 km week(-1)) with SE (2 × week(-1)) and strength training (2 × week(-1)) as well as aerobic high (1 × week(-1)) and moderate (1 × week(-1)) intensity training with a reduction in total volume of ~58 %, whereas CON continued their training (~45 km week(-1)). In CSS, 400-m and Yo-Yo intermittent recovery test performance was improved by 5 % (P < 0.01) and 19 % (P < 0.001), respectively, during the intervention period. Maximal aerobic speed was 0.6 km h(-1) higher (P < 0.05), and maximal activity of lactate dehydrogenase subunits 1 and 2 was 17 % (P < 0.05) higher after compared to before the intervention period. Time to exhaustion and peak blood lactate during an incremental treadmill test was 9 % (P < 0.05) and 32 % (P < 0.01), respectively, higher and expression of Na(+)-K(+) pump β1 subunit was 15 % higher (P < 0.05) after compared to before the intervention period. 10-K performance, maximum oxygen uptake and running economy were unchanged. In CON, no changes were observed. Adding strength and speed endurance training, along with a reduced training volume, can improve short-term exercise capacity and induce muscular adaptations related to anaerobic capacity in endurance-trained runners.

Improved Adaptive LSB Steganography Based on Chaos and Genetic Algorithm

NASA Astrophysics Data System (ADS)

Yu, Lifang; Zhao, Yao; Ni, Rongrong; Li, Ting

2010-12-01

We propose a novel steganographic method in JPEG images with high performance. Firstly, we propose improved adaptive LSB steganography, which can achieve high capacity while preserving the first-order statistics. Secondly, in order to minimize visual degradation of the stego image, we shuffle bits-order of the message based on chaos whose parameters are selected by the genetic algorithm. Shuffling message's bits-order provides us with a new way to improve the performance of steganography. Experimental results show that our method outperforms classical steganographic methods in image quality, while preserving characteristics of histogram and providing high capacity.

A Large-Scale Multi-Hop Localization Algorithm Based on Regularized Extreme Learning for Wireless Networks.

PubMed

Zheng, Wei; Yan, Xiaoyong; Zhao, Wei; Qian, Chengshan

2017-12-20

A novel large-scale multi-hop localization algorithm based on regularized extreme learning is proposed in this paper. The large-scale multi-hop localization problem is formulated as a learning problem. Unlike other similar localization algorithms, the proposed algorithm overcomes the shortcoming of the traditional algorithms which are only applicable to an isotropic network, therefore has a strong adaptability to the complex deployment environment. The proposed algorithm is composed of three stages: data acquisition, modeling and location estimation. In data acquisition stage, the training information between nodes of the given network is collected. In modeling stage, the model among the hop-counts and the physical distances between nodes is constructed using regularized extreme learning. In location estimation stage, each node finds its specific location in a distributed manner. Theoretical analysis and several experiments show that the proposed algorithm can adapt to the different topological environments with low computational cost. Furthermore, high accuracy can be achieved by this method without setting complex parameters.

Six weeks of a polarized training-intensity distribution leads to greater physiological and performance adaptations than a threshold model in trained cyclists.

PubMed

Neal, Craig M; Hunter, Angus M; Brennan, Lorraine; O'Sullivan, Aifric; Hamilton, D Lee; De Vito, Giuseppe; Galloway, Stuart D R

2013-02-15

This study was undertaken to investigate physiological adaptation with two endurance-training periods differing in intensity distribution. In a randomized crossover fashion, separated by 4 wk of detraining, 12 male cyclists completed two 6-wk training periods: 1) a polarized model [6.4 (±1.4 SD) h/wk; 80%, 0%, and 20% of training time in low-, moderate-, and high-intensity zones, respectively]; and 2) a threshold model [7.5 (±2.0 SD) h/wk; 57%, 43%, and 0% training-intensity distribution]. Before and after each training period, following 2 days of diet and exercise control, fasted skeletal muscle biopsies were obtained for mitochondrial enzyme activity and monocarboxylate transporter (MCT) 1 and 4 expression, and morning first-void urine samples were collected for NMR spectroscopy-based metabolomics analysis. Endurance performance (40-km time trial), incremental exercise, peak power output (PPO), and high-intensity exercise capacity (95% maximal work rate to exhaustion) were also assessed. Endurance performance, PPOs, lactate threshold (LT), MCT4, and high-intensity exercise capacity all increased over both training periods. Improvements were greater following polarized rather than threshold for PPO [mean (±SE) change of 8 (±2)% vs. 3 (±1)%, P < 0.05], LT [9 (±3)% vs. 2 (±4)%, P < 0.05], and high-intensity exercise capacity [85 (±14)% vs. 37 (±14)%, P < 0.05]. No changes in mitochondrial enzyme activities or MCT1 were observed following training. A significant multilevel, partial least squares-discriminant analysis model was obtained for the threshold model but not the polarized model in the metabolomics analysis. A polarized training distribution results in greater systemic adaptation over 6 wk in already well-trained cyclists. Markers of muscle metabolic adaptation are largely unchanged, but metabolomics markers suggest different cellular metabolic stress that requires further investigation.

A content-boosted collaborative filtering algorithm for personalized training in interpretation of radiological imaging.

PubMed

Lin, Hongli; Yang, Xuedong; Wang, Weisheng

2014-08-01

Devising a method that can select cases based on the performance levels of trainees and the characteristics of cases is essential for developing a personalized training program in radiology education. In this paper, we propose a novel hybrid prediction algorithm called content-boosted collaborative filtering (CBCF) to predict the difficulty level of each case for each trainee. The CBCF utilizes a content-based filtering (CBF) method to enhance existing trainee-case ratings data and then provides final predictions through a collaborative filtering (CF) algorithm. The CBCF algorithm incorporates the advantages of both CBF and CF, while not inheriting the disadvantages of either. The CBCF method is compared with the pure CBF and pure CF approaches using three datasets. The experimental data are then evaluated in terms of the MAE metric. Our experimental results show that the CBCF outperforms the pure CBF and CF methods by 13.33 and 12.17 %, respectively, in terms of prediction precision. This also suggests that the CBCF can be used in the development of personalized training systems in radiology education.

A dynamic fuzzy genetic algorithm for natural image segmentation using adaptive mean shift

NASA Astrophysics Data System (ADS)

Arfan Jaffar, M.

2017-01-01

In this paper, a colour image segmentation approach based on hybridisation of adaptive mean shift (AMS), fuzzy c-mean and genetic algorithms (GAs) is presented. Image segmentation is the perceptual faction of pixels based on some likeness measure. GA with fuzzy behaviour is adapted to maximise the fuzzy separation and minimise the global compactness among the clusters or segments in spatial fuzzy c-mean (sFCM). It adds diversity to the search process to find the global optima. A simple fusion method has been used to combine the clusters to overcome the problem of over segmentation. The results show that our technique outperforms state-of-the-art methods.

A Fiber Bragg Grating Interrogation System with Self-Adaption Threshold Peak Detection Algorithm.

PubMed

Zhang, Weifang; Li, Yingwu; Jin, Bo; Ren, Feifei; Wang, Hongxun; Dai, Wei

2018-04-08

A Fiber Bragg Grating (FBG) interrogation system with a self-adaption threshold peak detection algorithm is proposed and experimentally demonstrated in this study. This system is composed of a field programmable gate array (FPGA) and advanced RISC machine (ARM) platform, tunable Fabry-Perot (F-P) filter and optical switch. To improve system resolution, the F-P filter was employed. As this filter is non-linear, this causes the shifting of central wavelengths with the deviation compensated by the parts of the circuit. Time-division multiplexing (TDM) of FBG sensors is achieved by an optical switch, with the system able to realize the combination of 256 FBG sensors. The wavelength scanning speed of 800 Hz can be achieved by a FPGA+ARM platform. In addition, a peak detection algorithm based on a self-adaption threshold is designed and the peak recognition rate is 100%. Experiments with different temperatures were conducted to demonstrate the effectiveness of the system. Four FBG sensors were examined in the thermal chamber without stress. When the temperature changed from 0 °C to 100 °C, the degree of linearity between central wavelengths and temperature was about 0.999 with the temperature sensitivity being 10 pm/°C. The static interrogation precision was able to reach 0.5 pm. Through the comparison of different peak detection algorithms and interrogation approaches, the system was verified to have an optimum comprehensive performance in terms of precision, capacity and speed.

A Fiber Bragg Grating Interrogation System with Self-Adaption Threshold Peak Detection Algorithm

PubMed Central

Zhang, Weifang; Li, Yingwu; Jin, Bo; Ren, Feifei

2018-01-01

A Fiber Bragg Grating (FBG) interrogation system with a self-adaption threshold peak detection algorithm is proposed and experimentally demonstrated in this study. This system is composed of a field programmable gate array (FPGA) and advanced RISC machine (ARM) platform, tunable Fabry–Perot (F–P) filter and optical switch. To improve system resolution, the F–P filter was employed. As this filter is non-linear, this causes the shifting of central wavelengths with the deviation compensated by the parts of the circuit. Time-division multiplexing (TDM) of FBG sensors is achieved by an optical switch, with the system able to realize the combination of 256 FBG sensors. The wavelength scanning speed of 800 Hz can be achieved by a FPGA+ARM platform. In addition, a peak detection algorithm based on a self-adaption threshold is designed and the peak recognition rate is 100%. Experiments with different temperatures were conducted to demonstrate the effectiveness of the system. Four FBG sensors were examined in the thermal chamber without stress. When the temperature changed from 0 °C to 100 °C, the degree of linearity between central wavelengths and temperature was about 0.999 with the temperature sensitivity being 10 pm/°C. The static interrogation precision was able to reach 0.5 pm. Through the comparison of different peak detection algorithms and interrogation approaches, the system was verified to have an optimum comprehensive performance in terms of precision, capacity and speed. PMID:29642507

Implementation of a rapid correction algorithm for adaptive optics using a plenoptic sensor

NASA Astrophysics Data System (ADS)

Ko, Jonathan; Wu, Chensheng; Davis, Christopher C.

2016-09-01

Adaptive optics relies on the accuracy and speed of a wavefront sensor in order to provide quick corrections to distortions in the optical system. In weaker cases of atmospheric turbulence often encountered in astronomical fields, a traditional Shack-Hartmann sensor has proved to be very effective. However, in cases of stronger atmospheric turbulence often encountered near the surface of the Earth, atmospheric turbulence no longer solely causes small tilts in the wavefront. Instead, lasers passing through strong or "deep" atmospheric turbulence encounter beam breakup, which results in interference effects and discontinuities in the incoming wavefront. In these situations, a Shack-Hartmann sensor can no longer effectively determine the shape of the incoming wavefront. We propose a wavefront reconstruction and correction algorithm based around the plenoptic sensor. The plenoptic sensor's design allows it to match and exceed the wavefront sensing capabilities of a Shack-Hartmann sensor for our application. Novel wavefront reconstruction algorithms can take advantage of the plenoptic sensor to provide a rapid wavefront reconstruction necessary for real time turbulence. To test the integrity of the plenoptic sensor and its reconstruction algorithms, we use artificially generated turbulence in a lab scale environment to simulate the structure and speed of outdoor atmospheric turbulence. By analyzing the performance of our system with and without the closed-loop plenoptic sensor adaptive optics system, we can show that the plenoptic sensor is effective in mitigating real time lab generated atmospheric turbulence.

Training the Recurrent neural network by the Fuzzy Min-Max algorithm for fault prediction

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zemouri, Ryad; Racoceanu, Daniel; Zerhouni, Noureddine

2009-03-05

In this paper, we present a training technique of a Recurrent Radial Basis Function neural network for fault prediction. We use the Fuzzy Min-Max technique to initialize the k-center of the RRBF neural network. The k-means algorithm is then applied to calculate the centers that minimize the mean square error of the prediction task. The performances of the k-means algorithm are then boosted by the Fuzzy Min-Max technique.

Variable Resistance Training Promotes Greater Strength and Power Adaptations Than Traditional Resistance Training in Elite Youth Rugby League Players.

PubMed

Rivière, Maxence; Louit, Loic; Strokosch, Alasdair; Seitz, Laurent B

2017-04-01

Rivière, M, Louit, L, Strokosch, A, and Seitz, LB. Variable resistance training promotes greater strength and power adaptations than traditional resistance training in elite youth rugby league players. J Strength Cond Res 31(4): 947-955, 2017-The purpose of this study was to examine the strength, velocity, and power adaptations in youth rugby league players in response to a variable resistance training (VRT) or traditional free-weight resistance training (TRAD) intervention. Sixteen elite youth players were assigned to a VRT or TRAD group and completed 2 weekly upper- and lower-body strength and power sessions for 6 weeks. Training programs were identical except that the VRT group trained the bench press exercise with 20% of the prescribed load coming from elastic bands. Bench press 1 repetition maximum (1RM) and bench press mean velocity and power at 35, 45, 65, 75, and 85% of 1RM were measured before and after the training intervention, and the magnitude of the changes was determined using effect sizes (ESs). The VRT group experienced larger increases in both absolute (ES = 0.46 vs. 0.20) and relative (ES = 0.41 vs. 0.19) bench press 1RM. Similar results were observed for mean velocity as well as both absolute and relative mean power at 35, 45, 65, 75, and 85% of 1RM. Furthermore, both groups experienced large gains in both velocity and power in the heavier loads but small improvements in the lighter loads. The improvements in both velocity and power against the heavier loads were larger for the VRT group, whereas smaller differences existed between the 2 groups in the lighter loads. Variable resistance training using elastic bands may offer a greater training stimulus than traditional free-weight resistance training to improve upper-body strength, velocity, and power in elite youth rugby league players.

The efficacy of periodised resistance training on neuromuscular adaptation in older adults.

PubMed

Conlon, Jenny A; Newton, Robert U; Tufano, James J; Peñailillo, Luis E; Banyard, Harry G; Hopper, Amanda J; Ridge, Ashley J; Haff, G Gregory

2017-06-01

This study compared the effect of periodised versus non-periodised (NP) resistance training on neuromuscular adaptions in older adults. Forty-one apparently healthy untrained older adults (female = 21, male = 20; 70.9 ± 5.1 years; 166.3 ± 8.2 cm; 72.9 ± 13.4 kg) were recruited and randomly stratified to an NP, block periodised (BP), or daily undulating periodised (DUP) training group. Outcome measures were assessed at baseline and following a 22-week resistance training intervention (3 day week -1 ), including: muscle cross-sectional area (CSA), vertical jump performance, isometric and isokinetic peak torque, isometric rate of force development (RFD), and muscle activation. Thirty-three participants satisfied all study requirements and were included in analyses (female = 17, male = 16; 71.3 ± 5.4 years; 166.3 ± 8.5 cm; 72.5 ± 13.7 kg). Block periodisation, DUP, and NP resistance training induced statistically significant improvements in muscle CSA, vertical jump peak velocity, peak power and jump height, and peak isometric and isokinetic torque of the knee extensors at 60 and 180° s -1 , with no between-group differences. Muscle activity and absolute RFD measures were statistically unchanged following resistance training across the entire cohort. Periodised resistance training, specifically BP and DUP, and NP resistance training are equally effective for promoting increases in muscular hypertrophy, strength, and power among untrained older adults. Consequently, periodisation strategies are not essential for optimising neuromuscular adaptations during the initial stages of resistance training in the aging population.

Heart rate variability in the standing position reflects training adaptation in professional soccer players.

PubMed

Ravé, Guillaume; Fortrat, Jacques-Olivier

2016-08-01

To show that heart rate variability (HRV) in the standing position better reflects the way in which athletes adapt to training in so-called intermittent sports than the indicator of resting parasympathetic tone usually employed in endurance sports. Twenty professional soccer players (intermittent sport) took part in a 5-week training session divided into three successive periods: "Warm-up", "Intensive training" and "Tapering". At the beginning and end of each of the three periods, a stand test was carried out and the heart rate was recorded, beat by beat (Polar Team 2). We analysed HRV to determine the indicator mostly used to demonstrate training adaptation in endurance sports (lnRMSSD supine, natural logarithm of root mean square of the successive differences) as well as indicators obtained by means of spectral analysis in both supine and standing position. A decrease in heart rate was observed in the supine position at rest during training (-5.2 ± 1.3 bpm) while lnRMSSD and spectral analysis indicators remained unchanged. The "Warm-up" caused an increase in spectral analysis total power in standing position which was further highlighted by "Tapering" (3.39 ± 0.09, 3.61 ± 0.08 and 3.65 ± 0.09 log ms(2), respectively). However, the autonomic changes are probably more complex than a change in autonomic activity or balance since spectral analysis autonomic indicators remained unchanged. HRV in the standing position could monitor training adaptation in intermittent sports contrary to the indicator usually employed in endurance sports. However, the significance of the HRV change in the standing position during training remains unclear.

A novel clinical decision support system using improved adaptive genetic algorithm for the assessment of fetal well-being.

PubMed

Ravindran, Sindhu; Jambek, Asral Bahari; Muthusamy, Hariharan; Neoh, Siew-Chin

2015-01-01

A novel clinical decision support system is proposed in this paper for evaluating the fetal well-being from the cardiotocogram (CTG) dataset through an Improved Adaptive Genetic Algorithm (IAGA) and Extreme Learning Machine (ELM). IAGA employs a new scaling technique (called sigma scaling) to avoid premature convergence and applies adaptive crossover and mutation techniques with masking concepts to enhance population diversity. Also, this search algorithm utilizes three different fitness functions (two single objective fitness functions and multi-objective fitness function) to assess its performance. The classification results unfold that promising classification accuracy of 94% is obtained with an optimal feature subset using IAGA. Also, the classification results are compared with those of other Feature Reduction techniques to substantiate its exhaustive search towards the global optimum. Besides, five other benchmark datasets are used to gauge the strength of the proposed IAGA algorithm.

Adaptive Training and Education Research at the US Army Research Laboratory: Bibliography (2016-2017)

DTIC Science & Technology

2018-03-05

Validation suite. Synthetic training environments. Service orientated architecture. Citation: Robson, E., Ray, F., Sinatra, A. M., & Sinatra, A. M. (2017...ARL-SR-0393 ● MAR 2018 US Army Research Laboratory Adaptive Training and Education Research at the US Army Research Laboratory... Training and Education Research at the US Army Research Laboratory: Bibliography (2016–2017) by Robert A Sottilare Human Research and

Heuristic-Leadership Model: Adapting to Current Training and Changing Times.

ERIC Educational Resources Information Center

Danielson, Mary Ann

A model was developed for training individuals to adapt better to the changing work environment by focusing on the subordinate to supervisor relationship and providing a heuristic approach to leadership. The model emphasizes a heuristic approach to decision-making through the active participation of both members of the dyad. The demand among…

Active control strategy for the running attitude of high-speed train under strong crosswind condition

NASA Astrophysics Data System (ADS)

Li, Decang; Meng, Jianjun; Bai, Huan; Xu, Ruxun

2018-07-01

This paper focuses on the safety of high-speed trains under strong crosswind conditions. A new active control strategy is proposed based on the adaptive predictive control theory. The new control strategy aims at adjusting the attitudes of a train by controlling the new-type intelligent giant magnetostrictive actuator (GMA). It combined adaptive control with dynamic matrix control; parameters of predictive controller was real-time adjusted by online distinguishing to enhance the robustness of the control algorithm. On this basis, a correction control algorithm is also designed to regulate the parameters of predictive controller based on the step response of a controlled objective. Finally, the simulation results show that the proposed control strategy can adjust the running attitudes of high-speed trains under strong crosswind conditions; they also indicate that the new active control strategy is effective and applicable in improving the safety performance of a train based on a host-target computer technology provided by Matlab/Simulink.

Testing for a slope-based decoupling algorithm in a woofer-tweeter adaptive optics system.

PubMed

Cheng, Tao; Liu, WenJin; Yang, KangJian; He, Xin; Yang, Ping; Xu, Bing

2018-05-01

It is well known that using two or more deformable mirrors (DMs) can improve the compensation ability of an adaptive optics (AO) system. However, to keep the stability of an AO system, the correlation between the multiple DMs must be suppressed during the correction. In this paper, we proposed a slope-based decoupling algorithm to simultaneous control the multiple DMs. In order to examine the validity and practicality of this algorithm, a typical woofer-tweeter (W-T) AO system was set up. For the W-T system, a theory model was simulated and the results indicated in theory that the algorithm we presented can selectively make woofer and tweeter correct different spatial frequency aberration and suppress the cross coupling between the dual DMs. At the same time, the experimental results for the W-T AO system were consistent with the results of the simulation, which demonstrated in practice that this algorithm is practical for the AO system with dual DMs.

Optimization of IBF parameters based on adaptive tool-path algorithm

NASA Astrophysics Data System (ADS)

Deng, Wen Hui; Chen, Xian Hua; Jin, Hui Liang; Zhong, Bo; Hou, Jin; Li, An Qi

2018-03-01

As a kind of Computer Controlled Optical Surfacing(CCOS) technology. Ion Beam Figuring(IBF) has obvious advantages in the control of surface accuracy, surface roughness and subsurface damage. The superiority and characteristics of IBF in optical component processing are analyzed from the point of view of removal mechanism. For getting more effective and automatic tool path with the information of dwell time, a novel algorithm is proposed in this thesis. Based on the removal functions made through our IBF equipment and the adaptive tool-path, optimized parameters are obtained through analysis the residual error that would be created in the polishing process. A Φ600 mm plane reflector element was used to be a simulation instance. The simulation result shows that after four combinations of processing, the surface accuracy of PV (Peak Valley) value and the RMS (Root Mean Square) value was reduced to 4.81 nm and 0.495 nm from 110.22 nm and 13.998 nm respectively in the 98% aperture. The result shows that the algorithm and optimized parameters provide a good theoretical for high precision processing of IBF.

Incrementing data quality of multi-frequency echograms using the Adaptive Wiener Filter (AWF) denoising algorithm

NASA Astrophysics Data System (ADS)

Peña, M.

2016-10-01

Achieving acceptable signal-to-noise ratio (SNR) can be difficult when working in sparsely populated waters and/or when species have low scattering such as fluid filled animals. The increasing use of higher frequencies and the study of deeper depths in fisheries acoustics, as well as the use of commercial vessels, is raising the need to employ good denoising algorithms. The use of a lower Sv threshold to remove noise or unwanted targets is not suitable in many cases and increases the relative background noise component in the echogram, demanding more effectiveness from denoising algorithms. The Adaptive Wiener Filter (AWF) denoising algorithm is presented in this study. The technique is based on the AWF commonly used in digital photography and video enhancement. The algorithm firstly increments the quality of the data with a variance-dependent smoothing, before estimating the noise level as the envelope of the Sv minima. The AWF denoising algorithm outperforms existing algorithms in the presence of gaussian, speckle and salt & pepper noise, although impulse noise needs to be previously removed. Cleaned echograms present homogenous echotraces with outlined edges.

Using patient‐specific phantoms to evaluate deformable image registration algorithms for adaptive radiation therapy

PubMed Central

Stanley, Nick; Glide‐Hurst, Carri; Kim, Jinkoo; Adams, Jeffrey; Li, Shunshan; Wen, Ning; Chetty, Indrin J

2013-01-01

The quality of adaptive treatment planning depends on the accuracy of its underlying deformable image registration (DIR). The purpose of this study is to evaluate the performance of two DIR algorithms, B‐spline‐based deformable multipass (DMP) and deformable demons (Demons), implemented in a commercial software package. Evaluations were conducted using both computational and physical deformable phantoms. Based on a finite element method (FEM), a total of 11 computational models were developed from a set of CT images acquired from four lung and one prostate cancer patients. FEM generated displacement vector fields (DVF) were used to construct the lung and prostate image phantoms. Based on a fast‐Fourier transform technique, image noise power spectrum was incorporated into the prostate image phantoms to create simulated CBCT images. The FEM‐DVF served as a gold standard for verification of the two registration algorithms performed on these phantoms. The registration algorithms were also evaluated at the homologous points quantified in the CT images of a physical lung phantom. The results indicated that the mean errors of the DMP algorithm were in the range of 1.0~3.1mm for the computational phantoms and 1.9 mm for the physical lung phantom. For the computational prostate phantoms, the corresponding mean error was 1.0–1.9 mm in the prostate, 1.9–2.4 mm in the rectum, and 1.8–2.1 mm over the entire patient body. Sinusoidal errors induced by B‐spline interpolations were observed in all the displacement profiles of the DMP registrations. Regions of large displacements were observed to have more registration errors. Patient‐specific FEM models have been developed to evaluate the DIR algorithms implemented in the commercial software package. It has been found that the accuracy of these algorithms is patient‐dependent and related to various factors including tissue deformation magnitudes and image intensity gradients across the regions of interest. This

Robust adaptive cruise control of high speed trains.

PubMed

Faieghi, Mohammadreza; Jalali, Aliakbar; Mashhadi, Seyed Kamal-e-ddin Mousavi

2014-03-01

The cruise control problem of high speed trains in the presence of unknown parameters and external disturbances is considered. In particular a Lyapunov-based robust adaptive controller is presented to achieve asymptotic tracking and disturbance rejection. The system under consideration is nonlinear, MIMO and non-minimum phase. To deal with the limitations arising from the unstable zero-dynamics we do an output redefinition such that the zero-dynamics with respect to new outputs becomes stable. Rigorous stability analyses are presented which establish the boundedness of all the internal states and simultaneously asymptotic stability of the tracking error dynamics. The results are presented for two common configurations of high speed trains, i.e. the DD and PPD designs, based on the multi-body model and are verified by several numerical simulations. Copyright © 2013 ISA. Published by Elsevier Ltd. All rights reserved.

Swimming Training Induces Liver Mitochondrial Adaptations to Oxidative Stress in Rats Submitted to Repeated Exhaustive Swimming Bouts

PubMed Central

Lima, Frederico D.; Stamm, Daniel N.; Della-Pace, Iuri D.; Dobrachinski, Fernando; de Carvalho, Nélson R.; Royes, Luiz Fernando F.; Soares, Félix A.; Rocha, João B.; González-Gallego, Javier; Bresciani, Guilherme

2013-01-01

Background and Aims Although acute exhaustive exercise is known to increase liver reactive oxygen species (ROS) production and aerobic training has shown to improve the antioxidant status in the liver, little is known about mitochondria adaptations to aerobic training. The main objective of this study was to investigate the effects of the aerobic training on oxidative stress markers and antioxidant defense in liver mitochondria both after training and in response to three repeated exhaustive swimming bouts. Methods Wistar rats were divided into training (n = 14) and control (n = 14) groups. Training group performed a 6-week swimming training protocol. Subsets of training (n = 7) and control (n = 7) rats performed 3 repeated exhaustive swimming bouts with 72 h rest in between. Oxidative stress biomarkers, antioxidant activity, and mitochondria functionality were assessed. Results Trained group showed increased reduced glutathione (GSH) content and reduced/oxidized (GSH/GSSG) ratio, higher superoxide dismutase (MnSOD) activity, and decreased lipid peroxidation in liver mitochondria. Aerobic training protected against exhaustive swimming ROS production herein characterized by decreased oxidative stress markers, higher antioxidant defenses, and increases in methyl-tetrazolium reduction and membrane potential. Trained group also presented higher time to exhaustion compared to control group. Conclusions Swimming training induced positive adaptations in liver mitochondria of rats. Increased antioxidant defense after training coped well with exercise-produced ROS and liver mitochondria were less affected by exhaustive exercise. Therefore, liver mitochondria also adapt to exercise-induced ROS and may play an important role in exercise performance. PMID:23405192

A hybrid skull-stripping algorithm based on adaptive balloon snake models

NASA Astrophysics Data System (ADS)

Liu, Hung-Ting; Sheu, Tony W. H.; Chang, Herng-Hua

2013-02-01

Skull-stripping is one of the most important preprocessing steps in neuroimage analysis. We proposed a hybrid algorithm based on an adaptive balloon snake model to handle this challenging task. The proposed framework consists of two stages: first, the fuzzy possibilistic c-means (FPCM) is used for voxel clustering, which provides a labeled image for the snake contour initialization. In the second stage, the contour is initialized outside the brain surface based on the FPCM result and evolves under the guidance of the balloon snake model, which drives the contour with an adaptive inward normal force to capture the boundary of the brain. The similarity indices indicate that our method outperformed the BSE and BET methods in skull-stripping the MR image volumes in the IBSR data set. Experimental results show the effectiveness of this new scheme and potential applications in a wide variety of skull-stripping applications.

Virtual Reality as a Medium for Sensorimotor Adaptation Training and Spaceflight Countermeasures

NASA Technical Reports Server (NTRS)

Madansingh, S.; Bloomberg, J. J.

2014-01-01

Astronauts experience a profound sensorimotor adaptation during transition to and from the microgravity environment of space. With the upcoming shift to extra-long duration missions (upwards of 1 year) aboard the International Space Station, the immediate risks to astronauts during these transitory periods become more important than ever to understand and prepare for. Recent advances in virtual reality technology enable everyday adoption of these tools for entertainment and use in training. Embedding an individual in a virtual environment (VE) allows the ability to change the perception of visual flow, elicit automatic motor behavior and produce sensorimotor adaptation, not unlike those required during long duration microgravity exposure. The overall goal of this study is to determine the feasibility of present head mounted display technology (HMD) to produce reliable visual flow information and the expected adaptation associated with virtual environment manipulation to be used in future sensorimotor adaptability countermeasures. To further understand the influence of visual flow on gait adaptation during treadmill walking, a series of discordant visual flow manipulations in a virtual environment are proposed. Six healthy participants (3 male and 3 female) will observe visual flow information via HMD (Oculus Rift DK2) while walking on an instrumented treadmill at their preferred walking speed. Participants will be immersed in a series of VE's resembling infinite hallways with different visual characteristics: an office hallway, a hallway with pillars and the hallway of a fictional spacecraft. Participants will perform three trials of 10 min. each, which include walking on the treadmill while receiving congruent or incongruent visual information via the HMD. In the first trial, participants will experience congruent visual information (baseline) where the hallway is perceived to move at the same rate as their walking speed. The final two trials will be randomized

Adaptive regularization network based neural modeling paradigm for nonlinear adaptive estimation of cerebral evoked potentials.

PubMed

Zhang, Jian-Hua; Böhme, Johann F

2007-11-01

In this paper we report an adaptive regularization network (ARN) approach to realizing fast blind separation of cerebral evoked potentials (EPs) from background electroencephalogram (EEG) activity with no need to make any explicit assumption on the statistical (or deterministic) signal model. The ARNs are proposed to construct nonlinear EEG and EP signal models. A novel adaptive regularization training (ART) algorithm is proposed to improve the generalization performance of the ARN. Two adaptive neural modeling methods based on the ARN are developed and their implementation and performance analysis are also presented. The computer experiments using simulated and measured visual evoked potential (VEP) data have shown that the proposed ARN modeling paradigm yields computationally efficient and more accurate VEP signal estimation owing to its intrinsic model-free and nonlinear processing characteristics.

A dual-adaptive support-based stereo matching algorithm

NASA Astrophysics Data System (ADS)

Zhang, Yin; Zhang, Yun

2017-07-01

Many stereo matching algorithms use fixed color thresholds and a rigid cross skeleton to segment supports (viz., Cross method), which, however, does not work well for different images. To address this issue, this paper proposes a novel dual adaptive support (viz., DAS)-based stereo matching method, which uses both appearance and shape information of a local region to segment supports automatically, and, then, integrates the DAS-based cost aggregation with the absolute difference plus census transform cost, scanline optimization and disparity refinement to develop a stereo matching system. The performance of the DAS method is also evaluated in the Middlebury benchmark and by comparing with the Cross method. The results show that the average error for the DAS method 25.06% lower than that for the Cross method, indicating that the proposed method is more accurate, with fewer parameters and suitable for parallel computing.

Effects of beta-adrenergic blockade on training-induced structural adaptations in rat left ventricle.

PubMed

Thomas, D P; McCormick, K M; Jenkins, R R

1988-01-01

The study was designed to evaluate the effects of eight weeks of exercise training or training-beta-adrenergic blockade combination on gross and microscopic alterations of rat cardiac muscle and microvascular bed. Rats were randomly assigned to either sedentary control (C), trained (T), metoprolol-trained (MT), or propranolol-trained (PT) groups. The training protocol involved treadmill running for 8 weeks at 0.5 ms-1, 20% grade. Earlier experiments by us showed this training protocol to be effective in producing significant changes in selected skeletal muscle enzyme activities in all trained groups. In the current study an absolute reduction in left ventricular (LV) weight was observed in the PT compared to the C group (0.91 +/- 0.02 vs. 1.04 +/- 0.04 g, P less than 0.05). LV weight in the T and MT groups was no different from C so that LV to BW ratio (mg.g-1) was significantly increased (P less than 0.05) due to a similar reduction in body weight (BW) in all three training groups. Morphometric analysis of LV myocardium revealed no significant differences in myocyte mean cross-sectional area (micron 2) in any of the groups (289 +/- 16-C, 332 +/- 20-T, 281 +/- 44-MT, and 273 +/- 12-PT). Capillary density independently calculated by light and electron microscopy was unchanged by training or training-beta-blockade combination. It was concluded that training of sufficient intensity and duration to produce skeletal muscle enzyme adaptations does not necessarily produce myocyte hypertrophy or alter LV capillarity. Additionally functioning beta-adrenergic receptors appear to play a role in both the central and peripheral adaptations to endurance exercise training.

AIDA: an adaptive image deconvolution algorithm with application to multi-frame and three-dimensional data

PubMed Central

Hom, Erik F. Y.; Marchis, Franck; Lee, Timothy K.; Haase, Sebastian; Agard, David A.; Sedat, John W.

2011-01-01

We describe an adaptive image deconvolution algorithm (AIDA) for myopic deconvolution of multi-frame and three-dimensional data acquired through astronomical and microscopic imaging. AIDA is a reimplementation and extension of the MISTRAL method developed by Mugnier and co-workers and shown to yield object reconstructions with excellent edge preservation and photometric precision [J. Opt. Soc. Am. A 21, 1841 (2004)]. Written in Numerical Python with calls to a robust constrained conjugate gradient method, AIDA has significantly improved run times over the original MISTRAL implementation. Included in AIDA is a scheme to automatically balance maximum-likelihood estimation and object regularization, which significantly decreases the amount of time and effort needed to generate satisfactory reconstructions. We validated AIDA using synthetic data spanning a broad range of signal-to-noise ratios and image types and demonstrated the algorithm to be effective for experimental data from adaptive optics–equipped telescope systems and wide-field microscopy. PMID:17491626

Design of a Performance-Responsive Drill and Practice Algorithm for Computer-Based Training.

ERIC Educational Resources Information Center

Vazquez-Abad, Jesus; LaFleur, Marc

1990-01-01

Reviews criticisms of the use of drill and practice programs in educational computing and describes potentials for its use in instruction. Topics discussed include guidelines for developing computer-based drill and practice; scripted training courseware; item format design; item bank design; and a performance-responsive algorithm for item…

Logistics Distribution Center Location Evaluation Based on Genetic Algorithm and Fuzzy Neural Network

NASA Astrophysics Data System (ADS)

Shao, Yuxiang; Chen, Qing; Wei, Zhenhua

Logistics distribution center location evaluation is a dynamic, fuzzy, open and complicated nonlinear system, which makes it difficult to evaluate the distribution center location by the traditional analysis method. The paper proposes a distribution center location evaluation system which uses the fuzzy neural network combined with the genetic algorithm. In this model, the neural network is adopted to construct the fuzzy system. By using the genetic algorithm, the parameters of the neural network are optimized and trained so as to improve the fuzzy system’s abilities of self-study and self-adaptation. At last, the sampled data are trained and tested by Matlab software. The simulation results indicate that the proposed identification model has very small errors.

Angular dependence of multiangle dynamic light scattering for particle size distribution inversion using a self-adapting regularization algorithm

NASA Astrophysics Data System (ADS)

Li, Lei; Yu, Long; Yang, Kecheng; Li, Wei; Li, Kai; Xia, Min

2018-04-01

The multiangle dynamic light scattering (MDLS) technique can better estimate particle size distributions (PSDs) than single-angle dynamic light scattering. However, determining the inversion range, angular weighting coefficients, and scattering angle combination is difficult but fundamental to the reconstruction for both unimodal and multimodal distributions. In this paper, we propose a self-adapting regularization method called the wavelet iterative recursion nonnegative Tikhonov-Phillips-Twomey (WIRNNT-PT) algorithm. This algorithm combines a wavelet multiscale strategy with an appropriate inversion method and could self-adaptively optimize several noteworthy issues containing the choices of the weighting coefficients, the inversion range and the optimal inversion method from two regularization algorithms for estimating the PSD from MDLS measurements. In addition, the angular dependence of the MDLS for estimating the PSDs of polymeric latexes is thoroughly analyzed. The dependence of the results on the number and range of measurement angles was analyzed in depth to identify the optimal scattering angle combination. Numerical simulations and experimental results for unimodal and multimodal distributions are presented to demonstrate both the validity of the WIRNNT-PT algorithm and the angular dependence of MDLS and show that the proposed algorithm with a six-angle analysis in the 30-130° range can be satisfactorily applied to retrieve PSDs from MDLS measurements.

Hot Water Bathing Impairs Training Adaptation in Elite Teen Archers.

PubMed

Hung, Ta-Cheng; Liao, Yi-Hung; Tsai, Yung-Shen; Ferguson-Stegall, Lisa; Kuo, Chia-Hua; Chen, Chung-Yu

2018-04-30

Despite heat imposes considerable physiological stress to human body, hot water immersion remains as a popular relaxation modality for athletes. Here we examined the lingering effect of hot tub relaxation after training on performance-associated measures and dehydroepiandrosterone sulfate (DHEA-S) in junior archers. Ten national level archers, aged 16.6 ± 0.3 years (M = 8, F = 2), participated in a randomized counter-balanced crossover study after baseline measurements. In particular, half participants were assigned to the hot water immersion (HOT) group, whereas another halves were assigned to the untreated control (CON) group. Crossover trial was conducted following a 2-week washout period. During the HOT trial, participants immersed in hot water for 30 min at 40°C, 1 h after training, twice a week (every 3 days) for 2 weeks. Participants during CON trial sat at the same environment without hot water after training. Performance-associated measures and salivary DHEA-S were determined 3 days after the last HOT session. We found that the HOT intervention significantly decreased shooting performance (CON: -4%; HOT: -22%, P < 0.05), postural stability (CON: +15%; HOT: -16%, P < 0.05), and DHEA-S levels (CON: -3%; HOT: -60%, P < 0.05) of archers, compared with untreated CON trial. No group differences were found in motor unit recruitment (root mean square electromyography, RMS EMG) of arm muscles during aiming, autonomic nervous activity (sympathetic and vagal powers of heart rate variability, HRV), and plasma cortisol levels after treatments. Our data suggest that physiological adaptation against heat exposure takes away the sources needed for normal training adaptation specific to shooting performance in archers.

An Automated Algorithm to Screen Massive Training Samples for a Global Impervious Surface Classification

NASA Technical Reports Server (NTRS)

Tan, Bin; Brown de Colstoun, Eric; Wolfe, Robert E.; Tilton, James C.; Huang, Chengquan; Smith, Sarah E.

2012-01-01

An algorithm is developed to automatically screen the outliers from massive training samples for Global Land Survey - Imperviousness Mapping Project (GLS-IMP). GLS-IMP is to produce a global 30 m spatial resolution impervious cover data set for years 2000 and 2010 based on the Landsat Global Land Survey (GLS) data set. This unprecedented high resolution impervious cover data set is not only significant to the urbanization studies but also desired by the global carbon, hydrology, and energy balance researches. A supervised classification method, regression tree, is applied in this project. A set of accurate training samples is the key to the supervised classifications. Here we developed the global scale training samples from 1 m or so resolution fine resolution satellite data (Quickbird and Worldview2), and then aggregate the fine resolution impervious cover map to 30 m resolution. In order to improve the classification accuracy, the training samples should be screened before used to train the regression tree. It is impossible to manually screen 30 m resolution training samples collected globally. For example, in Europe only, there are 174 training sites. The size of the sites ranges from 4.5 km by 4.5 km to 8.1 km by 3.6 km. The amount training samples are over six millions. Therefore, we develop this automated statistic based algorithm to screen the training samples in two levels: site and scene level. At the site level, all the training samples are divided to 10 groups according to the percentage of the impervious surface within a sample pixel. The samples following in each 10% forms one group. For each group, both univariate and multivariate outliers are detected and removed. Then the screen process escalates to the scene level. A similar screen process but with a looser threshold is applied on the scene level considering the possible variance due to the site difference. We do not perform the screen process across the scenes because the scenes might vary due to

Different Muscle Action Training Protocols on Quadriceps-Hamstrings Neuromuscular Adaptations.

PubMed

Ruas, Cassio V; Brown, Lee E; Lima, Camila D; Gregory Haff, G; Pinto, Ronei S

2018-05-01

The aim of this study was to compare three specific concentric and eccentric muscle action training protocols on quadriceps-hamstrings neuromuscular adaptations. Forty male volunteers performed 6 weeks of training (two sessions/week) of their dominant and non-dominant legs on an isokinetic dynamometer. They were randomly assigned to one of four groups; concentric quadriceps and concentric hamstrings (CON/CON, n=10), eccentric quadriceps and eccentric hamstrings (ECC/ECC, n=10), concentric quadriceps and eccentric hamstrings (CON/ECC, n=10), or no training (CTRL, n=10). Intensity of training was increased every week by decreasing the angular velocity for concentric and increasing it for eccentric groups in 30°/s increments. Volume of training was increased by adding one set every week. Dominant leg quadriceps and hamstrings muscle thickness, muscle quality, muscle activation, muscle coactivation, and electromechanical delay were tested before and after training. Results revealed that all training groups similarly increased MT of quadriceps and hamstrings compared to control (p<0.05). However, CON/ECC and ECC/ECC training elicited a greater magnitude of change. There were no significant differences between groups for all other neuromuscular variables (p>0.05). These findings suggest that different short-term muscle action isokinetic training protocols elicit similar muscle size increases in hamstrings and quadriceps, but not for other neuromuscular variables. Nevertheless, effect sizes indicate that CON/ECC and ECC/ECC may elicit the greatest magnitude of change in muscle hypertrophy. © Georg Thieme Verlag KG Stuttgart · New York.