• 제목/요약/키워드: Approximation algorithm

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

경량화된 심전도 측정 임베디드 장비에서 템플릿 기반 직선근사화를 이용한 통신오버헤드 감소 기법 (Communication-Power Overhead Reduction Method Using Template-Based Linear Approximation in Lightweight ECG Measurement Embedded Device)

  • 이승민;박길흠;박대진
    • 대한임베디드공학회논문지
    • /
    • 제15권5호
    • /
    • pp.205-214
    • /
    • 2020
  • With the recent development of hardware and software technology, interest in the development of wearable devices is increasing. In particular, wearable devices require algorithms suitable for low-power and low-capacity embedded devices. Among them, there is an increasing demand for a signal compression algorithm that reduces communication overhead, in order to increase the efficiency of storage and transmission of electrocardiogram (ECG) signals requiring long-time measurement. Because normal beats occupy most of the signal with similar shapes, a high rate of signal compression is possible if normal beats are represented by a template. In this paper, we propose an algorithm for determining the normal beat template using the template cluster and Pearson similarity. Also, the template is expressed effectively as a few vertices through linear approximation algorithm. In experiment of Datum 234 of MIT-BIH arrhythmia database (MIT-BIH ADB) provided by Physionet, a compression ratio was 33.44:1, and an average distribution of root mean square error (RMSE) was 1.55%.

Extraction of rational functions by forced vibration method for time-domain analysis of long-span bridges

  • Cao, Bochao;Sarkar, Partha P.
    • Wind and Structures
    • /
    • 제16권6호
    • /
    • pp.561-577
    • /
    • 2013
  • Rational Functions are used to express the self-excited aerodynamic forces acting on a flexible structure for use in time-domain flutter analysis. The Rational Function Approximation (RFA) approach involves obtaining of these Rational Functions from the frequency-dependent flutter derivatives by using an approximation. In the past, an algorithm was developed to directly extract these Rational Functions from wind tunnel section model tests in free vibration. In this paper, an algorithm is presented for direct extraction of these Rational Functions from section model tests in forced vibration. The motivation for using forced-vibration method came from the potential use of these Rational Functions to predict aerodynamic loads and response of flexible structures at high wind speeds and in turbulent wind environment. Numerical tests were performed to verify the robustness and performance of the algorithm under different noise levels that are expected in wind tunnel data. Wind tunnel tests in one degree-of-freedom (vertical/torsional) forced vibration were performed on a streamlined bridge deck section model whose Rational Functions were compared with those obtained by free vibration for the same model.

지리정보시스템에서 고속도로 연결 문제의 가변적 근사기법 (An Adaptive Approximation Method for the Interconnecting Highways Problem in Geographic Information Systems)

  • 김준모;황병연
    • 한국공간정보시스템학회 논문지
    • /
    • 제7권2호
    • /
    • pp.57-66
    • /
    • 2005
  • 고속도로 연결문제(Interconnecting Highways problem)는 VLSI 설계, 광 또는 유선 네트워크의 설계, 도로 건설 계획 등의 분야에서 도출되는 여러 가지 배치문제들을 대표하는 추상화 된 문제이다. 도로 건설에 있어 기존의 지점들을 가장 짧은 거리로 상호 연결하는 도로망은 다른 도로망들에 비해 경제적인 면에서 많은 이익을 가져다준다. 즉, 기존의 도로나 도시들을 상호 연결하는 새로운 도로망을 찾는 문제는 중요한 이슈가 된다. 본 논문에서는 NP-hard 문제인 고속도로 연결문제에 대해 '최적에 점근하는 결과치'를 내는 근사방법을 제안한다. 이 방법은 컴퓨팅 자원이 지원되는 한 최적치에 점근하는 근사-결과치를 구할 수 있도록 한다. 따라서 실제 응용에서는 제안된 근사방법에서 산출되는 근사치를 사실상의 최적치로 간주할 수 있게 된다. 선행연구에서의 근사방법과 달리 본 논문에서 제안된 방법은 주어진 문제 인스턴스의 속성에 부합하는 알고리즘을 만들어 낼 수 있도록 하는 큰 장점을 가진다.

  • PDF

