• Title/Summary/Keyword: Sub-problem Approximation Method

Search Result 25, Processing Time 0.03 seconds

An Ambiguity-free Surface Construction from Volume Data (입체적인 데이터에서 애매성-프리 표면 재구성)

  • Lee, Ee-Taek;Oh, Kwang-Man;Park, Kyu Ho
    • Journal of the Korea Computer Graphics Society
    • /
    • v.4 no.1
    • /
    • pp.55-66
    • /
    • 1998
  • This paper presents a simple method for relieving the ambiguity problems within the sub-voxel based surface-fitting approach for the surface construction. ECB algorithm is proposed to avoid the ambiguity problem which is the root of the holes within the resulting polygon based approximation. The basic idea of our disambiguation strategy is the use of a set of predefined modeling primitives (we call SMP) which guarantees the topological consistency of resulted surface polygons. 20 SMPs are derived from the extension of the concept of the elementary modeling primitives in the CB algorithm [3], and fit one to five faces of them to the iso-surface crossing a cell with no further processing. A look-up table which has a surface triangle list is pre-calculated using these 20 SMPs. All of surface triangles in the table are from the faces of SMPs and are stored in the form of edge list on which vertices of each surface triangle are located. The resulted polygon based approximation is unique at every threshold value and its validity is guaranteed without considering the complicated problems such as average of density and postprocessing. ECB algorithm could be free from the need for the time consuming post-processing, which eliminates holes by revisiting every boundary cell. Through three experiments of surface construction from volume data, its capability of hole avoidance is showed.

  • PDF

Discrete Optimization of Unsymmetric Composite Laminates Using Linear Aproximation Method (선형 근사화방법을 이용한 비대칭 복합 적층평판의 이산최적화)

  • 이상근;구봉근;한상훈
    • Computational Structural Engineering
    • /
    • v.10 no.2
    • /
    • pp.255-263
    • /
    • 1997
  • The optimum design of most structural systems used in practice requires considering design variables as discrete quantities. The present paper shows that the linear approximation method is very effective as a tool for the discrete optimum designs of unsymmetric composite laminates. The formulated design problem is subjected to a multiple in-plane loading condition due to shear and axial forces, bending and twisting moments, which is controlled by maximum strain criterion for each of the plys of a composite laminate. As an initial approach, the process of continuous variable optimization by FDM is required only once in operating discrete optimization. The nonlinear discrete optimization problem that has the discrete and continuous variables is transformed into the mixed integer programming problem by SLDP. In numerical examples, the discrete optimum solutions for the unsymmetric composite laminates consisted of six plys according to rotated stacking sequence were found, and then compared the results with the nonlinear branch and bound method to verify the efficiency of present method.

  • PDF

Development of an Efficient Optimization Technique for Robust Design by Approximating Probability Constratints (확률조건의 근사화를 통한 효율적인 강건 최적설계 기법의 개발)

  • Jeong, Do-Hyeon;Lee, Byeong-Chae
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.24 no.12
    • /
    • pp.3053-3060
    • /
    • 2000
  • Alternative formulation is presented for robust optimization problems and an efficient computational scheme for reliability estimation is proposed. Both design variables and design parameters considered as random variables about their nominal values. To ensure the robustness of objective performance a new cost function bounding the performance and a new constraint limiting the performance variation are introduced. The constraint variations are regulated by considering the probability of feasibility. Each probability constraint is transformed into a sub-optimization problem and then is resolved with the modified advanced first order second moment(AFOSM) method for computational efficiency. The proposed robust optimization method has advantages that the mean value and the variation of the performance function are controlled simultaneously and the second order sensitivity information is not required even in case of gradient based optimization. The suggested method is examined by solving three examples and the results are compared with those for deterministic case and those available in literature.

SPMLD: Sub-Packet based Multipath Load Distribution for Real-Time Multimedia Traffic

  • Wu, Jiyan;Yang, Jingqi;Shang, Yanlei;Cheng, Bo;Chen, Junliang
    • Journal of Communications and Networks
    • /
    • v.16 no.5
    • /
    • pp.548-558
    • /
    • 2014
  • Load distribution is vital to the performance of multipath transport. The task becomes more challenging in real-time multimedia applications (RTMA), which impose stringent delay requirements. Two key issues to be addressed are: 1) How to minimize end-to-end delay and 2) how to alleviate packet reordering that incurs additional recovery time at the receiver. In this paper, we propose sub-packet based multipath load distribution (SPMLD), a new model that splits traffic at the granularity of sub-packet. Our SPMLD model aims to minimize total packet delay by effectively aggregating multiple parallel paths as a single virtual path. First, we formulate the packet splitting over multiple paths as a constrained optimization problem and derive its solution based on progressive approximation method. Second, in the solution, we analyze queuing delay by introducing D/M/1 model and obtain the expression of dynamic packet splitting ratio for each path. Third, in order to describe SPMLD's scheduling policy, we propose two distributed algorithms respectively implemented in the source and destination nodes. We evaluate the performance of SPMLD through extensive simulations in QualNet using real-time H.264 video streaming. Experimental results demonstrate that: SPMLD outperforms previous flow and packet based load distribution models in terms of video peak signal-to-noise ratio, total packet delay, end-to-end delay, and risk of packet reordering. Besides, SPMLD's extra overhead is tiny compared to the input video streaming.

Large deflection analysis of edge cracked simple supported beams

  • Akbas, Seref Doguscan
    • Structural Engineering and Mechanics
    • /
    • v.54 no.3
    • /
    • pp.433-451
    • /
    • 2015
  • This paper focuses on large deflection static behavior of edge cracked simple supported beams subjected to a non-follower transversal point load at the midpoint of the beam by using the total Lagrangian Timoshenko beam element approximation. The cross section of the beam is circular. The cracked beam is modeled as an assembly of two sub-beams connected through a massless elastic rotational spring. It is known that large deflection problems are geometrically nonlinear problems. The considered highly nonlinear problem is solved considering full geometric non-linearity by using incremental displacement-based finite element method in conjunction with Newton-Raphson iteration method. There is no restriction on the magnitudes of deflections and rotations in contradistinction to von-Karman strain displacement relations of the beam. The beams considered in numerical examples are made of Aluminum. In the study, the effects of the location of crack and the depth of the crack on the non-linear static response of the beam are investigated in detail. The relationships between deflections, end rotational angles, end constraint forces, deflection configuration, Cauchy stresses of the edge-cracked beams and load rising are illustrated in detail in nonlinear case. Also, the difference between the geometrically linear and nonlinear analysis of edge-cracked beam is investigated in detail.