• Title/Summary/Keyword: 중첩 윈도우

Search Result 20, Processing Time 0.023 seconds

An Efficient Join Algorithm for Data Streams with Overlapping Window (중첩 윈도우를 가진 데이터 스트링을 위한 효율적인 조인 알고리즘)

  • Kim, Hyeon-Gyu;Kang, Woo-Lam;Kim, Myoung-Ho
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.5
    • /
    • pp.365-369
    • /
    • 2009
  • Overlapping windows are generally used for queries to process continuous data streams. Nevertheless, existing approaches discussed join algorithms only for basic types of windows such as tumbling windows and tuple-driven windows. In this paper, we propose an efficient join algorithm for overlapping windows, which are considered as a more general type of windows. The proposed algorithm is based on an incremental window join. It focuses on producing join results continuously when the memory overflow frequently occurs. It consists of (1) a method to use both of the incremental and full joins selectively, (2) a victim selection algorithm to minimize latency of join processing and (3) an idle time professing algorithm. We show through our experiments that the selective use of incremental and full joins provides better performance than using one of them only.

Low delay window switching modified discrete cosine transform for speech and audio coder (음성 및 오디오 부호화기를 위한 저지연 윈도우 스위칭 modified discrete cosine transform)

  • Kim, Young-Joon;Lee, In-Sung
    • The Journal of the Acoustical Society of Korea
    • /
    • v.37 no.2
    • /
    • pp.110-117
    • /
    • 2018
  • In this paper, we propose a low delay window switching MDCT (Modified Discrete Cosine Transform) method for speech/audio coder. The window switching algorithm is used to reduce the degradation of sound quality in non-stationary trasient duration and to reduce the algorithm delay by using the low delay TDAC (Time Domain Aliasing Cancellation). While the conventional window switching algorithms uses overlap-add with different lengths, the proposed method uses the fixed overlap add length. It results the reduction of algorithm delay by half and 1 bit reduction in frame indication information by using 2 window types. We apply the proposed algorithm to G.729.1 based on MDCT in order to evaluate the performance. The propose method shows the reduction of algorithm delay by half while speech quality of the proposed method maintains same as the conventional method.

Unified Speech and Audio Coding Technology (통합 음성 오디오 부호화 기술)

  • Lee, Taejin;Beack, Seungkwon;Kang, Kyeongok;Kim, Whan-Woo
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2011.07a
    • /
    • pp.264-267
    • /
    • 2011
  • 다양한 기능을 가지는 모바일 기기들이 하나로 융합되어 가는 방향으로 기술이 발전함에 따라, 음성 및 오디오 모두에 대해 우수한 음질을 제공하는 부호화 기술에 대한 요구사항이 증대되고 있다. MPEG 에서는 2008 년 10 월부터 MPEG-D USAC 기술에 대해 CfP 를 시작으로 본격적으로 표준화를 진행하고 있으며, 2011 년 3 월 96 차 미팅에서 Study on DIS 까지 승인하였다. 본 논문에서는 LPD 모드의 TCX 윈도우의 변경을 통한 USAC 성능향상 방법은 제안한다. TCX 프레임의 연결에 고정된 크기의 중첩만을 이용하는 현재의 방식과는 달리, 이전 TCX 모드와 다음 TCX 모드, transient 의 존재 유무에 따라 적절하게 TCX 윈도우 중첩크기를 조절하여 음악 특성 신호에 대해 LPD 모드의 음질을 개선할 수 있다.

  • PDF

