• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2003년도 춘계학술대회 논문집
• /
• pp.181-184
• /
• 2003

Recently, the fieldbus becomes an indispensable component for many automated systems. In the fieldbus system, realtime data containing sensor values and control commands has a tendency to rapidly lose its value as time elapses after its creation. In order to deliver these data in time, the fieldbus network should be designed to have short delay compared to the maximum allowable delay. Because the communication delay is affected by performance parameters such as target rotation timer of token passing protocol, it is necessary to select proper parameter settings to satisfy the real-time requirement for communication delay. This paper presents the timer selection method for Profibus token passing networks using genetic algorithm (GA) to meet the delay requirements.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 하계종합학술대회 논문집(5)
• /
• pp.285-288
• /
• 2002

The match-on-token is a system which executes the user-authentication on the system using the user's biometric information. Nowadays, due to increase of request of the secure user-authentication on various parts, it comes to more use. In this paper, the match-on-token system under development by ETRI is described. The system consists of a host and an emulator board. USB is employed as the communication channel between them. First, the hooting code of the emulator board was programmed and tested in order that USB programs and the finger-print matching program can be executed correctly. Then, host programs cooperating with the board was designed, implemented and tested. Finally, future research including optimization of applications on the match-on-token will be mentioned.

• International Journal of Contents
• /
• 제5권4호
• /
• pp.88-93
• /
• 2009

It is important for communication networks to possess the capability to overcome failures and provide survivable services. We address modeling and analysis of performability affected by both performance and availability of system components for a token ring network under failure and repair conditions. Stochastic reward nets (SRN) is an extension of stochastic Petri nets and provides compact modeling facilities for system analysis. In this paper, hierarchical SRN modeling techniques are used to overcome state largeness problem. The upper level model is used to compute availability and the lower level model captures the performance. And Normalized Throughput Loss (NTL) is obtained for the composite ring network for each node failures occurrence as a performability measure. One of the key contributions of this paper constitutes the Petri nets modeling techniques instead of complicate numerical analysis of Markov chains and easy way of performability analysis for a token ring network under SRN reward concepts.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제17권2호
• /
• pp.103-113
• /
• 2013

We analyze the queueing model for leaky bucket (LB) scheme with dynamic arrivals and token rates. In other words, in our LB scheme the arrivals and token rates are changed according to the buffer occupancy. In telecommunication networks, the LB scheme has been used as a policing function to prevent congestion. By considering bursty and correlated properties of input traffic, the arrivals are assumed to follow a Markov-modulated Poisson process (MMPP). We derive the distribution of system state, and obtain the loss probability and the mean waiting time. The analysis is done by using the embedded Markov chain and supplementary variable method. We also present some numerical examples to show the effect of our proposed model.

• 아동학회지
• /
• 제8권2호
• /
• pp.61-71
• /
• 1987

The effects of token and social reinforcement on inappropriate study behaviors of nursery school children were investigated. The subjects were three nursery school boys, and the target behaviors were : 1) out-of-seat behaviors, 2) bothering other children, and 3) disruptive behaviors. The ABAB(Reversal) design was used in this experiment. It consisted of four periods : baseline, reinforcement I, reversal, and reinforcement II. During the reinforcement period, social reinforcement as well as token reinforcement was applied. In all three subjects, inappropriate study behaviors decreased during the reinforcement periods (I, II), and increased during the reversal period, showing the effects of token and social reinforcement. The subjects showed stability in three post-experimental tests, indicating that modification of inappropriate study behaviors was being maintained.

• 전자공학회논문지B
• /
• 제33B권7호
• /
• pp.11-20
• /
• 1996

In this paper, the performance of the IeEE 802.4 token-passing is analyzed under the assumption that all nodes have finite buffers and finite THT (token tolding time). The loads generated at nodes are assumed to be asymmetric. The priority mechanism is not considered. This paper derives an approximate matrix equation of the queue length distributin in terms of the number of nodes, frame arrival rate and mean service time of a frame in steady state. Based on the matrix equation, the mean token rotation time, the mean waiting time and the blocking probability are derived analytically. the analytic results are compared with simulation results in order to show that the deviations are small.

• Journal of Communications and Networks
• /
• 제7권1호
• /
• pp.65-75
• /
• 2005