MBO-Tree: 형상의 자연스러운 근사화와 효과적인 지역화를 지원하는 계층적 표현 방법 (MBO-Tree: A Hierarchical Representation Scheme for Shapes with Natural Approximation and Effective Localization)

  • 허봉식;김동규;김민환
    • 한국멀티미디어학회논문지
    • /
    • 제5권1호
    • /
    • pp.18-27
    • /
    • 2002
  • 본 논문에서는 평면 형상에 대해 자연스러운 근사화와 효과적인 지역화를 제공하는 새로운 계층적 표현 방법인 MBO-tree를 제안하였다. 곡선 근사화 방법으로 알려진 Douglas-Peucker 알고리즘을 기반으로 곡선 분할점의 근사화 오차를 분할점과 함께 계층적 트리 노드에 저장함으로써 근사화 척도로 활용하였으며, 보다 자연스러운 형상 표현을 위해 오차 조정 알고리즘도 제안하였다. MBO-tree의 오타 조정은 자식 노드의 오차가 부모 노드의 오차보다 크지 않도록 제한하는 것으로 구현하였다. 지역화를 위해서는 MBR(Minimum Bounding Rectangle)을 단순 확장한 MBO(Minimum Bounding Octangle)를 경계 영역으로 사용하였다. MBO는 다른 계층적 표현 체계의 경계 영역들에 비해 대상 객체에 밀착하여 효과적으로 포함할 뿐만 아니라, 계층간 경계 영역 포함 관계도 만족하기 때문에 점 포함 테스트나 형상간 교차 테스트 등과 같은 계층적인 기하학 연산에 매우 유용하다. 실험을 통해서 본 논문에서 제안한 방법이 strip tree, arc tree, HAL tree등과 같은 다른 계층적 표현 체계에 비해 보다 자연스러운 근사화와 효과적인 지역화가 가능함을 확인하였다.

  • PDF

