• Title/Summary/Keyword: approximate method

Search Result 2,017, Processing Time 0.06 seconds

A Study on TSIUVC Approximate-Synthesis Method using Least Mean Square (최소 자승법을 이용한 TSIUVC 근사합성법에 관한 연구)

  • Lee, See-Woo
    • The KIPS Transactions:PartB
    • /
    • v.9B no.2
    • /
    • pp.223-230
    • /
    • 2002
  • In a speech coding system using excitation source of voiced and unvoiced, it would be involves a distortion of speech waveform in case coexist with a voiced and an unvoiced consonants in a frame. This paper present a new method of TSIUVC (Transition Segment Including Unvoiced Consonant) approximate-synthesis by using Least Mean Square. The TSIUVC extraction is based on a zero crossing rate and IPP (Individual Pitch Pulses) extraction algorithm using residual signal of FIR-STREAK Digital Filter. As a result, This method obtain a high Quality approximation-synthesis waveform by using Least Mean Square. The important thing is that the frequency signals in a maximum error signal can be made with low distortion approximation-synthesis waveform. This method has the capability of being applied to a new speech coding of Voiced/Silence/TSIUVC, speech analysis and speech synthesis.

New Randomness Testing Methods using Approximate Periods (근사 주기를 이용한 새로운 랜덤성 테스트 기법)

  • Lim, Ji-Hyuk;Lee, Sun-Ho;Kim, Dong-Kyue
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.6
    • /
    • pp.742-746
    • /
    • 2010
  • In this paper, we propose new randomness testing methods based on approximate periods in order to improve the previous randomness testing method using exact pattern matching. Finding approximate periods of random sequences enables us to search similarly repeated parts, but it has disadvantages since it takes long time. In this paper we propose randomness testing methods whose time complexity is O($n^2$) by reducing the time complexity of computing approximate periods from O($n^3$) to O($n^2$). Moreover, we perform some experiments to compare pseudo random number generated by AES cryptographic algorithms and true random number.

A Study on Preprocessing Method for Effective Semantic-based Similarity Measures using Approximate Matching Algorithm (의미적 유사성의 효과적 탐지를 위한 데이터 전처리 연구)

  • Kang, Hari;Jeong, Doowon;Lee, Sangjin
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.25 no.3
    • /
    • pp.595-602
    • /
    • 2015
  • One of the challenges of the digital forensics is how to handle certain amounts of data efficiently. Although reliable and various approximate matching algorithms have been presented to quickly identify similarities between digital objects, its practical effectiveness to identify the semantic similarity is low because of frequent false positives. To solve this problem, we suggest adding a pre-processing of the approximate matching target dataset to increase matching accuracy while maintaining the reliability of the approximate matching algorithm. To verify the effectiveness, we experimented with two datasets of eml and hwp using sdhash in order to identify the semantic similarity.

Development of Empirical Formulas for Approximate Spectral Moment Based on Rain-Flow Counting Stress-Range Distribution

  • Jun, Seockhee;Park, Jun-Bum
    • Journal of Ocean Engineering and Technology
    • /
    • v.35 no.4
    • /
    • pp.257-265
    • /
    • 2021
  • Many studies have been performed to predict a reliable and accurate stress-range distribution and fatigue damage regarding the Gaussian wide-band stress response due to multi-peak waves and multiple dynamic loads. So far, most of the approximation models provide slightly inaccurate results in comparison with the rain-flow counting method as an exact solution. A step-by-step study was carried out to develop new approximate spectral moments that are close to the rain-flow counting moment, which can be used for the development of a fatigue damage model. Using the special parameters and bandwidth parameters, four kinds of parameter-based combinations were constructed and estimated using the R-squared values from regression analysis. Based on the results, four candidate empirical formulas were determined and compared with the rain-flow counting moment, probability density function, and root mean square (RMS) value for relative distance. The new approximate spectral moments were finally decided through comparison studies of eight response spectra. The new spectral moments presented in this study could play an important role in improving the accuracy of fatigue damage model development. The present study shows that the new approximate moment is a very important variable for the enhancement of Gaussian wide-band fatigue damage assessment.

Development of GUI Environment Using a Commercial Program for Truss Structure of Approximate Optimization (상용프로그램을 사용한 트러스 구조물 근사최적설계 GUI 환경 개발)

  • 임오강;이경배
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.16 no.4
    • /
    • pp.431-437
    • /
    • 2003
  • In this paper, an approximate optimization program based on GUI(graphic user interface) environment is developed. This program is coded by using Fortran and Visual basic. Fortran is used to Progress approximate optimization process. Visual basic is used to make user environment for user to use conveniently. Inside of this program, it uses two independent programs. One is commercial program, ANSYS, and the other is optimization program, PLBA(Pshenichny-Lim-Belegundu Arora). The former is used to obtain approximate equation of stress and displacement of a structure. The latter is used to solve approximate optimization. This algorithm uses second-order information of a function and active set strategy. This program is connecting ANSYS and PLBA. And it progress the process repeatedly until it obtain optimum value. As a method of approximate optimization, sequential design domain(SDD) is introduced. SDD starts with a certain range which is offseted from midpoint of an initial design domain and then SDD of the next step is determined by optimal point of a prior step.

