• Journal of KIISE:Software and Applications
• /
• v.27 no.4
• /
• pp.357-369
• /
• 2000

SMIL(Synchronized Multimedia integration Language) allows integrating a set of independent multimedia objects into a synchronized multimedia presentation. In this paper, I propose modeling rules, formal models, modeling function and an algorithm for SMIL documents using use case diagram and sequence diagram of UML(Unified Modeling Language), It will be used the use case diagram and collaboration diagram for object-oriented visualizing tool to describe the temporal behavior of the presentation. The main contribution of this paper is that developers of SMIL documents easily generate them using this rules and algorithm. And, the formal models and modeling functions provide an environment for processing object-oriented documents.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.682-684
• /
• 2001

주어진 도메인에 대한 설계 및 구현 이전 단계인 분석 과정에서 객체지향의 방법을 적용할 수 있는 모델링 언어인 UML(Unified Modeling Language) 다이어그램 중 Use Case 다이어그램, 클래스 다이어그램, 순서도 등 3가지 모델들 간의 일관성(consistency)을 유지하기 위한 기준이나 구체적인 지침에 관한 여러 가지 형태의 연구들이 이미 행해져 왔지만, 본 논문에서는 이러한 다이어그램들 간의 일관성을 유지하는데 있어서 지켜져야 하는 기준과 checklist를 예제를 통해서 제시한다.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.3 s.35
• /
• pp.161-171
• /
• 2005

SMIL(Synchronized Multimedia Integration Language) allows multimedia objects into a synchronized multimedia presentation. In this paper, I propose modeling rules, formal models, modeling function and an algorithm for SMIL documents using use case diagram and sequence diagram of UML(Unified Modeling Language)to Develop for SMIL Documents Editor. It will be used the use case diagram and collaboration diagram for object-oriented visualizing tool to describe the temporal behavior of the presentation. The main contribution of this paper is that developers of SMIL documents editor easily generate them using this rules and algorithm. And, the formal models and modeling functions provide an environment for processing object-oriented. documents.

• The KIPS Transactions:PartD
• /
• v.12D no.1 s.97
• /
• pp.111-120
• /
• 2005

Software development creates many product that class components, Class Diagram, form, object, and design pattern. So this Paper suggests Index/XML Sequence Relation information system for product abstraction and classification, the system of design product Sequence Relation abstraction which can store, reuse design patterns in the meta modeling database with pattern Relation information. This is Index/XML Sequence Relation system which can easily change various relation information of product for product abstraction and classification. This system designed to extract and classify design pattern efficiently and then functional indexing, sequence base indexing for standard pattern, code indexing to change pattern into code and grouping by Index-ID code, and its role information can apply by structural extraction and design pattern indexing process. and it has managed various products, class item, diagram, forms, components and design pattern.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.5
• /
• pp.1-12
• /
• 1999

A new algorithm of constructing binary decision diagram(BDD) for design verification of switch-level circuits is proposed in this paper. In the switch-level circuit, functions are characterized by serial and parallel connections of switches and the final logic values may have high-impedance and unstable states in addition to the logic values of 0 and 1. We extend the BDD to represent functions of switch-level circuits as acyclic graphs so called switch-level binary decision diagram (SLBDD). The function representation of the graph is in the worst case, exponential to the number of inputs. Thus, the ordering of decision variables plays a major role in graph sizes. Under the existence of pass-transistors and domino-logic of precharging circuitry, we also propose an input ordering algorithm for the efficiency in graph sizes. We conducted several experiments on various benchmark circuits and the results show that our algorithm is efficient enough to apply to functional simulation, power estimation, and fault-simulation of switch-level design.

• The KIPS Transactions:PartD
• /
• v.16D no.4
• /
• pp.517-526
• /
• 2009

