Temporal Changes in Randomness of Bird Communities across Central Europe

Many studies have examined whether communities are structured by random or deterministic processes, and both are likely to play a role, but relatively few studies have attempted to quantify the degree of randomness in species composition. We quantified, for the first time, the degree of randomness in forest bird communities based on an analysis of spatial autocorrelation in three regions of Germany. The compositional dissimilarity between pairs of forest patches was regressed against the distance between them. We then calculated the y-intercept of the curve, i.e. the ‘nugget’, which represents the compositional dissimilarity at zero spatial distance. We therefore assume, following similar work on plant communities, that this represents the degree of randomness in species composition. We then analysed how the degree of randomness in community composition varied over time and with forest management intensity, which we expected to reduce the importance of random processes by increasing the strength of environmental drivers. We found that a high portion of the bird community composition could be explained by chance (overall mean of 0.63), implying that most of the variation in local bird community composition is driven by stochastic processes. Forest management intensity did not consistently affect the mean degree of randomness in community composition, perhaps because the bird communities were relatively insensitive to management intensity. We found a high temporal variation in the degree of randomness, which may indicate temporal variation in assembly processes and in the importance of key environmental drivers. We conclude that the degree of randomness in community composition should be considered in bird community studies, and the high values we find may indicate that bird community composition is relatively hard to predict at the regional scale.

Time series irreversibility: a visibility graph approach

We propose a method to measure real-valued time series irreversibility which combines two different tools: the horizontal visibility algorithm and the Kullback-Leibler divergence. This method maps a time series to a directed network according to a geometric criterion. The degree of irreversibility of the series is then estimated by the Kullback-Leibler divergence (i.e. the distinguishability) between the in and out degree distributions of the associated graph. The method is computationally efficient and does not require any ad hoc symbolization process. We find that the method correctly distinguishes between reversible and irreversible stationary time series, including analytical and numerical studies of its performance for: (i) reversible stochastic processes (uncorrelated and Gaussian linearly correlated), (ii) irreversible stochastic processes (a discrete flashing ratchet in an asymmetric potential), (iii) reversible (conservative) and irreversible (dissipative) chaotic maps, and (iv) dissipative chaotic maps in the presence of noise. Two alternative graph functionals, the degree and the degree-degree distributions, can be used as the Kullback-Leibler divergence argument. The former is simpler and more intuitive and can be used as a benchmark, but in the case of an irreversible process with null net current, the degree-degree distribution has to be considered to identify the irreversible nature of the series

Aging mechanisms

Aging (senescence) has long been a difficult issue to be experimentally analyzed because of stochastic processes, which contrast with the programmed events during early development. However, we have recently started to learn the molecular mechanisms that control aging. Studies of the mutant mouse, klotho, showing premature aging, raise a possibility that mammals have an “anti-aging hormone.” A decrease of cell proliferation ability caused by the telomeres is also tightly linked to senescence. Frontier experimental studies of aging at the molecular level are leading to fascinating hypotheses that aging is the price we had to pay for the evolution of the sexual reproduction system that produces a variety of genetic information and complex body structures.

Desenvolvimento de um controlador preditivo estocástico para processos da indústria química.

O sucesso de estratégias de controle preditivo baseado em modelo (MPC, na sigla em inglês) tanto em ambiente industrial quanto acadêmico tem sido marcante. No entanto, ainda há diversas questões em aberto na área, especialmente quando a hipótese simplificadora de modelo perfeito é abandonada. A consideração explícita de incertezas levou a importantes progressos na área de controle robusto, mas esta ainda apresenta alguns problemas: a alta demanda computacional e o excesso de conservadorismo são questões que podem ter prejudicado a aplicação de estratégias de controle robusto na prática. A abordagem de controle preditivo estocástico (SMPC, na sigla em inglês) busca a redução do conservadorismo através da incorporação de informação estatística dos ruídos. Como processos na indústria química sempre estão sujeito a distúrbios, seja devido a diferenças entre planta e modelo ou a distúrbios não medidos, está técnica surge como uma interessante alternativa para o futuro. O principal objetivo desta tese é o desenvolvimento de algoritmos de SMPC que levem em conta algumas das especificidades de tais processos, as quais não foram adequadamente tratadas na literatura até o presente. A contribuição mais importante é a inclusão de ação integral no controlador através de uma descrição do modelo em termos de velocidade. Além disso, restrições obrigatórias (hard) nas entradas associadas a limites físicos ou de segurança e restrições probabilísticas nos estados normalmente advindas de especificações de produtos também são consideradas na formulação. Duas abordagens foram seguidas neste trabalho, a primeira é mais direta enquanto a segunda fornece garantias de estabilidade em malha fechada, contudo aumenta o conservadorismo. Outro ponto interessante desenvolvido nesta tese é o controle por zonas de sistemas sujeitos a distúrbios. Essa forma de controle é comum na indústria devido à falta de graus de liberdade, sendo a abordagem proposta a primeira contribuição da literatura a unir controle por zonas e SMPC. Diversas simulações de todos os controladores propostos e comparações com modelos da literatura são exibidas para demonstrar o potencial de aplicação das técnicas desenvolvidas.

