• Title/Summary/Keyword: computational algorithm

Search Result 4,372, Processing Time 0.032 seconds

라인(line) 제약조건을 가지는 2차원 사각 메쉬의 자동 생성 알고리즘 (An Algorithm of Automatic 2D Quadrilateral Mesh Generation with the Line Constraints)

  • 김인일;이규열;조두연;김태완
    • 한국CDE학회논문집
    • /
    • 제8권1호
    • /
    • pp.10-18
    • /
    • 2003
  • FEM (Finite Element Method) is a fundamental numerical analysis technique in wide spread use in engineering application. As the solving time occupies small portion of entire FEM analysis time because of development of hardware, the relative lime to the whole analysis time to make mesh mod-els is growing. In particular, in the case of stiffeners such as features attached to plate in ship structure, the line constraints are imposed on mesh model together with other constraints such as holes. To auto-matically generate two dimensional quadrilateral mesh with the line constraints, an algorithm is pro-posed based on the constrained Delaunay triangulation and Q-Morph algorithm in which the line constraints are not considered. The performance of the proposed algorithm is evaluated. And some numerical results of our proposed algorithm ate presented.

다수제품의 수익성 최대화를 위한 설비입지선정 문제 (The Maximal Profiting Location Problem with Multi-Product)

  • 이상헌;백두현
    • 한국경영과학회지
    • /
    • 제31권4호
    • /
    • pp.139-155
    • /
    • 2006
  • The facility location problem of this paper is distinguished from the maximal covering location problem and the flxed-charge facility location problem. We propose the maximal profiting location problem (MPLP) that is the facility location problem maximizing profit with multi-product. We apply to the simulated annealing algorithm, the stochastic evolution algorithm and the accelerated simulated annealing algorithm to solve this problem. Through a scale-down and extension experiment, the MPLP was validated and all the three algorithm enable the near optimal solution to produce. As the computational complexity is increased, it is shown that the simulated annealing algorithm' is able to find the best solution than the other two algorithms in a relatively short computational time.

Maximum Product Detection Algorithm for Group Testing Frameworks

  • Seong, Jin-Taek
    • 한국정보전자통신기술학회논문지
    • /
    • 제13권2호
    • /
    • pp.95-101
    • /
    • 2020
  • In this paper, we consider a group testing (GT) framework which is to find a set of defective samples out of a large number of samples. To handle this framework, we propose a maximum product detection algorithm (MPDA) which is based on maximum a posteriori probability (MAP). The key idea of this algorithm exploits iterative detection to propagate belief to neighbor samples by exchanging marginal probabilities between samples and output results. The belief propagation algorithm as a conventional approach has been used to detect defective samples, but it has computational complexity to obtain the marginal probability in the output nodes which combine other marginal probabilities from the sample nodes. We show that the our proposed MPDA provides a benefit to reduce computational complexity up to 12% in runtime, while its performance is only slightly degraded compared to the belief propagation algorithm. And we verify the simulations to compare the difference of performance.

A modified multi-objective elitist-artificial bee colony algorithm for optimization of smart FML panels

  • Ghashochi-Bargha, H.;Sadr, M.H.
    • Structural Engineering and Mechanics
    • /
    • 제52권6호
    • /
    • pp.1209-1224
    • /
    • 2014
  • In Current paper, the voltages of patches optimization are carried out for minimizing the power consumption of piezoelectric patches and maximum vertical displacement of symmetrically FML panels using the modified multi-objective Elitist-Artificial Bee Colony (E-ABC) algorithm. The voltages of patches, panel length/width ratios, ply angles, thickness of metal sheets and edge conditions are chosen as design variables. The classical laminated plate theory (CLPT) is considered to model the transient response of the panel, and numerical results are obtained by the finite element method. The performance of the E-ABC is also compared with the PSO algorithm and shows the good efficiency of the E-ABC algorithm. To check the validity, the transient responses of isotropic and orthotropic panels are compared with those available in the literature and show a good agreement.

다수 물류기지 재고 및 경로 문제의 유전알고리즘에 의한 해법 (An Effective Genetic Algorithm for Solving the Joint Inventory and Routing Problem with Multi-warehouses)

  • 정재헌
    • 경영과학
    • /
    • 제29권3호
    • /
    • pp.107-120
    • /
    • 2012
  • In this paper we propose an effective genetic algorithm for solving the integrated inventory and routing problem of supply chain composed of multi-warehouses and multi-retailers. Unlike extant studies dealing with integrated inventory and routing problem of supply chain, our model incorporates more realistic aspect such as positive inventory at the multi-warehouses under the assumption of inventory policy of power of two-replenishment-cycle. The objective is to determine replenishment intervals for the retailers and warehouses as well as the vehicles routes so that the total cost of delivery and inventory cost is minimized. A notable feature of our algorithm is that the procedure for evaluating the fitness of objective function has the computational complexity closing to linear function. Computational results show effectiveness of our algorithm.

