• 한국정보통신설비학회:학술대회논문집
• /
• 한국정보통신설비학회 2008년도 정보통신설비 학술대회
• /
• pp.556-558
• /
• 2008

Secure broadcasting is requirement for payment of TV systems, government or company. Hierarchical key management for access control provides efficient key management in those environment. Also, time-bound hierarchical key management technique generates different keys in each time period. In 2004, Tzeng proposed a time-bound cryptgraphic key assignment scheme for access control in a hierarchy and in 2008, Bertino et al proposed an efficient time-bound hierarchical key management scheme for secure broadcasting. Tzeng's scheme and Bertino et al's scheme are organized in different environment and primitive. In this paper, we analysis above two time-bound hierarchical key management scheme.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2011년도 한국컴퓨터종합학술대회논문집 Vol.38 No.1(B)
• /
• pp.488-491
• /
• 2011

For given g ${\geq}$ 3, this paper provides an O(1) time and O(n) space complexity algorithm for generation of biconnected rooted colored outerplanar graphs with face size bound g, where the graphs generated contain at most n vertices. The vertices are colored in such a way that each color has a corresponding degree bound. There is also a face size bound for each inner face of the graph. No duplications or isomorphic copies of a same graph are generated.

• 한국언어정보학회:학술대회논문집
• /
• 한국언어정보학회 2007년도 정기학술대회
• /
• pp.223-233
• /
• 2007

The so-called Korean BNC (bound noun construction) displays complex syntactic, semantic, and constructional properties. This paper, couched upon a constraint-based approach, two different syntactic structures for the construction with articulated lexical properties for the BNs and relevant predicates. The paper reports an implementation of this analysis in the LKB (Linguistic Knowledge Building) system and shows us that this direction is robust enough to pare relevant sentences.

• 한국언어정보학회:학술대회논문집
• /
• 한국언어정보학회 2007년도 정기학술대회
• /
• pp.542-547
• /
• 2007

It is suggested that the difference between co-referential and bound reflexive pronouns found in many languages can be accounted for by using the notion of the case extension of a type <1> quantifier. Given this proposal the co-referential pronouns get their meaning when the corresponding NP takes nominal case extension first. Bound reflexives are reflexivisers in the sense that they are not case extensions of quantifiers although they also transform binary relations into sets. Examples from Japanese and from Polish are discussed.

• 한국통신학회논문지
• /
• 제33권11C호
• /
• pp.880-882
• /
• 2008

This paper presents LDPC codes' upper bounds over the waterfall SNR region. The previous researches have focused on the average bound or ensemble bound over the whole SNR region and showed the performance differences for the fixed block size. In this paper, the particular LDPC codes' upper bounds for various block sizes are calculated over the waterfall SNR region and are compared with BP decoding performance. For different block sizes the performance degradation of BP decoding is shown.

• 한국통신학회논문지
• /
• 제36권1C호
• /
• pp.1-7
• /
• 2011

최근 다중-홉 릴레이 전송 방식은 전력 소모를 줄이면서 통신 가능 영역을 넓힐 수 있는 장점으로 큰 관심을 받고 있다. 본 논문에서는 홉마다 증폭-후-전달 릴레이가 다수 존재하는 다중 홉 통신시스템에서 최적 경로를 선택할 때 얻을 수 있는 성능 한계를 유도한다. 특히, 홉마다 분포가 다른 일반화된 나카가미 페이딩 채널에서의 성능 한계를 제공하도록 경로를 구성하는 링크 신호대잡음비의 기하 평균 상한을 적용하고 그에 대한 적률생성함수를 얻었다. 그 결과 페이딩 특성이 적을수록 제안한 기하 평균 상한 기법이 실제 성능에 더욱 근접함을 볼 수 있다.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제53권4호
• /
• pp.207-211
• /
• 2004

We consider a class of uncertain nonlinear systems containing the uncertainties without a priori information except that they are bounded. For such systems, we assume that the upper bound of the uncertainties is represented as a Fredholm integral equation of the first kind and we propose an adaptation law that is capable of estimating the upper bound. Using this adaptive upper bound, a continuous robust control which renders uncertain nonlinear systems uniformly ultimately bounded is designed.

• 소성∙가공
• /
• 제6권3호
• /
• pp.233-238
• /
• 1997

The estimation of the forming force required for metal forming process is unavoidable for selecting suitable machine and dimensioning die and punch parts. For this purpose the upper-bound method turns out to be very practical in simple two-dimensional cases under well-known boundary conditions. However, the application of this method for complicated two-or three-dimentional cases is very limited or practically impossible. The modified application of FEM in a manner of applying the upper bound method(the so-called Upper-bound Finite Element Simulation Method) fortunately provides the posibility of getting important information about the forming process in a simple and quick way before realizing the process on the machine. It is expected to function successfully even in three-dimentional cases. The application procedure has been explained for two-dimensional cases and its usefulness shown.

• 한국언어정보학회지:언어와정보
• /
• 제15권1호
• /
• pp.63-78
• /
• 2011

This study investigates the binding behavior of the Korean anaphor 'caki', which has been regarded thus far as a long-distance anaphor (LDA). Given that even local anaphors can be bound long-distance when they function as exempt anaphors in certain languages (Pollard and Sag 1992; Kim and Yoon 2009a, b), I investigated the binding behavior of LD-bound 'caki', in order to determine whether LD-bound 'caki' differs from LD-bound 'caki-casin' in the same contexts. In the experiment, subjects were required to rate the grammaticality of Korean sentences representing various types of LD binding of 'caki' and to determine whether the sloppy or the strict reading was more prominent in elliptical VPs containing the anaphor. The results are discussed with respect to the typology of LDAs proposed by Cole, Hermon and Huang (2001).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권1호
• /
• pp.168-186
• /
• 2016

In this paper, we investigate the degrees of freedom (DoF) of a two-cluster multiple-input multiple-output (MIMO) multiway relay interference channel (mRIC), where there are two relays and two users per cluster. In this channel, users within the same cluster exchange messages among themselves with the help of two relays.We first obtain the DoF upper bound of the considered MIMO mRIC based on cut-set bound. Then, we propose a novel transmission strategy, blind interference neutralization (BIN), to approach the DoF upper bound. This new method utilizes the overheard information at two relays and focuses on the beamforming matrix designs at two relays so that the channel state information (CSI) at users is not required. Through theoretical analysis and numerical simulations, we show that the DoF upper bound can be obtained by using the BIN scheme. From simulation results, we show that the proposed BIN scheme can provide significant performance gain over the conventional time division multiple access (TDMA) scheme in terms of DoF. In addition, we show that the BIN scheme is a superior approach to the existing signal space alignment (SSA) schemes for the considered mRIC.