• Journal of information and communication convergence engineering
• /
• v.11 no.3
• /
• pp.173-178
• /
• 2013

To discover objects of interest in unstructured peer-to-peer networks, the peers rely on flooding query messages which create incredible network traffic. This article evaluates the performance of an unstructured Gnutella-like protocol over mobile ad-hoc networks and proposes modifications to improve its performance. This paper offers an enhanced mechanism for an unstructured Gnutella-like network with improved peer features to better meet the mobility requirement of ad-hoc networks. The proposed system introduces a novel caching optimization technique and enhanced ultrapeer selection scheme to make communication more efficient between peers and ultrapeers. The paper also describes an enhanced query mechanism for efficient searching by applying multiple walker random walks with a jump and replication technique. According to the simulation results, the proposed system yields better performance than Gnutella, XL-Gnutella, and random walk in terms of the query success rate, query response time, network load, and overhead.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.5
• /
• pp.654-659
• /
• 2007

This paper proposes the effective method for classifying the working spates and modelling the environments, when complex working environments of AGVS(Automated Guided Vehicle System) ate changed. And, we propose the shortest path searching algorithm using the A* algorithm of graph search method. Also, we propose the methods for finding each AGV's travel time of shortest path. Finally, a simple example is included for visualizing the feasibility of the proposed methods.

• Journal of Korean Medicine Rehabilitation
• /
• v.33 no.3
• /
• pp.129-134
• /
• 2023

Objectives The purpose of this study was to review the studies of catgut embedding related to obesity treatment. Methods We searched the papers with key words of obesity and catgut embedding via searching Research Information Sharing Service, DBpia, Koreanstudies Information Service System, Oriental Medicine Advanced Searching Integrated System, Scopus, PubMed. Additional data including study design, study topics, characteristics of participants and treatment, outcomes was extracted from full text of each study. Results There were nine studies about the catgut embedding related to obesity treatment. Five articles were conducted in China, two articles were conducted in Mexico, and two articles was published in Korea. Analysis of seven experimental studies and two observational studies were conducted to describe each research subject, method, and research results. Conclusions More interest and further research will be needed on catgut embedding related to obesity treatment in the Korean medicine to achieve clinical application and to develop treatment protocols for the obesity disease.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.4
• /
• pp.1-9
• /
• 2010

In the new generation of Web, commonly called "Web 2.0", blogging has facilitated the publishing information or his/her opinion on the web. Various blog retrieval algorithms have been proposed to search for blogs more effectively. However, actually keyword-based searching or link-analysis blog ranking system cannot satisfy the user's requirement. In this paper, we suggest a topic-based weighting blog retrieval system in which the links between blog writings and searching words are considered to improve the search results. Our system extracts topics from each blog and weights them much higher than other guide words. In the comparison with other systems, we see that the proposed topic-base system has better recall rate of search results.

• Proceedings of the Korean Radioactive Waste Society Conference
• /
• 2018.11a
• /
• pp.45-46
• /
• 2018

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.5
• /
• pp.895-907
• /
• 2020

With the recent increasing influence of multimedia content other than the text-based content, services that help to process information in content brings us great convenience. These services' representative features are searching and masking the sensitive data. It is not difficult to find the solutions that provide searching and masking function for text information and image. However, even though we recognize the necessity of the technology for searching and masking a part of the audio data, it is not easy to find the solution because of the difficulty of the technology. In this study, we propose web application that provides searching and masking functions for audio data using audio partitioning method. While we are achieving the research goal, we evaluated several speech to text conversion APIs to choose a proper API for our purpose and developed regular expressions for searching sensitive information. Lastly we evaluated the accuracy of the developed searching and masking feature. The contribution of this work is in design and implementation of searching and masking a sensitive information from the audio data by the various functionality proving experiments.

• Journal of Digital Contents Society
• /
• v.15 no.2
• /
• pp.251-261
• /
• 2014

In the typical P2P VOD system, it is very important to develop the fast and efficient peer searching scheme since the peers frequently join and leave to/from P2P system. This paper proposes a new peer searching scheme for P2P VOD system based on DHT network environment. The proposed scheme constructs DHT network by managing the peers having close playback starting times and close network locations into a peer all together. The peer information is mapped onto DHT nodes by hashing the key values each of which consists of the starting time and network location of the peer. From the simulation results, the number of messages required to search the partner peers are decreased, and the number of buffer maps exchanging among the peers are also decreased. The proposed scheme can reduce the average network distances among the partner peers. As a result, the proposed scheme makes routing more efficient and it saves the network resources by decreasing communication traffic overhead.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.196-199
• /
• 2004

This paper presents a structure of the searcher using the space diversity in array antenna system operating in the DS/CDMA signal environments. The new technique exploits the fact that the In-phase and Quadrature components of interferers can respectively be viewed as independent Gaussian noise at each antenna element in most practical CDMA (Code Division Multiple Access) signal environments. The proposed PN acquisition scheme is a single dwell serial PN acquisition system consisting of two stage, that is, the searching stage and the verification stage. The searching stage correlates the received signals with the local PN oscilator for obtaining the synchronous energy at the entire uncertainty region. The verification stage compares the searching energy with the optimal threshold, which is pre-designed in the Lock-Detector, and decides whether the acquisition is successful or fail. In this paper, we analyzed the relationship of both diversity order and the mean acquisition time. In general, It is known that the mean acquisition time decreases significantly as the number of antenna elements increases. But, the enhancement of the performance is saturated in terms of PN acquisition scheme. Therefore, to decrease the mean acquisition time, we must design the optimal array antenna system by considering the operating SNR range of the receiver, the detection probability, and the false alarm probability. The performance of the proposed acquisition scheme is analyzed in frequency-selective Rayleigh fading channels. In this paper, the effect of the number of antenna elements on acquisition scheme is considered in terms of the detection probability, false alarm probability. and the mean acquisition time.

• Journal of KIISE
• /
• v.44 no.10
• /
• pp.1045-1061
• /
• 2017

This paper suggests a method to expand linkages in a Linked Open Data(LOD) cloud that is a practical consequence of a semantic web. LOD cloud, contrary to the first expectation, has not been used actively because of the lack of linkages. Current method for establishing links by applying to explicit links and attaching the links to LODs have restrictions on reflecting target LODs' changes in a timely manner and maintaining them periodically. Instead of attaching them, this paper suggests that each LOD should prepare a link policy and publish it together with the LOD. The link policy specifies target LODs, predicate pairs, and similarity degrees to decide on the establishment of links. We have implemented a system that performs in-depth searching through LODs using their link policies. We have published APIs of the system to Github. Results of the experiment on the in-depth searching system with similarity degrees of 1.0 ~ 0.8 and depth level of 4 provides searching results that include 91% ~ 98% of the trustworthy links and about 170% of triples expanded.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1B
• /
• pp.56-66
• /
• 2009

In the traditional Server/Client architecture, the client connects to the known servers and gets information through web searching. However, nowadays, diverse internet devices providing services (get) working on internet easily. The update interval of the services or information provided by the devices is relatively short. And also they tend to be both a server and a client. In this situation, the way of the traditional information searching such as web searching is not appropriate. In this paper we propose a service push model, where it pushes its service profiles to all the other network devices by broadcasting them on the network. When a device connects to the network newly, it can get all service profiles in the network and it gets service profiles newly pushed by service providers in prompt. Also it can call any service among the service profiles within itself. We implemented a prototype system for the service push model on the JXTA platform based on P2P network. Also we measured the service profile pushing delay, the service discovery time, and the response time of service execution by running test applications written on the prototype system.