• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.10 no.2
• /
• pp.63-71
• /
• 1992

The digital map database is often produced for multiple purposes, including mapping at multiple scales; it is increasingly rare that a base map is digitized for mapping at a single scale. The most important problems in process of line simplification in map generalization and multiple representation is that tolerance value selected for simplifying base map information must be modified as feature geometry varies within the digital file to ensure both accuracy and recognizability of graphic details on a generalized map. In this study, we explored various algorithms regarding to line simplication at many scales from a single digital file, and presents a rule by which to determine those scale at which line feature geometry might be expected to change in map representation. By applying two measured of displacement between a digitized line and its simplification, five algorithms have been evaluated. The results indicate that, of the five, the Douglas-Peucker routine produced less displacement between a line and its simplification. The research has proved to automating map simplification, incorporating numeric guidelines into digital environment about what magnitude and variation in geometric detail should be preserved as the digital data is simplified for representation at reduced map scales.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.2 s.314
• /
• pp.27-36
• /
• 2007

Changeable biometrics identify a person using transformed biometric data instead of original biometric data in order to enhance privacy and security in biometrics when biometric data is compromised. In this paper, a novel scheme which generates changeable face templates for statistical appearance-based face recognition is proposed. Two different original face feature vectors are extracted from two different appearance-based approaches, respectively, each original feature vector is normalized, and its elements are re-ordered. Finally a changeable face template is generated by weighted addition between two normalized and scrambled feature vectors. Since the two feature vectors are combined into one by a two to one mapping, the original two feature vectors are not easily recovered from the changeable face template even if the combining rule is known. Also, when we need to make new changeable face template for a person, we change the re-ordering rule for the person and make a new feature vector for the person. Therefore, the security and privacy in biometric system can be enhanced by using the proposed changeable face templates. In our experiments, we analyze the proposed method with respect to performance and security using an AR-face database.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.6
• /
• pp.1-10
• /
• 2005

This paper describes the implementation of HTML converter for wireless internet access in wireless application protocol environment. The implemented HTML converter consists of the contents conversion module, the conversion rule set, the WML file generation module, and the frame contents reformatting module. Plain text contents are converted to WML contents through one by one mapping, referring to the converting rule set in the contents converting module. For frame contents, the first frameset sources are parsed and the request messages are reconstructed with all the file names, reconnecting to web server as much as the number of files to receive each documents and append to the first document. Finally, after the process of reformatting in the frame contents reformatting module, frame contents are converted to WML's table contents. For image map contents, the image map related tags are parsed and the names of html documents which are linked to any sites are extracted to be replaced with WML contents data and linked to those contents. The proposed conversion method for frame contents provides a better interface for the users convenience and interactions compared to the existing converters. Conversion of image maps in our converter is one of the features not currently supported by other converters.

• Journal of Intelligence and Information Systems
• /
• v.18 no.3
• /
• pp.137-152
• /
• 2012

