• Title/Summary/Keyword: Automatic Search

Search Result 377, Processing Time 0.024 seconds

An Automatic Segmentation System Based on HMM and Correction Algorithm (HMM 및 보정 알고리즘을 이용한 자동 음성 분할 시스템)

  • Kim, Mu-Jung;Kwon, Chul-Hong
    • Speech Sciences
    • /
    • v.9 no.4
    • /
    • pp.265-274
    • /
    • 2002
  • In this paper we propose an automatic segmentation system that outputs the time alignment information of phoneme boundary using Viterbi search with HMM (Hidden Markov Model) and corrects these results by an UVS (unvoiced/voiced/silence) classification algorithm. We selecte a set of 39 monophones and a set of 647 extended phones for HMM models. For the UVS classification we use the feature parameters such as ZCR (Zero Crossing Rate), log energy, spectral distribution. The result of forced alignment using the extended phone set is 11% better than that of the monophone set. The UVS classification algorithm shows high performance to correct the segmentation results.

  • PDF

Automatic Design of Steel Frame Using Nonlinear Analysis (비선형 해석을 이용한 강뼈대구조물의 자동화설계)

  • 김창성;마상수;김승억
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2002.10a
    • /
    • pp.287-294
    • /
    • 2002
  • An automatic design method of steel frames using nonlinear analysis is developed. The geometric nonlinearity is considered by the use of stability functions. A direct search method is used as an automatic design technique. The unit value of each member is evaluated by using LRFD Interaction equation. The member with the largest unit value Is replaced one by one with an adjacent larger member selected in the database. The weight of the steel frame is taken as an objective function. Load-carrying capacities, deflections, interstory drifts, and ductility requirement are used as constraint functions. Case study of a three-dimensional two story frame are presented.

  • PDF

Knowledge Representation for the Automatic Shutdown System in Boiler Plants (보일러 플랜트의 자동 Shutdown 시스템을 위한 지식표현)

  • 송한영;황규석
    • Journal of the Korean Society of Safety
    • /
    • v.11 no.3
    • /
    • pp.143-153
    • /
    • 1996
  • Shutdown of boiler plants is a dynamic, complicated, and hazardous operation. Operational error is a major contributor to danserous situations during boiler plant shutdowns. It is important to develop an automatic system which synthesizes operating procedures to safely go from normal operation to complete shutdown. Knowledge representation for automatic shutdown of boiler plants makes use of the hierarchical, rule-based framework for heuristic knowledge, the semantic network, frame for process topology, and AI techniques such as rule matching, forward chaining, backward chaining, and searching. This knowledge representation and modeling account for the operational states, primitive operation devices, effects of their application, and planning methodology. Also, this is designed to automatically formulate subgoals, search for positive operation devices, formulate constraints, and synthesize shutdown procedures in boiler plants.

  • PDF

Crater Wear Measurement Using Computer Vision and Automatic Focusing (컴퓨터 비젼 및 자동초점장치를 이용한 크레이타 마멸측정)

  • Yang, Min-Yang;Gwon, O-Dal
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.20 no.12
    • /
    • pp.3759-3766
    • /
    • 1996
  • In this paper a new gefchmique to measaure the creater wear using image processing and automatic focusing is presented. The contour detection algorithm, which can adopt ina noisy image, is suggested. It is suitable for eliminating high frequency noses with lower processing time and without blurring. An automatic focusing technique is applied to measure a createrwear depth with a one-dimensional search algorithm for finding the bestfocus. This method is implemented in the tool microscope driven by a servo motor. The results show that the countour and depth of crater wear can be measured reliably.

