• Korean Management Science Review
• /
• v.31 no.2
• /
• pp.1-13
• /
• 2014

In almost all of the organizations, the cost for acquiring and maintaining the inventory takes a considerable portion of the management budget, and thus a certain constraint is set upon the budget itself. The previous studies on inventory control for each item that aimed to improve the fill rate, backorder, and the expenditure on inventory are fitting for the commercially-operated SCM, but show some discrepancies when they are applied to the spare parts for repairing disabled systems. Therefore, many studies on systematic approach concept considering spare parts of various kinds simultaneously have been conducted to achieve effective performance for the inventory control at a lower cost, and primarily, METRIC series models can be named. However, the past studies were limited when dealing with the probability distributions for representing the situation on demand and transportation of the parts, with the (S-1, S) inventory control policy, and so on. To address these shortcomings, the Continuous Time Markov Chain (CTMC) model, which considers the phase-type distributions and the (s, Q) inventory control policies to best describe the real-world situations inclusively, is presented in this study. Additionally, by considering the cost versus the system availability, the optimization of the inventory level, based on this model, is also covered.

• Journal of information and communication convergence engineering
• /
• v.9 no.2
• /
• pp.244-250
• /
• 2011

Gossip is a well-known protocol which was proposed to implement broadcast service with a high reliability in an arbitrarily connected network of sensor nodes. The probabilistic techniques employed in gossip have been used to address many challenges which are caused by flooding in wireless sensor networks (WSNs). However, very little work has yet been done on real-time wireless sensor networks which require not only highly reliable packets reception but also strict time constraint of each packet. Moreover, the unique energy constraining feature of sensor makes existing solutions unsuitable. Combined with unreliable links, redundant messages overhead in real-time wireless sensor networks is a new challenging issue. In this paper, we introduce a Reliable Gossip Zone, a novel fine-tailored mechanism for real-time wireless sensor networks with unreliable wireless links and low packet redundancy. The key idea is the proposed forwarding probability algorithm, which makes forwarding decisions after the realtime flooding zone is set. Evaluation shows that as an oracle broadcast service design, our mechanism achieves significantly less message overhead than traditional flooding and gossip protocols.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.64 no.7
• /
• pp.984-991
• /
• 2015

This paper presents the methodology for optimal design of power grid for offshore wind power plant (OWPP) and optimum location of offshore substation. The proposed optimization process is based on a genetic algorithm, where the objective cost model is composed of investment, power loss, repair, and reliability cost using the net present value during the whole OWPP life cycle. A probability wind power output is modeled to reflect the characteristics of a wind power plant that produces electricity through wind and to calculate the reliability cost called expected energy not supplied. The main objective is to find the minimum cost for grid connection topology by submarine cables which cannot cross each other. Cable crossing was set as a constraint in the optimization algorithm of grid topology of the wind power plant. On the basis of this method, a case study is conducted to validate the model by simulating a 100-MW OWF.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.768-772
• /
• 2009

This paper proposes a method for measurement three-dimensional trajectories of bubbles generated around a swimmer's arms from stereo high-speed camera videos. This method is based on two techniques: two-dimensional trajectory estimation in single-camera images and trajectory pair matching in stereo-camera images. The two-dimensional trajectory is estimated by block matching using similarity of bubble shape and probability of bubble displacement. The trajectory matching is achieved by a consistensy test using epipolar constraint in multiple frames. The experimental results in two-dimensional trajectory estimation showed the estimation accuracy of 47% solely by the general optical flow estimation, whereas 71% taking the bubble displacement into consideration. This concludes bubble displacement is an efficient aspect in this estimation. In three-dimensional trajectory estimation, bubbles were visually captured moving along the flow generated by an arm; which means an efficient material for swimmers to swim faster.

• Journal of Communications and Networks
• /
• v.10 no.1
• /
• pp.28-37
• /
• 2008

In this paper, we investigate the problem of minimizing the average transmission power of users while guaranteeing the average delay constraints in time-varying uplink channels. We design a scheduler that selects a user for transmission and determines the transmission rate of the selected user based on the channel and backlog information of users. Since it requires prohibitively high computation complexity to determine an optimal scheduler for multi-user systems, we propose a low-complexity scheduling scheme that can achieve near-optimal performance. In this scheme, we reduce the complexity by decomposing the multiuser problem into multiple individual user problems. We arrange the probability of selecting each user such that it can be determined only by the information of the corresponding user and then optimize the transmission rate of each user independently. We solve the user problem by using a dynamic programming approach and analyze the upper and lower bounds of average transmission power and average delay, respectively. In addition, we investigate the effects of the user selection algorithm on the performance for different channel models. We show that a channel-adaptive user selection algorithm can improve the energy efficiency under uncorrelated channels but the gain is obtainable only for loose delay requirements in the case of correlated channels. Based on this, we propose a user selection algorithm that adapts itself to both the channel condition and the backlog level, which turns out to be energy-efficient over wide range of delay requirement regardless of the channel model.

• International Journal of Automotive Technology
• /
• v.8 no.1
• /
• pp.93-102
• /
• 2007

