• Title/Summary/Keyword: graph structure

Search Result 506, Processing Time 0.027 seconds

Development of deep learning structure for complex microbial incubator applying deep learning prediction result information (딥러닝 예측 결과 정보를 적용하는 복합 미생물 배양기를 위한 딥러닝 구조 개발)

  • Hong-Jik Kim;Won-Bog Lee;Seung-Ho Lee
    • Journal of IKEEE
    • /
    • v.27 no.1
    • /
    • pp.116-121
    • /
    • 2023
  • In this paper, we develop a deep learning structure for a complex microbial incubator that applies deep learning prediction result information. The proposed complex microbial incubator consists of pre-processing of complex microbial data, conversion of complex microbial data structure, design of deep learning network, learning of the designed deep learning network, and GUI development applied to the prototype. In the complex microbial data preprocessing, one-hot encoding is performed on the amount of molasses, nutrients, plant extract, salt, etc. required for microbial culture, and the maximum-minimum normalization method for the pH concentration measured as a result of the culture and the number of microbial cells to preprocess the data. In the complex microbial data structure conversion, the preprocessed data is converted into a graph structure by connecting the water temperature and the number of microbial cells, and then expressed as an adjacency matrix and attribute information to be used as input data for a deep learning network. In deep learning network design, complex microbial data is learned by designing a graph convolutional network specialized for graph structures. The designed deep learning network uses a cosine loss function to proceed with learning in the direction of minimizing the error that occurs during learning. GUI development applied to the prototype shows the target pH concentration (3.8 or less) and the number of cells (108 or more) of complex microorganisms in an order suitable for culturing according to the water temperature selected by the user. In order to evaluate the performance of the proposed microbial incubator, the results of experiments conducted by authorized testing institutes showed that the average pH was 3.7 and the number of cells of complex microorganisms was 1.7 × 108. Therefore, the effectiveness of the deep learning structure for the complex microbial incubator applying the deep learning prediction result information proposed in this paper was proven.

Protein Structure Alignment Based on Maximum of Residue Pair Distance and Similarity Graph (정렬된 잔기 사이의 최대거리와 유사도 그래프에 기반한 단백질 구조 정렬)

  • Kim, Woo-Cheol;Park, Sang-Hyun;Won, Jung-Im
    • Journal of KIISE:Databases
    • /
    • v.34 no.5
    • /
    • pp.396-408
    • /
    • 2007
  • After the Human Genome Project finished the sequencing of a human DNA sequence, the concerns on protein functions are increasing. Since the structures of proteins are conserved in divergent evolution, their functions are determined by their structures rather than by their amino acid sequences. Therefore, if similarities between two protein structures are observed, we could expect them to have common biological functions. So far, a lot of researches on protein structure alignment have been performed. However, most of them use RMSD(Root Mean Square Deviation) as a similarity measure with which it is hard to judge the similarity level of two protein structures intuitively. In addition, they retrieve only one result having the highest alignment score with which it is hard to satisfy various users of different purpose. To overcome these limitations, we propose a novel protein structure alignment algorithm based on MRPD(Maximum of Residue Pair Distance) and SG (Similarity Graph). MRPD is more intuitive similarity measure by which fast tittering of unpromising pairs of protein pairs is possible, and SG is a compact representation method for multiple alignment results with which users can choose the most plausible one among various users' needs by providing multiple alignment results without compromising the time to align protein structures.

