The artifact evaluated in this report is relevant to the article. In fact, it allows us to run the experiments and reproduce figures, and the dependencies are documented. The process to regenerate data presented in the article completes correctly, and the results are reproducible. Additionally, the authors have uploaded their artifact on permanent repositories, which ensures a long-term retention. This article can thus receive the Artifacts Available , Artifacts Evaluated–Reusable , and Results Reproduced badges.
{"title":"RCR Report of \"A Language for Agent-Based Discrete-Event Modeling and Simulation of Linked Lives\"","authors":"Romolo Marotta","doi":"10.1145/3490030","DOIUrl":"https://doi.org/10.1145/3490030","url":null,"abstract":"\u0000 The artifact evaluated in this report is relevant to the article. In fact, it allows us to run the experiments and reproduce figures, and the dependencies are documented. The process to regenerate data presented in the article completes correctly, and the results are reproducible. Additionally, the authors have uploaded their artifact on permanent repositories, which ensures a long-term retention. This article can thus receive the\u0000 Artifacts Available\u0000 ,\u0000 Artifacts Evaluated–Reusable\u0000 , and\u0000 Results Reproduced\u0000 badges.\u0000","PeriodicalId":50943,"journal":{"name":"ACM Transactions on Modeling and Computer Simulation","volume":"32 1","pages":"7:1-7:4"},"PeriodicalIF":0.9,"publicationDate":"2022-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64047874","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
J. Joseph, Lennart Bamberg, Imad Hajjar, Behnam Razi Perjikolaei, A. García-Ortiz, Thilo Pionteck
We introduce Ratatoskr , an open-source framework for in-depth power, performance, and area (PPA) analysis in Networks-on-Chips (NoCs) for 3D-integrated and heterogeneous System-on-Chips (SoCs). It covers all layers of abstraction by providing an NoC hardware implementation on Register Transfer Level (RTL), an NoC simulator on cycle-accurate level and an application model on transaction level. By this comprehensive approach, Ratatoskr can provide the following specific PPA analyses: Dynamic power of links can be measured within 2.4% accuracy of bit-level simulations while maintaining cycle-accurate simulation speed. Router power is determined from RTL-to-gate-level synthesis combined with cycle-accurate simulations. The performance of the whole NoC can be measured both via cycle-accurate and RTL simulations. The performance (i.e., timing) of individual routers and the NoC area are obtained from RTL synthesis results. Despite these manifold features, Ratatoskr offers easy two-step user interaction: (1) A single point-of-entry allows setting design parameters. (2) PPA reports are generated automatically. For both the input and the output, different levels of abstraction can be chosen for high-level rapid network analysis or low-level improvement of architectural details. The synthesizable NoC-RTL model shows improved total router power and area in comparison to a conventional standard router. As a forward-thinking and unique feature not found in other NoC PPA-measurement tools, Ratatoskr supports heterogeneous 3D integration that is one of the most promising integration paradigms for upcoming SoCs. Thereby, Ratatoskr lays the groundwork to design their communication architectures. The framework is publicly available at https://github.com/ratatoskr-project .
{"title":"Ratatoskr: An Open-Source Framework for In-Depth Power, Performance, and Area Analysis and Optimization in 3D NoCs","authors":"J. Joseph, Lennart Bamberg, Imad Hajjar, Behnam Razi Perjikolaei, A. García-Ortiz, Thilo Pionteck","doi":"10.1145/3472754","DOIUrl":"https://doi.org/10.1145/3472754","url":null,"abstract":"\u0000 We introduce\u0000 Ratatoskr\u0000 , an open-source framework for in-depth power, performance, and area (PPA) analysis in Networks-on-Chips (NoCs) for 3D-integrated and heterogeneous System-on-Chips (SoCs). It covers all layers of abstraction by providing an NoC hardware implementation on Register Transfer Level (RTL), an NoC simulator on cycle-accurate level and an application model on transaction level. By this comprehensive approach,\u0000 Ratatoskr\u0000 can provide the following specific PPA analyses: Dynamic power of links can be measured within 2.4% accuracy of bit-level simulations while maintaining cycle-accurate simulation speed. Router power is determined from RTL-to-gate-level synthesis combined with cycle-accurate simulations. The performance of the whole NoC can be measured both via cycle-accurate and RTL simulations. The performance (i.e., timing) of individual routers and the NoC area are obtained from RTL synthesis results. Despite these manifold features,\u0000 Ratatoskr\u0000 offers easy two-step user interaction: (1) A single point-of-entry allows setting design parameters. (2) PPA reports are generated automatically. For both the input and the output, different levels of abstraction can be chosen for high-level rapid network analysis or low-level improvement of architectural details. The synthesizable NoC-RTL model shows improved total router power and area in comparison to a conventional standard router. As a forward-thinking and unique feature not found in other NoC PPA-measurement tools,\u0000 Ratatoskr\u0000 supports heterogeneous 3D integration that is one of the most promising integration paradigms for upcoming SoCs. Thereby,\u0000 Ratatoskr\u0000 lays the groundwork to design their communication architectures. The framework is publicly available at\u0000 \u0000 https://github.com/ratatoskr-project\u0000 \u0000 .\u0000","PeriodicalId":50943,"journal":{"name":"ACM Transactions on Modeling and Computer Simulation","volume":"37 1","pages":"3:1-3:21"},"PeriodicalIF":0.9,"publicationDate":"2022-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89265489","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In agent-based modeling and simulation, discrete-time methods prevail. While there is a need to cover the agents’ dynamics in continuous time, commonly used agent-based modeling frameworks offer little support for discrete-event simulation. Here, we present a formal syntax and semantics of the language ML3 (Modeling Language for Linked Lives) for modeling and simulating multi-agent systems as discrete-event systems. The language focuses on applications in demography, such as migration processes, and considers this discipline’s specific requirements. These include the importance of life courses being linked and the age-dependency of activities and events. The developed abstract syntax of the language combines the metaphor of agents with guarded commands. Its semantics is defined in terms of Generalized Semi-Markov Processes. The concrete language has been realized as an external domain-specific language. We discuss implications for efficient simulation algorithms and elucidate benefits of formally defining domain-specific languages for modeling and simulation.
{"title":"A Language for Agent-based Discrete-event Modeling and Simulation of Linked Lives","authors":"Oliver Reinhardt, Tom Warnke, A. Uhrmacher","doi":"10.1145/3486634","DOIUrl":"https://doi.org/10.1145/3486634","url":null,"abstract":"In agent-based modeling and simulation, discrete-time methods prevail. While there is a need to cover the agents’ dynamics in continuous time, commonly used agent-based modeling frameworks offer little support for discrete-event simulation. Here, we present a formal syntax and semantics of the language ML3 (Modeling Language for Linked Lives) for modeling and simulating multi-agent systems as discrete-event systems. The language focuses on applications in demography, such as migration processes, and considers this discipline’s specific requirements. These include the importance of life courses being linked and the age-dependency of activities and events. The developed abstract syntax of the language combines the metaphor of agents with guarded commands. Its semantics is defined in terms of Generalized Semi-Markov Processes. The concrete language has been realized as an external domain-specific language. We discuss implications for efficient simulation algorithms and elucidate benefits of formally defining domain-specific languages for modeling and simulation.","PeriodicalId":50943,"journal":{"name":"ACM Transactions on Modeling and Computer Simulation","volume":"21 1","pages":"6:1-6:26"},"PeriodicalIF":0.9,"publicationDate":"2022-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81321043","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This article describes and discusses railway-traffic simulators that use reflective nested simulations. Such simulations support optimizations (decision-making) with a focus on the selection of the most suitable solution where selected types of traffic problems are present. This approach allows suspension of the ongoing main simulation at a given moment and, by using supportive nested simulations (working with an appropriate lookahead), assessment of the different acceptable solution variants for the problem encountered—that is, a what-if analysis is carried out. The variant that provides the best predicted operational results (based on a specific criterion) is then selected for continuing the suspended main simulation. The proposed procedures are associated, in particular, with the use of sequential simulators specifically developed for railway traffic simulations. Special attention is paid to parallel computations of replications both of the main simulation and of supportive nested simulations. The concept proposed, applicable to railway traffic modelling, has the following advantages. First, the solution variants for the existing traffic situation are analyzed with respect to the feasibility of direct monitoring and evaluation of the natural traffic indicators or the appropriate (multi-criterial) function. The indicator values compare the results obtained from the variants being tested. Second, the supporting nested simulations, which potentially use additional hierarchic nesting, can also include future occurrences of random effects (such as train delay), thereby enabling us to realistically assess future traffic in stochastic conditions. The guidelines presented (for exploiting nested simulations within application projects with time constraints) are illustrated on a simulation case study focusing on traffic assessment related to the track infrastructure of a passenger railway station. Nested simulations support decisions linked with dynamic assignments of platform tracks to delayed trains. The use of reflective nested simulations is appropriate particularly in situations in which a reasonable number of admissible variants are to be analyzed within decision-making problem solution. This method is applicable especially to the support of medium-term (tactical) and long-term (strategic) planning. Because of rather high computational and time demands, nested simulations are not recommended for solving short-term (operative) planning/control problems.
{"title":"Reflective Nested Simulations Supporting Optimizations within Sequential Railway Traffic Simulators","authors":"R. Divis, A. Kavička","doi":"10.1145/3467965","DOIUrl":"https://doi.org/10.1145/3467965","url":null,"abstract":"This article describes and discusses railway-traffic simulators that use reflective nested simulations. Such simulations support optimizations (decision-making) with a focus on the selection of the most suitable solution where selected types of traffic problems are present.\u0000 This approach allows suspension of the ongoing main simulation at a given moment and, by using supportive nested simulations (working with an appropriate lookahead), assessment of the different acceptable solution variants for the problem encountered—that is, a what-if analysis is carried out. The variant that provides the best predicted operational results (based on a specific criterion) is then selected for continuing the suspended main simulation. The proposed procedures are associated, in particular, with the use of sequential simulators specifically developed for railway traffic simulations. Special attention is paid to parallel computations of replications both of the main simulation and of supportive nested simulations.\u0000 The concept proposed, applicable to railway traffic modelling, has the following advantages. First, the solution variants for the existing traffic situation are analyzed with respect to the feasibility of direct monitoring and evaluation of the natural traffic indicators or the appropriate (multi-criterial) function. The indicator values compare the results obtained from the variants being tested. Second, the supporting nested simulations, which potentially use additional hierarchic nesting, can also include future occurrences of random effects (such as train delay), thereby enabling us to realistically assess future traffic in stochastic conditions.\u0000 The guidelines presented (for exploiting nested simulations within application projects with time constraints) are illustrated on a simulation case study focusing on traffic assessment related to the track infrastructure of a passenger railway station. Nested simulations support decisions linked with dynamic assignments of platform tracks to delayed trains.\u0000 The use of reflective nested simulations is appropriate particularly in situations in which a reasonable number of admissible variants are to be analyzed within decision-making problem solution. This method is applicable especially to the support of medium-term (tactical) and long-term (strategic) planning. Because of rather high computational and time demands, nested simulations are not recommended for solving short-term (operative) planning/control problems.","PeriodicalId":50943,"journal":{"name":"ACM Transactions on Modeling and Computer Simulation","volume":"32 1","pages":"1:1-1:34"},"PeriodicalIF":0.9,"publicationDate":"2022-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64044216","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
J. Zhong, Dongrui Li, Zhixing Huang, Chengyu Lu, Wentong Cai
Data-driven crowd modeling has now become a popular and effective approach for generating realistic crowd simulation and has been applied to a range of applications, such as anomaly detection and game design. In the past decades, a number of data-driven crowd modeling techniques have been proposed, providing many options for people to generate virtual crowd simulation. This article provides a comprehensive survey of these state-of-the-art data-driven modeling techniques. We first describe the commonly used datasets for crowd modeling. Then, we categorize and discuss the state-of-the-art data-driven crowd modeling methods. After that, data-driven crowd model validation techniques are discussed. Finally, six promising future research topics of data-driven crowd modeling are discussed.
{"title":"Data-driven Crowd Modeling Techniques: A Survey","authors":"J. Zhong, Dongrui Li, Zhixing Huang, Chengyu Lu, Wentong Cai","doi":"10.1145/3481299","DOIUrl":"https://doi.org/10.1145/3481299","url":null,"abstract":"Data-driven crowd modeling has now become a popular and effective approach for generating realistic crowd simulation and has been applied to a range of applications, such as anomaly detection and game design. In the past decades, a number of data-driven crowd modeling techniques have been proposed, providing many options for people to generate virtual crowd simulation. This article provides a comprehensive survey of these state-of-the-art data-driven modeling techniques. We first describe the commonly used datasets for crowd modeling. Then, we categorize and discuss the state-of-the-art data-driven crowd modeling methods. After that, data-driven crowd model validation techniques are discussed. Finally, six promising future research topics of data-driven crowd modeling are discussed.","PeriodicalId":50943,"journal":{"name":"ACM Transactions on Modeling and Computer Simulation","volume":"78 1","pages":"4:1-4:33"},"PeriodicalIF":0.9,"publicationDate":"2022-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73520775","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
One of the major challenges faced by the current society is developing disaster management strategies to minimize the effects of catastrophic events. Disaster planning and strategy development phases of this urgency require larger amounts of cooperation among communities or individuals in society. Social networks have also been playing a crucial role in the establishment of efficient disaster management planning. This article proposes a hierarchical decision-making framework that would assist in analyzing two imperative information flow processes (innovation diffusion and opinion formation) in social networks under the consideration of community detection. The proposed framework was proven to capture the heterogeneity of individuals using cognitive behavior models and evaluate its impact on diffusion speed and opinion convergence. Moreover, the framework demonstrated the evolution of communities based on their inter-and intracommunication. The simulation results with real social network data suggest that the model can aid in establishing an efficient disaster management policy using social sensing and delivery.
{"title":"A Hierarchical Decision-Making Framework in Social Networks for Efficient Disaster Management","authors":"Seunghan Lee, Saurabh Jain, Y. Son","doi":"10.1145/3490027","DOIUrl":"https://doi.org/10.1145/3490027","url":null,"abstract":"One of the major challenges faced by the current society is developing disaster management strategies to minimize the effects of catastrophic events. Disaster planning and strategy development phases of this urgency require larger amounts of cooperation among communities or individuals in society. Social networks have also been playing a crucial role in the establishment of efficient disaster management planning. This article proposes a hierarchical decision-making framework that would assist in analyzing two imperative information flow processes (innovation diffusion and opinion formation) in social networks under the consideration of community detection. The proposed framework was proven to capture the heterogeneity of individuals using cognitive behavior models and evaluate its impact on diffusion speed and opinion convergence. Moreover, the framework demonstrated the evolution of communities based on their inter-and intracommunication. The simulation results with real social network data suggest that the model can aid in establishing an efficient disaster management policy using social sensing and delivery.","PeriodicalId":50943,"journal":{"name":"ACM Transactions on Modeling and Computer Simulation","volume":"95 1","pages":"5:1-5:26"},"PeriodicalIF":0.9,"publicationDate":"2022-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85729602","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Uncertainty Propagation methods are well-established when used in modeling and simulation formalisms like differential equations. Nevertheless, until now there are no methods for Discrete-Dynamic Systems. Uncertainty-Aware Discrete-Event System Specification (UA-DEVS) is a formalism for modeling Discrete-Event Dynamic Systems that include uncertainty quantification in messages, states, and event times. UA-DEVS models provide a theoretical framework to describe the models’ uncertainty and their properties. As UA-DEVS models can include continuous variables and non-computable functions, their simulation could be non-computable. For this reason, we also introduce Interval-Approximated Discrete-Event System Specification (IA-DEVS), a formalism that approximates UA-DEVS models using a set of order and bounding functions to obtain a computable model. The computable model approximation produces a tree of all trajectories that can be traversed from the original model and some erroneous ones introduced by the approximation process. We also introduce abstract simulation algorithms for IA-DEVS, present a case study of UA-DEVS, its IA-DEVS approximation and, its simulation results using the algorithms defined.
{"title":"Uncertainty on Discrete-Event System Simulation","authors":"Damián Vicino, Gabriel A. Wainer, Olivier Dalle","doi":"10.1145/3466169","DOIUrl":"https://doi.org/10.1145/3466169","url":null,"abstract":"Uncertainty Propagation methods are well-established when used in modeling and simulation formalisms like differential equations. Nevertheless, until now there are no methods for Discrete-Dynamic Systems. Uncertainty-Aware Discrete-Event System Specification (UA-DEVS) is a formalism for modeling Discrete-Event Dynamic Systems that include uncertainty quantification in messages, states, and event times. UA-DEVS models provide a theoretical framework to describe the models’ uncertainty and their properties. As UA-DEVS models can include continuous variables and non-computable functions, their simulation could be non-computable. For this reason, we also introduce Interval-Approximated Discrete-Event System Specification (IA-DEVS), a formalism that approximates UA-DEVS models using a set of order and bounding functions to obtain a computable model. The computable model approximation produces a tree of all trajectories that can be traversed from the original model and some erroneous ones introduced by the approximation process. We also introduce abstract simulation algorithms for IA-DEVS, present a case study of UA-DEVS, its IA-DEVS approximation and, its simulation results using the algorithms defined.","PeriodicalId":50943,"journal":{"name":"ACM Transactions on Modeling and Computer Simulation","volume":"32 1","pages":"2:1-2:27"},"PeriodicalIF":0.9,"publicationDate":"2022-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64043243","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pia Wilsdorf, Anja Wolpers, Jason Hilton, Fiete Haack, A. Uhrmacher
Simulation experiments are typically conducted repeatedly during the model development process, for example, to revalidate if a behavioral property still holds after several model changes. Approaches for automatically reusing and generating simulation experiments can support modelers in conducting simulation studies in a more systematic and effective manner. They rely on explicit experiment specifications and, so far, on user interaction for initiating the reuse. Thereby, they are constrained to support the reuse of simulation experiments in a specific setting. Our approach now goes one step further by automatically identifying and adapting the experiments to be reused for a variety of scenarios. To achieve this, we exploit provenance graphs of simulation studies, which provide valuable information about the previous modeling and experimenting activities, and contain meta-information about the different entities that were used or produced during the simulation study. We define provenance patterns and associate them with a semantics, which allows us to interpret the different activities and construct transformation rules for provenance graphs. Our approach is implemented in a Reuse and Adapt framework for Simulation Experiments (RASE), which can interface with various modeling and simulation tools. In the case studies, we demonstrate the utility of our framework for (1) the repeated sensitivity analysis of an agent-based model of migration routes and (2) the cross-validation of two models of a cell signaling pathway.
{"title":"Automatic Reuse, Adaption, and Execution of Simulation Experiments via Provenance Patterns","authors":"Pia Wilsdorf, Anja Wolpers, Jason Hilton, Fiete Haack, A. Uhrmacher","doi":"10.1145/3564928","DOIUrl":"https://doi.org/10.1145/3564928","url":null,"abstract":"Simulation experiments are typically conducted repeatedly during the model development process, for example, to revalidate if a behavioral property still holds after several model changes. Approaches for automatically reusing and generating simulation experiments can support modelers in conducting simulation studies in a more systematic and effective manner. They rely on explicit experiment specifications and, so far, on user interaction for initiating the reuse. Thereby, they are constrained to support the reuse of simulation experiments in a specific setting. Our approach now goes one step further by automatically identifying and adapting the experiments to be reused for a variety of scenarios. To achieve this, we exploit provenance graphs of simulation studies, which provide valuable information about the previous modeling and experimenting activities, and contain meta-information about the different entities that were used or produced during the simulation study. We define provenance patterns and associate them with a semantics, which allows us to interpret the different activities and construct transformation rules for provenance graphs. Our approach is implemented in a Reuse and Adapt framework for Simulation Experiments (RASE), which can interface with various modeling and simulation tools. In the case studies, we demonstrate the utility of our framework for (1) the repeated sensitivity analysis of an agent-based model of migration routes and (2) the cross-validation of two models of a cell signaling pathway.","PeriodicalId":50943,"journal":{"name":"ACM Transactions on Modeling and Computer Simulation","volume":"33 1","pages":"1 - 27"},"PeriodicalIF":0.9,"publicationDate":"2021-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48438886","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We consider optimization problems with uncertain constraints that need to be satisfied probabilistically. When data are available, a common method to obtain feasible solutions for such problems is ...
{"title":"Parametric Scenario Optimization under Limited Data: A Distributionally Robust Optimization View","authors":"LamHenry, LiFengpei","doi":"10.1145/3410152","DOIUrl":"https://doi.org/10.1145/3410152","url":null,"abstract":"We consider optimization problems with uncertain constraints that need to be satisfied probabilistically. When data are available, a common method to obtain feasible solutions for such problems is ...","PeriodicalId":50943,"journal":{"name":"ACM Transactions on Modeling and Computer Simulation","volume":"57 1","pages":"1-41"},"PeriodicalIF":0.9,"publicationDate":"2020-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90652333","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This article provides a comprehensive and in-depth overview of our work on knowledge discovery in simulations. Application-wise, we focus on manufacturing simulations. Specifically, we propose and ...
{"title":"Knowledge Discovery in Simulation Data","authors":"FeldkampNiclas, BergmannSoeren, StrassburgerSteffen","doi":"10.1145/3391299","DOIUrl":"https://doi.org/10.1145/3391299","url":null,"abstract":"This article provides a comprehensive and in-depth overview of our work on knowledge discovery in simulations. Application-wise, we focus on manufacturing simulations. Specifically, we propose and ...","PeriodicalId":50943,"journal":{"name":"ACM Transactions on Modeling and Computer Simulation","volume":"12 1","pages":"1-25"},"PeriodicalIF":0.9,"publicationDate":"2020-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91094049","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：