• Proceedings of the Korea Water Resources Association Conference
• /
• 2008.05a
• /
• pp.1151-1154
• /
• 2008

The water level data sets among hydrologic observation data are correspond to the hydraulic head for each observation point and determine flow direction. The level difference among reservoir, river, and groundwater determines groundwater flow direction, just like water flows in the downstream direction because the water level of upstream point is higher than that of downstream point. We can analyze the relationship among the components in hydrologic cycle by comparing the water level differences. This research dealt with the data from Nakdong river watershed in Gyungsangnam-Do. Three data group are used for the analysis and onr group is composed of reservoir, river, and groundwater data sets. The data sets are closely(within 10 km) located in the interested area.

• Journal of KIISE:Software and Applications
• /
• v.30 no.12
• /
• pp.1239-1246
• /
• 2003

Registration is the process aligning the range data sets from different views in a common coordinate system. In order to achieve a complete 3D model, we need to refine the data sets after coarse registration. One of the most popular refinery techniques is the iterative closest point (ICP) algorithm, which starts with pre-estimated overlapping regions. This paper presents an improved ICP algorithm that can automatically register multiple 3D data sets from unknown viewpoints. The sensor projection that represents the mapping of the 3D data into its associated range image is used to determine the overlapping region of two range data sets. By combining ICP algorithm with the sensor projection constraint, we can make an automatic registration of multiple 3D sets without pre-procedures that are prone to errors and any mechanical positioning device or manual assistance. The experimental results showed better performance of the proposed method on a couple of 3D data sets than previous methods.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.11
• /
• pp.2335-2340
• /
• 2009

This paper presents how to implement Markerless Augmented Reality and how to create and apply reference data sets. There are three parts related with implementation: setting camera, creation of reference data set, and tracking. To create effective reference data sets, we need a 3D model such as CAD model. It is also required to create reference data sets from various viewpoints. We extract the feature points from the mode1 image and then extract 3D positions corresponding to the feature points using ray tracking. These 2D/3D correspondence point sets constitute a reference data set of the model. Reference data sets are constructed for various viewpoints of the model. Fast tracking can be done using a reference data set the most frequently matched with feature points of the present frame and model data near the reference data set.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.204-207
• /
• 2009

This paper presents how to implement Markerless Augmented Reality and how to create and apply reference data sets. There are three parts related with implementation: setting camera, creation of reference data set, and tracking. To create effective reference data sets, we need a 3D model such as CAD model. It is also required to create reference data sets from various viewpoints. We extract the feature points from the model image and then extract 3D positions corresponding to the feature points using ray tracking. These 2D/3D correspondence point sets constitute a reference data set of the model. Reference data sets are constructed for various viewpoints of the model. Fast tracking can be done using a reference data set the most frequently matched with feature points of the present frame and model data near the reference data set.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.9
• /
• pp.2256-2270
• /
• 1998

The development of a high perfoffilance index system is crucial for the retrieval of information from large sets o[ data. In this study, a minimal perfect hash function (MPHF), which hashes m keys to m buckets with no collisions, is revisited. The MOS algorithm developed bv Heath is modified to be successful for computing MPHFs of large sets of keys Also, a system for generating MPHFs for large sets of keys is developed. This system computed MPHFs for several large sets of data more efficiently than Heath's. The application areas for this system include those for generating MPHFs for the indexing of large and infrequently changing sets of data as well as information stored in a medium whose seek time is very slow.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.4
• /
• pp.546-549
• /
• 2007

When we deal with crisp data, it is common to find the correlation between variables. In this paper, we propose a method to calculate the correlation coefficient for intuitionistic fuzzy data, by adopting the concepts from the conventional statistics. The value of the correlation coefficient computed from our formula not only provides us the strength of the relationship of intuitionistic fuzzy sets, but also shows that the intuitionistic fuzzy sets are positively or negatively related.

• Genomics & Informatics
• /
• v.17 no.4
• /
• pp.39.1-39.20
• /
• 2019

Analyzing patterns in data points embedded in linear and non-linear feature spaces is considered as one of the common research problems among different research areas, for example: data mining, machine learning, pattern recognition, and multivariate analysis. In this paper, data points are heterogeneous sets of biosequences (composite data points). A composite data point is a set of ordinary data points (e.g., set of feature vectors). We theoretically extend the derivation of the largest generalized eigenvalue-based distance metric D_ij(γ₁) in any linear and non-linear feature spaces. We prove that D_ij(γ₁) is a metric under any linear and non-linear feature transformation function. We show the sufficiency and efficiency of using the decision rule $\bar{{\delta}}_{{\Xi}i}$(i.e., mean of D_ij(γ₁)) in classification of heterogeneous sets of biosequences compared with the decision rules min_𝚵iand median_𝚵i. We analyze the impact of linear and non-linear transformation functions on classifying/clustering collections of heterogeneous sets of biosequences. The impact of the length of a sequence in a heterogeneous sequence-set generated by simulation on the classification and clustering results in linear and non-linear feature spaces is empirically shown in this paper. We propose a new concept: the limiting dispersion map of the existing clusters in heterogeneous sets of biosequences embedded in linear and nonlinear feature spaces, which is based on the limiting distribution of nucleotide compositions estimated from real data sets. Finally, the empirical conclusions and the scientific evidences are deduced from the experiments to support the theoretical side stated in this paper.

• Journal of Navigation and Port Research
• /
• v.35 no.1
• /
• pp.1-7
• /
• 2011

This paper describes the development of Data Acquisition System (DAS) to obtain the vessel and weather information needing to evaluate collision risks levels between Mokpo harbor bridge and passing vessels. DAS consists of Signal Receiving and Processing Unit to obtain the data sets of passing vessels and weather status, Networking Unit to transmit and distribute the acquisition data sets and Data Management Unit. Through the field tests on the deck of shuttle car ferry between Mokpo Port Passenger Terminal and An-Jua island, Sinan-Gun, we found that the DAS can provide useful data sets for adequate the collision risk evaluation. In addition, the noise-like data sets appeared in the weather data can be suppressed fully using 5-th order Butterworth digital filter.

• Journal of Korean Society of Archives and Records Management
• /
• v.13 no.2
• /
• pp.149-178
• /
• 2013

Recently many countries have established data platforms to disclose government-owned data that include administrative data-sets and provide free access to the public via Web. This research analyzes the "Socrata" and "CKAN", the most popular representative open data platforms in the world, and reviews functions and their practical cases in operation in several cities of various nations. It also examines the current status of the data-set services in the City of Seoul to provide conceptual bases for management and service of the local governments' data-sets using open data platform. Then it suggests measures that ensure the long-term preservation and management of data-sets as archives for services, which includes the aspects of preparing systems, creating and managing data, providing services, and selecting platforms.

• The Journal of Korean Academic Society of Nursing Education
• /
• v.5 no.1
• /
• pp.72-85
• /
• 1999

The paper presents a review of three data sets(Uniform Hospital Discharge Data Set, Nursing Minimum Data Set, and Nursing Management Minimum Data Set) and six major nursing classifications(the North American Nursing Diagnoses Association Taxonomy I, Omaha System, Nursing Interventions Classification, Nursing Intervention Lexicon and Taxonomy, Nursing Outcome Classification, Nursing Outcomes Classification, and Classification of Patient Outcome). The reviewed data sets and nursing classifications were different from each other in the purpose, structure, and user. Nursing Interventions Classification and Nursing Outcomes Classification were linked to North American Nursing Diagnosis Association, but others not. The data set and nursing classifications need to be linked to other data sets and classifications.