• Journal of Korean Society of Archives and Records Management
• /
• v.14 no.1
• /
• pp.75-100
• /
• 2014

Many archives, including the National Archives of Korea, use online finding aids. However, in many aspects, they need improvement. In this study, with focus on the National Archives of Korea, the online finding aids of the National Archives of Australia (NAA), The National Archives (TNA) of United Kingdom, and the National Archives and Records Administration (NARA) of the United States were analyzed. Focus group interview was administered to users of the archives, identifying the pros and cons of online finding aids of NAA, TNA, and NARA. Based on the results, various improvement and development directions are suggested, including aspects on overall functions and hierarchical search, search options and subject search, representing search results, and archival contents services.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.6
• /
• pp.49-55
• /
• 2017

Robots, games and life applications have been developed while computer areas are developed. Moreover, various applications have been utilized for various users including the early childhood. Recently, smart phones have been dramatically used by various users including early childhood. Many applications need to find a path from a starting point to destinations. For example, without using real maps, users can find the direct paths for the destinations in realtime. Specifically, path exploration in game programs is so important to have accurate results. Nowadays, with these techniques, diverse applications for educations of early childhood have been developed. To deal with the functions, necessity of efficient path search programs with high accuracy becomes much higher. In this paper, we design and develop a friendly maze program for early childhood based on a path searching algorithm. Basically, the path of lineal distance from a starting location to destination is considered. Moreover, weight values are calculated by considering heuristic weighted h(x). In our approach, A* algorithm searches the path considering weight values. Moreover, we utilize depth first search approach instead of breadth first search in order to reduce the search space. so it is proper to use A* algorithm in finding efficient paths although it is not optimized paths.

• Journal of Distribution Science
• /
• v.19 no.7
• /
• pp.61-73
• /
• 2021

Purpose: This study offers suggestions to e-commerce companies for increasing shoppers' repurchase intention by considering the effect of distribution information in online shopping. It applies complexity theory to incorporate habitual information search behavior and shopper characteristics into the Stimulus-Organism-Response model and indicates how these complex factors work together in online shopping. Research design, data, and methodology: This study used an interview survey of 158 Vietnamese consumers with an experience of online shopping. A fuzzy-set Qualitative Comparative Analysis (fsQCA) was used to examine the relationship between antecedents and outcomes depending on complex conditions in the given contexts. Results: The results (1) indicate the importance of observing information search patterns and investigating their influence on online distribution, and (2) clarify what kind of configurations, under what conditions, predict a high or low outcome; this provides evidence and hints for the development of frameworks for future studies. Conclusions: The findings suggest that shoppers' unconscious, habitual behavior can work with conscious attitude factors, such as satisfaction, to increase their repurchase intention. Hence, e-commerce companies should consider how to present useful distribution information and create functions that allow shoppers to engage with a variety of information while increasing their repurchase intention on the site.

• Journal of the Korean Society for Precision Engineering
• /
• v.14 no.12
• /
• pp.24-29
• /
• 1997

Recently, Genetic Algorithm(GA), which is a stochastic direct search strategy that mimics the process of genetic evolution, is widely adapted into a search procedure for structural optimization. Contrast to traditional optimal design techniques which use design sensitivity analysis results, GA is very simple in their algorithms and there is no need of continuity of functions(or functionals) any more in GA. So, they can be easily applicable to wide area of design optimization problems. Also, owing to multi-point search procedure, they have higher porbability of convergence to global optimum compared to traditional techniques which take one-point search method. The methods consist of three genetics opera- tions named selection, crossover and mutation. In this study, a method of finding the omtimum size and topology of drilling machine is proposed by using the GA, For rapid converge to optimum, elitist survival model,roulette wheel selection with limited candidates, and multi-point shuffle cross-over method are adapted. And pseudo object function, which is the combined form of object function and penalty function, is used to include constraints into fitness function. GA shows good results of weight reducing effect and convergency in optimal design of drilling machine.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.16 no.2
• /
• pp.236-247
• /
• 1992

