• The Journal of the Acoustical Society of Korea
• /
• v.27 no.1
• /
• pp.47-56
• /
• 2008

In the detection of an underwater target, there exists an optimal search depth for the sonar systems, at which the Probability of Detection is maximized. The optimal search depth is dependent on the depths of the target and sonar, the sound speed profile, and the bathymetry. In this paper, we address this question in range-dependent environments, particularly for the bathymetry with slope and with warm eddy. For range-dependent bathymetry, the typical sound profile in the East Sea of Korea was used. The detection range was greater when the sonar was located in deep water than in shallow water. As for the case of eddy, mesoscale warm eddy was used, and the detection range was greater when looking out of the warm eddy than when looking into the eddy.

• The Journal of the Korea Contents Association
• /
• v.5 no.4
• /
• pp.204-211
• /
• 2005

This paper introduces three loop splitting methods such as minimum dependence distance method, Polychronopoulous' method, and first dependence method for exploiting parallelism from single loop which already developed. And it also Indicates their several problems. We extend the first dependence method which is the most effective one among three loop splitting methods, and propose more powerful loop splitting method to enhance parallelism on single loop. The proposed algorithm solves several problems, such as anti-flow dependence and g=gcd(a,c) > 1, that the first dependence method has.

• Journal of the Korea Computer Industry Society
• /
• v.6 no.2
• /
• pp.365-372
• /
• 2005

Generally, In a application program the core part for parallel processing is a loop. therefore exist data dependencies between the array index variables of a loop. The data dependence relations between statements which from variable or constant dependence distance are specially complex. Therefore extracting parallelism for those statements at compile time is very difficult. in this paper, among the proposed methods of extracting parallelism, analysis the unimodular method and non-unimodular method and grasping the merits and demerits of them. hereafter, this method will go far toward solving the effectively extracting parallelism of the loop.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.6
• /
• pp.1494-1506
• /
• 1998

본 논문에서는 루프구조의 효율적인 병렬수행을 위한 병렬성 추출에 대하여 불변과 가변 종속거리에 모두적용할 수 있는 통합된 새로운 기법을 제시한다. 이것은 컴파일시간에 순차 루프를 중첩된 DOALL 루프로의 자동 변환에 대한 절차로서, 중첩 루프의 전체적인 병렬화를 하기 위하여 문장들을 반복적으로 수행시키는 것에 의해서 자료 종속을 효과적으로 제거하는 알고리즘이다. 본 논문에 제시된 방법은 성능평가에서도 매우 뛰어난 방법임을 보였다.

• Journal of the Korea Computer Industry Society
• /
• v.4 no.4
• /
• pp.501-508
• /
• 2003

In this paper A new theory of linear loop transformation called Elimination of Data Dependency(BDD) is presented. The current framework of linear loop transformation cannot identify a significant fraction of parallelism. For this reason, a method to extract the maximum loop parallelism in perfect nested loops is presented. This technique is applicable to general loop nests where the dependence include both distance and directions.

• The Journal of the Acoustical Society of Korea
• /
• v.33 no.3
• /
• pp.163-173
• /
• 2014

Sound propagation algorithm for a sonar simulator is required to run in real-time and should be able to model the range and depth dependence of the Korean ocean environments. Ray model satisfies these requirements and we developed an algorithm for range-dependent ocean environments. In this algorithm, we considered depth-dependence of sound speed through rays based on a rectangular cell method and layer method. Range-dependence of sound speed was implemented based on a split-step method in the range direction. Eigen-ray is calculated through an interpolation of ray bundles and Gaussian interpolation function was used. The received time signal of sonar was simulated by Fourier transform of eigen-ray solution in the frequency domain. Finally, for the verification of proposed algorithm, we compared the results of transmission loss with other validated models such as BELLHOP, SNUPE, KRAKEN and OASES, for the Pekeris waveguide, wedge, and deep ocean environments. As a result, we obtained satisfactory agreements among them.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2012.06a
• /
• pp.65-67
• /
• 2012

2011년 3월 센다이 앞바다 약 130km지점에서 엄청난 지진해일을 동반한 규모 9.0 초대형 지진이 발생하였다. 많은 지역에서 범람고가 10m를 상회하였으며, 큰 피해가 발생한 곳의 경우 지진해일의 처오름 높이가 23.6m에 달한 곳도 있었다. 이 쓰나미는 지진 발생후 30분만에 첫 번째 지진해일이 해안에 도달하였고, 이 후 수차례 반복하여 내습하였다. 이러한 지진해일의 대책중 하나는 지진해일 발생시 5~10분 이내에 기상청에서 경보를 발령하고 대피 체계를 구축하는 것이다. 이와 같은 이유로 본 연구에서는 지진해일을 검출하기 위한 기저거리 비종속 정밀측위기술을 제안하였다. 원해에서는 기준국과의 위치가 멀기 때문에 DGNSS의 사용이 힘들다. 그러므로 단독 GPS 측위에 영향을 주는 오차를 제거하고 Kalman filter를 이용하여 정확한 위치를 추정한다. 또한 성능 검증을 위한 파랑의 동적특성을 고려한 테스트베드를 개발하였고, 그 유용성을 검증하였다.

• Journal of Korea Multimedia Society
• /
• v.4 no.3
• /
• pp.270-279
• /
• 2001

Since most program execution time is spent in the loop structure, extracting parallelism from sequential loop programs hale been focused. But, most programs hare implicit parallelism of interprocedure. This paper presents a generalized Parallelism extraction in loop\ulcorner with procedure calls. Most parallelization of loops with Procedure calls just focus on the uniform code which data dependency distance is constant. We presents algorithms which can be applied with uniform code, nonuniform code, and complex code. The proposed algorithm, loop extraction, loop embedding and procedure cloning transformation methods evaluate using CRAY-T3E. The result of performance evaluation is that proposed algorithm is an effect.

• Journal of Internet Computing and Services
• /
• v.2 no.4
• /
• pp.91-99
• /
• 2001

Since roost of the program execution time is spent in the loop structure, the problem of extracting parallelism from sequential loop has been one of the most important research issues. However. roost programs have Implicit interprocedure parallelism. This paper presents a generalized method extracting parallelism in loops having the procedure calls. Most parallelization of loops having procedure calls focus on the uniform code where data dependency distance is constant. We present algorithms which can be applied to uniform code, nonuniform code, and complex code. The performance of the proposed algorithm, loop extraction, loop embedding and procedure cloning transformation methods have been evaluated using CRAY-T3E. The result shows the effective of the proposed algorithm.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.2
• /
• pp.559-569
• /
• 2010

We propose an RFID system based on range-free localization method. This method recognizes pre-determined reference tags first, and then checks within which reference tag the target tag is placed closest. It estimates target tag's position relative to the reference tag's position. We use Aging Counter to estimate the distance between reference and target tags using the read ratio of RFID tags. Practicality of the proposed method is verified by applying it to a library book locating system.