• Title/Summary/Keyword: Computation amount

Search Result 604, Processing Time 0.028 seconds

Parametric Macro for Two-Dimensional Layout on the Auto-CAD System

  • Kim, Yunyoung;Park, Jewoong
    • Journal of Ship and Ocean Technology
    • /
    • v.4 no.3
    • /
    • pp.13-20
    • /
    • 2000
  • In recent years, a number of successful nesting approaches have been developed by using the various heuristic algorithms, and due to their application potential several commercial CAD/CAM packages include a nesting module for solving the layout problems. Since a large portion of the complexity of the part nesting problem results from the overlapping computation, the geometric representation is one of the most important factors to reduce the complexity of the problem. The proposed part representation method can easily handle parts and raw materials with widely varying geometrical shape by using the redesigning modules. This considerably reduces the amount of processed data and consequently the run time of the computer. The aim of this research is to develop parametric macro for two-dimensional layout on the Auto-CAD system. Therefore, this research can be called "pre-nesting".ing".uot;.

  • PDF

Methods of Computing Change Times of Dynamic Workflow Changes

  • Shingo Yamaguchi;Ge, Qi-Wei;Minoru Tanaka
    • Proceedings of the IEEK Conference
    • /
    • 2000.07b
    • /
    • pp.645-648
    • /
    • 2000
  • A workflow is a flow of work carried out by multiple people. In order to increase efficiency, it is re-quired to change the current workflow dynamically. Till now, three types of dynamic changes: flush, abort, and synthetic cut-over (SCO) , have been proposed. How- ever, the performance evaluations for dynamic workflow changes have not been undertaken. To do so, measuring the amount of time cost making a single change (called change time) and comparing the methods for obtaining such times become ever important. In this paper, we first define change time and then propose a computation method individually for each change type. Finally, we evaluate the performance of an example net change by computing the change times.

  • PDF

Improvement of Newton-Raphson Iteration Using ELS (강성등가하중을 이용한 Newton-Raphson Iteration 개선)

  • Kim, Chee-Kyeong;Hwang, Young-Chul
    • Proceeding of KASS Symposium
    • /
    • 2006.05a
    • /
    • pp.170-174
    • /
    • 2006
  • This paper presents a new nonlinear analysis algorithm which uses the equivalent nodal load for the element stiffness. The equivalent nodal load represents the influence of the stiffness change such as the addition of elements, the deletion of elements, and/or the partial change of element stiffness. The nonlinear analysis of structures using the equivalent load improves the efficiency very much because the inverse of the structural stiffness matrix, which needs a large amount of computation to calculate, is reused in each loading step. In this paper, the concept of nonlinear analysis using the equivalent load for the element stiffness is described and some numerical examples are provided to verify it.

  • PDF

Classification of High Dimensionality Data through Feature Selection Using Markov Blanket

  • Lee, Junghye;Jun, Chi-Hyuck
    • Industrial Engineering and Management Systems
    • /
    • v.14 no.2
    • /
    • pp.210-219
    • /
    • 2015
  • A classification task requires an exponentially growing amount of computation time and number of observations as the variable dimensionality increases. Thus, reducing the dimensionality of the data is essential when the number of observations is limited. Often, dimensionality reduction or feature selection leads to better classification performance than using the whole number of features. In this paper, we study the possibility of utilizing the Markov blanket discovery algorithm as a new feature selection method. The Markov blanket of a target variable is the minimal variable set for explaining the target variable on the basis of conditional independence of all the variables to be connected in a Bayesian network. We apply several Markov blanket discovery algorithms to some high-dimensional categorical and continuous data sets, and compare their classification performance with other feature selection methods using well-known classifiers.

Block Matching Algorithm Using Sub-blocks (서브블록을 이용한 블록 정합 알고리즘)

  • Kim, Seong-Hee;Oh, Jeong-Su
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.1
    • /
    • pp.655-658
    • /
    • 2005
  • This paper proposes a modified block matching algorithm which reduces an amount of matching computation by using only pixels contributing greatly to block matching. In consideration of algorithm implementation and additional information, the proposed algorithm divides a matching block into sub-blocks, selects some sub-blocks using their complexities, and execute the block mating with them. Simulation results show that the proposed algorithm performs a valid block matching with some sub-blocks.

  • PDF

