• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.11
• /
• pp.2027-2031
• /
• 2007

Recently the diffusion of the advancement of mobile communication technique and mobile terminal increased, The users were demanded seamless services when carrying and moving. It proposed the FMIPv6(Fast Handoff for Mobile IPv6) from the IETF like this meeting this requirement. The handover procedure of the FMIPv6 causes to defecate with movement detection, new CoA configuration and binding update. But, the delay occurs from each process, when the DAD(Duplicate Address Detection) of the CoA executing, the big delay occurs. This paper proposes a scheme of delay reduction, it omits DAD process and stores in the AR(Access Router) relates in the CoA of the mobile terminal information.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.11
• /
• pp.2500-2504
• /
• 2011

Living organisms are composed of cells that can replicate themselves through growth, division packed with tons capacity. On DNA mutations, ie mutations in the offspring's survival and reproduction can be held against you, and packed with tons ambivalence that could benefit. In this study, the DNA double helix is used as a template for replication, we first separated into single strands of the double helix must be opened Combining the double helix portion of the location of errors in the bond provides a way to find and repair.

• Journal of Korea Multimedia Society
• /
• v.19 no.8
• /
• pp.1466-1470
• /
• 2016

As individuals create many contents anytime and anywhere together with the widespread dissemination of smart devices as well as various social networking services (SNS), content centric networking (CCN) has regarded as a new networking technology. However, CCN is exposed to malicious attacks on the mobility management of mobile content sources during handover and high volume of control messages. Therefore, this paper presents a secure duplicate name detection (SecureDND) mechanism without additional control messages by signed information and secure token. It is shown from the performance evaluation that the proposed scheme can provide low control overhead, which results in the network scalability.

• Pediatric Infection and Vaccine
• /
• v.3 no.2
• /
• pp.123-127
• /
• 1996

Purpose : The most patients with acute streptococcal pharyngitis lack of classic clinical manifestations, therefore diagnostic laboratory test such as the throat culture or a rapid antigen detection test are frequently employed in primary practices of developed countries. We'd like to know the accuracy of the throat swab culture as gold standard for diagnosis of streptococcal infection with studying the discordant and concordant rate of duplicate culture. Methods : The study included 89 normal school children (boys:50, girls:39) who were attending Uljin primary school in Uljin, Kyong Sang Buk Do on March 1996. We obtained simultaneous 2 times of throat swab from each subject, and plating and streaking on 5-7% of sheep blood agar separately. We counted the characteristic beta-hemolytic colonies after overnight incubation. Results : 1) The carrier rate of beta-hemolytic streptococci at first culture is 25.1% and second one is 29.2%. 2) Ten out of 89(11.2%) is discordant in duplicate culture. 3) Culture containing less than 50 colonies of beta-hemolytic streptococci (+2) in first culture is 70.4%, second one is 85.7%. 4) Number of colonies is less than 50 in all ten discordant children. Conclusions : The discordant rate of duplicate throat swab cullture for beta-hemolytic streptococci is 11.2%, even if the subjects are normal school children. About 5% of individuals harboring beta-hemolytic streptococci in the pharynx may be missed by a single throat culture. If we are trying to examine the patients with pharyngitis, the discordant rate will be much lower than this results.

• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.1
• /
• pp.1-10
• /
• 2007

An advantage of the mobile ad hoc network (MANET) is that mobile nodes can self-organize the network topology without the help of network infrastructure. However, for the perfect self-organization of the MANET, each mobile node needs to self-configure its address. Even though a mobile node configures a unique address during the booting time, its address may conflict with nodes in other MANETs since MANETs containing the same address can be merged. The address autoconfiguration protocol implemented in this work consists of the strong DAD (Duplicate Address Detection) and the weak DAD. A unique address of a node is assigned by the strong DAD during the booting time and the weak DAD is used to detect address conflict and resolve address conflict during the ad hoc routing. In this work, we have implemented address autoconfiguration in the IPv6-based MANET using AODV as the routing protocol. We describe how the IPv6 address autoconfiguration is implemented and verify our implementation by showing the test scenarios on our testbed.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.10
• /
• pp.1334-1339
• /
• 2018