A Study on the relationship in spatial structure of senior Center in Seoul (서울시 노인종합복지관의 공간 구조적 연결 관계에 관한 연구)

  • Kim, Jin-A;Byun, Dae-Joong
    • Korean Institute of Interior Design Journal
    • /
    • v.21 no.3
    • /
    • pp.182-193
    • /
    • 2012
  • The percentage of senior citizens is increasing in Korea and it is expected to become an "aging society". Problems with the elderly are becoming a big concern, such as physical and mental illness, losing their jobs and having difficulties at home. But, the silver generation, as they are being known, has changed a lot these days. With the aid of medical developments, the elderly's lifespan has become longer, making them more independent and active. Senior Welfare Center's are places where the elderly can spend their golden years in comfort, meaningfully. Senior Welfare Center's these days provide many different programs, which naturally lead to an increase in elderly users. With the rise in welfare centers and users, research on the subject also grew. As this topic has only recently become an issue, there were not many spatial structure studies considering elderly movement. Therefore, there should be spatial structure research that considers older users space awareness and how it can be managed effectively. The goal of this study is to present basic resources for providing a comfortable senior welfare center for elders. This will be based on quantitative analysis derived from spatial structure research along with special construction characteristics based on the institution's general plan. As a research method, Senior Welfare Center's will be categorized into corridor type, hall type, and hybrid types which then be reproduced into a j-graph. Based on this, special structure characteristics and connection links will be comprehended. Then the connection link will be analyzed based on the space syntax result calculated from each type's integration, connectivity, control value, and intelligibility. The analysis result shows that Senior Welfare Center j-graph's average arrangement is hybrid>corridor>hall types. Those elders lacking awareness need easily perceivable spatial structure's and hall type's would be the best choice to increase their awareness as it has high articulation. However, hall type's would be difficult to construct with the size increase, so hybrid type would be the next logical solution. Space with relatively high articulation will need to be planned in hybrid type's where rest areas can be created within the halls in the Welfare Center in connection to its corridors.

  • PDF

An Abstract Grammar for XML Document Editing (XML 문서 편집을 위한 추상문법)

  • 신경희;최종명;유재우
    • Journal of KIISE:Software and Applications
    • /
    • v.30 no.3_4
    • /
    • pp.268-277
    • /
    • 2003
  • A document type definition(DTD) which defines tags for a document is a XML document grammar that defines syntactic structure of a document. An XML document keeps the rules and must be parsed to check validation. To parse XML document, the deterministic parsing method of programming language is irrelevant because it does not satisfy the definition of deterministic content model in element declaration. In this paper, we consider editing of a valid XML document in syntax-directed editing environment, and we suggest the internal storage representations of syntax in DTD and theirs algorithms. The consequence is that a syntactic structure of textual DTD is transformed into graph and table structures. The table structure of DTD is interpreted the context free grammar which has attribute values and is used in syntax-directed editor for XML. We called this the XML abstract grammar and showed generated results and examples.

Web Structure Mining by Extracting Hyperlinks from Web Documents and Access Logs (웹 문서와 접근로그의 하이퍼링크 추출을 통한 웹 구조 마이닝)

  • Lee, Seong-Dae;Park, Hyu-Chan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.11
    • /
    • pp.2059-2071
    • /
    • 2007
  • If the correct structure of Web site is known, the information provider can discover users# behavior patterns and characteristics for better services, and users can find useful information easily and exactly. There may be some difficulties, however, to extract the exact structure of Web site because documents one the Web tend to be changed frequently. This paper proposes new method for extracting such Web structure automatically. The method consists of two phases. The first phase extracts the hyperlinks among Web documents, and then constructs a directed graph to represent the structure of Web site. It has limitations, however, to discover the hyperlinks in Flash and Java Applet. The second phase is to find such hidden hyperlinks by using Web access log. It fist extracts the click streams from the access log, and then extract the hidden hyperlinks by comparing with the directed graph. Several experiments have been conducted to evaluate the proposed method.

A Graph Model and Analysis Algorithm for cDNA Microarray Image (cDNA 마이크로어레이 이미지를 위한 그래프 모델과 분석 알고리즘)

  • Jung, Ho-Youl;Hwang, Mi-Nyeong;Yu, Young-Jung;Cho, Hwan-Gue
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.29 no.7
    • /
    • pp.411-421
    • /
    • 2002
  • In this Paper we propose a new Image analysis algorithm for microarray processing and a method to locate the position of the grid cell using the topology of the grid spots. Microarray is a device which enables a parallel experiment of 10 to 100 thousands of test genes in order to measure the gene expression. Because of the huge data obtained by a experiment automated image analysis is needed. The final output of this microarray experiment is a set of 16-bit gray level image files which consist of grid-structured spots. In this paper we propose one algorithm which located the address of spots (spot indices) using graph structure from image data and a method which determines the precise location and shape of each spot by measuring the inclination of grid structure. Several experiments are given from real data sets.