Optimization has been developed to minimize the cost function while satisfying constraints. Nonlinear Programming method is used as a tool for the optimization. Usually, cost and constraint function calculations are required in the engineering applications, but those calculations are extremely expensive. Especially, the function and sensitivity analyses cause a bottleneck in structural optimization which utilizes the Finite Element Method. Also, when the functions are quite noisy, the informations do not carry out proper role in the optimization process. An algorithm called "Second-order Approximation Method" has been proposed to overcome the difficulties recently. The cost and constraint functions are approximated by the second-order Taylor series expansion on a nominal points in the algorithm. An optimal design problem is defined with the approximated functions and the approximated problem is solved by a nonlinear programming numerical algorithm. The solution is included in a candidate point set which is evaluated for a new nominal point. Since the functions are approximated only by the function values, sensitivity informations are not needed. One-dimensional line search is unnecessary due to the fact that the nonlinear algorithm handles the approximated functions. In this research, the method is analyzed and the performance is evaluated. Several mathematical problems are created and some standard engineering problems are selected for the evaluation. Through numerical results, applicabilities of the algorithm to large scale and complex problems are presented.presented.

• Proceedings of the KIEE Conference
• /
• 1998.07b
• /
• pp.549-551
• /
• 1998

In this paper, we design the optimal satellite-tracking antenna $H_{\infty}$ control system using genetic algorithm(GA). To do this, we give gain and dynamics parameters to the weighting functions and apply GA with reference model to the optimal determination of weighting functions and design parameter ${\gamma}$ that are given by Glover-Doyle algorithm which can design $H_{\infty}$ controller in the state space. These weighting functions and design parameter ${\gamma}$ are simultaneously optimized in tile search domain guaranteeing the robust stability of closed-loop system. The effectiveness of this satellite-tracking antenna $H_{\infty}$ control system is verified by computer simulation.

• Proceedings of the KIEE Conference
• /
• 1997.07b
• /
• pp.587-589
• /
• 1997

In this paper we design the model following ${\mu}$-synthesis control system for optimal fuel-injection of diesel engine using genetic algorithms. To do this, we give gain and dynamics parameters to the weighting functions and apply genetic algorithms with reference model to the optimal determination of weighting functions that are given by D-K iteration method which can design ${\mu}$-synthesis controller in the state space. These weighting functions are optimized simultaneously in the search domain selected adequately. The effectiveness of this ${\mu}$-synthesis control system for fuel-injection is verified by computer simulation.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.11 no.4
• /
• pp.69-88
• /
• 2007

In this paper we propose new large-update primal-dual interior point algorithms for $P_{\neq}({\kappa})$ linear complementarity problems(LCPs). New search directions and proximity measures are proposed based on a specific class of kernel functions, ${\psi}(t)={\frac{t^{p+1}-1}{p+1}}+{\frac{t^{-q}-1}{q}}$, q>0, $p{\in}[0,\;1]$, which are the generalized form of the ones in [3] and [12]. It is the first to use this class of kernel functions in the complexity analysis of interior point method(IPM) for $P_*({\kappa})$LCPs. We showed that if a strictly feasible starting point is available, then new large-update primal-dual interior point algorithms for $P_*({\kappa})$ LCPs have the best known complexity $O((1+2{\kappa}){\sqrt{2n}}(log2n)log{\frac{n}{\varepsilon}})$ when p=1 and $q=\frac{1}{2}(log2n)-1$.

• Journal of the Korean Society for Library and Information Science
• /
• v.58 no.2
• /
• pp.317-342
• /
• 2024

The purpose of this study is to explore ways to improve accessibility to school library materials through analysis of elementary school students' information search behavior in DLS. Accordingly, the DLS search process was recorded for 26 students attempting a DLS search in the school library, and data was collected through a pre-search questionnaire on overall information needs and a post-search questionnaire on the search process and results. As a result of the analysis, satisfaction was found to be low when the main purpose of DLS use was simple leisure reading, when the search time and number of search words were long, and when there were too many search results. Accordingly, it was emphasized that curriculum subject-related metadata elements should be developed and a curriculum subject-specific thesaurus should be built and used to build lists and support user searches. In addition, it was suggested that the basic functions provided in external searches should be included, and a foundation should be laid in terms of resources and curriculum to systematically provide information utilization education to elementary school students who lack the ability to select search terms and judge the suitability of results after the search. It was proposed to provide an integrated search service with external resources and a personalized book recommendation service.

• The Journal of the Korea Contents Association
• /
• v.15 no.11
• /
• pp.571-581
• /
• 2015

In the field of Korean medicine (KM), KM terms has been mixed used for a long period. After the Society of KM had systematically organized the KM terms used in our country, the book for the Korean medical standard terminologies was published. In this study, we developed an online service based on the book. The online service provides various useful functions for searching the terms and their commentary and collecting users' opinions. Users can also compare the standard terms with their semantic search results and naver's knowledge search results within our system. By analyzing logs of our system, we suggested several directions for future development, including the improvement of search functions, advertisements, and the provision of open APIs. In the future, our online service might provide the important information on clinics, academic researches, and international standards.