scholarly journals Typical Behaviour of Random Interval Homeomorphisms

2021 ◽  
Vol 20 (3) ◽  
Author(s):  
Jaroslav Bradík ◽  
Samuel Roth
Keyword(s):  
Random Interval ◽  
Typical Behaviour

scholarly journals Representations of hermite processes using local time of intersecting stationary stable regenerative sets

2020 ◽  
Vol 57 (4) ◽  
pp. 1234-1251
Author(s):  
Shuyang Bai
Keyword(s):  
Long Range ◽  
Local Time ◽  
Limit Theorems ◽  
Local Times ◽  
Long Range Dependence ◽  
Random Interval ◽  
Stationary Increments ◽  
Self Similar ◽  
Regenerative Sets

AbstractHermite processes are a class of self-similar processes with stationary increments. They often arise in limit theorems under long-range dependence. We derive new representations of Hermite processes with multiple Wiener–Itô integrals, whose integrands involve the local time of intersecting stationary stable regenerative sets. The proof relies on an approximation of regenerative sets and local times based on a scheme of random interval covering.

Time-variant random interval response of concrete-filled steel tubular composite curved structures

2016 ◽  
Vol 94 ◽  
pp. 122-138 ◽  
Author(s):  
Binhua Wu ◽  
Di Wu ◽  
Wei Gao ◽  
Chongmin Song
Keyword(s):  
Random Interval ◽  
Curved Structures ◽  
Interval Response

The law of the Iterated Logarithm for random interval homeomorphisms

2021 ◽  
Author(s):  
Klaudiusz Czudek ◽  
Tomasz Szarek ◽  
Hanna Wojewódka-Ściążko
Keyword(s):  
Random Interval ◽  
Iterated Logarithm ◽  
The Law

Response-Reinforcer Relationships in Variable Delay and Non-Contingent Schedules of Reinforcement

1973 ◽  
Vol 33 (2) ◽  
pp. 627-631 ◽  
Author(s):  
Gerald D. Lachter
Keyword(s):  
Multiple Schedule ◽  
Pause Duration ◽  
Interval Schedule ◽  
Variable Delay ◽  
Random Interval ◽  
Schedules Of Reinforcement ◽  
Schedule Of Reinforcement ◽  
Delay Component

Following 30 sessions of training on a 60-sec. random-interval schedule of reinforcement, 2 pigeons were exposed to a multiple schedule containing non-contingent and variable delay components that provided equal frequencies of reinforcement. The introduction of the multiple schedule resulted in decreased response rare in both components, with a higher rate maintained under the variable delay. Post-reinforcement pauses were systematically increased during the non-contingent schedule, but no systematic increases in pause duration were noted for the variable delay component.

Solving multiobjective random interval programming problems by a capable neural network framework

2018 ◽  
Vol 49 (4) ◽  
pp. 1566-1579
Author(s):  
Ziba Arjmandzadeh ◽  
Alireza Nazemi ◽  
Mohammadreza Safi
Keyword(s):  
Neural Network ◽  
Random Interval ◽  
Interval Programming

scholarly journals Human performance on random interval schedules.

2018 ◽  
Vol 44 (3) ◽  
pp. 309-321 ◽  
Author(s):  
Phil Reed ◽  
Demelza Smale ◽  
Dimitra Owens ◽  
Gary Freegard
Keyword(s):  
Human Performance ◽  
Random Interval

scholarly journals Random interval diffeomorphisms

2017 ◽  
Vol 10 (2) ◽  
pp. 241-272 ◽  
Author(s):  
Masoumeh Gharaei ◽  
◽  
Ale Jan Homburg ◽  
Keyword(s):  
Random Interval

scholarly journals Rhythmic Accessibility to Sequential Working Memory in a Theta Phase-Dependent Manner

2021 ◽  
Author(s):  
Takuya Ideriha ◽  
Junichi Ushiyama
Keyword(s):  
Working Memory ◽  
Memory Storage ◽  
Dependent Manner ◽  
Random Interval ◽  
Phase Coding ◽  
Short Period ◽  
Theta Phase ◽  
Sequential Information ◽  
The Impact ◽  
Theta Range

Working memory is active short-term memory storage that is easily accessible and underlies various activities, such as maintaining phone numbers in mind for a short period [1,2]. There is accumulating theoretical and physiological evidence that memorized items are represented rhythmically by neural oscillation in the theta range (4-7 Hz) [3,4]. However, the impact of this process on human behavior is yet to be examined. Here we show that simply memorizing sequential information affects a behavioral index (i.e., reaction time, RT) in a rhythmic manner. In the main experiment (Experiment 1), we measured RTs to a visual probe that appeared at one of two sequentially memorized locations after a random interval. Consequently, RTs to the first and second probes each fluctuated in the theta range as a function of the random interval, and the phases of the two theta fluctuations were not in phase or anti-phase, but shifted by approximately 270 degree. Interestingly, the 270 degree phase difference corresponded to the rhythm of "phase coding", where sequential information is represented on the specific phase of theta oscillation [5-7]. These relationships were not observed in tasks simply requiring attention (Experiment 2) or memorization (Experiment 3) of spatial locations without sequential order. In conclusion, the current results demonstrate that our behavior fluctuates when recalling memorized sequential items in the theta-range, suggesting that accessibility to sequential working memory is rhythmic rather than stable, possibly reflecting theta-phase coding.

scholarly journals A Probabilistic Analysis of a String Editing Problem and its Variations

1995 ◽  
Vol 4 (2) ◽  
pp. 143-166 ◽  
Author(s):  
Guy Louchard ◽  
Wojciech Szpankowski
Keyword(s):  
Generating Functions ◽  
Edit Distance ◽  
Optimal Path ◽  
Minimum Cost ◽  
Probabilistic Framework ◽  
Grid Graph ◽  
Average Value ◽  
Typical Behaviour ◽  
Maximum Minimum ◽  
Independent Model

We consider a string editing problem in a probabilistic framework. This problem is of considerable interest to many facets of science, most notably molecular biology and computer science. A string editing transforms one string into another by performing a series of weighted edit operations of overall maximum (minimum) cost. The problem is equivalent to finding an optimal path in a weighted grid graph. In this paper we provide several results regarding a typical behaviour of such a path. In particular, we observe that the optimal path (i.e. edit distance) is almost surely (a.s.) equal to αn for large n where α is a constant and n is the sum of lengths of both strings. More importantly, we show that the edit distance is well concentrated around its average value. In the so called independent model in which all weights (in the associated grid graph) are statistically independent, we derive some bounds for the constant α. As a by-product of our results, we also present a precise estimate of the number of alignments between two strings. To prove these findings we use techniques of random walks, diffusion limiting processes, generating functions, and the method of bounded difference.

Sign in / Sign up

Export Citation Format

Share Document