• Title/Summary/Keyword: Computation cost

Search Result 648, Processing Time 0.022 seconds

Design of Spatial Clustering Method for Spatial Objects with Polygonometry (다각형 객체를 지원하는 공간 클러스터링 기법의 설계)

  • 황지완;문상호
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2004.05b
    • /
    • pp.374-377
    • /
    • 2004
  • Existing Clustering Methods for spatial data mining process only point objects, not objects with polygonometry such as lines and areas. It is because that distance computation between objects with polygonomery for clustering is more complex than point objects. To solve this problem, we design a clustering method based on regular grid cell structures. In details, it refutes cost and time for distance computation using cell relationships in grid cell structures.

  • PDF

Longitudinal and Flexural Vibration Analysis of a Beam Type Structure by Transfer Stiffness Coefficient Method (전달강성계수법에 의한 보형구조물의 종.굽힘진동해석)

  • Moon, D.H.;Choi, M.S.;Kim, Y.B.
    • Journal of Power System Engineering
    • /
    • v.2 no.1
    • /
    • pp.59-66
    • /
    • 1998
  • The authors have studied vibration analysis algorithm which was suitable to the personal computer. Recently, we presented the transfer stiffness coefficient method(TSCM). This method is based on the concept of the transfer of the nodal dynamic stiffness coefficients which are related to force and displacement vectors at each node. In this paper, we describes the general formulation for the longitudinal and flexural coupled vibration analysis of a beam type structure by the TSCM. And the superiority of the TSCM to the finite element method(FEM) in the computation accuracy, cost and convenience was confirmed by results of the numerical computation and experiment.

  • PDF

Finite Element Analysis of Externally Round Grooved Profile Ring Rolling Process (외부에 둥근 홈이 있는 형상환상압연공정의 유한요소해석)

  • 김광희;김병탁;석한길
    • Transactions of Materials Processing
    • /
    • v.12 no.7
    • /
    • pp.631-639
    • /
    • 2003
  • Ring rolling process is simulated by using the general-purpose commercial finite element analysis software, MSC.Superform. Because the deforming region is restricted to the vicinity of the roll gap, only a ring segment spanning the roll gap is analyzed in order to save computation time and cost. First, a plain ring rolling of rectangular cross-section is simulated. Comparisons between computation and experiment show good agreement in the cross-sectional configuration of the deformed ring. Then, a profile ring with an external round groove is analyzed. The rolls with and without groove have been analyzed to compare the amount of side spread. It is found that the grooves in the rolls are effective in reducing the amount of side spread.

A Design of Superscalar Digital Signal Processor (다중 명령어 처리 DSP 설계)

  • Park, Sung-Wook
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.18 no.3
    • /
    • pp.323-328
    • /
    • 2008
  • This paper presents a Digital Signal Processor achieving high through-put for both decision intensive and computation intensive tasks. The proposed processor employees a multiplier, two ALU and load/store. Unit as operational units. Those four units are controlled and works parallel by superscalar control scheme, which is different from prior DSP architecture. The performance evaluation was done by implementing AC-3 decoding algorithm and 37.8% improvement was achieved. This study is valuable especially for the consumer electronics applications, which require very low cost.

Fast 3D reconstruction method based on UAV photography

  • Wang, Jiang-An;Ma, Huang-Te;Wang, Chun-Mei;He, Yong-Jie
    • ETRI Journal
    • /
    • v.40 no.6
    • /
    • pp.788-793
    • /
    • 2018
  • 3D reconstruction of urban architecture, land, and roads is an important part of building a "digital city." Unmanned aerial vehicles (UAVs) are gradually replacing other platforms, such as satellites and aircraft, in geographical image collection; the reason for this is not only lower cost and higher efficiency, but also higher data accuracy and a larger amount of obtained information. Recent 3D reconstruction algorithms have a high degree of automation, but their computation time is long and the reconstruction models may have many voids. This paper decomposes the object into multiple regional parallel reconstructions using the clustering principle, to reduce the computation time and improve the model quality. It is proposed to detect the planar area under low resolution, and then reduce the number of point clouds in the complex area.

Low-Cost Position Sensorless Switched Relutance Motor Drive Using a Single-Controllable Switch Converter

  • Yang, Hyong-Yeol;Kim, Jae-Hyuck;Krishnan, R.
    • Journal of Power Electronics
    • /
    • v.12 no.1
    • /
    • pp.75-82
    • /
    • 2012
  • Elimination of rotor position sensors mechanically coupled with the rotor shaft is attractive to variable speed drives primarily due to increased system reliability and cost reduction. In this regard, search for a simple and robust position sensorless control has been intensified in past few years specifically for low-cost, high-volume applications such as home appliances. This paper describes a new parameter insensitive position sensorless control for switched reluctance motor (SRM) drives satisfying such a need in this market segment. Two consecutive switch-on times of the controllable switch in hysteresis current control are compared to estimate the rotor position and speed. The proposed sensorless control algorithm is very simple to implement since it does not depend on extensive computation or any additional hardware. In addition, the proposed method is robust in that its dynamic performance is least affected by system parameter variations. The proposed approach is demonstrated on a single-controllable-switch-converter-driven SRM with two-phases that lends itself to a system with low cost and compact packaging which comes close to the intended applications. Analysis and simulation results followed by experimental verification are presented to demonstrate the feasibility of the proposed sensorless control method.

