• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.2
• /
• pp.19-25
• /
• 2008

When there are numerous wireless communication systems co-existing in the limited available frequency resource, an unexpected time delay can be caused during the system switching. So, in order to reduce this time delay, a mode selection method is required. In this paper, we propose a mode selection method to minimize the time delay for multi-system wireless communication systems. For the sake of efficiency, the mode selection method is designed by analyzing the preamble characteristics of different standards. Instead of performing a full search, we propose the preamble partial search to reduce the time delay to a minimum. Simulated with Matlab in an additive white Gaussian noise(AWGN) environment with a signal to noise ratio(SNR) of 10dB and bit error rate(BER) of $10^{-6}$, we evaluated and showed the performance improvement gained by using our proposed mode selection method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.12C
• /
• pp.1231-1238
• /
• 2005

This paper presents a new fast encoding algorithm for image vector quantization that incorporates the partial distances of multiple features with a multidimensional look-up table (LUT). Although the methods which were proposed earlier use the multiple features, they handles the multiple features step by step in terms of searching order and calculating process. On the other hand, the proposed algorithm utilizes these features simultaneously with the LUT. This paper completely describes how to build the LUT with considering the boundary effect for feasible memory cost and how to terminate the current search by utilizing partial distances of the LUT Simulation results confirm the effectiveness of the proposed algorithm. When the codebook size is 256, the computational complexity of the proposed algorithm can be reduced by up to the $70\%$ of the operations required by the recently proposed alternatives such as the ordered Hadamard transform partial distance search (OHTPDS), the modified $L_2-norm$ pyramid ($M-L_2NP$), etc. With feasible preprocessing time and memory cost, the proposed algorithm reduces the computational complexity to below the $2.2\%$ of those required for the exhaustive full search (EFS) algorithm while preserving the same encoding quality as that of the EFS algorithm.

• Journal of the Korea Convergence Society
• /
• v.10 no.8
• /
• pp.245-253
• /
• 2019

Beach lifeguards in Korea are unprepared to perform the rescue and safety management for individuals with disabilities. There is no lifeguard training that offers information regarding the rescue of individuals with disabilities. The purpose of the study was to conduct literature review and determine significant issues related to beach lifeguard and provide suggestions for lifeguard training programs and water safety for individuals with disabilities. Databases (i.e., CINAHL Plus with Full Text, ERIC, MEDLINE, SPORTDiscus with Full Text) were used to search research articles and organizational documents. To find relevant documents, search terms such as water safety, lifeguard, drown prevention were used. Data were content analyzed to identify key issues. Based on the literature review, five critical issues regarding rescue of individuals with disabilities, drown prevention, and water safety were drawn and discussed in the article.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.3
• /
• pp.273-281
• /
• 2004

There is the temporal correlation of the video sequence between the motion vector of current block and the motion vector of previous block. In this paper, we propose the prediction search algorithm for block matching using the temporal correlation of the video sequence and the center-biased property of motion vectors. The proposed algorithm determines the location of a better starting point for the search of an exact motion vector using the point of the smallest SAD(sum of absolute difference) value by the predicted motion vector from the same block of the previous frame and the predictor candidate point on each search region. Simulation results show that PSNR(Peak-to-Signal Noise Ratio) values are improved up to the 1.06㏈ as depend on the video sequences and improved about 0.19∼0.46㏈ on an average except the full search(FS) algorithm.

• Magazine of the Korea Concrete Institute
• /
• v.9 no.1
• /
• pp.133-141
• /
• 1997

This work presents a method of optimum design for reinforced concrete building frames with rectangular cross sections. To overcome difficulties arising from the presence of two materials in one element(concrete and steel) , the principle of divided parameters is adopted. The design variable parameters are divided into two groups - external and internal. The optimization is also divided into external and internal procedure. Several scarxh algorithms are tested to verify their accuracy for the external optimization. This work proposes a new search method, a modified pattern search, and sample problems prove its accuracy and uscf'ulness. The design obtained by this method is an optimum and in full accord with ACI Building Code Ftequirements(ACI'318-89).

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.1
• /
• pp.161-169
• /
• 1996

