• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10b
• /
• pp.1295-1298
• /
• 2001

멀티미디어 스트리밍 서비스를 제공하는 서버의 동적 부하분산을 위한 동적 가중치 기반 라운드 로빈 스케줄링 알고리즘을 제안한다. 기존의 가중치 기반 라운드로빈 알고리즘은 서버의 처리 용량만을 이용하여 가중치를 부여하므로 요청이 폭주할 경우 동적 부하 불균형을 갖게 된다. 동적 부하 불균형을 해결하기 위해 제안한 동적 가중치 기반 라운드로빈 알고리즘은 서버의 처리 용량뿐만 아니라 서버의 동적 부하를 이용하여 가중치를 부여하므로 동적 부하 불균형에 잘 적응하여 부하를 균형있게 조절한 수 있다. 제안한 알고리즘은 각 서버의 처리용량을 기준으로 가중치를 계산하고 동적으로 변하는 서버의 부하값에 가중치를 적용한다. 그 결과 동적 부하 불균형 문제를 해결했으며, 더 세밀한 부하 조절 기능을 수행할 수 있었다

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.477-480
• /
• 2013

어라운드 뷰 시스템은 승용차의 앞뒤와 좌우 사이드 미러 하단에 1개씩 4개의 카메라를 이용해, 내비게이션 화면에 마치 차를 위에서 찍은 듯한 화면을 만들어 주는 기술이다. 최근 차량의 증가로 인해 사용자의 편의 및 안전에 대한 요구와 의존도가 증가함에 따라 운전자를 위한 보조 시스템이 구축되고 있다. 현재 운전자를 위한 보조 시스템으로 AVM(Around View Monitoring)기술이 개발되었다. 본 논문에서는 현재 시중에 제공되고 있는 다양한 어라운드 뷰 시스템들마다 인터페이스가 다르기 때문에 이를 어떻게 적용되었는지를 각 시스템들마다 비교분석하여 장점들을 알아보고, 이를 통해 각 인터페이스들의 장점들을 종합하여 효율적인 인터페이스를 제시하였다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.511-514
• /
• 2014

주차나 후진 시에 도움을 주기 위한 후방 카메라는 after-market을 통하여 많이 보급되어 있으나 좌우 측방과 전방의 차량 경계를 확인할 수 없어 많은 불편함이 있다. 차량의 주변을 한 눈에 감시할 수 있는 어라운드뷰 시스템은 자동차 벤더들에 의해 장착되고 있으나 이에 대한 체계적인 연구는 부족한 실정이다. 일본 닛산 자동차의 인피니티 차량에 적용된 AVM이 이에 적합한 제품이지만 아날로그 케이블을 사용하여 부가적인 케이블링 작업과 EMI에 대한 간섭에 따른 화질저하의 단점을 가진다. 본 논문에서 구현된 MOST150 네트워크 기반 어라운드뷰 시스템은 광 네트워크이므로 EMI/EMC 문제가 없으며 배선이 간단하다는 장점이 있으며, MOST150 네트워크가 구축된 환경에서는 plug-and-play 형태로 쉽게 장착할 수 있는 장점이 있다.

• 전기의세계
• /
• v.44 no.7
• /
• pp.14-16
• /
• 1995

전력저장기술개발은 다가오는 그린라운드시대에 도래하는 기후변화협약에 대응하는 방안의 하나인 원자력발전의 보급확대에 필수적인 요소로 감발운전이 어려운 원자력발전의 부하추종운전 및 부하평준화, 피크커트에 적절히 보완되어 이용될 것이다.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.4
• /
• pp.252-258
• /
• 2013

As WSN is energy constraint so energy efficiency of nodes is important. Because avoiding long distance communication, clustering operating in rounds is an efficient algorithm for prolonging the lifetime of WSN and its performance depends on duration of a round. A short round time leads to frequent re-clustering while a long round time increases energy consume of cluster heads more. So existing clustering schemes determine proper round time, based on the parameters of initial WSN. But it is not appropriate to apply the round time according to initial value throughout the whole network time because WSN is very dynamic networks nodes can be added or vanished. In this paper we propose a new algorithm which calculates the round time relying on the alive node number to adapt the dynamic WSN. Simulation results validate the proposed algorithm has better performance in terms of energy consumption of nodes and loss rate of data.

