Transitions to synchrony in coupled bursting neurons

Certain cells in the brain, for example, thalamic neurons during sleep, show spike-burst activity. We study such spike-burst neural activity and the transitions to a synchronized state using a model of coupled bursting neurons. In an electrically coupled network, we show that the increase of coupling strength increases incoherence first and then induces two different transitions to synchronized states, one associated with bursts and the other with spikes. These sequential transitions to synchronized states are determined by the zero crossings of the maximum transverse Lyapunov exponents. These results suggest that synchronization of spike-burst activity is a multi-time-scale phenomenon and burst synchrony is a precursor to spike synchrony.     

Time-delay-induced phase-transition to synchrony in coupled bursting neurons

Signal transmission time delays in a network of nonlinear oscillators are known to be responsible for a variety of interesting dynamic behaviors including phase-flip transitions leading to synchrony or out of synchrony. Here, we uncover that phase-flip transitions are general phenomena and can occur in a network of coupled bursting neurons with a variety of coupling types. The transitions are marked by nonlinear changes in both temporal and phase-space characteristics of the coupled system. We demonstrate these phase-transitions with Hindmarsh-Rose and Leech-Heart interneuron models and discuss the implications of these results in understanding collective dynamics of bursting neurons in the brain.     

How often are chaotic transients in spatially extended ecological systems?

A traditional assumption in quantitative ecology is that the asymptotic state of the model determines what can be observed in the evolution of the system. It is suggested, however, that irregular transient behaviors may be more relevant than the long term behaviors. Here we investigate how often transient dynamics can be expected in spatially extended ecological systems. Our study suggests that although chaotic transient dynamics indeed exist, sustained dynamics may be more prevalent than transient ones due to the high dimensionality of such systems.     

Estimating generating partitions of chaotic systems by unstable periodic orbits

An outstanding problem in chaotic dynamics is to specify generating partitions for symbolic dynamics in dimensions larger than 1. It has been known that the infinite number of unstable periodic orbits embedded in the chaotic invariant set provides sufficient information for estimating the generating partition. Here we present a general, dimension-independent, and efficient approach for this task based on optimizing a set of proximity functions defined with respect to periodic orbits. Our algorithm allows us to obtain the approximate location of the generating partition for the Ikeda-Hammel-Jones-Moloney map.     

Efficient contraflow algorithms for quickest evacuation planning

The optimization models and algorithms with their implementations on flow over time problems have been an emerging field of research because of largely increasing human-created and natural disasters worldwide. For an optimal use of transportation network to shift affected people and normalize the disastrous situation as quickly and Efficiently as possible, contraflow configuration is one of the highly applicable operations research (OR) models. It increases the outbound road capacities by reversing the direction of arcs towards the safe destinations that not only minimize the congestion and increase the flow but also decrease the evacuation time significantly. In this paper, we sketch the state of quickest flow solutions and solve the quickest contraflow problem with constant transit times on arcs proving that the problem can be solved in strongly polynomial time O(nm²(log n)²), where n and m are number of nodes and number of arcs, respectively in the network. This contraflow solution has the same computational time bound as that of the best min-cost flow solution. Moreover, we also introduce the contraflow approach with load dependent transit times on arcs and present an Efficient algorithm to solve the quickest contraflow problem approximately. Supporting the claim, our computational experiments on Kathmandu road network and on randomly generated instances perform very well matching the theoretical results. For sufficiently large number of evacuees, about double flow can be shifted with the same evacuation time and about half time is sufficient to push the given flow value with contraflow reconfiguration.     

Enhancement of neural synchrony by time delay

In a network of neuronal oscillators with time-delayed coupling, we uncover a phenomenon of enhancement of neural synchrony by time delay: a stable synchronized state exists at low coupling strengths for significant time delays. By formulating a master stability equation for time-delayed networks of Hindmarsh-Rose neurons, we show that there is always an extended region of stable synchronous activity corresponding to low coupling strengths. Such synchrony could be achieved in the undelayed system only by much higher coupling strengths. This phenomenon of enhanced neural synchrony by delay has important implications, in particular, in understanding synchronization of distant neurons and information processing in the brain.     

New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan

We consider the problem of minimizing the makespan in open shop scheduling. The decision problem whether a given sequence in open shop scheduling is irreducible has already been considered, however, has not been solved yet. A sequence is an acyclic orientation of the Hamming graph K _n ×K _m . Irreducible sequences in open shop are the local optimal elements. We present two variants of algorithms based on the specific properties of the H-comparability graph. The first is polynomial whereas the second is exponential. The irreducibility is co-NP. The stated properties argue whether it belongs to P. The complexity status of the considered decision problem is updated.     

Estimating Granger causality from fourier and wavelet transforms of time series data

Experiments in many fields of science and engineering yield data in the form of time series. The Fourier and wavelet transform-based nonparametric methods are used widely to study the spectral characteristics of these time series data. Here, we extend the framework of nonparametric spectral methods to include the estimation of Granger causality spectra for assessing directional influences. We illustrate the utility of the proposed methods using synthetic data from network models consisting of interacting dynamical systems.