• The KIPS Transactions:PartB
• /
• v.14B no.7
• /
• pp.481-492
• /
• 2007

In this paper, a method for automatic indexing of contents to reduce effort for inputting paper information and constructing index is considered. Existing document analysis methods can't analyse various table of contents of journal paper formats efficiently because they have many exceptions. In this paper, various contents formats for journals, which have different features from those for general documents, are analysed and described. The principal elements that we want to represent are titles, authors, and pages for each papers. Thus, the three principal elements are modeled according to the order of their arrangement, and their features are extracted. And a table of content recognition system of journal is implemented, based on the proposed modeling method. The accuracy of exact extraction ratio of 91.5% on title, author, and page type on 660 published papers of various journals is obtained.

• Journal of Korean Society for Geospatial Information Science
• /
• v.15 no.3
• /
• pp.27-32
• /
• 2007

3D based information is demanded increasingly as cities grow three dimensionally and buildings become large and complex. The use of 3D GIS is also getting attention as fundamental data for ubiquitous computing applications such as location-based guidance, path finding and emergency escaping. However, most 3D modeling techniques are focused on the visualization of buildings or terrains and do not have topological structures required in spatial analyses. In this paper, we introduce a method to incorporate topological relationship into 3D models by combining 2D GIS layers and 3D model. We divide indoor spaces of a 3D model into discrete objects and then define the relationship with corresponding features in 2D GIS layers through database records. We also show how to construct hallways network in the 2D-3D integrated building model. Finally, we test different cases of route finding situations inside a building such as normal origin-destination path finding and emergency evacuation.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.1
• /
• pp.141-146
• /
• 2018

The authors' author keywords are the most important elements that characterize the contents of the paper, By analyzing this in real time and providing it to users, It is possible to grasp research trends. Unstructured data of a journal created in a paper is constructed as a database, make use of this to make index data structure that can search in real time. In the index data structure, a thesis containing a specific keyword is searched, By extracting and clustering the author keywords, By presenting to the user a word cloud that can be displayed by size according to the weight, designed a method to visualize research trends. We also present the results of the research trend analysis of the keywords "virus" and "iris recognition" in the implemented system.

• Journal of the Korea institute for structural maintenance and inspection
• /
• v.9 no.1
• /
• pp.259-269
• /
• 2005

This paper describes the application of genetic algorithm for the discrete optimum design of reinforced concrete continuous beams. The objective is to minimize the total cost of reinforced concrete beams including the costs of concrete, form work, main reinforcement and stirrup. The flexural and shear strength, deflection, crack, spacing of reinforcement, concrete cover, upper-lower bounds on main reinforcement, beam width-depth ratio and anchorage for main reinforcement are considered as the constraints. The width and effective depth of beam and steel area are taken as design variables, and those are selected among the discrete design space which is composed with dimensions and steel area being used from in practice. Optimum result obtained from GA is compared with other literature to verify the validity of GA. To show the applicability and efficiency of GA, it is applied to three and five span reinforced concrete beams satisfying with the Korean standard specifications.

• Journal of the Korea institute for structural maintenance and inspection
• /
• v.26 no.2
• /
• pp.37-42
• /
• 2022

The dual potential capacity model (DPCM) was extended to be suitable for evaluation of the shear strength of prestressed concrete (PSC) members in the previous study. This paper aims to simplify the DPCM for its better application in practice. To this end, a total of 172 shear test results of PSC members without shear reinforcement were collected from existing studies. The collected shear test results include PSC members with various section types and prestressing methods. It appeared that the simplified model could provide a good level of estimation accuracy of shear strength of PSC members, and it was comparable with that provided from the original DPCM.

• Journal of Internet Computing and Services
• /
• v.16 no.1
• /
• pp.67-74
• /
• 2015

