• 제목/요약/키워드: Ratio algorithm

검색결과 3,123건 처리시간 0.031초

An Improved Voice Activity Detection Algorithm Employing Speech Enhancement Preprocessing

  • Lee, Yoon-Chang;Ahn, Sang-Sik
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2000년도 ITC-CSCC -2
    • /
    • pp.865-868
    • /
    • 2000
  • In this paper we derive a new VAD algorithm, which combines the preprocessing algorithm and the optimum decision rule. To improve the performance of the VAD algorithm we employ the speech enhancement algorithm and then apply the maximal ratio combining technique in the preprocessing procedure, which leads to maximized output SNR. Moreover, we also perform extensive computer simulations to demonstrate the performance improvement of the proposed algorithm under various background noise environments.

  • PDF

최소 개수의 스타이너 포인트를 위한 근사 비율 2 (Approximation ratio 2 for the Minimum Number of Steiner Points)

  • 김준모;김인범
    • 한국정보과학회논문지:시스템및이론
    • /
    • 제30권7_8호
    • /
    • pp.387-396
    • /
    • 2003
  • 본 논문은 STP-MSP을 위한 근사 알고리즘을 제안한다. 이 문제에 대해 근접한 최적 해법을 제공하는 PTAS를 가지는 것이 불가능하기 때문에, 본 논문의 연구는 $n^{O(1)}$의 실행 시간과 근사 비율 2를 가지는 하나의 대안을 제시한다. 본 연구의 중요성은 관련된 다른 미해결문제에 대하여 해결 가능성을 제시하는 것이다. 본 논문의 주요 제안내용은 문제 인스턴스에게 허용오차를 배분하는 것이다. 이로 인해 우리는 무한적 경우에서 다항적 범위로 실행시간을 줄일 수 있다. 관련연구[1,2]가 근사 비율이 2보다 크지만 보다 현실적인 실행시간을 갖는 근사 알고리즘들을 제시한 것이라면, 본 연구는 근사 비율이 2인 근사 알고리즘의 존재를 밝힌 것이다.

신호 대 마스킹 비 개선을 통한 다채널 보청 알고리즘 (A Novel Multi-Channel Hearing Aid Algorithm with SMR(signal-to-masking ratio) Improvement)

  • 김헌중;홍민철;차형태
    • 한국음향학회지
    • /
    • 제19권8호
    • /
    • pp.12-21
    • /
    • 2000
  • 본 논문에서는 심리음향 (psychoacoustics)을 이용한 다채널 동적 음향 압축 알고리즘을 통해 감음신경성 난청 (sensorinural hearing loss)을 보정하여 정상적인 지각 환경을 제공하는 알고리즘을 제안한다. 제안된 알고리즘은 라우드니스 조정 함수 (loudness scaling function)를 통해 난청자에게 적합한 라우드니스 레벨을 보상 시켜 주고, 난청자가 인식하게 되는 신호에 대한 마스킹 특성을 해석하여, 지각 영역 (perceptual domain)에서 각각의 주파수 성분에 대한 음압 레벨과 마스킹 임계치 (masking threshold) 사이의 거리로 정의되어지는 SMR(signal-to-masking ratio)을 통해 주파수 대비 (spectral contrast)를 복원 시켜 줌으로써 정상적인 지각 환경을 제공하는 것이다.

  • PDF

Virtual Network Embedding based on Node Connectivity Awareness and Path Integration Evaluation

  • Zhao, Zhiyuan;Meng, Xiangru;Su, Yuze;Li, Zhentao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권7호
    • /
    • pp.3393-3412
    • /
    • 2017
  • As a main challenge in network virtualization, virtual network embedding problem is increasingly important and heuristic algorithms are of great interest. Aiming at the problems of poor correlation in node embedding and link embedding, long distance between adjacent virtual nodes and imbalance resource consumption of network components during embedding, we herein propose a two-stage virtual network embedding algorithm NA-PVNM. In node embedding stage, resource requirement and breadth first search algorithm are introduced to sort virtual nodes, and a node fitness function is developed to find the best substrate node. In link embedding stage, a path fitness function is developed to find the best path in which available bandwidth, CPU and path length are considered. Simulation results showed that the proposed algorithm could shorten link embedding distance, increase the acceptance ratio and revenue to cost ratio compared to previously reported algorithms. We also analyzed the impact of position constraint and substrate network attribute on algorithm performance, as well as the utilization of the substrate network resources during embedding via simulation. The results showed that, under the constraint of substrate resource distribution and virtual network requests, the critical factor of improving success ratio is to reduce resource consumption during embedding.

