Browsing
     by title


0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

or enter first few letters:   
OK
Full Text
Peer Reviewed
See detailSeamless and Accurate Modeling of Organic Molecular Materials
Reilly, Anthony M.; Tkatchenko, Alexandre UL

in Journal of Physical Chemistry Letters (2013), 4(6), 1028-1033

The near endless possibilities for assembling molecular materials has long posed a difficult challenge for theory. All crystal-structure prediction methods acknowledge the crucial contribution of van der ... [more ▼]

The near endless possibilities for assembling molecular materials has long posed a difficult challenge for theory. All crystal-structure prediction methods acknowledge the crucial contribution of van der Waals or dispersion interactions, but few go beyond a pairwise additive description of dispersion, ignoring its many-body nature. Here we use two databases to show how a many-body approach to dispersion can seamlessly model both solid and gas-phase interactions within the coveted ``chemical accuracy'' benchmark, while the underlying pairwise approach fails for solid-state interactions due to the absence of many-body polarization and energy contributions. Our results show that recently developed methods that treat the truly collective nature of dispersion interactions are able to reach the accuracy required for predicting molecular materials, when coupled with nonempirical density functionals. [less ▲]

Detailed reference viewed: 166 (3 UL)
Full Text
See detailSeamless Communication for Crises Management
Wojciechowicz, Wojciech; Fournier, Jacques; Konecny, Miroslav et al

in Technical Science (2012)

SECRICOM is proposed as a collaborative research project aiming at development of a reference security platform for EU crisis management operations with two essential ambitions: (A) Solve or mitigate ... [more ▼]

SECRICOM is proposed as a collaborative research project aiming at development of a reference security platform for EU crisis management operations with two essential ambitions: (A) Solve or mitigate problems of contemporary crisis communication infrastructures (Tetra, GSM, Citizen Band, IP) such as poor interoperability of specialized communication means, vulnerability against tapping and misuse, lack of possibilities to recover from failures, inability to use alternative data carrier and high deployment and operational costs. (B) Add new smart functions to existing services which will make the communication more effective and helpful for users. Smart functions will be provided by distributed IT systems based on an agents’ infrastructure. Achieving these two project ambitions will allow creating a pervasive and trusted communication infrastructure fulfilling requirements of crisis management users and ready for immediate application. [less ▲]

Detailed reference viewed: 134 (6 UL)
Full Text
See detailSéance 3. L'espace réservé aux aides d'État
Rassafi-Guibal, Hicham UL

Learning material (2017)

Detailed reference viewed: 40 (1 UL)
Full Text
See detailSéance 5. Une approche originale des marchés régulés
Rassafi-Guibal, Hicham UL

Learning material (2017)

Detailed reference viewed: 60 (1 UL)
Full Text
Peer Reviewed
See detailSearch for Related-Key Differential Characteristics in DES-Like Ciphers.
Biryukov, Alex UL; Nikolic, Ivica UL

in Fast Software Encryption - 18th International Workshop (2011)

We present the first automatic search algorithms for the best related-key differential characteristics in DES-like ciphers. We show that instead of brute-forcing the space of all possible differences in ... [more ▼]

We present the first automatic search algorithms for the best related-key differential characteristics in DES-like ciphers. We show that instead of brute-forcing the space of all possible differences in the master key and the plaintext, it is computationally more efficient to try only a reduced set of input-output differences of three consecutive S-box layers. Based on this observation, we propose two search algorithms – the first explores Matsui’s approach, while the second is divide-and-conquer technique. Using our algorithms, we find the probabilities (or the upper bounds on the probabilities) of the best related-key characteristics in DES, DESL, and s^2DES. [less ▲]

Detailed reference viewed: 191 (1 UL)
Full Text
Peer Reviewed
See detailThe search for the perfect match: Aligning power-trading products to the energy transition
Fridgen, Gilbert UL; Michaelis, Anne; Rinck, Maximilian et al

in Energy Policy (2020), 144

Given the growing share of uncertain renewable energy production, the energy transition challenges modern power systems and especially calls for increased flexibility. However, relevant information on the ... [more ▼]

