• Title/Summary/Keyword: 경로식

Search Result 749, Processing Time 0.026 seconds

Tracking Performance Improvement of the Double-Talk Robust Algorithm for Network Echo Cancellation (네트워크 반향제거를 위한 동시통화에 강인한 알고리듬의 추적 성능 개선)

  • Yoo, Jae-Ha
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.1
    • /
    • pp.195-200
    • /
    • 2012
  • We present a new algorithm which can improve the tracking performance of the double-talk robust algorithm. A detection method of the echo path change and a modification method for the update equation of the conventional adaptive filter are proposed. A duration of the high error signal to scale parameter ratio varies according to the call status and this property is used to detect the echo path change. The proposed update equation of the adaptive filter improves the tracking performance by prohibiting wrong selection of the error signal. Simulations using real speech signals and echo paths of the ITU-T G.168 standard confirmed that as compared to the conventional algorithm, the proposed algorithm improved the tracking performance by more than 4 dB.

Multipath Multicast Routing by Traffic Splitting in IP Networks (IP망에서 트래픽 분할에 의한 다중경로 멀티캐스트 경로설정)

  • Park, Koo-Hyun;Shin, Yong-Sik
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.1
    • /
    • pp.48-56
    • /
    • 2002
  • This paper proposes an IP(Internet Protocol) multicast routing method by multiple tree routes. Multiple trees, instead of a single tree, improve the quality of multicast services with nonlinear link cost and huge traffic demand. The proposed method adds tree routes until it satisfies target conditions, and it splits the multicast traffic demand into the chosen tree routes. We develop a mathematical model and optimal conditions for traffic splitting. The method works on the problems with many different simultaneous multicast traffic. Various experiments were carried and the results show that the new multicasting is fairly effective on end-to-end quality of services.

Estimation of Risk and Optimal Route to Transport Hazardous Materials -Application to Metropolitan Area- (위험물 수송을 위한 위험도 및 최적경로산정 -수도권 사례를 중심으로-)

  • 조용성;오세창
    • Journal of Korean Society of Transportation
    • /
    • v.17 no.1
    • /
    • pp.75-89
    • /
    • 1999
  • 위험물차량사고는 일반차량의 교통사고시 발생하는 인명피해, 재산피해, 교통지체 외에 부가적으로 환경적 영향에 의한 엄청난 인명 및 재산손실을 유발시킬 수 있다. 따라서 이러한 위험물차량사고를 예방하고 피해를 최소로 줄이기 위해서는 위험물수송경로의 신중하고 체계적인 결정이 필수적이라 할 수 있다. 따라서, 본 연구는 위험물차량의 수송경로를 결정할 때 고려해야 할 여러 가지의 기준 및 목표에 따라 위험물수송경로를 설정하는 모형을 제시함으로써 위험물수송에 수반되는 위험을 최소화하면서 위험물차량의 통행시간, 거리, 비용 등을 최적화하여 위험물수송의 안전 및 운영효율성을 향상시키고자 한다. 먼저, 위험물 수송경로의 기준지표로 사용될 위험도를 나타내기 위해 사고율과 피해가능규모를 구하도록 사 고건수, 링크 주변노출인구, 링크상의 노출인구, 밀도 등을 변수로 하는 모형식을 제안하고, 두 번째로 위험물 수송을 위한 최적경로를 산출하기 위해 위험도와 통행시간을 목적함수로 하는 다목적계획모형을 제안하였고 기존의 최적경로 알고리즘을 적용하여 최적경로를 산출하였다. 마지막으로 실제 수도권지역을 대상으로 본 연구에서 제안한 모형을 적용하고 현재 일반적으로 사용되는 최단경로와 비교.분석하였다. 모형적용결과, 링크주변인구만을 고려하는 기존 모형에 비해 링크상의 인구를 함께 고려함으로써 좀더 실제적으로 교통상황을 충분히 반영한 피해규모를 산정하였다. 또한, 본 연구에서 제안한 위험도와 통행시간에 0.5의 비중을 주는 다목적모형이 기존의 위험도모형에 비해 충분한 안전성을 확보하면서 최소 4%, 최대 12%의 통행시간 개선의 효과가 있음을 나타냈다.

  • PDF

