Critical timescales and time intervals for coupled linear processes

In 1991, McNabb introduced the concept of mean action time (MAT) as a finite measure of the time required for a diffusive process to effectively reach steady state. Although this concept was initially adopted by others within the Australian and New Zealand applied mathematics community, it appears to have had little use outside this region until very recently, when in 2010 Berezhkovskii and coworkers rediscovered the concept of MAT in their study of morphogen gradient formation. All previous work in this area has been limited to studying single–species differential equations, such as the linear advection–diffusion–reaction equation. Here we generalise the concept of MAT by showing how the theory can be applied to coupled linear processes. We begin by studying coupled ordinary differential equations and extend our approach to coupled partial differential equations. Our new results have broad applications including the analysis of models describing coupled chemical decay and cell differentiation processes, amongst others.

Rigorous finite-time guarantees for optimization on continuous domains by simulated annealing

Simulated annealing is a popular method for approaching the solution of a global optimization problem. Existing results on its performance apply to discrete combinatorial optimization where the optimization variables can assume only a finite set of possible values. We introduce a new general formulation of simulated annealing which allows one to guarantee finite-time performance in the optimization of functions of continuous variables. The results hold universally for any optimization problem on a bounded domain and establish a connection between simulated annealing and up-to-date theory of convergence of Markov chain Monte Carlo methods on continuous domains. This work is inspired by the concept of finite-time learning with known accuracy and confidence developed in statistical learning theory.

Simulated Annealing: Rigorous finite-time guarantees for optimization on continuous domains

Simulated annealing is a popular method for approaching the solution of a global optimization problem. Existing results on its performance apply to discrete combinatorial optimization where the optimization variables can assume only a finite set of possible values. We introduce a new general formulation of simulated annealing which allows one to guarantee finite-time performance in the optimization of functions of continuous variables. The results hold universally for any optimization problem on a bounded domain and establish a connection between simulated annealing and up-to-date theory of convergence of Markov chain Monte Carlo methods on continuous domains. This work is inspired by the concept of finite-time learning with known accuracy and confidence developed in statistical learning theory.

Addressing time intervals

One of the fundamental questions regarding the temporal ontology is what is time composed of. While the traditional time structure is based on a set of points, a notion that has been prevalently adopted in classical physics and mathematics, it has also been noticed that intervals have been widely adopted for expre~sion of common sense temporal knowledge, especially in the domain of artificial intelligence. However, there has been a longstanding debate on how intervals should be addressed, leading to two different approaches to the treatment of intervals. In the first, intervals are addressed as derived objects constructed from points, e.g., as sets of points, or as pairs of points. In the second, intervals are taken as primitive themselves. This article provides a critical examination of these two approaches. By means of proposing a definition of intervals in terms of points and types, we shall demonstrate that, while the two different approaches have been viewed as rivals in the literature, they are actually reducible to logically equivalent expressions under some requisite interpretations, and therefore they can also be viewed as allies.

The mediastinal staging accuracy of 18F-Fluorodeoxyglycose Positron Emission Tomography/Computed Tomography in non-small cell lung cancer with variable time intervals to surgery.

BACKGROUND: PET/CT scanning can determine suitability for curative therapy and inform decision making when considering radical therapy in patients with non-small cell lung cancer (NSCLC). Metastases to central mediastinal lymph nodes (N2) may alter such management decisions. We report a 2 year retrospective series assessing N2 lymph node staging accuracy with PET/CT compared to pathological analysis at surgery.

METHODS: Patients with NSCLC attending our centre (excluding those who had induction chemotherapy) who had staging PET/CT scans and pathological nodal sampling between June 2006 and June 2008 were analysed. For each lymph node assessed pathologically, the corresponding PET/CT status was determined. 64 patients with 200 N2 lymph nodes were analysed.

RESULTS: Sensitivity of PET/CT scans for indentifying involved N2 lymph nodes was
39%, specificity 96% and overall accuracy 90%. For individual lymph node analysis, logistic regression demonstrated a significant linear association between PET/CT sensitivity and time from scanning to surgery (p=0.031) but not for specificity and accuracy. Those scanned <9 weeks before pathological sampling were significantly more sensitive (64% >9 weeks, 0% ≥ 9 weeks, p=0.013) and more accurate (94% <9 weeks, 81% ≥ 9 weeks, p=0.007). Differences in specificity were not seen (97% <9 weeks, 91% ≥ 9 weeks, p=0.228). No significant difference in specificity was found at any time point.

CONCLUSIONS: We recommend that if a PET/CT scan is older than 9 weeks, and management would be altered by the presence of N2 nodes, re-staging of the
mediastinum should be undertaken.

Collateral, default penalties and almost finite-time solvency

