• East Asian mathematical journal
• /
• v.34 no.1
• /
• pp.47-58
• /
• 2018

In this paper, we consider a fuzzy nonlinear random variational inclusion problems involving ordered RME-multivalued mapping in ordered Banach spaces. By using the random relaxed resolvent operator and its properties, we suggest an random iterative algorithm. Finally both the existence of the random solution of the original problem and the convergence of the random iterative sequences generated by random algorithm are proved.

• Journal of applied mathematics & informatics
• /
• v.25 no.1_2
• /
• pp.425-434
• /
• 2007

We iteratively generate a sequence of measurable mappings and study necessary conditions for its convergence to a random fixed point of random nonexpansive operator. A random fixed point theorem for random nonexpansive operator, relaxing the convexity condition on the underlying space, is also proved. As an application, we obtained random fixed point theorems for Caristi type random operators.

• 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.

• Journal of applied mathematics & informatics
• /
• v.5 no.2
• /
• pp.357-372
• /
• 1998

In this paper we introduce and study a new class of random completely generalized strongly nonlinear quasi -comple- mentarity problems with non-compact valued random fuzzy map-pings and construct some new iterative algorithms for this kind of random fuzzy quasi-complementarity problems. We also prove the existence of random solutions for this class of random fuzzy quasi-complementarity problems and the convergence of random iterative sequences generated by the algorithms.

• The Journal of Society for e-Business Studies
• /
• v.6 no.2
• /
• pp.167-178
• /
• 2001

Key is generally formed using the Random Number. How to make the Random Number is to cast coin or dice as classical method, to form the Real Random Number with Hardware and to make the Pseudo Random Number by means of utilizing mathematical algorithm. This thesis presented NRNG(New Random Number Generator) which put self-development Hardware to use as Key Generation Method and inspected to compare the Real Random Number with the Pseudo Random Number and special properties which PRNG(Pseudo-Random Number Generator) creates.

• Communications of the Korean Mathematical Society
• /
• v.33 no.2
• /
• pp.605-618
• /
• 2018

The main goal of this paper is to study an extension of random summations of independent and identically distributed random variables when the number of summands in random summation is a partial sum of n independent, identically distributed, non-negative integer-valued random variables. Some characterizations of random summations are considered. The central limit theorems and weak law of large numbers for extended random summations are established. Some weak limit theorems related to geometric random sums, binomial random sums and negative-binomial random sums are also investigated as asymptotic behaviors of extended random summations.

• 제어로봇시스템학회:학술대회논문집
• /
• 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.

• Bulletin of the Korean Mathematical Society
• /
• v.34 no.4
• /
• pp.603-615
• /
• 1997

In this paper, we introduce and study a new class of random completely generalized nonlinear variational inclusions with non-compact valued random mappings and construct some new iterative algorithms. We prove the existence of random solutions for this class of random variational inclusions and the convergence of random iterative sequences generated by the algorithms.

• East Asian mathematical journal
• /
• v.32 no.5
• /
• pp.685-700
• /
• 2016

The main object of this work to introduced and studied a new class of fuzzy general nonlinear ordered random variational inequalities in ordered Banach spaces. By using the random B-restricted accretive mapping with measurable mappings ${\alpha},{\alpha}^{\prime}:{\Omega}{\rightarrow}(0,1)$, an existence of random solutions for this class of fuzzy general nonlinear ordered random variational inequality (equation) with fuzzy mappings is established, a random approximation algorithm is suggested for fuzzy mappings, and the relation between the first value $x_0(t)$ and the random solutions of fuzzy general nonlinear ordered random variational inequality is discussed.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.7
• /
• pp.61-69
• /
• 2019

In this paper, a classification method of random graph models is proposed and it is based on centralities of the random graphs. Similarity between two random graphs is measured for the classification of random graph models. The similarity between two random graph models $G^{R_1}$ and $G^{R_2}$ is defined by the distance of $G^{R_1}$ and $G^{R_2}$, where $G^{R_2}$ is a set of random graph $G^{R_2}=\{G_1^{R_2},...,G_p^{R_2}\}$ that have the same number of nodes and edges as random graph $G^{R_1}$. The distance($G^{R_1},G^{R_2}$) is obtained by comparing centralities of $G^{R_1}$ and $G^{R_2}$. Through the computational experiments, we show that it is possible to compare random graph models regardless of the number of vertices or edges of the random graphs. Also, it is possible to identify and classify the properties of the random graph models by measuring and comparing similarities between random graph models.