GAGPC : An Algorithm to Optimize Multiple Continuous Queries on Data Streams (GAGPC : 데이타 스트림에 대한 다중 연속 질의의 최적화 알고리즘)

  • Suh Young-Kyoon;Son Jin-Hyun;Kim Myoung-Ho
    • Journal of KIISE:Databases
    • /
    • v.33 no.4
    • /
    • pp.409-422
    • /
    • 2006
  • In general, there can be many reusable intermediate results due to the overlapped windows and periodic execution intervals among Multiple Continuous Queries (MCQ) on data streams. In this regard, we propose an efficient greedy algorithm for a global query plan construction, called GAGPC. GAGPC first decides an execution cycle and finds the maximal Set(s) of Related execution Points (SRP). Next, GAGPC constructs a global execution plan to make MCQ share common join-fragments with the highest benefit in each SRP. The algorithm suggests that the best plan of the same continuous queries may be different according to not only the existence of common expressions, but the size of overlapped windows related to them. It also reflects to reuse not only the whole but partial intermediate results unlike previous work. Finally, we show experimental results for the validation of GAGPC.

AbS/OLA Sinusoidal Modeling of Speech Signal Using Wavelet Transform (웨이블릿 변환을 이용한 음성신호의 AbS/OLA 정현파 모델링)

  • Kim Ki-Hong;Hong Jin-Keun;Jung Yong-Ik;Lee Sang-Yi
    • Proceedings of the KAIS Fall Conference
    • /
    • 2004.11a
    • /
    • pp.114-117
    • /
    • 2004
  • 본 논문에서는 합성에 의한 분석(Analysis-by-Synthesis) 및 가산중첩(Overlap-Add) 방식을 채택하고 있는 음성신호의 AbS/OLA 정현파 모델에 웨이블릿 변환을 적용한 새로운 모델을 제안하였다. 즉, 기존의 모델에 웨이블릿 변환을 적용하여 입력신호를 몇 개의 부대역 신호로 나눈 다음 각각 다른 길이의 분석 윈도우를 적용한다. 이는 기존 모델의 정현파 파라미터 추출 시 고정된 길이의 분석 윈도우를 이용하는 단점을 극복하여 좀 더 정확한 파라미터 추출을 가능하게 한다. 시험결과 제안된 정현파 모델이 기존 모델에 비해 합성음의 스펙트럼 및 위상 특성, 음질 등에서 성능이 개선됨을 확인할 수 있었다.

  • PDF

Processing Sliding Window Multi-Joins using a Graph-Based Method over Data Streams (데이터 스트림에서 그래프 기반 기법을 이용한 슬라이딩 윈도우 다중 조인 처리)

  • Zhang, Liang;Ge, Jun-Wei;Kim, Gyoung-Bae;Lee, Soon-Jo;Bae, Hae-Young;You, Byeong-Seob
    • Journal of Korea Spatial Information System Society
    • /
    • v.9 no.2
    • /
    • pp.25-34
    • /
    • 2007
  • Existing approaches that select an order for the join of three or more data streams have always used the simple heuristics. For their disadvantage - only one factor is considered and that is join selectivity or arrival rate, these methods lead to poor performance and inefficiency In some applications. The graph-based sliding window multi -join algorithm with optimal join sequence is proposed in this paper. In this method, sliding window join graph is set up primarily, in which a vertex represents a join operator and an edge indicates the join relationship among sliding windows, also the vertex weight and the edge weight represent the cost of join and the reciprocity of join operators respectively. Then the optimal join order can be found in the graph by using improved MVP algorithm. The final result can be produced by executing the join plan with the nested loop join procedure, The advantages of our algorithm are proved by the performance comparison with existing join algorithms.

  • PDF

An Experimental Study on AutoEncoder to Detect Botnet Traffic Using NetFlow-Timewindow Scheme: Revisited (넷플로우-타임윈도우 기반 봇넷 검출을 위한 오토엔코더 실험적 재고찰)

  • Koohong Kang
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.33 no.4
    • /
    • pp.687-697
    • /
    • 2023
  • Botnets, whose attack patterns are becoming more sophisticated and diverse, are recognized as one of the most serious cybersecurity threats today. This paper revisits the experimental results of botnet detection using autoencoder, a semi-supervised deep learning model, for UGR and CTU-13 data sets. To prepare the input vectors of autoencoder, we create data points by grouping the NetFlow records into sliding windows based on source IP address and aggregating them to form features. In particular, we discover a simple power-law; that is the number of data points that have some flow-degree is proportional to the number of NetFlow records aggregated in them. Moreover, we show that our power-law fits the real data very well resulting in correlation coefficients of 97% or higher. We also show that this power-law has an impact on the learning of autoencoder and, as a result, influences the performance of botnet detection. Furthermore, we evaluate the performance of autoencoder using the area under the Receiver Operating Characteristic (ROC) curve.

