• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2001.05a
• /
• pp.77-83
• /
• 2001

In recent years, the AES in North America and the NESSIE project in Europe have been in progress. Six proposals have been submitted to the NESSIE project including the LILI-128 by Simpson in Australia in the synchronous stream cipher category. These proposals tend towards a design with parallelism of the algorithms in order to facilitate speed-up. In this paper, we consider the PS-LFSR and propose the effective implementation of various nonlinear combiners: memoryless-nonlinear combiner, memory-nonlinear combiner, nonlinear filter function, and clock-controlled function. Finally, we propose m-parallel SUM-BSG and LILI-l28's parallel implementation as examples, and we determine their securities and performances.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.6
• /
• pp.63-72
• /
• 2005

In this paper, we propose the bit-rate control algorithm for the block based image compression like H.263, H.263+ or MPEG-4. The proposed algorithm is designed to identify the quantization parameter set through the Lagrangian optimization technique based on the well-known linear source model. We set the Lagrangian cost function with the rates and distortion calculated from the linear source model. We calculate the quantization parameter set using the Vitervi algorithm to solve the Lagrangian optimization problem considering the Dquant method of H.263 and MPEG-4. The proposed algorithm improves the video quality by up to 1.5 dB compared with the TMN8 scheme, and is more effective in the video sources with dynamic activities than the consistent quality approaches.

• Journal of Korean Society of Steel Construction
• /
• v.22 no.1
• /
• pp.33-42
• /
• 2010

Patterning with a geodesic line is essential for economical or efficient usage of membrane materialsin fabric tension membrane structural engineering and analysis. The numerical algorithm to determine the geodesic line for membrane structures is generally classified into two. The first algorithm finds a non-linear shape using a fictitious geodesic element with an initial pre-stress, and the other algorithm is the geodesic line cutting or searching algorithm for arbitrarily curved 3D surface shapes. These two algorithms are still being used only for the three-node plane stress membrane element, and not for the four-node element. The lack of a numerical algorithm for geodesic lines with four-node membrane elements is the main reason for the infrequent use of the four-node membrane element in membrane structural engineering and design. In this paper, a modified numerical algorithm is proposed for the generation of a geodesic line that can be applied to three- or four-node elements at the same time. The explicit non-linear static Dynamic Relaxation Method (DRM) was applied to the non-linear geodesic shape-finding analysis by introducing the fictitiously tensioned 'strings' along the desired seams with the three- or four-node membrane element. The proposed algorithm was used for the numerical example for the non-linear geodesic shape-finding and patterning analysis to demonstrate the accuracy and efficiency, and thus, the potential, of the algorithm. The proposed geodesic shape-finding algorithm may improve the applicability of the four-node membrane element for membrane structural engineering and design analysis simultaneously in terms of the shape-finding analysis, the stress analysis, and the patterning analysis.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2004.04a
• /
• pp.305-309
• /
• 2004

The problem for parameters estimation of the received signals impinging on array sensors has long been of great research interest in a great variety of applications, such as radar, sonar, and land mobile communications systems. Conventional subspace-based algorithms, such as MUSIC and ESPRIT, require an extensive computation of inverse matrix and eigen-decomposition. In this paper, we propose a new parameters estimation algorithm via nonlinear minimization, which is simplified computationally and estimates signal parameters simultaneously.

• The Journal of the Acoustical Society of Korea
• /
• v.20 no.2
• /
• pp.3-9
• /
• 2001

In this paper, a random number generator for simulation of speech-waveform coders was designed. A random number generator having a desired probability density function and a desired power spectral density is discussed and experimental results are presented. The technique is based on Sondhi algorithm which consists of a linear filter and a memoryless nonlinearity. Several methods of obtaining memoryless nonlinearities for some typical continuous distributions are discussed. Sondhi algorithm is analyzed in the time domain using the diagonal expansion of the bivariate Gaussian probability density function. It is shown that the Sondhi algorithm gives satisfactory results when the memoryless nonlinearity is given in an antisymmetric form as in uniform, Cauchy, binary and gamma distribution. It is shown that the Sondhi algorithm does not perform well when the corresponding memoryless nonlinearity cannot be obtained analytically as in Student-t and F distributions, and when the memoryless nonlinearity can not be expressed in an antisymmetric form as in chi-squared and lognormal distributions.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.6 no.3
• /
• pp.25-36
• /
• 1996

