• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.21 no.8
• /
• pp.1195-1208
• /
• 1997

Bellows is a component in piping systems which absorbs mechanical deformation with flexibility. Its geometry is an axial symmetric shell which consists of two toroidal shells and one annular plate or conical shell. In order to analyze bellows, this study presents the finite element analysis using a conical frustum shell element. A finite element analysis is developed to analyze various bellows. The validity of the developed program is verified by the experimental results for axial and lateral stiffness. The formula for calculating the natural frequency of bellows is made by the simple beam theory. The formula for fatigue life is also derived by experiments. The shape optimal design problem is formulated using multiple objective optimization. The multiple objective functions are transformed to a scalar function by weighting factors. The stiffness, strength and specified stiffness are considered as the multiple objective function. The formulation has inequality constraints imposed on the fatigue limit, the natural frequencies, and the manufacturing conditions. Geometric parameters of bellows are the design variables. The recursive quadratic programming algorithm is selected to solve the problem. The results are compared to existing bellows, and the characteristics of bellows is investigated through optimal design process. The optimized shape of bellows is expected to give quite a good guideline to practical design.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.5 no.1
• /
• pp.3-16
• /
• 1995

In this paper, we deal with the cryptographic properties of Boolean functions generated by recursively extended methods from the points of balancedness, nonlinearity and correlation properties. First, we propose a new concept 'Strict Uncorrelated Criterion(SUC)' for two Boolean functions as a necessary condition for constructing Boolean functions of S-box which can be guaranteed to be resistant against Differential cryptanalysis, then we show that the recurively extended Boolean functions with particular form preserve the SUC. We also examine the correlation properties of Boolean functions using Walsh-Hadamard transformations and apply them to discuss nonlinearity, correlation properties and SUC of semi-bent function which is defined over odd dimensional vector space. Finally, we compare semi-bent function with Boolean functions which are generated by other similar recursive methods.

• Journal of Broadcast Engineering
• /
• v.9 no.1
• /
• pp.17-31
• /
• 2004

This paper proposes an algorithm for the robust transmission of video in error Prone environment using multiple description codingby optimal split of DCT coefficients and rate-distortionoptimization framework. In MDC, a source signal is split Into several coded streams, which is called descriptions, and each description is transmitted to the decoder through different channel. Between descriptions, structured correlations are introduced at the encoder, and the decoder exploits this correlation to reconstruct the original signal even if some descriptions are missing. It has been shown that the MDC is more resilient than the singe description coding(SDC) against severe packet loss ratecondition. But the excessive redundancy in MDC, i.e., the correlation between the descriptions, degrades the RD performance under low PLR condition. To overcome this Problem of MDC, we propose a hybrid MDC method that controls the SDC/MDC switching according to channel condition. For example, the SDC is used for coding efficiency at low PLR condition and the MDC is used for the error resilience at high PLR condition. To control the SDC/MDC switching in the optimal way, RD optimization framework are used. Lagrange optimization technique minimizes the RD-based cost function, D+M, where R is the actually coded bit rate and D is the estimated distortion. The recursive optimal pet-pixel estimatetechnique is adopted to estimate accurate the decoder distortion. Experimental results show that the proposed optimal split of DCT coefficients and SD/MD switching algorithm is more effective than the conventional MU algorithms in low PLR conditions as well as In high PLR condition.

• The Journal of the Korea Contents Association
• /
• v.11 no.8
• /
• pp.475-487
• /
• 2011

In this paper, we present a systematic method to derive spectrum of high-order pulse and a novel design of e-Learning system that deals with deriving the spectrum using concept-based branching method. Spectrum of high-order pulse can be derived using conventional methods including 'Consecutive Differentiations' or 'Convolutions', however, their complexity of calculation should be too high to be used as the order of the pulse increase. We develop a recursive algorithm according to the order of pulse, and then derive the formula of spectrum connected to the order with a newly designed look-up table. Moving along, we design an e-Learning content for studying the procedure of deriving high-order pulse spectrum described above. In this authoring, we use the concept-based object branching method including conventional page or title-type branching in sequential playing. We design all four Content-pages divided into 'Modeling', 'Impulse Response and Transfer Function', 'Parameters' and 'Look-up Table' by these conceptual objects. And modules and sub-modules are constructed hierarchically as conceptual elements from the Content-pages. Students can easily approach to the core concepts of the analysis because of the effects of our new teaching method. We offer step-by-step processes of the e-Learning content through unit-based branching scheme for difficult modules and sub-modules in our system. In addition we can offer repetitive learning processes for necessary block of given learning objects. Moreover, this method of constructing content will be considered as an advanced effectiveness of content itself.

• Journal of KIISE:Software and Applications
• /
• v.35 no.10
• /
• pp.636-652
• /
• 2008