전자군 방법에 이용되는 2항근사와 다항근사 볼츠만 방정식의 적용 (An Application of Two-term and Multi-term Approximation of Boltzmann Equation to Electron Swarm Method)

  • 하성철;전병훈
    • 한국전기전자재료학회논문지
    • /
    • 제15권1호
    • /
    • pp.79-84
    • /
    • 2002
  • An accurate cross sections set is necessary for the quantitatively understanding and modeling of plasma phenomena. By using the electron swarm method, we determine an accurate electron cross sections set for objective atoms or molecule at low electron energy range. It is general calculation that used in this method to an two-term approximation of Boltzmann equation. But it may give erroneous transport coefficients for CF$_4$ molecule treated in this paper having \`C2v symmetry\`, therefore, multi-term approximation of the Boltzmann equation analysis which can consider anisotropic scattering exactly is carried out. It is necessary to require understanding of the fundamental principle of analysis method. Therefore, in this paper, we compared the electron transport coefficients(W and ND$\_$L/) in pure Ar, O$_2$, and CF$_4$ gas calculated by using two-term approximation of the Boltzmann equation analysis code uses the algorithm proposed by Tagashira et al. with those by multi-term approximation by Rubson and Ness which was developed at James-Cook university, and discussed an application and/or validity of the calculation method by comparing these calculated results.

트림된 NURBS 곡면의 효율적인 삼각화 알고리즘 (An Efficient Triangulation Algorithm for Trimmed NURBS Surfaces)

  • 정재호;박준영
    • 한국CDE학회논문집
    • /
    • 제5권2호
    • /
    • pp.144-154
    • /
    • 2000
  • We propose an algorithm for obtaining a triangular approximation of a trimmed NLRBS surface. Triangular approximation is used in the pre-processing step of many applications such as RP(Rapid Prototyping), NC(Numerical Control) and FEA(Finite Element Analysis), etc. The algorithm minimizes the number of triangular elements within tolerance and generates a valid triangular mesh for STL file and NC tool path generation. In the algorithm, a subdivision method is used. Since a patch is a basic element of triangular mesh creation, boundary curves of a patch are divided into line segments and the division of curves is applied for the interior of the surface. That is, boundary curves are subdivided into line segments and two end points of each line segment are propagated to the interior of the surface. For the case of a trimmed surface, triangulation is carried out using a model space information. The algorithm is superior because the number of elements can be controlled as the curvature of the surface varies and it generates the triangular mesh in a trimmed region efficiently. To verify the efficiency, the algorithm was implemented and tested for several 3D objects bounded by NURBS surfaces.

  • PDF

Joint Antenna Selection and Multicast Precoding in Spatial Modulation Systems

  • Wei Liu;Xinxin Ma;Haoting Yan;Zhongnian Li;Shouyin Liu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제17권11호
    • /
    • pp.3204-3217
    • /
    • 2023
  • In this paper, the downlink of the multicast based spatial modulation systems is investigated. Specifically, physical layer multicasting is introduced to increase the number of access users and to improve the communication rate of the spatial modulation system in which only single radio frequency chain is activated in each transmission. To minimize the bit error rate (BER) of the multicast based spatial modulation system, a joint optimizing algorithm of antenna selection and multicast precoding is proposed. Firstly, the joint optimization is transformed into a mixed-integer non-linear program based on single-stage reformulation. Then, a novel iterative algorithm based on the idea of branch and bound is proposed to obtain the quasioptimal solution. Furthermore, in order to balance the performance and time complexity, a low-complexity deflation algorithm based on the successive convex approximation is proposed which can obtain a sub-optimal solution. Finally, numerical results are showed that the convergence of our proposed iterative algorithm is between 10 and 15 iterations and the signal-to-noise-ratio (SNR) of the iterative algorithm is 1-2dB lower than the exhaustive search based algorithm under the same BER accuracy conditions.

Zero-suppressed ternary decision diagram algorithm for solving noncoherent fault trees in probabilistic safety assessment of nuclear power plants

  • Woo Sik Jung
    • Nuclear Engineering and Technology
    • /
    • 제56권6호
    • /
    • pp.2092-2098
    • /
    • 2024
  • Probabilistic safety assessment (PSA) plays a critical role in ensuring the safe operation of nuclear power plants. In PSA, event trees are developed to identify accident sequences that could lead to core damage. These event trees are then transformed into a core-damage fault tree, wherein the accident sequences are represented by usual and complemented logic gates representing failed and successful operations of safety systems, respectively. The core damage frequency (CDF) is estimated by calculating the minimal cut sets (MCSs) of the core-damage fault tree. Delete-term approximation (DTA) is commonly employed to approximately solve MCSs representing accident sequence logics from noncoherent core-damage fault trees. However, DTA can lead to an overestimation of CDF, particularly when fault trees contain many nonrare events. To address this issue, the present study introduces a new zero-suppressed ternary decision diagram (ZTDD) algorithm that averts the CDF overestimation caused by DTA. This ZTDD algorithm can optionally calculate MCSs with DTA or prime implicants (PIs) without any approximation from the core-damage fault tree. By calculating PIs, accurate CDF can be calculated. The present study provides a comprehensive explanation of the ZTDD structure, formula of the ZTDD algorithm, ZTDD minimization, probability calculation from ZTDD, strength of the ZTDD algorithm, and ZTDD application results. Results reveal that the ZTDD algorithm is a powerful tool that can quickly and accurately calculate CDF and drastically improve the safety of nuclear power plants.

평면곡선에 대한 Hausdorff 거리 계산의 가속화 기법에 대한 연구 (Efficient Hausdorff Distance Computation for Planar Curves)

  • 김용준;오영택;김명수
    • 한국CDE학회논문집
    • /
    • 제15권2호
    • /
    • pp.115-123
    • /
    • 2010
  • We present an efficient algorithm for computing the Hausdorff distance between two planar curves. The algorithm is based on an efficient trimming technique that eliminates the curve domains that make no contribution to the final Hausdorff distance. The input curves are first approximated with biarcs within a given error bound in a pre-processing step. Using the biarc approximation, the distance map of an input curve is then approximated and stored into the graphics hardware depth-buffer by rendering the distance maps (represented as circular cones) of the biarcs. We repeat the same procedure for the other input curve. By sampling points on each input curve and reading the distance from the other curve (stored in the hardware depth-buffer), we can easily estimate a lower bound of the Hausdorff distance. Based on the lower bound, the algorithm eliminates redundant curve segments where the exact Hausdorff distance can never be obtained. Finally, we employ a multivariate equation solver to compute the Hausdorff distance efficiently using the remaining curve segments only.

에너지불변특성을 이용한 Mixture of Cumulants Approximation 방법에 의한 발전시뮬레이션에 관한 연구 - 수요예측의 오차를 고려한 경우 - (A STUDY ON THE GENERATION SIMULATION USING ENERGY INVARIANCE PROPERTY BY MIXTURE OF CUMULANTS APPROXIMATION METHOD WITH CONSIDERING THE LOAD FORECASTING UNCERTAINTY)

  • 송길영;김용하;오광해;오기봉
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1991년도 추계학술대회 논문집 학회본부
    • /
    • pp.59-62
    • /
    • 1991
  • This paper describes an effective algorithm for evaluating the reliability indices and calculating the production cost for generation system with thermal, hydro and pumped storage plants. Using the Energy Invariance property, this algorithm doesn't need deconvolution process which gives large burden in computing time. In order to consider an adaptable load model, we consider the system load with forecasting uncertainty. The proposed algorithm is applied to the KEPCO system and its result shows high accuracy and less computing time.

  • PDF