• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2004.04a
• /
• pp.38-41
• /
• 2004

납치ㆍ유괴는 개인의 자유로운 활동에 많은 영향을 미치는 위험요소이다. 이러한 위험 요소로부터 벗어나기 위해서 개인의 위치를 확인할 수 있는 시스템이 절실히 필요하다. 위성 항법 시스템(Global Positioning System, GPS)은 기상 상태에 상관없이 지구 전역에서 사용 가능한 효율적인 항법 시스템으로 위치정보에 대한 지표를 제공한다. GPS는 현재 지속적인 개발에 의해 수신 모듈의 소형화 고성능화가 이루어지고 있으며, 고정 또는 이동하는 시스템의 위치정보를 제공한다. GPS 시스템을 개인이 휴대하게 되면 개인의 이동경로를 확인할 수 있게 된다. 일반적으로 개인의 이동경로는 생활권역 내에 특정 지역으로 한정되는 경우가 많으며 이동경로 자체도 주된 교통수단과 맞물려 일정한 패턴을 형성한다. 이러한 이동특성에 착안하여 본 논문에서는 개인 안전을 위해 GPS의 위치정보와 소프트 컴퓨팅 기법을 접목한 시스템을 휴대한 사용자의 이동경로를 학습하여 개인의 안전을 보장하는 방법을 제안한다.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2010.07a
• /
• pp.51-54
• /
• 2010

본 논문에서는 포텐셜 필드 방법과 퍼지로직 시스템을 이용하여 멀티 모바일 로봇의 충돌회피를 위한 경로계획을 연구한다. 잘 알려진 포텐셜 필드 방법은 멀티 모바일 로봇 시스템에 있어서 각각의 로봇에 대한 전역경로를 계획하기 위해 사용되었으며, 퍼지로직 시스템은 각 로봇에 근접하는 혹은 진행하는 로봇의 경로를 가로막는 장애물과의 충돌을 피하고 안전하게 목적지에 도달하기 위한 지역경로를 계획하기 위해 이용되었다.

• 전기의세계
• /
• v.46 no.11
• /
• pp.34-36
• /
• 1997

대전지부는 대한전기학회 창립이후 1965년 5월 29일 선두로 발족한 이래 올해로 22년의 전통을 자랑하는 지부로써, 초대 배상환 지부장으로부터 유해경, 신지수, 임대철, 전승구, 강명식, 이은웅, 양재면, 남정일, 박상기, 노재화 지부장을 거쳐 백영기 지부장에 이르는 동안 회원의 수만도 350명이 넘는 큰 지부로 성장하게 되었다. 우리나라 최대의 연구단지인 대덕연구단지를 중심으로 충남권 전역에 걸쳐 15개가 넘는 대학, 기업체 부설연구소등 천혜의 연구조건을 갖춘 대전지부는 산.학.연 전문가들이 고루 분포되어 있어 대한전기학회 뿐만 아니라 대전.충남지역의 전기부문 기술발전과 인재양성에 크게 공헌하고 있다.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.13 no.2
• /
• pp.32-38
• /
• 1999

An autonomous mobile vehicle for transport system must plan optimal path in work envimnrent without human supervision and obstacle collision. This is to reach a destination without getting lost. In this paper, a genetic algorithm for globaI and local path planning and collision avoidance is proposed. The genetic algorithm searches for a path in the entire and continuous free space and unifies global path planning and local path planning. The sinmulation shows the proposed method is an efficient and effective method when compared with the traditional collision avoidance algorithms.rithms.

• 보존과학연구
• /
• s.36
• /
• pp.4-10
• /
• 2015

This paper confirms characteristics of lead isotopes of bronze artifacts excavated from Korea peninsula using 673 data classified according to Age, type and region. Lead isotopes data in Early iron ages are distributed in the southern Korean peninsula, but data in Joseon ages are concentrated in zone 3. Also Bronze artifacts excavated from Seoul, Gyeonggi, Chungcheong, Jeolla and Gyeonsang are manufactured using raw materials of the entire Korea peninsula, but bronzes excavated from North Korea aren't produced using raw materials of Gyeonsang provinces. Lead isotopes data will be able to find moving routes of raw materials and to separate the period of mixing and recycling of lead.

• Journal of KIISE:Software and Applications
• /
• v.32 no.6
• /
• pp.554-569
• /
• 2005

