• Title/Summary/Keyword: Probabilistic search

Search Result 98, Processing Time 0.032 seconds

A Parser of Definitions in Korean Dictionary based on Probabilistic Grammar Rules (확률적 문법규칙에 기반한 국어사전의 뜻풀이말 구문분석기)

  • Lee, Su Gwang;Ok, Cheol Yeong
    • Journal of KIISE:Software and Applications
    • /
    • v.28 no.5
    • /
    • pp.448-448
    • /
    • 2001
  • The definitions in Korean dictionary not only describe meanings of title, but also include various semantic information such as hypernymy/hyponymy, meronymy/holonymy, polysemy, homonymy, synonymy, antonymy, and semantic features. This paper purposes to implement a parser as the basic tool to acquire automatically the semantic information from the definitions in Korean dictionary. For this purpose, first we constructed the part-of-speech tagged corpus and the tree tagged corpus from the definitions in Korean dictionary. And then we automatically extracted from the corpora the frequency of words which are ambiguous in part-of-speech tag and the grammar rules and their probability based on the statistical method. The parser is a kind of the probabilistic chart parser that uses the extracted data. The frequency of words which are ambiguous in part-of-speech tag and the grammar rules and their probability resolve the noun phrase's structural ambiguity during parsing. The parser uses a grammar factoring, Best-First search, and Viterbi search In order to reduce the number of nodes during parsing and to increase the performance. We experiment with grammar rule's probability, left-to-right parsing, and left-first search. By the experiments, when the parser uses grammar rule's probability and left-first search simultaneously, the result of parsing is most accurate and the recall is 51.74% and the precision is 87.47% on raw corpus.

Probabilistic study on buildings with MTMD system in different seismic performance levels

  • Etedali, Sadegh
    • Structural Engineering and Mechanics
    • /
    • v.81 no.4
    • /
    • pp.429-441
    • /
    • 2022
  • A probabilistic assessment of the seismic-excited buildings with a multiple-tuned-mass-damper (MTMD) system is carried out in the presence of uncertainties of the structural model, MTMD system, and the stochastic model of the seismic excitations. A free search optimization procedure of the individual mass, stiffness and, damping parameters of the MTMD system based on the snap-drift cuckoo search (SDCS) optimization algorithm is proposed for the optimal design of the MTMD system. Considering a 10-story structure in three cases equipped with single tuned mass damper (STMS), 5-TMD and 10-TMD, sensitivity analyses are carried out using Sobol' indices based on the Monte Carlo simulation (MCS) method. Considering different seismic performance levels, the reliability analyses are done using MCS and kriging-based MCS methods. The results show the maximum structural responses are more affected by changes in the PGA and the stiffness coefficients of the structural floors and TMDs. The results indicate the kriging-based MCS method can estimate the accurate amount of failure probability by spending less time than the MCS. The results also show the MTMD gives a significant reduction in the structural failure probability. The effect of the MTMD on the reduction of the failure probability is remarkable in the performance levels of life safety and collapse prevention. The maximum drift of floors may be reduced for the nominal structural system by increasing the TMDs, however, the complexity of the MTMD model and increasing its corresponding uncertainty sources can be caused a slight increase in the failure probability of the structure.

A Comparative Study on Probabilistic Structural Design Optimization (확률론적 구조설계 최적화기법에 대한 비교연구)

  • 양영순;이재옥
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.14 no.2
    • /
    • pp.213-224
    • /
    • 2001
  • 확률론적 구조설계 최적화는 구조물의 역학적 특성이나 하중의 불확실성이나 임의성과 같은 변동성을 정량적이고 합리적으로 고려할 수 있다는 점에서 기존의 전통적인 확정론적 최적화와 비교된다. 확률론적 최적화의 방법론으로는 개선된 일계이차모멘트법을 이용하는 신뢰도지수에 기반한 접근법(MPFP search)이 널리 알려져 있으며, 최근 목표성능치에 기반한 접근법(MPTP search)이 새롭게 제안되었다. 본 논문에서는 이들 두 가지 접근법에 대한 정식화를 수행하고, 특히 탐색과정에서 소모적인 반복계산을 발견하고 제거하는 알고리즘을 제시하였다. 예제에서 두 접근법에 의한 확률론적 최적화를 수행하고 구조설계 최적화의 관점에서 두 접근법의 장단점을 비교·검토하였다.

  • PDF

Flexible Maintenance Scheduling of Generation System by Multi-Probabilistic Reliability Criterion in Korea Power System

  • Park, Jeong-Je;Choi, Jae-Seok;Baek, Ung-Ki;Cha, Jun-Min;Lee, Kwang-Y.
    • Journal of Electrical Engineering and Technology
    • /
    • v.5 no.1
    • /
    • pp.8-15
    • /
    • 2010
  • A new technique using a search method which is based on fuzzy multi-criteria function is proposed for GMS(generator maintenance scheduling) in order to consider multi-objective function. Not only minimization of probabilistic production cost but also maximization of system reliability level are considered for fuzzy multi-criteria function. To obtain an optimal solution for generator maintenance scheduling under fuzzy environment, fuzzy multi-criteria relaxation method(fuzzy search method) is used. The practicality and effectiveness of the proposed approach are demonstrated by simulation studies for a real size power system model in Korea in 2010.

