• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.1
• /
• pp.62-69
• /
• 2002

As Graphic Information is a intuitive, simple and definite media to transfer information to human, It is widely used and deserved as a information exchange and store media. But the graphic information is so abstract that a human may misunderstand that's real meaning. So In order to transfer a Exact information to a human, a additional picture and description is needed. So, in this paper, A authoring system is suggested that it can be able to give a additional information at each region in graphic information, and to structurize relations between each region and to give linking information between each region using XML Linking Notation. In this paper, An suggested authoring system is implemented to support a authoring facility which is to display graphical information of CGM(Computer Graphic Metafile) and BMP, and to define structural information by selecting each region of graphics image on screen directly, and to save that structural information and linking information with XML Linking notation, and to support a browsing facility which to find hot spot using a structurized graphic information and then to show a proper graph.

• The KIPS Transactions:PartD
• /
• v.16D no.2
• /
• pp.223-236
• /
• 2009

BPMN is a standard business process description notation developed by OMG. It allows the user to have an abstract view of a process that hides its details with the Collapsed Sub-Process notation. While it is a useful direction of abstraction that can be called the horizontal abstraction, a different kind of abstraction, the vertical abstraction, is necessary when different stakeholders of business would like to have different views of the business process form their own viewpoints of interest. For example, stakeholders may want to see a process from the viewpoint of a particular group of actors or from the viewpoint of a certain set of goals. This paper first extends horizontal abstraction capability of BPMN by introducing the notion of super edge and, moreover, adds the vertical abstraction capability to it by introducing the notions of 'aspect attribute' and 'interest specification' and notations for them.

• Journal of Information Management
• /
• v.43 no.2
• /
• pp.199-222
• /
• 2012

Due to the increase of international business and activities, Koreans nowadays have higher needs to present their personal identity to the foreigners. In this process, the first requirement is to exchange personal names with foreigners. Therefore, the phonetic translation of Korean names into Roman alphabetic notation is frequently required, in order to deliver Korean personal names to the people who do not understand Korean alphabet. However, some confusions have been witnessed in the way of transforming Korean names into Roman (English) alphabet notation, due to the fact that there are many different ways to put Korean pronunciation into Roman (English) alphabet. This study examines different formats of Romanization of Korean personal names to find and suggest an optimal one. It first examines structures of and differences between Korean and Western personal names and usage patterns, reviews the issues surrounding Romanization of Korean personal names, and patternizes diverse Romanization formats currently used. Based on these examinations and consequent findings, I would like to suggest a format for the Romanization of Korean personal names which is considered to be the best.

• Journal of Software Engineering Society
• /
• v.25 no.2
• /
• pp.35-47
• /
• 2012

Variable Message Format(VMF) is a communications protocol that allows computers to exchange tactical military information over low-data-rate bearers. VMF is designed to define message length and structure variably in order to allow the user to transmit only the relevant information by using indicators. However, flexibility of messages makes it difficult to analyze messages structure and figure out meanings. Furthermore, whenever messages are added or modified, message processing software should be updated and distributed to systems. In this paper, we propose a systematic approach to defining VMF messages that uses the international standard notation ASN.1. By describing VMF messages in ASN.1, protocol architects can deal with VMF messages accurately and conveniently, and use various ASN.1 tool. This paper develops ASN.1 description templates for VMF message segments, and presents an approach to describing VMF messages in ASN.1 by combining the templates.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.3
• /
• pp.1702-1721
• /
• 2019