• Journal of Digital Convergence
• /
• v.13 no.6
• /
• pp.185-195
• /
• 2015

This study aims to study the change in the level of awareness of medical personnels regarding the patient safety culture(PSC) before and after the Leadership WalkRounds(LWR). The LWR in this study was based on the IHI and the models of the Patient Safety Rounds(PSRs) at University of Michigan, emphasizing the 5 steps of Preparation--Scheduling--Conducting--Reporting--Resolving. After the LWR the scores for the level of awareness showed a statistically significant increase from 2.63 to 3.36(p<.001). Among the participants, those who are pharmaceutists, women, 30.0~39.9 years old, or had work experience of a year or less showed particularly notable increase in awareness. The effect was significant across all categories of PSC, especially in Safety Accident Reporting(p<.001), then in Communication(p<.001). Therefore the LWR proved an convergent concept for applying new leadership skill and the concept of patient safety management as an method to elevate the frontline staffs' awareness of PSC.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.7 no.3
• /
• pp.373-378
• /
• 2006

One of the biggest problems that should be solved in present RFID systems is a reduction of identification efficiency by the collision of singals between different tags. As the number of tags, which should be identified, increases over the size of allocated round, more slots experiences the collision between them. It can causes generation of tag collision assigning the fixed round size and so, allocated round size should be regulated properly. This paper proposes the algorithm which can reduce collision between tags, and allocate specific round size dynamically for efficient tag identification. After each round is finished, the reader allocates the round size dynamically using the collision information of the slot. All collision informations of the slot consists of the number of slots which came into conflict, tags which were realized properly without any conflictions and empty slots. We used slotted aloha algorithm as the collision detection algorithm and finally, checked that this could be used very usefully when this algorithm which was proposed effectively could not know how many number of tags were exisisted through the simulation in advance.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.4
• /
• pp.291-303
• /
• 2009

Round robin based proportional share scheduling(RRPS) defines weight which determines share for each task and allocates CPU resource to each task in proportional to its respective weight. RRPS uses fairness as the measure of performance and aims at high fairness of scheduling. However, researches for scheduling fairness problem due to synchronization among tasks have been rarely investigated. In this paper, we discuss that scheduling delay due to synchronization may result high unfairness in RRPS. We explain such a situation as weight inversion. We then propose weight inheritance protocol(WIP), a synchronization mechanism, that prevents weight inversion. We also show that WIP can reduce unfairness using fairness analysis and simulation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.05a
• /
• pp.257-260
• /
• 2002

This paper describes a design of cryptographic processor that implements the AES (Advanced Encryption Standard) block cipher algorithm“Rijndael”. To achieve high throughput rate, a sub-pipeline stage is inserted into the round transformation block, resulting that the second half of current round function and the first half of next round function are being simultaneously operated. For area-efficient and low-power implementation the round transformation block is designed to share the hardware resources in encryption and decryption. An efficient scheme for on-the-fly key scheduling, which supports the three master-key lengths of 128-b/192-b/256-b, is devised to generate round keys in the first sub-pipeline stage of each round processing. The cryptoprocessor designed in Verilog-HDL was verified using Xilinx FPGA board and test system. The core synthesized using 0.35-${\mu}{\textrm}{m}$ CMOS cell library consists of about 25,000 gates. Simulation results show that it has a throughput of about 520-Mbits/sec with 220-MHz clock frequency at 2.5-V supply.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.39 no.11
• /
• pp.33-43
• /
• 2002

This paper describes a design of cryptographic processor that implements the AES (Advanced Encryption Standard) block cipher algorithm "Rijndael". To achieve high throughput rate, a sub-pipeline stage is inserted into a round transformation block, resulting that two consecutive round functions are simultaneously operated. For area-efficient and low-power implementation, the round transformation block is designed to share the hardware resources for encryption and decryption. An efficient on-the-fly key scheduler is devised to supports the three master-key lengths of 128-b/192-b/256-b, and it generates round keys in the first sub-pipeline stage of each round processing. The Verilog-HDL model of the cryptoprocessor was verified using Xilinx FPGA board and test system. The core synthesized using 0.35-${\mu}m$ CMOS cell library consists of about 25,000 gates. Simulation results show that it has a throughput of about 520-Mbits/sec with 220-MHz clock frequency at 2.5-V supply.