• 한국도서관정보학회지
• /
• 제15권
• /
• pp.113-151
• /
• 1988

The enumerative classification schemes do not represent the tiny mass of knowledge embodied in a article in a periodical or in a chapter or a paragraph of a book. But today's information centers regard a tiny spot of knowledge embodied in a article as a class. we call this micro-thought. But the enumerative classification are manual systems, it cannot be a n.0, pplied to the automation of classification. The purpose of this study is to build a general principle for the automatic book-classification which can be put to use in library operation, and to present a methodology of the automatic classification for the library. The methodology used is essentially theoretical, Published works by and about Ranganathan, especially 6th edition of the CC were studied, analyzed. The principle of automatic book classification derived from the analysis of colon classification and facet combinations. The results of this study can be summarized as follows ; (1) This study confined the fields of library science and agriculture. (2) This study represent a general principles for the automatic book classification of library science and agriculture. (3) Program flowcharts are designed as a basis of system analysis and program procedure in library science and agriculture. (4) The principles of the automatic classification in library, science is different from that of agriculture. (5) Automatic book classification can be performed by the principle of faceted classification, by inputting the title and subject code into a computer. In addition, the expected value from the automatic book-classification is as follows (1) The prompt and accurate of classification is possible. (2) Though a book is classified in any library, it can have same classification number. (3) The user can retrieve the classification code of a book for which he or she wants to search through dialogue with the computer. (4) Since the concept coordination method is employed, a tiny mass of knowledge embodied in a article in a periodical or in a chapter or a paragraph of a book can be represented as a class. (5) By performing automatic book-classification, the automation of library operation can be completed.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 ISIS 2003
• /
• pp.439-442
• /
• 2003

In order to solve the difficulties of parameter settings in SA algorithm, an improved practical SA algorithm is proposed by employing the threading techniques, appropriate software structures, and dynamic adjustments of temperature parameters. Threads provide a mechanism to realize a parallel processing under a disperse environment by controlling the flux of internal information of an application. Thread services divide a process by multiple processes leading to parallel processing of information to access common data. Therefore, efficient search is achieved by multiple search processes, different initial conditions, and automatic temperature adjustments. The proposed are methods are evaluated, for three types of Traveling Salesman Problem (TSP) (random-tour, fractal-tour, and TSPLIB test data)are used for the performance evaluation. The experimental results show that the computational time is 5％ decreased comparing to conventional SA algorithm, furthermore there is no need for manual parameter settings. These results also demonstrate that the proposed method is applicable to real-world vehicle routing problems.

• Journal of Electrical Engineering and Technology
• /
• 제3권1호
• /
• pp.43-51
• /
• 2008

Evolutionary Algorithms (EAs) cover all the applications involving the use of Evolutionary Computation in electronic system design. It is largely applied to complex optimization problems. EAs introduce a new idea for automatic design of electronic systems; instead of imagine model, ions, and conventional techniques, it uses search algorithm to design a circuit. In this paper, a method for automatic optimization of the digital circuit design method has been introduced. This method is based on randomized search techniques mimicking natural genetic evolution. The proposed method is an iterative procedure that consists of a constant-size population of individuals, each one encoding a possible solution in a given problem space. The structure of the circuit is encoded into a one-dimensional genotype as represented by a finite string of bits. A number of bit strings is used to represent the wires connection between the level and 7 types of possible logic gates; XOR, XNOR, NAND, NOR, AND, OR, NOT 1, and NOT 2. The structure of gates are arranged in an $m{\times}n$ matrix form in which m is the number of input variables.

• 정보보호학회논문지
• /
• 제26권6호
• /
• pp.1421-1430
• /
• 2016

본 논문에서 우리는 ARX 구조를 가지는 블록 암호에 대한 차분 경로 탐색을 효율적으로 수행하는 방법에 대해 제안한다. 우리는 두 가지 기법을 이용하여 A. Biryukov 등이 제안한 차분 경로 자동 탐색하는 알고리즘을 최적화하였고, 이를 블록 암호 SPECK에 적용하여 Birykov의 결과보다 2~3배 향상된 결과를 얻었다. 이는 ARX 구조를 가지는 블록 암호에 대한 기제안된 결과보다 더 좋은 차분 경로를 찾는데 도움을 줄 수 있다.

• International Journal of Automotive Technology
• /
• 제7권3호
• /
• pp.361-367
• /
• 2006

This paper describes a novel stereo vision based localization of free parking site, which recognizes the target position of automatic parking system. Pixel structure classification and feature based stereo matching extract the 3D information of parking site in real time. The pixel structure represents intensity configuration around a pixel and the feature based stereo matching uses step-by-step investigation strategy to reduce computational load. This paper considers only parking site divided by marking, which is generally drawn according to relevant standards. Parking site marking is separated by plane surface constraint and is transformed into bird's eye view, on which template matching is performed to determine the location of parking site. Obstacle depth map, which is generated from the disparity of adjacent vehicles, can be used as the guideline of template matching by limiting search range and orientation. Proposed method using both the obstacle depth map and the bird's eye view of parking site marking increases operation speed and robustness to visual noise by effectively limiting search range.

• 대한기계학회논문집A
• /
• 제25권6호
• /
• pp.1004-1014
• /
• 2001

