• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2003.10a
• /
• pp.26-51
• /
• 2003

Large scale protein interaction maps provide a new, global perspective with which to analyse protein function. PSIMAP, the Protein Structural Interactome Map, is a database of all the structurally observed interactions between superfamilies of protein domains with known three-dimensional structure in thePDB. PSIMAP incorporates both functional and evolutionary information into a single network. It makes it possible to age protein domains in terms of taxonomic diversity, interaction and function. One consequence of it is to predict the most important protein domain structure in evolution. We present a global analysis of PSIMAP using several distinct network measures relating to centrality, interactivity, fault-tolerance, and taxonomic diversity. We found the following results: ${\bullet}$ Centrality: we show that the center and barycenter of PSIMAP do not coincide, and that the superfamilies forming the barycenter relate to very general functions, while those constituting the center relate to enzymatic activity. ${\bullet}$ Interactivity: we identify the P-loop and immunoglobulin superfamilies as the most highly interactive. We successfully use connectivity and cluster index, which characterise the connectivity of a superfamily's neighbourhood, to discover superfamilies of complex I and II. This is particularly significant as the structure of complex I is not yet solved. ${\bullet}$ Taxonomic diversity: we found that highly interactive superfamilies are in general taxonomically very diverse and are thus amongst the oldest. This led to the prediction of the oldest and most important protein domain in evolution of lift. ${\bullet}$ Fault-tolerance: we found that the network is very robust as for the majority of superfamilies removal from the network will not break up the network. Overall, we can single out the P-loop containing nucleotide triphosphate hydrolases superfamily as it is the most highly connected and has the highest taxonomic diversity. In addition, this superfamily has the highest interaction rank, is the barycenter of the network (it has the shortest average path to every other superfamily in the network), and is an articulation vertex, whose removal will disconnect the network. More generally, we conclude that the graph-theoretic and taxonomic analysis of PSIMAP is an important step towards the understanding of protein function and could be an important tool for tracing the evolution of life at the molecular level.

• Journal of Korean Society of Transportation
• /
• v.23 no.7 s.85
• /
• pp.99-110
• /
• 2005

Total travel cost of route which connects origin with destination (O-D) is consist of the total sum of link travel cost and route perception cost. If the link perception cost is different according to the origin and destination, optimal route search has limitation to reflect the actual condition by route enumeration problem. The purpose of this study is to propose optimal route searching formulation and algorithm which is enable to reflect different link perception cost by each route, not only avoid the enumeration problem between origin and destination. This method defines minimum unit of route as a link and finally compares routes using link unit costs. The proposed method considers the perception travel cost at both origin and destination in optimal route searching process, while conventional models refect the perception cost only at origin. However this two-way searching algorithm is still not able to guarantee optimum solution. To overcome this problem, this study proposed an orign based optimal route searching method which was developed based on destination based optimal perception route tree. This study investigates whether proposed numerical formulas and algorithms are able to reflect route perception behavior reflected the feature of origin and destination in a real traffic network by the example research including the diversity of route information for the surrounding area and the perception cost for the road hierarchy.

• The Journal of the Korea Contents Association
• /
• v.17 no.4
• /
• pp.179-199
• /
• 2017

This research was conducted in a phenomenological method to explore what the meaning for marriage migrant women to have college experience is. In other words, It is to find out what the motivation for them to enroll the college is and what the experience of studying in college implies. Also, figuring out how the expectation for life after the college experience is built up structurally is the purpose of the research. To ensure the qualitative warranty of the research, the participants are selected by "Sampling and Data Collection Strategy" suggested by Miles & Huberman (1994); and those selected participants are six marriage migrant women in urban-rural area with 10~18 years of residence period. The information for this research had been collected by in-depth and additional interviews along with observation towards these six participants. The result is the following. First, the motivation for them to enroll the college is; to realize of one's dream, to have confident parental model, to pursuit stabilized domestic economy, to have a professional occupation, and to make it as a mean of searching one's career path. Second, the experience of studying in college implies; enhancing communication ability, establishing self-image in the family and its relationship, having confident in raising children, enhancing healthy living of family, enhancing human relations, and lifelong learning person through set of learning. Third, the structure of how it build the future life is; having independent life pursuing stable living economically, living as a confident Korean by pursuing the value of learning and having a life of human being.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.40 no.1
• /
• pp.23-34
• /
• 2012

