• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.1033-1042
• /
• 2004

According to the arbitration mechanism among the peers in the network, the P2P networking environments can be classified into hybrid P2P networking environments and pure P2P networking environments. In hybrid P2P networking environments, each peer gets continual services from the servers that arc operational most of the time, and so, network isolation does not occur because every peer can always keep connection to the server. In pure P2P networking environments, however, every peer directly connects to another peer without server intervention, and so, network isolation can occur when the per mediating the connection is terminated. In this paper, we propose a scheme for each peer to keep connection information of other peers by maintaining IDs of its neighbor peers, to reconnect to another peers when the mediating peer fails to work. and, for efficiency. to balance the number of connections that should be maintained by each peer. With our mechanism, each pier in the network can continuously maintain connection to the network and get seamless services from other peers. Through the simulation, we ascer-tained that network isolation does not occur in the pure P2P network adopting our mechanism and that our mechanism distributes and balances the connections that are maintained by each peer. We also analyzed the total network traffic and the mean number of hops for the connections made by each peer according to the recommended number of connections that is established at system setup time.

• Journal of KIISE:Databases
• /
• v.32 no.3
• /
• pp.263-275
• /
• 2005

In a large DNA database, indexing techniques are widely used for rapid approximate sequence searching. However, most indexing techniques require a space larger than original databases, and also suffer from difficulties in seamless integration with DBMS. In this paper, we suggest a space-efficient and disk-based indexing and query processing algorithm for approximate DNA sequence searching, specially exact match queries, wildcard match queries, and k-mismatch queries. Our indexing method places a sliding window at every possible location of a DNA sequence and extracts its signature by considering the occurrence frequency of each nucleotide. It then stores a set of signatures using a multi-dimensional index, such as R*-tree. Especially, by assigning a weight to each position of a window, it prevents signatures from being concentrated around a few spots in index space. Our query processing algorithm converts a query sequence into a multi-dimensional rectangle and searches the index for the signatures overlapped with the rectangle. The experiments with real biological data sets revealed that the proposed method is at least three times, twice, and several orders of magnitude faster than the suffix-tree-based method in exact match, wildcard match, and k- mismatch, respectively.

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

Although there exist many middlewares such as Havi, Jini, LonWorks, UPnP, and SLP, new middlewares specialized for diverse information appliances are expected to appear continuously as home networks evolve. In this paper, we examine an integrated architecture for supporting interoperability among heterogeneous middlewares under home network, we also propose and implement a scenario-based user-oriented integrated architecture for efficient home automation which is different from existing methods. HOMI(Homenetwork Middleware for Interoperability) architecture proposed in this paper provides interfaces that assist users with designing and modifying desirable scenarios using a script interpreter language HOMIL(HOMI Language). Different from an existing integrated middleware architecture, HOMI improves efficiency and convenience of interoperation between heterogeneous appliances for home automation allowing users to design and organize scenarios through these interfaces. HOMI classifies interoperation services into time contort, synchronization context, and asynchronization context and helps to execute next services considering contexts when a specific event occurs. Applying modified scenarios immediately to home network environment, HOMI provides users with seamless services without installing new applications, updating the server, or rebooting in order to adopt new scenarios. Lastly, distribution agents into several devices, we solved the overhead problem occurred in a centralized architecture for integrated middleware.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4B
• /
• pp.677-686
• /
• 2010

In this paper, we propose the virtual interface management scheme on the multi-mode mobile node for supporting multiple connections to various access networks in fixed mobile convergence (FMC) networks. The proposed scheme supports the virtualization of multiple physical network interfaces by presenting only the virtual interface to beyond IP layers and hiding physical network interfaces from them. In the proposed scheme, only one IP address is allocated to virtual interface without any IP allocations to physical network interfaces. Therefore, the proposed scheme does not change its IP address and keep it during the vertical handover, so that it can support the seamless handover of real-time multimedia services among heterogeneous access networks. The proposed scheme is implemented on the multi-mode mobile node with multiple network interfaces by using NDIS (Network Driver Interface Specifications) libraries. Through the mobility test-bed and the test application of virtual interface, we evaluate and analyze the performance of the proposed scheme.

• Journal of Korea Technology Innovation Society
• /
• v.19 no.2
• /
• pp.254-279
• /
• 2016

Recently, with the conversion towards knowledge-based economy era, the importance of the evaluation for patent valuation has been growing rapidly because technology transactions are increasing with the purpose of practically utilizing R&D outcomes such as technology commercialization and technology transfer. Nevertheless, there is a lack of research on determinants of patent valuation by analyzing technology transactions due to the difficulty of collecting data in practice. Hence, to suggest quantitative determinants for the patent valuation which could be applied to scoring methods, 15 patent valuation models domestically and overseas are analysed in order to assure the objectiveness for subjective results from qualitative methods such as expert surveys, comparison assessment, etc. Through this analysis, the important 6 common determinants are drawn and patent information is matched which can be used as proxy variables of individual determinant factors by advanced researches. In addition, to validate whether the model proposed has a statistically meaningful effect, total 517 technology transactions are collected from both public and private technology transaction offices and analysed by multiple regression analysis, which led to significant patent determinant factors in deciding its value. As a result, it is herein presented that patent connectivity(number of literature cited) and commercialization stage in market influence significantly on patent valuation. The meaning of this study is in that it suggests the significant quantitative determinants of patent valuation based on the technology transactions data in practice, and if research results by industry are systematically verified through seamless collection of transaction data and their monitoring, we would propose the customized patent valuation model by industry which is applicable for both strategic planning of patent registration and achievement assessment of research projects (with representative patents).