In this paper, we consider a scenario in which the source has been offered QoS guarantees subject to token-bucket regulation. The rate of the source should be controlled such that it conforms to the token-bucket regulation, and also the distortion obtained is the minimum. We have developed an optimal scheduling algorithm for offline (like pre-recorded video) sources with convex distortion function and which can not tolerate any delay. This optimal offline algorithm has been extended for the real-time online source by predicting the number of packets that the source may send in future. The performance of the online scheduler is not substantially degraded as compared to that of the optimal offline scheduler. A sub-optimal offline algorithm has also been developed to reduce the computational complexity and it is shown to perform very well. We later consider the case where the source can tolerate a fixed amount of delay and derive optimal offline algorithm for such traffic source.

• 한국어교육
• /
• 제28권4호
• /
• pp.245-271
• /
• 2017

This study aimed at investigating the lexical diversity in the "Frog Story" narratives of Korean-Chinese bilingual children. Six bilingual speakers of Korean children- four boys and two girls- were audio recorded as they produced narratives based on pictures from the Mercer Mayer book "Frog, where are you?" The order of narration was counterbalanced. The vocabularies from narratives were analyzed by type, token, TTR (type-token Ratio) and D value using the CLAN (Computerized Language Analysis) program. The findings showed that the pattern of lexical diversity in Korean is similar with the Chinese, but the TTR and D value of Chinese still remain low in comparison with those of Korean. In addition, Korean language seems to have significant influence on Chinese in the language usage pattern and vice versa.

• 한국정보처리학회논문지
• /
• 제4권9호
• /
• pp.2366-2377
• /
• 1997

본 논문은 ATM망의 트래픽 제어에서 예방적 기법인 가변 토큰풀(Variable Token Pool : VTP)을 이용한 적응적 사용 파라메터 제어에 관한 메카니즘을 제안한다. 가변 토큰풀 메카니즘은 ON-OFF형 트래픽의 버스트 기간과 침묵 기간을 장기간 감시하여 토큰풀을 가변시킴으로서 최대 비트율 뿐만 아니라 평균 비트율과 버스트 기간 위반을 함께 감시할 수 있다. 또한 제안된 메카니즘은 버스트 기간과 평균 비트율 위반에 대한 민감성을 개선할 수 있고, 위반 사항에 대한 반응이 빨리 나타난다. VTP 크기는 버스트와 침묵 구간마다 계단 형태로 변하고, 하향 간격 (Down_size)과 상향 간격 (Up_size)의 값에 따라 제어된다. 본 논문에서 제안한 메카니즘을 시뮬레이션을 통해 LB와 JW 메카니즘과의 성능을 비교 분석하였다. VTP메카니즘은 기존에 제안된 메카니즘보다 좀더 엄격한 제어 능력을 보였다. VTP 메카니즘의 셀 손실율은 VTP의 파라메터 (Down_size, Up_size)값의 증감에 따라 다르게 나타났으며, 두 파라메터 값이 트래픽 상황에 따라 적당한 값으로 결정되어야 함을 보여주었다.

• 전자공학회논문지CI
• /
• 제40권6호
• /
• pp.39-46
• /
• 2003

지문 정보 등의 생체 정보를 이용하는 생체 인식 기술은 컴퓨터 시스템의 로그인, 출입 ID, 전자 상거래 보안등의 여러 서비스에서 사용자의 안전한 인증(authentication)을 위해 널리 사용되고 있다. 근래에 이르러, 생체 기술은 비밀 번호와 같은 기존의 개인 인증 방법에 비해 안전하면서도 자동화를 가져 올 수 있다는 장점으로 인해, 보안 토큰, 스마트 카드와 같은 소형의 임베디드 시스템에 탑재되고 이용되는 추세이다. 본 논문에서는 임베디드 시스템의 형태인 보안 토큰을 개발하고 지문 정보를 이용한 사용자 인증 시스템을 구현하며 시험한 결과를 기술하였다. 보안 토큰과 호스트와의 통신은 USB를 이용하여 시험 및 검증하였으며 보안 토큰 상에서의 지문 정합 프로그램의 수행 시간과 수행 메모리를 측정하고 성능 개선에 대해 기술하였다. 또한, 보안 토큰에서 매치온 카드(match-on-card)로의 전이를 위해 필요한 내용을 언급하였다.