• Annual Conference of KIPS
• /
• 2011.11a
• /
• pp.422-424
• /
• 2011

시각장애인이 책을 읽을 수 있는 방법은 점자책 또는 오디오북이 있다. 그러나 점자책과 오디오북은 그 개수가 한정적이다. 또한, 점자책과 오디오북을 제작하는 데에는 상당한 시간이 소요된다. 이로 인해 시각장애인의 기본적인 독서권이 침해 받고 있다. 이러한 문제점을 해결하기 위해 영상처리, OCR, TTS 기법을 적용해 시각장애인용 독서 스탠드를 개발하였다. 제안하는 시스템에서는 문자 인식률 향상을 위해 왜곡된 이미지를 보정한 후 단편 블록화 과정을 추가로 적용하여 문자 인식률을 93%까지 증가시켜 실용성을 높였다. 개발된 시스템은 도서관 및 서점 등에 설치되어 시각장애인의 독서권을 확보하는데 도움이 될 것으로 기대된다.

• Science of Emotion and Sensibility
• /
• v.6 no.3
• /
• pp.63-72
• /
• 2003

This study investigated how cognitive style and training context influenced visual discrimination skill acquisition and transfer under time pressure. This experiment consisted of a screening session, a training session, and a transfer session using random polygon comparison tasks. Screening session was designed to separate participants according to their cognitive style (analytic or holistic). Training session was divided into difficult and easy conditions. In transfer session, participants compared polygon pairs in a novel task. The stimuli were presented for 1.5 seconds to examine the influence of time pressure. Through the all sessions, this experiment measured accuracy and response time. According to the results of this study, analytic group responded as quickly as holistic group in the beginning of training session because time pressure induced them to the holistic strategy. However, as training session progressed, their slopes of reaction time increased, suggesting that their own analytic style emerged. Holistic group showed flatter slopes than did analytic group for training session. Of interest is the slopes increased at the beginning of transfer session, suggesting that they developed analytic strategies in difficult training context. It is suggested individuals differently develop strategic processing skills depending on cognitive styles even under time pressure.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.5
• /
• pp.584-594
• /
• 1999

이 논문에서는 CDMA(Code Division Multiple Access)셀룰러 시스템에서 우선순위 큐(Queue)에 기반을 둔 핸드오프채널할당기법의 모델을 제안하였다. 또한 제안한 모델의 성능을 컴퓨터 시뮬레이션을 통해 비우선순위기법 및 FIFO(First In First Out)큐기법과 비교하였다. 제안하는 모델의 핸드오프 채널할당 기법에서는 이동국의 진행방향에 있는 인접 셀(Neighbor Cell)의 파일롯 중에서 임계치가 T-ADD 이상인 파일롯이 있을 경우 기지국이 이 파일롯(Pilot)에 대한 파일롯 세기 측정메시지를 이동국으로부터 수신 한 지점에서 드롭타이머가 종료된후 현재의 셀에서 사용중인 파일롯에 대한 파일롯 세기 측정 메시지를 이동국으로부터 수신한 시점까지 핸드오프 처리가능 영역으로 정의하고 이를 우선순위 큐의 최대큐 대기시간으로 사용하였다. 제안된 기법의 성능을 분석하기 위한 성능평가 척도는 강조종료확률, 호 블록킹 확률, 전체 제공 트래픽에 대한 수행 트래픽 비율, 평균 규크기미치 핸드오프 시 평균 지연시간이다. 성능시뮬레이션결과, 제안된 기법이 전체 시스템 호처리 용량면에서 약간의 단점은 발생하지만 핸드오프 처리에 있어서 높은 성능을 유지함을 알수 있었다.

• Journal of Internet Computing and Services
• /
• v.15 no.4
• /
• pp.119-124
• /
• 2014

Blind adaptive systems based on the Euclidean distance (ED) between the distribution function of the output samples and that of a set of random symbols generated at the receiver matching with the distribution function of the transmitted symbol points estimate the ED at each iteration time to examine its convergence state or its minimum ED value. The problem is that this ED estimation obtained by block?data processing requires a heavy calculation burden. In this paper, a recursive ED estimation method is proposed that reduces the computational complexity by way of utilizing the relationship between the current and previous states of the datablock. The relationship provides a ground that the currently estimated ED value can be used for the estimation of the next ED without the need for processing the whole new data block. From the simulation results the proposed recursive ED estimation shows the same estimation values as that of the conventional method, and in the aspect of computational burden, the proposed method requires only O(N) at each iteration time while the conventional block?processing method does $O(N^2)$.

• Journal of Convergence for Information Technology
• /
• v.9 no.12
• /
• pp.124-132
• /
• 2019