A Search-Result Clustering Method based on Word Clustering for Effective Browsing of the Paper Retrieval Results (논문 검색 결과의 효과적인 브라우징을 위한 단어 군집화 기반의 결과 내 군집화 기법)

  • Bae, Kyoung-Man;Hwang, Jae-Won;Ko, Young-Joong;Kim, Jong-Hoon
    • Journal of KIISE:Software and Applications
    • /
    • v.37 no.3
    • /
    • pp.214-221
    • /
    • 2010
  • The search-results clustering problem is defined as the automatic and on-line grouping of similar documents in search results returned from a search engine. In this paper, we propose a new search-results clustering algorithm specialized for a paper search service. Our system consists of two algorithmic phases: Category Hierarchy Generation System (CHGS) and Paper Clustering System (PCS). In CHGS, we first build up the category hierarchy, called the Field Thesaurus, for each research field using an existing research category hierarchy (KOSEF's research category hierarchy) and the keyword expansion of the field thesaurus by a word clustering method using the K-means algorithm. Then, in PCS, the proposed algorithm determines the category of each paper using top-down and bottom-up methods. The proposed system can be used in the application areas for retrieval services in a specialized field such as a paper search service.

An Optimized e-Lecture Video Search and Indexing framework

  • Medida, Lakshmi Haritha;Ramani, Kasarapu
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.8
    • /
    • pp.87-96
    • /
    • 2021
  • The demand for e-learning through video lectures is rapidly increasing due to its diverse advantages over the traditional learning methods. This led to massive volumes of web-based lecture videos. Indexing and retrieval of a lecture video or a lecture video topic has thus proved to be an exceptionally challenging problem. Many techniques listed by literature were either visual or audio based, but not both. Since the effects of both the visual and audio components are equally important for the content-based indexing and retrieval, the current work is focused on both these components. A framework for automatic topic-based indexing and search depending on the innate content of the lecture videos is presented. The text from the slides is extracted using the proposed Merged Bounding Box (MBB) text detector. The audio component text extraction is done using Google Speech Recognition (GSR) technology. This hybrid approach generates the indexing keywords from the merged transcripts of both the video and audio component extractors. The search within the indexed documents is optimized based on the Naïve Bayes (NB) Classification and K-Means Clustering models. This optimized search retrieves results by searching only the relevant document cluster in the predefined categories and not the whole lecture video corpus. The work is carried out on the dataset generated by assigning categories to the lecture video transcripts gathered from e-learning portals. The performance of search is assessed based on the accuracy and time taken. Further the improved accuracy of the proposed indexing technique is compared with the accepted chain indexing technique.

Adaptive Learning Control of Electro-Hydraulic Servo System Using Real-Time Evolving Neural Network Algorithm (실시간 진화 신경망 알고리즘을 이용한 전기.유압 서보 시스템의 적응 학습제어)

  • Jang, Seong-Uk;Lee, Jin-Geol
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.8 no.7
    • /
    • pp.584-588
    • /
    • 2002
  • The real-time characteristic of the adaptive leaning control algorithms is validated based on the applied results of the hydraulic servo system that has very strong a non-linearity. The evolutionary strategy automatically adjusts the search regions with natural competition among many individuals. The error that is generated from the dynamic system is applied to the mutation equation. Competitive individuals are reduced with automatic adjustments of the search region in accordance with the error. In this paper, the individual parents and offspring can be reduced in order to apply evolutionary algorithms in real-time. The feasibility of the newly proposed algorithm was demonstrated through the real-time test.

Evolutionary Computation for the Real-Time Adaptive Learning Control(II) (실시간 적응 학습 제어를 위한 진화연산(II))

  • Chang, Sung-Ouk;Lee, Jin-Kul
    • Proceedings of the KSME Conference
    • /
    • 2001.06b
    • /
    • pp.730-734
    • /
    • 2001
  • In this study in order to confirm the algorithms that are suggested from paper (I) as the experimental result, as the applied results of the hydraulic servo system are very strong a non-linearity of the fluid in the computer simulation, the real-time adaptive learning control algorithms is validated. The evolutionary strategy has characteristics that are automatically. adjusted in search regions with natural competition among many individuals. The error that is generated from the dynamic system is applied to the mutation equation. Competitive individuals are reduced with automatic adjustments of the search region in accord with the error. In this paper, the individual parents and offspring can be reduced in order to apply evolutionary algorithms in real-time as the description of the paper (I). The possibility of a new approaching algorithm that is suggested from the computer simulation of the paper (I) would be proved as the verification of a real-time test and the consideration its influence from the actual experiment.

  • PDF

Application of Simulated Annealing and Tabu Search for Loss Minimization in Distribution Systems (베전 계통의 손실 최소화를 위한 시뮬레이티드 어닐링과 타부 탐색의 적용)

  • Jeon, Young-Jae;Kim, Jae-Chul
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.50 no.1
    • /
    • pp.28-37
    • /
    • 2001
  • This paper presents an efficient algorithm for the loss minimization of distribution system by automatic sectionalizing switch operation in large scale distribution systems. Simulated annealing is particularly well suited for large combinational optimization problem, but the use of this algorithm is also responsible for an excessive computation time requirement. Tabu search attempts to determine a better solution in the manner of a greatest-descent algorithm, but it can not give any guarantee for the convergence property. The hybrid algorithm of two methods with two tabu lists and the proposed perturbation mechanism is applied to improve the computation time and convergence property Numerical examples demonstrate the validity and effectiveness of the proposed methodology using a KEPCO's distribution system.

  • PDF

Strategies for the Automatic Decision of Railway Shunting Routes Based on the Heuristic Search Method (휴리스틱 탐색기법에 근거한 철도입환진로의 자동결정전략 설계)

  • Ko Yun-Seok
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.52 no.5
    • /
    • pp.283-289
    • /
    • 2003
  • This paper proposes an expert system which can determine automatically the shunting routes corresponding to the given shunting works by considering totally the train operating environments in the station. The expert system proposes the multiple shunting routes with priority of selection based on heuristic search strategy. Accordingly, system operator can select a shunting route with the safety and efficiency among the those shunting routes. The expert system consists of a main inference engine and a sub inference engine. The main inference engine determines the shunting routes with selection priority using the segment routes obtained from the sub inference engine. The heuristic rules are extracted from operating knowledges of the veteran route operator and station topology. It is implemented in C computer language for the purpose of the implementation of the inference engine using the dynamic memory allocation technique. And, the validity of the builted expert system is proved by a test case for the model station.