Planning rigid body motions using elastic curves

This paper tackles the problem of computing smooth, optimal trajectories on the Euclidean group of motions SE(3). The problem is formulated as an optimal control problem where the cost function to be minimized is equal to the integral of the classical curvature squared. This problem is analogous to the elastic problem from differential geometry and thus the resulting rigid body motions will trace elastic curves. An application of the Maximum Principle to this optimal control problem shifts the emphasis to the language of symplectic geometry and to the associated Hamiltonian formalism. This results in a system of first order differential equations that yield coordinate free necessary conditions for optimality for these curves. From these necessary conditions we identify an integrable case and these particular set of curves are solved analytically. These analytic solutions provide interpolating curves between an initial given position and orientation and a desired position and orientation that would be useful in motion planning for systems such as robotic manipulators and autonomous-oriented vehicles.

Integrable quadratic Hamiltonians on the Euclidean group of motions

In this paper, we discuss the problem of globally computing sub-Riemannian curves on the Euclidean group of motions SE(3). In particular, we derive a global result for special sub-Riemannian curves whose Hamiltonian satisfies a particular condition. In this paper, sub-Riemannian curves are defined in the context of a constrained optimal control problem. The maximum principle is then applied to this problem to yield an appropriate left-invariant quadratic Hamiltonian. A number of integrable quadratic Hamiltonians are identified. We then proceed to derive convenient expressions for sub-Riemannian curves in SE(3) that correspond to particular extremal curves. These equations are then used to compute sub-Riemannian curves that could potentially be used for motion planning of underwater vehicles.

An implicit pole-assignment self-tuning regulator

A new self-tuning implicit pole-assignment algorithm is presented which, through the use of a pole compression factor and different RLS model and control structures, overcomes stability and convergence problems encountered in previously available algorithms. Computational requirements of the technique are much reduced when compared to explicit pole-assignment schemes, whereas the inherent robustness of the strategy is retained.

Bistability through triadic closure

We propose and analyse a class of evolving network models suitable for describing a dynamic topological structure. Applications include telecommunication, on-line social behaviour and information processing in neuroscience. We model the evolving network as a discrete time Markov chain, and study a very general framework where, conditioned on the current state, edges appear or disappear independently at the next timestep. We show how to exploit symmetries in the microscopic, localized rules in order to obtain conjugate classes of random graphs that simplify analysis and calibration of a model. Further, we develop a mean field theory for describing network evolution. For a simple but realistic scenario incorporating the triadic closure effect that has been empirically observed by social scientists (friends of friends tend to become friends), the mean field theory predicts bistable dynamics, and computational results confirm this prediction. We also discuss the calibration issue for a set of real cell phone data, and find support for a stratified model, where individuals are assigned to one of two distinct groups having different within-group and across-group dynamics.

Delays versus performance of visually guided systems

The paper presents an overview of dynamic systems with inherent delays in both feedforward and feedback paths and how the performance of such systems can be affected by such delays. The authors concentrate on visually guided systems, where the behaviour of the system is largely dependent on the results of the vision sensors, with particular reference to active robot heads (real-time gaze control). We show how the performance of such systems can deteriorate substantially with the presence of unknown and/or variable delays. Considered choice of system architecture, however, allows the performance of active vision systems to be optimised with respect to the delays present in the system.

The dependence of contrail formation on the weather pattern and altitude in the North Atlantic

Aircraft flying through cold ice-supersaturated air produce persistent contrails which contribute to the climate impact of aviation. Here, we demonstrate the importance of the weather situation, together with the route and altitude of the aircraft through this, on estimating contrail coverage. The results have implications for determining the climate impact of contrails as well as potential mitigation strategies. Twenty-one years of re-analysis data are used to produce a climatological assessment of conditions favorable for persistent contrail formation between 200 and 300 hPa over the north Atlantic in winter. The seasonal-mean frequency of cold ice-supersaturated regions is highest near 300 hPa, and decreases with altitude. The frequency of occurrence of ice-supersaturated regions varies with large-scale weather pattern; the most common locations are over Greenland, on the southern side of the jet stream and around the northern edge of high pressure ridges. Assuming aircraft take a great circle route, as opposed to a more realistic time-optimal route, is likely to lead to an error in the estimated contrail coverage, which can exceed 50% for westbound north Atlantic flights. The probability of contrail formation can increase or decrease with height, depending on the weather pattern, indicating that the generic suggestion that flying higher leads to fewer contrails is not robust.

Global transcriptome analysis and identification of differentially expressed genes after infection of Fragaria vesca with powdery mildew (Podosphaera aphanis)