Life-cycle-cost optimization for the wind load design of tall buildings equipped with TMDs

  • Venanzi, Ilaria;Ierimonti, Laura;Caracoglia, Luca
    • Wind and Structures
    • /
    • v.30 no.4
    • /
    • pp.379-392
    • /
    • 2020
  • The paper presents a Life-Cycle Cost-based optimization framework for wind-excited tall buildings equipped with Tuned Mass Dampers (TMDs). The objective is to minimize the Life-Cycle Cost that comprises initial costs of the structure, the control system and costs related to repair, maintenance and downtime over the building's lifetime. The integrated optimization of structural sections and mass ratio of the TMDs is carried out, leading to a set of Pareto optimal solutions. The main advantage of the proposed methodology is that, differently from the traditional optimal design approach, it allows to perform the unified design of both the structure and the control system in a Life Cycle Cost Analysis framework. The procedure quantifies wind-induced losses, related to structural and nonstructural damage, considering the stochastic nature of the loads (wind velocity and direction), the specificity of the structural modeling (e.g., non-shear-type vibration modes and torsional effects) and the presence of the TMDs. Both serviceability and ultimate limit states related to the structure and the TMDs' damage are adopted for the computation of repair costs. The application to a case study tall building allows to demonstrate the efficiency of the procedure for the integrated design of the structure and the control system.

Comparative Study on Similarity Measurement Methods in CBR Cost Estimation

  • Ahn, Joseph;Park, Moonseo;Lee, Hyun-Soo;Ahn, Sung Jin;Ji, Sae-Hyun;Kim, Sooyoung;Song, Kwonsik;Lee, Jeong Hoon
    • International conference on construction engineering and project management
    • /
    • 2015.10a
    • /
    • pp.597-598
    • /
    • 2015
  • In order to improve the reliability of cost estimation results using CBR, there has been a continuous issue on similarity measurement to accurately compute the distance among attributes and cases to retrieve the most similar singular or plural cases. However, these existing similarity measures have limitations in taking the covariance among attributes into consideration and reflecting the effects of covariance in computation of distances among attributes. To deal with this challenging issue, this research examines the weighted Mahalanobis distance based similarity measure applied to CBR cost estimation and carries out the comparative study on the existing distance measurement methods of CBR. To validate the suggest CBR cost model, leave-one-out cross validation (LOOCV) using two different sets of simulation data are carried out. Consequently, this research is expected to provide an analysis of covariance effects in similarity measurement and a basis for further research on the fundamentals of case retrieval.

  • PDF

Further Improvement of Direct Solution-based FETI Algorithm (직접해법 기반의 FETI 알고리즘의 개선)

  • Kang, Seung-Hoon;Gong, DuHyun;Shin, SangJoon
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.35 no.5
    • /
    • pp.249-257
    • /
    • 2022
  • This paper presents an improved computational framework for the direct-solution-based finite element tearing and interconnecting (FETI) algorithm. The FETI-local algorithm is further improved herein, and localized Lagrange multipliers are used to define the interface among its subdomains. Selective inverse entry computation, using a property of the Boolean matrix, is employed for the computation of the subdomain interface stiffness and load, in which the original FETI-local algorithm requires a full matrix inverse computation of a high computational cost. In the global interface computation step, the original serial computation is replaced by a parallel multi-frontal method. The performance of the improved FETI-local algorithm was evaluated using a numerical example with 64 million degrees of freedom (DOFs). The computational time was reduced by up to 97.8% compared to that of the original algorithm. In addition, further stable and improved scalability was obtained in terms of a speed-up indicator. Furthermore, a performance comparison was conducted to evaluate the differences between the proposed algorithm and commercial software ANSYS using a large-scale computation with 432 million DOFs. Although ANSYS is superior in terms of computational time, the proposed algorithm has an advantage in terms of the speed-up increase per processor increase.

Computing Performance Comparison of CPU and GPU Parallelization for Virtual Heart Simulation (가상 심장 시뮬레이션에서 CPU와 GPU 병렬처리의 계산 성능 비교)

  • Kim, Sang Hee;Jeong, Da Un;Setianto, Febrian;Lim, Ki Moo
    • Journal of Biomedical Engineering Research
    • /
    • v.41 no.3
    • /
    • pp.128-137
    • /
    • 2020
  • Cardiac electrophysiology studies often use simulation to predict how cardiac will behave under various conditions. To observe the cardiac tissue movement, it needs to use the high--resolution heart mesh with a sophisticated and large number of nodes. The higher resolution mesh is, the more computation time is needed. To improve computation speed and performance, parallel processing using multi-core processes and network computing resources is performed. In this study, we compared the computational speeds of CPU parallelization and GPU parallelization in virtual heart simulation for efficiently calculating a series of ordinary differential equations (ODE) and partial differential equations (PDE) and determined the optimal CPU and GPU parallelization architecture. We used 2D tissue model and 3D ventricular model to compared the computation performance. Then, we measured the time required to the calculation of ODEs and PDEs, respectively. In conclusion, for the most efficient computation, using GPU parallelization rather than CPU parallelization can improve performance by 4.3 times and 2.3 times in calculations of ODEs and PDE, respectively. In CPU parallelization, it is best to use the number of processors just before the communication cost between each processor is incurred.