• Journal of the Korea Society for Simulation
• /
• v.13 no.4
• /
• pp.43-53
• /
• 2004

The distributed OCSP (Online Certificate Status Protocol), composed of multiple responders, is a model that enhances the utilization of each responder and reduces the response time. In a multi-user distributed environment, load balancing mechanism must be developed for the improvement of the performance of the whole system. Conservative load balancing algorithms often ignore the communication cost of gathering the information of responders. As the number of request is increased, however, fail to consider the communication cost may cause serious problems since the communication time is too large to disregard. We propose an adaptive load balancing algorithm and evaluate the effectiveness by performing modeling and simulation. The principal advantage of new algorithm is in their simplicity: there is no need to maintain and process system state information. We evaluated the quality of load balancing achieved by the new algorithm by comparing the queue size of responders and analyzing the utilization of these responders. The simulation results show how efficiently load balancing is done with the new algorithm.

• Korean Journal of Computational Design and Engineering
• /
• v.2 no.4
• /
• pp.215-221
• /
• 1997

A new approach in solving design centering problem is presented. Like most stochastic optimization problems, optimal design centering problems have intrinsic difficulties in multivariate intergration of probability density functions. In order to avoid to avoid those difficulties, genetic algorithm and very coarse Monte Carlo simulation are used in this research. The new algorithm performs robustly while producing improved yields. This result implies that the combination of robust optimization methods and approximated simulation schemes would give promising ways for many stochastic optimizations which are inappropriate for mathematical programming.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2001.10a
• /
• pp.263-268
• /
• 2001

In this paper, we present a new heuristic algorithm fur buffer allocation in FMS (Flexible Manufacturing System). It is conducted by using a genetic algorithm and simulation. First, we model the system by using a simulation software, \"Arena\". Then, we apply a genetic algorithm to achieve an optimal solution. VBA blocks, which are kinds of add-in functions in Arena, are used to connect Arena with the genetic algorithm. The system being modeled has seven workstations, one loading/unloading station, and three AGVs (Automated Guided Vehicle). Also it contains three products, which each have their own machining order and processing times. We experimented with two kinds of buffer allocation problems with a proposed heuristic algorithm, and we will suggest a simple heuristic approach based on processing times and workloads to validate our proposed algorithm. The first experiment is to find a buffer profile to achieve the maximum throughput using a finite number of buffers. The second experiment is to find the minimum number of buffers to achieve the desired throughput. End of this paper, we compare the result of a proposed algorithm with the result of a simple buffer allocation heuristic based on processing times and workloads. We show that the proposed algorithm increase the throughput by 7.2%.t by 7.2%.

• Journal of Information Processing Systems
• /
• v.18 no.6
• /
• pp.719-728
• /
• 2022

The prediction of short-term traffic flow is the theoretical basis of intelligent transportation as well as the key technology in traffic flow induction systems. The research on short-term traffic flow prediction has showed the considerable social value. At present, the support vector regression (SVR) intelligent prediction model that is suitable for small samples has been applied in this domain. Aiming at parameter selection difficulty and prediction accuracy improvement, the artificial bee colony (ABC) is adopted in optimizing SVR parameters, which is referred to as the ABC-SVR algorithm in the paper. The simulation experiments are carried out by comparing the ABC-SVR algorithm with SVR algorithm, and the feasibility of the proposed ABC-SVR algorithm is verified by result analysis. Continuously, the simulation experiments are carried out by comparing the ABC-SVR algorithm with particle swarm optimization SVR (PSO-SVR) algorithm and genetic optimization SVR (GA-SVR) algorithm, and a better optimization effect has been attained by simulation experiments and verified by statistical test. Simultaneously, the simulation experiments are carried out by comparing the ABC-SVR algorithm and wavelet neural network time series (WNN-TS) algorithm, and the prediction accuracy of the proposed ABC-SVR algorithm is improved and satisfactory prediction effects have been obtained.

• Journal of IKEEE
• /
• v.23 no.4
• /
• pp.1430-1439
• /
• 2019

