• Title/Summary/Keyword: Linear complexity

Search Result 685, Processing Time 0.026 seconds

Maximum Sugar Loss Lot First Production Algorithm for Cane Sugar Production Problem (사탕수수 설탕 생산 문제의 최대 당분 손실 로트 우선 생산 알고리즘)

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.12
    • /
    • pp.171-175
    • /
    • 2014
  • Gu$\acute{e}$ret et al. tries to obtain the solution using linear programming with $O(m^4)$ time complexity for cane sugar production problem a kind of bin packing problem that is classified as NP-complete problem. On the other hand, this paper suggests the maximum loss of lot first production greedy rule algorithm with O(mlogm) polynomial time complexity underlying assumption of the polynomial time rule to find the solution is exist. The proposed algorithm sorts the lots of sugar loss slope into descending order. Then, we select the lots for each slot production capacity only, and swap the exhausted life span of lots for lastly selected lots. As a result of experiments, this algorithm reduces the $O(m^4)$ of linear programming to O(mlogm) time complexity. Also, this algorithm better result than linear programming.

A Low-Complexity Processor for Joint Vignetting and Barrel distortion Correction for Wide-Angle Cameras (광각 카메라를 위한 저 복잡도 비네팅 및 배럴 왜곡 보정 프로세서)

  • Moon, Sun-A;Hong, Jin-U;Kim, Won-Tae;Kim, Tae-Hwan
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.9
    • /
    • pp.36-44
    • /
    • 2015
  • This paper proposes a low-complexity processor to correct vignetting and barrel distortion for wide-angle cameras. The proposed processor calculates the required correcting factors by employing the piecewise linear approximation so that the hardware complexity can be reduced significantly while maintaining correction quality. In addition, the processor is designed to correct the two distortions concurrently in a singular pipeline, which reduces the overall complexity. The proposed processor is implemented with 18.6K logic gates in a $0.11{\mu}m$ CMOS process and shows the maximum correction speed of 200Mpixels/s for correcting an image of which size is $2048{\times}2048$.

An Image Interpolation Method using an Improved Least Square Estimation (개선된 Least Square Estimation을 이용한 영상 보간 방법)

  • Lee Dong Ho;Na Seung Je
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.10C
    • /
    • pp.1425-1432
    • /
    • 2004
  • Because of the high performance with the edge regions, the existing LSE(Least Square Estimation) method provides much better results than other methods. However, since it emphasizes not oがy edge components but also noise components, some part of interpolated images looks like unnatural. It also requires very high computational complexity and memory for implementation. We propose a new LSE interpolation method which requires much lower complexity and memory, but provides better performance than the existing method. To reduce the computational complexity, we propose and adopt a simple sample window and a direction detector to reduce the size of memory without blurring image. To prevent from emphasizing noise components, the hi-linear interpolation method is added in the LSE formula. The simulation results show that the proposed method provides better subjective and objective performance with love. complexity than the existing method.

A study on the nonlinearity in bio-logical systems using approximate entropy and correlation dimension (근사엔트로피와 상관차원을 이용한 비선형 신호의 분석)

  • Lee, Hae-Jin;Choi, Won-Young;Cha, Kyung-Joon;Park, Moon-Il;Oh, Jae-Eung
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2007.11a
    • /
    • pp.760-763
    • /
    • 2007
  • We studied how linear and nonlinear heart rate dynamics differ between normal fetuses and uncomplicated small-forgestational age (SGA) fetuses, aged 32-40 weeks' gestation. We analyzed each fetal heart rate time series for 20 min and quantified the complexity (nonlinear dynamics) of each fetal heart rate (FHR) time series by approximate entropy (ApEn) and correlation dimension (CD). The linear dynamics were analyzed by canonical correlation analysis (CCA). The ApEn and CD of the uncomplicated SGA fetuses were significantly lower than that of the normal fetuses in all three gestational periods (32-34, 35-37, 38-40 weeks). Canonical correlation ensemble in SGA fetuses is slightly higher than normal ones in all three gestational periods, especially at 35-37 weeks. Irregularity and complexity of the heart rate dynamics of SGA fetuses are lower than that of normal ones. Also, canonical ensemble in SGA fetuses is higher than in normal ones, suggesting that the FHR control system has multiple complex interactions. Along with the clear difference between the two groups' non-linear chaotic dynamics in FHR patterns, we clarified the hidden subtle differences in linearity (e.g. canonical ensemble). The decrease in non-linear dynamics may contribute to the increase in linear dynamics. The present statistical methodology can be readily and routinely utilized in Obstetrics and Gynecologic fields.

  • PDF

LP-Based SNR Estimation with Low Computation Complexity (낮은 계산 복잡도를 갖는 Linear Prediction 기반의 SNR 추정 기법)

  • Kim, Seon-Ae;Jo, Byung-Gak;Baek, Gwang-Hoon;Ryu, Heung-Gyoon
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.20 no.12
    • /
    • pp.1287-1296
    • /
    • 2009
  • It is very important to estimate the Signal to Noise Ratio(SNR) of received signal in time varying channel state. Most SNR estimation techniques derive the SNR estimates solely from the samples of the received signal after the matched filter. In the severe distorted wireless channel, the performance of these estimators become unstable and degraded. LP-based SNR estimator which can operate on data samples collected at the front-end of a receiver shows more stable performance than other SNR estimator. In this paper, we study an efficient SNR estimation algorithm based on LP and propose a new estimation method to decrease the computation complexity. Proposed algorithm accomplishes the SNR estimation process efficiently because it uses the forward prediction error and its conjugate value during the linear prediction error update. Via the computer simulation, the performance of this proposed estimation method is compared and discussed with other conventional SNR estimators in digital communication channels.