Conventional radial-basis-function networks and fuzzy systems have serious problems in dealing with the non1inea:r approximations on high-dimensional spaces due to the explosive increase of the number of hidden nodes or fuzzy IF-THEN rules. In order to avoid such problems, this paper proposes a tree-structured intelligent system in which semi-local basis functions form its basic elements, and develops a training algorithm for the proposed system based on the modified genetic algorithm and LMS rule. Theoretical analysis is performed on the approximation capability of the proposed system, together with experimental studies which demonstrate the effectiveness of the developed methodology.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.27 no.8
• /
• pp.1281-1286
• /
• 2003

A line search algorithm to increase a convergence in Newton's method is developed and applied to nonlinear finite element analysis. The algorithm is based on the slack line search theory which is an efficient algorithm to determine initial acceleration coefficient, variable backtracking algorithm proposed by some researchers, and convergence criterion based on residual norm. Also, it is capable of avoiding exceptional diverging conditions. Developed program is tested in metal forming simulation such as forging and ring rolling. Numerical result shows the validity of the algorithm for a highly nonlinear system .

• Journal of the Korea Computer Graphics Society
• /
• v.9 no.2
• /
• pp.27-32
• /
• 2003

본 논문에서는 다항식 H(x)로부터 H(x) = f(g(x))를 만족하는 두 개의 다항식 f(x), g(x)로 분해하는 알고리즘을 제시한다. 간단한 구조의 비선형 방정식 들을 풀면 이 문제를 해결할 수 있다. 일반적으로 비선형 방정식을 푸는 문제는 상당히 어렵다고 여겨지고 있지만, 이 문제에서는 변수들간의 점화식을 이용하여 정확하게 해를 구할 수 있다. 논문에서는 몇 가지 예제를 통해서 제시한 알고리즘의 효율성을 보이고, 기하 모델링 분야에서 중요한 응용에 대해 논하고자 한다.

• Journal of Korean Society of Transportation
• /
• v.22 no.2 s.73
• /
• pp.43-54
• /
• 2004

This study analyzes characteristics and applicability of genetic algorithms and genetic operators to optimize highway alignments. Genetic algorithms, one of artificial intelligence techniques, are fast and efficient search algorithms for generating, evaluation and finding optimal highway alignment alternatives. The performance of genetic algorithms as an optimal search tool highly depends on genetic operators that are designed as a problem-specific. This study adopts low mutation operators(uniform mutation operator, straight mutation operator, non-uniform mutation operator whole non-uniform mutation operator) to explore whole search spaces, and four crossover operators(simple crossover operator, two-point crossover operator, arithmetic crossover operator, heuristic crossover operator) to exploit food characteristics of the best chromosome in previous generations. A case study and a sensitivity analysis have shown that the eight problem-specific operators developed for optimizing highway alignments enhance the search performance of genetic algorithms, and find good solutions(highway alignment alternatives). It has been also found that a mixed and well-combined use of mutation and crossover operators is very important to balance between pre-matured solutions when employing more crossover operators and more computation time when adopting more mutation operators.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.2
• /
• pp.225-230
• /
• 1996

We propose a statistical test for the nonlinear combiner logics which are usually combined with two maximal Linear Feedback Shift Registers and generate pseudorandom bit sequences. This test uses the mutual information between the output and set of inputs which will be a random variable and its distribution is obeyed to an approximate $\{chi}^2$ -distribution. We adopt this statistic to a $\{chi}^2$ -test of independence by using contingency table. We also apply a proposed test to some non-linear crptosystems and show that this useful to evaluate the strength of the cryptosystems.