Background: Podosphaera aphanis, the causal agent of strawberry powdery mildew causes significant economic loss worldwide. Methods: We used the diploid strawberry species Fragaria vesca as a model to study plant pathogen interactions. RNA-seq was employed to generate a transcriptome dataset from two accessions, F. vesca ssp. vesca Hawaii 4 (HW) and F. vesca f. semperflorens Yellow Wonder 5AF7 (YW) at 1 d (1 DAI) and 8 d (8 DAI) after infection. Results: Of the total reads identified about 999 million (92%) mapped to the F. vesca genome. These transcripts were derived from a total of 23,470 and 23,464 genes in HW and YW, respectively from the three time points (control, 1 and 8 DAI). Analysis identified 1,567, 1,846 and 1,145 up-regulated genes between control and 1 DAI, control and 8 DAI, and 1 and 8 DAI, respectively in HW. Similarly, 1,336, 1,619 and 968 genes were up-regulated in YW. Also 646, 1,098 and 624 down-regulated genes were identified in HW, while 571, 754 and 627 genes were down-regulated in YW between all three time points, respectively. Conclusion: Investigation of differentially expressed genes (log2 fold changes �5) between control and 1 DAI in both HW and YW identified a large number of genes related to secondary metabolism, signal transduction; transcriptional regulation and disease resistance were highly expressed. These included flavonoid 3´-monooxygenase, peroxidase 15, glucan endo-1,3-β-glucosidase 2, receptor-like kinases, transcription factors, germin-like proteins, F-box proteins, NB-ARC and NBS-LRR proteins. This is the first application of RNA-seq to any pathogen interaction in strawberry

Memory and burstiness in dynamic networks

A discrete-time random process is described, which can generate bursty sequences of events. A Bernoulli process, where the probability of an event occurring at time t is given by a fixed probability x, is modified to include a memory effect where the event probability is increased proportionally to the number of events that occurred within a given amount of time preceding t. For small values of x the interevent time distribution follows a power law with exponent −2−x. We consider a dynamic network where each node forms, and breaks connections according to this process. The value of x for each node depends on the fitness distribution, \rho(x), from which it is drawn; we find exact solutions for the expectation of the degree distribution for a variety of possible fitness distributions, and for both cases where the memory effect either is, or is not present. This work can potentially lead to methods to uncover hidden fitness distributions from fast changing, temporal network data, such as online social communications and fMRI scans.

The Diffusion Kernel Filter