In this paper, we present a modular pointer analysis algorithm based on the update history. We use the term 'module' to mean a set of mutually recursive procedures and the term 'modular analysis' to mean a program analysis that does not need the source codes of the other modules to analyze a module. Since a modular pointer analysis does not utilize any information on the callers, it is difficult to design a precise analysis that does not lose the information related to the program flow or the calling context. In this paper, we propose a modular and flow- and context-sensitive pointer analysis algorithm based on the update history that can memory states of a procedure independently of the information on the calling context and keep the information on the order of side effects performed. Such a memory representation not only enables the analysis to be formalized as a modular analysis, but also helps the analysis to effectively identify killed side effects and relevant alias contexts.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.35 no.3
• /
• pp.299-308
• /
• 2011

In this study, we develop a pressure observer to measure the cylinder length of a harbor-construction robot. For the robot control, sensors are required to measure the length of a hydraulic cylinder. The cylinder-position sensor is relatively expensive when the operating environment prohibits external approaches for the measurement of the cylinder position. LVDT or linear scales are usually mounted on the outside of the cylinder, which causes poor durability on a construction site. We use a pressure sensor to indirectly estimate the length of the cylinder. The pressure sensor is mounted inside a hydraulic valve box so that it is protected by the box and easy to waterproof for an underwater robot. By treating oil as a compressible fluid, we derive the nonlinear pressure dynamics as a function of the cylinder position, velocity, and pressure. The recursive least squares (RLS) algorithm is applied to identify the dynamic parameters, and the pressure observer estimates the cylinder position through the pressure acting on the head and the rod of the hydraulic cylinder. The position accuracy is relatively low, but it is acceptable for a construction robot that handles large armor stones.

• Journal of IKEEE
• /
• v.8 no.1 s.14
• /
• pp.128-135
• /
• 2004

This paper proposes a phase measurement algorithm which is based on the recursive implementation of sliding-DFT. The algorithm is designed to have a robust behavior against the erroneous factors of frequency drift, additive noise, and twiddle factor approximation. The size of phase error caused by the finite wordlength implementation of DFT twiddle factors is shown significantly lower than that of magnitude error. The drastic reduction of the phase error is achieved by the exploitation of the quadruplet symmetry characteristics of the approximated twiddle factors in the complex plane. Four channel power-line phase measurement system is also designed and implemented based on the time-multiplexed sharing architecture of the proposed algorithm. The operation of the developed system is also verified by the experiment performed under the test environment implemented with the multi-channel function generator and the on-line interfaced host processor system. The proposed algorithm's features of phase measurement accuracy and its robustness against the finite wordlength effects can provide a significant impact especially for the ASIC or microprocessor based embedded system applications where the enhanced processing speed and implementation simplicity are crucial design considerations.

• Journal of Broadcast Engineering
• /
• v.5 no.1
• /
• pp.68-81
• /
• 2000

This paper proposes a single metric to measure and evaluate the retrieval effectiveness of image database retrieval system that requires an ordered ranking. There are four conditions to be a good ranking system. First, the number of relevant images among the retrieved should be as large as possible. Secondly, the number of irrelevant images should be smaller. Third, the average rank of relevant images should be higher. Last, the relevant images should be clustered close together. The conventional evaluation measures only reflect a part of the conditions listed above, and the evaluated results are coarse or inaccurate. The proposed NDS, however, resolves all those problems. In order to prove the efficiency of the NDS, we generate patterns of ${\_nC_r(_10C_5=252, _20C_9=167,960)}$ to evaluate and compare with other measures. The patterns were generated automatically by a recursive function call on the assumption the 'r' relevant images are retrieved within the range of 'n'.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.6
• /
• pp.1369-1375
• /
• 2012

One of important problems in the theory of sequences is to determine the values and number of occurrences of each value taken on by the cross-correlation. In this paper, we find the values and the number of occurrences of each value of cross-correlation between an m-sequence u(t) of period $2^n-1$ and its decimation $u(dt)(0{\leq}t{\leq}2^n-2)$ where n=2m, 2s|m and $d=(2^{2m}+2^{2s+1}-2^{m+s+1}-1)/(2^s-1)$. Also we show that a family of decimations leads to a four-valued cross-correlation.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.3
• /
• pp.282-291
• /
• 2001

In this paper, an efficient VLSI architecture of Shape Adaptive Discrete Cosine Transform(SADCT) based on systolic array is proposed. Since transform size in SADCT is varied according to the shape of object in each block, it are dropped that both usability of processing elements(PE´s) and throughput rate in time-recursive SADCT structure. To overcome these disadvantages, it is proposed that the architecture based on a systolic way structure which doesn´t need memory. In the proposed architecture, throughput rate is improved by consecutive processing of one-dimensional SADCT without memory and PE´s in the first column are connected to that in the last one for improvement of usability of PE. And input data are put into each column of PE in parallel according to the maximum data number in each rearranged block. The proposed architecture is described by VHDL. Also, its function is evaluated by MentorTM. Even though the hardware complexity is somewhat increased, the throughput rate is improved about twofold.