• 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 IKEEE
• /
• v.3 no.2 s.5
• /
• pp.295-304
• /
• 1999

This paper presents a method of constructing the Multiple-Valued Logic Systems(MVLS) over Finite Fields(FF) using by Decision Diagram(DD) that is based on Graph Theory. The proposed method is as following. First, we derivate the Ordered Multiple-Valued Logic Decision Diagram(OMVLDD) based on the multiple-valued Shannon's expansion theorem and we execute function decomposition using by sub-graph. Next, we propose the variable selecting algorithm and simplification algorithm after apply the each isomorphism and reodering vertex. Also we propose MVLS design method.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2007.11a
• /
• pp.321-329
• /
• 2007

This paper reports on the application of network analysis approaches to investigate the characteristics of graph representations of Japanese word associations. Two semantic networks are constructed from two separate Japanese word association databases. The basic statistical features of the networks indicate that they have scale-free and small-world properties and that they exhibit hierarchical organization. A graph clustering method is also applied to the networks with the objective of generating hierarchical structures within the semantic networks. The method is shown to be an efficient tool for analyzing large-scale structures within corpora. As a utilization of the network clustering results, we briefly introduce two web-based applications: the first is a search system that highlights various possible relations between words according to association type, while the second is to present the hierarchical architecture of a semantic network. The systems realize dynamic representations of network structures based on the relationships between words and concepts.

• Industrial Engineering and Management Systems
• /
• v.10 no.4
• /
• pp.238-246
• /
• 2011

Given a directed graph, we can determine how the user's preference moves from one product item to another. In this graph called "preference transition network", each node represents the product item while its edge pointing to the other nodes represents the transition of user's preference. However, with the large number of items make the network become more complex, unclear and difficult to be interpreted. In order to address this problem, this paper proposes a visualization technique in preference transition analysis based on recency and frequency. By adapting these two elements, the semantic meaning of each item and its transition can be clearly identified by its different types of node size, color and edge style. The experiment in a sales data has shown the results of the proposed approach.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2006.11a
• /
• pp.314-317
• /
• 2006

This study proposes an ontology design framework to support the cooperation among devices by using PROLOG, Conceptual Graph (CG), and Resource Description Framework (RDF). Quite a large number of representation languages for representing ontology on the Web have been established over the last decade. Most of these researches are focused on design of independent resources description. In Semantic Web, however, cooperation ontology will be needed. In this study, the CG could make an entire conceptual view of knowledge and RDF can represent that knowledge. Then the PROLOG could support the natural inference based on that knowledge. Therefore, our proposed ontology will be used in the designing of Semantic Web-based cooperation systems.

• Journal of Korea Multimedia Society
• /
• v.24 no.10
• /
• pp.1326-1335
• /
• 2021

As part of the cell division method, we proposed a method for segmenting images generated by topography microscopes through deep learning-based feature generation and graph segmentation. Hybrid vector shapes preserve the overall shape and boundary information of cells, so most cell shapes can be captured without any post-processing burden. NIH-3T3 and Hela-S3 cells have satisfactory results in cell description preservation. Compared to other deep learning methods, the proposed cell image segmentation method does not require postprocessing. It is also effective in preserving the overall morphology of cells and has shown better results in terms of cell boundary preservation.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.14 no.4
• /
• pp.219-226
• /
• 2019

One of the most widely studied protocols for tactical ad-hoc networks is Optimized Link State Routing Protocol (OLSR). As for OLSR research, most research work focus on reducing control traffic overhead and choosing relay point. In addition, because OLSR is mostly dependent on link detection and propagation, dynamic Hello timer become research challenges. However, different timer interval causes imbalance of link validity time by affecting link lifetime. To solve this problem, we propose a weighted topology graph model for constructing a robust network topology based on the link validity time. In order to calculate the link validity time, we use control message timer, which is set for each node. The simulation results show that the proposed mechanism is able to achieve high end-to-end reliability and low end-to-end delay in small networks.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.18 no.4
• /
• pp.709-714
• /
• 2023

A flexible planning system is an important element for the robot to perform various tasks. In this paper, we introduce an automated planning system architecture that can deal with the changing environment. PDDL is used for symbolic-based task planning, and a graph database is used for real-time environment information updates for automated PDDL generation. The proposed framework was verified through scenario-based experiments.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.6
• /
• pp.91-98
• /
• 2009

In this paper, this model ensures confidentiality and integrity of mandatory access cotrol policy which based on fuzzy function with importance of information. And it solves authorization abuse problem through role graph creation algorithm and flowing policy that security grade is applied. Because this model composes role hierarchy which bind similar role concept to apply to commercial environment, it has expansile advantage by large scale security system as well as is easy that add new role.

• The Journal of Society for e-Business Studies
• /
• v.5 no.2
• /
• pp.113-125
• /
• 2000

There are many web-based applications which need graphs and charts to be generated from data stored in the database. This paper does a comparative study on graph processing techniques for web-based applications through a case study of building a stock information system. The result of this paper can be used for building effective web applications with graphs in areas of EC(electronic commerce), EIS(executive information system), and DM(data mining).