• Journal of the Korean Statistical Society
• /
• 제30권1호
• /
• pp.153-161
• /
• 2001

In this paper, a strong law of large numbers for sums of stationary and ergodic fuzzy random variables is obtained.

• Korean Journal of Mathematics
• /
• 제10권1호
• /
• pp.29-35
• /
• 2002

It is well known that a random graph $G_{1/2}(n)$ is Hamiltonian almost surely. In this paper, we show that every quasirandom graph $G(n)$ with minimum degree $(1+o(1))n/2$ is also Hamiltonian.

• Journal of Korea Multimedia Society
• /
• 제13권9호
• /
• pp.1299-1313
• /
• 2010

Top-k queries return k objects that users most want in the database. The Partitioned-Layer Index (simply, the PL -index) is a representative method for processing the top-k queries efficiently. The PL-index partitions the database into a number of smaller databases, and then, for each partitioned database, constructs a list of sublayers over the partitioned database. Here, the $i^{th}$ sublayer in the partitioned database has the objects that can be the top-i object in the partitioned one. To retrieve top k results, the PL-index merges the sublayer lists depending on the user's query. The PL-index has the advantage of reading a very small number of objects from the database when processing the queries. However, since many random accesses occur in merging the sublayer lists, query performance of the PL-index is not good in environments like disk-based databases. In this paper, we propose the Abstracted Partitioned-Layer Index (simply, the APL-index) that significantly improves the query performance of the PL-index in disk-based environments by reducing the number of random accesses. First, by abstracting each sublayer of the PL -index into a virtual (point) object, we transform the lists of sublayers into those of virtual objects (ie., the APL-index). Then, we virtually process the given query by using the APL-index and, accordingly, predict sublayers that are to be read when actually processing the query. Next, we read the sublayers predicted from each sublayer list at a time. Accordingly, we reduce the number of random accesses that occur in the PL-index. Experimental results using synthetic and real data sets show that our APL-index proposed can significantly reduce the number of random accesses occurring in the PL-index.

• The Transactions of the Korean Institute of Electrical Engineers B
• /
• 제50권10호
• /
• pp.513-519
• /
• 2001

This paper proposed a random sigma-delta modulator(RSDM), which is constructed by a 1st order sigma-delta modulator(SDM) and a simple structured random binary generator(RBG). The 1st order SDM produces a switching pulse waveform which has the same low-frequency component as the reference input, while the RBG spreads the distribution of the number of sampling per switching cycle, and thus disperses the spectrum spikes in the output. The relationship between the harmonic spectra and the number of sampling per switching cycle is studied through computer simulations, and the frequency spectra of the RSDM are confirmed in an experimental setup.

• Proceedings of the IEEK Conference
• /
• 대한전자공학회 2004년도 ICEIC The International Conference on Electronics Informations and Communications
• /
• pp.35-38
• /
• 2004

The MAC protocol of HIPERLAN/2 is based on TDMA/TDD and AP (Access Point) can dynamically allocate the number of RCHs (Random CHannels). We propose a dynamic random channel allocation scheme improved by limiting the number of minimum RCHs. On a simulated scenario adopted practical Internet traffic, the proposed scheme is shown to achieve over $19\%$ lower delay than previously studied algorithm. This study will be a first step towards designing scope of RCHs for high-performance wireless packet network

• International Journal of Internet, Broadcasting and Communication
• /
• 제13권1호
• /
• pp.243-248
• /
• 2021

Although many different types of covert channels have been suggested in the literature, there are little work in directly applying game theory to building up covert channel. This is because researchers have mainly focused on tailoring game theory for covert channel analysis, identification, and covert channel problem solving. Unlike typical adaptation of game theory to covert channel, we show that game theory can be utilized to establish a new type of covert channel in IoT devices. More specifically, we propose a covert channel that can be constructed by utilizing the Nash Equilibrium with sensor data collected from IoT devices. For covert channel construction, we set random seed to the value of sensor data and make payoff from random number created by running pseudo random number generator with the configured random seed. We generate I × J (I ≥ 2, J ≥ 2) matrix game with these generated payoffs and attempt to obtain the Nash Equilibrium. Covert channel construction method is distinctly determined in accordance with whether or not to acquire the Nash Equilibrium.