Given the growing share of uncertain renewable energy production, the energy transition challenges modern power systems and especially calls for increased flexibility. However, relevant information on the highly assetspecific flexibility potential is typically only known to plant operators themselves and not, e.g., to transmission system operators. Therefore, liberalized electricity markets use prices that set explicit monetary incentives to disclose the relevant private information about the market participants’ assets. In this way, information asymmetries may be reduced. Given the different challenges of an integration of renewables, we argue that the associated new forms of volatile power profiles require new forms of power-trading products. In particular, based on recent advances in technical power measurement and billing, individual and market participant-specific power profiles may be superior to the current trading of average volumes. Against this background, we first outline various evolutionary adjustments of existing power-trading products and their underlying product parameters including (1) strengthening local pricing, (2) finer temporal granularity, (3) smaller minimum volume, and (4) shorter gate-closure time. Second, we open up a new perspective in form of a more disruptive shift towards power-profile trade, where market participants define their trading product using the actual power profile as a new product parameter. [less ▲]

Detailed reference viewed: 100 (14 UL)
Peer Reviewed
See detailSearch for user-related features in matrix factorization-based recommender systems
Aleksandrova, Marharyta UL; Brun, Armelle; Boyer, Anne et al

in European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML/PKDD 2014), PhD Session Proceedings (2014)

Detailed reference viewed: 69 (0 UL)
Full Text
Peer Reviewed
See detailThe Search for Yield: Implications to Alternative Investments
Lehnert, Thorsten UL; Kräussl, Roman UL; Rinne, Kalle UL

in Journal of Empirical Finance (2017), 44(-), 227-236

Detailed reference viewed: 195 (12 UL)
Full Text
Peer Reviewed
See detailSearch in Encrypted Data: Theoretical Models and Practical Applications
Tang, Qiang UL

in Theory and Practice of Cryptography Solutions for Secure Information Systems (2013)

Detailed reference viewed: 140 (2 UL)
Full Text
Peer Reviewed
See detailSearch-based adversarial testing and improvement of constrained credit scoring systems
Ghamizi, Salah UL; Cordy, Maxime UL; Gubri, Martin UL et al

in ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE '20), November 8-13, 2020 (2020)

Detailed reference viewed: 144 (26 UL)
Full Text
Peer Reviewed
See detailA Search-based Approach for Accurate Identification of Log Message Formats
Messaoudi, Salma UL; Panichella, Annibale UL; Bianculli, Domenico UL et al

in Proceedings of the 26th IEEE/ACM International Conference on Program Comprehension (ICPC ’18) (2018)

Many software engineering activities process the events contained in log files. However, before performing any processing activity, it is necessary to parse the entries in a log file, to retrieve the ... [more ▼]

Many software engineering activities process the events contained in log files. However, before performing any processing activity, it is necessary to parse the entries in a log file, to retrieve the actual events recorded in the log. Each event is denoted by a log message, which is composed of a fixed part-called (event) template-that is the same for all occurrences of the same event type, and a variable part, which may vary with each event occurrence. The formats of log messages, in complex and evolving systems, have numerous variations, are typically not entirely known, and change on a frequent basis; therefore, they need to be identified automatically. The log message format identification problem deals with the identification of the different templates used in the messages of a log. Any solution to this problem has to generate templates that meet two main goals: generating templates that are not too general, so as to distinguish different events, but also not too specific, so as not to consider different occurrences of the same event as following different templates; however, these goals are conflicting. In this paper, we present the MoLFI approach, which recasts the log message identification problem as a multi-objective problem. MoLFI uses an evolutionary approach to solve this problem, by tailoring the NSGA-II algorithm to search the space of solutions for a Pareto optimal set of message templates. We have implemented MoLFI in a tool, which we have evaluated on six real-world datasets, containing log files with a number of entries ranging from 2K to 300K. The experiments results show that MoLFI extracts by far the highest number of correct log message templates, significantly outperforming two state-of-the-art approaches on all datasets. [less ▲]

