• Proceedings of the Korea Contents Association Conference
• /
• 2005.11a
• /
• pp.442-445
• /
• 2005

It constructs a database generally and service it does, to use a commercial business DBMS that manages information and to use a retrieval system that supports a search, it adopts the gearing method of the DBMS and information retrieval system. But like this method is inconvenient must operate the DBMS and information retrieval system with duplication to be, there is a weak point where the data management and processing become accomplished with duplication. It presents the DB construction and information search and the management model of the KRISTAL-2002 information retrieval and management system base for the scientific and technical information data management and processing from the dissertation which it sees.

• Journal of Information Management
• /
• v.38 no.1
• /
• pp.75-98
• /
• 2007

Each domain of web services increased in geometrical progression by remarkable growth of the Internet serves various services or functions, and earns an income. And all services are divided by individual goal in each domain. What counts is that we must offer a personal data, our human resource information to use web service in the majority of cases. Otherwise we have to act under constraint in using the many web services. In this paper, we analyze the database structure or schema for managing human resource information from several web sites or service demands, and propose an agent design and implementation method for preventing duplication input of personal human resource information and sharing the human resource data.

• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.397-399
• /
• 2005

Handover is one of the most important factors that may degrade the performance of TCP connections and real-time applications in wireless data networks. We proposed a seamless handover with Motion Prediction in IEEE 802.16e-based broadband wireless access networks. By intergrating MAC and network layer handovers efficiently, this scheme minimizes the handover delay and eliminates packet losses during handover Simulations show that this scheme achieves loss-free packet delivery without packet duplication and increases TCP throughput significantly.

• ETRI Journal
• /
• v.28 no.6
• /
• pp.709-720
• /
• 2006

In this paper, we suggest a simple and efficient multiple-forwarder-based file distribution method which can work with a tree-based application layer multicast. Existing multiple-forwarder approaches require high control overhead. The proposed method exploits the assumption that receivers join a session at different times. In tree-based application layer multicast, a set of data packets is delivered from its parent after a receiver has joined but before the next receiver joins without overlapping that of other receivers. The proposed method selects forwarders from among the preceding receivers and the forwarder forwards data packets from the non-overlapping data packet set. Three variations of forwarder selection algorithms are proposed. The impact of the proposed algorithms is evaluated using numerical analysis. A performance evaluation using PlanetLab, a global area overlay testbed, shows that the proposed method enhances throughput while maintaining the data packet duplication ratio and control overhead significantly lower than the existing method, Bullet.

• The Journal of Society for e-Business Studies
• /
• v.14 no.4
• /
• pp.1-17
• /
• 2009

E-Catalogs which describe products or services are one of the most important data for the electronic commerce. E-Catalogs are created, updated, and removed in order to keep up-to-date information in e-Catalog database. However, when the number of catalogs increases, information integrity is violated by the several reasons like catalog duplication and abnormal classification. Catalog search, duplication checking, and automatic classification are important functions to utilize e-Catalogs and keep the integrity of e-Catalog database. To implement these functions, probabilistic models that use statistics of index words extracted from e-Catalogs had been suggested and the feasibility of the methods had been shown in several papers. However, even though these functions are used together in the e-Catalog management system, there has not been enough consideration about how to share common data used for each function and how to effectively manage statistics of index words. In this paper, we suggest a method to implement these three functions by using simple SQL supported by relational database management system. In addition, we use materialized views to reduce the load for implementing an application that manages statistics of index words. This brings the efficiency of managing statistics of index words by putting database management systems optimize statistics updating. We showed that our method is feasible to implement three functions and effective to manage statistics of index words with empirical evaluation.

• Journal of Computing Science and Engineering
• /
• v.6 no.3
• /
• pp.227-242
• /
• 2012

Vehicular Ad Hoc Networks (VANETs) are highly dynamic and unstable due to the heterogeneous nature of the communications, intermittent links, high mobility and constant changes in network topology. Currently, some of the most important challenges of VANETs are the scalability problem, congestion, unnecessary duplication of data, low delivery rate, communication delay and temporary fragmentation. Many recent studies have focused on a hybrid mechanism to disseminate information implementing the store and forward technique in sparse vehicular networks, as well as clustering techniques to avoid the scalability problem in dense vehicular networks. However, the selection of intermediate nodes in the store and forward technique, the stability of the clusters and the unnecessary duplication of data remain as central challenges. Therefore, we propose an adaptable destination-based dissemination algorithm (DBDA) using the publish/subscribe model. DBDA considers the destination of the vehicles as an important parameter to form the clusters and select the intermediate nodes, contrary to other proposed solutions. Additionally, DBDA implements a publish/subscribe model. This model provides a context-aware service to select the intermediate nodes according to the importance of the message, destination, current location and speed of the vehicles; as a result, it avoids delay, congestion, unnecessary duplications and low delivery rate.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.3
• /
• pp.543-548
• /
• 2017

