• Title/Summary/Keyword: Point-to-point search

Search Result 993, Processing Time 0.026 seconds

Method for improving search efficiency using relation of anatomical structure from Donguibogam(東醫寶鑑) ("동의보감"에 기재된 인체 용어 관계를 이용한 검색효율성 향상 방법)

  • Song, In-Woo;Lee, Byung-Wook
    • Journal of Korean Medical classics
    • /
    • v.25 no.4
    • /
    • pp.105-113
    • /
    • 2012
  • Objectives : Acquiring information from symptoms is one of the important method to gain clinically available information in korean medicine. Therefore, up to now, study of symptom terms was frequently implemented in promotion of various information project. In data extraction methods using symptom information from DB, information search using synonym and method using ontology is studied and utilized. However, considering concept of symptom has essential information of appeared body area and phenomenon we think that extending synonym and ontology relationship in symptom terms can be useful for search and set to this study. Methods : We collect terms relevant to human body area and structure described in Donguibogam. Synonymous relationship between collected terms is organized. Relationship between collected terms is build to human-body-knowledge table which has form of Concept+Relation+Concept. Type of relationship is limited on a range of expressing content about parts of human body. Result & Conclusion : Search condition is generated automatically using relationship of the upper area in knowledge table contents. Information of next and previous acupuncture point, upper and lower acupuncture point, left and right acupuncture point can be searched using information of acupuncture point location, order, relative position in area, direction in knowledge table contents.

Unbounded Binary Search Method for Fast-tracking Maximum Power Point of Photovoltaic Modules

  • Hong, Yohan;Kim, Yong Sin;Baek, Kwang-Hyun
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.5 no.6
    • /
    • pp.454-461
    • /
    • 2016
  • A maximum power point tracking (MPPT) system with fast-tracked time and high power efficiency is presented in this paper. The proposed MPPT system uses an unbounded binary search (UBS) algorithm that continuously tracks the maximum power point (MPP) with a binary system to follow the MPP under rapid-weather-change conditions. The proposed algorithm can decide the correct direction of the MPPT system while comparing the previous power point with the present power point. And then, by fixing the MPP until finding the next MPP, there is no oscillation of voltage MPP, which maximizes the overall power efficiency of the photovoltaic module. With these advantages, this proposed UBS is able to detect the MPP more effectively. This MPPT system is based on a boost converter with a micro-control unit to control analog-to-digital converters and pulse width modulation. Analysis of this work and experimental results show that the proposed UBS MPPT provides fast, accurate tracking with no oscillation in situations where weather rapidly changes and shadow is caused by all sorts of things. The tracking time is reduced by 87.3% and 66.1% under dynamic-state and steady-state operation, respectively, as compared with the conventional 7-bit perturb and observe technique.

Probability Constrained Search Range Determination for Fast Motion Estimation

  • Kang, Hyun-Soo;Lee, Si-Woong;Hosseini, Hamid Gholam
    • ETRI Journal
    • /
    • v.34 no.3
    • /
    • pp.369-378
    • /
    • 2012
  • In this paper, we propose new adaptive search range motion estimation methods where the search ranges are constrained by the probabilities of motion vector differences and a search point sampling technique is applied to the constrained search ranges. Our new methods are based on our previous work, in which the search ranges were analytically determined by the probabilities. Since the proposed adaptive search range motion estimation methods effectively restrict the search ranges instead of search point sampling patterns, they provide a very flexible and hardware-friendly approach in motion estimation. The proposed methods were evaluated and tested with JM16.2 of the H.264/AVC video coding standard. Experiment results exhibit that with negligible degradation in PSNR, the proposed methods considerably reduce the computational complexity in comparison with the conventional methods. In particular, the combined method provides performance similar to that of the hybrid unsymmetrical-cross multi-hexagon-grid search method and outstanding merits in hardware implementation.

POLYNOMIAL COMPLEXITY OF PRIMAL-DUAL INTERIOR-POINT METHODS FOR CONVEX QUADRATIC PROGRAMMING

  • Liu, Zhongyi;Sun, Wenyu;De Sampaio, Raimundo J.B.
    • Journal of applied mathematics & informatics
    • /
    • v.27 no.3_4
    • /
    • pp.567-579
    • /
    • 2009
  • Recently, Peng et al. proposed a primal-dual interior-point method with new search direction and self-regular proximity for LP. This new large-update method has the currently best theoretical performance with polynomial complexity of O($n^{\frac{q+1}{2q}}\;{\log}\;{\frac{n}{\varepsilon}}$). In this paper we use this search direction to propose a primal-dual interior-point method for convex quadratic programming (QP). We overcome the difficulty in analyzing the complexity of the primal-dual interior-point methods for convex quadratic programming, and obtain the same polynomial complexity of O($n^{\frac{q+1}{2q}}\;{\log}\;{\frac{n}{\varepsilon}}$) for convex quadratic programming.

  • PDF

Improved Global Maximum Power Point Tracking for Photovoltaic System via Cuckoo Search under Partial Shaded Conditions

  • Shi, Ji-Ying;Xue, Fei;Qin, Zi-Jian;Zhang, Wen;Ling, Le-Tao;Yang, Ting
    • Journal of Power Electronics
    • /
    • v.16 no.1
    • /
    • pp.287-296
    • /
    • 2016
  • Conventional maximum power point tracking (MPPT) methods are ineffective under partially shaded conditions because multiple local maximum can be exhibited on power-voltage characteristic curve. This study proposes an improved cuckoo search (ICS) MPPT method after investigating the cuckoo search (CS) algorithm applied in solving multiple MPPT. The algorithm eliminates the random step in the original CS algorithm, and the conception of low-power, high-power, normal and marked zones are introduced. The adaptive step adjustment is also realized according to the different stages of the nest position. This algorithm adopts the large step in low-power and marked zones to reduce search time, and a small step in high-power zone is used to improve search accuracy. Finally, simulation and experiment results indicate that the promoted ICS algorithm can immediately and accurately track the global maximum under partially shaded conditions, and the array output efficiency can be improved.

