• The Transactions of the Korea Information Processing Society
• /
• v.3 no.5
• /
• pp.1082-1092
• /
• 1996

The design of distrbuted systems is difficult to achieve as the execution patterns of distrbuted systems are typically more complex than those of non- distributed systems. Thus, research toward the development of design methods for distributed systems is quitely needed. As object-oriented systems and distrbuted systems share similar properties, the combination of these two is somehow natural. In this work, a design of distributed systems is introduced. The goal of the method in this paper is to provide assistance to the process of specifying a formal object- oriented specification from graphical representation specification inputs such as data flow diagrams, state transition diagrams and Petri nets. It addresses the extraction of objects, operations and reationshipsfrom the problem domain with emphasis on the specification of the characteristics of distributed systems. This object identification method is supported by a knowledge base that provides for the automated analysis and reasoning about objects and their relationsships. The final object model is represented in a format which provides a formal mechanism for reprsenting the object information.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.5
• /
• pp.1103-1111
• /
• 1996

The design of distrbuted systems is difficult to achieve as the execution patterns of distrbuted systems are typically more complex than those of non- distributed systems. Thus, research toward the development of design methods for distributed systems is quitely needed. As object-oriented systems and distrbuted systems share similar properties, the combination of these two is somehow natural. In this work, a design of distributed systems is introduced. The goal of the method in this paper is to provide assistance to the process of specifying a formal object- oriented specification from graphical representation specification inputs such as data flow diagrams, state transition diagrams and Petri nets. It addresses the extraction of objects, operations and reationshipsfrom the problem domain with emphasis on the specification of the characteristics of distributed systems. This object identification method is supported by a knowledge base that provides for the automated analysis and reasoning about objects and their relationsships. The final object model is represented in a format which provides a formal mechanism for reprsenting the object information.

• Journal of the Korean Data and Information Science Society
• /
• v.28 no.1
• /
• pp.87-98
• /
• 2017

The multivaiate empirical distribution function (MEDF) is defined in this work. The MEDF's expectation and variance are derived and we have shown the MEDF converges to its real distribution function. Based on random samples from bivariate standard normal distribution with various correlation coefficients, we also obtain MEDFs and propose two kinds of graphical methods to visualize MEDFs on two dimensional plane. One is represented with at most n stairs with similar arguments as the step function, and the other is described with at most n curves which look like bivariate quantile vector. Even though these two descriptive methods could be expressed with three dimensional space, two dimensional representation is obtained with ease and it is enough to explain characteristics of bivariate distribution functions. Hence, it is possible to visualize trivariate empirical distribution functions with three dimensional quantile vectors. With bivariate and four variate illustrative examples, the proposed MEDFs descriptive plots are obtained and explored.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.12 no.1
• /
• pp.43-52
• /
• 1994

This paper outlines a new approach to the line generalization when preparing small scale map on the basis of existing large scale digital map. Line generalizations are conducted based on Douglas algorithm using 1/25,000 scale topographic maps of southeastern JEJU island which produced by National Geographic Institute to analyze the fitness to the original and problems of graphical representation. Compare to the same scale map which was generated by manual method, a verity of small, but sometimes significant errors ＆ modification of topological relationship have been detected. The research gives full details of three algorithms that operationalize the smallest visible object method, together with some empirical results. A comparison of the results produced by the new algorithms with those produced by manual generalization and Douglas method of data reduction is provided. Also this paper presents the preliminary results of an relationships between the size of smallest visual object and requiring data storages for each algorithms.

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.25 no.2
• /
• pp.86-95
• /
• 1983

Evapotranspiration is a major factor determining the water consumption in the rice fields. Therefore, realistic evapotranspiration estimates are important to the agricultural water resources planning. In Korea, however, the Blaney-Criddle formula, which was developed under the meteorological condition of western arid United States and the upland cultivation, has been widely used to estimate evapotranspiration from paddy fields. Hence, it has considered that the Blaney-Criddle formula would not be the proper method for the Korean paddy condition. The purpose of this study is to select the most appropriate and realistic method for estimating evapotranspiraion from paddy field in Korea and to derive crop coefficients using the chosen method. The results are summerized as follows. 1. Total seasonal-average evapotranspiration by the field observation was 660mm for Tongil and 621. Ornm for the Japonica variety of rice. The amount of evapotranspiration for Tongil variety was 6% larger than that of the Japonica variety. 2. There was no significant differences in the amount of evapotranspiration among early, middle and late mature varieties, that is, early 638mm, middle 627mm and late 630mm for the whole growing season. 3. The rate of peak evapotranspiration appeared at the beginning of August and was in the range of 7.7-8. Omm/day according to the different mature varieties. 4. The correlation between pan evaporation data and the calculated evapotranspiration using related meteorological data from various methods suggested such as Radiation (FAO), Hargreaves, Christiansen, Hargreaves-Christiansen, Jensen-Haise, showed high statistic significance. Therefore, it seemed to use those formulars in estimating evapotranspiration inste4 of using pan evaporation data. 5. It was concluded from the analysis of field data that the evapotranspiration estimate for Blaney-Criddle method might not be appropriate in Korea. On the other hand, Penman equation showed more accurate estimation at the flourishing stage of rice than the pan evaporation method. 6. The crop coefficients for the Penman and pan-evaporation method were obtained by graphical representation.

