• 제목/요약/키워드: Probability of Success

검색결과 273건 처리시간 0.03초

Redundancy Minimizing Techniques for Robust Transmission in Wireless Networks

  • Kacewicz, Anna;Wicker, Stephen B.
    • Journal of Communications and Networks
    • /
    • 제11권6호
    • /
    • pp.564-573
    • /
    • 2009
  • In this paper, we consider a wireless multiple path network in which a transmitting node would like to send a message to the receiving node with a certain probability of success. These two nodes are separated by N erasure paths, and we devise two algorithms to determine minimum redundancy and optimal symbol allocation for this setup. We discuss the case with N = 3 and then extend the case to an arbitrary number of paths. One of the algorithms minimum redundancy algorithm in exponential time is shown to be optimal in several cases, but has exponential running time. The other algorithm, minimum redundancy algorithm in polynomial time, is sub-optimal but has polynomial worstcase running time. These algorithms are based off the theory of maximum-distance separable codes. We apply the MRAET algorithm on maximum-distance separable, Luby transform, and Raptor codes and compare their performance.

Sampling Based Approach for Combining Results from Binomial Experiments

  • 조장식;김달호;강상길
    • Journal of the Korean Data and Information Science Society
    • /
    • 제12권1호
    • /
    • pp.1-9
    • /
    • 2001
  • In this paper, the problem of information related to I binomial experiments, each having a distinct probability of success ${\theta}_i$, i = 1,2, $\cdots$, I, is considered. Instead of using a standard exchangeable prior for ${\theta}\;=\;({\theta}_1,\;{\theta}_2,\;{\cdots},\;{\theta}_I)$, we con-sider a partition of the experiments and take the ${\theta}_i$'s belonging to the same partition subset to be exchangeable and the ${\theta}_i$'s belonging to distinct subsets to be independent. And we perform Gibbs sampler approach for Bayesian inference on $\theta$ conditional on a partition. Also we illustrate the methodology with a real data.

  • PDF

청소년 상담사례 검색 시스템에 관한 연구 (Research of a Counselling Cases Search System for Student-Counselling)

  • 이지현;장혜숙;박기홍
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2002년도 추계종합학술대회
    • /
    • pp.632-635
    • /
    • 2002
  • 본 연구는 학교에서 얻어지는 교사들의 경험을 바탕으로 인터넷을 통한 학생상담의 효율성 증대를 위한 상담 사례 검색 시스템을 구축하는데 있다. 이 시스템은 관리자 모듈과 사용자 모듈로 구성되어 있다. 사용자 모듈은 상담사례 검색 및 입력, 게시판, 자료실 등을 이용할 수 있게 되어 있으며, 관리자 모듈은 자료 관리와 회원 관리 기능을 제공한다. 본 상담사례 검색 시스템은 학생 상담의 성공 확률을 증대시킬 수 있다. 교사가 인터넷을 이용하여 그들의 상담사례를 원격지에서도 쉽게 공유할 수 있기 때문이다.

  • PDF

전역근사최적화를 위한 소프트컴퓨팅기술의 활용 (Utilizing Soft Computing Techniques in Global Approximate Optimization)

  • 이종수;장민성;김승진;김도영
    • 한국전산구조공학회:학술대회논문집
    • /
    • 한국전산구조공학회 2000년도 봄 학술발표회논문집
    • /
    • pp.449-457
    • /
    • 2000
  • The paper describes the study of global approximate optimization utilizing soft computing techniques such as genetic algorithms (GA's), neural networks (NN's), and fuzzy inference systems(FIS). GA's provide the increasing probability of locating a global optimum over the entire design space associated with multimodality and nonlinearity. NN's can be used as a tool for function approximations, a rapid reanalysis model for subsequent use in design optimization. FIS facilitates to handle the quantitative design information under the case where the training data samples are not sufficiently provided or uncertain information is included in design modeling. Properties of soft computing techniques affect the quality of global approximate model. Evolutionary fuzzy modeling (EFM) and adaptive neuro-fuzzy inference system (ANFIS) are briefly introduced for structural optimization problem in this context. The paper presents the success of EFM depends on how optimally the fuzzy membership parameters are selected and how fuzzy rules are generated.

  • PDF

한국형 무인 경비정(USV)의 개념설계에 관한 연구 (A Study on the Conceptual Design of an Unmanned Surface Vehicle(USV) for the Korean Navy)

  • 부성윤
    • 한국군사과학기술학회지
    • /
    • 제7권3호
    • /
    • pp.59-68
    • /
    • 2004
  • Unmanned surface vehicles(USVs) have been developed for special operations in foreign navies. These will be employed to conduct critical missions including inspection, coast guard, ISR, fire protection, precision strike, mine interception warfare and antisubmarine warfare. It is also known the USVs will be deployed at the front line of the network-centric warfare to replace the manned naval operations. The unmanned operation can, thus, minimize unnecessary risk to personnel and enhance the success probability for the imposed mission. In this research, the USVs which are under operation and development in foreign navies are investigated. Based on this, an USV with $7\~10m$ of length and 10ton of weight for the Korean Navy which can be deployed near the Northern Limit Line(NLL), is proposed.

