• Journal of Software Engineering Society
• /
• v.26 no.1
• /
• pp.1-16
• /
• 2013

Variable length information message is a communication protocol standard in order for computer network systems to provide efficient delivery of information. The variable length information messages were developed for varying and controlling details of information in accordance with message receiver's required information level or information access level. In the previous studies, data compressing techniques have been in use for information message optimization technologies in order to reduce physical sizes of information messages. In optimization technologies for information messages, accuracy of information is considered as the most important factor; therefore, only non-loss compression techniques are applied to the optimization technologies. However, the non-loss compression based information message optimization methods are not efficient in data compression, and these are limited to efficient delivery of information in wireless network environments that have constraint bandwidth. In this paper, we attempt to optimize information in the variable length information messages at message fields in order to reduce physical sizes of messages more efficiently. To demonstrate the efficiency of our approach, we conduct optimization experiments for variable length information messages.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.49 no.1
• /
• pp.25-34
• /
• 2012

This paper presents a universal architecture for variable-length eight-parallel Reed-Solomon (RS) decoder for high-rate WPAN systems. The proposed architecture can support not only RS(255,239) code but various shortened RS codes. Moreover, variable-length architecture provides variable low latency for various shortened RS codes and the eight-parallel design also provides high data processing rate. Using 90-$nm$ CMOS standard cell technology, the proposed RS decoder has been synthesized and measured for performance. The proposed RS decoder can provide a maximum 19-$Gbps$ data rate at clock frequency 300 $MHz$.

• Journal of KIISE
• /
• v.43 no.11
• /
• pp.1275-1280
• /
• 2016

Existing techniques for string similarity search first generate a set of candidate strings and then verify the candidates. The efficiency of string similarity search is highly dependent on candidate generation methods. State of the art techniques select fixed length q-grams from a query string and generate candidates using inverted lists of the selected q-grams. In this paper, we propose a technique to generate candidates using variable length grams of a query string and develop a dynamic programming algorithm that selects an optimal combination of variable length grams from a query string. Experimental results show that the proposed technique improves the performance of string similarity search compared with the existing techniques.

• Journal of IKEEE
• /
• v.21 no.3
• /
• pp.202-210
• /
• 2017

Recently, some variable length adaptive filters which employ variable lengths taps for the input signal statistics are proposed [1-5]. In this paper, a new subband adaptive filter with variable filter tap length is proposed. The proposed subband variable length adaptive filters can optimize filter length for each subband which can result less computational complexities with respect to the conventional full band adaptive filters. When the signal in the full band has narrow spectrum, the conventional full band adaptive requires very long filter taps, whereas the proposed subband variable filter requires less taps with the spectrum split in subband. The computer simulation results reveals that in many case, in system identification with narrow band system estimation, the proposed adaptive filter has less computational complexities with faster convergence.

• Journal of Korea Multimedia Society
• /
• v.1 no.1
• /
• pp.90-97
• /
• 1998

In this paper, we propose a new variable length block cipher. It has a variable key length from 128-bit to 256-bit and uses a variable number of rounds. In each round, the proposed algorithm uses the double involution structure which consists of tow steps and two different F functions. In addition, the proposed algorithm has two different key schedulings for providing the strength against known attacks.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2001.10a
• /
• pp.175-182
• /
• 2001

Effective length factor approach for framed column design has long played an important design-aid role. This approach, however, is effective only when the columns are in the form of prismatic or uniform cross sections. Structural engineers who have to design or analyse framed columns with variable cross sections need some means to do their job. By using the finite element method, the stability analysis of the isolated compression members with variable cross sections and that of the framed columns are performed. The parameters considered in the stability analysis are taper and sectional property parameters of the columns, the second moment of inertia ratio of beam to column, and beam span to column height ratio. On the basis of the stability analysis results, effective length factor formulas for the columns with variable sections are derived.

• Journal of applied mathematics & informatics
• /
• v.31 no.1_2
• /
• pp.147-154
• /
• 2013

We analyze queueing model with priority scheduling by supplementary variable method. Customers are classified into two types (type-1 and type-2 ) according to their characteristics. Customers of each type arrive by independent Poisson processes, and all customers regardless of type have same general service time. The service order of each type is determined by the queue length of type-1 buffer. If the queue length of type-1 customer exceeds a threshold L, the service priority is given to the type-1 customer. Otherwise, the service priority is given to type-2 customer. Method of supplementary variable by remaining service time gives us information for queue length of two buffers. That is, we derive the differential difference equations for our queueing system. We obtain joint probability generating function for two queue lengths and the remaining service time. Also, the mean queue length of each buffer is derived.

• Journal of Korean Institute of Industrial Engineers
• /
• v.42 no.5
• /
• pp.304-313
• /
• 2016

This work suggests a new analysis approach for a discrete-time GI/G/1 queue with multiple vacations. The method used is called a modified supplementary variable technique and our result is an exact transform-free expression for the steady state queue length distribution. Utilizing this result, we propose a simple two-moment approximation for the queue length distribution. From this, approximations for the mean queue length and the probabilities of the number of customers in the system are also obtained. To evaluate the approximations, we conduct numerical experiments which show that our approximations are remarkably simple yet provide fairly good performance, especially for a Bernoulli arrival process.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.759-760
• /
• 2006

In this paper, The author designed on high speed VLD(Variable Length Decoder) using shift buffer. Variable Length Decoder is received N bit data from input block and decode the input signal using Shifting Buffer, Length Decoder and Symbol Decoder blocks. The inner part of shifting buffer in proposed Variable Length Decoder is filled input data and then operating therefore, the proposed structure can improve the decoded speed. And in this paper we applying pipeline structure therefore data is decoded in every clock.

• Structural Engineering and Mechanics
• /
• v.4 no.1
• /
• pp.49-59
• /
• 1996

This paper considers large deflection problem of a simply supported beam with variable are length subjected to a point load. The beam has one of its ends hinged and at a fixed distance from this end propped by a frictionless support over which the beam can slide freely. This highly nonlinear flexural problem is solved by elliptic-integral method and shooting-optimization technique, thereby providing independent checks on the new solutions. Because the beam can slide freely over the frictionless support, there is a maximum or critical load which the beam can carry and it is dependent on the position of the load. Interestingly, two possible equilibrium configurations can be obtained for a given load magnitude which is less than the critical value. The maximum arc-length was found to be equal to about 2.19 times the fixed distance between the supports and this value is independent of the load position.