Time-lapse image sequences offer visually compelling insights into dynamic processes that are too slow to observe in real time. However, playing a long time-lapse sequence back as video often results distracting flicker due random effects, such weather, well cyclic the day-night cycle. We introduce problem of disentangling way allows separate, after-the-fact control overall trends, and effects ...

In this paper we consider random sequences in the background of which specific shorttime random elements can emerge. The theory and constructive methods for recognition of shorttime specific random elements that may emerge in the background of random sequences are expounded. The results of experimental investigations are presented. The prospects for a wider application of the results obtained a...

The modularity of a graph is parameter that measures its community structure; the higher value (between 0 and 1), more clustered is. In this paper we show random 3-regular at least 0.667026 asymptotically almost surely (a.a.s.), thereby proving conjecture McDiarmid Skerman. We also improve a.a.s. upper bound given therein to 0.789998. For uniformly chosen G n over bounded degree sequence with a...

Random sequences can be used to extract relevant information from biological sequences. The random sequences represent the “background noise” from which it is possible to differentiate the real biological information. For example, random sequences are widely used to detect over-represented and under-represented motifs, or to determine whether the scores of pairwise alignments are relevant. Anal...

We observe that known results on the Kolmogorov complexity of prefixes of effectively stochastic sequences extend to corresponding random sequences. First, there are recursively random random sequences such that for any nondecreasing and unbounded computable function f and for almost all n, the uniform complexity of the length n prefix of the sequence is bounded by f(n). Second, a similar resul...

It is well known that there are no perfectly good generators of random number sequences, implying the need of testing the randomness of the sequences produced by such generators. There are many tests for measuring the uniformity of random sequences, and here we propose a few new ones, designed by random walks. The experiments we have made show that our tests discover some discrepancies of rando...

This paper presents a class of random orthogonal sequences associated with the number theoretic Hilbert transform. We present a constructive procedure for finding the random sequences for different modulus values. These random sequences have autocorrelation function that is zero everywhere excepting at the origin. These sequences may be used as keys and in other cryptography applications.

in this paper, we introduce and study the concepts of $mathcal{i}_2$-convergence, $mathcal{i}_2^{*}$-convergence for double sequences of fuzzy real numbers, where $mathcal{i}_2$ denotes the ideal of subsets of $mathbb n times mathbb n$. also, we study some properties and relations of them.

Simulations of originally existent biological sequences are helpful for computational analysis and manipulations, rather than wet lab experiments, considerably reducing the cost and time associated with traditional wet lab experiments. The basic idea is to compare the results of a run on real data to many runs on random data. This paper discusses the need for random biological sequence analysis...

We provide a permutation invariant version of the strong law large numbers for exchangeable sequences random variables. The proof consists combination Komlós–Berkes theorem, usual sequences, and de Finetti’s theorem.