It is possible to indicate the complex design and execution of object-oriented program with dynamic UML diagram. This paper shows the way how to make several test cases from sequence, state, and activity diagram among dynamic UML diagram. Three dynamic UML diagrams about withdrawal work of ATM simulation program are drawn. Then different test cases are created from these diagrams using previously described ways. To evaluate effectiveness of test cases, mutation testing is executed. Mutants are made from MuClipse plug-in tool based on Eclipse which supports many traditional and class mutation operators. Finally we've got the result of mutation testing and compare effectiveness of test cases, etc. Through this document, we've known some hints that how to choose the way of making test cases.

• The KIPS Transactions:PartB
• /
• v.10B no.1
• /
• pp.111-118
• /
• 2003

The SMIL specification that is recently approved by the W3C and is meant to help deliver multimedia content to the Web, is widely used in these days and they have continuously emerged tools or softwares related with that. In this paper, I propose an algorithm to convert temporal scripts of RASP that is an experimental toolkit for computer animation that promotes interaction-based programming over time into a SMIL document. For making better use of SMIL documents, we can improve reusability of animation components. And, main contribution of this paper is that it verifies the sequence diagram generated for synchronization of documents by reconverting SMIL from UML sequence diagram.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07b
• /
• pp.313-315
• /
• 2005

XML을 이용하면 다이어그램에서 변경 내용을 검출하는 문제는 트리 구조에서 변경 내용을 검출하는 문제로 전환할 수 있다. 트리 구조의 털러 버전(version) 간에 형제(sibling) 노드의 순서가 유지되지 않는 조건하에서, 트리 구조의 변경 내용을 검출하는 문제는 NP-complete임이 증명되어 있다. 그러므로 본 논문에서는, 트리 연산에 몇 가지 제한을 부가하여, 빠른 시간 내에 최적에 가까운 변경 내용을 검출하는 방법을 제안한다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.1
• /
• pp.141-150
• /
• 2012

This paper suggests a critical path search algorithm that can easily draw PERT/GANTT chart which manages and plans a project schedule. In order to evaluate a critical path that determines the project schedule, Critical Path Method (CPM) is generally utilized. However, CPM undergoes 5 stages to calculate the critical path for a network diagram that is previously designed according to correlative relationship and execution period of project execution activities. And it may not correctly evaluate $T_E$ (The Earliest Time), since it does not suggest the way how to determine the sequence of the nodes activities that calculate the $T_E$. Also, the sequence of the network diagram activities obtained from CPM cannot be visually represented, and hence Lucko suggested an algorithm which undergoes 9 stages. On the other hand, the suggested algorithm, first of all, decides the sequence in advance, by reallocating the nodes into levels after Breadth-First Search of the network diagram that is previously designed. Next, it randomly chooses nodes of each level and immediately determines the critical path only after calculation of $T_E$. Finally, it enables the representation of the execution sequence of the project activity to be seen precisely visual by means of a small movement of $T_E$ of the nodes that are not belonging to the critical path, on basis of the $T_E$ of the nodes which belong to the critical path. The suggested algorithm has been proved its applicability to 10 real project data. It is able to get the critical path from all the projects, and precisely and visually represented the execution sequence of the activities. Also, this has advantages of, firstly, reducing 5 stages of CPM into 1, simplifying Lucko's 9 stages into 2 stages that are used to clearly express the execution sequence of the activities, and directly converting the representation into PERT/GANTT chart.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.8
• /
• pp.2113-2119
• /
• 1998

The optimization problem of BDDs plays an improtant role in the area of logic synthesis and formal verification. Since the variable ordering has great impacts on the size and form of BDD, finding a good variable order is very important problem. In this paper, a new variable ordering scheme called incremental optimization algorithm is presented. The proposed algorithm reduces search space more than a half of that of the conventional sifting algorithm, and computing time has been greatly reduced withoug depreciating the performance. Moreover, the incremental optimization algorithm is very simple than other variable reordering algorithms including the sifting algorithm. The proposed algorithm has been implemented and the efficiency has been show using may benchmark circuits.