In the generation of Web 2.0, as many users start to make lots of web contents called user created contents by themselves, the World Wide Web is overflowing by countless information. Therefore, it becomes the key to find out meaningful information among lots of resources. Nowadays, the information retrieval is the most important thing throughout the whole field and several types of search services are developed and widely used in various fields to retrieve information that user really wants. Especially, the legal information search is one of the indispensable services in order to provide people with their convenience through searching the law necessary to their present situation as a channel getting knowledge about it. The Office of Legislation in Korea provides the Korean Law Information portal service to search the law information such as legislation, administrative rule, and judicial precedent from 2009, so people can conveniently find information related to the law. However, this service has limitation because the recent technology for search engine basically returns documents depending on whether the query is included in it or not as a search result. Therefore, it is really difficult to retrieve information related the law for general users who are not familiar with legal terms in the search engine using simple matching of keywords in spite of those kinds of efforts of the Office of Legislation in Korea, because there is a huge divergence between everyday words and legal terms which are especially from Chinese words. Generally, people try to access the law information using everyday words, so they have a difficulty to get the result that they exactly want. In this paper, we propose a term mapping methodology between everyday words and legal terms for general users who don't have sufficient background about legal terms, and we develop a search service that can provide the search results of law information from everyday words. This will be able to search the law information accurately without the knowledge of legal terminology. In other words, our research goal is to make a law information search system that general users are able to retrieval the law information with everyday words. First, this paper takes advantage of tags of internet blogs using the concept for collective intelligence to find out the term mapping relationship between everyday words and legal terms. In order to achieve our goal, we collect tags related to an everyday word from web blog posts. Generally, people add a non-hierarchical keyword or term like a synonym, especially called tag, in order to describe, classify, and manage their posts when they make any post in the internet blog. Second, the collected tags are clustered through the cluster analysis method, K-means. Then, we find a mapping relationship between an everyday word and a legal term using our estimation measure to select the fittest one that can match with an everyday word. Selected legal terms are given the definite relationship, and the relations between everyday words and legal terms are described using SKOS that is an ontology to describe the knowledge related to thesauri, classification schemes, taxonomies, and subject-heading. Thus, based on proposed mapping and searching methodologies, our legal information search system finds out a legal term mapped with user query and retrieves law information using a matched legal term, if users try to retrieve law information using an everyday word. Therefore, from our research, users can get exact results even if they do not have the knowledge related to legal terms. As a result of our research, we expect that general users who don't have professional legal background can conveniently and efficiently retrieve the legal information using everyday words.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.1
• /
• pp.68-75
• /
• 2009

As the recent performance of microprocessor is improving quickly, the necessity of cache is growing because of the increase of the access time of main memory. Every block of direct-mapped cache maps to one cache line. Although the mapping rule is simple, if different blocks map to one cache line, the miss ratio will be higher than the set-associative cache due to conflicts. In this paper, for the improvement of the direct-mapped cache of OpenRISC, 4-way set-associative cache is proposed. Four blocks of the main memory of the proposed cache map to one cache line so that the miss ratio is less than the direct-mapped cache. Pseudo-LRU Policy, which is one of the Line Replacement Policies, is used for decreasing the number of bits that store LRU value. The OpenRISC core including the 4-way set-associative cache was verified with FPGA emulation. As the result of performance measurement using test program, the performance of the OpenRISC core including the 4-way set-associative cache is higher than the previous one by 50% and the decrease of miss ratio is more than 15%.

• The Journal of Korean Physical Therapy
• /
• v.28 no.5
• /
• pp.321-327
• /
• 2016

Purpose: The purpose was to link items of questionnaires that measure functioning and disability of persons with Low Back Pain (LBP) into the International Classification of Functioning, Disability and Health (ICF). Methods: The Oswestry Disability Index (ODI), Roland and Morris Disability Questionnaire (RM), Fear-Avoidance Beliefs Questionnaire (FABQ), and Short Form-36 health survey (SF-36) were evaluated to map items of those questionnaires into the ICF categories. The linking rule was employed and linking was performed independently by 10 health professionals. One-hundred and two patients with LBP were recruited from 19 medical institutes to this study for a field test to examine relations between the scale and its linked ICF category set. Pearson correlation coefficient was used to analyze their relationships. Results: Walking was only found to be one-to-one linking between the scale and the ICF. Sixty questions in FABQ were to be linked to 9 of ICF categories. Ten and 14 ICF categories were able to be linked to RM and ODI respectively. It was found that majority of items from ODI and RM scale had similar concept and linked to the same ICF category. SF-36 had only 15 categories of the ICF linked. Strong relationship was observed between measurement scales and linked ICF code sets (r=0.79, r=0.65, r=0.47, and r=-0.31 for ODI, RM, FABQ and SF-36 respectively). Conclusion: It was found that commonly used clinical tools for LBP may be linked to ICF. The study results may suggest that clinical data can be standardized to communicate between related professionals.

• Journal of KIISE:Databases
• /
• v.27 no.2
• /
• pp.227-237
• /
• 2000

