Search results for "Combinatorics"
showing 10 items of 1770 documents
Transversal Skills in Dentistry - Content and Language Integrated Learning Approach
2016
Three periodic solutions for perturbed second order Hamiltonian systems
2009
AbstractIn this paper we study the existence of three distinct solutions for the following problem−u¨+A(t)u=∇F(t,u)+λ∇G(t,u)a.e. in [0,T],u(T)−u(0)=u˙(T)−u˙(0)=0, where λ∈R, T is a real positive number, A:[0,T]→RN×N is a continuous map from the interval [0,T] to the set of N-order symmetric matrices. We propose sufficient conditions only on the potential F. More precisely, we assume that G satisfies only a usual growth condition which allows us to use a variational approach.
Efficient simulation of the random-cluster model
2013
The simulation of spin models close to critical points of continuous phase transitions is heavily impeded by the occurrence of critical slowing down. A number of cluster algorithms, usually based on the Fortuin-Kasteleyn representation of the Potts model, and suitable generalizations for continuous-spin models have been used to increase simulation efficiency. The first algorithm making use of this representation, suggested by Sweeny in 1983, has not found widespread adoption due to problems in its implementation. However, it has been recently shown that it is indeed more efficient in reducing critical slowing down than the more well-known algorithm due to Swendsen and Wang. Here, we present…
Role of conditional probability in multiscale stationary markovian processes.
2010
The aim of the paper is to understand how the inclusion of more and more time-scales into a stochastic stationary Markovian process affects its conditional probability. To this end, we consider two Gaussian processes: (i) a short-range correlated process with an infinite set of time-scales bounded from below, and (ii) a power-law correlated process with an infinite and unbounded set of time-scales. For these processes we investigate the equal position conditional probability P(x,t|x,0) and the mean First Passage Time T(L). The function P(x,t|x,0) can be considered as a proxy of the persistence, i.e. the fact that when a process reaches a position x then it spends some time around that posit…
Regular and singular pulse and front solutions and possible isochronous behavior in the Extended-Reduced Ostrovsky Equation: Phase-plane, multi-infin…
2016
In this paper we employ three recent analytical approaches to investigate several classes of traveling wave solutions of the so-called extended-reduced Ostrovsky Equation (exROE). A recent extension of phase-plane analysis is first employed to show the existence of breaking kink wave solutions and smooth periodic wave (compacton) solutions. Next, smooth traveling waves are derived using a recent technique to derive convergent multi-infinite series solutions for the homoclinic orbits of the traveling-wave equations for the exROE equation. These correspond to pulse solutions respectively of the original PDEs. We perform many numerical tests in different parameter regime to pinpoint real saddl…
Fuzzy logic approach to predict vehicle crash severity from acceleration data
2015
Vehicle crash is a complex behavior to be investigated as a challenging topic in terms of dynamical modeling. On this aim, fuzzy logic can be utilized to analyze the crash dynamics rapidly and simply. In this paper, the experimental data of the frontal crash is recorded using an accelerometer located at the centre of the gravity of the vehicle. The acceleration signal was the raw data from which the collision intensity expressed by the kinetic energy and the jerk were derived. The fuzzy logic model was then developed from the two inputs namely kinetic energy and jerk. The output variable is the crash severity expressed as the dynamic crash. The result shows that the jerk contributes much to…
Symmetry breaking in a constrained cheeger type isoperimetric inequality
2015
We study the optimal constant in a Sobolev inequality for BV functions with zero mean value and vanishing outside a bounded open set. We are interested in finding the best possible embedding constant in terms of the measure of the domain alone. We set up an optimal shape problem and we completely characterize the behavior of optimal domains.
Convergence of Markovian Stochastic Approximation with discontinuous dynamics
2016
This paper is devoted to the convergence analysis of stochastic approximation algorithms of the form $\theta_{n+1} = \theta_n + \gamma_{n+1} H_{\theta_n}({X_{n+1}})$, where ${\left\{ {\theta}_n, n \in {\mathbb{N}} \right\}}$ is an ${\mathbb{R}}^d$-valued sequence, ${\left\{ {\gamma}_n, n \in {\mathbb{N}} \right\}}$ is a deterministic stepsize sequence, and ${\left\{ {X}_n, n \in {\mathbb{N}} \right\}}$ is a controlled Markov chain. We study the convergence under weak assumptions on smoothness-in-$\theta$ of the function $\theta \mapsto H_{\theta}({x})$. It is usually assumed that this function is continuous for any $x$; in this work, we relax this condition. Our results are illustrated by c…
Probabilistic interpretation of the Calderón problem
2017
In this paper, we use the theory of symmetric Dirichlet forms to give a probabilistic interpretation of Calderon's inverse conductivity problem in terms of reflecting diffusion processes and their corresponding boundary trace processes. This probabilistic interpretation comes in three equivalent formulations which open up novel perspectives on the classical question of unique determinability of conductivities from boundary data. We aim to make this work accessible to both readers with a background in stochastic process theory as well as researchers working on deterministic methods in inverse problems.
Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms
1997
We introduce a new multidimensional pattern matching problem that is a natural generalization of string matching, a well studied problem1. The motivation for its algorithmic study is mainly theoretical. LetA1:n1,?,1:nd be a text matrix withN=n1?ndentries andB1:m1,?,1:mr be a pattern matrix withM=m1?mrentries, whered?r?1 (the matrix entries are taken from an ordered alphabet ?). We study the problem of checking whether somer-dimensional submatrix ofAis equal toB(i.e., adecisionquery).Acan be preprocessed andBis given on-line. We define a new data structure for preprocessingAand propose CRCW-PRAM algorithms that build it inO(logN) time withN2/nmaxprocessors, wherenmax=max(n1,?,nd), such that …