Design of Optimal Locating Point of the Hydraulic Cylinder Actuating a Roller-Link Type Rotating Floodgate (콤플렉스법에 의한 롤러-링크 부착형 전도수문 구동용 유압실린더의 최적 설치점 설계)

  • Lee, S.R.
    • Journal of Drive and Control
    • /
    • v.9 no.3
    • /
    • pp.29-36
    • /
    • 2012
  • The hydraulic cylinder is used for actuating the roller-link type rotating floodgate which controls the volume of water in the reservoir. The locating points of hydraulic cylinder are restricted to the limited space and determined to minimize the cylinder force necessary for actuating the floodgate. Generally, the head end point of cylinder is fixed at underground and the rod end point of cylinder is connected to the support link. Therefore there exist three design variables to be determined to minimize the cylinder force within the rotating range of floodgate. First, the mathematical model of the roller-link type rotating floodgate is derived to find the cylinder force corresponding to the floodgate angle. Then, the optimal locating point of hydraulic cylinder is searched using the complex method that is one kind of constrained direct search method.

A Prediction Search Algorithm by using Temporal and Spatial Motion Information from the Previous Frame (이전 프레임의 시공간 모션 정보에 의한 예측 탐색 알고리즘)

  • Kwak, Sung-Keun;Wee, Young-Cheul;Kimn, Ha-Jine
    • Journal of the Korea Computer Graphics Society
    • /
    • v.9 no.3
    • /
    • pp.23-29
    • /
    • 2003
  • There is the temporal correlation of the video sequence between the motion vector of current block and the motion vector of the previous block. If we can obtain useful and enough information from the motion vector of the same coordinate block of the previous frame, the total number of search points used to find the motion vector of the current block may be reduced significantly. In this paper, we propose the block-matching motion estimation using an adaptive initial search point by the predicted motion information from the same block of the previous frame. And the first search point of the proposed algorithm is moved an initial point on the location of being possibility and the searching process after moving the first search point is processed according to the fast search pattern. Simulation results show that PSNR(Peak-to-Signal Noise Ratio) values are improved UP to the 1.05dB as depend on the image sequences and improved about 0.33~0.37dB on an average. Search times are reduced about 29~97% than the other fast search algorithms. Simulation results also show that the performance of the proposed scheme gives better subjective picture quality than the other fast search algorithms and is closer to that of the FS(Full Search) algorithm.

  • PDF

Lattice Reduction-aided Detection with Out-of-Constellation Point Correction for MIMO Systems (MIMO 시스템을 위한 Out-of-Constellation Point 보정 Lattice Reduction-aided 검출기법)

  • Choi, Kwon-Hue
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.12A
    • /
    • pp.1339-1345
    • /
    • 2007
  • An important drawback in Lattice Reduction (LR) aided detectors has been investigated. For the solution, an improved LR aided detection with ignorable complexity overhead is proposed for MIMO system, where the additional correction operation is performed for the case of unreliable symbol decision. We found that LR aided detection errors mainly occur when the lattice points after the inverse lattice transform in the final step fall outside the constellation point set. In the proposed scheme, we check whether or not the lattice point obtained through LR detection is out of constellation. Only for the case of out of constellation, we additionally perform ML search with reduced search region restricted to the neighboring points near to the obtained lattice points. Using this approach, we can effectively and significantly improve the detection performance with just a slight complexity overhead which is negligible compared to full searched ML scheme. Simulation results show that the proposed scheme achieves the detection performance near to that of the ML detection with a lower computational complexity.

An Improvement Video Search Method for VP-Tree by using a Trigonometric Inequality

  • Lee, Samuel Sangkon;Shishibori, Masami;Han, Chia Y.
    • Journal of Information Processing Systems
    • /
    • v.9 no.2
    • /
    • pp.315-332
    • /
    • 2013
  • This paper presents an approach for improving the use of VP-tree in video indexing and searching. A vantage-point tree or VP-tree is one of the metric space-based indexing methods used in multimedia database searches and data retrieval. Instead of relying on the Euclidean distance as a measure of search space, the proposed approach focuses on the trigonometric inequality for compressing the search range, which thus, improves the search performance. A test result of using 10,000 video files shows that this method reduced the search time by 5-12%, as compared to the existing method that uses the AESA algorithm.

A Block Matching Algorithm using Motion Vector Predictor Candidates and Adaptive Search Pattern (움직임 벡터 예측 후보들과 적응적인 탐색 패턴을 이용하는 블록 정합 알고리즘)

  • Kwak, Sung-Keun;Wee, Young-Cheul;Kim, Ha-JIne
    • The KIPS Transactions:PartB
    • /
    • v.11B no.3
    • /
    • pp.247-256
    • /
    • 2004
  • In this paper, we propose the prediction search algorithm for block matching using the temporal/spatial correlation of the video sequence and the renter-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 pint in each search region and the predicted motion vector from the neighbour blocks of the current frame. And the searching process after moving the starting point is processed a adaptive search pattern according to the magnitude of motion vector Simulation results show that PSNR(Peak-to-Signal Noise Ratio) values are improved up to the 0.75dB as depend on the video sequences and improved about 0.05∼0.34dB on an average except the FS (Full Search) algorithm.