scholarly journals Transient Probability Functions: A Sample Path Approach

2003 ◽  
Vol DMTCS Proceedings vol. AC,... (Proceedings) ◽  
Author(s):  
Michael L. Green ◽  
Alan Krinik ◽  
Carrie Mortensen ◽  
Gerardo Rubino ◽  
Randall J. Swift
Keyword(s):  
Markov Processes ◽  
Solution Method ◽  
Sample Path ◽  
Dual Processes ◽  
New Approach ◽  
Probability Functions ◽  
Counting Approach ◽  
International Audience ◽  
Path Counting ◽  
Transient Probability

International audience A new approach is used to determine the transient probability functions of Markov processes. This new solution method is a sample path counting approach and uses dual processes and randomization. The approach is illustrated by determining transient probability functions for a three-state Markov process. This approach also provides a way to calculate transient probability functions for Markov processes which have specific sample path characteristics.

Performing the ‘lifeworld’ in public education campaigns

2010 ◽  
Vol 1 (2) ◽  
pp. 284-310 ◽  
Author(s):  
Michelle M. Lazar
Keyword(s):  
Public Education ◽  
Rap Music ◽  
Dual Processes ◽  
Public Performance ◽  
New Approach ◽  
The Public ◽  
Local Television ◽  
The Media ◽  
Education Campaigns ◽  
Real Person

In Singapore, top down public education campaigns have long been a mode of governance by which the conduct of citizens is constantly regulated. This article examines how in two fairly recent campaigns, a new approach to campaign communication is used that involves media interdiscursivity, viz., the mixing of discourses and genres in which the media constitute a significant element. The present approach involves the appropriation of a popular local television character, ‘Phua Chu Kang’, in order to address the public through educational rap music videos. Media interdiscursivity is based on an attempt to engage the public via a discourse of the ‘lifeworld’. The present article analyzes the ‘lifeworld’ discourse in terms of a combination of two processes, ‘informalization’ (the use of informal and conversational modes of address) and ‘communitization’ (the semiotic construction of a community of people). The dual processes are examined and discussed in relation to the choice of Phua Chu Kang as an ‘ordinary’ and almost ‘real’ person, including his informal register and speech style; his use of Singlish; and his construction of ‘community.’ The presence of Singlish, in particular, is interesting because (despite the official disdain for the language) it is included as part of PCK’s public performance of the lifeworld. The article concludes by considering this form of media interdiscursivity as the government’s shrewd way of achieving its social governance goals.

scholarly journals Generalized eigenfunctions for quantum walks via path counting approach

2021 ◽  
pp. 2150019
Author(s):  
Takashi Komatsu ◽  
Norio Konno ◽  
Hisashi Morioka ◽  
Etsuo Segawa
Keyword(s):  
Asymptotic Behavior ◽  
Quantum Walk ◽  
Scattering Matrix ◽  
Quantum Walks ◽  
Tunneling Effect ◽  
Counting Approach ◽  
Finite Rank Perturbation ◽  
Generalized Eigenfunctions ◽  
The Green Function ◽  
Path Counting

We consider the time-independent scattering theory for time evolution operators of one-dimensional two-state quantum walks. The scattering matrix associated with the position-dependent quantum walk naturally appears in the asymptotic behavior at the spatial infinity of generalized eigenfunctions. The asymptotic behavior of generalized eigenfunctions is a consequence of an explicit expression of the Green function associated with the free quantum walk. When the position-dependent quantum walk is a finite rank perturbation of the free quantum walk, we derive a kind of combinatorial construction of the scattering matrix by counting paths of quantum walkers. We also mention some remarks on the tunneling effect.

Markovian manpower models in continuous time

1977 ◽  
Vol 14 (02) ◽  
pp. 249-259 ◽  
Author(s):  
Alexander Mehlmann
Keyword(s):  
Markov Processes ◽  
Continuous Time ◽  
Asymptotic Form ◽  
New Approach ◽  
Limiting Behaviour

The problem of determining the asymptotic form of the stock vector n (t) in a continuous time Markovian manpower model is solved for asymptotically exponential recruitment functions {R(t)}. A new approach to the limiting behaviour of some manpower systems with given total sizes {N(t)} is then given by means of time-inhomogeneous Markov processes.

scholarly journals Chance-Constrained Optimal Path Planning With Obstacles

2011 ◽  
Vol 27 (6) ◽  
pp. 1080-1094 ◽  
Author(s):  
Lars Blackmore ◽  
Masahiro Ono ◽  
Brian C. Williams
Keyword(s):  
Autonomous Vehicles ◽  
Solution Method ◽  
Optimal Path ◽  
Computation Time ◽  
Global Optimality ◽  
New Approach ◽  
Optimal Path Planning ◽  
Modeling Errors ◽  
Chance Constrained Approach ◽  
Probability Of Collision

