Variation at the Est3 locus and adaptability to organophosphorous compounds in Zaprionus indianus populations

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Componentes do valor adaptativo e investigação do polimorfismo genético do gene Cyp6g1 (exons 1 e 2) em linhagens resistentes e suscetíveis de Drosophila melanogaster e de Drosophila simulans

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Adaptive subcarrier allocation in multiuser OFDM system using forced cost based decisions

Subcarrier allocation scheme for Orthogonal Frequency Division Multiplexing(OFDM) based multiuser system is proposed. Most previous algorithms use greedy approach as a subcarrier allocation scheme until a conflict occurs or as an initial first round allocation with improvement steps carried out in next rounds. Our algorithm uses information obtained by the forced costs of a system that incur by a current allocation to make assignment decisions. This algorithm does not rely on greedy approach and therefore can also be considered as a substitute for first layer Greedy algorithms. Simulation results show that for two user case this algorithm gives better or equal allocation 80-90 percent of the time when compared with the greedy allocation.

Reinforcement learning with average cost for adaptive control of traffic lights at intersections

We propose for the first time two reinforcement learning algorithms with function approximation for average cost adaptive control of traffic lights. One of these algorithms is a version of Q-learning with function approximation while the other is a policy gradient actor-critic algorithm that incorporates multi-timescale stochastic approximation. We show performance comparisons on various network settings of these algorithms with a range of fixed timing algorithms, as well as a Q-learning algorithm with full state representation that we also implement. We observe that whereas (as expected) on a two-junction corridor, the full state representation algorithm shows the best results, this algorithm is not implementable on larger road networks. The algorithm PG-AC-TLC that we propose is seen to show the best overall performance.

Adaptive data echo cancellation using cost function adaptation

For a digital echo canceller it is desirable to reduce the adaptation time, during which the transmission of useful data is not possible. LMS is a non-optimal algorithm in this case as the signals involved are statistically non-Gaussian. Walach and Widrow (IEEE Trans. Inform. Theory 30 (2) (March 1984) 275-283) investigated the use of a power of 4, while other research established algorithms with arbitrary integer (Pei and Tseng, IEEE J. Selected Areas Commun. 12(9)(December 1994) 1540-1547) or non-quadratic power (Shah and Cowan, IEE.Proc.-Vis. Image Signal Process. 142 (3) (June 1995) 187-191). This paper suggests that continuous and automatic, adaptation of the error exponent gives a more satisfactory result. The family of cost function adaptation (CFA) stochastic gradient algorithm proposed allows an increase in convergence rate and, an improvement of residual error. As special case the staircase CFA algorithm is first presented, then the smooth CFA is developed. Details of implementations are also discussed. Results of simulation are provided to show the properties of the proposed family of algorithms. (C) 2000 Elsevier Science B.V. All rights reserved.

A mixed cost-function adaptive algorithm for ADSL time-domain equalization

We propose a mixed cost-function adaptive initialization algorithm for the time domain equalizer in a discrete multitone (DMT)-based asymmetric digital subscriber line. Using our approach, a higher convergence rate than that of the commonly used least-mean square algorithm is obtained, whilst attaining bit rates close to the optimum maximum shortening SNR and the upper bound SNR. Furthermore, our proposed method outperforms the minimum mean-squared error design for a range of time domain equalizer (TEQ) filter lengths. The improved performance outweighs the small increase in computational complexity required. A block variant of our proposed algorithm is also presented to overcome the increased latency imposed on the feedback path of the adaptive system.

Cost dependent strategy for electricity markets bidding based on adaptive reinforcement learning

Electricity markets are complex environments, involving a large number of different entities, playing in a dynamic scene to obtain the best advantages and profits. MASCEM is a multi-agent electricity market simulator to model market players and simulate their operation in the market. Market players are entities with specific characteristics and objectives, making their decisions and interacting with other players. MASCEM provides several dynamic strategies for agents’ behavior. This paper presents a method that aims to provide market players with strategic bidding capabilities, allowing them to obtain the higher possible gains out of the market. This method uses a reinforcement learning algorithm to learn from experience how to choose the best from a set of possible bids. These bids are defined accordingly to the cost function that each producer presents.

Adaptive spatio-temporal filter for low-cost camera depth maps

In this paper we present an adaptive spatio-temporal filter that aims to improve low-cost depth camera accuracy and stability over time. The proposed system is composed by three blocks that are used to build a reliable depth map of static scenes. An adaptive joint-bilateral filter is used to obtain consistent depth maps by jointly considering depth and video information and by adapting its parameters to different levels of estimated noise. Kalman filters are used to reduce the temporal random fluctuations of the measurements. Finally an interpolation algorithm is used to obtain consistent depth maps in the regions where the depth information is not available. Results show that this approach allows to considerably improve the depth maps quality by considering spatio-temporal information and by adapting its parameters to different levels of noise.

Cost-Effectiveness Analysis of Adaptive Monitoring Strategies for Depression Treatment

