• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.5
• /
• pp.854-859
• /
• 2010

Distribution Automation System(DAS) is designed to improve operational efficiency by acquisition and control of remote data using its components such as central computation units, communication network and feeder remote terminal units. A conventional human machine interface of the DAS adopts a schematic diagram which is made by drawing power equipments on the geographic information system map. The single line diagram is more useful than the schematic diagram for the main tasks of distribution system operation such as protective relay coordination, service restoration and loss minimization. Since the configuration of the distribution line is changed according to the relocation of the open tie switches, the auto-drawing algorithm based on the connection between the sections and the switches is an essential technique. This paper proposes a new auto-drawing algorithm for a single line diagram of distribution systems based on tertiary tree and collision avoidance method. The feasibility of the proposed algorithm has been testified for various cases using practical distribution system with 12 feeders.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.120.3-120
• /
• 2001

We propose a new method of path planning for cleaning robots. Path planning problem for cleaning robots is different from conventional path planning problems in which finding a collision-free trajectory from a start point to a goal point is focused. In the case of cleaning robots, however, a planned path should cover all area to be cleaned. To resolve this problem in a systematic way, we propose a method based on a graph model as follows: at first, partition a given map into proper regions, then transform a divided region to a vertex and a connectivity between regions to an edge of a graph. Finally, a region is divided into sub-regions so that the graph has a unary tree which is the simplest Hamilton path. The effectiveness of the proposed method is shown by computer simulation results.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.7 no.2
• /
• pp.29-39
• /
• 1998

A conversational programming system for turning processes was studied to enhance the user friendliness of a NC Lathe by adopting man-machine interface functions through Delphi programming tool under the Windows 95 environment. Functions of tool collision checking were developed through zone limitation algorithms. Final shape of workpiece was generated by means of tree structure algorithm. Shop floor programming performance was incorporated in the developed CAM module. In order to increase flexibility of the man-machine interface, graphic based programming tools have been developed. A NC turning machine equipped with an open architecture PCNC was used as a test bed of the system. Performance of the system was verified through case studies.

• Proceedings of the KIEE Conference
• /
• 2007.10a
• /
• pp.493-494
• /
• 2007

RFID (Radio Frequency IDentification) 시스템에서 수동 태그의 낮은 전송 파워 때문에 리더는 태그와의 통신시 많은 에러를 경험하게 된다. 이것은 리더가 태그의 정보를 빠르고 정확하게 인식하는 것을 어렵게 만든다. 따라서, 이러한 문제를 해결하기 위해 에러에 강한 알고리즘을 개발하고 적용할 필요가 있다. 리더가 태그의 정보를 인식하기 위해 사용하는 대표적인 프로토콜에는 ALOHA 기반의 DFSA (Dynamic Framed-Slotted ALOHA) 프로토콜과 트리 기반의 이진트리 프로토콜이 있다. 기존의 두 프로토콜 중 DFSA는 에러가 없을 때 이진트리 보다 성능이 우수하나, 에러가 존재할 때, 이진트리 보다 약 35% 정도 에러의 영향을 많이 받는 성질을 보인다. 본 논문에서는 에러가 있는 환경과 없는 환경에서의 DFSA와 이진트리 프로토콜의 성능을 분석하고, 시뮬레이션을 이용하여 이 논문에서의 성능 분석 방법이 타당함을 증명한다. 그리고 에러가 많은 환경에서는, 빠른 RFID 태그 인식을 위해 DFSA 프로토콜보다 이진트리 프로토콜을 사용할 것을 제안한다.

• Journal of Information Processing Systems
• /
• v.6 no.4
• /
• pp.453-480
• /
• 2010

Cryptographic hash functions reduce inputs of arbitrary or very large length to a short string of fixed length. All hash function designs start from a compression function with fixed length inputs. The compression function itself is designed from scratch, or derived from a block cipher or a permutation. The most common procedure to extend the domain of a compression function in order to obtain a hash function is a simple linear iteration; however, some variants use multiple iterations or a tree structure that allows for parallelism. This paper presents a survey of 17 extenders in the literature. It considers the natural question whether these preserve the security properties of the compression function, and more in particular collision resistance, second preimage resistance, preimage resistance and the pseudo-random oracle property.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11a
• /
• pp.451-454
• /
• 2002

충돌검사는 사실감 있는 3 차원 공간을 시뮬레이션 하기 위해서 필수적인 요소이다. 본 논문에서는 BSP 로 표현될 수 있는 정적 게임환경과 Bounding Sphere 로 표현될 수 있는 움직이는 물체와의 효과적인 충돌검사 방법에 대해서 기술하고 있다. 본 논문에서 제안하는 충돌검사 알고리즘은 단 하나의 BSP 트리를 사용하여 임의의 크기의 bounding sphere 와 충돌검사를 할 수 있다는 장점을 가진다.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.9
• /
• pp.43-50
• /
• 2018

In this paper, we propose a hexagon model-based efficient beacon frame scheduling approach for wireless sensor networks. The existing beacon frame scheduling approaches use a lot of slots and subslots for the beacon frame scheduling. Thus, the data from source nodes are not efficiently delivered to a sink node. Also in case a sink node needs to broadcast a beacon frame to the nodes in the network, delivering the beacon frame to the network nodes is not efficient as well. Thus, to solve the problem, we use a hexagon model to find the number of slots and subslots for the beacon frame scheduling. By using them for the beacon frame scheduling, the proposed approach performs better than other approaches in terms of the data transmission delay, the number of received data, the beacon transmission delay and the number of relaying the beacon frames.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.12
• /
• pp.111-121
• /
• 2014

