• Title/Summary/Keyword: Time Invariance

Search Result 71, Processing Time 0.024 seconds

Fractional Fourier Domains and the Shift-Invariance Characteristics of Linear Time-Frequency Distributions (부분 푸리에 영역과 선형 시간-주파수 분포의 옮김 불변 특성)

  • Durak Lutfiye;Kang Hyun Gu;Yoon Seokho;Lee Jumi;Kwon Hyoungmoon;Choi Sang Won;Song Iickho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.11C
    • /
    • pp.1060-1067
    • /
    • 2005
  • In this paper, we generalize the shift-invariance properties of linear time-frequency distributions to the fractional Fourier domains that interpolate between the time and frequency domains. Magnitude-wise shift invariance in arbitrary fractional Fourier domains distinguishes the short-time Fourier transform (STFT) among all linear time-frequency distributions and simplifies the interpretation of the resultant distribution. We prove that the STFT is the only linear distribution that satisfies the magnitude-wise shift-invariance property in the fractional Fourier domains.

Input Constrained Robust Model Predictive Control with Enlarged Stabilizable Region

  • Lee, Young-Il
    • International Journal of Control, Automation, and Systems
    • /
    • v.3 no.3
    • /
    • pp.502-507
    • /
    • 2005
  • The dual-mode strategy has been adopted in many constrained MPC (Model Predictive Control) methods. The size of stabilizable regions of states of MPC methods depends on the size of underlying feasible and positively invariant sets and the number of control moves. The results, however, may perhaps be conservative because the definition of positive invariance does not allow temporal departure of states from the set. In this paper, a concept of periodic invariance is introduced in which states are allowed to leave a set temporarily but return into the set in finite time steps. The periodic invariance can be defined with respect to sets of different state feedback gains. These facts make it possible for the periodically invariant sets to be considerably larger than ordinary invariant sets. The periodic invariance can be defined for systems with polyhedral model uncertainties. We derive a MPC method based on these periodically invariant sets. Some numerical examples are given to show that the use of periodic invariance yields considerably larger stabilizable sets than the case of using ordinary invariance.

Analysis of the effect of climate change on IDF curves using scale-invariance technique: focus on RCP 8.5 (Scale-Invariance 기법을 이용한 IDF 곡선의 기후변화 영향 분석: RCP 8.5를 중심으로)

  • Choi, Jeonghyeon;Lee, Okjeong;Kim, Sangdan
    • Journal of Korea Water Resources Association
    • /
    • v.49 no.12
    • /
    • pp.995-1006
    • /
    • 2016
  • According to 5th IPCC Climate Change Report, there is a very high likelihood that the frequency and intensity of extreme rainfall events will increase. In reality, flood damage has increased, and it is necessary to estimate the future probabilistic design rainfall amount that climate change is reflected. In this study, the future probabilistic design precipitation amount is estimated by analyzing trends of future annual maximum daily rainfall derived by RCP 8.5 scenarios and using the scale-invariance technique. In the first step, after reviewing the time-scale characteristics of annual maximum rainfall amounts for each duration observed from 60 sites operating in Korea Meterological Administration, the feasibility of the scale-invariance technique are examined using annual daily maximum rainfall time series simulated under the present climate condition. Then future probabilistic design rainfall amounts for several durations reflecting the effects of climate change are estimated by applying future annual maximum daily rainfall time series in the IDF curve equation derived by scale-invariance properties. It is shown that the increasing trend on the probabilistic design rainfall amount has resulted on most sites, but the decreasing trend in some regions has been projected.

ON LIGHTLIKE SUBMANIFOLDS OF A GRW SPACE-TIME

  • Kang, Tae Ho
    • Communications of the Korean Mathematical Society
    • /
    • v.29 no.2
    • /
    • pp.295-310
    • /
    • 2014
  • This paper provides a study of lightlike submanifolds of a generalized Robertson-Walker (GRW) space-time. In particular, we investigate lightlike submanifolds with curvature invariance, parallel second fundamental forms, totally umbilical second fundamental forms, null sectional curvatures and null Ricci curvatures, respectively.

The Application of Wavelets to Measured Equation of Invariance

  • Lee, Byunfji;Youngki Cho;Lee, Jaemin
    • Journal of Electrical Engineering and information Science
    • /
    • v.3 no.3
    • /
    • pp.348-354
    • /
    • 1998
  • The measured equation of invariance (MEI) method was introduced as a way to determine the electromagnetic fields scattered from discrete objects. Unlike more traditional numerical methods, MEI method over conventional methods over conventional methods are very substantial. In this work, Haar wavelets are applied to the measured equation of invariance (MEI) to solve two-dimensional scattering problem. We refer to "MEI method with wavelets" as "Wavelet MEI method". The proposed method leads to a significant saving in the CPU time compared to the MEI method that does not use wavelets as metrons. The results presented in this work promise that the Wavelet MEI method can give an accurate result quickly. We believe it is the first time that wavelets have been applied in conjunction with the MEI method to solve this scattering problem.

  • PDF