Viola & Jones's face detection algorithm is a typical face detection algorithm and shows excellent face detection performance. However, the Viola & Jones's algorithm in images including many faces generates undetected faces and wrong detected faces, such as false faces and duplicate detected faces, due to face diversity. This paper proposes an improved face detection algorithm using a face verification algorithm that eliminates the false detected faces generated from the Viola & Jones's algorithm. The proposed face verification algorithm verifies whether the detected face is valid by evaluating its size, its skin color in the designated area, its edges generated from eyes and mouth, and its duplicate detection. In the face verification experiment of 658 face images detected by the Viola & Jones's algorithm, the proposed face verification algorithm shows that all the face images created in the real person are verified.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.9A
• /
• pp.898-904
• /
• 2007

I must receive node discernment address for communication between node that participate to network in MANETs(Mobile Ad-hoc Networks). Address is created by node confidence or different node. I achieve address redundancy check (Duplicate Address Detection) to examine whether this address is available unique address. However, this method happens problem that MANETs' extensity drops. This paper can manage by group unit binding transfer nodes to group in MANETs. I suggest method that apply special quality of cluster that exchange subordinate decrease and mobility government official of control message are easy in address assignment protocol minimize time required in redundancy check and solves extensity problem. Method that propose in this paper shows excellent performance according to node number increase than wave and MANETConf [2] through simulation.

• Journal of Communications and Networks
• /
• v.11 no.3
• /
• pp.248-260
• /
• 2009

To connect a mobile ad hoc network (MANET) with an IP network and to carryout communication, ad hoc network node needs to be configured with unique IP adress. Dynamic host configuration protocol (DHCP) server autoconfigure nodes in wired networks. However, this cannot be applied to ad hoc network without introducing some changes in auto configuration mechanism, due to intrinsic properties (i.e., multi-hop, dynamic, and distributed nature) of the network. In this paper, we propose a scalable autoconfiguration scheme for MANETs with hierarchical topology consisting of leader and member nodes, by considering the global Internet connectivity with minimum overhead. In our proposed scheme, a joining node selects one of the pre-configured nodes for its duplicate address detection (DAD) operation. We reduce overhead and make our scheme scalable by eliminating the broadcast of DAD messages in the network. We also propose the group leader election algorithm, which takes into account the resources, density, and position information of a node to select a new leader. Our simulation results show that our proposed scheme is effective to reduce the overhead and is scalable. Also, it is shown that the proposed scheme provides an efficient method to heal the network after partitioning and merging by enhancing the role of bordering nodes in the group.

• Journal of Korea Society of Industrial Information Systems
• /
• v.15 no.3
• /
• pp.11-21
• /
• 2010

Increase in the number of sensor nodes in sensor networks and sensor node to automatically assign addresses are needed. The method developed to address existing severe wasting, coordinators have all address information, each sensor node when addressing the shortcomings are a lot of traffic. In this paper, 6LoWPAN automatically from the sensor nodes capable of efficiently addressing Hop-Count based hierarchical address allocation algorithm is proposed. How to propose a hop-count of divided areas are separated, with no overlap and can be assigned a unique address, DAD(Duplicate Address Detection) reduced area. Perform DAD to reduce traffic, packet transmission in the IP header destination address, respectively, with a minimum 32-bit compression and packet transmission over a non-compression method to reduce the number of 11.1%.

• Journal of KIISE:Databases
• /
• v.37 no.1
• /
• pp.50-55
• /
• 2010

Duplicate documents in blog service system are one of causes that deteriorate both of the quality and the performance of blog searches. Unlike the WWW environment, the creation of documents is reported every time in blog service system, which makes it possible to identify the original document from its duplicate documents. Based on this observation, this paper proposes a novel method for detecting duplication documents in blog service system. This method determines whether a document is original or not at the time it is stored in the blog service system. As a result, it solves the problem of duplicate documents retrieved in the search result by keeping those documents from being stored in the index for the blog search engine. This paper also proposes three indexing methods that preserve an accuracy of previous work, Min-hashing. We show most effective indexing method via extensive experiments using real-life blog data.