• 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.

• Water for future
• /
• v.28 no.5
• /
• pp.219-233
• /
• 1995

A non-stationary multivariate model is selected in which the mean and variance of rainfall are not temporally or spatially constant. And the rainfall prediction system is constructed which uses the recursive estimation algorithm, Kalman filter, to estimate system states and parameters of rainfall model simulataneously. The on-line, real-time, multivariate short-term, rainfall prediction for multi-stations and lead-times is carried out through the estimation of non-stationary mean and variance by the storm counter method, the normalized residual covariance and rainfall speed. The results of rainfall prediction system model agree with those generated by non-stationary multivariate model. The longer the lead time is, the larger the root mean square error becomes and the further the model efficiency decreases form 1. Thus, the accuracy of the rainfall prediction decreases as the lead time gets longer. Also it shows that the mean obtained by storm counter method constitutes the most significant part of the rainfall structure.

• Journal of Korea Multimedia Society
• /
• v.14 no.2
• /
• pp.288-294
• /
• 2011

In this paper we define the probability models for determining the disparity map given stereo images and derive the methods for solving the problem, which is proven to be equivalent to an energy-based stereo matching. Under the assumptions the difference between the pixel on the left image and the corresponding pixel on the right image and the difference between the disparities of the neighboring pixels are exponentially distributed, a recursive approach for estimating the MRF regularizing parameter is proposed. The proposed method alternates between estimating the parameters with the intermediate disparity map and estimating the disparity map with the estimated parameters, after computing it with random initial parameters. Our algorithm is applied to the stereo matching algorithms based on the dynamic programming and belief propagation to verify its operation and measure its performance.

• The KIPS Transactions:PartC
• /
• v.13C no.5 s.108
• /
• pp.567-574
• /
• 2006

VG-AnyLAN is a local area network standard developed by the IEEE 802.12 project. While preserving the frame format of IEEE 802.3, VG-AnyLAN adopts a new medium access control called Demand Priority where transmission requests of stations are arbitrated by a control hub in a round-robin manner. Unlike CSMA/CD which is the medium access control of IEEE 802.3, the Demand Priority, while providing the maximum bound on the packet delay, does not put the limit on the network segment size. In this paper, we analyze the delay and the channel utilization performances of the medium access control of IEEE 802.12 VG-AnyLAN. We develope an analytic model of the system under assumptions that each station generates traffic of the equal priority and that the packets are of fixed length. Using the analytic model, we obtain the recursive expression of the average channel utilization and the average access delay The numerical results obtained via analysis are compared to the simulation results of the system for a partial validation of our analysis.

• IE interfaces
• /
• v.13 no.3
• /
• pp.378-387
• /
• 2000

As the globalization of manufacturing companies continues, the scope of dependence between these companies and distributors, and other suppliers are growing very rapidly since no one company manufactures or distributes the whole product by themselves. And, the need to increase the efficiency of the whole supply chain is increasing. This paper deals with a multi-plant lot-sizing problem(MPLSP) which happens in a decentralized manufacturing system of a supply chain. In this study, we assume that the whole supply chain is driven by a single source of independent demand and many levels of dependent demands among manufacturing systems in the supply chain. We consider setup cost, transportation cost and time, and inventory holding cost as a decision factor in the MPLSP. The MPLSP is decomposed into two sub-problems: a planning problem of the whole supply chain and a lot-sizing problem of each manufacturing system. The supply chain planning problem becomes a pure linear programming problem and a Generalized Goal Decomposition method is used to solve the problem. Its result is used as a goal of the lot-sizing problem. The lot-sizing problem is solved using the CPLEX package, and then the coefficients of the planning problem are updated reflecting the lot-sizing solution. This procedure is repeated until termination criteria are met. The whole solution process is similar to Lagrangian relaxation method in the sense that the solutions are approaching the optimum in a recursive manner. Through experiments, the proposed closed-loop hierarchical planning and traditional hierarchical planning are compared to optimal solution, and it is shown that the proposed method is a very viable alternative for solving production planning problems of decentralized manufacturing systems and in other areas.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.18 no.1
• /
• pp.154-160
• /
• 2004

In this paper, implementation of active noise curtains using multiple channel adaptive filters is presented. The same numbers of single channel LMS algorithms as control loudspeakers is used instead of a multi-channel LMS algorithm to reduce the computational burden of adaptive filter algorithms. In general, a multi-channel LMS algorithm is usually used in active noise control system. but this algorithm has much more computational complexity. The single channel control techniques have less amount of DSP calculation, compared to multiple channel control techniques. A stabilizing procedure for adaptive IIR filters is also proposed to improve the stability of recursive LMS algorithms. Both experimental results of two control techniques using TMS320VC33 digital signal processor show the similar noise reduction, but the single channel control techniques are more efficient in practical active noise curtain applications

• Journal of Advanced Navigation Technology
• /
• v.19 no.6
• /
• pp.614-622
• /
• 2015

Binary MQ arithmetic coding is widely used recently as a basic entropy coder in multimedia coding system. MQ coder esteems high in compression efficiency to be used in JBIG2 and JPEG2000. The importance of arithmetic coding is increasing after it is adopted as an unique entropy coder in HEVC standard. In the binary MQ coder, arithmetic approximation without multiplication is used in the process of recursive subdivision of range interval. Because of the MPS/LPS exchange activity happened in MQ coder, output byte tends to increase. This paper proposes an enhanced binary MQ arithmetic coder to make use of a lookup table for AQe using quantization skill in order to reduce the deficiency. Experimental results show that about 4% improvement of compression in case of JBIG2 for bi-level image compression standard. And also, about 1% improvement of compression ratio is obtained in case of lossless JPEG2000 coding. For the lossy JPEG2000 coding, about 1% improvement of PSNR at the same compression ratio. Additionally, computational complexity is not increasing.

• 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.

• Journal of KIISE
• /
• v.44 no.4
• /
• pp.399-410
• /
• 2017

We present a system that automatically annotates unverified Web sentences with information from credible sources. The system turns to neural theorem proving for an annotating task for cancer related Wikipedia data (1,486 propositions) with Korean National Cancer Center data (19,304 propositions). By switching the recursive module in a neural theorem prover to a word embedding module, we overcome the fundamental problem of tremendous learning time. Within the identical environment, the original neural theorem prover was estimated to spend 233.9 days of learning time. In contrast, the revised neural theorem prover took only 102.1 minutes of learning time. We demonstrated that a neural theorem prover, which encodes a proposition in a tensor, includes a classic theorem prover for exact match and enables end-to-end differentiable logic for analogous words.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.05a
• /
• pp.155-160
• /
• 2003

This paper presents a multiple face detector based on a robust pupil detection technique. The pupil detector uses active illumination that exploits the retro-reflectivity property of eyes to facilitate detection. The detection range of this method is appropriate for interactive desktop and kiosk applications. Once the location of the pupil candidates are computed, the candidates are filtered and grouped into pairs that correspond to faces using heuristic rules. To demonstrate the robustness of the face detection technique, a dual mode face tracker was developed, which is initialized with the most salient detected face. Recursive estimators are used to guarantee the stability of the process and combine the measurements from the multi-face detector and a feature correlation tracker. The estimated position of the face is used to control a pan-tilt servo mechanism in real-time, that moves the camera to keep the tracked face always centered in the image.