• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2004.11a
• /
• pp.265-271
• /
• 2004

The interaction network of protein -protein plays an important role to understand the various biological functions of cells. Currently, the high -throughput experimental techniques (two -dimensional gel electrophoresis, mass spectroscopy, yeast two -hybrid assay) provide us with the vast amount of data for protein-protein interaction at the proteome scale. In order to recognize the role of each protein in their network, the efficient bioinformatical and computational analysis methods are required. We propose a systematic and mathematical method which can analyze the protein -protein interaction network rigorously and enable us to capture the biological and physical essence of a topological character and stability of protein -protein network, and sensitivity of each protein along the biological pathway of their network. We set up a Laplacian matrix of spectral graph theory based on the protein-protein network of yeast proteome, and perform an eigenvalue analysis and apply a perturbation method on a Laplacian matrix, which result in recognizing the center of protein cluster, the identity of hub proteins around it and their relative sensitivities. Identifying the topology of protein -protein network via a Laplacian matrix, we can recognize the important relation between the biological pathway of yeast proteome and the formalism of master equation. The results of our systematic and mathematical analysis agree well with the experimental findings of yeast proteome. The biological function and meaning of each protein cluster can be explained easily. Our rigorous analysis method is robust for understanding various kinds of networks whether they are biological, social, economical...etc

• Journal for History of Mathematics
• /
• v.21 no.3
• /
• pp.127-142
• /
• 2008

In this paper, we introduce four different approaches of proving Cayley formula, which counts the number of trees(acyclic connected simple graphs). The first proof was done by Cayley using recursive formulas. On the other hands the core idea of the other three proofs is the bijective method-find an one to one correspondence between the set of trees and a suitable family of combinatorial objects. Each of the three bijection gives its own generalization of Cayley formula. In particular, the last proof, done by Seo and Shin, has an application to computer science(theoretical computation), which is a typical example that pure mathematics supply powerful tools to other research fields.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.5
• /
• pp.101-106
• /
• 2011

In this paper, our goal is to design the controller which operates a manufacturing system, discrete event system, guaranteeing user specification. In specially, based on supervisory control theory W. M. Wonham, our work consists in performing the controller using Petri nets possible parallelism. In addition, we consider the problem of allocation for resources sharing of the issues to consider when designing using Petri net. The controller can be generated by synthesis of user specification model and plant model after giving the management for the resource sharing. This created controller can control the deadlock and starvation which can occur in the case with resource sharing. Previous studies proposed the Constrained Synchronous Reachability graph to synthesis of the two Petri nets models. Therefore, we provide the controlled system which forbids a deadlock and starvation using the result of previous studies.

• The Korea Journal of Herbology
• /
• v.30 no.3
• /
• pp.63-68
• /
• 2015

Objectives : We applied the term weighting method used in the field of data search to quantify relevancy between symptoms and medicinal herbs, and, based on this, we aim to introduce a method of visualizing the characteristics of medicinal herbs. Methods ： We proposed HF-IFF, an adaptation of TF-IDF, which is a term weighting measurement method adapted in the field of data search. Using this method, we deduced relevancy between symptoms and medicinal herbs In Cheongkangeuigam that was published in 1984 by organizing the medical theory of Cheongkang, Kim Younghoon, and visualized this as a graph in order to compare the characteristics of medicinal herbs used for different symptoms. Results ： HF-IFF is the product of HF and IFF, where HF is the frequency of the relevant medicinal herb for a set of symptoms, and IFF is the inverse of the number of formulations (FF) containing that herb. A total of 251 types of medicinal herb are used in Cheongkangeuigam, and 1538 formulations are classified according to 67 types of symptom. The overall mean for HF-IFF was 0.491, with a maximum of 4.566 and a minimum of 0.013. Conclusions ： In spite of several limitations, we were able to use HF-IFF to measure relevancy between symptoms and medicinal herbs, with formulations as an intermediate. We were able to use the quantified results to visually express the characteristics of the herbs used for symptoms by bubble chart and word-cloud from HF-IFF.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.5
• /
• pp.335-343
• /
• 2009

The crossed cube has received great attention because it has equal or superior properties compared to the hypercube that is widely known as a versatile parallel processing system. It has been known that disjoint two copies of a mesh of size $4{\times}2^m$ or disjoint four copies of a mesh of size $8{\times}2^m$ can be embedded into a crossed cube with dilation 1 and expansion 1 [Dong, Yang, Zhao, and Tang, 2008]. However, it is not known that disjoint multiple copies of a mesh with more than eight rows and columns can be embedded into a crossed cube with dilation 1 and expansion 1. In this paper, we show that disjoint $2^{n-1}$ copies of a mesh of size $2^n{\times}2^m$ can be embedded into a crossed cube with dilation 1 and expansion 1 where $n{\geq}1$ and $m{\geq}3$. Our result is optimal in terms of dilation and expansion that are important measures of graph embedding. In addition, our result is practically usable in allocating multiple jobs of mesh structure on a parallel computer of crossed cube structure.