A workflow process (or business process) management system helps to define, execute, monitor and manage workflow models deployed on a workflow-supported enterprise, and the system is compartmentalized into a modeling subsystem and an enacting subsystem, in general. The modeling subsystem's functionality is to discover and analyze workflow models via a theoretical modeling methodology like ICN, to graphically define them via a graphical representation notation like BPMN, and to systematically deploy those graphically defined models onto the enacting subsystem by transforming into their textual models represented by a standardized workflow process definition language like XPDL. Before deploying those defined workflow models, it is very important to inspect its syntactical correctness as well as its structural properness to minimize the loss of effectiveness and the depreciation of efficiency in managing the corresponding workflow models. In this paper, we are particularly interested in verifying very large-scale and massively parallel workflow models, and so we need a sophisticated analyzer to automatically analyze those specialized and complex styles of workflow models. One of the sophisticated analyzers devised in this paper is able to analyze not only the structural complexity but also the data-sequence complexity, especially. The structural complexity is based upon combinational usages of those control-structure constructs such as subprocesses, exclusive-OR, parallel-AND and iterative-LOOP primitives with preserving matched pairing and proper nesting properties, whereas the data-sequence complexity is based upon combinational usages of those relevant data repositories such as data definition sequences and data use sequences. Through the devised and implemented analyzer in this paper, we are able eventually to achieve the systematic verifications of the syntactical correctness as well as the effective validation of the structural properness on those complicate and large-scale styles of workflow models. As an experimental study, we apply the implemented analyzer to an exemplary large-scale and massively parallel workflow process model, the Large Bank Transaction Workflow Process Model, and show the structural complexity analysis results via a series of operational screens captured from the implemented analyzer.

• Journal of the Korea Society for Simulation
• /
• v.18 no.2
• /
• pp.1-8
• /
• 2009

Enterprise security management system proposed to properly manage heterogeneous security products is the security management infrastructure designed to avoid needless duplications of management tasks and inter-operate those security products effectively. In this paper, we defined the security policies using Z-Notation and the detection algorithm of policy conflict for managing heterogeneous firewall systems. It is designed to help security management build invulnerable security policies that can unify various existing management infrastructures of security policies. Its goal is not only to improve security strength and increase the management efficiency and convenience but also to make it possible to include different security management infrastructures while building security policies. With the process of the detection and resolution for policy conflict, it is possible to integrate heterogeneous security policies and guarantee the integrity of them by avoiding conflicts or duplications among security policies. And further, it provides convenience to manage many security products existing in large networks.

• Asian Journal of Turfgrass Science
• /
• v.9 no.4
• /
• pp.293-316
• /
• 1995

Nitrogen fertilization and cutting practice were studied on turfgrasses and cover plants to investigate the possibility of maintaining green color during the growing season. Research also involved the effect of the nitrogen on a few morphological characteristics of leaf performance elements which might give an information to coloration and life-span of turf leaves. Treatments in the first experiment undertaken on pot included one N level: 350kgN /ha applied as compound fertilizer in split applications of one-half in mid-May and the rest both in late June and August, and four spring-summer cuts: late May, late June, late July and late August. The soil filled in pot a moderately well-drained sandy loam. In the second experiment(field observation) leaf length and width, inflorescence and flowering, and color performance were also investigated. With nitrogen fertilizer applied on turfs, desirable turf color was maintained during a period of poor coloration in specific seasons such as mid-summer for cool season grasses and late fall for warm season grasses comparing to the non-treatment. However, this was not stimulated by cutting treatment to nitrogen status existed. Cutting effect on coloration was more remarkable in both Korean lawngrass and Manilagrass than in cool season turfgrasses such as Italian rye-grass, perennial ryegrass and tall fescue. Especially down-slide of leaf color in cool season turfgrasses could he detected in mid-summer /early fall season ranging up to mid-September. In early November as well as mid-September, Italian ryegrass, perennial ryegrass and tall fes-cue retained a high level of green color as followed by nitrogen application and cutting treatment, and little detectable variation of leaf color notation between cool season turfgrasses was obtained. However, Korean la'vngrass and Manilagrass failed to retain the green color until early November. Color notations in cool season turfgrasses investigated early November on the final date of the experiment ranged from 5 GY 3/1 to 4/8 in 'Ramultra' Italian ryegrass, 'Reveile' perennial ryegrass and 'Arid' tall fescue, but those in Zoysiagrasses were 7.5 YR 4/8 in Korean lawngrass and 2.5 y 5 /6 in Manilagrass. Life-span of leaves was shorter in Italian ryegrass, perennial ryegrass and tall fescue than in beth Korean lawngrass and Manilagrass with and without nitrogen application. In general, leaves appeared in early May had a long life-span than those appeared in late April or mid-June. Nitrogen application significantly prolonged the green color retaining period in perennial ryegrass, Italian ryegrass, Korean lawngrass and Manilagrass, and this was contrasted with the fact that there was no prolonged life-span of leaves emerging in early May and mid-June in tall fescue. SPAD reading values in 48 turfs and cover plants investigated in the field trial were increasing until late June and again decreasing till September. Increasing trends of reading value could be observed in the middle of October in most of grasses. On the other hand, clovers and reed canarygrasses did not restore their color values even in October. Color differences between inter-varieties, and inter-species occurred during the growing season under the field condition implicated that selection of species and /or cultivars for mixture should be taken into consideration. In Munsell color notation investigated in the final date in the middle of November, 32 cultivars belonged under the category of 5 GY and 10 cultivars under the category of 7.5 GY. This was implying that most of cool season turfs and cover plants grown in the center zone of Korean Peninsula which are able to utilize for landscape use can bear their reasonable green color by early or mid-November when properly managed. The applicable possibilities of SPAD readings and Munsell color notation to determine the color status of turfgrasses and cover plants used in this study were discussed.