The fully automatic algorithm from initial finite element mesh generation to remeshing in two dimensional geometry is introduced using bubble packing method (BPM) for finite element analysis. BPM determines the node placement by force-balancing configuration of bubbles and the triangular meshes are made by Delaunay triangulation with advancing front concept. In BPM, we suggest two node-search algorithms and the adaptive/recursive bubble controls to search the optimal nodal position. To use the automatically generated mesh information in FEA, the new enhanced bandwidth minimization scheme with high efficiency in CPU time is developed. In the remeshing stage, the mesh refinement is incorporated by the control of bubble size using two parameters. And Superconvergent Patch Recovery (SPR) technique is used for error estimation. To verify the capability of this algorithm, we consider two elasticity problems, one is the bending problem of short cantilever beam and the tension problem of infinite plate with hole. The numerical results indicate that the algorithm by BPM is able to refine the mesh based on a posteriori error and control the mesh size easily by two parameters.

• 한국컴퓨터정보학회:학술대회논문집
• /
• 한국컴퓨터정보학회 2020년도 제61차 동계학술대회논문집 28권1호
• /
• pp.161-162
• /
• 2020

기존의 카트는 마트를 이용하는 소비자들의 편의를 위해 스마트 카트를 고안하게 되었다. 기존에 대형 마트를 이용할 때 소비자들은 찾고 싶은 제품이 있으면 직접 찾아다니거나 매장에 있는 직원들에게 찾아가 원하는 제품을 물어봐야 하는 불편함이 있었고, 세일 품목 등 직접 알아봐야 하는 불편함이 있었다. 또한 계산을 할 때 줄을 서서 기다려야 하는 등 시간 또한 오래 걸리는 불편함이 있었다. 본 논문은 이러한 문제점들을 개선하고 보완하기 위해서 기존 카트에 검색기능과 자동계산이 가능한 프로그램을 장착한 '물품검색과 자동계산이 가능한 스마트카트' 기술을 제안한다. 소비자들이 쉽고 빠르게 제품을 찾을 수 있게 도움을 주고, 소비자들이 스마트 카트를 통해 원하는 물품을 검색하게 되면 해당 상품의 가격과 위치, 정보 등 여라 가지의 데이터를 제공하고, 스마트 카트에 바코드스캐너를 장착하여 소비자가 구매하고자 하는 물품들을 바코드 스캐너를 사용해 스캔하면 디스플레이에 현시점까지의 물품들의 총 가격을 합산 해줌으로써 소비자들이 더욱 효율적인 소비를 할 수 있게 도움을 준다.

• 한국전자거래학회지
• /
• 제14권4호
• /
• pp.167-179
• /
• 2009

본 논문에서는 태그 온톨로지를 이용하여 표준화된 태그를 추천할 수 있는 기법을 제안하였다. 태그 추천 기법은 기존에 생성된 대량의 문서 집합을 대상으로 자동 태깅하기 위한 기법(TWCIDF)과 신규 문서를 대상으로 태그를 추천하기 위한 기법(TWCITC)으로 구성된다. 태그집합은 전처리 과정, 태그 온톨로지를 이용한 표준화 작업, 자동 태깅 및 추천을 위한 랭킹 부여과정을 거쳐 구성된다. 전처리 과정에서는 의미있는 복합명사를 찾기 위한 용어결합과정을 사용하였고, 표준화 작업 과정에서는 용어의 오탈자 및 유사용어를 처리하였다. 본 논문에서 제안한 기법의 실험 결과, 추천 태그의 정확성을 유지하면서도 실시간으로 자동태깅 및 태그 추천이 가능함을 보여주었다.

• 환경영향평가
• /
• 제20권3호
• /
• pp.357-365
• /
• 2011

The QUAL2K has the same basic characteristics as the QUAL2E model, which has been widely used in stream water quality modeling; in QUAL2K, however, various functions are supplemented. The QUAL2Kw model uses a genetic algorithm(GA) for automatic calibration of QUAL2K, and it can search for optimum water quality parameters efficiently using the calculation results of the model. The QUAL2Kw model was applied to the Gangneung Namdaecheon River on the east side of the Korean Peninsula. Because of the effluents from the urban area, the middle and lower parts of the river are more polluted than the upper parts. Moreover, the hydraulic characteristics differ between the lower and upper parts of rivers. Thus, the river reaches were divided into seven parts, auto-calibration for the multiple reaches was performed using the function of the user-defined automatic calibration of the rates worksheets. Because GA parameters affect the optimal solution of the model, the impact of the GA parameters used in QUAL2Kw on the fitness of the model was analyzed. Sensitivity analysis of various factors, such as population size, crossover probability, crossover mode, strategy for mutation and elitism, mutation rate, and reproduction plan, were performed. Using the results of this sensitivity analysis, the optimum GA parameters were selected to achieve the best fitness value.

• 한국의류학회지
• /
• 제47권1호
• /
• pp.171-190
• /
• 2023

This study aims to develop algorithms for automatic extraction landmarks from the lower body of women aged 20-54 using the Grasshopper programming language, based on 3D scan data in the 8th SizeKorea dataset. First, 11 landmarks were defined using the morphological features of 3D body surfaces and clothing applications, from which automatic landmark extraction algorithms were developed. To verify the accuracy of the algorithm, this study developed an additional algorithm that could automatically measure 16 items, and algorithm-derived measurements and SizeKorea measurements were compared using paired t-test analysis. The statistical differences between the scan-derived measurements and the SizeKorea measurements were compared, with an allowable tolerance of ISO 20685-1:2018. This study found that the algorithm successfully identified most items except for the crotch point and gluteal fold point. In the case of landmarks with significant differences, the algorithms were modified. This study was significant because scan editing, landmark search, and measurement extraction were successfully performed in one interface, and the developed algorithm has a high efficiency and strong adaptability.