• Title/Summary/Keyword: computation

Search Result 8,025, Processing Time 0.032 seconds

Development of Interactive Graphical Software for Power Flow Education (그래픽을 이용한 대화식 교육용 전력조류계산 소프트웨어 개발)

  • Lee, Uk-Hwa;Shin, Joong-Rin
    • Proceedings of the KIEE Conference
    • /
    • 1993.07a
    • /
    • pp.39-41
    • /
    • 1993
  • This paper presents the development of interactive graphical software for the educational purpose of power flow(PF) calculation. The developed software is specially designated to give a beginner the interest on PF problem as well as to increase the understanding of it with ease. the software developed in this paper is basically composed of the pull-down menu driver, in which various functions, such as Program Master, Data File Management, Case Study Option, PF Run and View Output, are prepared to handle the software easily and thus to be familiar with power flow calculation. A special design is also considered for interactive operation of the software, wi th which user can interrupt the computation process of PF to control the convergency of PF algorithm, With this function begineer can acquire the understanding of convergency characteristics and numerical sensitivity of PF algorithm as well as basic concept of its computation logic. Futhermore, various graphic illustrations is also provided to review and compare the computation results on monitor.

  • PDF

Parallel Computation Algorithm of Gauss Elimination in Power system Analysis (전력계통의 자코비안행렬 가우스소거의 병렬계산)

  • Suh, Eui-Suk;Oh, Tae-Kyoo
    • Proceedings of the KIEE Conference
    • /
    • 1993.07a
    • /
    • pp.163-166
    • /
    • 1993
  • This paper describes an parallell computing algorithm in Gauss elimination of Jacobian matrix to large-scale power system. The structure of Jacobian matrix becomes different according to ordering method of buses. In sequential computation buses are ordered to minimize the number of fill-in in the triangulation of the Jacobian matrix. The proposed method using ND(nested dissection) ordering develops the parallelism in the Gauss elimination to have balance of computing load among processes and each processor uses the sequential computation method to preserve the sparsity of matrix.

  • PDF

A study on electric field computation of dielectric analysis model with the conductivity on its surface (표면에 도전율을 갖는 유전체 해석모델의 전계계산에 관한 연구)

  • Kim, Hyeong-Seok;Lee, Ki-Sik;Hahn, Song-Yop
    • Proceedings of the KIEE Conference
    • /
    • 1995.07a
    • /
    • pp.6-8
    • /
    • 1995
  • In this paper, we study the computation of the electric field of dielectric analysis models with the conductivity on its surface. The finite element formulation describes a sinusoidal electrodynamic field computation. One term is added to this functional in order to take the conductivity on its surface into accounts. The electric field computations of the dielectric analysis model are done first with the surface conductivity and second with the volume conductivity. Also, it is shown that a surface conductor with sufficiently large conductivity can be substituted with a floating equipotential line. This method is applied to an insulator in arbitrary shape with the conductivity on its surface.

  • PDF

Reduction of Dimension of HMM parameters in MLLR Framework for Speaker Adaptation (화자적응시스템을 위한 MLLR 알고리즘 연산량 감소)

  • Kim Ji Un;Jeong Jae Ho
    • Proceedings of the KSPS conference
    • /
    • 2003.05a
    • /
    • pp.123-126
    • /
    • 2003
  • We discuss how to reduce the number of inverse matrix and its dimensions requested in MLLR framework for speaker adaptation. To find a smaller set of variables with less redundancy, we employ PCA(principal component analysis) and ICA(independent component analysis) that would give as good a representation as possible. The amount of additional computation when PCA or ICA is applied is as small as it can be disregarded. The dimension of HMM parameters is reduced to about 1/3 ~ 2/7 dimensions of SI(speaker independent) model parameter with which speech recognition system represents word recognition rate as much as ordinary MLLR framework. If dimension of SI model parameter is n, the amount of computation of inverse matrix in MLLR is proportioned to O($n^4$). So, compared with ordinary MLLR, the amount of total computation requested in speaker adaptation is reduced to about 1/80~1/150.

  • PDF

Study on Fluid Flow in Rectangular Duct past $90^{\circ}$ Mitered Elbow (사각덕트내 직각엘보우를 지난 유체유동에 관한 연구)

  • 윤영환;배택희;박원구
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.26 no.6
    • /
    • pp.670-678
    • /
    • 2002
  • Fluid flow in a rectangular duct with $90^{\circ}$ mitered elbow is measured by 5W laser doppler velocity meter. The fluid flow is also computed by commercial software of STAR-CD for comparison between measured and computed velocity profiles in the duct. Reynolds numbers for the comparison are 1,608 and 11,751 based on mean velocity and hydraulic diameter of the duct. First, the fluid flow of Reynolds number equal to 1,608 is predicted by assumptions of both laminar and turbulent models. But, even though the Reynolds number is less than 2,300~3,000, the computation by turbulent model is closed to the experimental data than that by laminar model. Second, the computation for Reynolds number of 11,751 by turbulent model also predicted the experimental data satisfactorily.

