• Title/Summary/Keyword: computation

Search Result 8,025, Processing Time 0.032 seconds

Efficient Computation of Radioactive Decay with Graph Algorithms

  • Yoo, Tae-Sic
    • Journal of Nuclear Fuel Cycle and Waste Technology(JNFCWT)
    • /
    • v.18 no.1
    • /
    • pp.19-29
    • /
    • 2020
  • This paper gives two graph-based algorithms for radioactive decay computation. The first algorithm identifies the connected components of the graph induced from the given radioactive decay dynamics to reduce the size of the problem. The solutions are derived over the precalculated connected components, respectively and independently. The second algorithm utilizes acyclic structure of radioactive decay dynamics. The algorithm evaluates the reachable vertices of the induced system graph from the initially activated vertices and finds the minimal set of starting vertices populating the entire reachable vertices. Then, the decay calculations are performed over the reachable vertices from the identified minimal starting vertices, respectively, with the partitioned initial value over the reachable vertices. Formal arguments are given to show that the proposed graph inspired divide and conquer calculation methods perform the intended radioactive decay calculation. Empirical efforts comparing the proposed radioactive decay calculation algorithms are presented.

The 3rd National Conference Of Professional engineers - Outline of U-City (제3회 전국기술사대회 특집(3차분) - U-City 개요 - 건축전기설비 -)

  • Youn, Gill-Jae
    • Journal of the Korean Professional Engineers Association
    • /
    • v.42 no.6
    • /
    • pp.28-30
    • /
    • 2009
  • There is a proverb in Korea "Don't chase after another." It can be a right proverb in sometimes. However, usually it doesn't fit in these various society, information knowledge society. Modern society requires convergence technology. IBS (Intelligent Building System) requires knowledge of architecture field, electric field, communication field, and computation field. ITS (Intelligent Transport Systems) which is constructing in many cities requires various knowledge as engineering works, electricity, computation, communication and transportation. In the case of u-City, it requires technology of many fields as architecture, electricity, communication, engineering works, transportation, and computation. Anyone who wants to participate in u-City should study and acquire knowledge in various field. Otherwise, it must be failed because of lack of communication like as the Tower of Babel. U-City is not a portion of one field. Therefore, engineers in many fields should cooperate with each other to make u-city as the best product in the world.

  • PDF

A Study on Reduction of Computation Time through Adjustment the Frequency Interval Information in the G.723.1 Vocoder (G.723.1 보코더에서 주파수 간격 정보조절을 통한 계산량 감소에 관한 연구)

  • 민소연;김영규;배명진
    • Proceedings of the IEEK Conference
    • /
    • 2002.06d
    • /
    • pp.405-408
    • /
    • 2002
  • LSP(Line Spectrum Pairs) Parameter is used for speech analysis in vocoders or recognizers since it has advantages of constant spectrum sensitivity. low spectrum distortion and easy linear interpolation. However the method of transforming LPC(Linear Predictive Coding) into LSP is so complex that it takes much time to compute. Among conventional methods, the real root method is considerably simpler than others, but nevertheless, it still suffers from its jndeterministic computation time because the root searching is processed sequentially in frequency region. We suggest a method of reducing the LSP transformation time using voice characteristics The proposed method is to apply search order and interval differently according to the distribution of LSP parameters. in comparison with the conventional real root method, the proposed method results in about 46.5% reduction. And, the total computation time is reduce to about 5% in the G.723.1 vocoder.

  • PDF

Application of the Method of Moments to the Capacitance Computation of a Parallel-Plate Rectangular Capacitor

  • Roh, Young-Su
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.28 no.11
    • /
    • pp.93-99
    • /
    • 2014
  • The method of moments is applied to numerically compute the electrostatic capacitance of a parallel-plate rectangular capacitor of finite area. Each plate is discretized into 900 patches per unit area to ensure a high accuracy of computation. To further enhance computational results, the impedance matrix elements are additionally evaluated in the case that the observation patch is located above or below the source patch in the vertical direction. To examine the fringing effect at the edges of the capacitor, the normalized capacitances are computed as a function of separation distance. After these results have been verified by Palmer's formula, this method is extended to the computation of capacitances between two different size plates.

A ballistic lead-computation method to improve firing accuracy of army combat vehicles (전투차량의 사격통제 성능향상을 위한 탄도해 리드 계산 기법)

  • Jeoun, Young-Mi
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.10 no.2
    • /
    • pp.31-37
    • /
    • 2007
  • This paper presents a ballistic lead-computation method which utilizes automatic video tracking, tracking assistance and roll uncoupling. The method is able to improve the firing accuracy of army fighting vehicles such as main battle tanks. In the experiment, the efficiency of the proposed method is evaluated by an error analysis in real operating environment. The proposed method has been applied to the fire control system of a military vehicle and proved through the development test of the vehicle.