In recent years, frequent itemset mining for considering the importance of each item has been intensively studied as one of important issues in the data mining field. According to strategies utilizing the item importance, itemset mining approaches for discovering itemsets based on the item importance are classified as follows: weighted frequent itemset mining, frequent itemset mining using transactional weights, and utility itemset mining. In this paper, we perform empirical analysis with respect to frequent itemset mining algorithms based on transactional weights. The mining algorithms compute transactional weights by utilizing the weight for each item in large databases. In addition, these algorithms discover weighted frequent itemsets on the basis of the item frequency and weight of each transaction. Consequently, we can see the importance of a certain transaction through the database analysis because the weight for the transaction has higher value if it contains many items with high values. We not only analyze the advantages and disadvantages but also compare the performance of the most famous algorithms in the frequent itemset mining field based on the transactional weights. As a representative of the frequent itemset mining using transactional weights, WIS introduces the concept and strategies of transactional weights. In addition, there are various other state-of-the-art algorithms, WIT-FWIs, WIT-FWIs-MODIFY, and WIT-FWIs-DIFF, for extracting itemsets with the weight information. To efficiently conduct processes for mining weighted frequent itemsets, three algorithms use the special Lattice-like data structure, called WIT-tree. The algorithms do not need to an additional database scanning operation after the construction of WIT-tree is finished since each node of WIT-tree has item information such as item and transaction IDs. In particular, the traditional algorithms conduct a number of database scanning operations to mine weighted itemsets, whereas the algorithms based on WIT-tree solve the overhead problem that can occur in the mining processes by reading databases only one time. Additionally, the algorithms use the technique for generating each new itemset of length N+1 on the basis of two different itemsets of length N. To discover new weighted itemsets, WIT-FWIs performs the itemset combination processes by using the information of transactions that contain all the itemsets. WIT-FWIs-MODIFY has a unique feature decreasing operations for calculating the frequency of the new itemset. WIT-FWIs-DIFF utilizes a technique using the difference of two itemsets. To compare and analyze the performance of the algorithms in various environments, we use real datasets of two types (i.e., dense and sparse) in terms of the runtime and maximum memory usage. Moreover, a scalability test is conducted to evaluate the stability for each algorithm when the size of a database is changed. As a result, WIT-FWIs and WIT-FWIs-MODIFY show the best performance in the dense dataset, and in sparse dataset, WIT-FWI-DIFF has mining efficiency better than the other algorithms. Compared to the algorithms using WIT-tree, WIS based on the Apriori technique has the worst efficiency because it requires a large number of computations more than the others on average.

• Journal of the Korea Computer Industry Society
• /
• v.7 no.5
• /
• pp.495-502
• /
• 2006

This paper describes how to implement reporting system for web-based information system. Reporting system is the S/W module that user is able to produce output of data in formal format. In Client/Server system, remote user can make formal output with client-side reporting component module. This client reporting component is usually system dependent. With web based information system, intranet, evolving, this client/server system need to he migrated to web-based reporting system. Reporting system component support multi-processing and real-time text/graphic output of server data. Ant Client can save or pint web page of client module. Especially, for real test its function and user interface, this reporting component is adopted in real network management system. The result shows that this reporting system component is very smart and excellent for real time web based monitoring system.

• Annual Conference on Human and Language Technology
• /
• 1997.10a
• /
• pp.416-420
• /
• 1997

다양한 응용 목적의 대규모 실용적 언어지식 구축을 위해서는 한국어의 모든 언어현상을 수용할 수 있는 이상적인 언어지식(optimal linguistic knowledge) 획득을 목표로 연구해 나가야 한다. 본 연구에서 언어지식의 획득은 주어진 말뭉치의 분석을 통해 이루어진다. 주어진 말뭉치에서 새로운 언어현상이 발견되었을 경우, 기존의 언어지식은 새로운 언어현상을 수용할 뿐만 아니라 기존에 발견되었던 언어현상도 함께 수용할 수 있도록 바뀌어져야 한다. 이러한 변화의 원칙이 보장되어야만 언어지식의 양적 확장과 함께 질적 확장을 이룰 수 있다. 본 연구에서는 언어지식의 질적 확장을 언어지식의 수렴성이라고 정의하고 수렴성 보장을 위한 방법론을 연구한다. 수렴성 보장을 위해서는 먼저 언어지식 획득과정이 공정화, 자동화되어야 하고 언어지식이 변화할 때 수렴을 확인하는 과정이 필요하다. 수렴을 확인하기 위하여 구문구조 데이터베이스와 역사전(Inverted Dictionary)을 이용하는 방법을 제안한다. 지금까지는 언어지식의 양적 확장에만 치중해 왔으나 본 연구에서 제안된 방법으로 언어지식이 구축된다면 질적 확장도 함께 도모할 수 있을 것으로 기대된다.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.14 no.2
• /
• pp.219-228
• /
• 1996

The list of the titles of surveying-related papers and books is updated by adding newly polished paper/book titles to the existing one. A special title-search program is developed for managing and searching the surveying-re-lated paper/book titles, and the database is established from the list of the papers. The total number of papers/books in surveying-related field published in Korea upto now is 971. The number of papers/books published in the specific fields are 206 in the conventional surveying field, 218 in Photogrammetry, 183 in Remote Sensing, 127 in Geodesy and GPS, and 237 in Digital Mapping and GIS. The special title-search program is developed using the Visual Basic 3.0 for Windows 3.1 to be operated in the Window environment. The SQL(Structured Query Language) is used for the searching commands.

• Journal of the Korean Society for information Management
• /
• v.26 no.4
• /
• pp.7-34
• /
• 2009

Structures of stories, paragraphs, and sentences and inferences applied to indexing and searching were studied to construct the full-text and sentence retrieval system for storytelling. The system designed the database of stories, paragraphs, and sentences and the knowledge-base of inference rules to aid to write the story. The Knowledge-base comprised the files of story frames, paragraph scripts, and sentence logics made by mark-up languages like SWRL etc. able to operate in semantic web. It is necessary to establish more precise indexing language represented the sentences and to create a mark-up languages able to construct more accurate inference rules.