This paper presents a new search region prediction method using vector quantization for the motion estimation. We find motion vectors using the full search BMA from two successive frame images first. Then the motion vectors are used for training a codebook. The trained codebook is the predicted search region. We used the unsupervised neural network for VQ encoding and codebook design. A major advantage of formulating VQ as neural networks is that the large number of adaptive training algorithm that are used for neural networks can be applied to VQ. The proposed method reduces the computation and reduce the bits required to represent the motion vectors because of the smaller search points. The computer simulation results show the increased PSNR as compared with the other block matching algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7A
• /
• pp.828-835
• /
• 2004

An adaptive hexagon based search(AHBS) algorithm is proposed in this paper to perform block motion estimation in video coding. The AHBS evaluates the value of a given objective function starting from a diamond-shaped checking block and then continues its process using two hexagon-shaped checking blocks until the minimum value is found at the center of checking blocks. Also, the determination of which checking block is used depends on the position of minimum value occurred in previous searching step. The AHBS is compared with other fast searching algorithms including full search(FS). Experimental results show that the proposed algorithm provides competitive performance with slightly reduced computational complexity.

• Journal of Microbiology and Biotechnology
• /
• v.6 no.1
• /
• pp.54-59
• /
• 1996

In the research and development of bioactive compounds, determining whether a compound is novel is necessary at almost every stage. Fast and efficient determination can save money, time and effort, and thereby increase efficiency. Analysis and investigation of empirical results for previously determined compounds is also important in such research. The need to communicate research findings between workers is necessary. In effect, a systematic, centralized communication medium is required. Therefore, we have developed and constructed our own database and search systems. We have developed a search system on DOS and constructed a source file for our own database. To support multiple users, we have developed another specific and comprehensive search system, including powerful searching and output management features. The system has been developed to be simple and user-friendly, using the curses library of UNIX, while still allowing complicated queries to be performed easily with simple full-screen facilities. This UNIX version will be available for use by researchers on a computer network and is expected to make numerous contributions to basic research in universities. It will also have direct applications for institutes and industry.

• Publications of The Korean Astronomical Society
• /
• v.21 no.2
• /
• pp.113-119
• /
• 2006

The Korean Astronomical Data Center(KADC) in Korea Astronomy and Space Science Institute(KASI) has developed a database of astronomical journals published by the Korean Astronomical Society and the Korean Space Science Society. It consists of all bibliographic records of the Journal of the Korean Astronomical Society(JKAS), Publication of the Korean Astronomical Society(PKAS), and Journal of Astronomy & Space Sciences(JASS). The KADC provides useful search functions in the search page such as search criterion of bibcode, publication date, author names, title words, or abstract words. The journal name is one of the search criterion in which more than one journal can be designated at the same time. The criterion of author name is provided bilingually: English or Korean. The abstract and full text can be downloaded as PDF files. It is also possible to search papers related to a specific research topic published in Korean astronomical journals, provided by the KADC, which often cannot be found the worldwide, Astrophysics Data System(ADS) services. The KADC will become basic infrastructure for the systematic construction of bibliographic records, and hence, make the society of Korean astronomers more interactive and collaborative.

• Journal of Information Science Theory and Practice
• /
• v.10 no.4
• /
• pp.3-22
• /
• 2022

This paper provides an overview of the emergence of resource discovery systems and services, along with their advantages, best practices, and current landscapes. It outlines some of the key services and functionalities of a comprehensive discovery model suitable for academic libraries in developing countries. The proposed model (VuFind as a discovery tool) performs like other existing web-scale resource discovery systems, both commercial and open-source, and is capable of providing information resources from different sources in a single-window search interface. The objective of the paper is to provide seamless access to globally distributed subscribed as well as open access resources through its discovery interface, based on a unified index. This model uses Koha, DSpace, and Greenstone as back-ends and VuFind as a discovery layer in the front-end and has also integrated many enhanced search features like Bento-box search, Geodetic search, and full-text search (using Apache Tika). The goal of this paper is to provide the academic community with a one-stop shop for better utilising and integrating heterogeneous bibliographic data sources with VuFind (https://vufind.org/vufind).