• JOURNAL OF ELECTRICAL WORLD
• /
• s.278
• /
• pp.64-69
• /
• 2000

미국과 유럽에서 추진되고 있는 ITS(Intelligent Transport Systems : 고도도로교통시스템) 도로통신에서 취급하는 정보의 정의, 통신방식의 표준화 등의 동향에 대한 개요를 기술한다. 미국에서는 NTCIP(National Transportation Communication for ITS Protocol)라 불리우는 통신프로토콜, 데이터 딕셔너리, 메시지 셋트 등의 표준화가, 유럽에서는 DATEX-Net라는 데이터 교환의 표준화가 추진되고 있다. 이들은 ITS 분야에서의 시스템 간 및 장치간의 상호운용성$\cdot$호환성을 확보하고 통합적으로 ITS를 전개해가기 위한 기반정비의 주요 항목이다. 양자 공히 표준적인 통신프로토콜이 채용되고 있으나 정보내용, 메시지포맷에 대하여는 NTCIP가 ASN.1(Abstract Systax Notation 1)에서 기술한 MIB(Management Information Base)구조를 갖고 있는 한편, Datex-NET는 독자적인 구조의 사전과 EDIFACT(Electronic Data Interchange for Administration Commerce and Transport)에 따른 메시지사양으로 되어 있어 공통성이 없다. 그러나 센터간 통신에 관하여는 미국에서 제안한 DATEX-ASN이라는 표준화 안에 대하여 유럽에서 전향적인 평가를 하고 있어 통일화의 징조가 보이고 있다.

• Honam Mathematical Journal
• /
• v.28 no.4
• /
• pp.591-603
• /
• 2006

For a set $X{\subset}{\mathbb{Z}}^n$ let $(X,\;T^n_X)$ be the subspace of the Khalimsky n-dimensional space $({\mathbb{Z}}^n,\;T^n)$, $n{\in}N$. Considering a k-adjacency of $(X,\;T^n_X)$, we use the notation $(X,\;k,\;T^n_X)$. In this paper for a map $$f:(X,\;k,\;T^n_X){\rightarrow}(Y,\;2\;T_Y)$$, we find the condition that weak (k, 2)-continuity of the map f implies strong (k, 2)-continuity of f.

• Proceedings of the IEEK Conference
• /
• 2000.06d
• /
• pp.139-142
• /
• 2000

$\mu$BGA(Ball Grid Array) is growing in response to a great demand for smaller and lighter packages for the use in laptop, mobile phones and other evolving products. However it is not easy to find its defect by human visual due to in very small dimension. From this point of view, we are interested its development of a vision based automated inspection algorithm. For this, first a 2D view of $\mu$BGA is described under a special blue illumination. Second, a notation-invariant 2D inspection algorithm is developed. Finally a 3D inspection algorithm is proposed for the case of stereo vision system. As a simulation result, it is shown that 3D defect not easy to find by 2D algorithm can be detected by the proposed inspection algorithm.