Novel Schemes to Optimize Sampling Rate for Compressed Sensing

  • Zhang, Yifan;Fu, Xuan;Zhang, Qixun;Feng, Zhiyong;Liu, Xiaomin
    • Journal of Communications and Networks
    • /
    • 제17권5호
    • /
    • pp.517-524
    • /
    • 2015
  • The fast and accurate spectrum sensing over an ultra-wide bandwidth is a big challenge for the radio environment cognition. Considering sparse signal feature, two novel compressed sensing schemes are proposed, which can reduce compressed sampling rate in contrast to the traditional scheme. One algorithm is dynamically adjusting compression ratio based on modulation recognition and identification of symbol rate, which can reduce compression ratio. Furthermore, without priori information of the modulation and symbol rate, another improved algorithm is proposed with the application potential in practice, which does not need to reconstruct the signals. The improved algorithm is divided into two stages, which are the approaching stage and the monitoring stage. The overall sampling rate can be dramatically reduced without the performance deterioration of the spectrum detection compared to the conventional static compressed sampling rate algorithm. Numerous results show that the proposed compressed sensing technique can reduce sampling rate by 35%, with an acceptable detection probability over 0.9.

임베디드 시스템에서 사용 가능한 적응형 MFCC 와 Deep Learning 기반의 음성인식 (Voice Recognition-Based on Adaptive MFCC and Deep Learning for Embedded Systems)

  • 배현수;이호진;이석규
    • 제어로봇시스템학회논문지
    • /
    • 제22권10호
    • /
    • pp.797-802
    • /
    • 2016
  • This paper proposes a noble voice recognition method based on an adaptive MFCC and deep learning for embedded systems. To enhance the recognition ratio of the proposed voice recognizer, ambient noise mixed into the voice signal has to be eliminated. However, noise filtering processes, which may damage voice data, diminishes the recognition ratio. In this paper, a filter has been designed for the frequency range within a voice signal, and imposed weights are used to reduce data deterioration. In addition, a deep learning algorithm, which does not require a database in the recognition algorithm, has been adapted for embedded systems, which inherently require small amounts of memory. The experimental results suggest that the proposed deep learning algorithm and HMM voice recognizer, utilizing the proposed adaptive MFCC algorithm, perform better than conventional MFCC algorithms in its recognition ratio within a noisy environment.

쇄교자속비를 이용한 변압기 보호 알고리즘 (A Transformer protective Relaying Algorithm Based on Increment of Flux Linkages)

  • 강용철;이병은;김은숙;원성호;임의재
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2003년도 하계학술대회 논문집 A
    • /
    • pp.53-55
    • /
    • 2003
  • This paper propose a transformer protective relaying algorithm based on the increment of flux linkages (RIFL) of the Primary and secondary windings. The RIFL is equal to the turn ratio for all operating conditions except an internal faults. For a single-phase transformer and three-phase Y-Y transformer, the increments of flux linkages are calculated and their ratios are compared with the turn ratio. For a three-phase Y-$\triangle$ transformer, the difference of the increments of flux linkages are calculated to use the line currents instead of the delta winding currents, which are practically unavailable. Their ratios are compared with the turn ratio. The results of various tests show that the algorithm successfully discriminates internal faults from normal operation conditions such as magnetic inrush and overexcitation. The algorithm can not only detect internal winding faults, but reduce the relay's operating time.

  • PDF

