• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.285-288
• /
• 2005

In this paper, we propose a two step Binary Exponential search algorithm for rapid acquisition time of UWB(Ultra Wide Band) signal on UWB communication systems. Previous proposed timing acquisition algorithm is searching whole frame that consist of the number of n Bins to terminate search, however this paper proposed two step Binary Exponential search algorithm can achieve remarkable reduction of UWB signal acquisition time as limiting search group. Proposed search algorithm is consisting of search group establishment step and Bit Reversing of search group establishment step.

• Journal of applied mathematics & informatics
• /
• v.20 no.1_2
• /
• pp.239-254
• /
• 2006

An efficient descent method for unconstrained optimization problems is line search method in which the step size is required to choose at each iteration after a descent direction is determined. There are many ways to choose the step sizes, such as the exact line search, Armijo line search, Goldstein line search, and Wolfe line search, etc. In this paper we propose a new inexact line search for a general descent method and establish some global convergence properties. This new line search has many advantages comparing with other similar inexact line searches. Moreover, we analyze the global convergence and local convergence rate of some special descent methods with the new line search. Preliminary numerical results show that the new line search is available and efficient in practical computation.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.8
• /
• pp.87-93
• /
• 2013

A baby-step giant-step algorithm divides n by n blocks that possess $m={\lceil}\sqrt{n}{\rceil}$ elements, and subsequently computes and stores $a^x$ (mod n) for m elements in the 1st block. It then calculates mod n for m blocks and identifies each of them with those in the 1st block of an identical elemental value. This paper firstly proposes a modified baby-step giant-step algorithm that divides ${\lceil}m/2{\rceil}$ blocks with m elements applying $a^{{\phi}(n)/2}{\equiv}1(mod\;n)$ and $a^x(mod\;n){\equiv}a^{{\phi}(n)+x}$ (mod n) principles. This results in a 50% decrease in the process of the giant-step. It then suggests a reverse baby-step giant step algorithm that performs and saves ${\lceil}m/2{\rceil}$ blocks firstly and computes $a^x$ (mod n) for m elements. The proposed algorithm is found to successfully halve the memory and search time of the baby-step giant step algorithm.

• Journal of applied mathematics & informatics
• /
• v.14 no.1_2
• /
• pp.123-136
• /
• 2004

In this paper, a combining trust region and line search algorithm for equality constrained optimization is proposed. At each iteration, we only need to solve the trust region subproblem once, when the trust region trial step can not be accepted, we switch to line search to obtain the next iteration. Hence, the difficulty of repeated solving trust region subproblem in an iterate is avoided. In order to allow the direction of negative curvature, we add second correction step in trust region step and employ nonmonotone technique in line search. The global convergence and local superlinearly rate are established under certain assumptions. Some numerical examples are given to illustrate the efficiency of the proposed algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4C
• /
• pp.331-340
• /
• 2006

In this Paper, we propose to extend the TSS-LS(Two-Step Search scheme with Linear search based Second step) scheme which was already proposed by the authors for coherent UWB(Ultra Wide Band) systems, to rapid and reliable acquisition of noncoherent UWB systems in multipath channels. The proposed noncoherent TSS-LS employing simple energy window banks utilizes two different thresholds and search windows to achieve fast acquisition. Furthermore, the linear search is adopted for the second step in the proposed scheme to correctly find the starting point in the range of effective delay spread of the multipath channels, and to obtain reliable BER(Bit Error Rate) performance of the noncoherent UWB systems. Simulation results with multipath channel models by IEEE 802.15.3a show that the proposed two-step search scheme can achieve significant reduction of the required mean acquisition time as compared to general search schemes. ]n addition, the proposed scheme achieves quite good BER performance for large signal-to-noise ratios, which is favorably comparable to the case of ideal perfect timing.

• Proceedings of the KIEE Conference
• /
• 2006.07d
• /
• pp.1830-1831
• /
• 2006

In this paper, the search is conducted along each of the coordinate directions for finding the minimum. If $e_i$ is the unit vector along the coordinate direction i, we determine the value a, minimizing f(a)= $f(x+ae_i)$, where a is a real number. A move is made to the new point $x+a_ie_i$ at the end of the search along the direction i. In an n dimensional problem, we define the search along all the directions as one stage. The function value at the end of the stage is compared to the value at the beginning of the stage in establishing the convergence. The gradient appears to be zero at point. We can safeguard this by introducing an acceleration step of one additional step along the pattern direction developed by moves along the coordinate directions.

• Korean Journal of Environmental Biology
• /
• v.38 no.3
• /
• pp.424-432
• /
• 2020