A Method for Detecting Program Plagiarism Comparing Class Structure Graphs (클래스 구조 그래프 비교를 통한 프로그램 표절 검사 방법)

  • Kim, Yeoneo;Lee, Yun-Jung;Woo, Gyun
    • The Journal of the Korea Contents Association
    • /
    • v.13 no.11
    • /
    • pp.37-47
    • /
    • 2013
  • Recently, lots of research results on program comparison have been reported since the code theft become frequent as the increase of code mobility. This paper proposes a plagiarism detection method using class structures. The proposed method constructs a graph representing the referential relationship between the member variables and the methods. This relationship is shown as a bipartite graph and the test for graph isomorphism is applied on the set of graphs to measure the similarity of the programs. In order to measure the effectiveness of this method, an experiment was conducted on the test set, the set of Java source codes submitted as solutions for the programming assignments in Object-Oriented Programming course of Pusan National University in 2012. In order to evaluate the accuracy of the proposed method, the F-measure is compared to those of JPlag and Stigmata. According to the experimental result, the F-measure of the proposed method is higher than those of JPlag and Stigmata by 0.17 and 0.34, respectively.

Enterprise Network Weather Map System using SNMP (SNMP를 이용한 엔터프라이즈 Network Weather Map 시스템)

  • Kim, Myung-Sup;Kim, Sung-Yun;Park, Jun-Sang;Choi, Kyung-Jun
    • The KIPS Transactions:PartC
    • /
    • v.15C no.2
    • /
    • pp.93-102
    • /
    • 2008
  • The network weather map and bandwidth time-series graph are popularly used to understand the current and past traffic condition of NSP, ISP, and enterprise networks. These systems collect traffic performance data from a SNMP agent running on the network devices such as routers and switches, store the gathered information into a DB, and display the network performance status in the form of a time-series graph or a network weather map using Web user interface. Most of current enterprise networks are constructed in the form of a hierarchical tree-like structure with multi-Gbps Ethernet links, which is quietly different from the national or world-wide backbone network structure. This paper focuses on the network weather map for current enterprise network. We start with the considering points in developing a network weather map system suitable for enterprise network. Based on these considerings, this paper proposes the best way of using SNMP in constructing a network weather map system. To prove our idea, we designed and developed a network weather map system for our campus network, which is also described in detail.

Synthesizing multi-loop control systems with period adjustment and Kernel compilation (주기 조정과 커널 자동 생성을 통한 다중 루프 시스템의 구현)

  • Hong, Seong-Soo;Choi, Chong-Ho;Park, Hong-Seong
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.3 no.2
    • /
    • pp.187-196
    • /
    • 1997
  • This paper presents a semi-automatic methodology to synthesize executable digital controller saftware in a multi-loop control system. A digital controller is described by a task graph and end-to-end timing requirements. A task graph denotes the software structure of the controller, and the end-to-end requirements establish timing relationships between external inputs and outputs. Our approach translates the end-to-end requirements into a set of task attributes such as task periods and deadlines using nonlinear optimization techniques. Such attributes are essential for control engineers to implement control programs and schedule them in a control system with limited resources. In current engineering practice, human programmers manually derive those attributes in an ad hoc manner: they often resort to radical over-sampling to safely guarantee the given timing requirements, and thus render the resultant system poorly utilized. After task-specific attributes are derived, the tasks are scheduled on a single CPU and the compiled kernel is synthesized. We illustrate this process with a non-trivial servo motor control system.

  • PDF

Design and implementation of malicious comment classification system using graph structure (그래프 구조를 이용한 악성 댓글 분류 시스템 설계 및 구현)

  • Sung, Ji-Suk;Lim, Heui-Seok
    • Journal of the Korea Convergence Society
    • /
    • v.11 no.6
    • /
    • pp.23-28
    • /
    • 2020
  • A comment system is essential for communication on the Internet. However, there are also malicious comments such as inappropriate expression of others by exploiting anonymity online. In order to protect users from malicious comments, classification of malicious / normal comments is necessary, and this can be implemented as text classification. Text classification is one of the important topics in natural language processing, and studies using pre-trained models such as BERT and graph structures such as GCN and GAT have been actively conducted. In this study, we implemented a comment classification system using BERT, GCN, and GAT for actual published comments and compared the performance. In this study, the system using the graph-based model showed higher performance than the BERT.