Graph coloring problem solving by calculations at the DNA level with operating on plasmids

  • Feng, Xiongfeng;Kubik, K.Bogunia
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.49.3-49
    • /
    • 2001
  • In 1994 Adelman´s pioneer work demonstrated that deoxyribonucleic acid (DNA) could be used as a medium for computation to solve mathematical problems. He described the use of DNA based computational approach to solve the Hamiltonian Path Problem (HPP). Since then a number of combinatorial problems have been analyzed by DNA computation approaches including, for example: Maximum Independent Set (MIS), Maximal Clique and Satisfaction (SAT) Problems. In the present paper we propose a method of solving another classic combinatorial optimization problem - the eraph Coloring Problem (GCP), using specifically designed circular DNA plasmids as a computation tool. The task of the analysis is to color the graph so that no two nodes ...

  • PDF

Automated Control Gain Determination Using PSO/SQP Algorithm (PSO/SQP를 이용한 제어기 이득 자동 추출)

  • Lee, Jang-Ho;Ryu, Hyeok;Min, Byoung-Moom
    • Aerospace Engineering and Technology
    • /
    • v.7 no.1
    • /
    • pp.61-67
    • /
    • 2008
  • To design flight control law of an unmanned aerial vehicle, automated control gain determination program was developed. The procedure for determination of control gain was formulated as the control gains were designed from the optimal solutions of the optimization problem. PSO algorithm, which is one of the evolutionary computation method, and SQP algorithm, which is one of the nonlinear programming method, are used as optimization problem solver. Thru this technique, computation time required for finding the optimal solution is decreased to 1/5 of that of PSO algorithm and more accurate optimal solution is obtained.

  • PDF

An Approximation of Gaussian Pyramid Top Layer for Simplification of Image Pyramid-based Multi Scale Exposure Fusion Algorithm (이미지 피라미드 기반의 다중 노출 영상 융합기법 단순화를 위한 가우시안 피라미드 최상층 근사화)

  • Hwang, Tae Hun;Kim, Jin Heon
    • Journal of Korea Multimedia Society
    • /
    • v.22 no.10
    • /
    • pp.1160-1167
    • /
    • 2019
  • Because of the dynamic range limitation of digital equipment, it is impossible to obtain dark and bright areas at the same time with one shot. In order to solve this problem, an exposure fusion technique for fusing a plurality of images photographed at different exposure amounts into one is being studied. Among them, Laplacian pyramid decomposition based fusion method can generate natural HDR image by fusing images of various scales. But this requires a lot of computation time. Therefore, in this paper, we propose an approximation technique that achieves similar performance and greatly shortens computation time. The concept of vanishing point image for approximation is introduced, and the validity of the proposed approach is verified by comparing the computation time with the resultant image.

Study on Velocity Measurement and Numerical Computation in a Rectangular Duct with $90^\circ$ Bend Elbow (곡면 엘보우를 가진 사각덕트 내의 유속측정 및 수치계산에 관한 연구)

  • 윤영환;박원구
    • Korean Journal of Air-Conditioning and Refrigeration Engineering
    • /
    • v.15 no.11
    • /
    • pp.910-917
    • /
    • 2003
  • Fluid flow in a rectangular duct for 90$^{\circ}$ bend elbow with the ratio of 1.5 between its curvature radius and width is measured by 5 W laser doppler velocity meter. The fluid flow is also computed by commercial software of STAR-CD for comparison between measured and computed velocity profiles in the duct. Reynolds numbers for the comparison are 11,643, 19,746 and 24,260. From the comparison, computation of principal velocity components in the duct predicts the experimental data somewhat satisfactorily even though those of minor velocity components and turbulent kinetic energy do not match with the experimental data quite well. K-factor for the bend elbow is computed to be average 0.086 while the equivalent ASHRAE data is 0.07.

Secure Multi-Party Computation of Technology FinTech (FinTech를 위한 다자간 컴퓨팅 암호기술)

  • Park, Chankil;Choi, Youngwha;Lee, Cheulhee
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.15 no.1
    • /
    • pp.61-66
    • /
    • 2019
  • FinTech has expanded to the extent that not only businesses but almost everyone can feel the impact. The spread of the scope of use has introduced a variety of new financial services that are changing the way we live. In these environments, it is important to develop reliable security measures to protect against cyber attacks. The number of mobile financial transactions in the financial sector is also increasing, making security vulnerable. In this study, we studied security through mutual authentication method that can safely handle financial security and focused on FinTech's security processing through multi-party mutual authentication method that strongly prevents leakage of information even in the event of continuous and sophisticated attacks.