• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.8
• /
• pp.1774-1779
• /
• 2005

This paper propose the design method of the constructing the digital logic systems over galois fields using by the galois field decision diagram(GFDD) that is based on the graph theory. The proposed design method is as following. First of all, we discuss the mathematical properties of the galois fields and the basic properties of the graph theory. After we discuss the operational domain and the functional domain, we obtain the transformation matrixes, $\psi$GF(P)(1) and $\xi$GF(P)(1), in the case of one variable, that easily manipulate the relationship between two domains. And we extend above transformation matrixes to n-variable case, we obtain $\psi$GF(P)(1) and $\xi$GF(P)(1). We discuss the Reed-Muller expansion in order to obtain the digital switching functions of the P-valued single variable. And for the purpose of the extend above Reed-Muller expansion to more two variables, we describe the Kronecker product arithmetic operation.

• Journal of Information Management
• /
• v.42 no.1
• /
• pp.47-62
• /
• 2011

While an ideal author graph should have its nodes to represent authors, automatically-generated author graphs mostly use author names as their nodes due to the difficulty of resolving author names into individuals. However, employing author names as nodes of author graphs merges namesakes, otherwise separate nodes in the author graph, into the same node, which may distort the characteristics of the author graph. This study proposes an algorithm which resolves author ambiguities based on co-authorship and then yields an author graph consisting of not author name nodes but author nodes. Scientific collaboration relationship this algorithm depends on tends to produce the clustering results which minimize the over-clustering error at the expense of the under-clustering error. In experiments, the algorithm is applied to the real citation records where Korean namesakes occur, and the results are discussed.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.6
• /
• pp.677-682
• /
• 2006

Multi-domain design is difficult because such systems tend to be complex and include a mixtures of electrical, mechanical, hydraulic, and thermal components. To design an optimal system, unified and automated procedure with efficient search technique is required. This paper introduces design method for multi-domain system to obtain design solutions automatically, combining bond graph which is domain independent modeling tool and genetic programming which is well recognized as a powerful tool for open-ended search. The suggested design methodology has been applied for design of electric fitter, electric printer drive, and and pump system as a proof of concept for this approach.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.7
• /
• pp.111-123
• /
• 2013

To verify software vulnerability, the method of conjecturing software structure and then testing the software based on the conjectured structure has been highlighted. To utilize the method, an efficient way to conjecture software structure is required. The popular graph and tree methods such as DFG(Data Flow Graph), CFG(Control Flow Graph) and CFA(Control Flow Automata) have a serious drawback. That is, they cannot express software in a hierarchical fashion. In this paper, we propose a method to overcome the drawback. The proposed method applies various input data to a binary code, generate CFG's based on the code output and construct a HCFG (Hierarchical Control Flow Graph) to express the generated CFG's in a hierarchical structure. The components required for HCFG and progressive algorithm to construct HCFG are also proposed. The proposed method is verified through constructing the software architecture of an open SMTP(Simple Mail Transfer Protocol) server program. The structure generated by the proposed method and the real program structure are compared and analyzed.

• Journal of the Economic Geographical Society of Korea
• /
• v.15 no.3
• /
• pp.343-357
• /
• 2012

The Seoul metropolitan subway system can be represented by a graph which consists of nodes and edges. In this paper, we study classification of subway stations and trip behaviour of subway passengers through partitioning the graph of the subway system into roughly equal groups. A weight of each edge of the graph is set to the number of passengers who pass the edge, where the number of passengers is extracted from the transportation card transaction database. Since the graph partitioning problem is NP-complete, we propose a heuristic algorithm to partition the subway graph. The heuristic algorithm uses one of two alternative objective functions, one of which is to minimize the sum of weights of edges connecting nodes in different groups and the other is to maximize the ratio of passengers who get on the subway train at one subway station and get off at another subway station in the same group to the total subway passengers. In the experimental results, we illustrate the subway stations and edges in each group by color on a map and analyze the trip behaviour of subway passengers by the group origin-destination matrix.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.04a
• /
• pp.375-378
• /
• 2001

본 논문에서는 선형 MACA의 0-트리의 한 경로를 기본 경로로 하여 나머지 다른 트리를 구성하고 여원벡터를 선형 MACA의 하나의 상태로 해석하였을 때 상태전이그래프에서 놓이는 위치에 따라 선형 MACA로부터 유도된 여원을 갖는 CA의 모든 트리를 구성하는 알고리즘을 제안한다. 주어진 전이행렬과 여원벡터를 가지는 additive CA의 트리를 구성함에 있어 보다 빠르게 구성할 수 있는 알고리즘을 제시한다.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2006.05a
• /
• pp.879-883
• /
• 2006