3GPP MAC 알고리즘 안전성 분석 (An analysis on the security of the 3GPP MAC algorithm)

  • 홍도원;신상욱;강주성;이옥연
    • 정보보호학회논문지
    • /
    • 제11권2호
    • /
    • pp.59-65
    • /
    • 2001
  • 비동기식(W-CDMA) 3세대 이동통신의 3GPP에서는 무선 구간의 메시지 무결성을 보장하기 위하여 블록 암호 KASUMI에 기반한 CBC-MAC의 변형된 형태를 제안하고 있다. 본 논문에서는 최근 발표된 Knudsen-Mitchell의 공격법 을 심층 분석하여 구체적인 공격 수행 알고리즘을 제안하고, 이 알고리즘의 성공 확률 및 수행 복잡도를 계산한다. 또 한, 3GPP-MAC에 대한 안전성을 기존 CBC-MAC 방식과 비교하여 분석한다

Machine Learning Based Neighbor Path Selection Model in a Communication Network

  • Lee, Yong-Jin
    • International journal of advanced smart convergence
    • /
    • 제10권1호
    • /
    • pp.56-61
    • /
    • 2021
  • Neighbor path selection is to pre-select alternate routes in case geographically correlated failures occur simultaneously on the communication network. Conventional heuristic-based algorithms no longer improve solutions because they cannot sufficiently utilize historical failure information. We present a novel solution model for neighbor path selection by using machine learning technique. Our proposed machine learning neighbor path selection (ML-NPS) model is composed of five modules- random graph generation, data set creation, machine learning modeling, neighbor path prediction, and path information acquisition. It is implemented by Python with Keras on Tensorflow and executed on the tiny computer, Raspberry PI 4B. Performance evaluations via numerical simulation show that the neighbor path communication success probability of our model is better than that of the conventional heuristic by 26% on the average.

네트워크 취약성 분석을 위한 확장된 사이버 공격 트리에 관한 연구 (A Study on an Extended Cyber Attack Tree for an Analysis of Network Vulnerability)

  • 엄정호;박선호;정태명
    • 디지털산업정보학회논문지
    • /
    • 제6권3호
    • /
    • pp.49-57
    • /
    • 2010
  • We extended a general attack tree to apply cyber attack model for network vulnerability analysis. We defined an extended cyber attack tree (E-CAT) which extends the general attack tree by associating each node of the tree with a transition of attack that could have contributed to the cyber attack. The E-CAT resolved the limitation that a general attack tree can not express complex and sophisticate attacks. Firstly, the Boolean expression can simply express attack scenario with symbols and codes. Secondary, An Attack Generation Probability is used to select attack method in an attack tree. A CONDITION-composition can express new and modified attack transition which a aeneral attack tree can not express. The E-CAT is possible to have attack's flexibility and improve attack success rate when it is applied to cyber attack model.

Viterbi 검색 기법을 이용한 한국어 음성 언어의 형태소 분석 (Morphological analysis of spoken Korean using Viterbi search)

  • 김병창
    • 한국음향학회:학술대회논문집
    • /
    • 한국음향학회 1995년도 제12회 음성통신 및 신호처리 워크샵 논문집 (SCAS 12권 1호)
    • /
    • pp.200-203
    • /
    • 1995
  • This paper proposes a spoken Korean processing model which is extensible to large vocabulary continuous spoken Korean system. The integration of phoneme level speech recognition with natural language processing can support a sophisticated phonological/morphological analysis. The model consists of a diphone speech recognizer, a viterbi dictionaly searcher and a morpheme connectivity information checker. Two-level hierarchical TDNNs recognize newly defined Korean diphones. The diphone sequences are segmented and converted to the most probable morpheme sequences by the Viterbi dictionary searcher. The morpheme sequency are then examined by the morpheme connectivity information checker and the correct morpheme sequence which has the greatest probability is collected. The experiments show that the morphological analysis for spoken Korean can be achieved for 328 Eojeols with 80.6% success rate.

  • PDF

미국중재에서의 임시처분에 관한 고찰 (Interim Measures in the United States' Arbitration)

  • 하충룡
    • 한국중재학회지:중재연구
    • /
    • 제19권3호
    • /
    • pp.43-66
    • /
    • 2009
  • This paper investigates what are the types and legal grounds for interim measures in the U.S. arbitration practices. The statutory ground for the interim measures is the Revised Uniform Arbitration Act. Another ground, probably the most important, is the parties' own intentions to adopt the interim measures in their arbitration proceeding. Most typical interim measures in arbitration include preliminary injuction, attachment and antisuit injunction. In the U.S ex parte motion for interim measure is rarely allowed while the Revised UNCITRAL Model Law specified an ex parte interim measure. In launching the interim measures, the US courts have demanded several requirements including imparability, probability of success and passing of the balance test. In general, the U.S. courts have properly interfered with the procedural issues in arbitration unreined but leaving the substantive issues untouched. It is believed that such interference has helped to enhance the credibility in arbitration with respect to fairness and justice.

  • PDF