Search results for "Simulation."
showing 10 items of 4779 documents
The Asynchronous Leontief Model
1992
International audience; The traditional dynamic Leontief model is synchronous: every vertex acts simultaneously. A model with delays of action has been proposed, but it still remains synchronous. In this paper we propose an asynchronous version of the model that allows realistic computations. We fiurnish an algorithm and a program.
Fixed point results on metric and partial metric spaces via simulation functions
2015
We prove existence and uniqueness of fixed point, by using a simulation function and a lower semi-continuous function in the setting of metric space. As consequences of this study, we deduce several related fixed point results, in metric and partial metric spaces. An example is given to support the new theory.
Construction of chaotic dynamical system
2010
The first‐order difference equation xn+ 1 = f(xn ), n = 0,1,…, where f: R → R, is referred as an one‐dimensional discrete dynamical system. If function f is a chaotic mapping, then we talk about chaotic dynamical system. Models with chaotic mappings are not predictable in long‐term. In this paper we consider family of chaotic mappings in symbol space S 2. We use the idea of topological semi‐conjugacy and so we can construct a family of mappings in the unit segment such that it is chaotic. First published online: 09 Jun 2011
A simple algorithm for generating neuronal dendritic trees
1990
Abstract A simple, efficient algorithm is presented for generating the codewords of all neuronal dendritic trees with a given number of terminal nodes. Furthermore, a procedure is developed for deciding if different codewords correspond to topologically equivalent trees.
Periodic and Chaotic Orbits of a Neuron Model
2015
In this paper we study a class of difference equations which describes a discrete version of a single neuron model. We consider a generalization of the original McCulloch-Pitts model that has two thresholds. Periodic orbits are investigated accordingly to the different range of parameters. For some parameters sufficient conditions for periodic orbits of arbitrary periods have been obtained. We conclude that there exist values of parameters such that the function in the model has chaotic orbits. Models with chaotic orbits are not predictable in long-term.
Exceptional Quantum Walk Search on the Cycle
2016
Quantum walks are standard tools for searching graphs for marked vertices, and they often yield quadratic speedups over a classical random walk's hitting time. In some exceptional cases, however, the system only evolves by sign flips, staying in a uniform probability distribution for all time. We prove that the one-dimensional periodic lattice or cycle with any arrangement of marked vertices is such an exceptional configuration. Using this discovery, we construct a search problem where the quantum walk's random sampling yields an arbitrary speedup in query complexity over the classical random walk's hitting time. In this context, however, the mixing time to prepare the initial uniform state…
Common fixed point theorems for families of occasionally weakly compatible mappings
2011
We prove some common fixed point theorems in probabilistic semi-metric spaces for families of occasionally weakly compatible mappings. We also give a common fixed point theorem for mappings satisfying an integral-type implicit relation.
On Different Type Solutions of Boundary Value Problems
2016
We consider boundary value problems of the type x'' = f(t, x, x'), (∗) x(a) = A, x(b) = B. A solution ξ(t) of the above BVP is said to be of type i if a solution y(t) of the respective equation of variations y'' = fx(t, ξ(t), ξ' (t))y + fx' (t, ξ(t), ξ' (t))y' , y(a) = 0, y' (a) = 1, has exactly i zeros in the interval (a, b) and y(b) 6= 0. Suppose there exist two solutions x1(t) and x2(t) of the BVP. We study properties of the set S of all solutions x(t) of the equation (∗) such that x(a) = A, x'1(a) ≤ x' (a) ≤ x'2(a) provided that solutions extend to the interval [a, b].
Ultrasonic Guided Waves-Based Monitoring of Rail Head: Laboratory and Field Tests
2010
Recent train accidents have reaffirmed the need for developing a rail defect detection system more effective than that currently used. One of the most promising techniques in rail inspection is the use of ultrasonic guided waves and noncontact probes. A rail inspection prototype based on these concepts and devoted to the automatic damage detection of defects in rail head is the focus of this paper. The prototype includes an algorithm based on wavelet transform and outlier analysis. The discrete wavelet transform is utilized to denoise ultrasonic signals and to generate a set of relevant damage sensitive data. These data are combined into a damage index vector fed to an unsupervised learning…
Regularization of optical flow with M-band wavelet transform
2003
The optical flow is an important tool for problems arising in the analysis of image sequences. Flow fields generated by various existing solving techniques are often noisy and partially incorrect, especially near occlusions or motion boundaries. Therefore, the additional information on the scene gained from a sequence of images is usually worse. In this paper, discrete wavelet transform has been adopted in order to enhance the reliability of optical flow estimation. A generalization of the well-known dyadic orthonormal wavelets to the case of the dilation scale factor M > 2 with N vanishing moments has been used, and it has proved to be a useful regularizing tool. The advantages in the comp…