• Korean Journal of Optics and Photonics
• /
• v.22 no.2
• /
• pp.108-113
• /
• 2011

In this paper, we propose the complex differential diagram to classify surface plasmon waveguide modes with single interface. To date, surface plasmon waveguide modes are classified using the sign change of the group velocity in the dispersion relation that describes the interrelations between the real wavenumber of the propagation direction and the photon energy. The surface plasmon waveguide modes have the wavenumbers of the direction perpendicular to that in which the wave propagates as well as of the propagation direction, so it is necessary to classify the modes using all of these wavenumbers. The complex differential diagram is a graphical representation with variables of the difference between the real component and the imaginary component of the wavenumber. Using this diagram, the specific mode classification is possible, and it is easy to comprehensively analyze the wavenumber as the function of the photon energy.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.6
• /
• pp.796-801
• /
• 2009

In medical practice, the diagnosis or prediction models requiring complicated computations are not widely recognized due to difficulty in interpreting the course of reasoning and the complexity of computations. Medical personnel have used the nomograms which are a graphical representation for numerical relationships that enables to easily compute a complicated function without help of computation machines. It has been widely paid attention in diagnosing diseases or predicting the progress of diseases. A nomogram is constructed from a set of clinical data which contain various attributes such as symptoms, lab experiment results, therapy history, progress of diseases or identification of diseases. It is of importance to select effective ones from available attributes, sometimes along with parameters accompanying the attributes. This paper introduces a nomogram construction method that uses a naive Bayesian technique to construct a nomogram as well as a genetic algorithm to select effective attributes and parameters. The proposed method has been applied to the construction of a nomogram for a real clinical data set.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.5
• /
• pp.95-102
• /
• 2013

In metabolomics, metabolic pathway is represented by well-displayed graph. Metabolic pathways, especially, have a complex binding structure, which makes the graphical representation hard to visualize. There is a problem that edge crossings exponentially increase as the number of nodes grows. To apply automatic graph layout techniques to the genome-scale metabolic flow of metabolism domains, it is very important to reduce unnecessary edge crossing on a metabolic pathway layout. we proposed a metabolic pathway layout algorithm based on 2-layer layout. Our algorithm searches any meaningful component existing in a pathway, such as circular components, highly connected nodes, and the components are drawn in upper layer. Then the remaining subgraphs except meaningful components are drawn in lower layer by utilizing a new radial layout algorithm. It reduces ultimately reduced the number of edge crossings. This algorithm is the basis of flexible analysis for metabolic pathways.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.7
• /
• pp.149-154
• /
• 2014

Modern data computing developments have led to big improvements in graphic capabilities and there are many new possibilities for data displays. The visualization has proven effective for not only presenting essential information in vast amounts of data but also driving complex analyses. Big-data analytics and discovery present new research opportunities to the computer graphics and visualization community. In this paper, we discuss the patent analysis of big data visualization technology development in major countries. Especially, we analyzed 160 patent applications and registered patents in four countries on November 2012. According to the result of analysis provided by this paper, the text clustering analysis and 2D visualization are important and urgent development is needed to be oriented. In particular, due to the increase of use of smart devices and social networks in domestic, the development of three-dimensional visualization for Big Data can be seen very urgent.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.6
• /
• pp.71-79
• /
• 2013

Metabolic pathway, represented by well-displayed graph, have a complex binding structure, which makes the graphical representation hard to visualize. To apply automatic graph layout techniques to the genome-scale metabolic flow of metabolism domains, it is very important to reduce unnecessary edge crossing on a metabolic pathway layout. we proposed a metabolic pathway layout algorithm based on 3-layer layout. Our algorithm searches any meaningful component existing in a pathway, such as circular components, highly connected nodes, and the components are drawn in middle layer. Then the remaining subgraphs except meaningful components are drawn in upper and lower layer by utilizing a new radial layout algorithm. It reduces ultimately reduced the number of edge crossings. Our algorithm solve the problem that edge crossings exponentially increase as the number of nodes grows.