• 한국생물정보학회:학술대회논문집
• /
• 한국생물정보시스템생물학회 2000년도 International Symposium on Bioinformatics
• /
• pp.56-58
• /
• 2000

Post-genomics may be defined in different ways depending on how one views the challenges after the genome. A popular view is to follow the concept of the central dogma in molecular biology, namely from genome to transcriptome to proteome. Projects are going on to analyze gene expression profiles both at the mRNA and protein levels and to catalog protein 3D structure families, which will no doubt help the understanding of information in the genome. However complete, such catalogs of genes, RNAs, and proteins only tell us about the building blocks of life. They do not tell us much about the wiring (interaction) of building blocks, which is essential for uncovering systemic functional behaviors of the cell or the organism. Thus, an alternative view of post-genomics is to go up from the molecular level to the cellular level, and to understand, what I call, the "interactome"or a complete picture of molecular interactions in the cell. KEGG (http://www.genome.ad.jp/kegg/) is our attempt to computerize current knowledge on various cellular processes as a collection of "generalized"protein-protein interaction networks, to develop new graph-based algorithms for predicting such networks from the genome information, and to actually reconstruct the interactomes for all the completely sequenced genomes and some partial genomes. During the reconstruction process, it becomes readily apparent that certain pathways and molecular complexes are present or absent in each organism, indicating modular structures of the interactome. In addition, the reconstruction uncovers missing components in an otherwise complete pathway or complex, which may result from misannotation of the genome or misrepresentation of the KEGG pathway. When combined with additional experimental data on protein-protein interactions, such as by yeast two-hybrid systems, the reconstruction possibly uncovers unknown partners for a particular pathway or complex. Thus, the reconstruction is tightly coupled with the annotation of individual genes, which is maintained in the GENES database in KEGG. We are also trying to expand our literature surrey to include in the GENES database most up-to-date information about gene functions.

• Korean Journal of Mathematics
• /
• 제27권4호
• /
• pp.831-841
• /
• 2019

A Radiocoloring (RC) of a graph G is a function f from the vertex set V (G) to the set of all non-negative integers (labels) such that |f(u) - f(v)| ≥ 2 if d(u, v) = 1 and |f(u) - f(v)| ≥ 1 if d(u, v) = 2. The number of discrete labels and the range of labels used are called order and span, respectively. In this paper, we concentrate on the minimum order span Radiocoloring Problem (RCP) of trees. The optimization version of the minimum order span RCP that tries to find, from all minimum order assignments, one that uses the minimum span. We provide attainable lower and upper bounds for trees. Moreover, a complete characterization of caterpillars (as a subclass of trees) with the minimum order span is given.

• 한국음향학회:학술대회논문집
• /
• 한국음향학회 1992년도 학술논문발표회 논문집 제11권 1호
• /
• pp.29-32
• /
• 1992

In this paper, a systolic array structure is derived from the realization of 2-D IIR digital filters directed from the SFG(signal flow graph). After realized the 1-D formed partial systolic array, we implemented the complete systolic array to be cascaded 1-D form. The cascading of partial systolic arrays reduce the storage element which sued to delay input signal. 1-D systolic array is derived from that DG is designed through local communication approach and then it mapping to SFG. The derived structure is very simple and has high throughput because during new imput sample is supplied, new output is obtained every sampling period. And broadcast input signal is eliminated. Since the systolic array has property of regularity, modularity, local interconnection and highly synchronized multiprocessing, thus is very suitable for VLSI implementation.

• 한국경영과학회지
• /
• 제21권3호
• /
• pp.63-74
• /
• 1996

Ordering plays an important role in solving an LP problem with sparse matrix by the interior point method. Since ordering is NP-complete, we try to find an efficient method. The objective of this paper is to present an efficient heuristic ordering method for implementation of the minimum deficiency method. Both the ordering method and the data structure play important roles in implementation. First we define a new heuristic pseudo-deficiency ordering method and a data structure for the method-quotient graph and cliqued storage. Next we show an experimental result in terms of time and nonzero numbers by NETLIB problems.

• 한국컴퓨터정보학회논문지
• /
• 제21권10호
• /
• pp.1-10
• /
• 2016

In this paper, we propose an approach to generate machine readable context annotations for SPARQL Results. According to W3C Recommendations, the retrieved data from RDF or OWL data sources are represented in tabular form, in which each cell's data is described by only type and value. The simple query result form is generally useful, but it is not sufficient to explain the semantics of the data in query results. To explain the meaning of the data, appropriate annotations must be added to the query results. In this paper, we generate the annotations from the basic graph patterns in user's queries. We could also manipulate the original queries to complete the annotations. The generated annotations are represented using the RDFa syntax in our study. The RDFa expressions in HTML are machine-understandable. We believe that our work will improve the trustworthiness of query results and contribute to distribute the data to meet the vision of the Semantic Web.

• 전기전자학회논문지
• /
• 제12권1호
• /
• pp.51-58
• /
• 2008

This paper presents a new method for building detection and reconstruction from aerial images. In our approach, we extract the useful building location information from the generated disparity map to obtain the segmentation of interested objects and thus reduce significantly unnecessary line segment extracted in low level feature extraction step. Hypothesis selection is carried out by using undirected graph in which close cycles represent complete rooftops hypotheses, and hypothesis are finally tested to contruct building model. We test the proposed method with synthetic images generated from Avenches dataset of Ascona aerial images. The experiment result shows that the extracted 3D line segments of the buildings can be efficiently used for the task of building detection and reconstruction from aerial images.

• Asia pacific journal of information systems
• /
• 제12권2호
• /
• pp.99-118
• /
• 2002

In this paper, we propose a visual relational database query language, VRQL, by modifying and extending the recently proposed $VOQL^*$. Like $VOQL^*$, VRQL, based on ven Diagram and graph, naturally reflects the structure of schemas in queries and has recursive formal semantics. However, VRQL has relationally complete expressiveness, while $VOQL^*$ is only a conjunctive query language. In the logical definition part of VRQL, which is the relational version of $VOQL^*$, most features of $VOQL^*$ are retained, and the semantics of queries are based on the tuple relational calculus. In the procedural definition part of VRQL, by introducing the concept of VRQL view and set operations, the expressiveness of VRQL is increased to the level equivalent to that of the relational algebra. Due to the introduction of VRQL views, existing queries or temporary queries used in the process of creating queries can be represented with views, so that complex queries may be represented more conveniently. Set operations, used with VRQL views, enable us to represent various queries, beyond the expressiveness of conjunctive query languages.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1987년도 한국자동제어학술회의논문집; 한국과학기술대학, 충남; 16-17 Oct. 1987
• /
• pp.670-673
• /
• 1987

The structure of chemical process has become increasingly complex, due to better management of energy and raw materials. As a consequence, the design of control systems for complete plants now constitutes the focal point of engineering interest, rather than controller designs for single processing units. Instead of traditional methods based on complex mathematical model, chemical processes are represented by structural array and cause-and-effect graph to apply non-numerical problem-solving techniques. A systematic logical procedure to synthesize alternatives of control system structure and some heuristic rules to select a feasible solution from the vast number of alternatives that are possible are considered in this study.

• Journal of applied mathematics & informatics
• /
• 제27권3_4호
• /
• pp.865-873
• /
• 2009

Goodman([3]) presented the question of finding a best possible upper bound of the form $t(G)\;+\;t(G^c)$, where t(G) denote the number of triangles in given graph G. In this, the form of squares of degrees is appeared and many researches have been pursued as an application related to this. Here, we would like to deal with corollary related to the results of Nikiforov([6]).

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 ITC-CSCC -1
• /
• pp.11-14
• /
• 2000

In this paper, we propose a fast and practical head pose estimation scheme fur eye-head controlled human computer interface with non-constrained background. The method we propose uses complete graph matching from thresholded images and the two blocks showing the greatest similarity are selected as eyes, we also locate mouth and nostrils in turn using the eye location information and size information. The average computing time of the image(360*240) is within 0.2(sec) and we employ template matching method using angles between facial features for head pose estimation. It has been tested on several sequential facial images with different illuminating conditions and varied head poses, It returned quite a satisfactory performance in both speed and accuracy.