Design of Near-Minimum Time Path Planning Algorithm for Autonomous Driving (무인 자율 주행을 위한 최단 시간 경로계획 알고리즘 설계)

  • Kim, Dongwook;Kim, Hakgu;Yi, Kyongsu
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.37 no.5
    • /
    • pp.609-617
    • /
    • 2013
  • This paper presents a near-minimum time path planning algorithm for autonomous driving. The problem of near-minimum time path planning is an optimization problem in which it is necessary to take into account not only the geometry of the circuit but also the dynamics of the vehicle. The path planning algorithm consists of a candidate path generation and a velocity optimization algorithm. The candidate path generation algorithm calculates the compromises between the shortest path and the path that allows the highest speeds to be achieved. The velocity optimization algorithm calculates the lap time of each candidate considering the vehicle driving performance and tire friction limit. By using the calculated path and velocity of each candidate, we calculate the lap times and search for a near-minimum time path. The proposed algorithm was evaluated via computer simulation using CarSim and Matlab/Simulink.

Dynamic Simulation of Roller-type Pot Seeding Machine for Onion (롤러식 양파 파종기의 동적 시뮬레이션)

  • Hwang, Seok Joon;Kang, Hyo Seok;Oh, Ah yong;Nam, Ju Seok
    • Proceedings of the Korean Society for Agricultural Machinery Conference
    • /
    • 2017.04a
    • /
    • pp.12-12
    • /
    • 2017
  • 본 연구에서는 롤러식 양파 파종기의 작동 특성 파악을 위한 동적 시뮬레이션을 수행하였다. 롤러식 양파 파종기의 주요부는 롤러와 포트트레이로 구성된다. 양파 파종기의 작동 특성 파악을 위해 동력전달 경로의 구성요소와 각 주요부의 속도를 분석한 결과 동력원인 모터의 출력은 체인과 스프라켓을 통해 포트트레이와 롤러에 전달되며 모터에서의 회전속도는 1770rpm으로 감속기를 통해 출력축의 회전속도는 17.7rpm으로 감소한다. 이론적으로 도출한 포트트레이의 이동속도는 74.98mm/s, 롤러의 회전속도는 22.13rpm으로 나타났다. 시뮬레이션을 수행하기 위해 스캐너를 이용하여 롤러식 파종기를 실측했으며 후에 3D모델링을 진행하였다. 시뮬레이션 해석조건은 파종기의 실제 작동방식을 고려하여 롤러1과 3은 포트트레이와 면대면 접촉을 통해 회전하도록 설정하였고 롤러2와 롤러4는 동력전달경로에 포함된 스프라켓과 기어의 잇수비를 반영하여 회전속도를 도출하여 적용하였다. 시뮬레이션 결과 롤러의 회전속도는 모두 22.13rpm으로 수식에 근거하여 도출한 값과 계측 값이 같음을 확인하였다. 또한 파종 깊이를 결정하는 요소인 롤러의 상토 압축 정도를 파악하기 위하여 롤러궤적 시뮬레이션을 통해 롤러 끝 단의 궤적을 분석하였는데 롤러궤적 분석 결과 롤러의 끝 단은 약 9.8mm 깊이로 내려가는 것을 확인하였다.

  • PDF

Planning of Optimal Work Path for Minimizing Exposure Dose During Radiation Work in Radwaste Storage (방사성 폐기물 저장시설에서의 방사선 작업 중 피폭선량 최소화를 위한 최적 작업경로 계획)

  • Park, Won-Man;Kim, Kyung-Soo;Whang, Joo-Ho
    • Journal of Radiation Protection and Research
    • /
    • v.30 no.1
    • /
    • pp.17-25
    • /
    • 2005
  • Since the safety of nuclear power plant has been becoming a big social issue the exposure dose of radiation for workers has been one of the important factors concerning the safety problem. The existing calculation methods of radiation dose used in the planning of radiation work assume that dose rate does not depend on the location within a work space thus the variation of exposure dose by different work path is not considered. In this study, a modified numerical method was presented to estimate the exposure dose during radiation work in radwaste storage considering the effects of the distance between a worker and sources. And a new numerical algorithm was suggested to search the optimal work path minimizing the exposure dose in pre-defined work space with given radiation sources. Finally, a virtual work simulation program was developed to visualize the exposure dose of radiation doting radiation works in radwaste storage and provide the capability of simulation for work planning. As a numerical example, a test radiation work was simulated under given space and two radiation sources, and the suggested optimal work path was compared with three predefined work paths. The optimal work path obtained in the study could reduce the exposure dose for the given test work. Based on the results, tile developed numerical method and simulation program could be useful tools in the planning of radiation work.

