scholarly journals Transition length of two stationary random functions in investigation of railway stability

2000 ◽  
Vol 22 (1) ◽  
pp. 47-53
Author(s):  
Nguyen Duong Nam

In this paper the scientific justification for determination of transition length of two stationary random functions is presented on the basis of the weight function and properties of stationary random function in wide sense. The application of the results for practice gives the transition lengths of straight and curved railway, which it is necessary to throw away in measurement of initial horizontal displacement of railway in its stability estimation under action of longitudinal compression load.


1975 ◽  
Vol 12 (S1) ◽  
pp. 177-185
Author(s):  
A. Blanc-Lapierre

In the article below, we consider sets of non-random functions of time t admitting certain asymptotic distributions. Purely temporal and deterministic considerations lead us to associate to a set , say, of functions H(t) of this type, a space Ω of samples ω.To each function H(t) ⊂ , there corresponds a random variable h (ω). To the set of translated functions H(t + λ) of a function H(t) ⊂ , there corresponds a stationary random function of the translation parameter λ, say, h(λ, ω). We study the transposition to the set of non-random functions H(t) of such properties as moments, gaussian character, independence, harmonic analysis, and others, of the random variables h (ω) and of the random functions h (λ, ω).Some remarks are made concerning the links between ergodicity and the above problems.



2021 ◽  
Vol 174 ◽  
pp. 282-303
Author(s):  
Edyta Puniach ◽  
Wojciech Gruszczyński ◽  
Paweł Ćwiąkała ◽  
Wojciech Matwij


2019 ◽  
Vol 2019 ◽  
pp. 1-15
Author(s):  
Muhua Liu ◽  
Ping Zhang ◽  
Qingtao Wu

Constrained verifiable random functions (VRFs) were introduced by Fuchsbauer. In a constrained VRF, one can drive a constrained key skS from the master secret key sk, where S is a subset of the domain. Using the constrained key skS, one can compute function values at points which are not in the set S. The security of constrained VRFs requires that the VRFs’ output should be indistinguishable from a random value in the range. They showed how to construct constrained VRFs for the bit-fixing class and the circuit constrained class based on multilinear maps. Their construction can only achieve selective security where an attacker must declare which point he will attack at the beginning of experiment. In this work, we propose a novel construction for constrained verifiable random function from bilinear maps and prove that it satisfies a new security definition which is stronger than the selective security. We call it semiadaptive security where the attacker is allowed to make the evaluation queries before it outputs the challenge point. It can immediately get that if a scheme satisfied semiadaptive security, and it must satisfy selective security.



Cryptography ◽  
2020 ◽  
Vol 4 (4) ◽  
pp. 37
Author(s):  
Bei Liang ◽  
Gustavo Banegas ◽  
Aikaterini Mitrokotsa

Cohen, Goldwasser, and Vaikuntanathan (TCC’15) introduced the concept of aggregate pseudo-random functions (PRFs), which allow efficiently computing the aggregate of PRF values over exponential-sized sets. In this paper, we explore the aggregation augmentation on verifiable random function (VRFs), introduced by Micali, Rabin and Vadhan (FOCS’99), as well as its application to e-lottery schemes. We introduce the notion of static aggregate verifiable random functions (Agg-VRFs), which perform aggregation for VRFs in a static setting. Our contributions can be summarized as follows: (1) we define static aggregate VRFs, which allow the efficient aggregation of VRF values and the corresponding proofs over super-polynomially large sets; (2) we present a static Agg-VRF construction over bit-fixing sets with respect to product aggregation based on the q-decisional Diffie–Hellman exponent assumption; (3) we test the performance of our static Agg-VRFs instantiation in comparison to a standard (non-aggregate) VRF in terms of costing time for the aggregation and verification processes, which shows that Agg-VRFs lower considerably the timing of verification of big sets; and (4) by employing Agg-VRFs, we propose an improved e-lottery scheme based on the framework of Chow et al.’s VRF-based e-lottery proposal (ICCSA’05). We evaluate the performance of Chow et al.’s e-lottery scheme and our improved scheme, and the latter shows a significant improvement in the efficiency of generating the winning number and the player verification.



The probability density P m of the spacing between the i th zero and the ( i + m + 1)th zero of a stationary, random function f ( t ) (not necessarily Gaussian) is expressed as a series, of a type similar to that given by Rice (1945) but more rapidly convergent. The partial sums of the series provide upper and lower bounds successively for P m . The series converges particularly rapidly for small spacings r . It is shown that for fixed values of r , the density P m ( r ) diminishes more rapidly than any negative power of m . The results are applied to Gaussian processes; then the first two terms of the series for P m ( T ) may be expressed in terms of known functions. Special attention is paid to two cases: (1) In the ‘regular’ case the covariance function i/r( t ) is expressible as a power series in then P m ( r ) is of order r 1/2 (m+2)(m+3)-2 at the origin, and in particular P ( r ) is of order r (adjacent zeros have a strong mutual repulsion). The first two terms of the series give the value of P 0 ( t ) correct to r 18 . (2) In a singular case, the covariance function p( t ) has a discontinuity in the third derivative. This happens whenever the frequency spectrum of f(t ) is O (frequency) -4 at infinity. Then P m ( r ) is shown to tend to a positive value P m (0) as r -> 0 (neighbouring zeros are less strongly repelled). Upper and lower bounds for P m (0) ( m = 0, 1, 2, 3) are given, and it is shown th at P 0 (0) is in the neighbourhood of 1.155^ m ( - 6^ ') . The conjecture of Favreau, Low & Pfeffer (1956) according to which in one case P 0 ( t ) is a negative exponential, is disproved. In a final section, the accuracy of other approximations suggested by Rice (1945), McFadden (1958), Ehrenfeld et al . (1958) and the present author (1958) are compared and the results are illustrated by computations, the frequency spectrum of f(t ) being assumed to have certain ideal forms: a low-pass spectrum, band-pass spectrum, Butterworth spectrum, etc.



1970 ◽  
Vol 2 (2) ◽  
pp. 233-236 ◽  
Author(s):  
A. Mukherjea

It is shown in this note that if Q is an algebra of uniformly bounded mean-square continuous real-valued random functions indexed in a compact set T, containing all bounded random variables and separating points of T (i.e., given t1 and t2 in T, there is a random function Xt in Q such that , then given any mean square continuous random function, there is a sequence in Q converging in mean square to the given random function uniformly on T.



Fractals ◽  
2011 ◽  
Vol 19 (02) ◽  
pp. 249-258 ◽  
Author(s):  
CHUNSHENG MA

It is well-known that the crucial ingredient for a vector Gaussian random function is its covariance matrix, where a diagonal entry termed a direct covariance is simply the covariance function of a component but it seems no simple interpretation for an off-diagonal entry termed a cross covariance, which often make it hard to specify. In this paper we employ three approaches to derive vector random functions in space and/or time, which are not homogeneous (stationary) in general but contain the stationary case as a special case, and have long-range or short-range dependence.



2014 ◽  
Vol 630 ◽  
pp. 350-355
Author(s):  
Yulia Tarasevich ◽  
Anna Savchenko

The paper discusses forced combined angular-radial oscillations of rotor centrifugal pump model under the influence of random forcings. System reliability is evaluated using the theory of random functions runs: the probability of finding a random vector of quality system “rotor-annular seals” in the range of admissible values of its parameters is determined. Evaluation of the influence of erosive wear of sealing surfaces in the process of pump operating on reliability system is made.



Sign in / Sign up

Export Citation Format

Share Document