Estimação do índice de memória em processos estocásticos com memória longa: uma abordagem via ABC

Neste trabalho propomos o uso de um método Bayesiano para estimar o parâmetro de memória de um processo estocástico com memória longa quando sua função de verossimilhança é intratável ou não está disponível. Esta abordagem fornece uma aproximação para a distribuição a posteriori sobre a memória e outros parâmetros e é baseada numa aplicação simples do método conhecido como computação Bayesiana aproximada (ABC). Alguns estimadores populares para o parâmetro de memória serão revisados e comparados com esta abordagem. O emprego de nossa proposta viabiliza a solução de problemas complexos sob o ponto de vista Bayesiano e, embora aproximativa, possui um desempenho muito satisfatório quando comparada com métodos clássicos.

Dynamical Scenarios for Chromosome Bi-orientation

Chromosome bi-orientation at the metaphase spindle is essential for precise segregation of the genetic material. The process is error-prone, and error-correction mechanisms exist to switch misaligned chromosomes to the correct, bi-oriented configuration. Here, we analyze several possible dynamical scenarios to explore how cells might achieve correct bi-orientation in an efficient and robust manner. We first illustrate that tension-mediated feedback between the sister kinetochores can give rise to a bistable switch, which allows robust distinction between a loose attachment with low tension and a strong attachment with high tension. However, this mechanism has difficulties in explaining how bi-orientation is initiated starting from unattached kinetochores. We propose four possible mechanisms to overcome this problem (exploiting molecular noise; allowing an efficient attachment of kinetochores already in the absence of tension; a trial-and-error oscillation; and a stochastic bistable switch), and assess their impact on the bi-orientation process. Based on our results and supported by experimental data, we put forward a trial-and-error oscillation and a stochastic bistable switch as two elegant mechanisms with the potential to promote bi-orientation both efficiently and robustly.

DUI client characteristics - an interim analysis of the random assignment process. Interim report.

National Highway Traffic Safety Administration, Office of Driver and Pedestrian Programs, Washington, D.C.

The output display of Transformatrix.

"Supported in part by ... Contract no. AEC AT(11-1)1469."

BUM--bundle processing machine.

Thesis (M.A.)--University of Illinois.

Remote power supply from the APE system /

Supported by: Office of Naval Research under contract N000 14-67-A-0305-0007.

Aspects of Markov Chains and Particle Systems

Thesis (Ph.D.)--University of Washington, 2016-06

Random recursion

Thesis (Ph.D.)--University of Washington, 2016-06

Gaussian phase-space representations for fermions

We introduce a positive phase-space representation for fermions, using the most general possible multimode Gaussian operator basis. The representation generalizes previous bosonic quantum phase-space methods to Fermi systems. We derive equivalences between quantum and stochastic moments, as well as operator correspondences that map quantum operator evolution onto stochastic processes in phase space. The representation thus enables first-principles quantum dynamical or equilibrium calculations in many-body Fermi systems. Potential applications are to strongly interacting and correlated Fermi gases, including coherent behavior in open systems and nanostructures described by master equations. Examples of an ideal gas and the Hubbard model are given, as well as a generic open system, in order to illustrate these ideas.

On some Mixture Distributions

The aim of this paper is to establish some mixture distributions that arise in stochastic processes. Some basic functions associated with the probability mass function of the mixture distributions, such as k-th moments, characteristic function and factorial moments are computed. Further we obtain a three-term recurrence relation for each established mixture distribution.