• Journal of Digital Convergence
• /
• v.15 no.5
• /
• pp.325-331
• /
• 2017

The purpose of this study is optional cinemagraph ads based on the case through the psychological theory of visual multimedia story qualitative analysis, quantitative analysis. Cinemagraph analysis would like to present the model. The analysis popular advertising model who starred with the higher profile in 2016 Gmaket of cinemagraph series of ads research, literature research, and Internet media. Analysis, case studies, etc. The analysis appeared around 10 percent was the most effective in the form of moving the form of copper wire. Part of the video cinema than the overall movement of the graph bigger visual flow effects is a dynamic. Moving the direction of the model used copper wires and broadly consistent with the product. Subject & Surrounding and margins are being used within one point or two points. The story of probability model in the short and expressing simple action of the product. Direction of the action, the proportion of multimedia for quantitative analysis of space story for the qualitative analysis of the periphery and jujebu, stories, such as the probability of four.For consideration the terms.

• Journal for History of Mathematics
• /
• v.19 no.4
• /
• pp.63-80
• /
• 2006

Along with natural and algebraic languages, schema is a fundamental component of mathematical language. The principal purpose of this present study is to focus on this point in detail. Schema was already in use during Pythagoras' lifetime for making geometrical inferences. It was no different in the case of Oriental mathematics, where traces have been found from time to time in ancient Chinese documents. In schma an idea is transformed into something conceptual through the use of perceptive images. It's heuristic value lies in that it facilitates problem solution by appealing directly to intuition. Furthermore, introducing schema is very effective from an educational point of view. However we should keep in mind that proof is not replaceable by it. In this study, various schemata will be presented from a diachronic point of view, We will show with emaples from the theory of categories, Feynman's diagram, and argand's plane, that schema is an indispensable tool for constructing new knowledge.

• The Journal of the Korea Contents Association
• /
• v.13 no.4
• /
• pp.427-439
• /
• 2013

With the fast development of complex science, lots of social networks are studied. We know that the social network is widely applied in analyzing issues in human culture, economics and web sciences. Recently we witness that some researchers began to compare the social network constructed from fiction literatures(literature social network) and the real social network obtained from practice. But we point that previous approaches for literature social network have some drawbacks since they completely depend on the biographical dictionary constructed for a designated literature. So since the previous approach focus on the few important characters and peoples around them, we can not understand the global structure of all characters appeared in the literature at least once. We propose one method to extract all characters appeared in the literature and how to make the social network from that information. Also we newly propose K-critical network by applying frequency of the named characters and the strength of relationship among all textual characters. Our experiment shows that the K-critical measure could be one crucial quantitative measure to compute the relationship strength among characters appeared in the object literature.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.6
• /
• pp.643-648
• /
• 2003

In order to provide efficient retrieving results for user query on the web environment, the various searching algorithms have developed and considered user's preference and convenience. However, the searching algorithms are developed on the horizontal and non hierarchical web environment in general and could not apply to the complex hierarchical and functional web environments such like the enterprise network. In this paper, we purpose the multi-agent based web mining system which can provide the efficient mining results to the user on the special web environment. For doing this, we suggest the network model with the hierarchical web environment and model the multi agent based web mining system which has four corporation agents and fourteen process modules. Then, we explain the detailed functions of each agent considered the hierarchical environment according to the module. Especially, we purpose the new merging agent and improved ranking algorithm by using the graph theory.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2018.10a
• /
• pp.152-155
• /
• 2018

Over the past years, Link Flooding Attacks (LFAs) have been introduced as new network threats. LFAs are indirect DDoS attacks that selectively flood intermediate core links, while legacy DDoS attacks directly targets end points. Flooding bandwidth in the core links results in that a wide target area is affected by the attack. In the traditional network, mitigating LFAs is a challenge since an attacker can easily construct a link map that contains entire network topology via traceroute. Security researchers have proposed many solutions, however, they focused on reactive countermeasures that respond to LFAs when attacks occurred. We argue that this reactive approach is limited in that core links are already exposed to an attacker. In this paper, we present SDHoneyNet that prelocates vulnerable links by computing static and dynamic property on Software-defined Networks (SDN). SDHoneyNet deploys Honey Topology, which is obfuscated topology, on the nearby links. Using this approach, core links can be hidden from attacker's sight, which leads to effectively building proactive method for mitigating LFAs.