• 한국시뮬레이션학회논문지
• /
• 제7권2호
• /
• pp.137-152
• /
• 1998

One of the components that constitute the simulation models is the state variables whose values are determined by the time related simulation process. Embedding rule-based expert systems into the simulation models should provide a systematic way of handling these time-dependent variables without distracting the essential problem solving capabilities of the expert systems which are well suited for expressing the decision making function of complex cases. The expert system, however, is inefficient in dealing with the time elapsing characteristics of target system compare to the simulation models. To solve the problem, this paper provides an interruptible inference engine whose inferencing process can be interrupted when the variables' value, which are used as the parameters of the rules, are not yet determined due to the time dependent nature of the state variables. The process is resumed when the variables are ready. The elapse of time is calculated by time-advance function of the simulation model to which the expert system has been embedded. The example modeling shown exploits the embedded interruptible inferencing capability for the controlling and monitoring of metal grating process.

• Management Science and Financial Engineering
• /
• 제10권1호
• /
• pp.53-75
• /
• 2004

Most existing studies on time-dependent networks have been focused on finding a minimum delay path given a departure time at the origin. There, however, frequently happens a situation where users can select any departure time in a certain time interval and want to spend as little time as possible on traveling the networks. In that case. the delay spent on traveling networks depends on not only paths but also the actual departure time at the origin. In this paper, we propose a new problem in time-dependent networks whose objective is to find an optimal departure time given possible departure time interval at the origin. From the optimal departure time, we can obtain a path with minimum delay among all paths for possible departure times at the origin. In addition, we present an algorithm for finding an optimal departure time by enumerating trees which remain shortest path tree for a certain time interval.

• 한국구조물진단유지관리공학회 논문집
• /
• 제16권4호
• /
• pp.99-106
• /
• 2012

본 연구는 콘크리트의 열전도 역문제의 해를 통해 온도의존적 열전도도를 추정하는 방법을 제안하였다. 온도의존적 열전도도의 추정은 실물모형 화재실험에서 측정된 하이브리드 섬유보강 쉴드터널 라이닝의 시간 및 깊이별 온도분포 데이터를 이용하였다. 추정된 온도의존적 열전도도는 실험시간이 짧은 시점에서는 상온 영역에서 열전도도의 급격한 감소가 나타나는 것으로 추정되었다. 반면 깊이 25mm 위치에서 최대온도가 측정된 실험시간대에서는 온도에 따른 콘크리트의 특성변화 및 강섬유 혼입 효과를 반영하고 있다. 따라서 온도의존적 열전도도 추정 시 가열면 부근에서 최대온도가 측정된 시점을 기준으로 실험시간을 결정해야 한다. 추정된 열전도도는 유사배합을 사용한 기존연구와 유사한 결과를 나타내고 있다.

• 한국멀티미디어학회논문지
• /
• 제24권3호
• /
• pp.468-480
• /
• 2021

Realistic real-time rain streaks rendering has been treated as a very difficult problem because of various natural phenomena. Also, in creating and managing a large number of particles, a large amount of computer resources had to be used. Therefore, in this paper, we propose a more efficient real-time rain streaks rendering algorithm by generating view-dependent rain particles and expressing a large amount of rain even with a small number. By creating a 'rain space' dependent on the field of view of the camera moving in real time, particles are rendered only in that space. Accordingly, even if a small number of particles are rendered, since the rendering is performed in a limited space, an effect of rendering a very large amount of particles can be obtained. This enables very efficient real-time rendering of rain streaks.

• 대한산업공학회지
• /
• 제25권3호
• /
• pp.360-368
• /
• 1999

We consider the problem of scheduling n jobs with sequence-dependent processing times on a set of parallel-identical machines. The processing time of each job consists of a pure processing time and a sequence-dependent setup time. The objective is to maximize the total remaining machine available time which can be used for other tasks. For the problem, a hybrid genetic algorithm is proposed. The algorithm combines a genetic algorithm for global search and a heuristic for local optimization to improve the speed of evolution convergence. The genetic operators are developed such that parallel machines can be handled in an efficient and effective way. For local optimization, the adjacent pairwise interchange method is used. The proposed hybrid genetic algorithm is compared with two heuristics, the nearest setup time method and the maximum penalty method. Computational results for a series of randomly generated problems demonstrate that the proposed algorithm outperforms the two heuristics.

• Industrial Engineering and Management Systems
• /
• 제10권1호
• /
• pp.74-83
• /
• 2011

In this paper, we consider a new lot-sizing and scheduling problem (LSSP) that minimizes the sum of production cost, setup cost and inventory cost. Setup carry-over, setup overlapping, state dependent setup time as well as demand splitting are considered. For this LSSP, we develop a mixed integer programming (MIP) model, of which the size does not increase even if we divide a time period into a number of micro time periods. Also, we develop an efficient heuristic algorithm by combining a decomposition scheme with a local search procedure. Test results show that the developed heuristic algorithm finds a good quality (in practice, even better) feasible solution using far less computation time compared with the CPLEX, a competitive MIP solver.

• 산업경영시스템학회지
• /
• 제11권17호
• /
• pp.39-46
• /
• 1988

This Paper is concerned with a man-multi machine assignment problem to minimize idle time. Assuming different types of semi-automatic machines with deterministic service-processing time, the problem approaches by sequential dependent one operator can handle several machines, where determine optimal range the cost of idle labor and machine time is to be minimized in preparing a work schedule. The Procedure, to establish man-machine assignment model, and it's results are: (1) Objective function to minimize opportunity loss cost, which is happened by idle time, is verified recursive process through heuristic method. (2) The algorithm, is programmed by BASIC language for personal computer, and a numerical example is given to illustrate the heuristic algorithm. This study will be helpful to enhance productivity of Shopflooras a result of increasing the efficiencies of both operator and machine.

• 에너지공학
• /
• 제9권1호
• /
• pp.37-40
• /
• 2000

An inverse problem is solved to determine the space-dependent thermal conductivity in one-dimensinoal time-dependent heat conduction medium with the data imposed and measured at the two end-points. The thermal conductivity is approximated as a linear combination of known functions with unknown coefficients and the unknowns are obtained by the governing and sensitivity equations using modified Newton-Raphson method. The estimated results are compared with exact thermal conductivities and it shows good agreements. This approach is expected to be used to estimate spatial composition of heat conduction medium.

• 한국안전학회지
• /
• 제8권4호
• /
• pp.201-206
• /
• 1993

동적 문제에 대한 공간-시간 유한요소법을 제시하였다. 이 방법은 공간과 시간을 동일한 변수로 취급하였으며 공간-시간 영역에서의 유한요소 전개에 있어서는 연속적 갤러킨 방법에 근거하여 가중여분법을 이용하였다. 이 방법은 조건부 안정을 주는 고차원적 정확성을 주는 해법인 것이다.

• 제어로봇시스템학회논문지
• /
• 제15권2호
• /
• pp.121-127
• /
• 2009

This paper deals with the design problem of robust stabilization and non-fragile controller for discrete-time singular systems with parameter uncertainties and time-varying delays in state and input by delay-dependent Linear Matrix Inequality (LMI) approach. A new delay-dependent bounded real lemma for singular systems with time-varying delays is derived. Robust stabilization and robust non-fragile state feedback control laws are proposed, which guarantees that the resultant closed-loop system is regular, causal and stable in spite of time-varying delays, parameter uncertainties, and controller gain variations. A numerical example is given to show the validity of the design method.