In Functional Mockup Interface(FMI)-based co-simulation, a bisectional algorithm can be used to find the zerocrossing point as a way to improve the accuracy of the simulation results. In this paper, the proposed master algorithm(MA) analyzes the repeated interval graph and predicts the next interval by applying the Markov Chain to the step size. In the simulation, we propose an algorithm to minimize the rollback by storing the step size that changes according to the graph type as an array and applying it to the next prediction interval when the rollback occurs in the simulation. Simulation results show that the proposed algorithm reduces the simulation time by more than 20% compared to the existing algorithm.

• IE interfaces
• /
• v.21 no.4
• /
• pp.444-455
• /
• 2008

In the present manufacturing environment, the appropriate decision making strategy has a significance and it should count on the fast-changing demand of customers. This research derives the optimal levels of the decision variables affecting the inventory related performance in multi-stage supply chain by using simulation and genetic algorithm. Simulation model helps analyze the customer service level of the supply chain computationally and the genetic algorithm searches the optimal solutions by interaction with the simulation model. Our experiments show that the integration approach of the genetic algorithm with a simulation model is effective in finding the solutions that achieve predefined target service levels.

• Journal of the Korea Society for Simulation
• /
• v.8 no.4
• /
• pp.33-51
• /
• 1999

In this study, the system level network simulation is considered with adaptive array antenna in CDMA mobile communication system. A network simulation framework is implemented based on IS-95A/B system to consider dynamic handoff, system level network behavior, and deploying strategy into the overall CDMA mobile communication network under adaptive array algorithm. Its simulation model, such as vector channel model, adaptive beam forming antenna model, handoff model, and power control model, are described in detail with simulation block. In order to maximize SINR of received signal at antenna, Maximin algorithm is particularly considered, and it is computed at each simulation snap shot with SINR based power control and handoff algorithm. Graphic user interface in this system level network simulator is also implemented to define the simulation environments and to represent simulation results on real mapping system. This paper also shows some features of simulation framework and simulation results.

• Journal of Korean Critical Care Nursing
• /
• v.3 no.2
• /
• pp.61-76
• /
• 2010

Purpose: This study was aimed to construct an algorithm of dyspnea emergency care and develop a simulation scenario for emergency care of dyspnea based on the algorithm. Methods: The first stage of this methodological study was to construct a preliminary algorithm based on a literature review, and content and clinical validity were established. Reflecting the result of content and clinical validity for this preliminary algorithm, simulation scenario was developed based on the modified Bay Area Simulation Collaborative scenario template. The content validity of this scenario was established, and clinical applicability was tested by applying this scenario to nurses. Results: The final simulation scenario of emergency care of dyspnea consisted of scenario overview, curricular integrity, and scenario script. The scenario was proceeded on 7 phases of the algorithm as follows; initial assessment, immediate emergency care, reassessment of dyspnea, monitoring respiratory failure, checking pulse if respiratory failure occurs, decision making on cardiopulmonary resuscitation or intubation, determining a differential diagnosis according to origin of dyspnea. Conclusion: The simulation scenario of emergency care of dyspnea developed in this study may provide a strategy of simulation education for emergency care of dyspnea for nurses.

• Proceedings of the IEEK Conference
• /
• 2000.11b
• /
• pp.168-171
• /
• 2000

Akers Algorithm has more useful information and technique of undetectable faults for fault simulation. To verify of this algorithm, we have constructed A1, A2 and A3 simulator and surveyed simulation time.

• Journal of the Korea Safety Management & Science
• /
• v.14 no.3
• /
• pp.159-166
• /
• 2012

A*algorithm is highly useful to search the shortest route to the destination in the evacuation simulation. For this reason, A*algorithm is used to evaluate the evacuation experiment by the computer simulation. However there are some problems to analyze the outcome in relation to the reality. Because all the people in the building are not well-informed of the shortest route to the exit. And they will not move to the disaster spot though it is shortest route to the exit. Therefore, evacuation simulation program based on A*algorithm raise a problem of bottleneck phenomenon and dangerous result by damage surrounding the disaster spot. The purpose of this research is to prove the necessity for dispersion evacuation simulation by Multi agent system to solve the problems of the existing evacuation simulation program based on A*algorithm.