In the semistructured distributed documents, it is very difficult to formalize and implement the query processing system due to the lack of structure and rule of the data. In order to precisely retrieve and process the heterogeneous semistructured documents, it is required to handle multiple mappings such as 1:1, 1:W and W:1 on an element simultaneously and to generate the schema from the distributed documents. In this paper, we have proposed an query processing algorithm for querying and answering on the heterogeneous semistructured data or documents over distributed systems and implemented with a metadata interface. The algorithm for generating local queries from the global query consists of mapping between g1oba1 and local nodes, data transformation according to the mapping types, path substitution, and resolving the heterogeneity among nodes on a global input query with metadata information. The mapping, transformation, and path substitution algorithms between the global schema and the local schemas have been implemented the metadata interface called DBXMI (for Distributed Documents XML Metadata Interface). The nodes with the same node name and different mapping or meanings is resolved by automatically extracting node identification information from the local schema automatically. The system uses Quilt as its XML query language. An experiment testing is reported over 3 different OEM model semistructured restaurant documents. The prototype system is developed under Windows system with Java and JavaCC compiler.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.8B
• /
• pp.1105-1114
• /
• 2010

The Proxy Mobile IPv6 (PMIPv6) has been standardized by the IETF NETLMM WG for network-based mobility management. The PMIPv6 can provide IP mobility for Mobile Nodes (MNs) with low handover latency and less wireless resource usage. But, since the PMIPv6 is basically designed for local mobility management, it cannot support directly global mobility management between different PMIPv6 domains. In the PMIPv6, since all traffic is routed through a Local Mobility Anchor (LMA), it causes a long end-to-end delay and triangular routing problem. Therefore, in this paper, we propose a fast network-based global mobility management scheme and route optimization scheme with a new network entity, called Global Mobility Agent (GMA). Numerical analysis and simulation results show that the proposed scheme is able to support global mobility between different public domains with low handover latency and low end-to-end delay, compared with the PMIPv6.

• Proceedings of the Korean Society of Community Living Science Conference
• /
• 2003.11a
• /
• pp.140-140
• /
• 2003

호박(Cucurbita moschta DUCH)은 한국인들이 즐겨먹는 식용자원으로서 독특한 향미와 약리작용을 갖고 있다. 또한 기후 환경에 대한 적응력이 높고 병해충에도 비교적 강하여 농약사용이 적은 무공해 식품으로 알려져 있다. 호박의 과육에는 혈전증 예방과 두뇌발달에 기여하는 $\alpha$-linoleic acid가 다량 함유되어 있고, 비타민 A의 전구체인 $\beta$-carotene이 풍부하며, 위장이 약한 사람, 회복기의 환자, 부기가 있는 산모에게 좋은 식품으로 애용되어 왔다. 또한 예로부터 호박씨는 독성이 없으므로 어린이, 임산부, 허약자의 조충, 구제약으로 또는 젖이 잘 나지 않을 때에도 많이 쓰여왔다. 그리고 호박꽃은 잎과 함께 식용으로 널리 이용되었을 뿐 아니라 벌레에 물렸거나 상처 난 곳에 으깨어 문지르면 효과가 있어 민간요법으로 사용되어 왔다. 따라서 본 연구에서는 우리나라 전역에서 쉽게 구할 수 있는 호박꽃의 생리활성능을 검색해 봄으로써 천연기능성 식품 소재로의 활용가능성을 제시해 보고자 하였다.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.2
• /
• pp.66-77
• /
• 2011

We propose a framework for grouping photographic advertising images that employs a hierarchical indexing scheme based on efficient feature combinations. The study provides one specific application of effective tools for monitoring photographic advertising information through online and offline channels. Specifically, it develops a preprocessor for advertising image information tracking. We consider both global features that contain general information on the overall image and local features that are based on local image characteristics. The developed local features are invariant under image rotation and scale, the addition of noise, and change in illumination. Thus, they successfully achieve reliable matching between different views of a scene across affine transformations and exhibit high accuracy in the search for matched pairs of identical images. The method works with global features in advance to organize coarse clusters that consist of several image groups among the image data and then executes fine matching with local features within each cluster to construct elaborate clusters that are separated by identical image groups. In order to decrease the computational time, we apply a conventional clustering method to group images together that are similar in their global characteristics in order to overcome the drawback of excessive time for fine matching time by using local features between identical images.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.9
• /
• pp.1931-1938
• /
• 2012

A by-pass path in wireless sensor networks is the alternative path which be able to forward data when a routing path is being broken. One reason of depleting energy is occurred by the path. The method for solving prior to addressed the problem is proposed. However, this method may deplete radio resource. The best path has advantage that network lifetime of sensor nodes is prolonged; on the contrary, in order to maintain the best path it have to share their information between the entire nodes. In this paper, we propose the best path searching algorithm in the distributed three dimensional sensor networks. Through the neighboring informations sharing in the proposed method, the proposed algorithm can decide the best k-path as well as the extension of network lifetime.