• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.835-838
• /
• 2005

It is widely known that most operations performed in JVM belongs to data transfers at all times as JVM is based on abstract stack machine. Hence it is necessary to analyze the fashion of internal data transfers in JVM to develop a more efficient machine. We have analyzed in this paper the data transfer operations between operand stack, local variable array, heap, and constant pool in bytecode level.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.7 no.2
• /
• pp.21-26
• /
• 1989

This module to input Korean Level Data has 4 capacities of inputing, deleting, referencing and saving. Data file of level line consists of sorted list of node on the basis of “ABSTRACT”. For easy work, interactive method was employed. As the result of removing the boring routine by applying the characteristics of level data, working efficiency was increased. This program was written in C-language and runs on a minimum hardware configuration of IBM PC/XT with 640KB memory, In the future, these unit modules combine to form Generalized Level Information System.

• Journal of KIISE:Software and Applications
• /
• v.26 no.12
• /
• pp.1542-1552
• /
• 1999

자료 병렬성이란 자료 집합의 원소들에 대하여 동일한 작업을 동시에 수행하므로써 얻어지는 병렬성을 말한다. 함수형 언어에서 자료 집합에 대한 반복 수행은 재귀적 자료형에 대한 재귀 함수에 의하여 표현된다. 본 논문에서는 이러한 재귀 함수를 자료 병렬 프로그램으로 변환하기 위한 병렬화 방법을 제시한다. 생성되는 병렬 프로그램의 병렬 수행 구조로는 일반적인 형태의 재귀적 자료형에 대하여 정의되는 다형적인 자료 병렬 연산을 사용하여 트리, 리스트 등과 같은 일반적인 재귀적 자료 집합에 대한 자료 병렬 수행이 가능하도록 하였다. 재귀 함수의 병렬화를 위해서는, 함수를 이루는 각각의 계산들의 병렬성을 재귀 호출에 의해 존재하는 의존성에 기반하여 분류하고, 이에 기반하여 각각의 계산들에 대한 적절한 자료 병렬 연산을 사용하는 병렬 프로그램을 생성하였다.Abstract Data parallelism is obtained by applying the same operations to each element of a data collection. In functional languages, iterative computations on data collections are expressed by recursions on recursive data structures. We propose a parallelization method for data-parallel implementation of such recursive functions. We employ polytypic data-parallel primitives to represent the parallel execution structure of the object programs, which enables data parallel execution with general recursive data structures, such as trees and lists. To transform sequential programs to their parallelized versions, we propose a method to classify the types of parallelism in subexpressions, based on the dependencies of the recursive calls, and generate the data-parallel programs using data-parallel primitives appropriately.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.4
• /
• pp.55-62
• /
• 2016

In this paper, we propose the INDEM(Internet News Data Extraction Middleware) system for the removal of the unnecessary data in internet news. Although data on the internet can be used in various fields such as source of data of IR(Information Retrieval), Data mining and knowledge information service, it contains a lot of unnecessary information. The removal of the unnecessary data is a problem to be solved prior to the study of the knowledge-based information service that is based on the data of the web page. The INDEM system parses html and explores the XPath, and it is to perform the analysis. The user simply utilize INDEM by implementing an abstract class that provides INDEM, and can obtain the analysis information. INDEM System through this process delivers the analysis information including the main contents of news site to the users. In this paper, the INDEM system was adapted in a stand-alone and web service system and it was evaluated on the basis of 16 news site. As a result, performance of the INDEM system is affected in html source data size and complexity of used html grammar than the main news data size.

• 한국지형공간정보학회:학술대회논문집
• /
• 2002.03a
• /
• pp.119-129
• /
• 2002

The information system fields of spatial applications have rapidly grown during the last decade in Korea. Spatial data has been produced for a variety of systems without common standards until national GIS Committee defined the data exchange formats among spatial databases in the middle of 1990's. It aimed at promoting data sharing between the different systems in similar application fields. However, a considerable number of databases built prior to the introduction of the standards are not yet standard compliant but still play the roles of the main producers/consumers in the data collection field such as early developed huge AM/FM systems maintained by governmental organizations. The strong autonomy of these databases keeps their own data models, formats and descriptions from being standardized, which leads the sharing to a more difficult stage. Sharing is another way of data acquisition with least efforts and time away from direct collection. A data clearinghouse is the core module which directs users to the relevant data resources. The contents of datasets should be described with predefined metadata standards for precise indexing. Moreover, a number of technical problems have to be resolved for the common use of data between heterogeneous spatial database systems. However, the technical issues can be covered by the present information technologies. The difficulties persist in the political/institutional issues. Institutional issues are derived from the diverse sources such as political background, governmental policies, related laws and/or regulations. The paper will firstly make an analysis of current situation in terms of Korean policies, laws and regulations, secondly abstract the institutional issues from the situation analysis, lastly present guidelines for promoting spatial data sharing in Korea.

• Proceedings of the Zoological Society Korea Conference
• /
• 1998.10b
• /
• pp.346.2-346
• /
• 1998

No Abstract, See Full Text

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.32 no.E
• /
• pp.59-66
• /
• 1990

Abstract The formulation of the probabilistic finite element method was briefly reviewed. The method was implemented into a computer program for frame analysis which has the same analogy as finite element analysis. Another program for Monte Carlo simulation of finite element analysis was written. Two sample structures were assumed and analized. The characteristics of the second moment statistics obtained by the probabilistic finite element method was examined through numerical studies. The applicability and limitation of the method were also evaluated in comparison with the data generated by Monte Carlo simulation.

• Proceedings of the Zoological Society Korea Conference
• /
• 2001.10a
• /
• pp.259.2-259
• /
• 2001

No Abstract, See Full Text

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1997.04a
• /
• pp.190-195
• /
• 1997

Abstract: In this paper,an autoematic gear inspection system has been been developed using the computer aided vision system. Image processing and data analysis algorithms for gear inspection have been investigated and shown to perform quickly with high accuracy. As a result,dimensions of a gear can be measured upto few micrometer size in real time. In addition, the system can be applied to a practical manufacturing process even under nosiy conditions.

• 한국정보통신설비학회:학술대회논문집
• /
• 2009.08a
• /
• pp.266-267
• /
• 2009

According to researches [1], good image quality and amount of hiding information is a main point of steganography. In this point of view, [3] is a very good scheme to hide in an image. However, it cannot hide a lot of information. In order to solve this problem, we propose new method to hide more information than that of [3]. In addition, it can be reduced distortion of an image than that of [4]. Thus, our method is a very efficient and novel scheme.