• Title/Summary/Keyword: path-dependent

Search Result 373, Processing Time 0.05 seconds

Optimal Acoustic Search Path Planning Based on Genetic Algorithm in Discrete Path System (이산 경로 시스템에서 유전알고리듬을 이용한 최적음향탐색경로 전략)

  • CHO JUNG-HONG;KIM JUNG-HAE;KIM JEA-SOO;LIM JUN-SEOK;KIM SEONG-IL;KIM YOUNG-SUN
    • Journal of Ocean Engineering and Technology
    • /
    • v.20 no.1 s.68
    • /
    • pp.69-76
    • /
    • 2006
  • The design of efficient search path to maximize the Cumulative Detection Probability(CDP) is mainly dependent on experience and intuition when searcher detect the target using SONAR in the ocean. Recently with the advance of modeling and simulation method, it has been possible to access the optimization problems more systematically. In this paper, a method for the optimal search path calculation is developed based on the combination of the genetic algorithm and the calculation algorithm for detection range. We consider the discrete system for search path, space, and time, and use the movement direction of the SONAR for the gene of the genetic algorithm. The developed algorithm, OASPP(Optimal Acoustic Search Path Planning), is shown to be effective, via a simulation, finding the optimal search path for the case when the intuitive solution exists. Also, OASPP is compared with other algorithms for the measure of efficiency to maximize CDP.

Quickest Path Algorithm for Improving Quality of Services in Communication Networks (통신 품질 향상을 위한 최단 시간 경로 알고리즘)

  • 윤석환;김평중;김진수
    • Journal of Korean Society for Quality Management
    • /
    • v.26 no.1
    • /
    • pp.192-200
    • /
    • 1998
  • The quickest path problem is one of the important things for quality of services in communication networks. It is to find a path to send a given amount of data from the source to the sink with minimum transmission time, where the transmission time is dependent on both the capacities and the traversal times of the arcs in the network. This is found under the networks that the capacity and the lead time of each ring are predetermined. It is general to solve the quickest path problem using shortest path algorithms. The relevant algorithms proposed till now are based on the capacity of rings in distributed environments. When the configuration of networks is changed, there can be two a, pp.oaches to find the quickest paths. The one is to find new quickest paths, and the other is to update the current quickest paths. As one of the algorithms for the latter, the distributed quickest path update algorithm was proposed. This paper aims to propose the distributed algorithm a, pp.icable to find the quickest path, when the configuration of networks is changed, using the quickest path tree update altorithm, and to verify its possibility of a, pp.ication by analyzing the transmission amount of data from one node to another from the theoretical point of view.

  • PDF

Modification Distance Model using Headible Path Contexts for Korean Dependency Parsing (지배가능 경로 문맥을 이용한 의존 구문 분석의 수식 거리 모델)

  • Woo, Yeon-Moon;Song, Young-In;Park, So-Young;Rim, Hae-Chang
    • Journal of KIISE:Software and Applications
    • /
    • v.34 no.2
    • /
    • pp.140-149
    • /
    • 2007
  • This paper presents a statistical model for Korean dependency-based parsing. Although Korean is one of free word order languages, it has the feature of which some word order is preferred to local contexts. Earlier works proposed parsing models using modification lengths due to this property. Our model uses headible path contexts for modification length probabilities. Using a headible path of a dependent it is effective for long distance relation because the large surface context for a dependent are abbreviated as its headible path. By combined with lexical bigram dependency, our probabilistic model achieves 86.9% accuracy in eojoel analysis for KAIST corpus, more improvement especially for long distance dependencies.

Shallow Water Low-frequency Reverberation Model (천해 저주파 잔향음 예측모델)

  • 김남수;오선택;나정열
    • The Journal of the Acoustical Society of Korea
    • /
    • v.21 no.8
    • /
    • pp.679-685
    • /
    • 2002
  • Low-frequency mono-static reverberation model for shallow-water environment is presented. It is necessary to develop the transmission loss model to calculate the sub-bottom interaction because the ray-based transmission loss model is difficult to compute the pressure accurately which penetrates the bottom medium. In this paper reverberation level is calculated using the RAM (Range dependent Acoustic Model) to augment the multi-path expansion model because it does not estimate transmission loss accurately in shallow water. The signals generated by the L-HYREV and the GSM are compared with the observed signals and it is showed that the L-HYREV model provides a closer fit to the observed signals than those obtained using the GSM.

