• Title/Summary/Keyword: Basic computation

Search Result 251, Processing Time 0.029 seconds

Analysis of Nonlinear Resistive Networks (비선형저항(resistive)회로망의 해석)

  • Kyun Hyon Tchah
    • 전기의세계
    • /
    • v.23 no.3
    • /
    • pp.70-76
    • /
    • 1974
  • Computer is used to analyze nonlinear networks. Integrated circuits and new nonlinear elements have generated much interest in nonlinear circuit theory. A key to the understanding and analysis of nonlinear circuits is the study of characteristics for nonlinear elements and nonlinear resistive networks both in theory and in computation. In this apper, an iteration method using cut set analysis for nonlinear dc analysis based on Branin's method is described. Application of this algorithm to solve two nonlinear problems, is presented and a possible method of improving the basic algorithm by means of a sparse matrix technique is described.

  • PDF

On a Reduction of Pitch Search Time for IMBE Vocoder by Using the Spectral AMDF (SAMDF를 이용한 IMBE VOCODER의 피치 검색 시간 단축에 관한 연구)

  • 홍성훈
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • 1998.06c
    • /
    • pp.155-158
    • /
    • 1998
  • IMBE(Improved Multi-Band Excitation) vocoders exhibit good performance at low data rates. The major drawback to IMBE coders is their large computational requirements. In this paper, thus, we propose a new pitch search method that preserves the quality of the IMBE vocoder with reduced complexity. The basic idea is to reduce computation complexity of the pitch searching by using the SAMDF. Applying the proposed method to the IMBE vocoder, we can get approximately 52.02% searching time reduction in the pitch search. There is no difference in voice quality between conventional IMBE and proposed IMBE.

  • PDF

A RECURSIVE FORMULA FOR THE KHOVANOV COHOMOLOGY OF KANENOBU KNOTS

  • Lei, Fengchun;Zhang, Meili
    • Bulletin of the Korean Mathematical Society
    • /
    • v.54 no.1
    • /
    • pp.1-15
    • /
    • 2017
  • Kanenobu has given infinite families of knots with the same HOMFLY polynomial invariant but distinct Alexander module structure. In this paper, we give a recursive formula for the Khovanov cohomology of all Kanenobu knots K(p, q), where p and q are integers. The result implies that the rank of the Khovanov cohomology of K(p, q) is an invariant of p + q. Our computation uses only the basic long exact sequence in knot homology and some results on homologically thin knots.

An Efficient Public Key Based Security Architecture for Wireless Sensor Networks

  • Haque, Mokammel;Pathan, Al-Sakib Khan;Hong, Choong-Seon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2007.05a
    • /
    • pp.1098-1099
    • /
    • 2007
  • In this paper, we propose a public key based security architecture for Wireless Sensor Networks (WSNs). The basic architecture comprises of two schemes; a key handshaking scheme based on simple linear operations for fast computation and an identity based cryptosystem which does not require any certificate authority. Our analysis shows that, the combined scheme ensures a good level of security and is very much suitable for the energy constrained trend of wireless sensor network.

  • PDF

ON A STUDY OF ERROR BOUNDS OF TRAPEZOIDAL RULE

  • Hahm, Nahmwoo;Hong, Bum Il
    • Honam Mathematical Journal
    • /
    • v.36 no.2
    • /
    • pp.291-303
    • /
    • 2014
  • In this paper, through a direct computation with subintervals partitioning [0, 1], we compute better a posteriori bounds for the average case error of the difference between the true value of $I(f)=\int_{0}^{1}f(x)dx$ with $f{\in}C^r$[0, 1] minus the composite trapezoidal rule and the composite trapezoidal rule minus the basic trapezoidal rule for $r{\geq}3$ by using zero mean-Gaussian.

Speaker Identification using Phonetic GMM (음소별 GMM을 이용한 화자식별)

  • Kwon Sukbong;Kim Hoi-Rin
    • Proceedings of the KSPS conference
    • /
    • 2003.10a
    • /
    • pp.185-188
    • /
    • 2003
  • In this paper, we construct phonetic GMM for text-independent speaker identification system. The basic idea is to combine of the advantages of baseline GMM and HMM. GMM is more proper for text-independent speaker identification system. In text-dependent system, HMM do work better. Phonetic GMM represents more sophistgate text-dependent speaker model based on text-independent speaker model. In speaker identification system, phonetic GMM using HMM-based speaker-independent phoneme recognition results in better performance than baseline GMM. In addition to the method, N-best recognition algorithm used to decrease the computation complexity and to be applicable to new speakers.

  • PDF

A Study on Image Pixel Classification Using Directional Scales (방향성 정보 척도를 이용한 영상의 픽셀분류 방법에 관한 연구)

  • 박중순;김수겸
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.28 no.4
    • /
    • pp.587-592
    • /
    • 2004
  • Pixel classification is one of basic issues of image processing. The general characteristics of the pixels belonging to various classes are discussed and the radical principles of pixel classification are given. At the same time, a pixel classification scheme based on image information scales is proposed. The proposed method is overcome that computation amount become greater and contents easily get turned. And image directional scales has excellent anti-noise performance. In the result of experiment. good efficiency is showed compare with other methods.

R: AN OVERVIEW AND SOME CURRENT DIRECTIONS

  • Tierney, Luke
    • Journal of the Korean Statistical Society
    • /
    • v.36 no.1
    • /
    • pp.31-55
    • /
    • 2007
  • R is an open source language for statistical computing and graphics based on the ACM software award-winning S language. R is widely used for data analysis and has become a major vehicle for making available new statistical methodology. This paper presents an overview of the design philosophy and the development model for R, reviews the basic capabilities of the system, and outlines some current projects that will influence future developments of R.

Unsteady Performance Analysis of a Simple Shaft Gas Turbine Cycle (단순 가스터빈 사이클 과도 성능해석)

  • Kim, Soo-Yong;Soudarev, B.
    • 연구논문집
    • /
    • s.30
    • /
    • pp.5-13
    • /
    • 2000
  • The computation scheme of simulating gas turbine transient behavior was developed. The basic principles of this scheme and main input data required are described. Calculation results are presented in terms of whole operating regime of the cycle. The influence of main initial parameters such as starting engine power, moment of inertia of the rotor, fuel supplying schedule etc. on performance characteristics of has turbine during transient operation is studied In addition, bleeding air influence on transient behavior was also considered For validation of the developed code, comparison of present calculation with that of measurement data of the experimental data for the range of operating period studied.

  • PDF

A Study on the Computation of the Number of Equivalence Classes and Its applications

  • Yoo, Wonsok
    • Journal of Integrative Natural Science
    • /
    • v.13 no.1
    • /
    • pp.19-26
    • /
    • 2020
  • In this paper, we study on the reinterpretation of Burnside's theorem that is a tool to compute the number of equivalence classes of a group action on a set, and by applying it, we find out the numbers of different patterns in coloring problems of various types of figures with symmetry and use them for computing the numbers of different kinds of chemical compounds.