• Title/Summary/Keyword: 배열방법

Search Result 1,582, Processing Time 0.024 seconds

Performance analysis of sensor selection methods for beam steering direction of non-linear conformal array (비선형 곡면 배열 센서의 빔 지향 방위별 센서 선택 방법에 대한 성능 분석)

  • Kwon, Taek-ik
    • The Journal of the Acoustical Society of Korea
    • /
    • v.40 no.4
    • /
    • pp.391-399
    • /
    • 2021
  • The conformal array sensor has different sub-array depending on different beam steering directions. According to the method to effective the sensor, the performance of the conformal array sensor can be different, where the sub-array selects an effective sensor. Also, due to the figure of the conformal array sensor, the figure of the sub-array can be different each other, which results in different performance on directivity index, beam width and etc. In this paper, two methods to select sub-array which is the criteria for each sensors position vector and directive vector were proposed. For two sub-array selection methods, the performance of the directivity index, horizontal and vertical beam width were compared with the average and variance. In addition, this comparison was conducted when the number of sensors was fixed. When the number of sensors was not fixed, the directional vector method mainly results in high performance, but the performance of vertical beam width was lower or equal. When the number of sensors was fixed, the performance of two methods is similar, but the performance of variance was deteriorated.

Study on improving method of arranging trapezoidal pre-cast segment lining in shield tunnel (쉴드터널의 사다리꼴 세그먼트라이닝 배열방법 개선에 대한 연구)

  • Kim, Jung-Hyun;Kang, Kyung-Jin
    • Journal of Korean Tunnelling and Underground Space Association
    • /
    • v.9 no.1
    • /
    • pp.1-18
    • /
    • 2007
  • This study is about an arrangement method of trapezoidal pre-cast segment lining that can be applied in shield tunnel construction. Trapezoidal segment lining is formed by assembling tapered pre-cast concrete segments taking advantage of the tapered shape of pre-cast segments upon delivery on site. By calculating tapering of the segments manufactured in single type and rotating the segments when putting them together, a variety of tunnel alignments can be arranged in the most efficient way. Once the design criteria and tunnel alignment (straight or curved) is analyzed, the sequence of assembling trapezoidal segments in compliance with tunnel alignment will be computed. On site an operator can utilize the softwareto automatically determine sequential arrangement of trapezoidal segments. When the actual arrangement of segmental lining is different from the computed output, the operator can input the actually measured values to coincide the computerized calculation with the real status of assembly. Then the adjustment will be the basis of subsequent arrangement of segments, thus the continuity of work can be guaranteed.

  • PDF

Adaptive Fast Calibration Method for Active Phased Array Antennas using PPO Algorithm (PPO 알고리즘을 이용한 능동위상배열안테나 적응형 고속 보정 방법)

  • Sunge Lee;Kisik Byun;Hong-Jib, Yoon
    • Journal of IKEEE
    • /
    • v.27 no.4
    • /
    • pp.636-643
    • /
    • 2023
  • In this paper, a high-speed calibration method for phased array antennas in the far-field is presented A max calibration, which is a simplification of the rotating-element electric-field vector (REV) method that calibrates each antenna element only through received power, and a method of grouping calibrations by sub-array unit rather than each antenna element were proposed. Using the Proximal Policy Optimization (PPO) algorithm, we found a partitioning optimized for the distribution of phased array antennas and calibrated it on a subarray basis. An adaptive max calibration method that allows faster calibration than the conventional method was proposed and verified through simulation. Not only is the gain of the phased array antenna higher while calibration is being made to the target, but the beam pattern is closer to the ideal beam pattern than the conventional method.

DNA Sequence Visualization with k-convex Hull (k-convex hull을 이용한 DNA 염기 배열의 가시화)

  • Kim, Min Ah;Lee, Eun Jeong;Cho, Hwan Gyu
    • Journal of the Korea Computer Graphics Society
    • /
    • v.2 no.2
    • /
    • pp.61-68
    • /
    • 1996
  • In this paper we propose a new visualization technique to characterize qualitative information of a large DNA sequence. While a long DNA sequence has huge information, it is not easy to obtain genetic information from the DNA sequence. We transform DNA sequences into a polygon to compute their homology in image domain rather than text domain. Our program visualizes DNA sequences with colored random walk plots and simplify them k-convex hulls. A random walk plot represents DNA sequence as a curve in a plane. A k-convex hull simplifies a random work plot by removing some parts of its insignificant information. This technique gives a biologist an insight to detect and classify DNA sequences with easy. Experiments with real genome data proves our approach gives a good visual forms for long DNA sequences for homology analysis.

  • PDF

Computational view-point reconstruction method in three-dimensional integral imaging using lenslet array model (렌즈배열 모델을 적용한 3차원 집적영상 기술에서의 컴퓨터적 시점 재생 방법)

  • Shin, Dong-Hak;Kwon, Young-Man;Kim, Eun-Soo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.10
    • /
    • pp.1848-1853
    • /
    • 2006
  • In this paper, we propose a method to reconstruct resolution-improved 3D images computationally based on lenslet array model in integral imaging technique and analyze its performance. While conventional view-point reconstruction method has low resolution based on pinhole array model, the proposed method can obtain resolution-improved 3D images because of extracting multiple pixels from elemental images by use of lenslet way model. To show the usefulness of proposed method, we perform computational experiments and present its results.