A particle filter method is presented for the discrete-time filtering problem with nonlinear ItA ` stochastic ordinary differential equations (SODE) with additive noise supposed to be analytically integrable as a function of the underlying vector-Wiener process and time. The Diffusion Kernel Filter is arrived at by a parametrization of small noise-driven state fluctuations within branches of prediction and a local use of this parametrization in the Bootstrap Filter. The method applies for small noise and short prediction steps. With explicit numerical integrators, the operations count in the Diffusion Kernel Filter is shown to be smaller than in the Bootstrap Filter whenever the initial state for the prediction step has sufficiently few moments. The established parametrization is a dual-formula for the analysis of sensitivity to gaussian-initial perturbations and the analysis of sensitivity to noise-perturbations, in deterministic models, showing in particular how the stability of a deterministic dynamics is modeled by noise on short times and how the diffusion matrix of an SODE should be modeled (i.e. defined) for a gaussian-initial deterministic problem to be cast into an SODE problem. From it, a novel definition of prediction may be proposed that coincides with the deterministic path within the branch of prediction whose information entropy at the end of the prediction step is closest to the average information entropy over all branches. Tests are made with the Lorenz-63 equations, showing good results both for the filter and the definition of prediction.

RUMOR PROCESSES ON N

We study four discrete-time stochastic systems on N, modeling processes of rumor spreading. The involved individuals can either have an active or a passive role, speaking up or asking for the rumor. The appetite for spreading or hearing the rumor is represented by a set of random variables whose distributions may depend on the individuals. Our goal is to understand-based on the distribution of the random variables-whether the probability of having an infinite set of individuals knowing the rumor is positive or not.

Billiards in a General Domain with Random Reflections

We study stochastic billiards on general tables: a particle moves according to its constant velocity inside some domain D R(d) until it hits the boundary and bounces randomly inside, according to some reflection law. We assume that the boundary of the domain is locally Lipschitz and almost everywhere continuously differentiable. The angle of the outgoing velocity with the inner normal vector has a specified, absolutely continuous density. We construct the discrete time and the continuous time processes recording the sequence of hitting points on the boundary and the pair location/velocity. We mainly focus on the case of bounded domains. Then, we prove exponential ergodicity of these two Markov processes, we study their invariant distribution and their normal (Gaussian) fluctuations. Of particular interest is the case of the cosine reflection law: the stationary distributions for the two processes are uniform in this case, the discrete time chain is reversible though the continuous time process is quasi-reversible. Also in this case, we give a natural construction of a chord ""picked at random"" in D, and we study the angle of intersection of the process with a (d - 1) -dimensional manifold contained in D.

Controle em tempo real de robôs através de redes IP

Com o intuito de utilizar uma rede com protocolo IP para a implementação de malhas fechadas de controle, este trabalho propõe-se a realizar um estudo da operação de um sistema de controle dinâmico distribuído, comparando-o com a operação de um sistema de controle local convencional. Em geral, a decisão de projetar uma arquitetura de controle distribuído é feita baseada na simplicidade, na redução dos custos e confiabilidade; portanto, um diferencial bastante importante é a utilização da rede IP. O objetivo de uma rede de controle não é transmitir dados digitais, mas dados analógicos amostrados. Assim, métricas usuais em redes de computadores, como quantidade de dados e taxa de transferências, tornam-se secundárias em uma rede de controle. São propostas técnicas para tratar os pacotes que sofrem atrasos e recuperar o desempenho do sistema de controle através da rede IP. A chave para este método é realizar a estimação do conteúdo dos pacotes que sofrem atrasos com base no modelo dinâmico do sistema, mantendo o sistema com um nível adequado de desempenho. O sistema considerado é o controle de um manipulador antropomórfico com dois braços e uma cabeça de visão estéreo totalizando 18 juntas. Os resultados obtidos mostram que se pode recuperar boa parte do desempenho do sistema.

Phase transition of demand explained by the heterogeneity of consumers' intrinsic preferences

In 1991 Gary S. Becker presented A Note on Restaurant Pricing and Other Examples of Social In uences on Price explaining why many successful restaurants, plays, sporting events, and other activities do not raise their prices even with persistent excess demand. The main reason for this is due to the discontinuity of stable demands, which is explained in Becker's (1991) analysis. In the present paper we construct a discrete time stochastic model of socially interacting consumers deciding for one of two establishments. With this model we show that the discontinuity of stable demands, proposed by Gary S. Becker, depends crucially on an additional factor: the dispersion of the consumers' intrinsic preferences for the establishments.

Estimação do desconto de reequilíbrio ótimo em concessões rodoviárias através da metodologia das opções reais

Este trabalho propõe um novo modelo para avaliação, em tempo discreto, do desconto de reequilíbrio em contratos de concessão rodoviária, a partir de conceitos da Teoria Clássica de Finanças e da Teoria de Opções Reais. O modelo desenvolvido permitiu incorporar flexibilidades decorrentes de incertezas nas situações reais, como decisões gerenciais, vieses de comportamento e componentes políticos, comumente presentes em contratos de concessões rodoviária. Os resultados obtidos, utilizando-se como estudo de caso a BR-262, sinalizaram que há espaço para uma melhor intervenção regulatória com relação ao mecanismo do desconto de reequilíbrio, no sentido de prover melhores incentivos aos concessionários.

Method of numerical correction of errors occasioned by delay of records during the monitoring of environmental variables of interest for animal production

As condições de ambiente térmico e aéreo, no interior de instalações para animais, alteram-se durante o dia, devido à influência do ambiente externo. Para que análises estatísticas e geoestatísticas sejam representativas, uma grande quantidade de pontos distribuídos espacialmente na área da instalação deve ser monitorada. Este trabalho propõe que a variação no tempo das variáveis ambientais de interesse para a produção animal, monitoradas no interior de instalações para animais, pode ser modelada com precisão a partir de registros discretos no tempo. O objetivo deste trabalho foi desenvolver um método numérico para corrigir as variações temporais dessas variáveis ambientais, transformando os dados para que tais observações independam do tempo gasto durante a aferição. O método proposto aproximou os valores registrados com retardos de tempo aos esperados no exato momento de interesse, caso os dados fossem medidos simultaneamente neste momento em todos os pontos distribuídos espacialmente. O modelo de correção numérica para variáveis ambientais foi validado para o parâmetro ambiental temperatura do ar, sendo que os valores corrigidos pelo método não diferiram pelo teste Tukey, a 5% de probabilidade dos valores reais registrados por meio de dataloggers.