The Experts below are selected from a list of 4671 Experts worldwide ranked by ideXlab platform
Torsten Schaub - One of the best experts on this subject based on the ideXlab platform.
-
claspfolio 2: Advances in Algorithm Selection for Answer Set Programming
Theory and Practice of Logic Programming, 2014Co-Authors: Holger H. Hoos, Marius Lindauer, Torsten SchaubAbstract:Building on the award-winning, portfolio-based ASP solver claspfolio, we present claspfolio 2, a modular and open solver architecture that integrates several different portfolio-based algorithm selection approaches and techniques. The claspfolio 2 solver framework supports various feature generators, solver selection approaches, solver portfolios, as well as solver-schedule-based pre-solving techniques. The Default Configuration of claspfolio 2 relies on a light-weight version of the ASP solver clasp to generate static and dynamic instance features. The flexible open design of claspfolio 2 is a distinguishing factor even beyond ASP. As such, it provides a unique framework for comparing and combining existing portfolio-based algorithm selection approaches and techniques in a single, unified framework. Taking advantage of this, we conducted an extensive experimental study to assess the impact of different feature sets, selection approaches and base solver portfolios. In addition to gaining substantial insights into the utility of the various approaches and techniques, we identified a Default Configuration of claspfolio 2 that achieves substantial performance gains not only over clasp's Default Configuration and the earlier version of claspfolio, but also over manually tuned Configurations of clasp.
-
claspfolio 2: Advances in Algorithm Selection for Answer Set Programming
arXiv: Artificial Intelligence, 2014Co-Authors: Holger H. Hoos, Marius Lindauer, Torsten SchaubAbstract:To appear in Theory and Practice of Logic Programming (TPLP). Building on the award-winning, portfolio-based ASP solver claspfolio, we present claspfolio 2, a modular and open solver architecture that integrates several different portfolio-based algorithm selection approaches and techniques. The claspfolio 2 solver framework supports various feature generators, solver selection approaches, solver portfolios, as well as solver-schedule-based pre-solving techniques. The Default Configuration of claspfolio 2 relies on a light-weight version of the ASP solver clasp to generate static and dynamic instance features. The flexible open design of claspfolio 2 is a distinguishing factor even beyond ASP. As such, it provides a unique framework for comparing and combining existing portfolio-based algorithm selection approaches and techniques in a single, unified framework. Taking advantage of this, we conducted an extensive experimental study to assess the impact of different feature sets, selection approaches and base solver portfolios. In addition to gaining substantial insights into the utility of the various approaches and techniques, we identified a Default Configuration of claspfolio 2 that achieves substantial performance gains not only over clasp's Default Configuration and the earlier version of claspfolio 2, but also over manually tuned Configurations of clasp.
-
a portfolio solver for answer set programming preliminary report
International Conference on Logic Programming, 2011Co-Authors: Martin Gebser, Torsten Schaub, Roland Kaminski, Benjamin Kaufmann, Marius Schneider, Stefan ZillerAbstract:We propose a portfolio-based solving approach to Answer Set Programming (ASP). Our approach is homogeneous in considering several Configurations of the ASP solver clasp. The selection among the Configurations is realized via Support Vector Regression. The resulting portfolio-based solver claspfolio regularly outperforms clasp's Default Configuration as well as manual tuning.
-
LPNMR - A portfolio solver for answer set programming: preliminary report
Logic Programming and Nonmonotonic Reasoning, 2011Co-Authors: Martin Gebser, Torsten Schaub, Roland Kaminski, Benjamin Kaufmann, Marius Schneider, Stefan ZillerAbstract:We propose a portfolio-based solving approach to Answer Set Programming (ASP). Our approach is homogeneous in considering several Configurations of the ASP solver clasp. The selection among the Configurations is realized via Support Vector Regression. The resulting portfolio-based solver claspfolio regularly outperforms clasp's Default Configuration as well as manual tuning.
Tamer Basar - One of the best experts on this subject based on the ideXlab platform.
-
Indices of Power in Optimal IDS Default Configuration: Theory and Examples
arXiv: Computer Science and Game Theory, 2011Co-Authors: Quanyan Zhu, Tamer BasarAbstract:Intrusion Detection Systems (IDSs) are becoming essential to protecting modern information infrastructures. The effectiveness of an IDS is directly related to the computational resources at its disposal. However, it is difficult to guarantee especially with an increasing demand of network capacity and rapid proliferation of attacks. On the other hand, modern intrusions often come as sequences of attacks to reach some predefined goals. It is therefore critical to identify the best Default IDS Configuration to attain the highest possible overall protection within a given resource budget. This paper proposes a game theory based solution to the problem of optimal signature-based IDS Configuration under resource constraints. We apply the concepts of indices of power, namely, Shapley value and Banzhaf-Coleman index, from cooperative game theory to quantify the influence or contribution of libraries in an IDS with respect to given attack graphs. Such valuations take into consideration the knowledge on common attack graphs and experienced system attacks and are used to configure an IDS optimally at its Default state by solving a knapsack optimization problem.
-
GameSec - Indices of power in optimal IDS Default Configuration: theory and examples
Lecture Notes in Computer Science, 2011Co-Authors: Quanyan Zhu, Tamer BasarAbstract:Intrusion Detection Systems (IDSs) are becoming essential to protecting modern information infrastructures. The effectiveness of an IDS is directly related to the computational resources at its disposal. However, it is difficult to guarantee especially with an increasing demand of network capacity and rapid proliferation of attacks. On the other hand, modern intrusions often come as sequences of attacks to reach some predefined goals. It is therefore critical to identify the best Default IDS Configuration to attain the highest possible overall protection within a given resource budget. This paper proposes a game theory based solution to the problem of optimal signature-based IDS Configuration under resource constraints. We apply the concepts of indices of power, namely, Shapley value and Banzhaf-Coleman index, from cooperative game theory to quantify the influence or contribution of libraries in an IDS with respect to given attack graphs. Such valuations take into consideration the knowledge on common attack graphs and experienced system attacks and are used to configure an IDS optimally at its Default state by solving a knapsack optimization problem.
Jensen Zhang - One of the best experts on this subject based on the ideXlab platform.
-
A new method for reusing building information models of past projects to optimize the Default Configuration for performance simulations
Energy and Buildings, 2014Co-Authors: Kyosuke Hiyama, Shinsuke Kato, Masakazu Kubota, Jensen ZhangAbstract:Abstract The purpose of this study is to develop a new system that automatically generates Default Configurations for simulations during early phases of building design. The system is expected to facilitate front loading, which can contribute to making the building design process more efficient and consistent. The Default Configuration is generated based on an existing building database created by an architectural firm for each architectural program. The increase in the use of building information modeling (BIM) will allow for the compilation of a sufficient amount of data to utilize this system. The optimal Default Configuration changes its features automatically to match the objective functions employed by each architectural firm. Moreover, it can be used to create a generic building type, such as green buildings, based on a green building database. In this paper, a basic concept that can be used to produce a Default Configuration from existing building datasets was proposed. Using a case study, the similarity between the Default Configuration design and optimal design is illustrated. The study demonstrates the potential ability of this method to prevent designers from making careless mistakes with initial condition inputs and to eliminate the need to rework the simulation process, which facilitates front loading.
Rafael Morales - One of the best experts on this subject based on the ideXlab platform.
-
MICAI - On-Line learning of decision trees in problems with unknown dynamics
Lecture Notes in Computer Science, 2005Co-Authors: Marlon Núñez, Raúl Fidalgo, Rafael MoralesAbstract:Learning systems need to face several problems: incrementality, tracking concept drift, robustness to noise and recurring contexts in order to operate continuously. A method for on-line induction of decision trees motivated by the above requirements is presented. It uses the following strategy: creating a delayed window in every node for applying forgetting mechanisms; automatic modification of the delayed window; and constructive induction for identifying recurring contexts. The Default Configuration of the proposed approach has shown to be globally efficient, reactive, robust and problem-independent, which is suitable for problems with unknown dynamics. Notable results have been obtained when noise and concept drift are present.
Quanyan Zhu - One of the best experts on this subject based on the ideXlab platform.
-
Indices of Power in Optimal IDS Default Configuration: Theory and Examples
arXiv: Computer Science and Game Theory, 2011Co-Authors: Quanyan Zhu, Tamer BasarAbstract:Intrusion Detection Systems (IDSs) are becoming essential to protecting modern information infrastructures. The effectiveness of an IDS is directly related to the computational resources at its disposal. However, it is difficult to guarantee especially with an increasing demand of network capacity and rapid proliferation of attacks. On the other hand, modern intrusions often come as sequences of attacks to reach some predefined goals. It is therefore critical to identify the best Default IDS Configuration to attain the highest possible overall protection within a given resource budget. This paper proposes a game theory based solution to the problem of optimal signature-based IDS Configuration under resource constraints. We apply the concepts of indices of power, namely, Shapley value and Banzhaf-Coleman index, from cooperative game theory to quantify the influence or contribution of libraries in an IDS with respect to given attack graphs. Such valuations take into consideration the knowledge on common attack graphs and experienced system attacks and are used to configure an IDS optimally at its Default state by solving a knapsack optimization problem.
-
GameSec - Indices of power in optimal IDS Default Configuration: theory and examples
Lecture Notes in Computer Science, 2011Co-Authors: Quanyan Zhu, Tamer BasarAbstract:Intrusion Detection Systems (IDSs) are becoming essential to protecting modern information infrastructures. The effectiveness of an IDS is directly related to the computational resources at its disposal. However, it is difficult to guarantee especially with an increasing demand of network capacity and rapid proliferation of attacks. On the other hand, modern intrusions often come as sequences of attacks to reach some predefined goals. It is therefore critical to identify the best Default IDS Configuration to attain the highest possible overall protection within a given resource budget. This paper proposes a game theory based solution to the problem of optimal signature-based IDS Configuration under resource constraints. We apply the concepts of indices of power, namely, Shapley value and Banzhaf-Coleman index, from cooperative game theory to quantify the influence or contribution of libraries in an IDS with respect to given attack graphs. Such valuations take into consideration the knowledge on common attack graphs and experienced system attacks and are used to configure an IDS optimally at its Default state by solving a knapsack optimization problem.
