• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.634-639
• /
• 1998

A methodology based on the concept of variable string length GA(VGA) is developed for determining automatically the number of hyperplanes and their appropriate arrangement for modeling the class boundaries of a given training data set in RN. The genetic operators and fitness functionare newly defined to take care of the variability in chromosome length. Experimental results on different artificial and real life data sets are provided.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.6
• /
• pp.1117-1119
• /
• 2015

In this letter, we propose a mathematical model of variable-length payloads transmitted in EDCA and transmitted using MU-MIMO. Assuming fixed-length or the use of mean value of payload length leads to discordant results while calculating the total payload length of variable-length frames transmitted within a fixed duration. Using the proposed model results in accurate results (less than 3% relative errors) for total payload length under variable-length traffic.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.458-461
• /
• 2000

Variable length codes are often used in entropy coding, but are very vulnerable in noisy environments. Reversible variable length codes, however, muse possible to decode instantaneously in both forward and backward directions, so that more usable data can be retrieved when bit errors occur via transmission. Furthermore, partial decodability is desirable to introduce in the reversible variable length code because ROI (Region Of Interest) decoding function is sometimes required in recent image information systems such as the medical imaging, the digital museum and so on. In this paper, we propose a partially decodable and reversible variable length code by modifying Golomb-Rice code.

• Proceedings of the IEEK Conference
• /
• 2002.06b
• /
• pp.285-288
• /
• 2002

In this paper, a new structure of 1024-bit high-speed RSA cryptosystem has been proposed and implemented in hardware to increase the operation speed and enhance the variable-length operation in the plain text. The proposed algorithm applied a radix-4 Booth algorithm and CSA(Carry Save Adder) to the Montgomery algorithm for modular multiplication As the results from implementation, the clock period was approached to one delay of a full adder and the operation speed was 150MHz. The total amount of hardware was about 195k gates. The cryptosystem operates as the effective length of the inputted modulus number, which makes variable length encryption rather than the fixed-length one. Therefore, a high-speed variable-length RSA cryptosystem could be implemented.

• Journal of the Korean Mathematical Society
• /
• v.42 no.3
• /
• pp.517-527
• /
• 2005

This paper considers a discrete-time queueing system with variable service capacity. Using the supplementary variable method and the generating function technique, we compute the joint probability distribution of queue length and remaining service time at an arbitrary slot boundary, and also compute the distribution of the queue length at a departure time.

• Journal of the Korean Society for Precision Engineering
• /
• v.27 no.3
• /
• pp.73-79
• /
• 2010

A preliminary study on a length-variable rotor blade for a small unmanned helicopter has been conducted. After surveys on previous researches, and examining requirements for application to a small unmanned helicopter, a length-variable rotor blade was designed and manufactured to be driven by centrifugal force from rotor revolution with no mechanical actuator. The rotor blade was divided into a fixed inboard section and an outboard section sliding in span-wise direction. In order to determine the operating conditions of the length-variable rotor during revolution, and to derive the design variables of extension spring and rotor weight, a series of analyses from multi-body dynamics solution were conducted. The manufactured prototype was verified of its length-varying mechanism from a rotor stand, the results and required future improvements are discussed.

• Journal of information and communication convergence engineering
• /
• v.6 no.3
• /
• pp.285-288
• /
• 2008

Most of multimedia processors for 2D/3D graphics acceleration use a lot of integer/floating point arithmetic units. We present a new architecture with an efficient ALU, built in a smaller chip size. It reduces instruction cycles significantly based on a foundation of multi-thread operation, variable length instruction words, dual phase operation, and phase instruction's coordination. We can decrease the number of instruction cycles up to 50%, and can achieve twice better performance.

• Structural Engineering and Mechanics
• /
• v.5 no.5
• /
• pp.529-539
• /
• 1997

This paper deals with the bending problem of a variable-are-length elastica under moment gradient. The variable are-length arises from the fact that one end of the elastica is hinged while the other end portion is allowed to slide on a frictionless support that is fixed at a given horizontal distance from the hinged end. Based on the elastica theory, exact closed-form solution in the form of elliptic integrals are derived. The bending results show that there exists a maximum or a critical moment for given moment gradient parameters; whereby if the applied moment is less than this critical value, two equilibrium configurations are possible. One of them is stable while the other is unstable because a small disturbance will lead to beam motion.

• Journal of Communications and Networks
• /
• v.18 no.1
• /
• pp.40-49
• /
• 2016

In this paper, we present a symbol-level iterative source-channel decoding (ISCD) algorithm for reliable transmission of variable-length codes (VLCs). Firstly, an improved source a posteriori probability (APP) decoding approach is proposed for packetized variable-length encoded Markov sources. Also proposed is a recursive implementation based on a three-dimensional joint trellis for symbol decoding of binary convolutional codes. APP channel decoding on this joint trellis is realized by modification of the Bahl-Cocke-Jelinek-Raviv algorithm and adaptation to the non-stationary VLC trellis. Simulation results indicate that the proposed ISCD scheme allows to exchange between its constituent decoders the symbol-level extrinsic information and achieves high robustness against channel noises.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.137-140
• /
• 2003

In this paper, we propose a new construction algorithm for the reversible variable-length code (RVLC) using a simplified average length function of the optimal Huffman code. RVLC is introduced as one of the error resilience tools in H.263+ and MPEG-4 owing to its error-correcting capability. The proposed algorithm demonstrates an improved performance in terms of the average codeword length over the existing HVLC algorithms.