GPU를 이용한 삼각형 집합의 외경계 계산 알고리즘 (GPU Algorithm for Outer Boundaries of a Triangle Set)

  • 경민호
    • 한국CDE학회논문집
    • /
    • 제17권4호
    • /
    • pp.262-273
    • /
    • 2012
  • We present a novel GPU algorithm to compute outer cell boundaries of 3D arrangement subdivided by a given set of triangles. An outer cell boundary is defined as a 2-manifold surface consisting of subdivided polygons facing outward. Many geometric problems, such as Minkowski sum, sweep volume, lower/upper envelop, Bool operations, can be reduced to finding outer cell boundaries with specific properties. Computing outer cell boundaries, however, is a very time-consuming job and also is susceptible to numerical errors. To address these problems, we develop an algorithm based on GPU with a robust scheme combining interval arithmetic and multi-level precisions. The proposed algorithm is tested on Minkowski sum of several polygonal models, and shows 5-20 times speedup over an existing algorithm running on CPU.

고속 블록 정합 움직임 추정을 위한 개선된 교차 탐색 알고리즘 (Modified Cross Search Algorithm for Fast Block Matching Motion Estimation)

  • 고병관;곽통일;황보현;윤종호;최명렬
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2008년도 하계종합학술대회
    • /
    • pp.811-812
    • /
    • 2008
  • In this paper, a modified cross search algorithm for fast block matching motion estimation is proposed. Various Motion Estimation (ME) algorithms have been proposed since ME requires large computational complexity. The proposed algorithm employs Modified Cross Search Pattern (MCSP) to search the motion vector. Efficient compression can be achieved since Modified Cross Search Algorithm (MCSA) simplifies the search pattern to reduce the computational complexity. The experimental results show that proposed algorithm reduces the search points up to 29% compared to conventional methods.

  • PDF

플라스틱 사출 금형의 분할면 자동 생성을 위한 관통 특징 형상 추출 알고리즘의 개발 (Passage Feature Recognition Algorithm for Automatic Parting Surface Generation in Plastic Injection Mold)

  • 정강훈;이건우
    • 한국CDE학회논문집
    • /
    • 제5권2호
    • /
    • pp.196-205
    • /
    • 2000
  • This paper proposes a topology-based algorithm for recognizing the passage features using a concept of multi-face hole loop. The Multi-face hole loop is a concetpual hole loop that is formed over several connected faces. A passage feature is recognized in the proposed approach by two multi-face hole loops that constitute its enterance and exit. The algorithm proposed in this paper checks the connectivity of the two multi-face hole loops to recognize passage features. The total number of passage features in a part is calculated from Euler equation and is compared with the number of found passage features to decide when to terminate. To find all multi-face hole loops in a part, this paper proposes an algorithm for finding all combinations of connected faces. The edge convexity is used to judge the validity of multi-face hole loops. By using the algorithm proposed in this paper, the passage features could be recognized effectively. The approach proposed in this paper is illustrated with several example parts.

  • PDF

지진하중을 받는 구조물의 MR 유체 감쇠기를 이용한 반능동 신경망제어 (Semiactive Neuro-control for Seismically Excited Structure Considering Dynamics of MR Damper)

  • 이헌재;정형조;오주원;이인원
    • 한국전산구조공학회:학술대회논문집
    • /
    • 한국전산구조공학회 2003년도 봄 학술발표회 논문집
    • /
    • pp.403-410
    • /
    • 2003
  • A new semiactive control strategy for seismic response reduction using a neuro-controller and a magnetorheological (MR) fluid damper is proposed. The proposed control system adopts a clipped algorithm which induces the MR damper to generate approximately the desired force. The improved neuro - controller, which was developed by employing the training algorithm based on a cost function and the sensitivity evaluation algorithm replacing an emulator neural network, produces the desired active control force, and then by using the clipped algorithm the appropriate command voltage is selected in order to cause the MR damper to generate the desired control force. The simulation results show that the proposed semiactive neuro-control algorithm is quite effective to reduce seismic responses. In addition, the semi-active control system using MR fluid dampers has many attractive features, such as the bounded-input, bounded-output stability and small energy requirements. The results of this investigation, therefore, indicate that the proposed semi-active neuro-control strategy using MR fluid dampers could be effectively used for control of seismically excited structures.

  • PDF

An Optimization Algorithm for Minimum Connected Dominating Set Problem in Wireless Sensor Network

  • Ahn, Nam-Su;Park, Sung-Soo
    • Industrial Engineering and Management Systems
    • /
    • 제10권3호
    • /
    • pp.221-231
    • /
    • 2011
  • One of the critical issues in wireless sensor network is the design of a proper routing protocol. One possible approach is utilizing a virtual infrastructure, which is a subset of sensors to connect all the sensors in the network. Among the many virtual infrastructures, the connected dominating set is widely used. Since a small connected dominating set can help to decrease the protocol overhead and energy consumption, it is preferable to find a small sized connected dominating set. Although many algorithms have been suggested to construct a minimum connected dominating set, there have been few exact approaches. In this paper, we suggest an improved optimal algorithm for the minimum connected dominating set problem, and extensive computational results showed that our algorithm outperformed the previous exact algorithms. Also, we suggest a new heuristic algorithm to find the connected dominating set and computational results show that our algorithm is capable of finding good quality solutions quite fast.