We argue that it is possible to adapt the approach of imposing restrictions on available plans through finitely effective debt constraints, introduced by Levine and Zame (1996), to encompass models with default and collateral. Along this line, we introduce in the setting of Araujo, Páscoa and Torres-Martínez (2002) and Páscoa and Seghir (2008) the concept of almost finite-time solvency. We show that the conditions imposed in these two papers to rule out Ponzi schemes implicitly restrict actions to be almost finite-time solvent. We define the notion of equilibrium with almost finite-time solvency and look on sufficient conditions for its existence. Assuming a mild assumption on default penalties, namely that agents are myopic with respect to default penalties, we prove that existence is guaranteed (and Ponzi schemes are ruled out) when actions are restricted to be almost finite-time solvent. The proof is very simple and intuitive. In particular, the main existence results in Araujo et al. (2002) and Páscoa and Seghir (2008) are simple corollaries of our existence result.

Influence of Remineralizing Gels on Bleached Enamel Microhardness In Different Time Intervals

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

UNIFORMLY ACCELERATED FINITE-TIME DETECTORS

The behavior of uniformly accelerated detectors in the Minkowski and Rindler vacua is analyzed when the detector is coupled to a scalar field during a finite amount of time T. We point out that the logarithmic ultraviolet divergences reported in the literature are due to the instantaneous switching of the detector. We explicitly show this by considering a detector switched on and off continuously. The usual Planckian spectrum for the excitation probability is recovered in the limit T --> infinity.

Local dimension and finite time prediction in spatiotemporal chaotic systems

Predictability is related to the uncertainty in the outcome of future events during the evolution of the state of a system. The cluster weighted modeling (CWM) is interpreted as a tool to detect such an uncertainty and used it in spatially distributed systems. As such, the simple prediction algorithm in conjunction with the CWM forms a powerful set of methods to relate predictability and dimension.

Local dimension and finite time prediction in coupled map lattices

Forecasting, for obvious reasons, often become the most important goal to be achieved. For spatially extended systems (e.g. atmospheric system) where the local nonlinearities lead to the most unpredictable chaotic evolution, it is highly desirable to have a simple diagnostic tool to identify regions of predictable behaviour. In this paper, we discuss the use of the bred vector (BV) dimension, a recently introduced statistics, to identify the regimes where a finite time forecast is feasible. Using the tools from dynamical systems theory and Bayesian modelling, we show the finite time predictability in two-dimensional coupled map lattices in the regions of low BV dimension. © Indian Academy of Sciences.

A maximum principle for infinite time asymptotically stable impulsive dynamic control systems

We consider an infinite horizon optimal impulsive control problems for which a given cost function is minimized by choosing control strategies driving the state to a point in a given closed set C ∞. We present necessary conditions of optimality in the form of a maximum principle for which the boundary condition of the adjoint variable is such that non-degeneracy due to the fact that the time horizon is infinite is ensured. These conditions are given for conventional systems in a first instance and then for impulsive control problems. They are proved by considering a family of approximating auxiliary interval conventional (without impulses) optimal control problems defined on an increasing sequence of finite time intervals. As far as we know, results of this kind have not been derived previously. © 2010 IFAC.

Finite-time synchronization of tunnel-diode-based chaotic oscillators

This paper addresses the problem of finite-time synchronization of tunnel diode based chaotic oscillators. After a brief investigation of its chaotic dynamics, we propose an active adaptive feedback coupling which accomplishes the synchronization of tunnel-diode-based chaotic systems with and without the presence of delay(s), basing ourselves on Lyapunov and on Krasovskii-Lyapunov stability theories. This feedback coupling could be applied to many other chaotic systems. A finite horizon can be arbitrarily established by ensuring that chaos synchronization is achieved at a pre-established time. An advantage of the proposed feedback coupling is that it is simple and easy to implement. Both mathematical investigations and numerical simulations followed by PSPICE experiment are presented to show the feasibility of the proposed method.

Finite time blow-up and breaking of solitary wind waves

The evolution of surface water waves in finite depth under wind forcing is reduced to an antidissipative Korteweg-de Vries-Burgers equation. We exhibit its solitary wave solution. Antidissipation accelerates and increases the amplitude of the solitary wave and leads to blow-up and breaking. Blow-up occurs in finite time for infinitely large asymptotic space so it is a nonlinear, dispersive, and antidissipative equivalent of the linear instability which occurs for infinite time. Due to antidissipation two given arbitrary and adjacent planes of constant phases of the solitary wave acquire different velocities and accelerations inducing breaking. Soliton breaking occurs in finite space in a time prior to the blow-up. We show that the theoretical growth in amplitude and the time of breaking are both testable in an existing experimental facility.