A Web database System is a large-scaled multimedia application system that has multimedia processing facilities and cooperates with relational/Object-Oriented DBMS. Conventional hypertext modeling methods and DB gateway have limitations for Web database because of their restricted versatile presentation abilities and inefficient concurrency control caused by bottleneck in cooperation processing. Thus, we suggest a Dynamic Navigation Model & Virtual Graph Structure. The Dynamic Navigation Model supports implicit query processing and dynamic creation of navigation spaces, and introduce node-link creation rule considering navigation styles. We propose a mapping methodology between the suggested hypertext model and the relational data model, and suggest a dynamic allocation scheduling technique for query processing server based on weighted value. We show that the proposed technique enhances the retrieval performance of Web database systems in processing complex queries concurrently.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.25 no.6_1
• /
• pp.545-555
• /
• 2007

3D buildings are the most prominent feature comprising urban scene. A few of mega-cities in the globe are virtually reconstructed in photo-realistic 3D models, which becomes accessible by the public through the state-of-the-art online mapping services. A lot of research efforts have been made to develop automatic reconstruction technique of large-scale 3D building models from remotely sensed data. However, existing methods still produce irregular building polygons due to errors induced partly by uncalibrated sensor system, scene complexity and partly inappropriate sensor resolution to observed object scales. Thus, a geometric regularization technique is urgently required to rectify such irregular building polygons that are quickly captured from low sensory data. This paper aims to develop a new method for regularizing noise building outlines extracted from airborne LiDAR data, and to evaluate its performance in comparison with existing methods. These include Douglas-Peucker's polyline simplication, total least-squared adjustment, model hypothesis-verification, and rule-based rectification. Based on Minimum Description Length (MDL) principal, a new objective function, Geometric Minimum Description Length (GMDL), to regularize geometric noises is introduced to enhance the repetition of identical line directionality, regular angle transition and to minimize the number of vertices used. After generating hypothetical regularized models, a global optimum of the geometric regularity is achieved by verifying the entire solution space. A comparative evaluation of the proposed geometric regulator is conducted using both simulated and real building vectors with various levels of noise. The results show that the GMDL outperforms the selected existing algorithms at the most of noise levels.

• Journal of The Korean Association For Science Education
• /
• v.17 no.4
• /
• pp.461-479
• /
• 1997

The concept map is the diagram of two dimensions which hierachically arrays main concepts from those of the textbook and shows their relations. The research analyzed five of the ten high school earthscience textbooks approved by the Minister of Education according to the 6th reformed curriculum in 1995, one of which this research chose to make out the concept maps. The chapter [III. the Universe] contains the outer space of the earth presents new concepts about the stars and the universe and introduces the latest research in astronomy. This study changed textbook contents into Novak's concept map, searched for concepts requiring complement for learners in oder to obtain concepts from those of the textbook and pointed out problems on the basis of that result still better concept map is set up. We have the following conclusions. First, it is necessary to rule out unnecessary small units so as to make more effective understanding and to rearrange the units to have relation to contents. Second, the higher concept and lower concept need to be rearranged systematically in making an array of textbook contents. Third, the concept should have something to do with learners' experences and consciousness by showing learners the real examples relevant to the concept for the link between them.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.2
• /
• pp.126-135
• /
• 2002

The study is concerned with an approach to the design of new architectures of fuzzy neural networks and the discussion of comprehensive design methodology supporting their development. We propose an Adaptive Fuzzy Polynomial Neural Networks(APFNN) based on Fuzzy Neural Networks(FNN) and Self-organizing Networks(SON) for model identification of complex and nonlinear systems. The proposed AFPNN is generated from the mutually combined structure of both FNN and SON. The one and the other are considered as the premise and the consequence part of AFPNN, respectively. As the premise structure of AFPNN, FNN uses both the simplified fuzzy inference and error back-propagation teaming rule. The parameters of FNN are refined(optimized) using genetic algorithms(GAs). As the consequence structure of AFPNN, SON is realized by a polynomial type of mapping(linear, quadratic and modified quadratic) between input and output variables. In this study, we introduce two kinds of AFPNN architectures, namely the basic and the modified one. The basic and the modified architectures depend on the number of input variables and the order of polynomial in each layer of consequence structure. Owing to the specific features of two combined architectures, it is possible to consider the nonlinear characteristics of process system and to obtain the better output performance with superb predictive ability. The availability and feasibility of the AFPNN are discussed and illustrated with the aid of two representative numerical examples. The results show that the proposed AFPNN can produce the model with higher accuracy and predictive ability than any other method presented previously.