Search results for "Modeling and Simulation"
showing 10 items of 1561 documents
The computational complexity of the relative robust shortest path problem with interval data
2004
Abstract The paper deals with the relative robust shortest path problem in a directed arc weighted graph, where arc lengths are specified as intervals containing possible realizations of arc lengths. The complexity status of this problem has been unknown in the literature. We show that the problem is NP -hard.
The computational complexity of the criticality problems in a network with interval activity times
2002
Abstract The paper analyzes the criticality in a network with interval activities duration times. A natural generalization of the criticality notion (for a path, an activity and an event) for the case of network with interval activity duration times is given. The computation complexity of five problems linked to the introduced criticality notion is presented.
On a pair of fuzzy $\varphi$-contractive mappings
2010
We establish common fixed point theorems for fuzzy mappings under a $\varphi$-contraction condition on a metric space with the d_$\infty$-metric (induced by the Hausdorff metric) on the family of fuzzy sets. The study of fixed points of fuzzy set-valued mappings related to the d_$\infty$-metric is useful in geometric problems arising in high energy physics. Our results generalize some recent results.
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
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].
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…
A Mellin transform approach to wavelet analysis
2015
The paper proposes a fractional calculus approach to continuous wavelet analysis. Upon introducing a Mellin transform expression of the mother wavelet, it is shown that the wavelet transform of an arbitrary function f(t) can be given a fractional representation involving a suitable number of Riesz integrals of f(t), and corresponding fractional moments of the mother wavelet. This result serves as a basis for an original approach to wavelet analysis of linear systems under arbitrary excitations. In particular, using the proposed fractional representation for the wavelet transform of the excitation, it is found that the wavelet transform of the response can readily be computed by a Mellin tra…