Space launch vehicles are designed to fly according to the elaborate pre-determined path. However, if a vehicle went out of the planned trajectory or its thrust terminated abnormally, or if a free-fall atmospheric reentry vehicle tracked by a tracking sensor became impossible to be measured, it is required to attempt to track by a another track equipment or estimate its impact point rapidly. In this paper a new algorithm is proposed, named the ITS-EKF combined with the Integrated Track Splitting (ITS) algorithm and the Extended Kalman Filter (EKF) to obtain the location information of a ballistic projectile without thrust, create its track and maintain it in an environment with clutter. For the reentry vehicle, the track performance is to be verified and the impact point is estimated by applying the simulation through ITS-EKF algorithm. To ensure the proposed algorithm's adequacy, by comparing the track performance and impact point distribution by the ITS-EKF with those of ITS-PF combined with ITS and Particle Filter (PF), it is confirmed that the ITS-EKF algorithm can be used an effective real-time On-line impact point prediction.

• Journal of Satellite, Information and Communications
• /
• v.9 no.1
• /
• pp.51-56
• /
• 2014

High-availability seamless redundancy (HSR) is a protocol for fault-tolerant Ethernet (FTE) networks. It provides two frame copies and each copy is forwarded on a separate physical path, which provides zero fail-over time. Therefore, the HSR is becoming a potential candidate for various real-time FTE applications. However, the generation and circulation of unnecessary frames due to the duplication of every sending frame is inherent drawback of HSR. Such drawback degrades the performance of the network and may deplete its resources. In this paper, we present a new algorithm called port locking (PL) based on the media access control (MAC) address to solve the abovementioned problem in popular connected-rings network. Our approach makes the network gradually learn the locations of the source and the destination nodes without relying on network control frames. It then prunes all the rings that do not contain the destination node by locking corresponding rings' entrance ports. With the PL algorithm, the traffic can be significantly reduced and therefore the network performance will be greatly enhanced specially in a large scale connected-rings network. Analytical results are provided to validate the PL algorithm.

• Journal of KIISE:Databases
• /
• v.27 no.2
• /
• pp.151-164
• /
• 2000

The Visual Object Query Language (VOQL) recently proposed for object databases has been successful in visualizing path expressions and set-related conditions, and providing formal semantics. However, VOQL has several problems. Due to unrealistic assumptions, only set-related conditions can be represented in VOQL. Due to the lack of explicit language construct for the notion of variables, queries are often awkard and less intuitive. In this paper, we propose VOQL*, which extends VOQL to remove these drawbacks. We introduce the notion of visual variables and refine the syntax and semantics of VOQL based on visual variables. We carefully design the language constructs of VOQL* to reflect the syntax of OOPC, so that the constructs such as visual variables, visual elements, VOQL* simple terms, VOQL* structured terms, VOQL* basic formulas, VOQL* formulas, and VOQL* query expressions are hierarchically and inductively constructed as those of OOPC. Most important, we formally define the semantics of each language construct of VOQL* by induction using OOPC. Because of the well-defined syntax and semantics, queries in VOQL* are clear, concise, and intuitive. We also provide an effective procedure to translate queries in VOQL* into those in OOPC. We believe that VOQL* is the first visual query language with the well-defined syntax reflecting the syntactic structure of logic and semantics formally defined by induction.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.39 no.4
• /
• pp.85-95
• /
• 2014

