• Journal of Convergence for Information Technology
• /
• v.10 no.12
• /
• pp.9-14
• /
• 2020

Currently, NTIS (National Technology Information Service) is building an interactive search service based on artificial intelligence technology. In order to understand users' search intentions and provide R&D information, an interactive search service is built based on deep learning models and morpheme analyzers. The deep learning model learns based on the log data loaded when using NTIS and interactive search services and understands the user's search intention. And it provides task information through step-by-step search. Understanding the search intent makes exception handling easier, and step-by-step search makes it easier and faster to obtain the desired information than integrated search. For future research, it is necessary to expand the range of information provided to users.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.2
• /
• pp.8-18
• /
• 2020

An Exponential Bandwidth Harmony Search with Centralized Global Search (EBHS-CGS) was developed to enhance the performance of a Harmony Search (HS). EBHS-CGS added two methods to improve the performance of HS. The first method is an improvement of bandwidth (bw) that enhances the local search. This method replaces the existing bw with an exponential bw and reduces the bw value as the iteration proceeds. This form of bw allows for an accurate local search, which enables the algorithm to obtain more accurate values. The second method is to reduce the search range for an efficient global search. This method reduces the search space by considering the best decision variable in Harmony Memory (HM). This process is carried out separately from the global search of the HS by the new parameter, Centralized Global Search Rate (CGSR). The reduced search space enables an effective global search, which improves the performance of the algorithm. The proposed algorithm was applied to a representative optimization problem (math and engineering), and the results of the application were compared with the HS and better Improved Harmony Search (IHS).

• Journal of Distribution Science
• /
• v.14 no.7
• /
• pp.15-19
• /
• 2016

Purpose - India is predicted to lead the world in online sales, but the behavioral range of online consumer has not been researched adequately. Moreover, the research on the role of psychological variables like consumer innovativeness in online purchase behavior has not been investigated. This paper aims to unravel the role of 'consumer innovativeness' in predicting online purchase intention. Further, this paper examines the effect of consumer innovativeness on 'online information search' and 'attitude' in online purchase areas. Research design, data, and methodology - This study uses factor analysis to confirm the convergent and discriminant validities from the adopted scales. Regression analysis was employed to test the various hypotheses in this study. Results - This study finds that consumer innovativeness affects positively 'information search', 'attitude' and 'purchase intentions' in online purchase circumstances. Conclusions - Consumer Innovativeness has emerged as a significant factor affecting online purchase intentions. It has also been confronted with an important variable affecting online information search and attitudes for online purchase.

• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.21 no.4
• /
• pp.90-105
• /
• 2013

As witnessed in September 11 attacks, air terrorism is often the most effective means to achieve their goals, and thereby requires a sophisticated level of security measures. Moreover, considering the nature of air transportation, the prevention of air terrorism demands a wide range of international cooperation and joint efforts such as timely sharing of information related to air terrorism (such as latest terror techniques and list of terrorists) between nations, International Air Transport Association (IATA) and International Civil Aviation Organization (ICAO) As most air terrorism can be effectively prevented through security and search activities in airports, this study has focused on researching security measures and issues in major airports around the world, along with the potential measures to improve them. To achieve this effect, this paper offers solutions to preventing air terrorism by exploring appropriate responses to various type of air terrorism, deployment of advanced security and search equipment, techniques to identify terrorists, R&D on equipments to physically take down terrorists and systematic improvements on airport security search process.

• Advances in Computational Design
• /
• v.1 no.2
• /
• pp.175-194
• /
• 2016

Nature has provided inspiration for most of the man-made technologies. Scientists believe that dolphins are the second to humans in smartness and intelligence. Echolocation is the biological sonar used by dolphins for navigation and hunting in various environments. This ability of dolphins is mimicked in this paper to develop a new optimization method. Dolphin Echolocation Optimization (DEO) is an optimization method based on dolphin's approach for hunting food and exploration of environment. DEO has already been developed for discrete optimization search space and here it is extended to continuous search space. DEO has simple rules and is adjustable for predetermined computational cost. DEO provides the optimum results and leads to alternative optimality curves suitable for the problem. This algorithm has a few parameters and it is applicable to a wide range of problems like other metaheuristic algorithms. In the present work, the efficiency of this approach is demonstrated using standard benchmark problems.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.4
• /
• pp.293-298
• /
• 2003

