Exact solution to the mean exit time problem for free inertial processes driven by Gaussian white noise

We obtain the exact analytical expression, up to a quadrature, for the mean exit time, T(x,v), of a free inertial process driven by Gaussian white noise from a region (0,L) in space. We obtain a completely explicit expression for T(x,0) and discuss the dependence of T(x,v) as a function of the size L of the region. We develop a new method that may be used to solve other exit time problems.

Exact solution to the exit-time problem for an undamped free particle driven by Gaussian white noise

In a recent paper [Phys. Rev. Lett. 75, 189 (1995)] we have presented the exact analytical expression for the mean exit time, T(x,v), of a free inertial process driven by Gaussian white noise out of a region (0,L) in space. In this paper we give a detailed account of the method employed and present results on asymptotic properties and averages of T(x,v).

Switching-off in a minimal time a fitzhugh-nagumo system

This paper deals with a system that describes an electrical circuitcomposed by a linear system coupled to a nonlinear one involving a tunneldiode in a flush-and-fill circuit. One of the most comprehensive models for thiskind of circuits was introduced by R. Fitzhugh in 1961, when taking on carebiological tasks. The equation has in its phase plane only two periodic solutions,namely, the unstable singular point S0 and the stable cycle Γ. If the system isat rest on S0, the natural flow of orbits seeks to switch-on the process by going- as time goes by - toward its steady-state, Γ. By using suitable controls it ispossible to reverse such natural tendency going in a minimal time from Γ toS0, switching-off in this way the system. To achieve this goal it is mandatorya minimal enough strength on controls. These facts will be shown by means ofconsiderations on the null control sets in the process.

The minimal covering problem and automated design of two-level and/or optimal networks /

Vita.

Aproximação para Problema de Controle Ótimo Impulsivo e Problema de Tempo Mínimo sobre Domínios Estratificados

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

Semi-Smooth Newton Methods for the Time Optimal Control of Nonautonomous Ordinary Differential Equations

AMS Subj. Classification: 49J15, 49M15

Insight toward the first-passage time in a bistable potential with highly colored noise

