• 정보보호학회논문지
• /
• 제7권3호
• /
• pp.11-22
• /
• 1997

출력 수열의 수가 스트림암호의 새로운 평가요소로서 제안된 바 있으나 일반적으로 발표된 대부분의 이진 수열 발생기는 출력 수열이 1개 뿐인 것으로 알려졌다. 본 논문에서는 출력 수열의 수가 여러 개인 다수열 출력 이진 수열 발생기를 2가지 유형으로 제안하였다. 첫 번째는 여러개의 feedback tap중 하나를 초기키에 따라 선택하는 Switched-Tap LESR(STLFSR)과 이를 이용한 일반형 모델 및 Geffe 발생기의 적용 예를 제안하였다. 나머지는 다수열 출력 수열로 이미 알려진 golic의 메모리 수열발생기(MEM-BSG)를 개선하여 대용량 메모리 사용이 가능하도록 일반화시킨 대용량 메모리형 다수열 출력 발생기(GMEM-BSG)를 제안하고, 이 발생기의 주기, 선형복잡도 및 출력 수열의 수를 분석하였다.

• Kyungpook Mathematical Journal
• /
• 제56권2호
• /
• pp.367-370
• /
• 2016

In this paper, we consider the generalized Lucas sequence which is the (p, q) - Lucas sequence. Then we used the Binet's formula to show some properties of the (p, q) - Lucas number. We get some generalized identities of the (p, q) - Lucas number.

• 산업경영시스템학회지
• /
• 제11권18호
• /
• pp.59-69
• /
• 1988

This study represents the method of application of W.S(Work Sampling) to determine job sequence. The result shows job sequence which has the came performance measure of optimal job sequence is selected by average number of 199 sampling. In the case, the optimal job sequence is not selected within the sampling number of 921 which satisfy the reliability of 99.5% and precision of 99%, the deviation is very little which 0.73%. This improves the possibility of application of W.S method to select optimal job sequence is very high.

• 산업공학
• /
• 제14권3호
• /
• pp.247-254
• /
• 2001

As current postal automation is limited to dispatch and arrival sorting, delivery sequence sorting is performed manually by each postman. It not only acts as a bottleneck process in the overall mailing process but is expensive operation. To cope with this problem effectively, delivery sequence sorting automation is required. The important components of delivery sequence sorting automation system are sequence sorter and Hangul OCR which function is to extract the address of delivery point. DSI database will be interfaced to both Hangul OCR and sequence sorter for finding the accurate delivery sequence number and stacker number. The objectives of this research are to develop DSI(Delivery Sequence Information) database prototype and client application for managing information effectively. For database requirements collection and analysis, we draw all possible sorting plans, and apply the AHP(Analytic Hierarchy Process) method to determine the optimal one. And then, we design DSI database schema based on the optimal one and implement it using Oracle RDBMS. In addition, as address information in DIS database consist of hierarchical structure which has its correspondence sequence number, so it is important to reorganize sequence information accurately when address information is inserted, deleted or updated. To increase delivery accuracy, we reflect this point in writing application.

• 대한수학회논문집
• /
• 제37권4호
• /
• pp.977-988
• /
• 2022

The Padovan sequence is the third-order linear recurrence (𝓟_n)_n≥0 defined by 𝓟_n = 𝓟_n-2 + 𝓟_n-3 for all n ≥ 3 with initial conditions 𝓟₀ = 0 and 𝓟₁ = 𝓟₂ = 1. In this paper, we investigate a generalization of the Padovan sequence called the k-generalized Padovan sequence which is generated by a linear recurrence sequence of order k ≥ 3. We present recurrence relations, the generalized Binet formula and different arithmetic properties for the above family of sequences.

• 한국통신학회논문지
• /
• 제19권5호
• /
• pp.952-958
• /
• 1994

본 논문에서 정수론에 기초한 이진수호와 이전된 이진부호 사이의 시간옵셉을 계산하는 방법을 제시한다. 이 방법을 이용하여 이진부호 사이의 시간옵셉을 계산할 수 있다. 모든 기지국은 동일한 확산부호를 사용하므로써 동기 부호분할 다원접속 시스템에서 기준(영 \ulcorner\ulcornerV)부호를 정의하는 것은 중요하다. 다른 기지국으로부터 이동국에 수신되는 신호를 구별하기 위하여 영옵셉부호에 대한 시간옵셉을 사용하고 있다. 본 논문은 기준부호를 정의하는 방법을 제시한다.

• 한국정밀공학회지
• /
• 제13권6호
• /
• pp.90-101
• /
• 1996

Determination of assembly sequence of components is a key issue in assembly operation. Although a number of articles dealing with assembly sequence determination have appeared, an efficient and general methodology for complex products has yet to appear. The objective of this paper is to present the problems and models used to generate assembly sequence from design data. An essential idea of this research is to acquire a finite number of voxels from any complex geometric entity, such as 3D planar polygons, hollow spheres, cylinders. cones, tori, etc. In order to find a feasible assembly sequence, the following four steps are needed: (1) The components composing of an assembly product are identified and then the geometric entities of each component are extracted. (2) The geometric entities extracted in the first step are translated into a number of voxels. (3) All the mating or coupling relations between components are found by considering relations between voxels. (4) The components to be disassembled are determined using CCGs (Component Coupling Graph).

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제11권1호
• /
• pp.63-72
• /
• 2004

It is known that each natural number can be written uniquely as a sum of Fibonacci numbers with suitably increasing indices. In 1960, Daykin showed that the sequence of Fibonacci numbers is the only sequence with this property. Consider here the problem of representing each natural number uniquely as a sum of positive integers taken from certain sequence allowing a fixed number, $\cal{l}\geq2$, of repetitions. It is shown that the $(\cal{l}+1)$-adic expansion is the only such representation possible.

• 한국통신학회논문지
• /
• 제21권5호
• /
• pp.1193-1199
• /
• 1996

This paper introduces an algorithm which uses MUIO and the shortest paths to minimize the length of test sequence. The length of test sequence is equal to the total number of the edges in a symmetric test graph $G^{*}$. Therefore, it is important to make a $G^{*}$ with the least number of the edges. This algorithm is based on the one proposed Shen[2]. It needs the complexity to make shortest paths but reduces the thest sequence by 1.0~9.8% over the Shen's algorithm. and this technique, directly, derives a symmetric test graph from an FMS.

• 한국정보처리학회논문지
• /
• 제7권5호
• /
• pp.1474-1481
• /
• 2000

The number of keystream cycle sequences has been proposed as a characteristic of binary sequence generator for cryptographic application, but in general the most of binary sequence generators have a single cycle. On the other hand, S-box has been used to block cipher for a highly nonlinear element and then we apply it to the stream cipher with a high crypto-degree. In this paper, we propose a multiple-cycle binary sequence generator based on S-box which has a high nonlinearity containing SAC property and analyze its period, linear complexity, randomness and the number of keystream cycle sequences.