• Journal of Korea Spatial Information System Society
• /
• v.2 no.2 s.4
• /
• pp.25-37
• /
• 2000

As computer systems of high capacity and high performance recently emerged, various researches about GISs(Geographic Information Systems) have been in progress and many GIS applications have also been developed. From the domestic situation where many people are using mobile devices, because of the recent advances in the mobile technology, we can infer that the time will come when every individual will carry a mobile device with a GPS(Global Positioning System) module resulting from the development of a miniature GPS Module. Therefore, a mobile GIS that can allows users to deal with dynamic GIS data management and perform their tasks while moving will be required. This paper discusses the design and implementation of a mobile GIS using the shareware DBMS, called postgresSQL. The Mobile GIS in which a mobile concept is utilized at the GIS data server makes it possible to insert, delete, update GIS data, to zoom in and zoom out displayed maps, and to locate the user's position on the client device. Therefore, It is possible to manage dynamic GIS data in order to deal with GIS data on the maps while moving, connect various GIS data servers through the middleware, and connected with ITS (Intelligent Transport System) which is one of applications of the Mobile GIS developed in this paper.

• Journal of Internet Computing and Services
• /
• v.2 no.2
• /
• pp.71-93
• /
• 2001

Commonly to design a database system. a conceptual database has to be designed and then it is transformed into a logical database schema prior to building a target database system. This paper proposes a method which transforms a Temporal Entity-Relationship Model(TERM) into a Temporal Object-Oriented Model(TOOM) to build an efficient database schema. I formalize the time concept in view of object versioning and specify the constraints required during transformation procedure. The proposed transformation method contributes to getting the logical temporal data from the conceptual temporal events Without any loss of semantics, Compared to other approaches of supporting various properties, this approach is more general and efficient because it is the semantically seamless transformation method by using the orthogonality of types of objects, semantics of relationships and constraints over roles.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.6
• /
• pp.549-558
• /
• 2001

It is important to reuse existing motion capture data for reduction of the animation producing cost as well as efficiency of producing process. Because its motion curve has no control point, however, it is difficult to modify the captured data interactively. The motion transition is a useful method to reuse the existing motion data. It generates a seamless intermediate motion with two short motion sequences. In this paper, Uniform Posture Map (UPM) algorithm is proposed to perform the motion transition. Since the UPM is organized through quantization of various postures with an unsupervised learning algorithm, it places the output neurons with similar posture in adjacent position. Using this property, an intermediate posture of two active postures is generated; the generating posture is used as a key-frame to make an interpolating motion. The UPM algorithm needs much less computational cost, in comparison with other motion transition algorithms. It provides a control parameter; an animator could control the motion simply by adjusting the parameter. These merits of the UPM make an animator to produce the animation interactively. The UPM algorithm prevents from generating an unreal posture in learning phase. It not only makes more realistic motion curves, but also contributes to making more natural motions. The motion transition algorithm proposed in this paper could be applied to the various fields such as real time 3D games, virtual reality applications, web 3D applications, and etc.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.21 no.6
• /
• pp.535-541
• /
• 2008

As the concurrent engineering concept has emerged along with the support of optimization techniques, lots of endeavors have been made to apply optimization techniques to actual design problems for a holistic decision. Even if the range of design problems which the optimization is applicable to has been extended, most of ship designs still remain in an iterative approach due to the difficulties of seamless integration of all related design activities. In this approach, an entire design problem is divided into many sub-problems and carried out by many different disciplines through complicated internal interactions. This paper focuses on preliminary ship design process. This paper proposes a process centric integrated framework as the first step to establish a workflow based design process management system. The framework consists of two parts; a schedule management part to support a manager to monitor current progress status and adjust current schedule, and a process management part to assist a design to effectively perform a series of design activities by following a predefined procedure. Overall system are decomposed into modules according to the target to be managed in each module. Appropriate interactions between the decomposed modules are designed to achieve a consistency of the entire system. Design process model is also designed on a thorough analysis of actual ship design practice. The proposed framework will be embodied using a commercial workflow package.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.7 no.2
• /
• pp.16-28
• /
• 2004

A seam-line determination algorithm is proposed to determine image border-line in mosaicing using the transformation of gray value differences and dynamic programming. Since visually good border-line is the one along which pixel differences are as small as possible, it can be determined in association with an optimal path finding algorithm. A well-known effective optimal path finding algorithm is the Dynamic Programming (DP). Direct application of the dynamic programming to the seam-line determination causes the distance effect, in which seam-line is affected by its length as well as the gray value difference. In this paper, an adaptive cost transform algorithm with which the distance effect is suppressed is proposed in order to utilize the dynamic programming on the transformed pixel difference space. Also, a figure of merit which is the summation of fixed number of the biggest pixel difference on the seam-line (SFBPD) is suggested as an evaluation measure of seamlines. The performance of the proposed algorithm has been tested in both quantitively and visually on various kinds of images.