A Pattern Matching Extended Compression Algorithm for DNA Sequences

  • Murugan., A;Punitha., K
    • International Journal of Computer Science & Network Security
    • /
    • 제21권8호
    • /
    • pp.196-202
    • /
    • 2021
  • DNA sequencing provides fundamental data in genomics, bioinformatics, biology and many other research areas. With the emergent evolution in DNA sequencing technology, a massive amount of genomic data is produced every day, mainly DNA sequences, craving for more storage and bandwidth. Unfortunately, managing, analyzing and specifically storing these large amounts of data become a major scientific challenge for bioinformatics. Those large volumes of data also require a fast transmission, effective storage, superior functionality and provision of quick access to any record. Data storage costs have a considerable proportion of total cost in the formation and analysis of DNA sequences. In particular, there is a need of highly control of disk storage capacity of DNA sequences but the standard compression techniques unsuccessful to compress these sequences. Several specialized techniques were introduced for this purpose. Therefore, to overcome all these above challenges, lossless compression techniques have become necessary. In this paper, it is described a new DNA compression mechanism of pattern matching extended Compression algorithm that read the input sequence as segments and find the matching pattern and store it in a permanent or temporary table based on number of bases. The remaining unmatched sequence is been converted into the binary form and then it is been grouped into binary bits i.e. of seven bits and gain these bits are been converted into an ASCII form. Finally, the proposed algorithm dynamically calculates the compression ratio. Thus the results show that pattern matching extended Compression algorithm outperforms cutting-edge compressors and proves its efficiency in terms of compression ratio regardless of the file size of the data.

연속적인 최대-최소 연결비율 문제: 회선망에서의 공정성 및 효율성을 보장하는 경로설정 (Successive Max-min Connection-Ratio Preoblem:Routing with Fairness and Efficiency in Circuit Telecommunication Networks)

  • 박구현;우재현
    • 한국경영과학회지
    • /
    • 제22권2호
    • /
    • pp.13-29
    • /
    • 1997
  • This paper considers a new routing problem, successive max-min connection ratio problem (SMCRP), arised in circuit telecommunication networks such as SONET and WDM optical transport network. An optimization model for SMCRP is established based on link-flow formulation. It's first optimization process is an integral version of maximum concurrent flow problem. Integer condition does not give the same connection-ratio of each node-pair at an optimal solution any more. It is also an integral multi-commodity flow problem with fairness restriction. In order to guarantee fairness to every node-pair the minimum of connection ratios to demand is maximized. NP- hardness of SMCRP is proved and a heuristic algorithm with polynomial-time bound is developed for the problem. Augmenting path and rerouting flow are used for the algorithm. The heuristic algorithm is implemented and tested for networks of different sizes. The results are compared with those given by GAMS/OSL, a popular commercial solver for integer programming problem.n among ferrite-pearlite matrix, the increase in spheroidal ratio with increasing fatigue limitation, 90% had the highest, 14.3% increasing more then 70%, distribution range of fatigue.ife was small in same stress level. (2) $\sqrt{area}_{max}$ of graphite can be used to predict fatigue limit of Ductile Cast Iron. The Statistical distribution of extreme values of $\sqrt{area}_{max}$ may be used as a guideline for the control of inclusion size in the steelmaking.

  • PDF

부하를 고려한 DC-DC 컨버터의 듀티비에 따른 태양광 발전 시스템의 최대전력점 추적 (MPPT of photovoltaic system with duty ratio of DC-DC converter considered load)

  • 전영선;고재섭;최정식;정철호;김도연;정병진;정동화
    • 한국조명전기설비학회:학술대회논문집
    • /
    • 한국조명전기설비학회 2008년도 춘계학술대회 논문집
    • /
    • pp.407-410
    • /
    • 2008
  • This paper presents a maximum power point tracking(MPPT) of photovoltaic system with duty ratio of DC-DC converter considered load. A variation of solar irradiation is most important factor in the MPPT of PV system That is nonlinear, aperiodic and complicated. NN was widely used due to easily solving a complex math problem. The paper consists of solar radiation source, DC-DC converter, DC motor and load(cf, pump). NN algorithm apply to DC-DC converter through an adaptive control of neural network, calculates converter-duty ratio using an adaptive control of NN. The results of an adaptive control of NN compared with the results of converter-duty ratio which are calculated mathematical modeling and evaluate the proposed algorithm. The experimental data show that an adequacy of the algorithm was established through the compared data.

  • PDF