Thesis (Master's)--University of Washington, 2016-06

Helicopter automation using a low-cost sensing system

This paper details the design of an autonomous helicopter control system using a low cost sensor suite. Control is maintained using simple nested PID loops. Aircraft attitude, velocity, and height is estimated using an in-house designed IMU and vision system. Information is combined using complimentary filtering. The aircraft is shown to be stabilised and responding to high level demands on all axes, including heading, height, lateral velocity and longitudinal velocity.

Helicopter automation using a low-cost sensing system

This paper details the design of an autonomous helicopter control system using a low cost sensor suite. Control is maintained using simple nested PID loops. Aircraft attitude, velocity, and height is estimated using an in-house designed IMU and vision system. Information is combined using complimentary filtering. The aircraft is shown to be stabilised and responding to high level demands on all axes, including heading, height, lateral velocity and longitudinal velocity.

Adaptive aneuploidy protects against thiol peroxidase deficiency by increasing respiration via key mitochondrial proteins

Aerobic respiration is a fundamental energy-generating process; however, there is cost associated with living in an oxygen-rich environment, because partially reduced oxygen species can damage cellular components. Organisms evolved enzymes that alleviate this damage and protect the intracellular milieu, most notably thiol peroxidases, which are abundant and conserved enzymes that mediate hydrogen peroxide signaling and act as the first line of defense against oxidants in nearly all living organisms. Deletion of all eight thiol peroxidase genes in yeast (∆8 strain) is not lethal, but results in slow growth and a high mutation rate. Here we characterized mechanisms that allow yeast cells to survive under conditions of thiol peroxidase deficiency. Two independent ∆8 strains increased mitochondrial content, altered mitochondrial distribution, and became dependent on respiration for growth but they were not hypersensitive to H2O2. In addition, both strains independently acquired a second copy of chromosome XI and increased expression of genes encoded by it. Survival of ∆8 cells was dependent on mitochondrial cytochrome-c peroxidase (CCP1) and UTH1, present on chromosome XI. Coexpression of these genes in ∆8 cells led to the elimination of the extra copy of chromosome XI and improved cell growth, whereas deletion of either gene was lethal. Thus, thiol peroxidase deficiency requires dosage compensation of CCP1 and UTH1 via chromosome XI aneuploidy, wherein these proteins support hydroperoxide removal with the reducing equivalents generated by the electron transport chain. To our knowledge, this is the first evidence of adaptive aneuploidy counteracting oxidative stress.

A Quasi-Newton Adaptive Algorithm for Generalized Symmetric Eigenvalue Problem

In this paper, we first recast the generalized symmetric eigenvalue problem, where the underlying matrix pencil consists of symmetric positive definite matrices, into an unconstrained minimization problem by constructing an appropriate cost function, We then extend it to the case of multiple eigenvectors using an inflation technique, Based on this asymptotic formulation, we derive a quasi-Newton-based adaptive algorithm for estimating the required generalized eigenvectors in the data case. The resulting algorithm is modular and parallel, and it is globally convergent with probability one, We also analyze the effect of inexact inflation on the convergence of this algorithm and that of inexact knowledge of one of the matrices (in the pencil) on the resulting eigenstructure. Simulation results demonstrate that the performance of this algorithm is almost identical to that of the rank-one updating algorithm of Karasalo. Further, the performance of the proposed algorithm has been found to remain stable even over 1 million updates without suffering from any error accumulation problems.

trans gene regulation in adaptive evolution: A genetic algorithm model

This is a continuation of earlier studies on the evolution of infinite populations of haploid genotypes within a genetic algorithm framework. We had previously explored the evolutionary consequences of the existence of indeterminate—“plastic”—loci, where a plastic locus had a finite probability in each generation of functioning (being switched “on”) or not functioning (being switched “off”). The relative probabilities of the two outcomes were assigned on a stochastic basis. The present paper examines what happens when the transition probabilities are biased by the presence of regulatory genes. We find that under certain conditions regulatory genes can improve the adaptation of the population and speed up the rate of evolution (on occasion at the cost of lowering the degree of adaptation). Also, the existence of regulatory loci potentiates selection in favour of plasticity. There is a synergistic effect of regulatory genes on plastic alleles: the frequency of such alleles increases when regulatory loci are present. Thus, phenotypic selection alone can be a potentiating factor in a favour of better adaptation.

An Adaptive Feature Based Low Power Motion Estimation Algorithm

Motion Estimation is one of the most power hungry operations in video coding. While optimal search (eg. full search)methods give best quality, non optimal methods are often used in order to reduce cost and power. Various algorithms have been used in practice that trade off quality vs. complexity. Global elimination is an algorithm based on pixel averaging to reduce complexity of motion search while keeping performance close to that of full search. We propose an adaptive version of the global elimination algorithm that extracts individual macro-block features using Hadamard transform to optimize the search. Performance achieved is close to the full search method and global elimination. Operational complexity and hence power is reduced by 30% to 45% compared to global elimination method.