• Journal of KIISE:Information Networking
• /
• 제35권3호
• /
• pp.243-250
• /
• 2008

Recently, researched RFID authentication protocols still have vulnerability of attack, such as location tracking attack, replay attack. spoofing attack etc. This paper designed method of making one time random number in DB server side unlike previously researched protocols, and it protects RFID communication from location tracking, replay attack and spoofing attack.

• Proceedings of the Korea Society for Simulation Conference
• /
• 한국시뮬레이션학회 2004년도 춘계학술대회 논문집
• /
• pp.41-47
• /
• 2004

중심합성계획(central composite design: ccd)은 반응 표면이 곡면적인 특성을 나타낼때 반응 공간을 추정하기 위해 사용되는 실험계획이다. 반응공간이 2차 회귀모형으로 나타나는 경우에 반응곡면의 변화량을 알기 위해서는 변수의 수준이 3이상이 되어야하는데 ccd는 적은 횟수의 실험으로 곡면을 효과적으로 추정하기 위해 2$^{k}$ 요인실험에 추가적으로 중심점(central point)과 축점(axial point)을 표본점에 포함시키는 계획이다. 본 연구에서는 시뮬레이션 실험에서 반응변수가 2차 회귀모형으로 근사되는 경우에 cod를 이용하여 관심 성과치의 반응표면을 추정하고자 한다. 일반적인 실험에서와는 달리 시뮬레이션 실험에서는 두개의 표본점(인자 수준의 조합)에서 분석자가 공통 난수계열(common random number series)을 부여하여 시뮬레이션 시스템 요소의 변화과정을 유사하게 통제할 수 있다. 일반적으로 공통난수법(common random number method)에 의해 얻어지는 두 표본점에서의 반응변수는 서로 양의 상관관계를 가지며 대조 난수(antithetic random number)에 의한 두 반응변수는 음의 상관성을 가지는 것으로 알려졌다. 본 연구는 ccd의 표본점에 공통난수와 대조난수 법을 이용하여 회귀모형의 파라미터를 효과적으로 추정하는 방법을 조사하고 이를 (s, S) 재고관리 모형에 적용하여 그 효율성을 평가하고자 한다.

• The Transactions of the Korea Information Processing Society
• /
• 제6권3호
• /
• pp.664-671
• /
• 1999

Itakura and Nakamura proposed the first multisignature scheme based on RSA signature scheme. But if many users sign on one paper, then their scheme has a reblocking problem. In 1991, Ohta and Okamoto proposed a multisignature scheme by using Fiat-Shamir signature scheme. But in this scheme, the group of signers must generate common random number in the first round, and in the second round, they sign the message with common random number. Also L.Harn proposed a multsignature scheme which is based on the ElGamal's. In korea, S.D.Kim et al. at ICEIC'95 conference, proposed an efficient sequential multisignature scheme by using the modified Park-Won scheme. This scheme is not require an additional round to generate common random number, and has fixed signature length. In this paper, we analyze problem of Kim's multisignature scheme, and propose a new multisignature scheme based on ${\gamma}$\ulcorner residuosity problem.

• Bulletin of the Korean Mathematical Society
• /
• 제33권1호
• /
• pp.119-126
• /
• 1996

In this paper we study the asymptotic behavior of the edge independence number of a random (n,n)-tree. The tools we use include the matrix-tree theorem, the probabilistic method and Hall's theorem. We begin with some definitions. An (n,n)_tree T is a connected, acyclic, bipartite graph with n light and n dark vertices (see [Pa92]). A subset M of edges of a graph is called independent(or matching) if no two edges of M are adfacent. A subset S of vertices of a graph is called independent if no two vertices of S are adjacent. The edge independence number of a graph T is the number $\beta_1(T)$ of edges in any largest independent subset of edges of T. Let $\Gamma(n,n)$ denote the set of all (n,n)-tree with n light vertices labeled 1, $\ldots$, n and n dark vertices labeled 1, $\ldots$, n. We give $\Gamma(n,n)$ the uniform probability distribution. Our aim in this paper is to find bounds on $\beta_1$(T) for a random (n,n)-tree T is $\Gamma(n,n)$.