Development of Application Program for Fatigue Characteristics of Engineering Plastics (엔지니어링 플라스틱 소재의 피로특성에 대한 응용프로그램 개발)

  • Jang, Cheon-Soo;Park, Bum-Gyu;Kim, Chul-Su;Kim, Jung-Kyu
    • Proceedings of the KSME Conference
    • /
    • 2004.11a
    • /
    • pp.154-159
    • /
    • 2004
  • In this study, in order to perform more efficiently reliability design and integrity assessment of structural members, the relational database management program on the engineering plastics was constructed. This program contained 476 grades for 14 kinds of the engineering plastics and was developed using MS-access and MS-visualbasic. This program consists of 3 modules; search condition, probabilistic characteristics of material property, evaluation of P-S-N curve. We perform fatigue test for probabilistic durability analysis and this results input the database program to estimate P-S-N.

  • PDF

Reputation Analysis of Document Using Probabilistic Latent Semantic Analysis Based on Weighting Distinctions (가중치 기반 PLSA를 이용한 문서 평가 분석)

  • Cho, Shi-Won;Lee, Dong-Wook
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.3
    • /
    • pp.632-638
    • /
    • 2009
  • Probabilistic Latent Semantic Analysis has many applications in information retrieval and filtering, natural language processing, machine learning from text, and in related areas. In this paper, we propose an algorithm using weighted Probabilistic Latent Semantic Analysis Model to find the contextual phrases and opinions from documents. The traditional keyword search is unable to find the semantic relations of phrases, Overcoming these obstacles requires the development of techniques for automatically classifying semantic relations of phrases. Through experiments, we show that the proposed algorithm works well to discover semantic relations of phrases and presents the semantic relations of phrases to the vector-space model. The proposed algorithm is able to perform a variety of analyses, including such as document classification, online reputation, and collaborative recommendation.

Informatics Network Representation Using Probabilistic Graphical Models of Network Genetics (유전자 네트워크에서 확률적 그래프 모델을 이용한 정보 네트워크 추론)

  • Ra Sang-Dong;Park Dong-Suk;Youn Young-Ji
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.8
    • /
    • pp.1386-1392
    • /
    • 2006
  • This study is a numerical representative modelling analysis for applying the process that unravels networks between cells in genetics to WWW of informatics. Using the probabilistic graphical model, the insight from the data describing biological networks is used for making a probabilistic function. Rather than a complex network of cells, we reconstruct a simple lower-stage model and show a genetic representation level from the genetic based network logic. We made probabilistic graphical models from genetic data and extends them to genetic representation data in the method of network modelling in informatics.

Informatics Network Representation Between Cells Using Probabilistic Graphical Models (확률적 그래프 모델을 이용한 세포 간 정보 네트워크 추론)

  • Ra, Sang-Dong;Shin, Hyun-Jae;Cha, Wol-Suk
    • KSBB Journal
    • /
    • v.21 no.4
    • /
    • pp.231-235
    • /
    • 2006
  • This study is a numerical representative modeling analysis for the application of the process that unravels networks between cells in genetics to web of informatics. Using the probabilistic graphical model, the insight from the data describing biological networks is used for making a probabilistic function. Rather than a complex network of cells, we reconstruct a simple lower-stage model and show a genetic representation level from the genetic based network logic. We made probabilistic graphical models from genetic data and extends them to genetic representation data in the method of network modeling in informatics

Probabilistic model for bio-cells information extraction (바이오 셀 정보 추출을 위한 확률 모델)

  • Seok, Gyeong-Hyu;Park, Sung-Ho
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.6 no.5
    • /
    • pp.649-656
    • /
    • 2011
  • This study is a numerical representative modelling analysis for applying the process that unravels networks between cells in genetics to Network of informatics. Using the probabilistic graphical model, the insight from the data describing biological networks is used for making a probabilistic function. Rather than a complex network of cells, we reconstruct a simple lower-stage model and show a genetic representation level from the genetic based network logic. We made probabilistic graphical models from genetic data and extend them to genetic representation data in the method of network modelling in informatics.

Using Brackets to Improve Search for Statistical Machine Translation

  • Dekai, W.U.;Cindy, N.G.
    • Proceedings of the Korean Society for Language and Information Conference
    • /
    • 1995.02a
    • /
    • pp.195-204
    • /
    • 1995
  • We propose a method to improve search time and space complexity in statistical machine translation architectures, by employing linguistic bracketing information on the source language sentence. It is one of the advantages of the probabilistic formulation that competing translations may be compared and ranked by a. principled measure, but at the same time, optimizing likelihoods over the translation spa.ce dictates heavy search costs. To make statistical architectures practical, heuristics to reduce search computation must be incorporated. An experiment applying our method to a prototype Chinese-English translation system demonstrates substantial improvement.

  • PDF