• Korean Management Science Review
• /
• v.18 no.1
• /
• pp.105-118
• /
• 2001

The common shortest path problem is to find the shortest route between two specified nodes in a transportation network with only one traffic mode. The public transportation network with multiple traffic mode is a more realistic representation of the transportation system in the real world, but it is difficult for the conventional shortest path algorithms to deal with. The genetic algorithm (GA) is applied to solve this problem. The objective function is to minimize the sum of total service time and total transfer time. The individual description, the coding rule and the genetic operators are proposed for this problem.

• The Journal of the Korea Contents Association
• /
• v.13 no.2
• /
• pp.19-31
• /
• 2013

Since the high readable source codes help us to understand and modify the program, it is much easy to maintain them. The readability of source code is not only affected by the complexity of algorithms such as control structures but also affected by the coding styles such as naming and indentation. Although various coding standards have been presented for promoting the readability of source codes, it has been usually lost or ignored in a programming course. One of the reasons is that the coding standard is not a hard-and-false rule since it does not contribute to the performance of software. In this paper, we propose a simple automatic system, namely StyleJigsaw, which checks the style of the source codes written by C/C++ or Java. In this system, the coding style score is calculated and visualized as a jigsaw puzzle. To measure the educational effectiveness of StyleJigsaw, several experiments have been conducted on a class students in C++ programming course. According to the experimental results, the coding style score increased about 8.0 points(10.9%) on average using StyleJigsaw. Further, according to a questionnaire survey targeting the students who attended the programming course, about 88.5% of the students responded that StyleJigsaw was of help to learn the coding standards. We expect that the StyleJigsaw can be effectively used to encourage the students to obey the coding standards, resulting in high readable programs.

• Journal of Broadcast Engineering
• /
• v.10 no.4 s.29
• /
• pp.632-642
• /
• 2005

This paper presents a new vertex selection scheme for the polygon-based contour approximation. In the proposed method, the entire contour is partitioned into partial segments and they are approximated adaptively with variable accuracy. The approximation accuracy of each segment is controlled based on its relative significance. By computing the relative significance with the texture degradation in the approximation error region, the visual quality enhancement in the reconstructed frames can be achieved under the same amount of the contour data. For this purpose, a decision rule for $d_{max}$ is derived based on inter-region contrasts. In addition, an adaptive vertex selection method using the derived rule is proposed. Experimental results are presented to show the superiority of the proposed method over conventional methods.

• The Journal of the Acoustical Society of Korea
• /
• v.16 no.4
• /
• pp.106-109
• /
• 1997

In the area of the speech synthesis techniques, the waveform coding methods maintain the intelligibility and naturalness of synthetic speech. In order to apply the waveform coding techniques to synthesis by rule, however, we must be able to alter the pitches for prosody control of synthetic speech. In this paper, we propose a new pitch alteration technique in time-frequency hybrid domain, that compensates phase distortion of the cepstral pitch alteration method with time scaling method in the time domain. This method can remove some phase spectrum distortion which is occurred in conjunction point between the waveforms in continued frames. Also, we can obtain little magnitude spectrum distortion below 1.18% for pitch alteration of 200%.

• Journal of electromagnetic engineering and science
• /
• v.6 no.4
• /
• pp.244-252
• /
• 2006

A block Jacket transform and. its block inverse Jacket transformn have recently been reported in the paper 'Fast block inverse Jacket transform'. But the multiplication of the block Jacket transform and the corresponding block inverse Jacket transform is not equal to the identity transform, which does not conform to the mathematical rule. In this paper, new binary block Jacket transforms and the corresponding binary block inverse Jacket transforms of orders $N=2^k,\;3^k\;and\;5^k$ for integer values k are proposed and the mathematical proofs are also presented. With the aid of the Kronecker product of the lower order Jacket matrix and the identity matrix, the fast algorithms for realizing these transforms are obtained. Due to the simple inverse, fast algorithm and prime based $P^k$ order of proposed binary block inverse Jacket transform, it can be applied in communications such as space time block code design, signal processing, LDPC coding and information theory. Application of circular permutation matrix(CPM) binary low density quasi block Jacket matrix is also introduced in this paper which is useful in coding theory.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.12 no.4
• /
• pp.13-24
• /
• 2016

