• Journal of the Korea Society of Computer and Information
• /
• v.10 no.4 s.36
• /
• pp.1-16
• /
• 2005

When Web-based special retrieval systems for scientific field extremely restrict the expression of user's information request, the process of the information content analysis and that of the information acquisition become inconsistent. Accordingly, this study suggests the re-ranking retrieval model which reflects the content based similarity between user's inquiry terms and index words by grasping the document knowledge structure. In order to accomplish this, the former constructs a thesaurus and similarity relation matrix to provide the subject analysis mechanism and the latter propose the algorithm which establishes a search model such as query expansion in order to analyze the user's demands. Therefore, the algorithm that this study suggests as retrieval utilizing the information structure of a retrieval system can be content-based retrieval mechanism to establish a 2-step search model for the preservation of recall and improvement of accuracy which was a weak point of the previous fuzzy retrieval model.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.12
• /
• pp.83-89
• /
• 2008

Simple but effective fast codebook searching algorithms for quantized EGT(equal gain transmission) are presented. Using newly defined metric, rough searching selects a few candidate weight vectors. Using the conventional metric, accurate searching determines the optimal vector among the candidates. This strategy reduces the entire searching time. When the number of transmit antenna is two or three, the searching time reduces more than a half less than the conventional searching time. Moreover, the more the size of codebook increases, the more the searching time reduction also increases.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.8
• /
• pp.1986-1992
• /
• 2009

A user often searches a data by inputting a variant such as the abbreviation or substring of a word, or a misspelled word. The simple approach to the searching for variants is to build a variants dictionary. However, it entails enormous cost and time and can not handle variants by misspelling. Approximate searching, searching by approximate string matching, is a good approach to the searching. A problem in the approach is that it cannot handle variants by abbreviations. This paper propose a method for searching various variants including abbreviations and misspelled words, by using the trie indexing. First, this paper shows a variant matching method with the calculation of path weighted-metric. In addition, it provides variant searching algorithm to reduce the search time.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.815-816
• /
• 2009

Owing to the development of computer technologies, to process data derived from various sensors is recently demanding. It is also increasing to demand the moving object based servies like the services of location based and mobile application services. That's why it is needed the processing of visualizing the services for education aspects. In this paper, we show the implemented results about $R^*$ tree algorithm to insert, delete and search a object in two dimension environment.

• Geomechanics and Engineering
• /
• v.27 no.5
• /
• pp.511-525
• /
• 2021

In the design of underground excavation, the shear strength (SS) is a key characteristic. It describes the way the rock material resists the shear stress-induced deformations. In general, the measurement of the parameters related to rock shear strength is done through laboratory experiments, which are costly, damaging, and time-consuming. Add to this the difficulty of preparing core samples of acceptable quality, particularly in case of highly weathered and fractured rock. This study applies rock index test to the indirect measurement of the SS parameters of shale. For this aim, two efficient artificial intelligence methods, namely (1) adaptive neuro-fuzzy inference system (ANFIS) implemented by subtractive clustering method (SCM) and (2) support vector regression (SVR) optimized by Harmony Search (HS) algorithm, are proposed. Note that, it is the first work that predicts the SS parameters of shale through ANFIS-SCM and SVR-HS hybrid models. In modeling processes of ANFIS-SCM and SVR-HS, the results obtained from the rock index tests were set as inputs, while the SS parameters were set as outputs. By reviewing the obtained results, it was found that both ANFIS-SCM and SVR-HS models can provide acceptable predictions for interlocking and friction angle parameters, however, ANFIS-SCM showed a better generalization capability.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.25 no.5
• /
• pp.476-486
• /
• 2022

Synthetic dynamic infrared image generation from the given virtual environment is being the primary goal to simulate the output of the infra-red(IR) camera installed on a vehicle to evaluate the control algorithm for various search & reconnaissance missions. Due to the difficulty to obtain actual IR data in complex environments, Artificial intelligence(AI) has been used recently in the field of image data generation. In this paper, CycleGAN technique is applied to obtain a more realistic synthetic IR image. We added the Structural Similarity Index Measure(SSIM) loss function to the L1 loss function to generate a more realistic synthetic IR image when the CycleGAN image is generated. From the simulation, it is applicable to the guided-missile flight simulation tests by using the synthetic infrared image generated by the proposed technique.

• Journal of KIISE:Information Networking
• /
• v.30 no.2
• /
• pp.282-292
• /
• 2003

This paper proposes an efficient data structure for forwarding IPv4 and IPv6 packets at the gigabit speed in backbone routers. The LPM(Longest Prefix Matching) search becomes a bottleneck of routers' performance since the LPM complexity grows in proportion to the forwarding table size and the address length. To speed up the forwarding process, this paper introduces a data structure named BMT(Bit-Map Tie) to minimize the frequent main memory accesses. All the necessary search computations in BMT are done over a small index table stored at cache. To build the small index table from the tie representation of the forwarding table, BMT represents a link pointer to the child node and a node pointer to the corresponding entry in the forwarding table with one bit respectively. To improve the poor performance of the conventional tries when their height becomes higher due to the increase of the address length, BMT adopts a binary search algorithm for determining the appropriate level of tries to start. The simulation experiments show that BMT compacts the IPv4 backbone routers' forwarding table into a small one less than 512-kbyte and achieves the average speed of 250ns/packet on Pentium II processors, which is almost the same performance as the fastest conventional lookup algorithms.

• Journal of the Korean Statistical Society
• /
• v.35 no.2
• /
• pp.201-212
• /
• 2006

The technique of foldover is usually used by experimenters to de-alias the effects that are interesting in follow-up experiment. Employing a $2^{k-p}$ design with resolution III or higher, Li and Lin (2003) developed an algorithm and used computer programs to search its corresponding optimal foldover design for selected 16-run and 32-run experiments. Based on the minimum aberration criterion, the strong combined-optimal design, defined by Li and Lin, is the better choice of the initial design. In this article, we apply the technique of blocking to find the strong combined-optimal designs. Furthermore, we will tabulate all 16-run and 32-run strong combined-optimal designs and their corresponding core foldover plans for practical use. Some new designs that have not appeared in the other literature but constructed by the technique of blocking are also proposed in this article.

• Journal of Power Electronics
• /
• v.18 no.4
• /
• pp.1037-1050
• /
• 2018

This paper presents a novel reconfigurable selective harmonic elimination technique to control harmonics over a wide range of Modulation Indexes (MI) in Multi-Level Inverter (MLI). In the proposed method, the region of the MI is divided into various sectors and expressions are formulated with different switching patterns for each of the sectors. A memetic BBO-MAS (Biogeography Based Optimization - Mesh Adaptive direct Search) optimization algorithm is proposed for solving the Selective Harmonic Elimination - Pulse Width Modulation (SHE-PWM) technique. An experimental prototype is developed using a Field Programmable Gate Array (FPGA) and their FFT spectrums are analyzed over a wide range of MI using a fluke power logger. Simulation and experimental results have validated the performance of the proposed optimization algorithms and the reconfigurable SHE-PWM technique. Further, the sensitivity of the harmonics has been analyzed considering non-integer variations in the magnitude of the input DC sources.

• Journal of KIISE:Databases
• /
• v.27 no.2
• /
• pp.216-226
• /
• 2000

This paper suggests a new access path, hashed B-tree which is an efficient access method for integrity checking. Hashed B-tree is based on the observation that most query patterns in enforcing integrity constraints are point queries. Hashed B-tree compresses the key by hashing procedure, which reduces the height of tree and results in fast node search. This method has the advantages such as it can be implemented easily and use the B-tree concurrency control and recovery algorithm with minor modifications.