• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2002년도 ICCAS
• /
• pp.35.3-35
• /
• 2002

Reinforcement Learning (RL) is one of machine learning methods and an RL agent autonomously learns the action selection policy by interactions with its environment. At the beginning of RL research, it was limited to problems in environments assumed to be Markovian Decision Process (MDP). However in practical problems, the agent suffers from the incomplete perception, i.e., the agent observes the state of the environments, but these observations include incomplete information of the state. This problem is formally modeled by Partially Observable MDP (POMDP). One of the possible approaches to POMDPS is to use historical nformation to estimate states. The problem of these approaches is how t..

• Communications for Statistical Applications and Methods
• /
• 제9권1호
• /
• pp.33-38
• /
• 2002

We prove that blocked complete dialler crosses using balance incomplete block design are A-, D-, E-optimal design. Also, we provide such blocked complete dialled crosses and their average efficiency with table.

• Communications for Statistical Applications and Methods
• /
• 제20권4호
• /
• pp.283-290
• /
• 2013

Subjects can experience two types of recurrent events in a longitudinal study. In addition, there may exist intermittent dropouts that results in repeated observation gaps during which no recurrent events are observed. Therefore, theses periods are regarded as non-risk status. In this paper, we consider a special case where information on the observation gap is incomplete, that is, the termination time of observation gap is not available while the starting time is known. For a statistical inference, incomplete termination time is incorporated in terms of interval-censored data and estimated with two approaches. A shared frailty effect is also employed for the association between two recurrent events. An EM algorithm is applied to recover unknown termination times as well as frailty effect. We apply the suggested method to young drivers' convictions data with several suspensions.

• 한국지능시스템학회논문지
• /
• 제17권3호
• /
• pp.397-402
• /
• 2007

In this paper, we present a method for clustering incomplete Microarray data using alternating optimization in which a prior imputation method is not required. To reduce the influence of imputation in preprocessing, we take an alternative optimization approach to find better estimates during iterative clustering process. This method improves the estimates of missing values by exploiting the cluster Information such as cluster centroids and all available non-missing values in each iteration. The clustering results of the proposed method are more significantly relevant to the biological gene annotations than those of other methods, indicating its effectiveness and potential for clustering incomplete gene expression data.

• 한국산학기술학회:학술대회논문집
• /
• 한국산학기술학회 2003년도 Proceeding
• /
• pp.105-110
• /
• 2003

Collaborative filtering is one of the methodologies that are most widely used for recommendation system. It is based on a data matrix of each customer's preferences of products. There could be a lot of missing values in such preference. data matrix. This incomplete data is one of the reasons to deteriorate the accuracy of recommendation system. Multiple imputation method imputes m values for each missing value. It overcomes flaws of single imputation approaches through considering the uncertainty of missing values.. The objective of this paper is to suggest multiple imputation-based collaborative filtering approach for recommendation system to improve the accuracy in prediction performance. The experimental works show that the proposed approach provides better performance than the traditional Collaborative filtering approach, especially in case that there are a lot of missing values in dataset used for recommendation system.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 1999년도 춘계공동학술대회:정보화시대의 지식경영
• /
• pp.240-241
• /
• 1999

• 전자공학회논문지
• /
• 제52권2호
• /
• pp.119-124
• /
• 2015

본 논문은 광원 라인폭이 spectral amplitude coding (SAC) OCDMA 시스템에 미치는 영향을 구하였다. q와 m값에 따라 다양한 코드를 구현할 수 있으므로 symmetric balance incomplete block design(BIBD) 코드를 분석에 사용하였다. 그 결과 입력파워가 큰 경우 ($P_{sr}=-10dBm$) 이상적인 BIBD 코드가 비이상적인 BIBD 코드보다 더 좁은 광원 라인폭이 요구되었다. 그러나 입력파워가 작은 경우 ($P_{sr}=-25dBm$)에는 그 반대로 비이상적인 BIBD 코드가 이상적인 BIBD 코드보다 더 좁은 광원 라인폭이 필요했다.

• Journal of Communications and Networks
• /
• 제14권6호
• /
• pp.682-691
• /
• 2012

Key agreement protocol is a fundamental protocol in cryptography whereby two or more participants can agree on a common conference key in order to communicate securely among themselves. In this situation, the participants can securely send and receive messages with each other. An adversary not having access to the conference key will not be able to decrypt the messages. In this paper, we propose a novel identity-based authenticated multi user key agreement protocol employing a symmetric balanced incomplete block design. Our protocol is built on elliptic curve cryptography and takes advantage of a kind of bilinear map called Weil pairing. The protocol presented can provide an identification (ID)-based authentication service and resist different key attacks. Furthermore, our protocol is efficient and needs only two rounds for generating a common conference key. It is worth noting that the communication cost for generating a conference key in our protocol is only O($\sqrt{n}$) and the computation cost is only O($nm^2$), where $n$ implies the number of participants and m denotes the extension degree of the finite field $F_{p^m}$. In addition, in order to resist the different key attack from malicious participants, our protocol can be further extended to provide the fault tolerant property.

• Journal of the Korean Data and Information Science Society
• /
• 제26권2호
• /
• pp.347-354
• /
• 2015

본 논문은 균형불완비블럭설계 (balanced incomplete block design)의 자료분석에 사영을 이용한 블럭내 분석 (intrablock analysis)방법을 다루고 있다. 블럭내 분석을 위해 단계별 방법 (stepwise procedure)에서 유도되는 분석모형을 이용하고 있다. 단계별 방법의 적용으로 인해 모형행렬로 주어지는 사영공간이 변동요인에 따른 부분공간들로 직교분할됨을 보여주고 있다. 단계별 과정에서 변동요인에 따른 변동량을 구하기 위해 해당하는 효과벡터의 계수행렬에 근거한 사영의 구조적 형태를 기술하고 있으며 상호직교하는 부분공간으로의 사영을 이용하여 블럭효과에 적합된 처리효과의 변동량를 구하는 과정을 구체적으로 다루고 있다. 또한, 사영에 의해 처리효과를 구하는 과정을 제시하고 있으며 단계별로 잔차벡터를 이용하여 모형설정하는 방법과 고유벡터에 의한 추정가능함수의 구성과 추정가능성을 논의하고 있다.

• Journal of the Korean Data and Information Science Society
• /
• 제1권
• /
• pp.7-33
• /
• 1990

Bechhofer and Tamhane(1981) developed a theory of optimal incomplete block designs for comparing several treatments with a control. This class of designs is appropriate for comparing simultaneously $p{\geq}2$ test treatments with a control treatment (the so-called multiple comparisons with a control (MCC) problem) when the observations are taken in incomplete blocks of common size $K{\<}p+1$. In this paper we want to extend to partially BTIB designs with two associate classes for the MCC problem. We propose a new class of incomplete block designs that are partially balanced with respect to test treatments. Because the class of designs that we consider is larger than the class of designs in Bechhofer and Tamhane and provides us with designs that improve on the optimal designs in their class. We shall use the abbreviation PBTIB to refer to such designs. We study their structure and give some methods of construction. Also we describe a procedure for making exact joint confidence statements for the MCC problem in PBTIB Designs with two associate classes. We study Optimality, Admissibility considerations in PBTIB designs with two associate classes.