The present study aimed to analyze the metaproteome of the microbial community comprising harmful algal bloom (HAB) in the Daechung reservoir, Korea. HAB samples located at GPS coordinates of 36°29'N latitude and 127°28'E longitude were harvested in October 2013. Microscopic observation of the HAB samples revealed red signals that were presumably caused by the autofluorescence of chlorophyll and phycocyanin in viable cyanobacteria. Metaproteomic analysis was performed by a gelbased shotgun proteomic method. Protein identification was conducted through a two-step analysis including a forward search strategy (FSS) (random search with the National Center for Biotechnology Information (NCBI), Cyanobase, and Phytozome), and a subsequent reverse search strategy (RSS) (additional Cyanobase search with a decoy database). The total number of proteins identified by the two-step analysis (FSS and RSS) was 1.8-fold higher than that by one-step analysis (FSS only). A total of 194 proteins were assigned to 12 cyanobacterial species (99 mol%) and one green algae species (1 mol%). Among the species identified, the toxic microcystin-producing Microcystis aeruginosa NIES-843 (62.3%) species was the most dominant. The largest functional category was proteins belonging to the energy category (39%), followed by metabolism (15%), and translation (12%). This study will be a good reference for monitoring ecological variations at the meta-protein level of aquatic microalgae for understanding HAB.

• Journal of KIISE
• /
• v.42 no.2
• /
• pp.242-254
• /
• 2015

In this paper, we address the problem of improving the performance of multi-step k-NN search using multi-dimensional indexes. Due to information loss by lower-dimensional transformations, existing multi-step k-NN search solutions produce a large tolerance (i.e., a large search range), and thus, incur a large number of candidates, which are retrieved by a range query. Those many candidates lead to overwhelming I/O and CPU overheads in the postprocessing step. To overcome this problem, we propose two efficient solutions that improve the search performance by reducing the tolerance of a range query, and accordingly, reducing the number of candidates. First, we propose a tolerance reduction-based (approximate) solution that forcibly decreases the tolerance, which is determined by a k-NN query on the index, by the average ratio of high- and low-dimensional distances. Second, we propose a coefficient control-based (exact) solution that uses c k instead of k in a k-NN query to obtain a tigher tolerance and performs a range query using this tigher tolerance. Experimental results show that the proposed solutions significantly reduce the number of candidates, and accordingly, improve the search performance in comparison with the existing multi-step k-NN solution.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.508-510
• /
• 2001

동영상을 효율적으로 압축하기 위한 움직임백터 예측에 관한 많은 연구가 진행되어 왔다. 가장 일반적인 FBMA(Full search-based Block Matching Algorithm)는 화질은 좋지만 계량이 많기 때문에 실시간 인코딩을 요구하는 시스템에서 사용하는데 문제가 있다. 좋은 화질을 유지하면서 인코딩 속도를 해결하기 위한 많은 알고리즘들이 제안되어 왔지만 ASIC이나 소형 시스템에서 사용할 수 있는 방법이 계속 요구되고 있다. 본 논문에서는 계산량을 더욱 줄여 속도향상을 위한 방법인 TSWS(Two-Step search With Subsampling method) 제안하였다. TSWS는 블록정합알고리즘에 기반을 두고 있으며, 서브샘플링한 값으로 움직임 벡터를 찾는다. TSWS를 사용하였을 때 기존 방법들이 제공하는 주관적 화질이나 PSNR을 어느 정도 유지하면서도 속도를 20-30% 정도 개선시킬 수 있다.

• Structural Engineering and Mechanics
• /
• v.65 no.6
• /
• pp.707-719
• /
• 2018

In this article, a new method is introduced to improve the local search capability of meta-heuristic algorithms using the projection of the path on the border of constraints. In a mathematical point of view, the Gradient Projection Method is applied through a new approach, while the imposed limitations are removed. Accordingly, the gradient vector is replaced with a new meta-heuristic based vector. Besides, the active constraint identification algorithm, and the projection method are changed into less complex approaches. As a result, if a constraint is violated by an agent, a new path will be suggested to correct the direction of the agent's movement. The presented procedure includes three main steps: (1) the identification of the active constraint, (2) the neighboring point determination, and (3) the new direction and step length. Moreover, this method can be applied to some meta-heuristic algorithms. It increases the chance of convergence in the final phase of the search process, especially when the number of the violations of the constraints increases. The method is applied jointly with the authors' newly developed meta-heuristic algorithm, entitled Star Graph. The capability of the resulted hybrid method is examined using the optimal design of truss and frame structures. Eventually, the comparison of the results with other meta-heuristics of the literature shows that the hybrid method is successful in the global as well as local search.