• Journal of applied mathematics & informatics
• /
• 제17권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.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2002년도 추계학술대회 및 정기총회
• /
• pp.41-45
• /
• 2002

From the paper which it sees a strong random number generator it uses a fuzzy set from 16 method of the statistical test which is a cryptograph random number test it verifies. 16 statistical test of NIST extends in crptograph and engineering whole it is a scale which is important distinguishes the distinction incapable characterstic of the random numbers which are used. To try introduce a fuzzy set the possibility of having a more strong randomness in order to be, it strengthens the function of the random number generator.

• Journal of applied mathematics & informatics
• /
• 제30권3_4호
• /
• pp.647-653
• /
• 2012

In this paper, we consider fuzzy random sets as (measurable) mappings from a probability space into the set of fuzzy sets and prove a uniform strong law of large numbers for sequences of independent and identically distributed fuzzy random sets. Our results generalize those of Bass and Pyke(1984)and Jang and Kwon(1998).

• Nonlinear Functional Analysis and Applications
• /
• 제28권2호
• /
• pp.521-535
• /
• 2023

In this work, some various types of Dissipativity in random dynamical systems are introduced and studied: point, compact, local, bounded and weak. Moreover, the notion of random Levinson center for compactly dissipative random dynamical systems presented and prove some essential results related with this notion.

• Journal of applied mathematics & informatics
• /
• 제18권1_2호
• /
• pp.441-453
• /
• 2005

In this article we will introduce a real valued random field on a restricted indexed set and construct a classical asymptotic limit theorems on them. We will survey the basic properties of weakly dependent random processes and investigate two major mixing conditions for sequences of random variables. The concepts of weakly dependent sequence of random variables will be generalized to the case of random fields. Finally we will construct a central limit theorem and prove it.

• 한국지능시스템학회논문지
• /
• 제15권3호
• /
• pp.337-342
• /
• 2005

이 논문에서는 서로 독립이고 동일한 분포를 갖는 집합치 랜덤 변수의 합에 대한 중심극한정리의 일반화로서, 수준연속인 퍼지 집합치 랜덤 변수의 합에 대한 중심극한정리를 연구하였다.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제4권1호
• /
• pp.133-142
• /
• 2000

In this note we define typical set and differential entropy for continuous random variables. Using Markov chain, we show that the various properties of the mutual information and entropies (theorems 3.2 and 3.4 ) and show the properties of typical set in continuous random variables( lemma 4.2 and theorem 4.3.)

• Journal of the Korean Statistical Society
• /
• 제36권4호
• /
• pp.479-488
• /
• 2007

The elliptic random field is an extension to the Gaussian random field. We proved a theorem which characterizes the elliptic random field. We proposed a heuristic approach to derive an approximation to the distribution of the size of one connected component of its excursion set above a high threshold. We used this approximation to approximate the distribution of the largest cluster size. We used simulation to compare the approximation with the exact distribution.

• 한국지능시스템학회논문지
• /
• 제11권4호
• /
• pp.307-310
• /
• 2001

확률 공간에서 퍼지 집합의 특징성의 측도에 관하여 소개한다. 이에 관한 Yager의 결과들을 개선 및 일반화하고 랜덤샘플에 의한 퍼지 집합의 특징성의 퍼지측도에 대한 극한에 대하여 연구하고자 한다.

• ETRI Journal
• /
• 제34권6호
• /
• pp.879-884
• /
• 2012

When the number of users is finite, the performance improvement of the orthogonal random beamforming (ORBF) scheme is limited in high signal-to-noise ratio regions. In this paper, to improve the performance of the ORBF scheme, the user set and transmit power allocation are jointly determined to maximize sum rate under the total transmit power constraint. First, the transmit power allocation problem is expressed as a function of a given user set. Based on this expression, the optimal user set with the maximum sum rate is determined. The suboptimal procedure is also presented to reduce the computational complexity, which separates the user set selection procedure and transmit power allocation procedure.