Design and Implementation of Virtual Network Search System for Segmentation of Unconstrained Handwritten Hangul (무제약 필기체 한글 분할을 위한 가상 네트워크 탐색 시스템의 설계 및 구현)

  • Park Sung-Ho
    • Journal of Korea Multimedia Society
    • /
    • v.8 no.5
    • /
    • pp.651-659
    • /
    • 2005
  • For segmentation of constrained and handwritten Hangul, a new method, which has been not introduced, was proposed and implemented to use virtual network search system in the space between characters. The proposed system was designed to be used in all cases in unconstrained handwritten Hangul by various writers and to make a number of curved segmentation path using a virtual network to the space between characters. The proposed system prevented Process from generating a path in a wrong position by changing search window upon target block within a search process. From the experimental results, the proposed virtual network search system showed segmentation accuracy of $91.4\%$ from 800 word set including touched and overlapped characters collected from various writers.

  • PDF

Wavelet-based Pitch Detector for 2.4 kbps Harmonic-CELP Coder (2.4 kbps 하모닉-CELP 코더를 위한 웨이블렛 피치 검출기)

  • 방상운;이인성;권오주
    • The Journal of the Acoustical Society of Korea
    • /
    • v.22 no.8
    • /
    • pp.717-726
    • /
    • 2003
  • This paper presents the methods that design the Wavelet-based pitch detector for 2,4 kbps Harmonic-CELP Coder, and that achieve the effective waveform interpolation by decision window shape of the transition region, Waveform interpolation coder operates by encoding one pitch-period-sized segment, a prototype segment, of speech for each frame, generate the smooth waveform interpolation between the prototype segments for voiced frame, But, harmonic synthesis of the prototype waveforms between previous frame and current frame occur not only waveform errors but also discontinuity at frame boundary on that case of pitch halving or doubling, In addtion, in transition region since waveform interpolation coder synthesizes the excitation waveform by using overlap-add with triangularity window, therefore, Harmonic-CELP fail to model the instantaneous increasing speech and synthesis waveform linearly increases, First of all, in order to detect the precise pitch period, we use the hybrid 1st pitch detector, and increse the precision by using 2nd ACF-pitch detector, Next, in order to modify excitation window, we detect the onset, offset of frame by GCI, As the result, pitch doubling is removed and pitch error rate is decreased 5.4% in comparison with ACF, and is decreased 2,66% in comparison with wavelet detector, MOS test improve 0.13 at transition region.

ELF Electric Field Calculation of High Speed Railway Using Boundary Element Method (경계분할법을 이용한 고속철도 주변의 극저주파 전계 예측계산)

  • Myung, Sung-Ho;Lee, Jae-Bok;Kim, Jeom-Sik;Kim, Eung-Sik;Lee, Jong-Woo
    • Proceedings of the KIEE Conference
    • /
    • 2001.11a
    • /
    • pp.29-31
    • /
    • 2001
  • 본 논문에서는 고속철도 주변의 상용주파수(60 Hz) 대역의 전계 해석에 촛점을 두고 경계분할법의 일종인 전하중첩법과 표면전하법을 사용하여 선로주변의 전계 계산을 수행하였다. 계산 결과 지상 1m 열차 플랫폼 주변에서의 전계값은 0.5kV/m 이하로써 국제비전리방사보호위원회 (ICNIRP)의 권고 기준인 4.167kV/m를 충분히 만족함을 알 수 있었으며 사용자 편의를 위해 전계 해석용 프로그램을 윈도우 환경하에서 MFC를 이용하여 개발하였다.

  • PDF