• The Journal of Korean Academy of Prosthodontics
• /
• v.36 no.4
• /
• pp.615-643
• /
• 1998

The purpose of this study was to evaluate the effect of cantilever length, load, and implant number on the stress distribution of implant supported fixed prosthesis. In the replica of an edentulous human mandible, four or five implants were placed and spaced evenly between the mental foramina and symmetrical gold alloy cast superstructures with cantilever were fabricated. Strain gauges were placed in buccal and lingual side of implants. 9, 15, 21kg of loads at varying cantilever lengths were applied to the occlusal surface of fixed prostheses. The strains were recorded from each gauge and principal stresses were calculated The results were as follows : 1. Increasing the length of the cantilever increased the stresses on the bone supporting implants. and the ratio of increase became high as increasing the load. 2. In the model with four implants, the highest compressive stress was measured on lingual side of the first implants nearest loading point and the highest tensile stress was measured on buccal side of the second implants. 3. In the model with five implants, the highest compressive stress was measured on lingual side of the first implants nearest loading point. And the highest tensile stress was measured on buccal side of the second implants, and lingual side of the third implants. 4. There was no significant change of the magnitude of stress on the most distal imp]ant of non cantilevered side as increasing the cantilever length or load. 5. In general, the superstructure supported by five implants reduced the stress and was less affected by cantilever length compared to the support provided by four implants.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.2
• /
• pp.41-47
• /
• 2016

The times of multiplication for encryption and decryption of cryptosystem is primarily determined by implementation efficiency of the modular exponentiation of $a^b$(mod m). The most frequently used among standard modular exponentiation methods is a standard binary method, of which n-ary($2{\leq}n{\leq}6$) is most popular. The n-ary($1{\leq}n{\leq}6$) is a square-and-multiply method which partitions $b=b_kb_{k-1}{\cdots}b_1b_{0(2)}$ into n fixed bits from right to left and squares n times and multiplies bit values. This paper proposes a variable-length partition algorithm that partitions $b_{k-1}{\cdots}b_1b_{0(2)}$ from left to right. The proposed algorithm has proved to reduce the multiplication frequency of the fixed-length partition n-ary method.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.462-467
• /
• 2003

As for control systems, many researchers give optimal structures of the finite-word-length compensator. D. Williamson solved a fixed-point case against colored noise for the LQG problem. Recently, one of the authors derived an optimal filter against colored noise. And consequently, we apply the result to a twodegree-of-freedom control system in this paper. In addition the perturbation of the coefficients is considered. Furthermore, simulation results indicate this method gives better than other structures.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.159-162
• /
• 2005

Random Early Detection (RED), one of the most well-known Active Queue Management (AQM), has been designed to substitute Tail Drop and is nowadays widely implemented in commercially available routers. RED algorithm provides high throughput and low delay as well as a solution of global synchronization. However RED is sensitive to parameters setting, so the performance of RED, significantly depends on the fixed parameters. To solve this problem, the Adaptive RED (ARED) algorithm is suggested by S. Floyd. But, ARED also uses fixed parameters like target-queue length; it is hard to respond to bursty traffic actively. In this paper, we proposed AQM algorithm based on the variation of current queue length in order to improve adaptability about burst traffic. We measured performance of proposed algorithm through a throughput, marking-drop rate and bias phenomenon. In experimentation, we raised a packet throughput as reduced packet drop rate, and we confirmed to reduce a bias phenomenon about bursty traffic.

• Journal of Power System Engineering
• /
• v.15 no.1
• /
• pp.57-63
• /
• 2011

It is very important to determine link composition of a crane in the basic design of the crane. There are many parameters in the design for the link composition of a double link type level luffing jib crane. We analyze the variation of link composition according to the variation of these parameters which are the angle of fixed link, the angle between the fixed link and backstay when the position of the crane is the maximum working radius, the ratio of fly jib length between two moving hinges to the total length of fly jib, the length of backstay, and the slewing radius. In this paper, we describe the application of the previous analysis program of the link composition design for a double link type level luffing jib crane.

• Journal of Communications and Networks
• /
• v.14 no.4
• /
• pp.429-433
• /
• 2012

In this paper, we consider nonbinary quasi-cyclic low-density parity-check (QC-LDPC) codes and propose a method to design multiple rate codes with either fixed information bit length or block bit length, tailored to different scenarios in wireless applications. We show that the proposed codes achieve good performance over a broad range of code rates.

• New & Renewable Energy
• /
• v.5 no.1
• /
• pp.40-46
• /
• 2009

Optimization of a rectangular profile annular fin with variable pipe inside radius is presented. This optimum procedure is based on fixed fin height and is made by using variables separation method. The optimum heat loss, corresponding optimum fin length and optimum fin efficiency are presented as a function of pipe inside radius, fin half height, inside fluid convection characteristic number and ambient convection characteristic number. One of results shows that the optimum fin length increases linearly with increase of pipe inside radius for fixed fin height and fin base radius.

• ETRI Journal
• /
• v.24 no.2
• /
• pp.142-152
• /
• 2002

In this paper, we propose and analyze a new multiple access protocol for a local area optical Internet based on a wavelength division multiplexing technique which uses a passive star coupler. The proposed contention-based reservation protocol can support variable-length as well as fixed-length messages for transporting Internet packets with one reservation of a minislot at the beginning of a packet transmission. The minislot is used to reserve the data channel on the basis of the slotted ALOHA protocol and the control node ensures subsequent message transmission on the same wavelength. Thus, all messages need not be broken down to many fixed-length packets, and consecutive messages are transmitted through the same wavelength. Moreover, the proposed protocol reduces the collision probability of minislots and improves wavelength utilization. We determine the maximum throughput and verify the results with simulation.

• Journal of Information Processing Systems
• /
• v.6 no.4
• /
• pp.453-480
• /
• 2010

Cryptographic hash functions reduce inputs of arbitrary or very large length to a short string of fixed length. All hash function designs start from a compression function with fixed length inputs. The compression function itself is designed from scratch, or derived from a block cipher or a permutation. The most common procedure to extend the domain of a compression function in order to obtain a hash function is a simple linear iteration; however, some variants use multiple iterations or a tree structure that allows for parallelism. This paper presents a survey of 17 extenders in the literature. It considers the natural question whether these preserve the security properties of the compression function, and more in particular collision resistance, second preimage resistance, preimage resistance and the pseudo-random oracle property.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.1
• /
• pp.111-119
• /
• 1994

In this paper we propose a reversible image coding methods with progressive build-up function by bit-plane of multi-lavel image. Firstly, the differencial conversion is applied to reduce the entropy of source images. Then the bit-plane sequences of converted images are coded by means of the newly designed VFRL(Variable to Fixed Run-Llength) code and the RDHC(Run-length Dynamic Huffman Coding). We aim to the simple construction to reduce the complexity. The computer simulated results show that the proposed methods are very effective to the multi-level digital images. For "GIRL" and "COUPLE" of 1EEE monochromatic standard images, the compressibility are superior to the results obtained by the well-known universal codes.own universal codes.