A Multiperiod Maximal Covering Location Model for the Optimal Location of Intersection Safety Cameras on an Urban Traffic Network

In this paper we propose a multiperiod optimization model based on the maximal covering location problem in order to support safety policies within urban areas. In particular, we focus on the field of car accidents control, by considering the problem of the optimal location of intersection safety cameras (ISC) on an urban traffic network to maximize road control and reduce the number and the impact of car accidents. The effectiveness of accidents prevention programs can be increased by changing periodically the position of the available ISCs on a given time horizon.

Bubbling reduces intermittency in turbulent thermal convection

Intermittency effects are numerically studied in turbulent bubbling Rayleigh-Benard (RB) flow and compared to the standard RB case. The vapour bubbles are modelled with a Euler-Lagrangian scheme and are two-way coupled to the flow and temperature fields, both mechanically and thermally. To quantify the degree of intermittency we use probability density functions, structure functions, extended self-similarity (ESS) and generalized extended self-similarity (GESS) for both temperature and velocity differences.

GAUSS-DIFFUSION PROCESSES FOR MODELING THE DYNAMICS OF A COUPLE OF INTERACTING NEURONS

With the aim to describe the interaction between a couple of neurons a stochastic model is proposed and formalized. In such a model, maintaining statements of the Leaky Integrate-and-Fire framework, we include a random component in the synaptic current, whose role is to modify the equilibrium point of the membrane potential of one of the two neurons and when a spike of the other one occurs it is turned on. The initial and after spike reset positions do not allow to identify the inter-spike intervals with the corresponding first passage times.

On the use of synchronous and asynchronous single-objective deterministic particle swarm optimization in ship design problems

. A guideline for an effective and efficient use of a deterministic variant of the Particle Swarm Optimization (PSO) algorithm is presented and discussed, assuming limited computational resources. PSO was introduced in Kennedy and Eberhart (1995) and successfully applied in many fields of engineering optimization for its ease of use. Its performance depends on three main characteristics: the number of swarm particles used, their initialization in terms of initial location and speed, and the set of coefficients defining the behavior of the swarm.

A SIMPLE ALGORITHM TO GENERATE FIRING TIMES FOR LEAKY INTEGRATE-AND-FIRE NEURONAL MODEL

A method to generate first passage times for a class of stochastic processes is proposed. It does not require construction of the trajectories as usually needed in simulation studies, but is based on an integral equation whose unknown quantity is the probability density function of the studied first passage times and on the application of the hazard rate method. The proposed procedure is particularly efficient in the case of the Ornstein-Uhlenbeck process, which is important for modeling spiking neuronal activity.