• 한국정밀공학회지
• /
• 제18권6호
• /
• pp.127-132
• /
• 2001

An automatic design system for a hydraulic gate has been developed to cut down the time for the design calculation and to optimize its design. It is oriented to the radial gate which is the simplest, most reliable, least expensive and most widely used hydraulic gate. This system is composed of data input, strength computation and result display modules with databases of the properties of components and materials. In this development, the existing intricate design procedure has been changed to the straightforward procedure without assumption of weight. With this code, the design time of the radial gate could be reduced below one thirtieth in comparison with manual work and the optimum design could be accomplished easily.

• 한국정밀공학회지
• /
• 제20권1호
• /
• pp.118-125
• /
• 2003

As consumer's desire becomes various, agility of mold manufacturing is the most important factor for competitive mold manufacturer. Decision making process is required to produce optimal result of CAM systems in using commercial CAM system to generate tool path. The paper proposes a methodology fur computer-assisted tool selection procedures for various cutting type of rough, semi-rough and finish cuts. The procedure provides assistance for machining tool selection by analyzing sliced CAD model section of die cavity and core. Information about machining time for the generated NC-code is used to aid the tool selection. The module is developed with commercial CAM API. This module will be used fur the optimization of tool selection and planning process.

• 대한산업공학회지
• /
• 제38권1호
• /
• pp.17-24
• /
• 2012

We address some potential problems with the existing procedures of outlier detection in time series. Also we propose modifications in estimating model parameters and outlier effects in order to reduce the number of tests and to increase the detection accuracy. Experiments with some artificial data sets show that the proposed procedure significantly reduces the number of tests and enhances the accuracy of estimated parameters as well as the detection power.

• 한국항공운항학회지
• /
• 제13권4호
• /
• pp.29-42
• /
• 2005

The passenger security screening is a mandatory procedure for boarding the aircraft according to ICAO standard as well as national law of each country. The enhanced threat of terrorism have had the security procedure strengthened since 9/11 events. However the effectiveness of passenger screening is not satisfactory and the service level for passenger is getting worse because of tightened security measurements. This research studied the responsibility issue for the enhancement of the effectiveness and service quality in passenger security screening. The study concluded that a desirable responsibility assignment for passenger screening is to the airport authority at normal time and to the government authority at the time of high threat.

• 경영과학
• /
• 제10권2호
• /
• pp.27-42
• /
• 1993

Markov chain models can be used to predict the state of the system in the future. We extend the existing Markov chain models in two ways. For the stationary model, we propose a procedure that obtains the transition probabilities by appling the empirical Bayes method, in which the parameters of the prior distribution in the Bayes estimator are obtained on the collaternal micro data. For non-stationary model, we suggest a procedure that obtains a time-varying transition probabilities as a function of the exogenous variables. To illustrate the effectiveness of our extended models, the models are applied to the macro and micro time-series data generated from actual survey. Our stationary model yields reliable parameter values of the prior distribution. And our non-stationary model can predict the variable transition probabilities effectively.

• Structural Engineering and Mechanics
• /
• 제32권1호
• /
• pp.71-94
• /
• 2009

In this paper a procedure for Monte Carlo simulation of univariate stationary stochastic processes with the aid of neural networks is presented. Neural networks operate model-free and, thus, circumvent the need of specifying a priori statistical properties of the process, as needed traditionally. This is particularly advantageous when only limited data are available. A neural network can capture the "pattern" of a short observed time series. Afterwards, it can directly generate stochastic process realizations which capture the properties of the underlying data. In the present study a simple feed-forward network with focused time-memory is utilized. The proposed procedure is demonstrated by examples of Monte Carlo simulation, by synthesis of future values of an initially short single process record.

• Wind and Structures
• /
• 제5권2_3_4호
• /
• pp.257-266
• /
• 2002

In the recent years flow around bridges are investigated using computer modeling. Selvam (1998), Selvam and Bosch (1999), Frandsen and McRobie (1999) used finite element procedures. Larsen and Walther (1997) used discrete vorticity procedure. The aeroelastic instability is a major criterion to be checked for long span bridges. If the wind speed experienced by a bridge is greater than the critical wind speed for flutter, then the bridge fails due to aeroelastic instability. Larsen and Walther (1997) computed the critical velocity for flutter using discrete vortex method similar to wind tunnel procedures. In this work, the critical velocity for flutter will be calculated directly (free oscillation procedure) similar to the approaches reported by Selvam et al. (1998). It is expected that the computational time required to compute the critical velocity using this approach may be much shorter than the traditional approach. The computed critical flutter velocity of 69 m/s is in reasonable comparison with wind tunnel measurement. The no flutter and flutter conditions are illustrated using the bridge response in time.

• 한국경영과학회지
• /
• 제16권2호
• /
• pp.14-35
• /
• 1991

The purpose of this study is to develop an efficient exact algorithm for the problem of scheduling n in dependent jobs on m unequal parallel processors to minimize makespan. Efficient solutions are already known for the preemptive case. But for the non-preemptive case, this problem belongs to a set of strong NP-complete problems. Hence, it is unlikely that the polynomial time algorithm can be found. This is the reason why most investigations have bben directed toward the fast approximate algorithms and the worst-case analysis of algorithms. Recently, great advances have been made in mathematical theories regarding Lagrangean relaxation and the subgradient optimization procedure which updates the Lagrangean multipliers. By combining and the subgradient optimization procedure which updates the Lagrangean multipliers. By combining these mathematical tools with branch-and-bound procedures, these have been some successes in constructing pseudo-polynomial time algorithms for solving previously unsolved NP-complete problems. This study applied similar methodologies to the unequal parallel processor problem to find the efficient exact algorithm.

• 한국경영과학회지
• /
• 제16권2호
• /
• pp.13-35
• /
• 1991

The purpose of this study is to develop an efficient exact algorithm for the problem of scheduling n in dependent jobs on m unequal parallel processors to minimize makespan. Efficient solutions are already known for the preemptive case. But for the non-preemptive case, this problem belongs to a set of strong NP-complete problems. Hence, it is unlikely that the polynomial time algorithm can be found. This is the reason why most investigations have bben directed toward the fast approximate algorithms and the worst-case analysis of algorithms. Recently, great advances have been made in mathematical theories regarding Lagrangean relaxation and the subgradient optimization procedure which updates the Lagrangean multipliers. By combining and the subgradient optimization procedure which updates the Lagrangean multipliers. By combining these mathematical tools with branch-and-bound procedures, these have been some successes in constructing pseudo-polynomial time algorithms for solving previously unsolved NP-complete problems. This study applied similar methodologies to the unequal parallel processor problem to find the efficient exact algorithm.

• 한국경영과학회지
• /
• 제22권4호
• /
• pp.167-172
• /
• 1997

We present a procedure which finds the probability distribution of number of customers accumulated when the server ends a vacation in the Geo/G/1 gated queueing system, where the service for a customer and the vacation, respectively, takes one slot time. The pp. g. f. for the number of customers accumulated at the gate closing epoch is obtained as a recursive form. The full probabilities, then, are derived using an iterative procedure. This system finds an application in a packet transmitting telecommunications system where the server transmits(serves) packets(customers) accumulated at a gate closing epoch, and takes one slot time vacation thereafter.