Jang Won Bae
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Jang Won Bae has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Il-Chul Moon
Korea Advanced Institute of Science and Technology
4 shared publications - Dongjun Kim
KAIST South Korea
2 shared publications - Eui-Hyun Paik
Intelligence Information Research Division, Electronics and Telecommunications Research Institute, Daejeon 34129, Korea
2 shared publications - Tae-Sub Yun
KAIST
2 shared publications - Chun-Hee Lee
Intelligence Information Research Division ETRI Daejeon South Korea
1 shared publication Chunhee Lee
Electronics and Telecommunications Research Institute,Visual Intelligence Research Group,Deajeon,Korea
1 shared publication
Latest Publications
- Open Access
DSDEVS-Based Simulation Acceleration with Event Filtering: USV Naval Combat Case
This study presents a DSDEVS-based method to accelerate simulation execution for AI training in USV (Unmanned Surface vehicle) naval combat scenarios. The proposed approach introduces an event filtering technique that selectively suppresses low-importance sensing events based on the distance to enemy targets. By dynamically adjusting structural couplings and modifying sensing frequency through domain-specific thresholds, the method reduces execution time while maintaining a balance between speed and fidelity. Two key parameters—Event Filtering Distance (EFD) and Sensor Acceleration Time Advance (SATA)—enable conditional event filtering and time advance adjustments within the sensor model. Experimental results demonstrate a 3.03 improvement in runtime, highlighting the effectiveness of the method and the trade-off between simulation speedup and fidelity.
Open AccessDSDEVS-Based Simulation Acceleration with Event Filtering: USV Naval Combat Case
This study presents a DSDEVS-based method to accelerate simulation execution for AI training in USV (Unmanned Surface vehicle) naval combat scenarios. The proposed approach introduces an event filtering technique that selectively suppresses low-importance sensing events based on the distance to enemy targets. By dynamically adjusting structural couplings and modifying sensing frequency through domain-specific thresholds, the method reduces execution time while maintaining a balance between speed and fidelity. Two key parameters—Event Filtering Distance (EFD) and Sensor Acceleration Time Advance (SATA)—enable conditional event filtering and time advance adjustments within the sensor model. Experimental results demonstrate a 3.03 improvement in runtime, highlighting the effectiveness of the method and the trade-off between simulation speedup and fidelity.
- Open Access
Practical Formalism-Based Approaches for Multi-Resolution Modeling and Simulation
Multi-resolution modeling (MRM) has been considered as an ideal form of simulation to acquire low-resolution scalability as well as high-resolution modeled details. Although both practical and theoretical interests exist in MRM, actual implementations were quite different in terms of cases and methods. Specifically, MRM implementations range from parameter-based interoperation to model exchanges with different resolutions, yet it is difficult to observe a method that focuses on both of these aspects. To this end, this paper introduces a formalism or multi-resolution translational Discrete Event System Specification (MRT-DEVS). Focusing on the practical perspective, MRT-DEVS intends to ease the implementation’s difficulty and reduce the simulation’s execution costs. Specifically, MRT-DEVS embeds state and event translation functions into the model’s specifications so that it enables MRM with less complex mechanisms in terms of operations. Using the provided case study and a reduction to other MRM methods, the theoretical soundness of the proposed method is supported. Moreover, we discussed the pros and the cons of the proposed method from various MRM perspectives. We expect that with all the provided information, MRMS users would consider the proposed method as a practical option to implement their models.
Open AccessPractical Formalism-Based Approaches for Multi-Resolution Modeling and Simulation
Multi-resolution modeling (MRM) has been considered as an ideal form of simulation to acquire low-resolution scalability as well as high-resolution modeled details. Although both practical and theoretical interests exist in MRM, actual implementations were quite different in terms of cases and methods. Specifically, MRM implementations range from parameter-based interoperation to model exchanges with different resolutions, yet it is difficult to observe a method that focuses on both of these aspects. To this end, this paper introduces a formalism or multi-resolution translational Discrete Event System Specification (MRT-DEVS). Focusing on the practical perspective, MRT-DEVS intends to ease the implementation’s difficulty and reduce the simulation’s execution costs. Specifically, MRT-DEVS embeds state and event translation functions into the model’s specifications so that it enables MRM with less complex mechanisms in terms of operations. Using the provided case study and a reduction to other MRM methods, the theoretical soundness of the proposed method is supported. Moreover, we discussed the pros and the cons of the proposed method from various MRM perspectives. We expect that with all the provided information, MRMS users would consider the proposed method as a practical option to implement their models.
- Open Access
GO-DEVS: Storage and Retrieval System for DEVS Models Using Graph and Ontology Representation
DEVS is a powerful formal language to describe discrete event systems in modeling and simulation areas and useful for component-based design. One of the advantages of component-based design is reusability. To reuse or share DEVS models developed by many other modelers, a system to systematically store and retrieve many DEVS models should be supported. However, to the best of our knowledge, there does not exist such a system. In this paper, we propose GO-DEVS (Graph/Ontology-represented DEVS storage and retrieval system) to store and retrieve DEVS models using graph and ontology representation. For effective model sharing, an ontology is introduced when a DEVS model is developed. To search for DEVS models in an effective and efficient way, we propose two types of queries, IO query and structure query, and provide a method to store and query DEVS models on an RDBMS. Finally, we experimentally show GO-DEVS can process the queries efficiently.
Open AccessGO-DEVS: Storage and Retrieval System for DEVS Models Using Graph and Ontology Representation
DEVS is a powerful formal language to describe discrete event systems in modeling and simulation areas and useful for component-based design. One of the advantages of component-based design is reusability. To reuse or share DEVS models developed by many other modelers, a system to systematically store and retrieve many DEVS models should be supported. However, to the best of our knowledge, there does not exist such a system. In this paper, we propose GO-DEVS (Graph/Ontology-represented DEVS storage and retrieval system) to store and retrieve DEVS models using graph and ontology representation. For effective model sharing, an ontology is introduced when a DEVS model is developed. To search for DEVS models in an effective and efficient way, we propose two types of queries, IO query and structure query, and provide a method to store and query DEVS models on an RDBMS. Finally, we experimentally show GO-DEVS can process the queries efficiently.
- 24 August 2021
- Published by Springer Nature in Autonomous Agents and Multi-Agent Systems
- Vol. 35 (2) , 1-66
Automatic calibration of dynamic and heterogeneous parameters in agent-based models
- 24 August 2021
- Published by Springer Nature in Autonomous Agents and Multi-Agent Systems
- Vol. 35 (2) , 1-66
Automatic calibration of dynamic and heterogeneous parameters in agent-based models
- Open Access
- 21 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 173654-173665
An Effective Adjustment to the Integration of Optimal Computing Budget Allocation for Particle Swarm Optimization in Stochastic Environments
Although particle swarm optimization (PSO) is a powerful evolutionary algorithm for solving nonlinear optimization problems in deterministic environments, many practical problems have some stochastic noise. The optimal computing budget allocation (OCBA) has been integrated into PSO in various ways to cope with this. The OCBA can mitigate the effect of noise on PSO by selecting the best solution under a limited evaluation budget. Recently, with the increasing complexity of PSO applications, the evaluation costs are also increasing rapidly, which has sparked the need for more efficient PSO in stochastic environments. This article proposes a simple yet effective adjustment to the integration of OCBA to further improve the efficiency of PSO. The proposed adjustment allows OCBA to expand its search space to find the global best position more correctly such that the entire swarm can move on a better direction under stochastic noise. The experimental results on various benchmarks demonstrate the improved performance of PSO by the proposed adjustment under a limited budget compared with the latest studies. In addition, the results regarding fighters' evasion flight optimization emphasize the practical need for the proposed adjustment.
- 21 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 173654-173665
Open AccessAn Effective Adjustment to the Integration of Optimal Computing Budget Allocation for Particle Swarm Optimization in Stochastic Environments
Although particle swarm optimization (PSO) is a powerful evolutionary algorithm for solving nonlinear optimization problems in deterministic environments, many practical problems have some stochastic noise. The optimal computing budget allocation (OCBA) has been integrated into PSO in various ways to cope with this. The OCBA can mitigate the effect of noise on PSO by selecting the best solution under a limited evaluation budget. Recently, with the increasing complexity of PSO applications, the evaluation costs are also increasing rapidly, which has sparked the need for more efficient PSO in stochastic environments. This article proposes a simple yet effective adjustment to the integration of OCBA to further improve the efficiency of PSO. The proposed adjustment allows OCBA to expand its search space to find the global best position more correctly such that the entire swarm can move on a better direction under stochastic noise. The experimental results on various benchmarks demonstrate the improved performance of PSO by the proposed adjustment under a limited budget compared with the latest studies. In addition, the results regarding fighters' evasion flight optimization emphasize the practical need for the proposed adjustment.
- 1 October 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1324-1326
GBM based Policy Influence Analysis of Agent Simulation Parameters
In this paper, GBM(generalized boosting model) based policy influence analysis is presented for house market agent simulation. In order to execute the agent simulation, various simulation parameters must be set. Among the parameters to be set, there are policy parameters that affect the policy goal, which is the main result of the simulation. Therefore, if simulation is executed by setting policy parameters variously, the results of simulation may be different. Simulation is usually performed by combining policy parameters based on policy objectives and then the result is analyzed whether the simulation result meets policy goals or not. However, it is difficult to analyze what kind of policy parameters affect policy objectives among policy parameters. In this paper, in order to analyze how the policy parameters affect policy goals, we set policy parameters in various combinations, and then execute social phenomenon agent simulations, and then analyze the impact of policy parameters using GBM algorithm.
- 1 October 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1324-1326
GBM based Policy Influence Analysis of Agent Simulation Parameters
In this paper, GBM(generalized boosting model) based policy influence analysis is presented for house market agent simulation. In order to execute the agent simulation, various simulation parameters must be set. Among the parameters to be set, there are policy parameters that affect the policy goal, which is the main result of the simulation. Therefore, if simulation is executed by setting policy parameters variously, the results of simulation may be different. Simulation is usually performed by combining policy parameters based on policy objectives and then the result is analyzed whether the simulation result meets policy goals or not. However, it is difficult to analyze what kind of policy parameters affect policy objectives among policy parameters. In this paper, in order to analyze how the policy parameters affect policy goals, we set policy parameters in various combinations, and then execute social phenomenon agent simulations, and then analyze the impact of policy parameters using GBM algorithm.
- Open Access
- 22 February 2016
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Modeling and Computer Simulation
- Vol. 26 (4) , 1-25
Efficient Flattening Algorithm for Hierarchical and Dynamic Structure Discrete Event Models
Discrete event models are widely used to replicate, analyze, and understand complex systems. DEVS (Discrete Event System Specification) formalism enables hierarchical modeling, so it provides an efficiency in the model development of complex models. However, the hierarchical modeling incurs prolonged simulation executions due to indirect event exchanges through the model hierarchy. Although direct event paths are applied to mitigate this overhead, the situation becomes even worse when a model changes its structures during simulation execution, called a dynamic structure model. This article suggests Coupling Relation Graph (CRG) and Strongly Coupled Component (SCC) concepts to improve hierarchical and dynamic structure DEVS simulation execution. CRG is a directed graph representing DEVS model structure, and SCC is a group of connected components in a CRG. Using CRG and SCC, this article presents (1) how to develop CRG from a DEVS model and (2) how to construct and update direct event paths with respect to dynamic structural changes. In particular, compared to the previous works, the proposed method focuses on the reduction of the updating costs for the direct event paths. Through theoretical and empirical analyses, this article shows that the proposed method significantly reduces the simulation execution time, especially when a simulation model contains lots of components and changes its model structures frequently. We expect that the proposed method would support the faster simulation executions of complex hierarchical and dynamic structure models.
- 22 February 2016
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Modeling and Computer Simulation
- Vol. 26 (4) , 1-25
Open AccessEfficient Flattening Algorithm for Hierarchical and Dynamic Structure Discrete Event Models
Discrete event models are widely used to replicate, analyze, and understand complex systems. DEVS (Discrete Event System Specification) formalism enables hierarchical modeling, so it provides an efficiency in the model development of complex models. However, the hierarchical modeling incurs prolonged simulation executions due to indirect event exchanges through the model hierarchy. Although direct event paths are applied to mitigate this overhead, the situation becomes even worse when a model changes its structures during simulation execution, called a dynamic structure model. This article suggests Coupling Relation Graph (CRG) and Strongly Coupled Component (SCC) concepts to improve hierarchical and dynamic structure DEVS simulation execution. CRG is a directed graph representing DEVS model structure, and SCC is a group of connected components in a CRG. Using CRG and SCC, this article presents (1) how to develop CRG from a DEVS model and (2) how to construct and update direct event paths with respect to dynamic structural changes. In particular, compared to the previous works, the proposed method focuses on the reduction of the updating costs for the direct event paths. Through theoretical and empirical analyses, this article shows that the proposed method significantly reduces the simulation execution time, especially when a simulation model contains lots of components and changes its model structures frequently. We expect that the proposed method would support the faster simulation executions of complex hierarchical and dynamic structure models.
- Open Access
- 1 January 2016
- Published by Elsevier in Procedia Computer Science
- Vol. 80, 507-517
Combining Microsimulation and Agent-based Model for Micro-level Population Dynamics
- 1 January 2016
- Published by Elsevier in Procedia Computer Science
- Vol. 80, 507-517
Open AccessCombining Microsimulation and Agent-based Model for Micro-level Population Dynamics
- Open Access
- 11 April 2010
- Published by Association for Computing Machinery (ACM)
- p. 1-7
DEVS based plug-in framework for interoperability of simulators
- 11 April 2010
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessDEVS based plug-in framework for interoperability of simulators