Detailed reference viewed: 1295 (107 UL)
Full Text
Peer Reviewed
See detailSearch-Based Automated Testing of Continuous Controllers: Framework, Tool Support, and Case Studies
Matinnejad, Reza UL; Nejati, Shiva UL; Briand, Lionel UL et al

in Information and Software Technology (2015), 57

Context. Testing and verification of automotive embedded software is a major chal- lenge. Software production in automotive domain comprises three stages: Developing automotive functions as Simulink ... [more ▼]

Context. Testing and verification of automotive embedded software is a major chal- lenge. Software production in automotive domain comprises three stages: Developing automotive functions as Simulink models, generating code from the models, and de- ploying the resulting code on hardware devices. Automotive software artifacts are sub- ject to three rounds of testing corresponding to the three production stages: Model-in- the-Loop (MiL), Software-in-the-Loop (SiL) and Hardware-in-the-Loop (HiL) testing. Objective. We study testing of continuous controllers at the Model-in-Loop (MiL) level where both the controller and the environment are represented by models and connected in a closed loop system. These controllers make up a large part of automotive functions, and monitor and control the operating conditions of physical devices. Method. We identify a set of requirements characterizing the behavior of continu- ous controllers, and develop a search-based technique based on random search, adap- tive random search, hill climbing and simulated annealing algorithms to automatically identify worst-case test scenarios which are utilized to generate test cases for these requirements. Results. We evaluated our approach by applying it to an industrial automotive con- troller (with 443 Simulink blocks) and to a publicly available controller (with 21 Simulink blocks). Our experience shows that automatically generated test cases lead to MiL level simulations indicating potential violations of the system requirements. Further, not only does our approach generate significantly better test cases faster than random test case generation, but it also achieves better results than test scenarios devised by domain experts. Finally, our generated test cases uncover discrepancies between envi- ronment models and the real world when they are applied at the Hardware-in-the-Loop(HiL) level. Conclusion. We propose an automated approach to MiL testing of continuous con- trollers using search. The approach is implemented in a tool and has been successfully applied to a real case study from the automotive domain. [less ▲]

Detailed reference viewed: 389 (68 UL)
Full Text
Peer Reviewed
See detailSearch-based Multi-Vulnerability Testing of XML Injections in Web Applications
Jan, Sadeeq UL; Panichella, Annibale UL; Arcuri, Andrea UL et al

in Empirical Software Engineering (2019), 24(6), 36963729

Modern web applications often interact with internal web services, which are not directly accessible to users. However, malicious user inputs can be used to exploit security vulnerabilities in web ... [more ▼]

Modern web applications often interact with internal web services, which are not directly accessible to users. However, malicious user inputs can be used to exploit security vulnerabilities in web services through the application front-ends. Therefore, testing techniques have been proposed to reveal security flaws in the interactions with back-end web services, e.g., XML Injections (XMLi). Given a potentially malicious message between a web application and web services, search-based techniques have been used to find input data to mislead the web application into sending such a message, possibly compromising the target web service. However, state-of-the-art techniques focus on (search for) one single malicious message at a time. Since, in practice, there can be many different kinds of malicious messages, with only a few of them which can possibly be generated by a given front-end, searching for one single message at a time is ineffective and may not scale. To overcome these limitations, we propose a novel co-evolutionary algorithm (COMIX) that is tailored to our problem and uncover multiple vulnerabilities at the same time. Our experiments show that COMIX outperforms a single-target search approach for XMLi and other multi-target search algorithms originally defined for white-box unit testing. [less ▲]

Detailed reference viewed: 321 (38 UL)
Full Text
Peer Reviewed
See detailSearch-based Security Testing of Web Applications
Thome, Julian UL; Gorla, Alessandra; Zeller, Andreas

in SBST 2014 Proceedings of the 7th International Workshop on Search-Based Software Testing (2014)

Detailed reference viewed: 259 (45 UL)
Full Text
Peer Reviewed
See detailSearch-based Test and Improvement of Machine-Learning-Based Anomaly Detection Systems
Cordy, Maxime UL; Muller, Steve; Papadakis, Mike UL et al

in ACM SIGSOFT International Symposium on Software Testing and Analysis (2019)