In the e-commerce, the conversion into the multi-media is the important issue. According to the research by Nielsen Korea, the 83% of customers who purchase the products in the e-commerce utilize multi-channel to buy the products such as mobile and online [3]. Thus, to effectively implement online advertising, marketers should understand the customers' path [15] in the multi-channel. The study of the multi-site activities plays an important role to predict customers' purchase [28]. To explain the e-commerce site visit activities of customers, we have developed research model in terms of the online advertising. This research model is based on the study of Moe and Fader [23]. There are two types of composition in the research model. First, general site visit as an exploratory search have net effect on the shopping site visit because customers could acquire or develop information on the e-commerce site via online advertising. Secondly, the e-commerce site visit as a goal-directed search cause threshold of the e-commerce site visit because customers could achieve their goal. When the threshold is increased, the probability of a shopping site visit is decreased and vice versa. Thus, we have investigated the impact of customers' previous visit activities (general site visit and shopping site visit) on the next e-commerce site visit in terms of dynamic view. Research data was provided by Cheil World Wide. This panel data include mobile and online log data of panelists from Jan. 2013 to March 2013. As the results, the customers' e-commerce site visit on the online media would decrease the probability of e-commerce site visit because these visit activities increase the threshold of e-commerce site visit. This result is similar with the previous study [23]. Otherwise, since e-commerce site visit on the mobile media decrease the threshold, the customers' probability of e-commerce site visit would increase In summary, the site visit activities on the mobile could improve the probability of e-commerce site visits.

• The KIPS Transactions:PartC
• /
• v.13C no.2 s.105
• /
• pp.219-226
• /
• 2006

The shortest path is only maintained during short time because network topology changes very frequently and each mobile nodes communicate each other by depending on battery in MANET(Mobile Ad-hoc Network). So many researches that are to overcome a limitation or consider a power have executed actively by many researcher. But these protocols are considered only one side of link stability or power consumption so we can make high of stability but power consumption isn't efficient. And also we can reduce power consumption of network but the protocol can't make power consumption of balancing. For that reason we suggest RBSSPR(Residual Battery Capacity and Signal Strength Based Power-aware Routing Protocol in MANET). The RBSSPR considers residual capacity of battery and signal strength so it keeps not only a load balancing but also minimizing of power consumption. The RBSSPR is based on AODV(Ad-hoc On-demand Distance Vector Routing). We use ns-2 for simulation. This simulation result shows that RBSSPR can extense lifetime of network through distribution of traffic that is centralized into special node and reducing of power consumption.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.4
• /
• pp.421-426
• /
• 2010

Due to the ease of deployment and the extended coverage, wireless mesh networks (WMNs) are gaining popularity and research focus. For example, the routing protocols that enhance the throughput on the WMNs and the link quality measurement schemes are among the popular research topics. However, most of these works assume that the locations of the mesh routers are predetermined. Since the operators in an Indoor mesh network can determine the locations of the mesh routers by themselves, it is essential to the WMN performance for the mesh routers to be initially placed by considering the performance issues. In this paper, we propose a mesh router placement scheme based on genetic algorithms by considering the characteristics of WMNs such as interference and topology. There have been many related works that solve similar problems such as base station placement in cellular networks and gateway node selection in WMNs. However, none of them actually considers the interference to the mesh clients from non-associated mesh routers in determining the locations of the mesh routers. By simulations, we show that the proposed scheme improves the performance by 30-40% compared to the random selection scheme.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.12
• /
• pp.653-662
• /
• 2016

This paper describes a test case generation algorithm for Simulink/Stateflow models based on the Rapidly exploring Random Tree (RRT) algorithm that has been successfully applied to path finding. An important factor influencing the performance of the RRT algorithm is the metric used for calculating the distance between the nodes in the RRT space. Since a test case for a Simulink/Stateflow (SL/SF) model is an input sequence to check a specific condition (called a test target in this paper) at a specific status of the model, it is necessary to drive the model to the status before checking the condition. A status maps to a node of the RRT. It is usually necessary to check various conditions at a specific status. For example, when the specific status represents an SL/SF model state from which multiple transitions are made, we must check multiple conditions to measure the transition coverage. We propose a unique distance calculation metric, based on the observation that the test targets are gathered around some specific status such as an SL/SF state, named key nodes in this paper. The proposed metric increases the probability that an RRT is extended from key nodes by imposing penalties to non-key nodes. A test case generation algorithm utilizing the proposed metric is proposed. Three models of Electrical Control Units (ECUs) embedded in a commercial vehicle are used for the performance evaluation. The performances are evaluated in terms of penalties and compared with those of the algorithm using a typical RRT algorithm.