• Title/Summary/Keyword: Fast algorithm

Search Result 3,699, Processing Time 0.031 seconds

Long Term Average Spectrum Characteristics of Head and Chest Register Sounds of Western Operatic Singers : Extended Study (성악다들의 목소리에 대한 Long Term Average Spectrum 분석 -$2^{nd}$ Singer's Formant의 존재 가능성에 대하여-)

  • Ban, Jae-Ho;Kwon, Young-Kyung;Jin, Sung-Min
    • Journal of the Korean Society of Laryngology, Phoniatrics and Logopedics
    • /
    • v.15 no.1
    • /
    • pp.31-36
    • /
    • 2004
  • Background and Objectives : It has been shown that the epilaryngeal tube in the human airway is responsible for vocal ring, or the singer's formant. In previous study, authors showed that in trained tenors, besides the conventional singer's formant in the region of ,5500Hz, another energy peak was observed in the region of 8,000Hz. This peak was interpreted as the second resonance of the epilarynx tube. Singers in other voice categories who produce vocal ring are assumed to have the same peak, but no measurements have as yet been made. Materials and Methods : Fifteen tenors, fourteen baritones, seven sopranos and five mezzo sopranos attending the music college, department of vocal music who could reliably produce the head and chest registers were chosen for this study. Each subject was asked to produce an/ah/sound for at least three seconds for the head register sound(tenors ; G4, barions ; E4 sopranos ; F5 and mezzosopranos ; C5) and for the chest register sound (tenors ; C3, baritones ; D3, sopranos ; D4 and Mezzosoprano ; A3). The sound data was analyzed using the Fast Fourier Transform (FFT)-based power spectrum, Long term average(LTA) power spectrum using the FFT algorithm of the Computerized Speech Lab (CSL, Kay elemetrics, Model 4300B, USA). Statistical analysis was performed using the Mann-Whitney test of the Statistical Package for Social sciences(SPSS). Results : For head register sounds, a significant increase was seen in the 2,200-3,400Hz region(p<0.05) and the Similar to the head register sounds, there was a significant increase in energy in the four trained singer group compared with the untrained group in the 2,200-3,100Hz region(p<0.05), the 7,800-8,400Hz region(p<0.05) for the chest register sounds. Conclusions : When good vocal production was made for the head and chest registers, an energy peak was observed near 2,500Hz, a frequency already known as the "singer's formant', in all subjects in the study group. Another region of increased energy was observed around 8,000Hz that had not been noticed previously. The authors believe this region to be the second singer's formant.

  • PDF

Molecular Analysis of Pathogenic Molds Isolated from Clinical Specimen (임상검체에서 분리된 병원성 사상균의 분자생물학적 분석)

  • Lee, Jang Ho;Kwon, Kye Chul;Koo, Sun Hoe
    • Korean Journal of Clinical Laboratory Science
    • /
    • v.52 no.3
    • /
    • pp.229-236
    • /
    • 2020
  • Sixty-five molds isolated from clinical specimens were included in this study. All the isolates were molds that could be identified morphologically, strains that are difficult to identify because of morphological similarities, and strains that require species-level identification. PCR and direct sequencing were performed to target the internal transcribed spacer (ITS) region, the D1/D2 region, and the β-tubulin gene. Comparative sequence analysis using the GenBank database was performed using the basic local alignment search tool (BLAST) algorithm. The fungi identified morphologically to the genus level were 67%. Sequencing analysis was performed on 62 genera and species level of the 65 strains. Discrepancies were 14 (21.5%) of the 65 strains between the results of phenotypic and molecular identification. B. dermatitidis, T. marneffei, and G. argillacea were identified for the first time in Korea using the DNA sequencing method. Morphological identification is a very useful method in terms of the reporting time and costs in cases of frequently isolated and rapid growth, such as Aspergillus. When molecular methods are employed, the cost and clinical significance should be considered. On the other hand, the molecular identification of molds can provide fast and accurate results.

An Implementation of Low Power MAC using Improvement of Multiply/Subtract Operation Method and PTL Circuit Design Methodology (승/감산 연산방법의 개선 및 PTL회로설계 기법을 이용한 저전력 MAC의 구현)

  • Sim, Gi-Hak;O, Ik-Gyun;Hong, Sang-Min;Yu, Beom-Seon;Lee, Gi-Yeong;Jo, Tae-Won
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.37 no.4
    • /
    • pp.60-70
    • /
    • 2000
  • An 8$\times$8+20-bit MAC is designed with low power design methodologies at each of the system design levels. At algorithm level, a new method for multipl $y_tract operation is proposed, and it saves the transistor counts over conventional methods in hardware realization. A new Booth selector circuit using NMOS pass-transistor logic is also proposed at circuit level. It is superior to other circuits designed by CMOS in power-delay-product. And at architecture level, we adopted an ELM adder that is known to be the most efficient in power consumption, operating frequency, area and design regularity as the final adder. For registers, dynamic CMOS single-edge triggered flip-flops are used because they need less transistors per bit. To increase the operating frequency 2-stage pipeline architecture is adopted, and fast 4:2 compressors are applied in Wallace tree block. As a simulation result, the designed MAC in 0.6${\mu}{\textrm}{m}$ 1-poly 3-metal CMOS process is operated at 200MHz, 3.3V and consumed 35㎽ of power in multiply operation, and operated at 100MHz consuming 29㎽ in MAC operations, respectively.ly.

  • PDF

An Efficient Parallelization Implementation of PU-level ME for Fast HEVC Encoding (고속 HEVC 부호화를 위한 효율적인 PU레벨 움직임예측 병렬화 구현)

  • Park, Soobin;Choi, Kiho;Park, Sang-Hyo;Jang, Euee Seon
    • Journal of Broadcast Engineering
    • /
    • v.18 no.2
    • /
    • pp.178-184
    • /
    • 2013
  • In this paper, we propose an efficient parallelization technique of PU-level motion estimation (ME) in the next generation video coding standard, high efficiency video coding (HEVC) to reduce the time complexity of video encoding. It is difficult to encode video in real-time because ME has significant complexity (i.e., 80 percent at the encoder). In order to solve this problem, various techniques have been studied, and among them is the parallelization, which is carefully concerned in algorithm-level ME design. In this regard, merge estimation method using merge estimation region (MER) that enables ME to be designed in parallel has been proposed; but, parallel ME based on MER has still unconsidered problems to be implemented ideally in HEVC test model (HM). Therefore, we propose two strategies to implement stable parallel ME using MER in HM. Through experimental results, the excellence of our proposed methods is shown; the encoding time using the proposed method is reduced by 25.64 percent on average of that of HM which uses sequential ME.

Cortical Thickness Estimation Using DIR Imaging with GRAPPA Factor 2 (DIR 영상을 이용한 피질두께 측정: GRAPPA 인자 2를 이용한 비교)

  • Choi, Na-Rae;Nam, Yoon-Ho;Kim, Dong-Hyun
    • Investigative Magnetic Resonance Imaging
    • /
    • v.14 no.1
    • /
    • pp.56-63
    • /
    • 2010
  • Purpose : DIR image is relatively free from susceptibility artifacts therefore, DIR image can make it possible to reliably measure cortical thickness/volume. One drawback of the DIR acquisition is the long scan time to acquire the fully sampled 3D data set. To solve this problem, we applied a parallel imaging method (GRAPPA) and verify the reliability of using the volumetric study. Materials and methods : Six healthy volunteers (3 males and 3 females; age $25.33{\pm}2.25$ years) underwent MRI using the 3D DIR sequence at a 3.0T Siemens Tim Trio MRI scanner. GRAPPA simulation was performed from the fully sampled data set for reduction factor 2. Data reconstruction was performed using MATLAB R2009b. Freesurfer v.4.3.0 was used to evaluate the cortical thickness of the entire brain, and to extract white matter information from the DIR image, Analyze 9.0 was used. The global cortical thickness estimated from the reconstructed image was compared with reference image by using a T-test in SPSS. Results : Although reduced SNR and blurring are observed from the reconstructed image, in terms of segmentation the effect was not so significant. The volumetric result was validated that there were no significant differences in many cortical regions. Conclusion : This study was performed with DIR image for a volumetric MRI study. To solve the long scan time of 3D DIR imaging, we applied GRAPPA algorithm. According to the results, fast imaging can be done with reduction factor 2 with little loss of image quality at 3.0T.

Reducing False Alarm and Shortening Worm Detection Time in Virus Throttling (Virus Throttling의 웜 탐지오판 감소 및 탐지시간 단축)

  • Shim Jae-Hong;Kim Jang-bok;Choi Hyung-Hee;Jung Gi-Hyun
    • The KIPS Transactions:PartC
    • /
    • v.12C no.6 s.102
    • /
    • pp.847-854
    • /
    • 2005
  • Since the propagation speed of the Internet worms is quite fast, worm detection in early propagation stage is very important for reducing the damage. Virus throttling technique, one of many early worm detection techniques, detects the Internet worm propagation by limiting the connection requests within a certain ratio.[6, 7] The typical throttling technique increases the possibility of false detection by treating destination IP addresses independently in their delay queue managements. In addition, it uses a simple decision strategy that determines a worn intrusion if the delay queue is overflown. This paper proposes a two dimensional delay queue management technique in which the sessions with the same destination IP are linked and thus a IP is not stored more than once. The virus throttling technique with the proposed delay queue management can reduce the possibility of false worm detection, compared with the typical throttling since the proposed technique never counts the number of a IP more than once when it chicks the length of delay queue. Moreover, this paper proposes a worm detection algorithm based on weighted average queue length for reducing worm detection time and the number of worm packets, without increasing the length of delay queue. Through deep experiments, it is verified that the proposed technique taking account of the length of past delay queue as well as current delay queue forecasts the worn propagation earlier than the typical iuぉ throttling techniques do.

Speech Recognition for the Korean Vowel 'ㅣ' based on Waveform-feature Extraction and Neural-network Learning (파형 특징 추출과 신경망 학습 기반 모음 'ㅣ' 음성 인식)

  • Rho, Wonbin;Lee, Jongwoo;Lee, Jaewon
    • KIISE Transactions on Computing Practices
    • /
    • v.22 no.2
    • /
    • pp.69-76
    • /
    • 2016
  • With the recent increase of the interest in IoT in almost all areas of industry, computing technologies have been increasingly applied in human environments such as houses, buildings, cars, and streets; in these IoT environments, speech recognition is being widely accepted as a means of HCI. The existing server-based speech recognition techniques are typically fast and show quite high recognition rates; however, an internet connection is necessary, and complicated server computing is required because a voice is recognized by units of words that are stored in server databases. This paper, as a successive research results of speech recognition algorithms for the Korean phonemic vowel 'ㅏ', 'ㅓ', suggests an implementation of speech recognition algorithms for the Korean phonemic vowel 'ㅣ'. We observed that almost all of the vocal waveform patterns for 'ㅣ' are unique and different when compared with the patterns of the 'ㅏ' and 'ㅓ' waveforms. In this paper we propose specific waveform patterns for the Korean vowel 'ㅣ' and the corresponding recognition algorithms. We also presents experiment results showing that, by adding neural-network learning to our algorithm, the voice recognition success rate for the vowel 'ㅣ' can be increased. As a result we observed that 90% or more of the vocal expressions of the vowel 'ㅣ' can be successfully recognized when our algorithms are used.

Fast Generation of Elliptic Curve Base Points Using Efficient Exponentiation over $GF(p^m)$) (효율적인 $GF(p^m)$ 멱승 연산을 이용한 타원곡선 기저점의 고속 생성)

  • Lee, Mun-Kyu
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.3
    • /
    • pp.93-100
    • /
    • 2007
  • Since Koblitz and Miller suggested the use of elliptic curves in cryptography, there has been an extensive literature on elliptic curve cryptosystem (ECC). The use of ECC is based on the observation that the points on an elliptic curve form an additive group under point addition operation. To realize secure cryptosystems using these groups, it is very important to find an elliptic curve whose group order is divisible by a large prime, and also to find a base point whose order equals this prime. While there have been many dramatic improvements on finding an elliptic curve and computing its group order efficiently, there are not many results on finding an adequate base point for a given curve. In this paper, we propose an efficient method to find a random base point on an elliptic curve defined over $GF(p^m)$. We first show that the critical operation in finding a base point is exponentiation. Then we present efficient algorithms to accelerate exponentiation in $GF(p^m)$. Finally, we implement our algorithms and give experimental results on various practical elliptic curves, which show that the new algorithms make the process of searching for a base point 1.62-6.55 times faster, compared to the searching algorithm based on the binary exponentiation.