Study on the Annoyance Response in the Area Exposed by Road Traffic Noise and Railway Noise (도로교통소음과 철도소음 복합노출지역에서의 성가심 반응)

  • Ko, Joon-Hee;Chang, Seo-Il;Son, Jin-Hee;Lee, Kun
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.20 no.2
    • /
    • pp.172-178
    • /
    • 2010
  • The multiple regression analysis and path analysis in each dominant area of noise source are conducted to analyze the relationship between dependent variables like annoyance and independent ones such as noise and non-noise factors. The multiple regression analysis shows that impact of noise factors is the highest to annoyance in dominant areas of road traffic and railway noise. Meanwhile, impact of non-noise factors such as sensitivity and satisfaction of environment on annoyance is also high in these areas. The path analysis result for multivariate analysis between various independent and dependent variables is similar to that of the multiple regression analysis. However, noise factor is the greatest factor influent on annoyance in the dominant areas of the combined noise, and relationship between annoyance and sensitivity is the highest in combined area exposed to road traffic noise and railway noise.

Seismic Analysis of Underground RC Structures considering Interface between Structure and Soil (경계면 요소를 고려한 지하 철근콘크리트 구조물의 지진해석)

  • 남상혁;변근주;송하원;박성민
    • Proceedings of the Korea Concrete Institute Conference
    • /
    • 2000.10a
    • /
    • pp.87-92
    • /
    • 2000
  • The real situation of an underground reinforced concrete(RC) structure with the surrounding soil medium subjected to seismic load is quite difficult to be simulated through an expensive work and, even if it is possible to arrange such an experiment, it will be too expensive. So development of analytical method can be applied usefully to seismic design and seismic retrofit through an analysis of seismic behavior and seismic performance evaluation. A path-dependent constitutive model for soil that can estimate the response of soil layer is indispensible for dealing with kinematic interaction of RC/soil entire system under seismic loads. And interface model which deals with the dynamic interaction of RC/soil entire system is also necessary. In this study, finite element analysis program that can consider path-dependent behavior of RC and soil, and interfacial behavior between RC and soil is developed for rational seismic analysis of RC/soil entire system. Using this program, nonlinear behavior of interface between RC and soil is analyzed, and the effect of interfacial behavior to entire system is investigated.

  • PDF

Noise Elimination of Speckle Fringe Phasemap (반점 간섭무늬 위상단면도의 잡음제거)

  • 조재완;홍석경;백성훈;김철중
    • Korean Journal of Optics and Photonics
    • /
    • v.5 no.2
    • /
    • pp.217-224
    • /
    • 1994
  • The combination of both phase-shifting convolution and 2-bit quantization smoothing filter was used to reduce speckle noise from saw-tooth speckle fringes phase map, obtained in phase-shifting speckle interferometer. The phase-shifting convolution showed the noise reduction capability of speckle fringe without destroying edge information across 271 jump. Also, it was shown that the 2-bit quantization smoothing filter was superior to average, low-pass filter and median filter in speeding up smoothing process and enhancing SIN ratio. Finally, a path dependent unwrapping algorithm was used to unwrap a noise reduced 271 modulo speckle phasemap. semap.

  • PDF

A Bayesian Approach to Dependent Paired Comparison Rankings

  • Kim, Hea-Jung;Kim, Dae-Hwang
    • Proceedings of the Korean Statistical Society Conference
    • /
    • 2003.05a
    • /
    • pp.85-90
    • /
    • 2003
  • In this paper we develop a method for finding optimal ordering of K statistical models. This is based on a dependent paired comparison experimental arrangement whose results can naturally be represented by a completely oriented graph (also so called tournament graph). Introducing preference probabilities, strong transitivity conditions, and an optimal criterion to the graph, we show that a Hamiltonian path obtained from row sum ranking is the optimal ordering. Necessary theories involved in the method and computation are provided. As an application of the method, generalized variances of K multivariate normal populations are compared by a Bayesian approach.

  • PDF

Twinax Cable Modeling for Use in HANbit ACE64 ATM Switching Systems (HANbit ACE64 ATM 교환기 시스템의 Twinax 케이블 모델링)

  • 남상식;박종대
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.12A
    • /
    • pp.1985-1991
    • /
    • 1999
  • In this paper, complete and general two-port lumped Spice-network model is developed for a lossy transmission line. This model is realized as a Spice subcircuit, by means of standard lumped network elements and mathematical functions. It is used as a component in the time-domain simulation of a high-speed data transmission line such as IMI(Inter Module Interface) data path in HANbit ACE 64 ATM switching system. The only required Spice network elements are resistance and frequency-dependent controlled-voltage sources. Such frequency-dependent sources are realized by utilizing the standard Hspice mathematical functions FREQ, DELAY, and POLY.

  • PDF