Nonlinear impact of temperature change on electricity demand: estimation and prediction using partial linear model (기온변화가 전력수요에 미치는 비선형적 영향: 부분선형모형을 이용한 추정과 예측)

  • Park, Jiwon;Seo, Byeongseon
    • The Korean Journal of Applied Statistics
    • /
    • v.32 no.5
    • /
    • pp.703-720
    • /
    • 2019
  • The influence of temperature on electricity demand is increasing due to extreme weather and climate change, and the climate impacts involves nonlinearity, asymmetry and complexity. Considering changes in government energy policy and the development of the fourth industrial revolution, it is important to assess the climate effect more accurately for stable management of electricity supply and demand. This study aims to analyze the effect of temperature change on electricity demand using the partial linear model. The main results obtained using the time-unit high frequency data for meteorological variables and electricity consumption are as follows. Estimation results show that the relationship between temperature change and electricity demand involves complexity, nonlinearity and asymmetry, which reflects the nonlinear effect of extreme weather. The prediction accuracy of in-sample and out-of-sample electricity forecasting using the partial linear model evidences better predictive accuracy than the conventional model based on the heating and cooling degree days. Diebold-Mariano test confirms significance of the predictive accuracy of the partial linear model.

Linear Feature Simplification Using Wavelets in GIS

  • Liang, Chen;Lee, Chung-Ho;Kim, Jae-Hong;Bae, Hae-Young
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2001.04b
    • /
    • pp.151-153
    • /
    • 2001
  • Feature Simplification is an essential method for multiple representations of spatial features in GIS. However, spatial features re various, complex and a alrge size. Among spatial features which describe spatial information. linear feature is the msot common. Therefore, an efficient linear feature simplification method is most critical for spatial feature simplification in GIS. This paper propose an original method, by which the problem of linear feature simplification is mapped into the signal processing field. This method avoids conventional geometric computing in existing methods and exploits the advantageous properties of wavelet transform. Experimental results are presented to show that the proposed method outperforms the existing methods and achieves the time complexity of O(n), where n is the number of points of a linear feature. Furthermore, this method is not bound to two-dimension but can be extended to high-dimension space.

  • PDF

High Resolution Linear Graphs : Graphical Aids for Designing Off-Line Process Control)

  • Lee, Sang-Heon
    • Journal of the military operations research society of Korea
    • /
    • v.27 no.1
    • /
    • pp.73-88
    • /
    • 2001
  • Designing high quality products and processes at a low cost is central technological and economic challenge to the engineer. The combination of engineering concepts and statistical implementations offered by Taguchi\`s off-line design technique has proven t be invaluable. By examining some deficiencies in designs from the Taguchi\`s highly fractional, orthogonal main effect plan based on orthogonal arrays, alternative method is proposed. The maximum resolution or the minimum aberration criterion is commonly used for selecting 2$^{n-m}$ fractional designs. We present new high resolution (low aberration) linear graphs to simplify the complexity of selecting designs with desirable statistical properties. The new linear graphs approach shows a substantial improvement over Taguchi\`s linear graphs and other related graphical methods for planning experiment. The new set of linear graphs will allow the experimenter to maintain the simple approach suggested by Taguchi while obtaining the best statistical properties of the resulting design such as minimum aberration as a by-product without dependency on complicated computational algorithm or additional statistical training.g.

  • PDF

A Polynomial-Time Algorithm for Breaking the McEliece's Public-Key Cryptosystem (McEliece 공개키 암호체계의 암호해독을 위한 Polynomial-Time 알고리즘)

  • Park, Chang-Seop-
    • Proceedings of the Korea Institutes of Information Security and Cryptology Conference
    • /
    • 1991.11a
    • /
    • pp.40-48
    • /
    • 1991
  • McEliece 공개키 암호체계에 대한 새로운 암호해독적 공격이 제시되어진다. 기존의 암호해독 algorithm이 exponential-time의 complexity를 가지는 반면, 본고에서 제시되어지는 algorithm은 polynomial-time의 complexity를 가진다. 모든 linear codes에는 systematic generator matrix가 존재한다는 사실이 본 연구의 동기가 된다. Public generator matrix로부터, 암호해독에 사용되어질 수 있는 새로운 trapdoor generator matrix가 Gauss-Jordan Elimination의 역할을 하는 일련의 transformation matrix multiplication을 통해 도출되어진다. 제시되어지는 algorithm의 계산상의 complexity는 주로 systematic trapdoor generator matrix를 도출하기 위해 사용되는 binary matrix multiplication에 기인한다. Systematic generator matrix로부터 쉽게 도출되어지는 parity-check matrix를 통해서 인위적 오류의 수정을 위한 Decoding이 이루어진다.

  • PDF

A Practical Implementation of the LTJ Adaptive Filter and Its Application to the Adaptive Echo Canceller (LTJ 적응필터의 실용적 구현과 적응반향제거기에 대한 적용)

  • Yoo, Jae-Ha
    • Speech Sciences
    • /
    • v.11 no.2
    • /
    • pp.227-235
    • /
    • 2004
  • In this paper, we proposed a new practical implementation method of the lattice transversal joint (LTJ) adaptive filter using speech codec's information. And it was applied to the adaptive echo cancellation problem to verify the efficiency of the proposed method. Realtime implementation of the LTJ adaptive filter is very difficult due to high computational complexity for the filter coefficients compensation. However, in case of using speech codec, complexity can be reduced since linear predictive coding (LPC) coefficients are updated each frame or sub-frame instead of every sample. Furthermore, LPC coefficients can be acquired from speech decoder and transformed to the reflection coefficients. Therefore, the computational complexity for updates of the reflection coefficients can be reduced. The effectiveness of the proposed LTJ adaptive filter was verified by the experiments about convergence and tracking performance of the adaptive echo canceller.

  • PDF