• 대한수학회보
• /
• 제29권1호
• /
• pp.89-99
• /
• 1992

In this paper we will prove some theorems on the period and the linear complexity of certain sequences in GF(q) which are generated by combining two sequences in a reasonable way. In fact these theorems are generalizations of the main result in [1]. A sequence of elements of GF(2) is called a binary sequence. In recent years considerable interest has been shown in the generation of binary sequences which have good properties. Such binary sequences play an important role in a stream cipher system.

• Journal of applied mathematics & informatics
• /
• 제29권1_2호
• /
• pp.119-133
• /
• 2011

This paper proposes an infeasible interior-point algorithm with full-Newton step for linear programming. We introduce a special self-regular proximity to induce the feasibility step and also to measure proximity to the central path. The result of polynomial complexity coincides with the best-known iteration bound for infeasible interior-point methods, namely, O(n log n/${\varepsilon}$).

• 문화기술의 융합
• /
• 제8권2호
• /
• pp.315-319
• /
• 2022

본 연구는 선형 혼합 모형을 활용하여 쓰기 능력이 장기적으로 어떻게 발전되어 가는지를 통사적 복잡성(syntactic complexity) 측면에서 4명의 사례 연구자들이 작성한 에세이를 활용하여 분석하였다. 사례 연구자들은 자발적으로 Criterion 이라는 자동 쓰기 평가 프로그램의 피드백을 받아 초안과 수정본을 교실 밖에서 매달 한 개 씩 일 년 동안 작성했다. 총 48개 초안 에세이가 본 연구의 분석 대상이고, 통사적 복잡성은 Syntactic Complexity Analyzer의 14개 지표 중에서 추출하여 분석하였다. 선형 혼합 모형 분석 결과를 살펴보면 다음과 같다. 시간과 T-unit의 평균길이 간에는 통계적으로 유의미한 선형 관계가 있었으며, 이는 연구 참여자들이 시간이 지날수록 길이가 긴 T-uni을 포함한 에세이를 작성했음을 보여준다. 또한 시간과 의존절과 독립절 간의 비율 간에도 통계적으로 유의미한 선형 관계가 있었는데, 이는 연구 참여자들이 일 년 동안 높은 비율의 의존절이 포함된 에세이를 작성했음을 시사한다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.955-959
• /
• 2003

A technique for realizing linear phase IIR filters has been proposed by Powell-Chau which gives a real-time implementation of H(z-1).H(z), where H(z) is a causal nonlinear phase IIR filter. Powell-Chau system is linear but not timeinvariant system. Therefore, that system has group delay response that exhibits a minor sinusoidal variation superimposed on a constant value. In the signal processing, this oscillation seriously degrade the signal quality. Unfortunately, that system has a large sample delay of 4L and also more computational complexity. Proposed system is present a reduced computational complexity technique by moved the numerator polynomial of H(1/z) out to cascade with causal filter H(z) and remain only all-pole of H(1/z), then applied truncated infinite impulse response to finite with truncated IIR filtel $H_L$(z) and L sample delay to subtract the output sequence from the top and bottom filter. Proposed system is linear time invariance and group delay response and total harmonic distortion are also improved.

• 한국통신학회논문지
• /
• 제33권7C호
• /
• pp.534-539
• /
• 2008

최근에 홀수인 소수 p, n=4k, 그리고 $d=((p^{2k}+1)/2)^2$에 대해서 Seo, Kim, No, Shin이 H-sequence와 d로 decimation한 부분 수열들 사이의 상관 분포를 유도하였다. 하지만 이러한 상관 분포로부터 수열군이 자명하게 결정되지는 않는다. 본 논문에서는 우선 위의 상관 특성을 유지하는 수열군을 선택하는 방법을 제시한다. 더 나아가서 이 수열군과 동일한 상관 특성을 가지면서도 더 큰 선형 복잡도를 갖는 수열군을 새롭게 생성할 것이다. 끝으로 3진 수열의 선형 복잡도를 특정 경우에 대해서 유도하고 이 경우 원래의 수열군보다 더 큰 선형 복잡도를 가짐을 보일 것이다.

• 호남수학학술지
• /
• 제35권2호
• /
• pp.235-249
• /
• 2013

It is well known that each kernel function defines primal-dual interior-point method (IPM). Most of polynomial-time interior-point algorithms for linear optimization (LO) are based on the logarithmic kernel function ([9]). In this paper we define new eligible kernel function and propose a new search direction and proximity function based on this function for LO problems. We show that the new algorithm has $\mathcal{O}(({\log}\;p)^{\frac{5}{2}}\sqrt{n}{\log}\;n\;{\log}\frac{n}{\epsilon})$ and $\mathcal{O}(q^{\frac{3}{2}}({\log}\;p)^3\sqrt{n}{\log}\;\frac{n}{\epsilon})$ iteration complexity for large- and small-update methods, respectively. These are currently the best known complexity results for such methods.

• Journal of Information Processing Systems
• /
• 제2권3호
• /
• pp.153-158
• /
• 2006

In this paper, we propose an image interpolator for low computational complexity. The proposed image interpolator supports the image scaling using a modified cubic convolution interpolation between the input and output resolutions for a full screen display. In order to reduce the computational complexity, we use the difference in value of the adjacent pixels for selecting interpolation methods and linear function of the cubic convolution. The proposed image interpolator is compared with the conventional one for the computational complexity and image quality. The proposed image interpolator has been designed and verified by Verilog HDL(Hardware Description Language). It has been synthesized using the Xilinx VirtexE FPGA, and implemented using an FPGA-based prototype board.

• 한국통신학회논문지
• /
• 제35권7A호
• /
• pp.623-631
• /
• 2010

In this paper, various of pilot-assisted channel estimation techniques for 3GPP LTE downlink are tested under multipath Rayleigh fading channel. At first, the conventional channel estimation techniques are applied with linear zero-forcing (ZF) equalizer, such as one dimensional least square (1-D LS) linear interpolation, two dimensional (2-D) wiener filter, the time and frequency dimension separate wiener filter and maximum likelihood estimator (MLE). Considering the practical implementation, we proposed two channel estimation techniques by combining time-dimension wiener filter and MLE in two manners, which showed a good tradeoff between system performance and complexity when comparing with conventional techniques. The nonlinear decision feedback equalizer (DFE) which can show a better performance than linear ZF equalizer is also implemented for mitigating inter-carrier interference (ICI) in our system. The complexity of these algorithms are calculated in terms of the number of complex multiplications (CMs) and the performances are evaluated by showing the bit error rate (BER).

• Journal of Information Processing Systems
• /
• 제3권1호
• /
• pp.21-25
• /
• 2007

We propose several practical SMC protocols for privacy-preserving cooperative scientific computations. We consider two important scientific computations which involve linear equations: the linear systems of equations problem and the linear least-square problem. The protocols proposed in this paper achieve acceptable security in the sense of Du-Zhan's paradigm and t-wise collusion-resistance, and their communication complexity is O(tm), where t is a security parameter and m is the total number of participants. The complexity of our protocol is significantly better than the previous result O($m^2/{\mu}$) of [4], in which the oblivious transfer protocol is used as an important building block.

• Journal of applied mathematics & informatics
• /
• 제30권1_2호
• /
• pp.127-133
• /
• 2012

We establish the polynomial convergence of a new class of path-following methods for SDLCP whose search directions belong to the class of directions introduced by Monteiro [3]. We show that the polynomial iteration-complexity bounds of the well known algorithms for linear programming, namely the short-step path-following algorithm of Kojima et al. and Monteiro and Alder, carry over to the context of SDLCP.