System Design and Evaluation of Digital Retrodirective Array Antenna for High Speed Tracking Performance (고속 추적 특성을 위한 디지털 역지향성 배열 안테나 시스템 설계와 특성 평가)

  • Kim, So-Ra;Ryu, Heung-Gyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.8
    • /
    • pp.623-628
    • /
    • 2013
  • The retrodirective array antenna system is operated faster than existing techniques of beamforming due to its less complexity. Therefore, it is effective for beam tracking in the environment of fast vehicle. On the other hand, it also has difficulty in estimating AOA according to multipath environment or multiuser signals. To improve the certainty of estimating AOA), this article proposes hybrid digital retrodirective array antenna systme combined with MUSIC algorithm. In this paper, the digital retrodirective array antenna system is designed according to the number of antenna array by using only one digital PLL which finds angle of delayed phase. And we evaluate the performance of the digital retrodirective array antenna for the high speed tracking application. Performance is studied by simulink when the speed of mobile is 300km/h and the distance between transmitter and receiver is 100m and then we have to confirm the performance of the system in multi path environment. As a result, the mean of AOA (Angle Of Arrival) error is $4.2^{\circ}$ when SNR is 10dB and it is $1.3^{\circ}$ when SNR is 20dB. Consequently, the digital RDA shows very good performance for high speed tracking due to the simple calculation and realization.