The exponential coefficient in the first-passage-time problem for a bistable potential with highly colored noise is predicted to be (8/27 by all existing theories. On the other hand, we show herein that all existing numerical evidence seems to indicate that the coefficient is actually larger by about (4/3, i.e., that the numerical factor in the exponent is approximately (32/81. Existing data cover values of ¿V0/D up to ~20, where V0 is the barrier height, ¿ the correlation time of the noise, and D the noise intensity. We provide an explanation for the modified coefficinet, the explanation also being based on existing numerical simulations. Whether the value (8/27 predicted by all large-¿ theories is achieved for even larger values of ¿V0/D is unknown but appears questionable (except perhaps for enormously large, experimentally inaccessible values of this factor) in view of currently available results.

Mean first-passage time for system driven by the coin-toss square wave

We study the mean-first-passage-time problem for systems driven by the coin-toss square-wave signal. Exact analytic solutions are obtained for the driftless case. We also obtain approximate solutions for the potential case. The mean-first-passage time exhibits discontinuities and a remarkable nonsmooth oscillatory behavior which, to our knowledge, has not been observed for other kinds of driving noise.

Efficient tree construction for the multicast problem

A new heuristic for the Steiner Minimal Tree problem is presented here. The method described is based on the detection of particular sets of nodes in networks, the “Hot Spot” sets, which are used to obtain better approximations of the optimal solutions. An algorithm is also proposed which is capable of improving the solutions obtained by classical heuristics, by means of a stirring process of the nodes in solution trees. Classical heuristics and an enumerative method are used CIS comparison terms in the experimental analysis which demonstrates the goodness of the heuristic discussed in this paper.

Efficient tree construction for the multicast problem

A new heuristic for the Steiner minimal tree problem is presented. The method described is based on the detection of particular sets of nodes in networks, the “hot spot” sets, which are used to obtain better approximations of the optimal solutions. An algorithm is also proposed which is capable of improving the solutions obtained by classical heuristics, by means of a stirring process of the nodes in solution trees. Classical heuristics and an enumerative method are used as comparison terms in the experimental analysis which demonstrates the capability of the heuristic discussed

About the minimum time transference in a fractional differential equation

The use of fractional calculus when modeling phenomena allows new queries concerning the deepest parts of the physical laws involved in. Here we will be dealing with an apparent paradox in which the time of transference from zero in a system with fractional derivatives can be strictly shortened relatively to the minimal time transference done in an equivalent system in the frame of the entire derivatives.

Viability, Optimality and Stability of Dynamical Systems and Estimation of Convergence of Numerical Schemes

AMS subject classification: 49N35,49N55,65Lxx.

Dendritic Cells for Real-Time Anomaly Detection

Dendritic Cells (DCs) are innate immune system cells which have the power to activate or suppress the immune system. The behaviour of human DCs is abstracted to form an algorithm suitable for anomaly detection. We test this algorithm on the real-time problem of port scan detection. Our results show a significant difference in artificial DC behaviour for an outgoing portscan when compared to behaviour for normal processes.

Regularization meets GreenAI: a new framework for image reconstruction in life sciences applications

Ill-conditioned inverse problems frequently arise in life sciences, particularly in the context of image deblurring and medical image reconstruction. These problems have been addressed through iterative variational algorithms, which regularize the reconstruction by adding prior knowledge about the problem's solution. Despite the theoretical reliability of these methods, their practical utility is constrained by the time required to converge. Recently, the advent of neural networks allowed the development of reconstruction algorithms that can compute highly accurate solutions with minimal time demands. Regrettably, it is well-known that neural networks are sensitive to unexpected noise, and the quality of their reconstructions quickly deteriorates when the input is slightly perturbed. Modern efforts to address this challenge have led to the creation of massive neural network architectures, but this approach is unsustainable from both ecological and economic standpoints. The recently introduced GreenAI paradigm argues that developing sustainable neural network models is essential for practical applications. In this thesis, we aim to bridge the gap between theory and practice by introducing a novel framework that combines the reliability of model-based iterative algorithms with the speed and accuracy of end-to-end neural networks. Additionally, we demonstrate that our framework yields results comparable to state-of-the-art methods while using relatively small, sustainable models. In the first part of this thesis, we discuss the proposed framework from a theoretical perspective. We provide an extension of classical regularization theory, applicable in scenarios where neural networks are employed to solve inverse problems, and we show there exists a trade-off between accuracy and stability. Furthermore, we demonstrate the effectiveness of our methods in common life science-related scenarios. In the second part of the thesis, we initiate an exploration extending the proposed method into the probabilistic domain. We analyze some properties of deep generative models, revealing their potential applicability in addressing ill-posed inverse problems.

On the Democratization of AI: Bridging the Gap with AutoML

Riding the wave of recent groundbreaking achievements, artificial intelligence (AI) is currently the buzzword on everybody’s lips and, allowing algorithms to learn from historical data, Machine Learning (ML) emerged as its pinnacle. The multitude of algorithms, each with unique strengths and weaknesses, highlights the absence of a universal solution and poses a challenging optimization problem. In response, automated machine learning (AutoML) navigates vast search spaces within minimal time constraints. By lowering entry barriers, AutoML emerged as promising the democratization of AI, yet facing some challenges. In data-centric AI, the discipline of systematically engineering data used to build an AI system, the challenge of configuring data pipelines is rather simple. We devise a methodology for building effective data pre-processing pipelines in supervised learning as well as a data-centric AutoML solution for unsupervised learning. In human-centric AI, many current AutoML tools were not built around the user but rather around algorithmic ideas, raising ethical and social bias concerns. We contribute by deploying AutoML tools aiming at complementing, instead of replacing, human intelligence. In particular, we provide solutions for single-objective and multi-objective optimization and showcase the challenges and potential of novel interfaces featuring large language models. Finally, there are application areas that rely on numerical simulators, often related to earth observations, they tend to be particularly high-impact and address important challenges such as climate change and crop life cycles. We commit to coupling these physical simulators with (Auto)ML solutions towards a physics-aware AI. Specifically, in precision farming, we design a smart irrigation platform that: allows real-time monitoring of soil moisture, predicts future moisture values, and estimates water demand to schedule the irrigation.