• Title/Summary/Keyword: Line Search

Search Result 631, Processing Time 0.028 seconds

A Design and Implementation of VOD Service System with Off-line Search Function (오프라인 검색기능을 가진 주문형 비디오 서비스 시스템 설계 및 구현)

  • 이혜정;박두순
    • Journal of Korea Multimedia Society
    • /
    • v.4 no.3
    • /
    • pp.205-214
    • /
    • 2001
  • As the real time multimedia data service has become available due to the rapid progress of computer and Internet technology, the users can enjoy the newly developed service, which is called Video On-Dem-and(VOD). However, most of service providers have not paid their attention much on the software for various service modes on VOD, but they are only concentrating un the hardware to provide with the high resolution video display. Therefore, the service providers are recently to pay more attention on the software to cope with the various demands of users than hardware. So this paper has designed and implemented the VOD service system for those demands. Since the VOD service system suggested by this paper enable off-line search functions through E-mail, the users can possibly get the necessary information from off-line Search without connecting to the server while the current VOD service can prominently help users to save the time and effort to sea고 and select the Video contents by using periodical current awareness service supported by PUSH technology and user oriented information booking and feedback service supported by SDI service.

  • PDF

Development of an Efficient Line Search Method by Using the Sequential Polynomial Approximation (순차적 다항식 근사화를 적용한 효율적 선탐색기법의 개발)

  • 김민수;최동훈
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.19 no.2
    • /
    • pp.433-442
    • /
    • 1995
  • For the line search of a multi-variable optimization, an efficient algorithm is presented. The algorithm sequentially employs several polynomial approximations such as 2-point quadratic interpolation, 3-point cubic interpolation/extrapolation and 4-point cubic interpolation/extrapolation. The order of polynomial function is automatically increased for improving the accuracy of approximation. The method of approximation (interpolation or extrapolation) is automatically switched by checking the slope information of the sample points. Also, for selecting the initial step length along the descent vector, a new approach is presented. The performance of the proposed method is examined by solving typical test problems such as mathematical problems, mechanical design problems and dynamic response problems.

An Endosymbiotic Evolutionary Algorithm for Balancing and Sequencing in Mixed-Model Two-Sided Assembly Lines (혼합모델 양면조립라인의 밸런싱과 투입순서를 위한 내공생 진화알고리즘)

  • Jo, Jun-Young;Kim, Yeo-Keun
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.37 no.3
    • /
    • pp.39-55
    • /
    • 2012
  • This paper presents an endosymbiotic evolutionary algorithm (EEA) to solve both problems of line balancing and model sequencing in a mixed-model two-sided assembly line (MMtAL) simultaneously. It is important to have a proper balancing and model sequencing for an efficient operation of MMtAL. EEA imitates the natural evolution process of endosymbionts, which is an extension of existing symbiotic evolutionary algorithms. It provides a proper balance between parallel search with the separated individuals representing partial solutions and integrated search with endosymbionts representing entire solutions. The strategy of localized coevolution and the concept of steady-state genetic algorithms are used to improve the search efficiency. The experimental results reveal that EEA is better than two compared symbiotic evolutionary algorithms as well as a traditional genetic algorithm in solution quality.

Feasibility Test of the Numerical Optimization for the Fast IMRT Planning

  • Cheong, Kwang-Ho;Suh, Tae-Suk;Dempsey, James F.
    • Proceedings of the Korean Society of Medical Physics Conference
    • /
    • 2005.04a
    • /
    • pp.79-82
    • /
    • 2005
  • In this study, we have tested the feasibility of the convex non-linear objective model and the line search optimization method for the fluence map optimization (FMO). We've created the convex nonlinear objective function with simple bound constraints and attained the optimal solution using well-known gradient algorithms with an Armijo line search that requires sufficient objective function decrease. The algorithms were applied to 10 head-and-neck cases. The numbers of beamlets were between 900 and 2,100 with a 3 mm isotropic dose grid. Nonlinear optimization methods could efficiently solve the IMRT FMO problem in well under a minute with high quality for clinical cases.

  • PDF

Fast Object Recognition using Local Energy Propagation from Combination of Saline Line Groups (직선 조합의 에너지 전파를 이용한 고속 물체인식)

  • 강동중
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • pp.311-311
    • /
    • 2000
  • We propose a DP-based formulation for matching line patterns by defining a robust and stable geometric representation that is based on the conceptual organizations. Usually, the endpoint proximity and collinearity of image lines, as two main conceptual organization groups, are useful cues to match the model shape in the scene. As the endpoint proximity, we detect junctions from image lines. We then search for junction groups by using geometric constraint between the junctions. A junction chain similar to the model chain is searched in the scene, based on a local comparison. A Dynamic Programming-based search algorithm reduces the time complexity for the search of the model chain in the scene. Our system can find a reasonable matching, although there exist severely distorted objects in the scene. We demonstrate the feasibility of the DP-based matching method using both synthetic and real images.

  • PDF