본 연구는 현장에서 측정되는 수질데이터를 실시간 수집하여 데이터의 적절성을 모니터링하고 모형입력자료로써 신뢰성을 유지하도록 구성되는 시스템과 이를 2차원 수질 해석 모형인 CE-QUAL W2모형의 입력자료로 연계 활용함으로써 그 결과를 그래프 및 하천 변화 모의 동영상으로 표출하는 시스템을 개발하는데 그 목적이 있다. 수질 모형은 물 관련 모형가운데 특히 다량의 자료와 정확한 자료를 입력자료로 사용하며 그 결과 표출에 있어서도 전체적인 결과부터 세밀한 요소자료까지 결과자료가 필요하다. 본 연구에서 개발한 RTMMS(Real-time Turbidity Monitoring & Modeling System)는 현장 계측기로부터 수집되는 실시간 자료를 이용하여 데이터를 모니터링하고 CE-QUAL W2 모형을 이용하여 모델링을 수행한 후 결과를 그래프로 도출 할 수 있도록 하는 시스템이다. 특히 일반적인 어플리케이션의 GUI 환경에서 벗어나 일반 사용자들이 쉽게 프로그램을 사용할 수 있고 공간 활용도를 높이기 위하여 웹 형식의 GUI로 구성하였다. RTMMS는 기본 크기가 가로 800 픽셀, 세로 600 픽셀로 고정 사이즈이며, 주요 화면 구성으로는 좌측에 네 개의 항목이 있고 우측에는 실시간 모니터링 지점에 대한 유역도가 표시되어 사용자 편의환경을 제공하였다. 사용자는 해당 지점을 선택하여 주요 지점에 대한 정보를 분석할 수 있다. 또한 우측에는 선택된 지점에 대한 정보와 실시간 감시 내용을 조회할 수 있는 탭이 존재한다. 각각의 메뉴 항목은 주요지점의 모니터링 현황을 파악할 수 있는 기능, 수질모형의 입력자료로 변환하도록 하는 자료 동화 기능, CE-QUAL W2 모형을 수행하는 기능 및 결과자료를 분석하는 기능으로 구성되어 있으며, 각 기능을 선택하면 해당 화면으로 GUI가 전환된다. 따라서 다량의 측정자료의 신뢰성을 유지하고 이를 모형의 입력자료로 활용하는 일련의 과정을 시스템화하기 때문에 자료의 이상적 유지 관리가 이루어지며 복잡한 2차원 수질해석 모형을 수월하게 운영할 수 있는 시스템으로 개발하였다.

• The Korean Journal of Applied Statistics
• /
• v.30 no.3
• /
• pp.403-415
• /
• 2017

In this paper, we investigate cosponsorship networks found in the 17th National Assembly of Republic of Korea. New legislation should be sponsored by at least 10 legislators including one main sponsor. Cosponsorship networks can be constructed, using directional links from cosponsors of legislation to its main sponsor; subsequently, these networks indicate the social relationships among the legislators. We apply Exponential Random Graph Model (ERGM) for valued networks to capture structural properties and the covariate effects of networks. We find the effect of the same party has the greatest influence on the composition of the network. Mutuality also plays an important role in the cosponsorship network; in addition, the effect of the number of elections won by a legislator has a small but significant influence.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.5
• /
• pp.1320-1332
• /
• 1998

We propose Multiph which is a virtual topology for a reliable group communication platform on dynamic high speed network. We also define group communication primitives for transmission of messages and group management. Multiph consists of a set of nodes which are process groups and a set of edges which are the connection between nodes providing the route of messages. Processes can send and receive messages overlapped in a several multicast groups. Overlapped process organizes non-overlapped logical group, which called meta-group. Multiph guarantees ordering of messages that received at the destination group. It has no extra node that decreases system performance. Although the group has dynamic group change to leave and add process, it does not reconstruct the existing platform structure.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2016.07a
• /
• pp.239-240
• /
• 2016

본 논문에서는 RPP(Rural Postman Problem)을 시뮬레이션 하기 위한 툴을 설계하고 구현하였다. RPP 문제의 해를 구하기 위해 유전 알고리즘을 시뮬레이션 툴 내부에 엔진으로 구현하였다. 시뮬레이션 툴의 구성은 유전 알고리즘의 파라미터를 설정하기 위한 사용자 인터페이스 부분과 시뮬레이션 결과를 그래프로 표현해 주는 Presentation Layer, 유전 알고리즘을 이용하여 경로탐색을 처리하는 Operation Layer, 유전 알고리즘에서 사용되는 염색체들을 저장 관리하는 Data Layer로 되어 있다. 본 논문에서 구현한 시뮬레이션 툴을 이용하여 다양한 RPP 문제를 파라미터의 설정만을 통해 해를 구할 수 있으며, 실험 결과를 그래프로 확인할 수 있다.