• Bulletin of the Korean Chemical Society
• /
• v.32 no.11
• /
• pp.4083-4085
• /
• 2011

• Journal of the Korean Chemical Society
• /
• v.52 no.3
• /
• pp.266-272
• /
• 2008

• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• pp.571-575
• /
• 2004

Having age of ubiquitous ahead, existing IPv4's address space insufficiency phenomenon appears because of increasing network usage as well as multimedia data transmission becomes much, necessity of new IP address system that guarantee QoS are needed. IPv6 was made to solve these problem. IPv6 solves address space insufficiency phenomenon offering by 128bit address space, and also offers hierarchical address layer that support improved QoS. IPv6 defines relation between surrounding node using Neighbor Discovery protocol. Used Neighbor Discovery messages, grasp surrounding node, include important informations about network. These network information outcrops can give rise in network attack and also service that use network will paralysis. Various kinds of security limitation was found in Present Neighbor Discovery protocol therefore security function to supplement tris problem was required. In this thesis, Secure Neighbor Discovery protocol that add with security function was design and embody by CGA module and SEND module.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.2
• /
• pp.680-699
• /
• 2015

The use of web service has been increased rapidly, with an increase in the number of available services, finding the exact service is the challenging task. Service discovery is the most significant job to complete the service discoverers needs. In order to achieve the efficient service discovery, we focus on designing a cluster based service discovery model for service registering and service provisioning among all mobile nodes in a mobile ad hoc network (MANETs). A dynamic backbone of nodes (i.e. cluster heads) that forms a service repository to which MANET nodes can publish their services and/or send their service queries. The designed model is based on storing services with their service description on cluster head nodes that are found in accordance with the proposed cluster head election model. In addition to identifying and analyzing the system parameters for finding the effectiveness of our model, this paper studies the stability analysis of the network, overhead of the cluster, and bandwidth utilization and network traffic is evaluated using analytic derivations and experimental evaluation has been done.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.05a
• /
• pp.1451-1454
• /
• 2006

Grid 컴퓨팅은 과학 분야에서 처음 시작되어 현재 과학 분야뿐만 아니라 e-business와 같은 더 많은 분야에서 폭 넓은 활용을 위하여 SOA(Services Oriented Architecture)를 채택하게 되었으며, SOA 프레임워크에 있는 기존의 어플리케이션과 프로그래밍 라이브러리를 통합하게 되었다. 특히 SOA에 기반을 둔 Clarens Grid 서비스 프레임워크는 권한 부여(authorization), 접근 제어(access control), Discovery Service를 제공한다. 본 논문에서는 Java로 구현한 JClarens를 이용하여 Discovery Service를 구현하는 두 가지 방법을 기술하고, 그 구현 방법으로 인해 발생할 수 있는 서비스 재등록으로 인한 네트워크 트래픽 증가에 대한 문제점을 진단하고 재등록을 위한 시간 간격을 차등화 함으로서 이 문제점을 해결할 수 있는 방안을 제안하였다. 따라서 Discovery Service는 Grid 컴퓨팅 환경에서 사용자에게 가장 적절한 자원을 발견할 수 있도록 지원 할 것이다.

• ETRI Journal
• /
• v.35 no.6
• /
• pp.1144-1147
• /
• 2013

Dual-mode terminals (DMTs) equipped with cellular and WLAN interfaces have become popular in recent years. Users of DMTs can enjoy high-speed WLAN Internet access and wide area Internet access to cellular networks. However, a DMT may consume power inefficiently when discovering a WLAN with inherently limited service coverage. In this letter, we propose to use smart WLAN discovery (SWD) to minimize the power consumption required for WLAN discovery. To minimize the power consumption of a DMT, an SWD DMT activates its WLAN interface only when the DMT transfers data within the WLAN coverage area. The simulation results of SWD show an improved power-saving performance compared to previous WLAN discovery schemes.

• Bulletin of the Korean Chemical Society
• /
• v.32 no.12
• /
• pp.4165-4166
• /
• 2011

• Journal for History of Mathematics
• /
• v.29 no.4
• /
• pp.243-254
• /
• 2016

This research identifies the elements of the methodologies of Newton's discovery of his dynamics. These methodologies involve the transformation of preceding theoretical concepts and the discovery of common cause. This essay consists of two parts within historical case studies of Newton's works. The elements of the method of discovery consists of the transformation of preceding concepts and the identification of common cause in the formation of the research program's hard cores and protective belts. Newton transformed their predecessors' concepts to find out appropriate common causes in his dynamical theory. The transformed theoretical concepts are synthesized to be constructed as the elements of common cause which provide the foundations of Newtonian research programs.

• Biomolecules & Therapeutics
• /
• v.21 no.6
• /
• pp.411-422
• /
• 2013

G-protein-coupled receptors (GPCR) are the largest superfamily of receptors responsible for signaling between cells and tissues, and because they play important physiological roles in homeostasis, they are major drug targets. New technologies have been developed for the identification of new ligands, new GPCR functions, and for drug discovery purposes. In particular, intercellular lipid mediators, such as, lysophosphatidic acid and sphingosine 1-phosphate have attracted much attention for drug discovery and this has resulted in the development of fingolimod (FTY-720) and AM095. The discovery of new intercellular lipid mediators and their GPCRs are discussed from the perspective of drug development. Lipid GPCRs for lysophospholipids, including lysophosphatidylserine, lysophosphatidylinositol, lysophosphatidylcholine, free fatty acids, fatty acid derivatives, and other lipid mediators are reviewed.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.1
• /
• pp.23-32
• /
• 2017

We can obtain useful knowledge from data by using a subgroup discovery algorithm. Subgroup discovery is a rule model learning method that finds data subgroups containing specific information from data and expresses them in a rule form. Subgroups are meaningful as they account for a high percentage of total data and tend to differ significantly from the overall data. Subgroup is expressed with conjunction of only literals previously. So, the scope of the rules that can be derived from the learning process is limited. In this paper, we propose a method to increase expressiveness of rules through internal disjunctive representation of attribute values. Also, we analyze the characteristics of existing subgroup discovery algorithms and propose an improved algorithm that complements their defects and takes advantage of them. Experiments are conducted with the traffic accident data given from Busan metropolitan city. The results shows that performance of the proposed method is better than that of existing methods. Rule set learned by proposed method has interesting and general rules more.