• Proceedings of the Korean Society of Computer Information Conference
• /
• 2020.07a
• /
• pp.561-562
• /
• 2020

연구에서, k-Mean 군집화에 기반 한 다중 집단이 다수의 전략의 앙상블을 실현하기 위해 제안되어, 모집단의 유사한 개체가 동일한 돌연변이 전략을 구현하는 새로운 DE 변이체, 즉 KSDE를 생성하고 유사하지 않은 하위 집단 소프트 아일랜드 모델(SIM)을 통해 정보를 마이그레이션 한다.

• Journal of the Korean Society for Library and Information Science
• /
• v.47 no.1
• /
• pp.105-124
• /
• 2013

Metadata standardization of resources, having a heterogeneous metadata structure for each presidential archive and presidential library and museum is preferentially required for utilizing and sharing presidential records. An integrated operation model of metadata to manage various types of presidential records is then needed. The purpose of this study is to create a design principle of integrated metadata, and to suggest relationships and attributes of metadata, needed for developing integrated metadata operation system on presidential records. The design principle includes "creation of relationship among presidential records", "design of each entity, applicable multiple entity data model", "design to describe various types of presidential records", "design to reflect lifelong management on records of holding institutes", and "designing hybrid metadata for long term preservation". Metadata element set consists of elements for common attributes with all types of presidential records for a unique attribute for a specific presidential record and for reference information among different records related to the production of presidential records.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.5
• /
• pp.441-449
• /
• 2000

Binary volume data has its widespread use in the application of color volume rendering and surgical simulation system where gray-scale volume is inappropriate. For the efficient representation of binary volume, this paper proposes a new data structure - the Slice-based Binary Shell (SBS) - along with its rendering algorithm. Since SBS stores the minimal set of surface voxels in slice order and supports the direct computation of voxel coordinates, it shows high efficiency for rendering multiple objects. The rendering algorithm of SBS running on a PC with no specialized hardware renders more than one hundred binary objects in a second.

• Journal of Korea Multimedia Society
• /
• v.12 no.10
• /
• pp.1499-1507
• /
• 2009

With the abundance of digital contents, the necessity of precise indexing technology is consistently required. To meet these requirements, the intelligent software entity needs to be the subject of information retrieval and the interoperability among intelligent entities including human must be supported. In this paper, we analyze the unifying framework for multi-modality indexing that Snoek and Worring proposed. Our work investigates the method of improving the authenticity of indexing information in contents-based automated indexing techniques. It supports the creation and control of abstracted high-level indexing information through ontological concepts of Semantic Web skills. Moreover, it attempts to present the fundamental model that allows interoperability between human and machine and between machine and machine. The memory-residence model of processing ontology is inappropriate in order to take-in an enormous amount of indexing information. The use of ontology repository and inference engine is required for consistent retrieval and reasoning of logically expressed knowledge. Our work presents an experiment for storing and retrieving the designed knowledge by using the Minerva ontology repository, which demonstrates satisfied techniques and efficient requirements. At last, the efficient indexing possibility with related research is also considered.

• Journal of the Korean Data and Information Science Society
• /
• v.27 no.3
• /
• pp.711-724
• /
• 2016

Under variable complex operating environment, various factors can affect the lifetimes of systems. In this research, we study bivariate reliability models having multiple dynamic competing risks. As competing risks, in addition to the natural failure, we consider the increased stress caused by the failure of one component, external shocks, and the level of stress of the working environment at the same time. Considering two reliability models which take into account all of these competing risks, we derive bivariate life distributions. Furthermore, we compare these two models and also compare the distributions of maximum and minimum statistics in the two models.

• The Sea:JOURNAL OF THE KOREAN SOCIETY OF OCEANOGRAPHY
• /
• v.2 no.1
• /
• pp.42-47
• /
• 1997

