• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.7 no.1
• /
• pp.89-95
• /
• 2006

Planning distributed manufacturing logistics is one of main issues in supply chain management. This paper proposes a hybrid heuristic approach for the Multi-Level, multi-item Capacitated Lot Sizing Problem (MLCLSP) in supply chain network. MLCLSP corresponds to a mixed integer programming (MIP) problem. With integer variable solutions determined by heuristic search, this MIP problem becomes linear program (LP). By repeatedly solving the relaxed MIP problems with a heuristic search method in a hybrid manner, this proposed approach allocates finite manufacturing resources fur each distributed facilities and generates feasible production plans. Meta heuristic search algorithm is presented to solve the MIP problems. The experimental test evaluates the computational performance under a variety of problem scenarios.

• Convergence Security Journal
• /
• v.18 no.2
• /
• pp.11-17
• /
• 2018

Lamport's one-time password (OTP) was originally proposed to address the weaknesses of a simple password system: fixed password, pre-shared password. However, a main weakness of Lamport's OTP is that a root hash value of a new hash chain should be re-registered after consuming all the hash values since OTP generation is based on the finite hash chain. Several studies have been conducted to solve these drawbacks, but new drawbacks such as increased burden of proof for verifiers and verifiers have been exposed. In this paper, we propose and compare a novel OTP that overlaps several short hash chains instead of one long hash chain, which is the core of existing Lamport OTP, to solve the drawbacks while maintaining the advantages of Lamport.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.11 no.1
• /
• pp.178-201
• /
• 2019

The appropriate design of a mooring system to maintain the position of an offshore structure in deep sea under various environmental loads is important. Fatigue design of the mooring line considering OPB/IPB(out-of-plane bending/in-plane bending) became an essential factor after the incident of premature fatigue failure of the mooring chain due to OPB/IPB in the Girassol region in West Africa. In this study, mooring line fatigue analysis was performed considering the OPB/IPB of a spread moored FPSO in deep sea. The tension of the mooring line was derived by hydrodynamic analysis using the de-coupled analysis method. The floater motion time histories were calculated under the assumption that the mooring line behaves in quasi-static manner. Additional time domain analysis was carried out by prescribing the obtained motions on top of the selected critical mooring line, which was determined based on spectral fatigue analysis. In addition, nonlinear finite element analysis was performed considering the material nonlinearities, and both the interlink stiffness and stress concentration factors were derived. The fatigue damage to the chain surface was estimated by combining both the hydrodynamic and stress analysis results.

• Journal of Advanced Marine Engineering and Technology
• /
• v.32 no.2
• /
• pp.343-350
• /
• 2008

In this paper, a six degree-of-freedom robot arm which is very light but capable of delivering heavy loads was studied. The proposed robot arm has much higher load capacity than conventional robot arms actuated by motors with speed reducers such as the harmonic drive since a new type of robot actuator based on a closed chain mechanism driven by the ball screw was adopted. Analysis on the design scheme and on the mechanism of the joint actuator of the robot arm were made. Since the robot arm was designed very light, it has deflection in the links. To analyze this, a finite element analysis on the structure of the designed robot links was made using ANSYS software. Verifying experiments on the performance of high load capacity of the robot arm was performed by loading heavy weights on the robot arm. Through experiments. the correctness of the numerical analysis was also verified.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.38 no.2
• /
• pp.137-144
• /
• 2001

In this paper, a state assignment algorithm was proposed to reduce power consumption in control-flow oriented finite state machines. The Markov chain model is used to reduce the switching activities, which closely relate with dynamic power dissipation in VLSI circuits. Based on the Markov probabilistic description model of finite state machines, the hamming distance between the codes of neighbor states was minimized. To express the switching activities, the cost function, which also accounts for the structure of a machine, is used. The proposed state assignment algorithm is tested with Logic Synthesis Benchmarks, and reduced the cost up to 57.42% compared to the Lakshmikant's algorithm.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.23 no.6
• /
• pp.641-649
• /
• 2010

Estimation of uncertain parameters is required in many engineering problems which involve probabilistic structural analysis as well as prognosis of existing structures. In this case, Bayesian framework is often employed, which is to represent the uncertainty of parameters in terms of probability distributions conditional on the provided data. The resulting form of distribution, however, is not amenable to the practical application due to its complex nature making the standard probability functions useless. In this study, Markov chain Monte Carlo (MCMC) method is proposed to overcome this difficulty, which is a modern computational technique for the efficient and straightforward estimation of parameters. Three case studies that implement the estimation are presented to illustrate the concept. The first one is an inverse estimation, in which the unknown input parameters are inversely estimated based on a finite number of measured response data. The next one is a metamodel uncertainty problem that arises when the original response function is approximated by a metamodel using a finite set of response values. The last one is a prognostics problem, in which the unknown parameters of the degradation model are estimated based on the monitored data.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.6
• /
• pp.1713-1726
• /
• 2018

We study the one-sided regularity of matrices in upper triangular matrix rings in relation with the structure of diagonal entries. We next consider a ring theoretic condition that ab being regular implies ba being also regular for elements a, b in a given ring. Rings with such a condition are said to be commutative at regular product (simply, CRP rings). CRP rings are shown to be contained in the class of directly finite rings, and we prove that if R is a directly finite ring that satisfies the descending chain condition for principal right ideals or principal left ideals, then R is CRP. We obtain in particular that the upper triangular matrix rings over commutative rings are CRP.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9B
• /
• pp.783-792
• /
• 2003

We consider a finite-buffer discrete-time queueing system with fixed-size bulk-service discipline: Geo/ $G^{B}$1/K＋B. The main purpose of this paper is to present a performance analysis of this system that has a wide range of applications in Asynchronous Transfer Mode (ATM) and other related telecommunication systems. For this purpose, we first derive the departure-epoch probabilities based on the embedded Markov chain method. Next, based on simple rate in and rate out argument, we present stable relationships for the steady-state probabilities of the queue length at different epochs: departure, random, and arrival. Finally, based on these relationships, we present various useful performance measures of interest such as the moments of number of packets in the system at three different epochs and the loss probability. The numerical results are presented for a deterministic service-time distribution - a case that has gained importance in recent years.s.

• Journal of the Korean Data and Information Science Society
• /
• v.23 no.6
• /
• pp.1241-1247
• /
• 2012

The paper considers empirical Bayes (EB) and hierarchical Bayes (HB) predictors of the finite population mean under a linear regression model with measurement errors We discuss how to calculate the mean squared prediction errors of the EB predictors using jackknife methods and the posterior standard deviations of the HB predictors based on the Markov Chain Monte Carlo methods. A simulation study is provided to illustrate the results of the preceding sections and compare the performances of the proposed procedures.

• Journal of applied mathematics & informatics
• /
• v.20 no.1_2
• /
• pp.409-420
• /
• 2006

In this paper we consider the set of all n + 1-tuples of real numbers, not necessarily all distinct, in the decreasing order from the unit interval under the usual ordering of real numbers, always including 1. Such n + 1-tuples inherently arise as the membership values of fuzzy subsets and are called keychains. An natural equivalence relation is introduced on this set and the equivalence classes of keychains are studied here. The number of such keychains is finite and the set of all keychains is a lattice under the coordinate-wise ordering. Thus keychains are subchains of a finite chain of real numbers in the unit interval. We study some of their properties and give some applications to counting fuzzy subsets of finite sets.