An Improved Branch-and-Bound Algorithm for Scheduling Jobs on Identical Machines

  • Park, Sung-Hyun
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.1 no.2
    • /
    • pp.73-81
    • /
    • 1975
  • In an earlier paper ('Scheduling Jobs on a Number of Identical Machines' by Elmaghraby and Park, March 1974, AIIE Transactions) a branch-and-bound algorithm was developed for the sequencing problem when all jobs are available to process at time zero and are independet (i.e., there are not a priori precedence relationships among jobs.). However, the amount of computation required by the algorithm was not considered to be short if more than 50 jobs were processed. As an effort to improve the algorithm, the present paper modifies the implicit enumeration procedure in the algorithm so that moderately large problems can be treated with what appears to be a short computational time. Mainly this paper is concerned with improving the lower bound in the implicit enumeration procedure. The computational experiences with this new branch-and-bound algorithm are given.

  • PDF

A Study on the Degree of Line Balance to Noise and its Measurement Circuits (잡음평형도와 측정회로에 관한 연구)

  • Yeo, Sang-Kun;Kim, Chong-Tae
    • Journal of The Institute of Information and Telecommunication Facilities Engineering
    • /
    • v.9 no.2
    • /
    • pp.35-41
    • /
    • 2010
  • The balance coefficients between telecommunication lines are specified in the technical standard and the power induction computation method varies in the order of 100 times in magnitude according to the amount of impedance. The results of actual balance measurements, differing from time to time with the measurement circuit or increasing proportionally as the induction voltage increases, appeared as a measurement error because of not using the standard measurement circuit. This article investigates such errors and proposes the use of a standard balance measurement circuit and a measurement device impedance under the domestic notification standard and the ITU-T international standard.

  • PDF

Vibration Analysis for a Complex and Large Lattice Type Structure Using Transfer Dynamic Stiffness Coefficient (동강계수의 전달에 의한 복잡 거대한 격자형 구조물의 진동해석)

  • 문덕홍;최명수
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 1997.10a
    • /
    • pp.190-195
    • /
    • 1997
  • Recently it is increased by degrees to construct complex or large lattice type structures such as bridges, towers, cranes, and structures that can be used for space technology. In general, in order to analyze, these structures we have used the finite element method(FEM). In this method, however, it is necessary to use a large amount of computer memory and computation time because the FEM requires many degrees of freedom for solving dynamic problems for these structures. For overcoming this problem, the authors have developed the transfer dynamic stiffness coefficient method(TDSCM). This method is based on the concepts of the transfer and the synthesis of the dynamic stiffness coefficient which is related to force and displacement vector at each node. In this paper, the authors formulate vibration analysis algorithm for a complex and large lattice type structure using the transfer of the dynamic stiffness coefficient. And the validity of TDSCM demonstrated through numerical computational and experimental results.

  • PDF

On a Reduction of Pitch Searching Time by Preliminary Pitch in the CELP Vocoder

  • Bae, Seong-Gyun;Kim, Hyung-Rae;Kim, Dae-Sik;Bae, Myung-Jin
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • 1994.06a
    • /
    • pp.1104-1111
    • /
    • 1994
  • Code Excited Linear Prediction(CELP) as a speech coder exhibits good performance at data rates below 4.8 kbps. The major drawback to CELP type coders is their large amount of computation. In this paper, we propose a new pitch search method that preserves the quality of the CELP vocoder with reduced complexity. The basic idea is to restrict the pitch searching range by estimating the preliminary pitches. Applying the proposed method to the CELP vocoder, we can get approximately 87% complexity reduction in the pitch search.

  • PDF

Robust Reliability Analysis of Vibration Components

  • Huang, Hong-Zhong;Li, Yong-Hua;Ming J. Zuo
    • International Journal of Reliability and Applications
    • /
    • v.5 no.2
    • /
    • pp.59-74
    • /
    • 2004
  • There are many uncertain parameters associated with vibration components. Their physical parameters, the machining quality of vibration components, and the applied load acting on them are all uncertain. As a result, the natural frequency and the fatigue limits are also uncertain variables. In this paper, we express these parameters of vibration components and the frequency zone of resonance through interval models; this way, the robust reliability of the vibration components is defined. The robust reliability model measures and assesses the reliability of vibration components. The robust reliability of a cantilever beam is evaluated as an example. The results show that this method is reasonable for robust reliability analysis of vibration components because it does not require a large amount of failure data, it avoids the evaluation of the probability density function, and the computation is simple.

  • PDF