Defense Acquisition Program Administration's weapon system software development and management guideline specifies the criteria of software reliability tests including static and dynamic tests mainly on C/C++ languages. Recently, Defense Acquisition Program Administration expanded the scope of software reliability test for the various languages including C#, java etc. but specific criteria for them are not established. This study suggests the reliability test procedures and standards on C# programming software in weapon system. For the static test, considering the nature of the C# which depends on .NET framework, this paper introduces applying coding rules recommended by Microsoft Corp. Visual Studio 2012. Block coverage provided by Visual Studio is applied on dynamic tests and the achievement objectives for block coverage according to the software levels(A, B, C) are suggested. Also, the software reliability test procedures and standards proposed by this paper are properly verified through the case study. The result of this study can be used for establishing the specific criteria of the software reliability test for C# programming software in weapon system.

• Journal of Korea Multimedia Society
• /
• v.2 no.3
• /
• pp.347-354
• /
• 1999

Image sequence is compressed and stored as the unit of frame in computer, and reconstructed with desired quality according to several applications. In some cases specific parts are more important than other parts within a frame and these important parts must be reconstructed with high quality compared with the other parts and several schemes are suggested for such application and these schemes need to separate the important parts from a given frame, and also the syntax of shape, texture, and motion information must be defined for important parts and the other parts. But syntax rule in H.261, MPEG1 or MPEG2 is not suitable for our application because the syntax rules in the existing scheme can not express shape information for separating the important regions from each frame. So we propose a new syntax rule which represents the shape, texture and motion information in the circumstances where specific important parts exist in a frame.

• Journal of information and communication convergence engineering
• /
• v.12 no.4
• /
• pp.215-220
• /
• 2014

We consider quantization optimized for distributed estimation, where a set of sensors at different sites collect measurements on the parameter of interest, quantize them, and transmit the quantized data to a fusion node, which then estimates the parameter. Here, we propose an iterative quantizer design algorithm with a weighted distance rule that allows us to reduce a system-wide metric such as the estimation error by constructing quantization partitions with their optimal weights. We show that the search for the weights, the most expensive computational step in the algorithm, can be conducted in a sequential manner without deviating from convergence, leading to a significant reduction in design complexity. Our experments demonstrate that the proposed algorithm achieves improved performance over traditional quantizer designs. The benefit of the proposed technique is further illustrated by the experiments providing similar estimation performance with much lower complexity as compared to the recently published novel algorithms.

• Journal of Korean Library and Information Science Society
• /
• v.25
• /
• pp.377-404
• /
• 1996

The purpose of this study is to investigate material designation in library cataloging and to suggest General Material Designation (GMD) and Specific Material Designation(SMD) in Korean. A summary of the study follows. In library cataloging, methods of indicating the type of material are : (1) color-coding, (2) media code as part of the call number, (3) material designation in physical description area or note area, (4) GMD and SMD. GMD is a term indicating the broad class of material to which a bibliographic item belongs. SMD is a term indicating the special class of material to which a bibliographic item belongs. GMD was listed in parenthesis following the title proper before AACR1975 code, but currently it is listed in square brackets after the AACR1975 code. AACR2 was the standard cataloging rule in GMD and SMD terminology. It is suggested that GMD be used in Korean for graphic material, sound recordings, drawings, microform, multimedia, videorecordings, manuscripts, photographs, slides, printed music, motion pictures, printed texts, objects, braille, cartographic materials, computer files and transparenies.

• Proceedings of the KIEE Conference
• /
• 1999.07b
• /
• pp.507-509
• /
• 1999

In this paper, we propose a new fuzzy model identification method that can yield a successful fuzzy rule base for fundamental approximations. The method in this paper uses a set of input-output data and is based on a hybrid messy genetic algorithm (mGA) with a fine-tuning scheme. The mGA processes variable-length strings, while standard GAs work with a fixed-length coding scheme. For successfully identifying a complex nonlinear system, we first use the mGA, which coarsely optimizes the structure and the parameters of the fuzzy inference system, and then the gradient descent method which tine tunes the identified fuzzy model. In order to demonstrate the superiority and efficiency of the proposed scheme, we finally show its application to a nonlinear approximation.