ON LIGHTLIKE HYPERSURFACES OF A GRW SPACE-TIME

  • Kang, Tae-Ho
    • Bulletin of the Korean Mathematical Society
    • /
    • v.49 no.4
    • /
    • pp.863-874
    • /
    • 2012
  • We provide a study of lightlike hypersurfaces of a generalized Robertson-Walker (GRW) space-time. In particular, we investigate lightlike hypersurfaces with curvature invariance, parallel second fundamental forms, totally umbilical second fundamental forms, null sectional curvatures and null Ricci curvatures, respectively.

Rotationally Invariant Space-Time Trellis Codes with 4-D Rectangular Constellations for High Data Rate Wireless Communications

  • Sterian, Corneliu Eugen D.;Wang, Cheng-Xiang;Johnsen, Ragnar;Patzold, Matthias
    • Journal of Communications and Networks
    • /
    • v.6 no.3
    • /
    • pp.258-268
    • /
    • 2004
  • We demonstrate rotationally invariant space-time (ST) trellis codes with a 4-D rectangular signal constellation for data transmission over fading channels using two transmit antennas. The rotational invariance is a good property to have that may alleviate the task of the carrier phase tracking circuit in the receiver. The transmitted data stream is segmented into eight bit blocks and quadrature amplitude modulated using a 256 point 4-D signal constellation whose 2-D constituent constellation is a 16 point square constellation doubly partitioned. The 4-D signal constellation is simply the Cartesian product of the 2-D signal constellation with it-self and has 32 subsets. The partition is performed on one side into four subsets A, B, C, and D with increased minimum-squared Euclidian distance, and on the other side into four rings, where each ring includes four points of equal energy. We propose both linear and nonlinear ST trellis codes and perform simulations using an appropriate multiple-input multiple-output (MIMO) channel model. The 4-D ST codes constructed here demonstrate about the same frame error rate (FER) performance as their 2-D counterparts, having however the added value of rotational invariance.

Pruning and Matching Scheme for Rotation Invariant Leaf Image Retrieval

  • Tak, Yoon-Sik;Hwang, Een-Jun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.2 no.6
    • /
    • pp.280-298
    • /
    • 2008
  • For efficient content-based image retrieval, diverse visual features such as color, texture, and shape have been widely used. In the case of leaf images, further improvement can be achieved based on the following observations. Most plants have unique shape of leaves that consist of one or more blades. Hence, blade-based matching can be more efficient than whole shape-based matching since the number and shape of blades are very effective to filtering out dissimilar leaves. Guaranteeing rotational invariance is critical for matching accuracy. In this paper, we propose a new shape representation, indexing and matching scheme for leaf image retrieval. For leaf shape representation, we generated a distance curve that is a sequence of distances between the leaf’s center and all the contour points. For matching, we developed a blade-based matching algorithm called rotation invariant - partial dynamic time warping (RI-PDTW). To speed up the matching, we suggest two additional techniques: i) priority queue-based pruning of unnecessary blade sequences for rotational invariance, and ii) lower bound-based pruning of unnecessary partial dynamic time warping (PDTW) calculations. We implemented a prototype system on the GEMINI framework [1][2]. Using experimental results, we showed that our scheme achieves excellent performance compared to competitive schemes.

Nonstationary Time Series and Missing Data

  • Shin, Dong-Wan;Lee, Oe-Sook
    • The Korean Journal of Applied Statistics
    • /
    • v.23 no.1
    • /
    • pp.73-79
    • /
    • 2010
  • Missing values for unit root processes are imputed by the most recent observations. Treating the imputed observations as if they are complete ones, semiparametric unit root tests are extended to missing value situations. Also, an invariance principle for the partial sum process of the imputed observations is established under some mild conditions, which shows that the extended tests have the same limiting null distributions as those based on complete observations. The proposed tests are illustrated by analyzing an unequally spaced real data set.

Binary clustering network for recognition of keywords in continuous speech (연속음성중 키워드(Keyword) 인식을 위한 Binary Clustering Network)

  • 최관선;한민홍
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1993.10a
    • /
    • pp.870-876
    • /
    • 1993
  • This paper presents a binary clustering network (BCN) and a heuristic algorithm to detect pitch for recognition of keywords in continuous speech. In order to classify nonlinear patterns, BCN separates patterns into binary clusters hierarchically and links same patterns at root level by using the supervised learning and the unsupervised learning. BCN has many desirable properties such as flexibility of dynamic structure, high classification accuracy, short learning time, and short recall time. Pitch Detection algorithm is a heuristic model that can solve the difficulties such as scaling invariance, time warping, time-shift invariance, and redundance. This recognition algorithm has shown recognition rates as high as 95% for speaker-dependent as well as multispeaker-dependent tests.

  • PDF