Autonomous vehicles need to plan trajectories to a specified goal that avoid obstacles. For robust execution, we must take into account uncertainty, which arises due to uncertain localization, modeling errors, and disturbances. Prior work handled the case of set-bounded uncertainty. We present here a chance-constrained approach, which uses instead a probabilistic representation of uncertainty. The new approach plans the future probabilistic distribution of the vehicle state so that the probability of failure is below a specified threshold. Failure occurs when the vehicle collides with an obstacle or leaves an operator-specified region. The key idea behind the approach is to use bounds on the probability of collision to show that, for linear-Gaussian systems, we can approximate the nonconvex chance-constrained optimization problem as a disjunctive convex program. This can be solved to global optimality using branch-and-bound techniques. In order to improve computation time, we introduce a customized solution method that returns almost-optimal solutions along with a hard bound on the level of suboptimality. We present an empirical validation with an aircraft obstacle avoidance example.

scholarly journals The stationary probability density of a class of bounded Markov processes

2010 ◽  
Vol 42 (04) ◽  
pp. 986-993 ◽  
Author(s):  
Muhamad Azfar Ramli ◽  
Gerard Leng
Keyword(s):  
Differential Equation ◽  
Integral Equation ◽  
Markov Process ◽  
Probability Density ◽  
Markov Processes ◽  
Transition Probability ◽  
Stationary Probability ◽  
Probability Functions ◽  
Stationary Probability Density

In this paper we generalize a bounded Markov process, described by Stoyanov and Pacheco-González for a class of transition probability functions. A recursive integral equation for the probability density of these bounded Markov processes is derived and the stationary probability density is obtained by solving an equivalent differential equation. Examples of stationary densities for different transition probability functions are given and an application for designing a robotic coverage algorithm with specific emphasis on particular regions is discussed.

scholarly journals A Sample Path Proof of the Duality for Stochastically Monotone Markov Processes

1985 ◽  
Vol 13 (2) ◽  
pp. 558-565 ◽  
Author(s):  
Peter Clifford ◽  
Aidan Sudbury
Keyword(s):  
Markov Processes ◽  
Sample Path

scholarly journals Détection des préoccupations transversales par l'analyse formelle de concepts des diagrammes de séquence

2014 ◽  
Vol Volume 18, 2014 ◽  
Author(s):  
Fairouz Dahi ◽  
Nora Bounour
Keyword(s):  
Formal Concept Analysis ◽  
Source Code ◽  
Object Oriented ◽  
Formal Concept ◽  
Conceptual Level ◽  
Sequence Diagrams ◽  
New Approach ◽  
Crosscutting Concerns ◽  
International Audience ◽  
Industrial Adoption

International audience The existence of crosscutting concerns tangled or scattered, complicates the understanding and evolution of object oriented source code. The industrial adoption of aspect-oriented paradigm has led to research new approaches supporting aspect oriented migration. This migration requires the identification of crosscutting concerns, in order to encapsulate them into aspects. We propose in this paper a new approach for the identification of crosscutting concerns at the conceptual level. We materialize this latter by the UML class and sequence diagrams. We use the formal concept analysis to group scattered functionalities in sequence diagrams, and we analyze the order of method calls to detect the tangled ones. Then, we filter all obtained candidate aspects, in order to avoid the mistakes.

scholarly journals Asymptotic variance of random symmetric digital search trees

2010 ◽  
Vol Vol. 12 no. 2 ◽  
Author(s):  
Hsien-Kuei Hwang ◽  
Michael Fuchs ◽  
Vytas Zacharovas
Keyword(s):  
Generating Functions ◽  
Asymptotic Variance ◽  
Shape Parameters ◽  
Search Trees ◽  
New Approach ◽  
Total Path Length ◽  
Digital Search Trees ◽  
Combined Use ◽  
International Audience ◽  
Digital Search

Dedicated to the 60th birthday of Philippe Flajolet International audience Asymptotics of the variances of many cost measures in random digital search trees are often notoriously messy and involved to obtain. A new approach is proposed to facilitate such an analysis for several shape parameters on random symmetric digital search trees. Our approach starts from a more careful normalization at the level of Poisson generating functions, which then provides an asymptotically equivalent approximation to the variance in question. Several new ingredients are also introduced such as a combined use of the Laplace and Mellin transforms and a simple, mechanical technique for justifying the analytic de-Poissonization procedures involved. The methodology we develop can be easily adapted to many other problems with an underlying binomial distribution. In particular, the less expected and somewhat surprising n (logn)(2)-variance for certain notions of total path-length is also clarified.

Sign in / Sign up

Export Citation Format

Share Document