This study was carried out to investigate the faunal composition and distribution pattern of meiobenthic community in the deep sea sediments of northeastern Pacific Ocean. Faunal samples were collected at 10 stations using a multiple corer and a spade type box corer during May 1996. A total of 18 meiofaunal groups were found, and Sarcomastigophora was the most dominant group which accounted for 35.8% of total meiofaunal abundance. Nematoda (30.8%), Nauplius larvae of Crustacea (11.9%), Ciliophora (6.8%) and Harpacticoida (3.0%) which were also important components of the meiofaunal community. All of these five faunal groups comprised more than 90% of total meiofauna. The highest density of 195 ind./10 $cm^2$ was found at St. 4 (4960 m water depth), but the lowest one, 85 ind./10 $cm^2$ at St. 1 (4969 m water depth). The overall mean density of meiofauna was estimated as $1.34{\times}10^5\;ind./m^2$. The abundance of meiofauna showed a slow decreasing trend along the water depth. The highest density was observed in the upper 1 cm and density decreased drastically with increasing depth from the surface.

• Journal of Animal Environmental Science
• /
• v.7 no.3
• /
• pp.183-190
• /
• 2001

The objective of this research was to design and construct an image processing system to measure easily and accurately cow's weight. The image processing system was built for a dairy cattle to be measured and estimated it's weight using camera and personal computer. The pixel numbers, which was derived from the image processing system, were counted to estimate the weight of a dairy cattle. They were utilized various was for finding the relationships between pixel numbers and it's real weight. Based on the results of this research the following conclusions were made: 1. It's weight could be estimated by using pixel numbers, which was captured from top and side cameras to measure it. The correlations with tea-view pixel numbers, side-view pixel numbers, superficial area pixel numbers and the volume pixel numbers were 0.909, 0.939, 0.944 and 0.965. 2. 50 cattle was used to execute an experiment with the image processing system, but average errors were big to make out the good relationship between cow's weight and pixel numbers. In order measure accurately a cattle weight, cattle weight, cattle groups would be divided by the age of cattle and further study should be carried out to be based on the results of this research. 3. The average time it took to perform the image processing to be measure it was 10 seconds, but it took 10 minutes for cattle to enter for measuring it's weight into the weighting system.

• Journal of Plant Biotechnology
• /
• v.29 no.3
• /
• pp.209-215
• /
• 2002

Four kinds of kalosaponins from inner bark of Kalopanax pictus Nakai as a medicinal and edible timber tree species growing in Korea was analyzed by HPLC. A considerable range of variation in the contents was observed among population. The kalosaponins contents in inner bark from each population were the highest in the Mt. Barwang (30.37 mg/g on the dry weight basis) followed by Mt. Gariwang, Hanra II, Mangun, Paltan, and Hanra II population. Growth factors that might have influenced the contents of the kalosaponins were also examined. As both analysis results of partial correlation and multiple regression, the weight of inner bark and tree age were influenced the kalosaponin O contents. The kalosaponin B contents was influenced by both the weight of inner layer bark and annual mean DBH increment. The contents of kalosaponins appeared to be closely related to the inner bark characteristics.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.25 no.4
• /
• pp.347-354
• /
• 2007

Since large portal service providers started web services for 3D city models around the world using spatial imagery, the competition has been getting intense to provide the models with the higher quality and accuracy. The building models are the most in number among the 3D city model objects, and it takes much time and money to create realistic model due to various shapes and visual appearances of building object. The aforementioned problem is the most significant limitation for the service and the update of the 3D city model of the large area. This study proposed a method of generating realistic 3D building models with quick and economical texture mapping using multiple spatial imagery such as aerial photos or satellite images after reconstructed geometric models of buildings from building layers in digital maps. Based on the experimental results, the suggested method has effectiveness for the generation of the 3D building models using various air-borne imagery and satellite imagery quickly and economically.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.2
• /
• pp.135-148
• /
• 2000

In this paper, we present a linear scheduling method for homogeneous multiprocessor systems using genetic algorithms. In general, genetic algorithms randomly generate initial strings, which leads to long operation time and slow convergence due to an inappropriate initialization. The proposed algorithm considers communication costs among processors and generates initial strings such that successive nodes are grouped into the same cluster. In the crossover and mutation operations, the algorithm maintains linearity in scheduling by associating a node with its immediate successor or predecessor. Linear scheduling can fully utilize the inherent parallelism of a given program and has been proven to be superior to nonlinear scheduling on a coarse grain DAG (directed acyclic graph). This paper emphasizes the usability of the genetic algorithm for real-time applications. Simulation results show that the proposed algorithm rapidly converges within 50 generations in most DAGs.