• Journal of applied mathematics & informatics
• /
• v.7 no.1
• /
• pp.269-278
• /
• 2000

A Boolean function generates a binary sequence which is frequently used in a stream cipher. There are number of critical concepts which a Boolean function, as a key stream generator in a stream cipher, satisfies. These are nonlinearity, correlation immunity, balancedness, SAC(strictly avalanche criterion), PC(propagation criterion) and so on. In this paper, we present the algorithms for generating random nonlinear combining functions satisfying given correlation immune order and nonlinearity. These constructions can be applied for designing the key stream generators. We use Microsoft Visual C++6.0 for our program.

• Journal of Korea Multimedia Society
• /
• v.9 no.10
• /
• pp.1371-1379
• /
• 2006

This paper suggests the padding algorithm using padding character length to concatenate more than one string without side-effect. Most existing padding algorithms padding null character in the empty location could not discriminate the real string from the padded character. To overcome this problem, in this paper, the padded character contains pad character length information. This mechanism is working better than NULL or '00' padding cases. The suggested padding algorithm could be effective for data encryption and decryption algorithms.

• Speech Sciences
• /
• v.15 no.4
• /
• pp.97-105
• /
• 2008

Nowadays an HMM-based text-to-speech system (HTS) has been very widely studied because it needs less memory and low computation complexity and is suitable for embedded systems in comparison with a corpus-based unit concatenation text-to-speech one. It also has the advantage that voice characteristics and the speaking rate of the synthetic speech can be converted easily by modifying HMM parameters appropriately. We implemented an HMM-based Korean text-to-speech system using a small size Korean speech DB and proposes a method to increase the naturalness of the synthetic speech by controlling duration model parameters in the HMM-based Korean text-to speech system. We performed a paired comparison test to verify that theses techniques are effective. The test result with the preference scores of 73.8% has shown the improvement of the naturalness of the synthetic speech through controlling the duration model parameters.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2007.11a
• /
• pp.340-348
• /
• 2007

This paper deals with the complex verb formation of passive and potential predicates and syntactic structures projected by these verbs. Though both predicates are formed with the suffix -rare which has been assumed to originate from the same stem, they show significantly different syntactic behaviors. We propose two kinds of concatenation of base verbs and auxiliaries; passive verbs are lexically formed with the most restrictive mode of combination, while potential verbs are formed syntactically via more flexible combinatory operations of function composition. The difference in the mode of complex verb formation has significant consequences for their syntactic structures and semantic interpretations, including different combination with the honorific morphemes and subjectivization of arguments/adjuncts of base verbs. We also consider the case alternation phenomena and their implications for scope construals found in potential sentences, which can be accounted for in a unified manner in terms of the optional application of function composition.

• Journal of Communications and Networks
• /
• v.4 no.4
• /
• pp.321-335
• /
• 2002

Emergence of the fourth generation mobile communication system (4G system) is now in its dawn. This article proposes a perspective framework on the 4G system, and discusses various kinds of system aspects and technological requirements in terms of novel service features, spectrum management, radio access technologies, wired access integration, core network, and mobile terminal. The focus of the article is to define the scope and features of the 4G system in an overall system/network viewpoint. From the foreseeable development trends, it is highly expected that whatever emerges in the 4G system will be some kind of constantly evolving and grand recursive concatenation of all the existing system/network developments.

• The Journal of the Acoustical Society of Korea
• /
• v.17 no.4
• /
• pp.38-44
• /
• 1998