In this paper. we propose a fast search algorithm for nearest neighbor vector quantization (NNVQ). The proposed algorithm rejects those codewords which can not be the nearest codeword and reduces the search range of codebook. Hence it reduces computational time and complexity in encoding process, while it provides the same SD performance as the conventional full search algorithm. We apply the proposed algorithm to the adaptive multi-rate (AMR) speech coder and a general vector quantizer designed by LBG. algorithm. Simulation results show effectiveness of the proposed algorithm.

• The Journal of Information Systems
• /
• v.25 no.1
• /
• pp.159-182
• /
• 2016

Purpose This paper aims to develop a novel tabu search algorithm for solving the sequencing problems with precedence constraints. Due to constraints, the traditional meta heuristic methods can generate infeasible solutions during search procedure, which must be carefully dealt with. On the contrary, the candidate order based tabu search (COTS) is based on a novel neighborhood structure that guarantees the feasibility of solutions, and can dealt with a wide range of sequencing problems in flexible manner. Design/methodology/approach Candidate order scheme is a strategy for constructing a feasible sequence by iteratively appending an item at a time, and it has been successfully applied to genetic algorithm. The primary benefit of the candidate order scheme is that it can effectively deal with the additional constraints of sequencing problems and always generates the feasible solutions. In this paper, the candidate order scheme is used to design the neighborhood structure, tabu list and diversification operation of tabu search. Findings The COTS has been applied to the single machine job sequencing problems, and we can see that COTS can find the good solutions whether additional constraints exist or not. Especially, the experiment results reveal that the COTS is a promising approach for solving the sequencing problems with precedence constraints. In addition, the operations of COTS are intuitive and easy to understand, and it is expected that this paper will provide useful insights into the sequencing problems to the practitioners.

• 한국전산유체공학회:학술대회논문집
• /
• 1998.11a
• /
• pp.13-18
• /
• 1998

The practical use of the particle image velocimetry(PIV), a whole-field velocity measurement method, requires the use of fast, reliable, computer-based methods for tracking velocity vectors. The full search block matching, the most widely studied and applied technique both in area of PIV and Image Coding and Compression, is computationally costly. Many less expensive alternatives have been proposed mostly in the area of Image Coding and Compression. Among others, TSS, NTSS, HPM are introduced for the past PIV analysis, and found to be successful. But, these algorithms are based on small dynamic range, 7 pixels/frame in maximum displacement. To analyze the images with large displacement, Even and Odd field image separation and a simple version of multi-resolution hierarchical procedures are introduced in this paper. Comparison with other algorithms are summarized. A Results of application to the turbulent backward step flow shows the improvement of new algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.133.1-133
• /
• 2001

When the signals from satellite vehicles are blocked, it is impossible to provide positioning information. Integrating CDGPS with INS, the performances of output can be greatly improved. In the CDGPS/INS integrated system, the error growth in INS can be efficiently suppressed due to CDGPS. On the contrary, the search range of integer ambiguities can be reduced with the aids of INS. Furthermore, cycle slips in carrier phase measurements can be easily detected using INS. The paper presents a CDGPS/INS integrated system that utilizes CDGPS aided with INS. Using the outputs of CDGPS/INS integration filter, a method to reduce search range of integer ambiguities is proposed. A method to detect cycle slips in carrier phase measurements is ...

• Journal of Institute of Control, Robotics and Systems
• /
• v.3 no.1
• /
• pp.46-51
• /
• 1997

The optimal control of a continuous process has been performed using genetic algorithms(GAs). GAs are robust and easily applicable for complex and highly nonlinear problems. We introduce the heuristics 'dynamic range' which reduces the search space dramaticaly keeping the robust search of GAs. GAs with dynamic range show the better performance than SQP(Successive Quadratic Programing) method which converges to a local minimum. The proposed methology has been applied to the optimal control of the continuous MMA-VA copolymerization reactor for the production of the desired molecular wieght and the composition of VA in dead copolymer.