In the conventional algorithm, the D2D message dissemination algorithm based on the Epidemic routing protocol frequently causes a problem of duplication of the received messages due to the overlaps of D2D transmission coverages. It is because all D2D devices that receive the messages perform relaying the message replicas to other D2D devices within their transmission range. Therefore, we herein propose the farthest-k relay selection algorithm to mitigate this message duplication problem. In the farthest-k relay selection algorithm, less than k devices within the D2D transmission range perform message relay. Furthermore, we perform comparative performance analysis between the conventional D2D data dissemination algorithm and our farthest-k relay selection algorithm. By using intensive MATLAB simulations we prove the performance excellency of our farthest-k relay algorithm compared with the conventional algorithm with respect to coverage probability, the total number of initially and duplicately received messages, and transmission efficiency.

• Journal of Korean Neurosurgical Society
• /
• v.64 no.3
• /
• pp.386-405
• /
• 2021

Recent advancements in basic research on the process of secondary neurulation and increased clinical experience with caudal spinal anomalies with associated abnormalities in the surrounding and distal structures shed light on further understanding of the pathoembryogenesis of the lesions and led to the new classification of these dysraphic entities. We summarized the changing concepts of lesions developed from the disordered secondary neurulation shown during the last decade. In addition, we suggested our new pathoembryogenetic explanations for a few entities based on the literature and the data from our previous animal research. Disordered secondary neurulation at each phase of development may cause corresponding lesions, such as failed junction with the primary neural tube (junctional neural tube defect and segmental spinal dysgenesis), dysgenesis or duplication of the caudal cell mass associated with disturbed activity of caudal mesenchymal tissue (caudal agenesis and caudal duplication syndrome), failed ingression of the primitive streak to the caudal cell mass (myelomeningocele), focal limited dorsal neuro-cutaneous nondisjunction (limited dorsal myeloschisis and congenital dermal sinus), neuro-mesenchymal adhesion (lumbosacral lipomatous malformation), and regression failure spectrum of the medullary cord (thickened filum and filar cyst, low-lying conus, retained medullary cord, terminal myelocele and terminal myelocystocele). It seems that almost every anomalous entity of the primary neural tube may occur in the area of secondary neurulation. Furthermore, the close association with the activity of caudal mesenchymal tissue in secondary neurulation involves a wider range of surrounding structures than in primary neurulation. Although the majority of the data are from animals, not from humans and many theories are still conjectural, these changing concepts of normal and disordered secondary neurulation will provoke further advancements in our management strategies as well as in the pathoembryogenetic understanding of anomalous lesions in this area.

• International Journal of Internet, Broadcasting and Communication
• /
• v.11 no.4
• /
• pp.18-25
• /
• 2019

The public data portal provides various public data created by the government in the form of files and open APIs. In order to increase the usability of public open data, a variety of information should be provided to users and should be convenient to use for users. This requires the structured data design plan of the public data. In this paper, we propose a data design method to improve the usability of the Seoul subway public data. For the study, we first identify some properties of the current subway public data and then classify the data based on these properties. The properties used as classification criteria are stored properties, derived properties, static properties, and dynamic properties. We also analyze the limitations of current data for each property. Based on this analysis, we classify currently used subway public data into code entities, base entities, and history entities and present the improved design of entities according to this classification. In addition, we propose data retrieval functions to increase the utilization of the data. If the data is designed according to the proposed design of this paper, it will be possible to solve the problem of duplication and inconsistency of the data currently used and to implement more structural data. As a result, it can provide more functions for users, which is the basis for increasing usability of subway public data.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.6 no.4
• /
• pp.67-73
• /
• 2010

A Wireless Sensor Network(WSN) is a promising infrastructure for the future U-healthcare system. In a WSN for the U-healthcare system, both biometric data and location data are transferred hierarchically from lots of mobile patients to the base station server and some countermeasures are made in real time if necessary. In this process, we encounter the load-balancing problem when many patients gather in a specific area. We also encounter the data duplication problem when each patient moves into an area monitored by several supervisors. The second problem is closely related to the first one. In this paper, we propose a mobile patient monitoring system with priority-based policy in load-balancing to solve the previous two problems and perform a DEVS Java-based system simulation to verify the system efficiency.