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

• Journal of the Korea Society for Simulation
• /
• v.27 no.3
• /
• pp.23-36
• /
• 2018

Discrete Event System Specification (DEVS) has been used for decades as it provides sound semantics for hierarchical modular specification of discrete event systems. Instead of the mathematical specification, the DEVS diagram, based on the structured DEVS formalism, has provided more intuitive and convenient representation of complex DEVS models. This paper proposes a clean room process for implementation and verification of a DEVS diagram model specification into a simulation software source code. Specifically, it underlies a sequence of transformation steps from conformance and integrity checking of a given diagram model, translation into a corresponding tabular model, and finally conversion to a simulation source code, with each step being inversely verifiable for traceability. A simple example helps developers to understand the proposed process with associated transformation methods; a case study shows that the proposed process is effective for and adaptable to practical simulation software development.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.1
• /
• pp.129-134
• /
• 2013

Previous research is focus on testcase generation automation using message sequence diagram based on metamodel. but that research is not enough for testcase genaeration automation using state diagram based metamodel. so in this paper is adopt Model Driven Architecture (MDA) mechanism for using metamodel and model transformation. and we suggest testcase automation mechanism using state diagram in UML. we will decrease cost of embedded software design and testcase genaration and increase quality of embedded software using metamodel mechanism.

• Proceedings of the KSR Conference
• /
• 2010.06a
• /
• pp.448-454
• /
• 2010

Currently a KTX train of 20-car formation is 388m long and carries 931 passengers including one captain and three crews which is quite a few to cover the lengthy service area and many customers. On the other hand, if a passenger wants to talk to an attendant, he has to wait for an attendant passing by his/her seat or walk to an intercom which is placed at every other car. Any of these choices is inconvenient. So, in this paper, we presented a system design for developing an audio/visual communication system for a passenger and an attendant. The system was analyzed and designed according to the Object-Oriented methodology with UML (Unified Modeling Language). Based on a problem statement, a Use-case Diagram, Sequence Diagrams, Class Diagram, State Charts, collaboration Diagram were generated. The design will be used in system implementation to a HEMU-400X test train and to be tested.

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

• Kyungpook Mathematical Journal
• /
• v.46 no.3
• /
• pp.449-461
• /
• 2006

Generalizing twist moves of classical knots, we introduce $t(a_1,{\cdots},a_m)$-moves of virtual knots for an $m$-tuple ($a_1,{\cdots},a_m$) of nonzero integers. In [4], M. Goussarov, M. Polyak and O. Viro introduced finite type invariants of virtual knots and Gauss diagram formulae giving combinatorial presentations of finite type invariants. By using the Gauss diagram formulae for the finite type invariants of degree 2, we give a necessary condition for a virtual long knot K to be transformed to a virtual long knot K' by a finite sequence of $t(a_1,{\cdots},a_m)$-moves for an $m$-tuple ($a_1,{\cdots},a_m$) of nonzero integers with the same sign.

• IE interfaces
• /
• v.16 no.2
• /
• pp.268-279
• /
• 2003

This paper presents critical steps in building client/server application with UML and Visual Basic, which are derived from the implementation case of a typical order processing system. To begin with, we briefly review the software architecture, the diagrams and the object-oriened building process in the UML. In the inception phase, it is critical to define the project charter, to draw use case diagrams, and to construct a preliminary architecture of the application. In the elaboration phase, it is critical to identify classes to be displayed in the class diagram, to develop user interface prototypes for each use case, to construct sequence diagram for each use case, and finally to design an implementation architecture. Steps to construct implementation architecture are given. In the construction phase, it is critical to design both the database and components. Steps to design these components are described in detail. Additionally the way to create the Internet interface is suggested.

• Journal of The Korean Astronomical Society
• /
• v.31 no.1
• /
• pp.39-50
• /
• 1998

We present UBV CCD photometry of Be 2, previously unstudied open cluster. Our photometry covers a field of $3'.2\times3'.8$ of the sky centered on the cluster, which is slightly smaller than the cluster diameter estimated to be about 260'. We have determined the reddening, distance, age and metallicity of the cluster by fitting the Pad ova isochrones to the observed stellar distributions in color-magnitude diagram as well as main sequence fitting: $E(B-V)=0.8\pm0.05,\;(m-M)_o=13.6\pm0.1,\;log(t) =8.9\pm0.1$, and Z=0.008. The present photometry shows that Be 2 is a distant open cluster of intermediate age. that it is a distant intermediate-age open duster.

• Journal of The Korean Astronomical Society
• /
• v.16 no.1
• /
• pp.23-30
• /
• 1983

About two hundred stars within 50 pc from the sun, whose tangential velocity larger than 100 km/sec, have been selected on the basis of their proper motions and trigonometric parallaxes. A list of them along with their photoelectric UBV data and spectral types is given. The criterion on the tangential velocity, $v_t$ > 132 km/sec, was adopted for selection of high-velocity stars. The H-R diagram of these nearby high-velocity stars resembles that of a globular cluster, with the turnoff around $B-V{\approx}0.35$ and $M_v{\approx}4.0$, and the subdwarfs among these high-velocity stars are fainter than the main-sequence stars of Hyades by the amount of $1^m.25{\pm}0^m.30$ in the region with B-V < 1.40 on the average.

• Journal of Astronomy and Space Sciences
• /
• v.17 no.2
• /
• pp.151-162
• /
• 2000

The general properties of the NCBs, divided into A and F types according to their spectral types, have been presented. The evolutionary status of the F type near-contact binaries are closer to that of the contact systems, i.e., W UMa type binaries, if it is assumed that the evolution of the NCBs is governed by the thermal relaxation oscillation theory. The mass-radius relation, mass-luminosity relation and H-R diagram of the NCBs provide that the A type NCBs suffer from more active mass transfer than F types. The components of the NCBs ar still in main-sequence like W UMa type stars and their two components lines parallel to the ZAMS.