Detailed reference viewed: 189 (7 UL)
Full Text
Peer Reviewed
See detailA Search-based Testing Approach for XML Injection Vulnerabilities in Web Applications
Jan, Sadeeq UL; Nguyen, Duy Cu UL; Andrea, Arcuri UL et al

in 10th IEEE International Conference on Software Testing, Verification and validation (ICST 2017), Tokyo 13-18 March 2017 (2017)

In most cases, web applications communicate with web services (SOAP and RESTful). The former act as a front-end to the latter, which contain the business logic. A hacker might not have direct access to ... [more ▼]

In most cases, web applications communicate with web services (SOAP and RESTful). The former act as a front-end to the latter, which contain the business logic. A hacker might not have direct access to those web services (e.g., they are not on public networks), but can still provide malicious inputs to the web application, thus potentially compromising related services. Typical examples are XML injection attacks that target SOAP communications. In this paper, we present a novel, search-based approach used to generate test data for a web application in an attempt to deliver malicious XML messages to web services. <br />Our goal is thus to detect XML injection vulnerabilities in web applications. The proposed approach is evaluated on two studies, including an industrial web application with millions of users. Results show that we are able to effectively generate test data (e.g., input values in an HTML form) that detect such vulnerabilities. [less ▲]

Detailed reference viewed: 399 (39 UL)
Full Text
Peer Reviewed
See detailSearch-driven String Constraint Solving for Vulnerability Detection
Thome, Julian UL; Shar, Lwin Khin UL; Bianculli, Domenico UL et al

in Proceedings of the 39th International Conference on Software Engineering (ICSE 2017) (2017, May)

Constraint solving is an essential technique for detecting vulnerabilities in programs, since it can reason about input sanitization and validation operations performed on user inputs. However, real-world ... [more ▼]

Constraint solving is an essential technique for detecting vulnerabilities in programs, since it can reason about input sanitization and validation operations performed on user inputs. However, real-world programs typically contain complex string operations that challenge vulnerability detection. State-of-the-art string constraint solvers support only a limited set of string operations and fail when they encounter an unsupported one; this leads to limited effectiveness in finding vulnerabilities. In this paper we propose a search-driven constraint solving technique that complements the support for complex string operations provided by any existing string constraint solver. Our technique uses a hybrid constraint solving procedure based on the Ant Colony Optimization meta-heuristic. The idea is to execute it as a fallback mechanism, only when a solver encounters a constraint containing an operation that it does not support. We have implemented the proposed search-driven constraint solving technique in the ACO-Solver tool, which we have evaluated in the context of injection and XSS vulnerability detection for Java Web applications. We have assessed the benefits and costs of combining the proposed technique with two state-of-the-art constraint solvers (Z3-str2 and CVC4). The experimental results, based on a benchmark with 104 constraints derived from nine realistic Web applications, show that our approach, when combined in a state-of-the-art solver, significantly improves the number of detected vulnerabilities (from 4.7% to 71.9% for Z3-str2, from 85.9% to 100.0% for CVC4), and solves several cases on which the solver fails when used stand-alone (46 more solved cases for Z3-str2, and 11 more for CVC4), while still keeping the execution time affordable in practice. [less ▲]

Detailed reference viewed: 971 (81 UL)
Full Text
Peer Reviewed
See detailSearching and Finding Strikes in the New York Times
Hendrickx, Iris; During, Marten UL; Zervanou, Kalliopi et al

in Proceedings of The Third Workshop on Annotation of Corpora for Research in the Humanities (ACRH-3) (2013)

Detailed reference viewed: 68 (3 UL)
See detailSearching bodies through born-digital heritage: issues and challenges
Schafer, Valerie UL

Presentation (2019, April 03)

This presentation, followed by a hands-on session, will present several methods, issues and challenges that researchers may face when they analyse web archives and give a few examples more specifically ... [more ▼]

This presentation, followed by a hands-on session, will present several methods, issues and challenges that researchers may face when they analyse web archives and give a few examples more specifically dedicated to the histories of healthy bodies. [less ▲]

Detailed reference viewed: 102 (3 UL)