Scheduling problems can be classified into offline and online ones. This paper considers an online scheduling problem to minimize makespan on the identical parallel machines. For dynamically arrived jobs with their ready times, we show that the sequencing order according to the ERD (Earliest Ready Date) rule is optimal to minimize makespan. This paper suggests an algorithm by using the MIP(Mixed Integer Programming) formulation periodically to find a good periodic schedule and evaluates the required computational time and resulted makespan of the algorithm. The comparition with an offline scheduling shows our algorithm makes the schedule very fast and the makespan can be reduced as the period time reduction, so we can conclude that our algorithm is useful for scheduling the jobs under online environment even though the number of jobs and machines is large. We expect that the algorithm is invaluable one to find good schedules for the smart factory and online scheduler using the blockchain mechanism.

• Journal of Internet Computing and Services
• /
• v.15 no.3
• /
• pp.71-77
• /
• 2014

The equalization algorithm based on the cross-information potential concept and Dirac-delta functions (CIPD) has outstanding ISI elimination performance even under impulsive noise environments. The main drawback of the CIPD algorithm is a heavy computational burden caused by the use of a block processing method for its weight update process. In this paper, for the purpose of reducing the computational complexity, a new method of the gradient calculation is proposed that can replace the double summation with a single summation for the weight update of the CIPD algorithm. In the simulation results, the proposed method produces the same gradient learning curves as the CIPD algorithm. Even under strong impulsive noise, the proposed method yields the same results while having significantly reduced computational complexity regardless of the number of block data, to which that of the e conventional algorithm is proportional.

• Journal of Korea Society of Industrial Information Systems
• /
• v.9 no.3
• /
• pp.1-10
• /
• 2004

Video-On-Demand servers use compression techniques to reduce the storage and bandwidth requirements. The compression techniques make the bit rates of compressed video data significantly variable from frame to frame. Consequently, Video-On-Demand servers with a constant bit rate retrieval can not maximize the utilization of resources. It is possible that when variable bit rate video data is stored, accurate description of the bit rate changes could be computed a priori. In this paper, I propose a buffer management scheme called MAX for Video-On-Demand server using variable bit rate continuous media. By caching and prefetching the data, MAX buffer management scheme reduces the variation of the compressed data and increases the number of clients simultaneously served and maximizes the utilization of system resources. Results of trace-driven simulations show the effectiveness of the scheme.

• Journal of Broadcast Engineering
• /
• v.4 no.1
• /
• pp.32-43
• /
• 1999

This paper addresses schemes which securely transmit voice and data information under the worst communication environment using the frequency hopping(FH) communication system to avoid monitoring or interference against enemy. In case of using the conventional FEC and bit interleaving scheme. the processing time for error control coding and bit interleaving due to system complexity is highly demanded. In this paper. the effective information coding scheme of maprity error correction and block interleaving compatible to the proposed FH communication system is proposed to transmit voice or data (I6Kbps. 4.8Kbps. 2.4Kbps. 1.2Kbps, O.6Kbps) under the worst FH communication channel. In transmitter. low rate data signals are configured to majority data blocks. and transmitted repeatedly to FH channel which are structured to 20Kbps hopping frame cells. In receiver. the received data are decoded block by block, and taken majority error correction. Consequently. burst or random errors are corrected at the block deinterleaver and the majority decoder. The proposed coder structure reduces the coding/decnding processing time as well as the jamming interferences, and further simplify the data processing complexity for FH communication. Improved performance of the proposed scheme was verified under simulated channel environments.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.6
• /
• pp.139-146
• /
• 2007

A hard disk. which can be classified as an external storage is usually capacious and economical. In spite of the attractive characteristics and efforts on the performance improvement, however, the operation of the hard disk is apparently slower than a processor and the advancement has also been slowly conducted since it is based on mechanical process. On the other hand. the advancement of the processor has been drastically performed as semiconductor technology does. So, disk I/O sub-system becomes bottleneck of computer systems' performance. For this reason. the research on disk I/O sub-system is in progress to improve computer systems' performance. In this paper, we proposed multi-level LRU scheme and then apply it to the computer systems with buffer cache and disk cache. By applying the proposed scheme to computer systems. the average access time to ask blocks can be decreased. The efficiency of the proposed algorithm was verified by simulation results.

• The KIPS Transactions:PartD
• /
• v.11D no.4
• /
• pp.809-822
• /
• 2004

In this paper, we propose a concurrency control algorithm based on R-tree for spatial database management system. The previous proposed algorithms can't prevent problem that search operation is to be blocking during update operations. In case of multidimensional indexes like R-tree, locking of update operations may be locked to several nodes, and splitting of nodes have to lock a splitting node for a long time. Therefore search operations have to waiting a long time until update operations unlock. In this paper we propose new algorithms for lock-free search operation. First, we develop a new technique using a linked-list technique on the node. The linked-list enable lock-free search when search operations search a node. Next, we propose a new technique using a version technique. The version technique enable lock-free search on the node that update operations is to be splitting.