EKF-based Simultaneous Localization and Mapping of Mobile Robot using Laser Corner Pattern Matching (레이저 코너 패턴의 매칭을 이용한 이동 로봇의 EKF 기반 SLAM)

  • Kim, Tae-Hyeong;Park, Tae-Hyoung
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.65 no.12
    • /
    • pp.2094-2102
    • /
    • 2016
  • In this paper, we propose an extended Kalman filter(EKF)-based simultaneous localization and mapping(SLAM) method using laser corner pattern matching for mobile robots. SLAM is one of the most important problems of mobile robot. However, existing method has the disadvantage of increasing the computation time, depending on the number of landmarks. To improve computation time, we produce the corner pattern using classified and detected corner points. After producing the corner patterns, it is estimated that mobile robot's global position by matching them. The estimated position is used as measurement model in the EKF. To evaluated proposed method, we preformed the experiments in the indoor environments. Experimental results of proposed method are shown to maintain an accuracy and decrease the computation time.

Comparison of Evolutionary Computation for Power Flow Control in Power Systems (전력계통의 전력조류제어를 위한 진화연산의 비교)

  • Lee, Sang-Keun
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.54 no.2
    • /
    • pp.61-66
    • /
    • 2005
  • This paper presents an unified method which solves real and reactive power dispatch problems for the economic operation of power systems using evolutionary computation such as genetic algorithms(GA), evolutionary programming(EP), and evolution strategy(ES). Many conventional methods to this problem have been proposed in the past, but most of these approaches have the common defect of being caught to a local minimum solution. The proposed methods, applied to the IEEE 30-bus system, were run for 10 other exogenous parameters and composed of P-optimization module and Q-optimization module. Each simulation result, by which evolutionary computations are compared and analyzed, shows the possibility of applications of evolutionary computation to large scale power systems.

Design of a Node Label Data Flow Machine based on Self-timed (Self-timed 기반의 Node Label Data Flow Machine 설계)

  • Kim, Hee-Sook;Jung, Sung-Tae;Park, Hee-Soon
    • Proceedings of the KIEE Conference
    • /
    • 1998.11b
    • /
    • pp.666-668
    • /
    • 1998
  • In this paper we illustrate the design of a node label data flow machine based on self-timed paradigm. Data flow machines differ from most other parallel architectures, they are based on the concept of the data-driven computation model instead of the program store computation model. Since the data-driven computation model provides the excution of instructions asynchronously, it is natural to implement a data flow machine using self timed circuits.

  • PDF

Efficient Computation of Two-Phase Flow by Eulerian-Lagrangian Method Using Separate grids for the Particles and Flow Field (Eulerian-Lagrangian 방법에서 입자 및 유동 격자계 분리를 통한 2상 유동의 효율적 계산)

  • Pak S. I.;Lee J K.;Chang K. S.
    • 한국전산유체공학회:학술대회논문집
    • /
    • 2003.08a
    • /
    • pp.43-48
    • /
    • 2003
  • When the Eulerian-Lagrangian method is used to analyze the particle laden two-phase flow, a large number of particles should be used to obtain statistically meaningful solutions. Then it takes too much time to track the particles and to average the particle properties in the numerical analysis of two-phase flow. The purpose of this paper is to reduce the computation time by means of a set of particle gird separate to the flow grid. Particle motion equation here is the simplified B-B-O equation, which is integrated to get the particle trajectories. Particle turbulent dispersion, wall collision, and wall roughness effects are considered but the two-way coupling effects between gas and particles are neglected. Particle laden 2-D channel flow is solved and it is shown that the computational efficiency is indeed improved by using the current method

  • PDF

Sub-degrees of freedom method with perturbation procedure for reduction of eigenvalue computation

  • Liu, Xiao-Lin
    • Structural Engineering and Mechanics
    • /
    • v.8 no.6
    • /
    • pp.579-589
    • /
    • 1999
  • A new way to reduce the eigenvalue computation effort in structural dynamics is presented in this paper. The degrees of freedom of a structure may be classified into groups that are termed as sub-degrees of freedom. The eigenvalue analysis is performed with each of sub-degrees of freedom so that the computing time is much shortened. Since the dynamic coupling between sub-degrees of freedom is selected to be small and it may be considered as a perturbation, the perturbation algorithm is used to obtain an accuratae result. The accuracy of perturbation depends on the coupling between sub-degrees of freedom. The weaker the coupling is, the more accurate the result is. The procedure can be used to simplify a problem of three dimensions to that of two dimensions or from two dimensions to one dimension. The application to a truss and a space frame is shown in the paper.