대용량의 음성합성용 데이터베이스를 용이하게 구축하기 위해 음성인식 시스템을 이용한 음소 경계 분할이 이루어지고 있다. 그러나 자동 분할 결과를 직접 이용하여 합성음 을 생성할 경우 음소 경계 에러로 인하여 접합 왜곡이 많이 발생하게 된다. 이러한 문제를 해결하기 위해서, 본 연구에서는 단위 접합시 경계 에러를 고려하여 적합한 접합 위치를 찾 고자 하였다. 여기서 적합한 접합 위치는 스펙트럼의 불연속이 최소화된 접합점을 의미한다. 합성음에 대한 MOS(Mean Opinion Score) 테스트와 스펙트로그램(spectrogram)의 모양을 비교하므로써 제안된 방법의 성능을 평가하였다. 제안된 방법은 두 단계로 이루어져 있다. 첫째, 레퍼런스 패턴(reference pattern)과 두 개의 테스트 패턴(test pattern)을 선택하는 단 계와, 둘째, 앞과 뒤 테스트 패턴 사이의 적합한 접합위치를 찾는 단계이다. 본 연구에서는 패턴 사이의 스펙트로그램 비교를 위해 켑스트럼(cepstrum) 피라미터와 패턴 분류기 (pattern classifier)인 DTW(Dynamic Time Warping) 알고리즘을 사용하였다. 제안된 알고 리즘을 평가한 청취 테스트의 결과에서 제안된 알고리즘을 적용하여 합성된 합성음의 음질 이 자동 분절로 생성된 단위를 그대로 이용한 경우의 음질보다 우수함을 보였다.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.5 no.4
• /
• pp.333-338
• /
• 2005

This paper presents the target object search algorithm under Dynamic Programming (DP) in the Tree-type maze. We organized an experimental environment with the concatenation of Y-shape diverged way, small mobile robot, and a target object. By the principle of optimality, the backbone of DP, an agent recognizes that a given whole problem can be solved whether the values of the best solution of certain ancillary problem can be determined according to the principle of optimality. In experiment, we used two different control algorithms: a left-handed method and DP. Finally we verified the efficiency of DP in the practical application using our real robot.

• The Journal of the Acoustical Society of Korea
• /
• v.15 no.4
• /
• pp.5-11
• /
• 1996

In this study, the method of speaker adaptation for uttered sentence using syllable unit hmm is proposed. Segmentation of syllable unit for sentence is performed automatically by concatenation of syllable unit hmm and viterbi segmentation. Speaker adaptation is performed using MAPE(Maximum A Posteriori Probabillity Estimation) which can adapt any small amount of adaptation speech data and add one sequentially. For newspaper editorial continuous speech, the recognition rates of adaptation of HMM was 71.8% which is approximately 37% improvement over that of unadapted HMM

• Journal of Communications and Networks
• /
• v.5 no.1
• /
• pp.1-6
• /
• 2003

In this paper, we extend the derivation of the iterative soft-output Viterbi algorithm (SOVA) for partial response (PR) channels, and modify its decoding process such that it works consistently for arbitrary high code rates, e.g., rate 64/65. We show that the modified SOVA always outperforms the conventional SOVA that appears in the literature with a significant difference for high code rates. It also offers a significant cut down in the trace-back computations. We further examine its performance for parallel and serial concatenated codes on a precoded Class IC partial response (PR4) channel. Code rates of the form $\frac{k_0}{k_0+1}$($k_0$ = 4, 8, and 64) are considered. Our simulations indicate that the loss suffered by the modified SOVA, relative to the APP algorithm, is consistent for all code rates and is at most 1.2 dB for parallel concatenations and at most 1.6 dB for serial concatenations at $P_b$ = $10^{-5}$.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.67 no.6
• /
• pp.767-772
• /
• 2018

Recently, some meta-heuristic algorithms, such as GA(Genetic Algorithm) and GP(Genetic Programming), have been used to optimize CNN(Convolutional Neural Network). The CNN, which is one of the deep learning models, has seen much success in a variety of computer vision tasks. However, designing CNN architectures still requires expert knowledge and a lot of trial and error. In this paper, the recent attempts to automatically construct CNN architectures are investigated and analyzed. First, two GA based methods are summarized. One is the optimization of CNN structures with the number and size of filters, connection between consecutive layers, and activation functions of each layer. The other is an new encoding method to represent complex convolutional layers in a fixed-length binary string, Second, CGP(Cartesian Genetic Programming) based method is surveyed for CNN structure optimization with highly functional modules, such as convolutional blocks and tensor concatenation, as the node functions in CGP. The comparison for three approaches is analysed and the outlook for the potential next steps is suggested.