• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.2
• /
• pp.196-204
• /
• 1996

This paper presents a new scheduling algorithm, which is the most improtant subtask in the high level synthesis. The proposed algorithm performs scheduling in consideration of resource sharing concept based on characteristics of conditionsla bransches in the intermediate data structure. CDFG (control data flow graph) generated by a VHDL analyzer. This algorithm constructs a conditon graph based on time frame of each operation using both the ASAP and the ALAP scheduling algorithm. The conditon priority is obtained from the condition graph constructed from each conditional brance. The determined condition priority implies the sequential order of transforming the CDFG with conditonal branches into the CDFG without conditional branches. To minimize resource cost, the CDFG with conditional branches are transformed into the CDFG without conditonal brancehs according to the condition priority. Considering the data dependency, the hardware constraints, and the data execution time constraints, each operation in the transformed CDFG is assigned ot control steps. Such assigning of unscheduled operations into contorl steps implies the performance of the scheduling in the consecutive movement of operations. The effectiveness of this algorithm is hsown by the experiment for the benchmark circuits.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.7
• /
• pp.448-453
• /
• 2006

We extend a parallel depth-first search (DFS) algorithm for planar graphs to deal with (non-planar) solid grid graphs, a subclass of non-planar grid graphs. The proposed algorithm takes time O(log n) with $O(n/sqrt{log\;n})$ processors in Priority PRAM model. In our knowledge, this is the first deterministic NC algorithm for a non-planar graph class.

• Journal of Korea Multimedia Society
• /
• v.22 no.6
• /
• pp.706-715
• /
• 2019

This research implemented grammatical rules for relationship extraction from class diagram candidate. The problem statement is generated by our algorithm to yield class diagram and candidate relationship candidates. The relationships of class diagrams are extracted automatically from the problem statement by using Natural Language Processing (NLP). The extraction used the grammatical rules that obtained from various sources and translated into our algorithm. The performance evaluation of the extraction algorithm used ATM problem statements. The application captures the problem statement and draws automatically the relations of class diagrams using Forced-Directionality Graph algorithm. The performance evaluations show refining methods for class diagram and relationships extraction improve recall score.

• Journal of applied mathematics & informatics
• /
• v.5 no.3
• /
• pp.771-784
• /
• 1998

In this paper we propose an algorithm for generating minimal cutsets of undirected graphs. The algorithm is based on a blocking mechanism for generating every minimal cutest ex-actly once. The algorithm has an advantage of not requiring any preliminary steps to find minimal cutsets. The algorithm generates minimal cutsets at O(e.n) {where e,n = number of (edges, vertices) in the graph} computational effort per cutset. Formal proofs of the algorithm are presented.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.9
• /
• pp.1965-1970
• /
• 2011

This paper proposes the method of switching function implementation using switching function extraction based on graph over finite fields. After we deduce the matrix equation from path number of directional graph, we propose the switching function circuit algorithm, also we propose the code assignment algorithm for nodes which is satisfied the directional graph characteristics with designed circuits. We can implement more optimal switching function compare with former algorithm, also we can design the switching function circuit which have any natural number path through the proposed switching function circuit implementation algorithms. Also the proposed switching function implementation using graph theory over finite fields have decrement number of input-output, circuit construction simplification, increment arithmetic speed and decrement cost etc.

• Industrial Engineering and Management Systems
• /
• v.9 no.3
• /
• pp.227-241
• /
• 2010

A memory module industry's supply chain usually consists of multiple manufacturing sites and multiple distribution centers. In order to fulfill the variety of demands from downstream customers, production planners need not only to decide the order allocation among multiple manufacturing sites but also to consider memory module industrial characteristics and supply chain constraints, such as multiple material substitution relationships, capacity, and transportation lead time, fluctuation of component purchasing prices and available supply quantities of critical materials (e.g., DRAM, chip), based on human experience. In this research, a directed graph-based supply network planning (DGSNP) model is developed for memory module industry. In addition to multi-site order allocation, the DGSNP model explicitly considers production planning for each manufacturing site, and purchasing planning from each supplier. First, the research formulates the supply network's structure and constraints in a directed-graph form. Then, a proposed genetic algorithm (GA) solves the matrix form which is transformed from the directed-graph model. Finally, the final matrix, with a calculated maximum profit, can be transformed back to a directed-graph based supply network plan as a reference for planners. The results of the illustrative experiments show that the DGSNP model, compared to current memory module industry practices, determines a convincing supply network planning solution, as measured by total profit.

• Journal of applied mathematics & informatics
• /
• v.28 no.5_6
• /
• pp.1347-1358
• /
• 2010

An upright drawing of a planar graph G on k layers is a planar straight-line drawing of G, where the vertices of G are placed on a set of k horizontal lines, called layers and no two adjacent vertices are placed on the same layer. There is a previously known algorithm that decides in linear time whether a planar graph admits an upright drawing on k layers for a fixed value of k. However, the constant factor in the running time of the algorithm increases exponentially with k and makes it impractical even for k = 3. In this paper, we give a linear-time algorithm to examine whether a biconnected planar graph G admits an upright drawing on three layers and to obtain such a drawing if it exists. We also give a necessary and sufficient condition for a tree to have an upright drawing on three layers. Our algorithms in both the cases are much simpler and easier to implement than the previously known algorithms.

• 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 Korea Society of Computer and Information
• /
• v.26 no.3
• /
• pp.111-117
• /
• 2021

The delivery problem on a graph is that of minimizing the object delivery time from one vertex to another vertex on a graph with m vertices using n various speed robot agents. In this paper, we propose two optimal solution algorithms for the delivery problem on a graph with time complexity of O(㎥n) and O(㎥). After preprocessing to obtain the shortest path for all pairs of the graph, our algorithm processed by obtaining the shortest delivery path in the order of the vertices with the least delivery time. Assuming that the graph reflects the terrain on which to solve the problem, our O(㎥) algorithm actually has a time complexity of O(㎡n) as only one preprocessing is required for the various deployment of n robot agents.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.17 no.1
• /
• pp.153-160
• /
• 2022

A greedy algorithm is proposed to select a subset of nodes of a graph for bandlimited graph signals in which each signal value is generated with its weight. Since graph signals are weighted, we seek to minimize the weighted reconstruction error which is formulated by using the QR factorization and derive an analytic result to find iteratively the node minimizing the weighted reconstruction error, leading to a simplified iterative selection process. Experiments show that the proposed method achieves a significant performance gain for graph signals with weights on various graphs as compared with the previous novel selection techniques.