• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1991.10a
• /
• pp.147-159
• /
• 1991

Stochastic convexity(concvity) of a stochastic process is a very useful concept for various stochastic optimization problems. In this study we first establish stochastic convexity of a certain class of Markov additive processes through the probabilistic construction based on the sample path approach. A Markov additive process is obtained by integrating a functional of the underlying Markov process with respect to time, and its stochastic convexity can be utilized to provide efficient methods for optimal design or for optimal operation schedule of a wide range of stochastic systems. We also clarify the conditions for stochatic monotonicity of the Markov process, which is required for stochatic convexity of the Markov additive process. This result shows that stochastic convexity can be used for the analysis of probabilistic models based on birth and death processes, which have very wide application area. Finally we demonstrate the validity and usefulness of the theoretical results by developing efficient methods for the optimal replacement scheduling based on the stochastic convexity property.

• Korean Management Science Review
• /
• v.12 no.3
• /
• pp.97-115
• /
• 1995

Information sharing and automated office in the use of PC necessitate corporate network to implement business innovation. Building an efficient network requires competent knowledge on capabilities of various LAN technologies, hardwares and softwares that have rapidly improved in terms of efficiency and cost. This paper compares capabilities of network components: communication protocol, hardware, network operation system, low cost database software and mid-range priced SQL for application development. Also this study presents a new technology on virtual LAN and a selection guide among the various options of the network components which are suitable for PC-based small-sized network in balance of efficiency with economy. In the last section of this paper, a case of small-sized network is given for illustration.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.16 no.1
• /
• pp.76-88
• /
• 1991

Stochastic convexity (concavity) of a stochastic process is a very useful concept for various stochastic optimization problems. In this study we first establish stochastic convexity of a certain class of Markov additive processes through probabilistic construction based on the sample path approach. A Markov additive process is abtained by integrating a functional of the underlying Markov process with respect to time, and its stochastic convexity can be utilized to provide efficient methods for optimal design or optimal operation schedule wide range of stochastic systems. We also clarify the conditions for stochastic monotonicity of the Markov process. From the result it is shown that stachstic convexity can be used for the analysis of probabilitic models based on birth and death processes, which have very wide applications area. Finally we demonstrate the validity and usefulness of the theoretical results by developing efficient methods for the optimal replacement scheduling based on the stochastic convexity property.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.10 no.4
• /
• pp.117-125
• /
• 2014

In this paper, a novel hardware architecture of the LT codec is presented where non-BP based decoding algorithm is applied. Novel LT codec architecture is designed with an efficient degree distribution unit using Verilog HDL. To perform permutation operation, different initial valued or time shifted counters have been used to get pretty well permutations and an effect of randomness. The codec will take 128 bits as input and produce 256 encoded output bits. The simulation results show expected performances as the implemented distribution and the original distribution are pretty same. The proposed LT codec takes 257.5 cycle counts and $2.575{\mu}s$ for encoding and decoding instead of 5,204,861 minimum cycle counts and 4.43s of the design mentioned in the previous works where iterative soft BP decoding was used in ASIC and ASIP implementation of the LT codec.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.18 no.1
• /
• pp.1-9
• /
• 2022

Galois field arithmetic is important in error correcting codes and public-key cryptography schemes. Hardware realization of these schemes requires an efficient implementation of Galois field arithmetic operations. Multiplication is the main finite field operation and designing efficient multiplier can clearly affect the performance of compute-intensive applications. Diverse algorithms and hardware architectures are presented in the literature for hardware realization of Galois field multiplication to acquire a reduction in time and area. This paper presents a low complexity semi-systolic multiplier to facilitate parallel processing by partitioning Montgomery modular multiplication (MMM) into two independent and identical units and two-level systolic computation scheme. Analytical results indicate that the proposed multiplier achieves lower area-time (AT) complexity compared to related multipliers. Moreover, the proposed method has regularity, concurrency, and modularity, and thus is well suited for VLSI implementation. It can be applied as a core circuit for multiplication and division/exponentiation.

• Journal of the Korean Society of Safety
• /
• v.19 no.2
• /
• pp.75-87
• /
• 2004

This study suggests a safety management model for construction management (CM) suitable to domestic conditions so that inefficiency resulted from the operation of construction projects by public and private indtitutes according to different systems can be eliminated for the securing of systematic and efficient safety managment. Based on the suggested safety management model, this study also develops a safety management information system that can efficiently and consistently manage and maintain a large quantity of information, and give necessary supports in a speedy way in the managing of construction projects.

• Journal of the Korea Safety Management & Science
• /
• v.7 no.1
• /
• pp.25-44
• /
• 2005

Safety management cost, $US\$$ one thousand billion has been input to the construction area from 1995 to 2000 but the management quality is still in the developing country level. The above mentioned increase of accident rate are attributed to the generous code regulation, net fit to the sense, varying with time change, but the more fundamental reason of this is no practical construction safety management system, up to now. Hardware-orienting operation for the system could be a main reason of this problem. In this paper, we developed a model for efficient construction safety system. It was found from the case study that the A Study on Introduction Application of Occupational Health & Safety Management System for Construction Industry.

• Proceedings of the KSR Conference
• /
• 2011.10a
• /
• pp.3312-3317
• /
• 2011

Recently, the demand regarding reliability and safety of the railroad are increased as built to Driverless LRT system. Therefore, PM and SE technique is applied for efficient management of a construction business. In case of SE(System Engineering) in domestic, most foreign companies are doing to lead but we are under effort for the environment that a domestic company can lead. In this study, We emphasize to SE importance of pre-business for operation to be effective of Driveless LRT system, and propose about activities in the SE at requirements definitions and requirements analysis steps of a highest level. To achieve this, We propose SE Application Methods of Pre-Business regarding assistance process of project planning, evaluation and control, and risk management.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.33 no.4
• /
• pp.138-144
• /
• 2010

This research deals with multiple Gantry-type assembly machines for the optimization of PCB assembly line. The automated assembly machine has 6 nozzles which can linearly move the X axis and the Y axis different from the turret type assembly machine. Each machine is optimized while considering the whole line balancing of three machines in assembly process simultaneously. Simulation models are developed using AutoMod for comparison study with single machine operation cases under various conditions such as types and total number of components to evaluate the proposed method.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.138-141
• /
• 2006

This paper considers a two-machine flow-shop scheduling problem for minimizing mean flow time. Each job has three non-preemptive operations, where the first and third operations must be Processed on the first and second machines, respectively, but the second operation can be processed on either machine. A lower bound based on SPT rule is derived, which is then used to develop a branch-and-bound algorithm. Also, an efficient simple heuristic algorithm is developed to generate a near-optimal schedule. Numerical experiments are performed to evaluate the performances of the proposed branch-and-bound and the heuristic algorithm