Waveform Detection Algorithm based on the Search of Distinctive Line-Segments (검색에 기초한 파형 검출 알고리듬)

  • 박승훈;장태규
    • Journal of Biomedical Engineering Research
    • /
    • v.14 no.3
    • /
    • pp.265-272
    • /
    • 1993
  • We present a new waveform detection method, based on the search of distinctive line-segments. The method is based on the basic assumption that the waveform morphology of biological signals is readily characterized by a sequence of the distinctive line-segments and their structural features. In this method, the distinctive line-segments are first searched for, and a structural feature analysis is performed an the distinctive line-segments found. Experiments of detecting epileptic spikes were carried out to evaluate the detection per formance of the method. Two subjects were used for training and tuning the algorithm and four subjects for testing the method. The results were obtained on two different performance indices, detection ratio and the number of false detections per minute.

  • PDF

EEG WAVEFORM DETECTION BASED ON THE SEARCH OF DISTINCTIVE LINE-SEGMENTS (특징적인 직선요소들의 검색에 기초한 EEG 파형 검출)

  • Park, Seung-Hun;Chang, Tae-Kyu
    • Proceedings of the KOSOMBE Conference
    • /
    • v.1992 no.05
    • /
    • pp.121-122
    • /
    • 1992
  • We present a new EEG waveform detection method, based on the search of distinctive line-segments. The method is based on the assumption that EEG waveform morphology is characterized by a sequence of its distinctive line-segments and their structural features. In this method, the distinctive line segments are first searched for, and the structural feature analysis is performed on the found line-segment sequence. Experiments of detecting epileptic spikes are performed on four different subjects.

  • PDF

Heuristics Method for Sequencing Mixed Model Assembly Lines with Hybridworkstation (혼합작업장을 고려한 혼합모델 조립라인의 투입순서결정에 관한 탐색적기법)

  • 김정자;김상천;공명달
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.21 no.48
    • /
    • pp.299-310
    • /
    • 1998
  • Actually mixed assembly line is mixed with open and close type workstation. This workstation is called hybridworkstation. The propose of this paper is to determine the sequencing of model that minimize line length for actual(hybridworkstation) mixed model assembly line. we developed three mathematical formulation of the problem to minimize the overall length of a line with hybrid station. Mathematical formulation classified model by operato schedule. Mixed model assembly line is combination program and NP-hard program. Thus computation time is often a critical factor in choosing a method of determining the sequence. This study suggests a tabu search technique which can provide a near optimal solution in real time and use the hill climbing heuristic method for selecting initial solution. Modified tabu search method is compared with MIP(Mixed Integer Program). Numerical results are reported to demonstrate the efficiency of the method.

  • PDF

Realization of a virtual Instrumentation system for On-Line LIM Performance Monitoring (유도형 리니어모터 성능의 온$\cdot$라인 모니터링을 위한 가상계측시스템 구현)

  • Jang, Seok-Myeong;Lee, Sung-Ho;Chang, Kun-Woo;Jeong, Sang-Sub
    • The Transactions of the Korean Institute of Electrical Engineers B
    • /
    • v.50 no.5
    • /
    • pp.205-213
    • /
    • 2001
  • This paper presents a virtual instrumentation(VI) system for LIMs performance on-line monitoring. The VI is designed using the graphical programming language LabVIEW and is capable of performing on-line measurement functions, including data acquisition, display, and analyses in the time and frequency domains, as well as data archiving. To monitor in real time the steady-state and transient electromagnetic thrust of LIMs, the search coil is used for the determination of the flux linkage components, which is then multiplied by the appropriate current components to yield a signal proportional to the electromagnetic thrust. This paper reports the LIM's dynamics measured by the proposed on-line monitoring system.

  • PDF

On the Acceleration of Redundancy Identification for VLSI Logic Optimization (VLSI 논리설계 최적화를 위한 Redundancy 조사 가속화에 관한 연구)

  • Lee, Seong-Bong;Chong, Jong-Wha
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.3
    • /
    • pp.131-136
    • /
    • 1990
  • In this paper, new methods are proposed which speed up the logical redundancy identification for the gate-level logic optimization. Redundancy indentification, as well as deterministic test pattern generation, can be viewed as a finite space search problem, of which execution time depends on the size of the search space. For the purpose of efficient search, we propose dynamic head line and mandatory assignment. Dynamic head lines are changed dynamically in the process of the redundancy identification. Mandatory assignement can avoid unnecessary assignment. They can reduce the search size efficiently. Especially they can be used even though the circuit is modified in the optimization procedure, that is different from the test pattern generation methods. Some experimental results are presented indicating that the proposed methods are faster than existing methods.

  • PDF