In this paper, we propose tree-based hybrid query tree architecture utilizing time slot. 4-Bit Pattern Slot Allocation(4-SL) has a 8-ary tree structure and when tag ID responses according to query of the reader, it applies a digital coding method, the Manchester code, in order to extract the location and the number of collided bits. Also, this algorithm can recognize multiple Tags by single query using 4 fixed time slots. The architecture allows the reader to identify 8 tags at the same time by responding 4 time slots utilizing the first bit($[prefix+1]^{th}$, F ${\in}$ {'0' or '1'}) and bit pattern from second ~ third bits($[prefix+2]^{th}{\sim}[prefix+3]^{th}$, $B_2{\in}$ {"00" or "11"}, $B_1{\in}$ {"01" or "10"}) in tag ID. we analyze worst case of the number of query nodes(prefix) in algorithm to extract delay time for recognizing multiple tags. The identification delay time of the proposed algorithm was based on the number of query-responses and query bits, and was calculated by each algorithm.

• Journal of Haehwa Medicine
• /
• v.27 no.1
• /
• pp.9-20
• /
• 2018

Objectives : Ten heavenly stems(10天干) and Twelve earthly branches(12地支) are symbols exposing change order in heaven and earth, and are a very important sign in studying oriental philosophy and oriental medicine. Especially, 10 heavenly stems(10天干) and 12 earthly branches(12地支) are indispensable for the study of Five Circuits And Six Qi(오운육기), and a deep study is needed. Methods : I have examined Yin Yang combination(음양배합), Five elements combination(오행배합), Six Qi 3Yin 3Yang combination(육기삼음삼양배합), viscera combination(장부배합), Mutual collision(상충), Six combination(육합), Three combination(삼합), etc. of 12 earthly branches(12지지) by referring to books such as "Yellow Emperor Internal Classic" ("黃帝內經") and "Principle of universe change" ("우주변화의 원리"). Results & Conclusions : Zi Yin Chen Wu Shen Xu(子 寅 辰 午 申 戌) become Yang(陽), Chou Mao Si Wei You Hai(丑 卯 巳 未 酉 亥) become Yin(陰), Zi Si Yin Mao Chen Si(子 丑 寅 卯 辰 巳) become Yang, and Wu Wei Shen You Xu Hai(午 未 申 酉 戌 亥) become Yin. Twelve earthly branches can be divided into five movements by its original meaning, where YinMao(인묘) is tree, SiWu(사오) is a fire, ShenYou(신유) is a gold, HaiZi(해자) is water, and ChenXuChouWei(진술축미) mediate in the middle of four movements So they become soil(土). SiHai(巳亥) is JueYin Wind Tree(궐음 풍목), ZiWu(子午) is ShaoYin Monarch Fire(소음 군화), ChouWei(丑未) is TaiYin Humid Soil(태음 습토), YinShen(寅申) is ShaoYang Ministerial Fire(소양 상화), MaoYou(卯酉) is YangMing Dry Gold(양명 조금), and ChenXu(辰戌) is TaiYang Cold Water(태양 한수). Viscera combination(장부배합) combines Zi(子) and Bile(膽), Chou(丑) and Liver(肝), Yin(寅) and Lung(肺), Mao(卯) and Large intestine(大腸), Chen(辰) and Stomach(胃), Si(巳) and Spleen(脾), Wu(午) and Heart(心), Wei(未) and Small intestine(小腸), Shen(申) and Bladder(膀胱), You(酉) and Kidney(腎), Xu(戌) and Pericardium(心包), Hai(亥) and Tri-energizer(三焦), Which means that the function of the viscera and channels is the most active at that time. Twelve earthly branches mutual collisions collide with Zi(子) and Wu(午), Chou(丑) and Wei(未), Yin(寅) and Shen(申), Mao(卯) and You(酉), Chen(辰) and Xu(戌), and Si(巳) and Hai(亥). The two colliding earthly branches are on opposite sides, facing each other and restricting each other by the relation of Yin-Yin and Yang-Yang it rejects each other so a collision occurs. Six Correspondences(六合) coincide with Zi(子) and Chou(丑), Yin(寅) and Hai (亥), Mao(卯) and Xu(戌), Chen(辰) and You(酉) and Si(巳) and Shen(申) Wu(午) and Wei(未). Three combination(三合) is composed of ShenZiChen(申子辰), SiYouChou(巳酉丑), YinWuXu(寅午戌), and HaiMaoWei(亥卯未). Three combination(三合) is composed of ShenZiChen(申子辰), SiYouChou(巳酉丑), YinWuXu(寅午戌), and HaiMaoWei(亥卯未). This is because the time Six Qi(六氣) shifts in these three years are the same.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.49 no.3
• /
• pp.62-73
• /
• 2012

IEEE 802.15.4 standard which has low-speed, low-power, low-cost can be efficiently used in wireless sensor network environment. Among various topologies used in IEEE 802.15.4 standard, a cluster-tree topology which has many nodes in it, transmit delay, energy consumption and data loss due to traffic concentration around the sink node. In this paper, we propose the MRS-DCA algorithm that minimizes conflicts between packets for efficient data transmission, and dynamically allocates the active period for efficient use of limited energy. The MRS-DCA algorithm allocates RP(Reservation Period) to the active period of IEEE 802.15.4 and guarantees reliable data transmission by allocating RP and CAP dynamically which is based on prediction using EWMA. The comparison result shows that the MRS-DCA algorithm reduces power consumption by reducing active period, and increasing transmission rate by avoiding collision.