Storing Scheme based on Graph Data Model for Managing RDF/S Data (RDF/S 데이터의 관리를 위한 그래프 데이터 모델 기반 저장 기법)

  • Kim, Youn-Hee;Choi, Jae-Yeon;Lim, Hae-Chull
    • Journal of Digital Contents Society
    • /
    • v.9 no.2
    • /
    • pp.285-293
    • /
    • 2008
  • In Semantic Web, metadata and ontology for representing semantics and conceptual relationships of information resources are essential factors. RDF and RDF Schema are W3C standard models for describing metadata and ontology. Therefore, many studies to store and retrieve RDF and RDF Schema documents are required. In this paper, we focus on some results of analyzing available query patterns considering both RDF and RDF Schema and classify queries on RDF and RDF Schema into the three patterns. RDF and RDF Schema can be represented as graph models. So, we proposed some strategies to store and retrieve using the graph models of RDF and RDF Schema. We can retrieve entities that can be arrived from a certain class or property in RDF and RDF Schema without a loss of performance on account of multiple joins with tables.

  • PDF

Characteristics of River Sand Soil Parameter for Single Work-Hardening Constitutive Model to Stress Path (강모래의 응력경로에 따른 단일항복면 구성모델의 토질매개변수 특성)

  • Lee, Jong-Cheon;Cho, Won-Beom
    • Journal of Navigation and Port Research
    • /
    • v.36 no.5
    • /
    • pp.395-400
    • /
    • 2012
  • The stress-strain relationship of soil is dependent on a number of factors such as soil type, density, stress level and stress path. Th accurate stress-stain relationship can be predict using a constitutive model incorporated all influencing factors. In this study, an isotropic compression-expansion test and a series of drained conventional triaxial tests with several stress paths were performed on Baekma river sand to investigate parameters characteristics of Lade's single work hardening model depending on the stress path.. Based on test results, the parameters of yield function (h, ${\alpha}$) are not much influenced by stress level and stress path, the these parameters do affect a little bit of stress-strain behavior. The parameters h and ${\alpha}$ are closely related to failure criterion ${\eta}_1$, they can be replaced by failure criterion parament. We also observed that predicted values from the Lade's single hardening constitutive model are well matched with the observed data.

A multi carrier selectable routing scheme by normalized transmission characteristics (MCS-NTC) at marine multi-carrier MANETs (다중캐리어 해상 MANET에서 여러 캐리어 선택가능하고 정규화된 전송특성에 의한 경로배정방식)

  • Son, Jooyoung
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.37 no.2
    • /
    • pp.199-204
    • /
    • 2013
  • Marine data communications still look for a novel data communication system at sea because of the restriction of bandwidths and costs of current carriers. In order to make the most efficient use of the broadband land carriers at sea, this paper proposes a routing scheme (MCS-NTC) at a marine MANET model. The routing scheme optimizes the route by choosing optimal nodes and carriers among the traditional and land carriers based on normalized transmission characteristics of applications and carriers. The performance is compared with the max-win method (OMH-MW) scheme considering the specific values of transmission characteristics. The result shows that our scheme derives more efficient routes than the previous one in terms of the transmission characteristics such as bandwidth, cost, delay, the number of hops and carriers.

Identifying a Shape of Input Data Structure for Automated Program Testing (자동화된 프로그램 시험을 위한 입력 자료구조의 모양 식별)

  • Insang, Chung
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.10
    • /
    • pp.1304-1319
    • /
    • 2004
  • We can significantly reduce the cost o# program testing by automating the process of test data generation. Test data generation usually concerns identifying input values on which a selected path is executed. Although lots of research has been done so far, there still remains a lot of issues to be addressed. One of the issues is the shape problem. The shape problem refers to the problem of figuring out a shape of the input data structure required to cause the traversal of a given path. In this paper, we introduce a new method for the shape problem. The method converts the selected path into static single assignment (SSA) form without pointer dereferences. This allows us to consider each statement in the selected path as a constraint involving equality or inequality. We solve the constraints to get a solution which will be represented in terms of the points-to relations for each input variable. Simple, but illustrative examples are given to explain the proposed method.