The frontal crash optimization of an engine room member using the response surface method was studied. The engine room member is composed of the front side member and the sub-frame. The thicknesses of the panels on the front side member and the sub-frame were selected as the design variables. The purpose of the optimization was to reduce the weight of the structure, under the constraint that the objective quantity of crash energy is absorbed. The response surface method was used to approximate the crash behavior in mathematical form for optimization procedure. To research the effect of the regression method, two different methodologies were used in constructing the response surface model, the least square method and the moving least square method. The optimum with the two methods was verified by the simulation result. The precision of the surrogate model affected the optimal design. The moving least square method showed better approximation than the least square method. In addition to the deterministic optimization, the reliability-based design optimization using the response surface method was executed to examine the effect of uncertainties in design variables. The requirement for reliability made the optimal structure be heavier than the result of the deterministic optimization. Compared with the deterministic optimum, the optimal design using the reliability-based design optimization showed higher crash energy absorption and little probability of failure in achieving the objective.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.12
• /
• pp.3018-3036
• /
• 2013

In this paper, we investigate power allocation scheme and outage performance for a physical-layer network coding (PNC) relay based secondary user (SU) communication in cognitive multi-antenna relay networks (CMRNs), in which two secondary transceivers exchange their information via a multi-antenna relay using PNC protocol. We propose an optimal energy-efficient power allocation (OE-PA) scheme to minimize total energy consumption per bit under the sum rate constraint and interference power threshold (IPT) constraints. A closed-form solution for optimal allocation of transmit power among the SU nodes, as well as the outage probability of the cognitive relay system, are then derived analytically and confirmed by numerical results. Numerical simulations demonstrate the PNC protocol has superiority in energy efficiency performance over conventional direct transmission protocol and Four-Time-Slot (4TS) Decode-and-Forward (DF) relay protocol, and the proposed system has the optimal outage performance when the relay is located at the center of two secondary transceivers.

• Journal of Korean Society for Quality Management
• /
• v.18 no.1
• /
• pp.129-147
• /
• 1990

This study is to refer to the optimization problems when the stress and strength follow the time dependent model, considering a decision making process in the design methodology from reliability viewpoint. Reliability of a component can be expressed and computed if the probability distributions for the stress and strength in the time dependent case are known. The factors which determine the parameters of the distributions for stress and strength random variables can be controlled in design problems. This leads to the problem of finding the optimal values of these parameters subject to resources and design constraints. This paper is to present techniques for solving the optimization problems at the design stage like as minimizing the total cost to be spent on controlling the stress and strength parameters for random variables subject to the constraint that the component must have a specified reliability, alternatively, maximizing the component reliability subject to certain constraints on amount of resources available to control the parameters. The derived expressions and computations of reliability in the time dependent case and some optimization models of these cases are discussed. The special structure of these models is exploited to develop the optimization techniques which are illustrated by design examples.

• Land and Housing Review
• /
• v.11 no.2
• /
• pp.1-14
• /
• 2020

The aim of this study is to empirically identify the differentiating characteristics of determinant factors on sing-person households' commuting mode choice compared to multi-person households' one in order to establish the customized police directions to decrease private car use in commuting. While the study use the 2% sample survey data on the population and housing in 2015, it employ multinomial logit models on relative choice probability of such alternative commuting modes as bus, subway or rail, and walking, rather than driving. As potential determinant factors, the study employs demographic, socio-economic, and housing and residential one for both models of single-person and multi-person households. The study finds that the behavior of commuting mode choice has distinctive difference by gender, marriage status, physical activity constraint, job type, residential period in current housing of the single-person household's workers compared to the multi-person households' ones. Based on the findings, the study deduce ten commuting policy directions customized for the single-person household.

• 한국정보컨버전스학회:학술대회논문집
• /
• 2008.06a
• /
• pp.199-204
• /
• 2008

Sensor nodes have various energy and computational constraints because of their inexpensive nature and ad-hoc method of deployment. Considerable research has been focused at overcoming these deficiencies through faster media accessing, more energy efficient routing, localization algorithms and system design. Our research attempts to provide a method of improvement MAC performance in these issues. We show that traditional carrier-sense multiple access(CSMA) protocols like IEEE 802.11 do not handle the first constraint adequately, and do not take advantage of the second property, leading to degraded latency and throughput as the network scales in size, We present more efficient method of a medium access for real-time wireless sensor networks. Proposed MAC protocol is a randomized CSMA protocol, but unlike previous legacy protocols, does not use a time-varying contention window from which a node randomly picks a transmission slot. To reduce the latency for the delivery of event reports, it carefully decides a fixed-size contention window, non-uniform probability distribution of transmitting in each slot within the window. We show that it can offer up to several times latency reduction compared to legacy of IEEE 802.11 as the size of the sensor network scales up to 256 nodes using widely used simulator ns-2. We, finally show that proposed MAC scheme comes close to meeting bounds on the best latency achievable by a decentralized CSMA-based MAC protocol for real-time wireless sensor networks which is sensitive to latency.