Preliminary Study on the Enhancement of Reconstruction Speed for Emission Computed Tomography Using Parallel Processing (병렬 연산을 이용한 방출 단층 영상의 재구성 속도향상 기초연구)

  • Park, Min-Jae;Lee, Jae-Sung;Kim, Soo-Mee;Kang, Ji-Yeon;Lee, Dong-Soo;Park, Kwang-Suk
    • Nuclear Medicine and Molecular Imaging
    • /
    • v.43 no.5
    • /
    • pp.443-450
    • /
    • 2009
  • Purpose: Conventional image reconstruction uses simplified physical models of projection. However, real physics, for example 3D reconstruction, takes too long time to process all the data in clinic and is unable in a common reconstruction machine because of the large memory for complex physical models. We suggest the realistic distributed memory model of fast-reconstruction using parallel processing on personal computers to enable large-scale technologies. Materials and Methods: The preliminary tests for the possibility on virtual manchines and various performance test on commercial super computer, Tachyon were performed. Expectation maximization algorithm with common 2D projection and realistic 3D line of response were tested. Since the process time was getting slower (max 6 times) after a certain iteration, optimization for compiler was performed to maximize the efficiency of parallelization. Results: Parallel processing of a program on multiple computers was available on Linux with MPICH and NFS. We verified that differences between parallel processed image and single processed image at the same iterations were under the significant digits of floating point number, about 6 bit. Double processors showed good efficiency (1.96 times) of parallel computing. Delay phenomenon was solved by vectorization method using SSE. Conclusion: Through the study, realistic parallel computing system in clinic was established to be able to reconstruct by plenty of memory using the realistic physical models which was impossible to simplify.