Earticle

Scheduling plays a very important role in effective communication in optical burst switching networks. Thus far, many different scheduling algorithms have been proposed; these can be classified into two main groups: online scheduling and group scheduling. In case of the latter, some algorithms have been proposed as OBS-GS, which maximize the number of scheduled bursts, or MWIS-OS, the target of which is to obtain the maximum total length of the scheduled bursts. However, these proposals have the algorithm complexity of NP-complete. In this paper, we propose an algorithm of group scheduling that has linear complexity; the timeslot of group scheduling changes adaptively to the rate of the arriving bursts. The analysis and simulation results prove the correctness and the effectiveness of our proposal.

The linear complexity and k-error linear complexity of a sequence have been used as important measures for keystream strength. In order to study k-error linear complexity of binary sequences with period 2n, a new tool called cube theory is developed. In this paper, we first give a general decomposition approach to decompose a binary sequence with period 2n into some disjoint cubes. Second, a counting formula for m-cubes with the same linear complexity is derived, which is equivalent to the counting formula for k-error vectors. The counting formula of 2n-periodic binary sequences which can be decomposed into more than one cube is also investigated, which extends an important result by Etzion et al.. Finally, we study 2n-periodic binary sequences with the given k-error linear complexity profile. Consequently, the complete counting formula of 2n-periodic binary sequences with given k-error linear complexity profile of descent points 2, 4 and 6 is derived. The periodic sequences having the prescribed k-error linear complexity profile with descent points 1, 3, 5 and 7 are also briefly discussed.

The present paper, we doing the statistical analysis of insertion sort program and compute its execution times with various parameters. The statistical analysis endorses the specific quadratic pattern of the execution time on the number of items to be sorted. Next, a cursor along the future scope is indicated.

Liner complexity(LC), which could quantify the modal structure, were calculated from electroencephalograms(EEGs) in four states such as a pleasant and relaxed, a pleasant and aroused, an unpleasant and relaxed, and an unpleasant and aroused state. Each state was evoke by visual stimuli of relaxed or aroused state, LC could discriminate statistically state(t-test; p<0.01). LCs in pleasant states were larger than those in unpleasant ones.

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.

We study colorings of regular trees using subball complexity b(n), which is the number of colored n-balls up to color-preserving isomorphisms. We show that for any k-regular tree, for k > 1, there are colorings of intermediate complexity. We then construct colorings of linear complexity b(n) = 2n + 2. We also construct colorings induced from sequences of linear subword complexity which has exponential subball complexity.

SOQPSK-TG는 주파수 효율과 전력 효율이 매우 우수한 항공기 텔레메트리용 변조신호이다. 본 논문에서는 부분응답 SOQPSK-TG 변조방식의 위상파형을 선형 근사하여 완전응답 이중 듀오바이너리 SOQPSK(SOQPSK-DD) 신호로 모델링하였다. 그리고 XTCQM 기법과 롤랑분해 기법을 사용하여 SOQPSK-DD 신호를 선형 펄스 파형을 갖는 OQPSK로 근사 모델링하였고 두 가지 기법의 결과가 동일함을 증명하였다. 또한 SOQPSK-DD 신호의 로랑분해 파형이 SOQPSK-TG 신호의 로랑분해 파형을 근사한 파형임을 확인하였고, SOQPSK-DD의 로랑분해 파형을 검출필터에 적용한 결정궤환 IQ-검출기가 기존보다 단순한 파형으로도 거의 동일한 성능을 발휘함을 보였다.

SOQPSK-TG is a modulated signal for aircraft telemetry with excellent frequency efficiency and power efficiency. In this paper, the phase waveform of the partial response SOQPSK-TG modulation is linearly approximated and modeled as a full response double duobinary SOQPSK (SOQPSK-DD) signal. And using the XTCQM method and the Laurent decomposition method, the SOQPSK-DD signal was approximated as OQPSK having linear pulse waveforms, and the results of the two methods were proved to be the same. In addition, it was confirmed that the Laurent decomposition waveform of the SOQPSK-DD signal approximates the Laurent decomposition waveform of the original SOQPSK-TG signal. And it was shown that the decision feedback IQ-detector, which applied the Laurent decomposition waveform of SOQPSK-DD to the detection filter, exhibits almost the same performance even with a simpler waveform than before.

유한체 GF(p)에서 r=2p+1이 2-솟수이고, p에 대한 2의 위수 m을 가질 때, $q=r^e,\;(e{\geq}2)$를 연결정수로 갖는 FCSR의 생성된 출력 수열에 대한 선형복잡도를 구한다. 또한, 합산 난수 발생기(Summation Generator)는 LFSR의 출력 수열을 정수 합산하여 키 수열을 발생한다. 이와 유사하게 두개의 FCSR의 출력 수열을 상관관계에 안전한 비트별 논리합(bitwise exclusive-oring)을 이용한 이진 난수열 발생기를 제안하고, 선형복잡도 측면에서 출력된 수열의 암호학적 특성을 살펴본다

We have derived the linear complexity of a binary sequence generated by a Feedback with Carry Shift Regiater(FCSR) under the following condition: q is a power of a prime such that $q=r^e,\;(e{\geq}2)$ and r=2p+1, where both r and p are 2-prime. Also, a summation generator creates sequence from addition with carry of LFSR(Linear Feedback Shift Register) sequences. Similarly, it is possible to generate keystream by bitwise exclusive-oring on two FCSR sequences. In this paper, we described the cryptographic properties of a sequence generated by the FCSRs in view of the linear complexity.

본 논문에서는 구간선형 모델을 적용하여 낮은 복잡도를 가지는 LSC(Lens-Shading Correction) 알고리즘을 제안한다. 제안한 알고리즘은 각 화소와 렌즈 중심점으로부터 거리를 정수형으로 계산하고, 이 정수를 거리에 대한 LSC 이득값이 저장된 LUT(Look-Up Table)에 대한 주소로 적용하여, 입력 화소 값에 곱함으로써 LSC를 수행한다. 거리를 구하려면 제곱근 회로가 추가되어야 한다. LUT에 저장된 이득값은 원점으로부터의 거리에 대한 평균 이득값을 저장하고 있기 때문에, 제곱근 계산에 높은 정밀도를 할애하여도 LSC 보상된 영상의 화질에 미치는 영향은 높지 않으므로 정수형 제곱근 연산을 수행한다. 제곱근 계산은 구간 선형화하여 단지 덧셈과 쉬프트 연산만으로 제곱근 연산을 완료할 수 있도록 간략화 하였다. 제안한 알고리즘을 양산 중인 일반 카메라 모듈에 적용한 결과, 카메라모듈 제조업체의 LSC 평가 기준을 상회하는 수준으로 나타나며, 구현될 하드웨어 복잡도가 매우 낮아서 모바일 카메라 구현에 매우 적합하다.