• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10b
• /
• pp.240-244
• /
• 1992

A new method for generation of binary random sequences, called random sampling method, has been proposed by the authors. However, the random sampling method has the defect that binary random sequence can not be rapidly generated. In this paper, two methods based on the random sampling method are proposed for fast generation of binary random sequences. The optimum conditions for obtaining ideal binary random sequences are derived.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.329-341
• /
• 2005

In this paper, we introduce new random iterative sequences with errors approximating a unique random common fixed point for three random set-valued strongly pseudo-contractive mappings and show the convergence of the random iterative sequences with errors by using an approximation method in real uniformly smooth separable Banach spaces. As applications, we study the existence of random solutions for some kind of random nonlinear operator equations group in separable Hilbert spaces.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10b
• /
• pp.1295-1299
• /
• 1990

A new method called random sampling method has been proposed for generation of binary random sequences. In this paper, a new concept, called merit factor Fn, is proposed for evaluating the randomness of the binary random sequences generated by the random sampling method. Using this merit factor Fn, some desirable conditions are investigated for uniform random numbers used in the random sampling method.

• 제어로봇시스템학회:학술대회논문집
• /
• 1988.10b
• /
• pp.1033-1036
• /
• 1988

This paper proposes a new method for generation of uniform random numbers using binary random sequences. These binary sequences are obtained from a de Bruijn sequence by random sampling method. Several statistical tests are carried out for the random numbers generated by the proposed method, and it is shown that the random numbers have good random properties.

• Communications for Statistical Applications and Methods
• /
• v.16 no.6
• /
• pp.1013-1022
• /
• 2009

We in this paper study the almost sure convergence for asymptotically almost negatively associated(AANA) random variable sequences and obtain some new results which extend and improve the result of Jamison et al. (1965) and Marcinkiewicz-Zygumnd strong law types in the form given by Baum and Katz (1965), three-series theorem.

• Journal of Applied and Pure Mathematics
• /
• v.4 no.1_2
• /
• pp.37-50
• /
• 2022

In this article we define and study the notions of $\mathcal{I}$-convergence and $\mathcal{I}$-Cauchy of triple sequences in the topology induced by random 2-normed spaces and prove some theorems based on them.

• Journal of Information Processing Systems
• /
• v.13 no.6
• /
• pp.1554-1574
• /
• 2017

This paper introduces a new type of determining factor for Pseudo Random Strings (PRS). This classification depends upon a mathematical property called Finite Induction (FI). FI is similar to a Markov Model in that it presents a model of the sequence under consideration and determines the generating rules for this sequence. If these rules obey certain criteria, then we call the sequence generating these rules FI a PRS. We also consider the relationship of these kinds of PRS's to Good/deBruijn graphs and Linear Feedback Shift Registers (LFSR). We show that binary sequences from these special graphs have the FI property. We also show how such FI PRS's can be generated without consideration of the Hamiltonian cycles of the Good/deBruijn graphs. The FI PRS's also have maximum Shannon entropy, while sequences from LFSR's do not, nor are such sequences FI random.

• 제어로봇시스템학회:학술대회논문집
• /
• 1987.10a
• /
• pp.832-835
• /
• 1987

This paper proposes a new method of generating binary random sequences using a randomly sampled M-sequence. In this paper two methods of sampling are proposed. Expected values of the autocorrelation function of the sequence generated by these methods are calculated theoretically. From the results of computer simulation, it is shown that using these methods, we can get binary random sequences which have good random properties.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.979-983
• /
• 1989

This paper proposes a new concept, called merit factor Fr, for evaluating the randomness of binary random sequences. The merit factor Fr is obtained from the expected values of the autocorrelation function of the binary random sequence. Using this merit factor Fr, randomness of the binary random sequences generated by the random sampling method is evaluated.

• Journal of applied mathematics & informatics
• /
• v.19 no.1_2
• /
• pp.57-75
• /
• 2005

Quasigroups are algebraic structures closely related to Latin squares which have many different applications. There are several classifications of quasigroups based on their algebraic properties. In this paper we propose another classification based on the properties of strings obtained by specific quasigroup transformations. More precisely, in our research we identified some quasigroup transformations which can be applied to arbitrary strings to produce pseudo random sequences. We performed tests for randomness of the obtained pseudo-random sequences by random walks on torus. The randomness tests provided an empirical classification of quasigroups.