• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.4
• /
• pp.425-430
• /
• 2005

Many problems can be formulated in terms nf graphs and thus solved by graph-theoretic algorithms. This paper is concerned with finding paths between nodes over the distributed and overlapped graphs. The proposed method allows multiple agents to cooperate to find paths without merging the distributed graphs. For each graph there is a designated agent which is charged of providing path-finding service for hot graph and initiating the path-finding tasks of which path starts from the graph. The proposed method earlier on constructs an abstract graph so-called viewgraph for the distributed overlapped graphs and thus enables to extract the information about how to guide the path finding over the graphs. The viewgraph is shared by all agents which determine how to coordinate other agents for the purpose of finding paths. Each agent maintains the shortest path information among the nodes which are placed in different overlapped subgraphs of her graph. Once an agent is asked to get a path from a node on her graph to another node on another's graph, she directs other agents to provide the necessary information for finding paths.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.25 no.5
• /
• pp.1021-1026
• /
• 2015

Increasing of damage by phishing, government and organization response more rapidly. So phishing use malware and vulnerability for attack. Recently attack that use patch analysis is increased when Microsoft announce patches. Cause of that, researcher for security on defense need technology of patch analysis. But most patch analysis are develop for Microsoft's product. Increasing of mobile environment, necessary of patch analysis on mobile is increased. But ordinary patch analysis can not use mobile environment that there is many file and small size. So we suggest this research that use code filtering instead of Control Flow Graph and Abstract Syntax Tree.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.8
• /
• pp.999-1007
• /
• 1999

이 논문은 재귀원형군 G(2^m , 2^k )를 그래프 이론적 관점에서 고찰하고 정점이 서로소인 사이클과 그래프 invariant에 관한 위상 특성을 제시한다. 재귀원형군은 1 에서 제안된 다중 컴퓨터의 연결망 구조이다. 재귀원형군 {{{{G(2^m , 2^k )가 길이 사이클을 가질 필요 충분 조건을 구하고, 이 조건하에서 G(2^m , 2^k )는 가능한 최대 개수의 정점이 서로소이고 길이가l`인 사이클을 가짐을 보인다. 그리고 정점 및 에지 채색, 최대 클릭, 독립 집합 및 정점 커버에 대한 그래프 invariant를 분석한다.Abstract In this paper, we investigate recursive circulant G(2^m , 2^k ) from the graph theory point of view and present topological properties of G(2^m , 2^k ) concerned with vertex-disjoint cycles and graph invariants. Recursive circulant is an interconnection structure for multicomputer networks proposed in 1 . A necessary and sufficient condition for recursive circulant {{{{G(2^m , 2^k ) to have a cycle of lengthl` is derived. Under the condition, we show that G(2^m , 2^k ) has the maximum possible number of vertex-disjoint cycles of length l`. We analyze graph invariants on vertex and edge coloring, maximum clique, independent set and vertex cover.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.5
• /
• pp.267-281
• /
• 2006

PPI(Protein-Protein Interaction) data has information about the organism has maintained a life with some kind of mechanism. So, it is used in study about cure research back, cause of disease, and new medicine development. This PPI data has been increased by geometric progression because high throughput methods are developed such as Yeast-two-hybrid, Mass spectrometry, and Correlated mRNA expression. So, it is impossible that a person directly manage and analyze PPI data. Fortunately, PPI data is able to abstract the graph which has proteins as nodes, interactions as edges. Consequently, Graph theory plentifully researched from the computer science until now is able to be applied to PPI data successfully. In this paper, we introduce Proteinca(PROTEin INteraction CAbaret) workbench system for easily managing, analyzing and visualizing PPI data. Proteinca assists the user understand PPI data intuitively as visualizing a PPI data in graph and provide various analytical function on graph theory. And Protenica provides a simplified visualization with gravity-rule.

• 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.

• Annual Conference on Human and Language Technology
• /
• 2019.10a
• /
• pp.252-257
• /
• 2019

이 논문은 한국어 Abstract Meaning Representation (AMR; 추상 의미 표상) 가이드라인 1.0^*을 소개한다. AMR은 통합적인 의미 표상 체계로, 의미 분석(semantic parsing)의 주요 Task 중 하나로 자리매김하고 있다. 한국어 AMR 가이드라인은 현행 AMR 1.2.6을 심도 있게 분석하고 이를 한국어 상황에 맞게 로컬라이징한 것이다. 해당 가이드라인은 추후 한국어 AMR 말뭉치 구축(sembanking)에 대비하여 일관된 주석 세부 지침을 제공하기 위해 작성되었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.7
• /
• pp.1252-1273
• /
• 2011

In Web Service Composition (WSC) area, services selection aims at selecting an appropriate candidate from a set of functionally-equivalent services to execute the function of each task in an abstract WSC according to their different QoS values. In despite of many related works, few of previous studies consider transactional constraints in QoS-aware WSC, which guarantee reliable execution of Composite Web Service (CWS) that is composed by a number of unpredictable web services. In this paper, we propose a novel global selection-optimal approach in WSC by considering both transactional constraints and end-to-end QoS constraints. With this approach, we firstly identify building rules and the reduction method to build layer-based Directed Acyclic Graph (DAG) model which can model transactional relationships among candidate services. As such, the problem of solving global optimal QoS utility with transactional constraints in WSC can be regarded as a problem of solving single-source shortest path in DAG. After that, we present Graph-building algorithms and an optimal selection algorithm to explain the specific execution procedures. Finally, comprehensive experiments are conducted based on a real-world web service QoS dataset. The experimental results show that our approach has better performance over other competing selection approaches on success ratio and efficiency.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.410-413
• /
• 2000

This paper suggests a methodology in which control signals for high-level synthesis are generated from SDL specification. SDL is based on EFSM(Extended Finite State Machine) model. Data path and control part are partitioned into representing data operations in the from of scheduled data flow graph and process behavior of an SDL code in forms of an abstract FSM. Resource allocation is performed based on the suggested architecture model and local control signals to drive allocated functional blocks are incorporated into an abstract FSM extracted from an SDL process specification. Data path and global controller acquired through suggested methodology are combined into structural VHDL representation and correctness of behavior for final circuit is verified through waveform simulation.

• Bulletin of the Korean Mathematical Society
• /
• v.27 no.2
• /
• pp.157-164
• /
• 1990

The purpose of this paper is to consider the inhomogeneous initial value problem (Fig.) in a Banach space X, where Z is the generator of an exponentially bounded C-semigroup in X, f9t) : [0, T].rarw.X and x.mem.X. Davies-Pang [1] showed the corresponding homogeneous equation, this is, the equation with f(t).iden.0, has a unique solution depending continuoously on the initial value x.mem.CD(z) in the $C^{-1}$-graph norm on CD(Z) when T=.inf..

• East Asian mathematical journal
• /
• v.38 no.2
• /
• pp.143-164
• /
• 2022

Computer technology in mathematics teaching-learning is not for teaching computer but for improving mathematics teaching-learning with computer. It is shown the use of computer technology comparing with traditional approach provides students more opportunities in order to approach abstract structure. Computer activity provides not only understanding concepts of analysis and opportunity to investigate theory but also effective background in teaching analysis. We analyze students' computer usage level on analysis education by using computer usage level according to role of computer technology. We try to get an useful educational implication on analysis education applying MATLAB through qualitative research.