Smoothing Algorithm for DNA Code Optimization (Smoothing Algorithm을 이용한 DNA 코드 최적화)

  • 윤문식;한치근
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10a
    • /
    • pp.64-66
    • /
    • 2003
  • DNA(Deoxyribo Nucleic Acid)컴퓨팅은 생체분자를 계산의 도구로 이용하는 새로운 계산 방법으로 DNA 정보 저장능력과 DNA의 상보적인 관계를 이용하여 연산을 수행하는 방법이다. 최근에는 DNA 분자들이 갖는 강력한 병렬성을 이용하여 NP-Complete 문제에 적용하는 연구가 많이 시도되고 있다. Adleman이 DNA 컴퓨팅을 이용해 해결한 HPP(Hamilton Path Problem)와는 달리 TSP(Traveling Salesman Problem)는 간선에 가중치가 추가되었기 때문에 DNA 염기배열로 표현하기가 어렵고 또한 염기배열의 길이를 줄이기 위해 고정길이 염기배열을 사용할 경우 가중치가 커지면 효율적이지 못하다. 본 논문에서는 스무딩 알고리즘(smoothing algorithm)을 사용하여 간선의 가중치를 일정한 비율로 줄인 다음 유전자 알고리즘을 사용하여 최적의 염기배열을 찾는 방법을 제안하였다.

  • PDF

Performance Analysis of FFTSA Method in the Water Environment Using Conformal Towed Acoustic Array (왜곡된 형태의 견인 음향 배열 기법을 적용한 수중환경하에서의 FFTSA 기법 성능분석)

  • 최주평;이원철
    • The Journal of the Acoustical Society of Korea
    • /
    • v.20 no.8
    • /
    • pp.44-57
    • /
    • 2001
  • This paper analyses the performance of FFTSA (Fast Fourier Transform Synthetic Aperture) in the effects of temporal coherence and oscillatory towed course, which is one of the techniques for passive synthetic aperture SONAR process using linearly distributed towed array. Also this paper proposes the FFTSA technique using towed array having conformal shape to alleviate the performance degradation for estimating the incident angle under inconsistent under water environments. And this paper analyses the performance of the proposed FFTSA technique making use of conformal structure throughout exhaustive computer simulations.

  • PDF

On the construction of pairs of sonar arrays with optimum cross-correlation (최적 상호상관을 갖는 소나배열 쌍의 생성에 관한 연구)

  • 김정헌;어창현;홍윤표;송홍엽
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.26 no.9B
    • /
    • pp.1336-1342
    • /
    • 2001
  • 본 논문은 최적 상호상관 특성을 갖는 소나배열 쌍의 대수학적 생성방법을 제시한다. 이 생성방법은 최상의 소나배열 쌍은 주어진 행의 크기에 대해 가장 큰 열의 크기를 갖는다는 관점에서 최상의 소나배열 쌍을 찾기 위해 알려진 모든 모듈라 소나배열에 적용되어 진다.

  • PDF

Compuationally Efficient Propagator Method for DoA with Coprime Array (서로소 배열에서 프로퍼게이터 방법 기반의 효율적인 도래각 추정 기법)

  • Byun, Bu-Guen;Yoo, Do-Sik
    • Journal of Advanced Navigation Technology
    • /
    • v.20 no.3
    • /
    • pp.258-264
    • /
    • 2016
  • In this paper, we propose a computationally efficient direction of arrival (DoA) estimation algorithm based on propagator method with non-uniform array. While the co-prime array techniques can improve the resolution of DoA, they generally lead to high computational complexity as the length of the coarray aperture. To reduce the complexity we use the propagator method that does not require singular value decomposition (SVD). Through simulations, we compare MUSIC with uniform lineary array, propagator method with uniform linear array, MUSIC with co-prime array, and the proposed scheme and observe that the performance of the proposed scheme is significantly better than MUSIC or propagator method with uniform linear array while it is slightly worse than computationally much more expensive co-prime array MUSIC scheme.

Efficient Frequent Pattern Mining in Multiple Two-Dimensional Arrays (다수의 2 차원 배열에서 효율적인 빈발 패턴 탐색 기법)

  • Kim, Han-seul;Lee, Ki Yong
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2021.05a
    • /
    • pp.326-329
    • /
    • 2021
  • 데이터베이스에서의 빈발 패턴 탐색은 일정 횟수 이상 같이 등장하는 항목들의 집합을 찾는 문제이다. 본 논문은 다수의 2 차원 배열들이 주어졌을 때, 이들 내부에서 빈번히 같이 등장하는 부분 구역들을 찾는 문제를 다룬다. 하지만 기존 빈발 패턴 탐색 기법들은 배열 내 원소들의 위치 관계까지 고려하지는 않기 때문에 본 문제에 바로 적용하기는 어렵다. 따라서 본 논문은 다수의 2 차원 배열 내에서 빈번히 같이 발생하는 부분 구역들을 효율적으로 찾는 기법을 제안한다. 본 논문의 선행 연구에서는 주어진 배열들을 두 번 스캔하여 빈발 부분 구역 집합을 찾는 기법을 제안하였다. 본 논문에서는 이를 개선하여 배열들을 한 번만 스캔하고도 빈발 부분 구역 집합을 찾는 효율적인 기법을 제안한다. 이를 위해 제안 방법은 지금까지 탐색된 부분 구역들에 대한 정보를 메모리에 효율적으로 유지한다. 실험결과 제안방법은 기존 방법에 비해 수행시간을 약 30% 단축함을 보였다.