Approximate Analysis of a CONWIP system with Compound Poisson Demands (Compound Poisson 수요를 갖는 CONWIP 시스템의 근사적 분석)

  • 이정은;이효성
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.23 no.3
    • /
    • pp.153-168
    • /
    • 1998
  • In this study we consider a CONWIP system in which the processing times at each station follow an exponential distribution and the demands for the finished Products arrive according to a compound Poisson process. The demands that are not satisfied instantaneously are assumed to be backordered. For this system we develop an approximation method to obtain the performance measures such as steady state probabilities of the number of parts at each station, the proportion of backordered demands, the average number of backordered demands and the mean waiting time of a backordered demand. For the analysis of the proposed CONWIP system, we model the CONWIP system as a closed queueing network with a synchronization station and analyze the closed queueing network using a product form approximation method. A matrix geometric method is used to solve the subnetwork in the application of the product-form approximation method. To test the accuracy of the approximation method, the results obtained from the approximation method were compared with those obtained by simulation. Comparisons with simulation have shown that the approximate method provides fairly good results.

  • PDF

Design of Robust DC-DC Converter by High-Order Approximate 2-Degree-of-Freedom Digital Controller

  • Takegami, E.;Tomioka, S.;Watanabe, K.;Higuchi, K.;Nakano, K.;Kajikawa, T.
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.232-237
    • /
    • 2004
  • In many application of DC-DC converters, loads cannot be specified in advance, i.e., their amplitudes are suddenly changed from the zero to the maximum rating. Generally, design conditions are changed for each load and then each controller is re-designed. Then, a so-called robust DC-DC converter which can cover such extensive load changes and also input voltage changes with one controller is needed. Analog control IC is used usually for the controller of DC-DC converter. Simple integral control etc. are performed with the analog control IC. However it is difficult to retain sufficient robustness of DC-DC converter by these techniques. The authors proposed the method of designing an approximate 2-degree-of-freedom (2DOF) controller of DC-AC converter. This controller has an ability to attain sufficient robustness against extensive load and DC power supply changes. For applying this approximate 2DOF controller to DC-DC converter, it is necessary to improve the degree of approximation for better robustness. In this paper, we propose a method of designing good approximate 2DOF digital controller which makes the control bandwidth wider, and at the same time makes a variation of the output voltage very small at a sudden change of resistive load. The proposed good approximate 2DOF digital controller is actually implemented on a DSP and is connected to a DC-DC converter. Experimental studies demonstrate that this type digital controller can satisfy given specifications.

  • PDF

An approximate method to make Jisuguimundo (지수귀문도를 만드는 근사적 방법)

  • Park, Kyo Sik
    • Journal for History of Mathematics
    • /
    • v.31 no.4
    • /
    • pp.183-196
    • /
    • 2018
  • In this study, we propose an approximate method to make Jisuguimundo with magic number 93 to 109. In this method, for two numbers p, q with a relationship of M = 2p+q, we use eight pairs of two numbers with sum p and five pairs of two numbers with sum q. Such numbers must be between 1 and 30. Instead of determining all positions of thirty numbers, this method shows that Jisuguimundo with magic number 93 to 109 can be made by determining positions of thirteen numbers $a_i$(i = 1, 2, ${\cdots}$, 8), $b_5$, $c_i$(i = 1, 2, 3, 4). Method 1 is used to make Jisuguimundo with magic number 93 to 108, and method 2 is used to make Jisuguimundo with magic number 109.

Approximate Analysis of a CONWIP System with a Lot Production (로트 단위로 가공되는 CONWIP 시스템의 근사적 분석)

  • Lee, Hyo-Seong;Lee, Jeong-Eun
    • IE interfaces
    • /
    • v.11 no.3
    • /
    • pp.55-63
    • /
    • 1998
  • In this study we consider a CONWIP system in which the processing times at each station follow an exponential distribution and the demands for the finished products arrive according to a compound Poisson process. The demands that are not satisfied instantaneously are assumed to be lost. We assume that the lot size at each station is greater than one. For this system we develop an approximation method to obtain the performance measures such as steady state probabilities of the number of parts at each station, average number of parts at each station and the proportion of lost demands. For the analysis of the proposed CONWIP system, we model the CONWIP system as a closed queueing network with a synchronization station and analyze the closed queueing network using a product form approximation method. A recursive technique is used to solve the subnetwork in the application of the product-form approximation method. To test the accuracy of the approximation method, the results obtained from the approximation method were compared with those obtained by simulation. Comparisons with simulation have shown that the accuracy of the approximate method is acceptable.

  • PDF

Dynamic characteristics analysis of forcing jet by Karhunen-Loeve transformation (Karhunen-Loeve 변환을 이용한 Forcing 제트의 동적 특성 해석)

  • Lee, Chan-Hui;Lee, Sang-Hwan
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.21 no.6
    • /
    • pp.758-772
    • /
    • 1997
  • The snapshot method is introduced to approximate the coherent structures of planar forcing jet flow. The numerical simulation of flow field is simulated by discrete vortex method. With snapshot method we could treat the data efficiently and approximate coherent structures inhered in the planer jet flow. By forcing the jet at a sufficient amplitude and at a well-chosen frequency, the paring can be controlled in the region of the jet. Finally we expressed the underlying coherent structures of planar jet flow in the minimum number of modes by Karhunen-Loeve transformation in order to understand jet flow and to make the information storage and management in computers easier.