http://hdl.handle.net/10993/85 Search this channel search https://orbilu.uni.lu/simple-search http://hdl.handle.net/10993/44035 Title: On Composability of Game-based Password Authenticated Key Exchange <br/> <br/>Author, co-author: Skrobot, Marjan; Lancrenon, Jean <br/> <br/>Abstract: It is standard practice that the secret key derived from an execution of a Password Authenticated Key Exchange (PAKE) protocol is used to authenticate and encrypt some data payload using a Symmetric Key Protocol (SKP). Unfortunately, most PAKEs of practical interest are studied using so-called game-based models, which – unlike simulation models – do not guarantee secure composition per se. However, Brzuska et al. (CCS 2011) have shown that middle ground is possible in the case of authenticated key exchange that relies on Public- Key Infrastructure (PKI): the game-based models do provide secure composition guarantees when the class of higher-level applications is restricted to SKPs. The question that we pose in this paper is whether or not a similar result can be exhibited for PAKE. Our work answers this question positively. More specifically, we show that PAKE protocols secure according to the game-based Real-or-Random (RoR) definition with the weak forward secrecy of Abdalla et al. (S&P 2015) allow for safe composition with arbitrary, higher-level SKPs. Since there is evidence that most PAKEs secure in the Find-then-Guess (FtG) model are in fact secure according to RoR definition, we can conclude that nearly all provably secure PAKEs enjoy a certain degree of composition, one that at least covers the case of implementing secure channels. http://hdl.handle.net/10993/44002 Title: Optimizing the Performance of an Unpredictable UAV Swarm for Intruder Detection <br/> <br/>Author, co-author: Stolfi Rosso, Daniel; Brust, Matthias R.; Danoy, Grégoire; Bouvry, Pascal <br/> <br/>Commentary: 1173 http://hdl.handle.net/10993/44001 Title: Competitive Evolution of a UAV Swarm for Improving Intruder Detection Rates <br/> <br/>Author, co-author: Stolfi Rosso, Daniel; Brust, Matthias R.; Danoy, Grégoire; Bouvry, Pascal http://hdl.handle.net/10993/44000 Title: IEEE Workshop on Parallel / Distributed Combinatorics and Optimization (PDCO 2020) <br/> <br/>Author, co-author: Danoy, Grégoire; Baz, Didier El; Boyer, Vincent; Dorronsoro, Bernabé; Yang, Laurence T.; Li, Keqin http://hdl.handle.net/10993/43999 Title: Automated design of efficient swarming behaviours: a Q-learning hyper-heuristic approach <br/> <br/>Author, co-author: Duflo, Gabriel; Danoy, Grégoire; Talbi, El-Ghazali; Bouvry, Pascal http://hdl.handle.net/10993/43998 Title: NGAP: a novel hybrid metaheuristic algorithm for round-trip carsharing fleet planning <br/> <br/>Author, co-author: Changaival, Boonyarit; Danoy, Grégoire; Kliazovich; Guinand, Frédéric; Brust, Matthias R.; Musial, Jedrzej; Lavangnananda, Kittichai; Bouvry, Pascal http://hdl.handle.net/10993/43997 Title: A Cooperative Coevolutionary Approach to Maximise Surveillance Coverage of UAV Swarms <br/> <br/>Author, co-author: Stolfi Rosso, Daniel; Brust, Matthias R.; Danoy, Grégoire; Bouvry, Pascal http://hdl.handle.net/10993/43996 Title: Design Challenges of Trustworthy Artificial Intelligence Learning Systems <br/> <br/>Author, co-author: Brust, Matthias R.; Bouvry, Pascal; Danoy, Grégoire; Talbi, El-Ghazali <br/> <br/>Commentary: 1178 http://hdl.handle.net/10993/43995 Title: Tackling Large-Scale and Combinatorial Bi-Level Problems With a Genetic Programming Hyper-Heuristic <br/> <br/>Author, co-author: Kieffer, Emmanuel; Danoy, Grégoire; Brust, Matthias R.; Bouvry, Pascal; Nagih, Anass http://hdl.handle.net/10993/43994 Title: Bayesian optimisation to select Rössler system parameters used in Chaotic Ant Colony Optimisation for Coverage <br/> <br/>Author, co-author: Rosalie, Martin; Kieffer, Emmanuel; Brust, Matthias R.; Danoy, Grégoire; Bouvry, Pascal http://hdl.handle.net/10993/43988 Title: The search for the perfect match: Aligning power-trading products to the energy transition <br/> <br/>Author, co-author: Fridgen, Gilbert; Michaelis, Anne; Rinck, Maximilian; Schöpf, Michael; Weibelzahl, Martin <br/> <br/>Abstract: 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. http://hdl.handle.net/10993/43987 Title: Strukturierte Analyse von Nachfrageflexibilität im Stromsystem und Ableitung eines generischen Geschäftsmodells für (stromintensive) Unternehmen <br/> <br/>Author, co-author: Haupt, Leon; Körner, Marc-Fabian; Schoepf, Michael; Schott, Paul; Fridgen, Gilbert <br/> <br/>Abstract: The expansion of renewable energy requires appropriate flexibility in the electricity system in order to maintain the balance between electricity generation and consumption at all times. The industrial sector plays a central role for a successful energy transition due to the power-intensive processes and the resulting high electricity demand. Industrial demand response may be a cost-effective alternative to other flexibility options. At the same time, companies can reduce electricity procurement costs by providing demand response. Nevertheless, due to a complex decision-making environment and a lack of planning security, only a few companies are currently exploiting the existing potential. To reach the goals of the energy transition, the potential used must still be raised significantly, i.e., companies must align their demand for electricity more closely to the existing supply of electricity. This article supports companies in this transformation process by illustrating dimensions and characteristics of a business model for demand response. Through a literature study and subsequent expert workshops, a generic business model for companies is derived that provides transparency regarding the necessary activities and resources for enabling and implementing demand response. The results were developed using the established Business Model Canvas. This supports companies that have not yet started to use demand response in their business model development and thus reduces barriers to entry. The results presented contribute to an increase in the demand response potential of the industry. http://hdl.handle.net/10993/43985 Title: 3D SPARSE DEFORMATION SIGNATURE FOR DYNAMIC FACE RECOGNITION <br/> <br/>Author, co-author: Shabayek, Abd El Rahman; Aouada, Djamila; Cherenkova, Kseniya; Gusev, Gleb http://hdl.handle.net/10993/43983 Title: 3D DEFORMATION SIGNATURE FOR DYNAMIC FACE RECOGNITION <br/> <br/>Author, co-author: Shabayek, Abd El Rahman; Aouada, Djamila; Cherenkova, Kseniya; Gusev, Gleb; Ottersten, Björn http://hdl.handle.net/10993/43981 Title: A comprehensive study on software aging across android versions and vendors <br/> <br/>Author, co-author: Iannillo, Antonio Ken; Cotroneo, Domenico; Natella, Roberto; Pietrantuono, Roberto http://hdl.handle.net/10993/43949 Title: Intrusion detection on robot cameras using spatio-temporal autoencoders: A self-driving car application <br/> <br/>Author, co-author: Amrouche, Faouzi; Lagraa, Sofiane; Frank, Raphaël; State, Radu <br/> <br/>Abstract: Robot Operating System (ROS) is becoming more and more important and is used widely by developers and researchers in various domains. One of the most important fields where it is being used is the self-driving cars industry. However, this framework is far from being totally secure, and the existing security breaches do not have robust solutions. In this paper we focus on the camera vulnerabilities, as it is often the most important source for the environment discovery and the decision-making process. We propose an unsupervised anomaly detection tool for detecting suspicious frames incoming from camera flows. Our solution is based on spatio-temporal autoencoders used to truthfully reconstruct the camera frames and detect abnormal ones by measuring the difference with the input. We test our approach on a real-word dataset, i.e. flows coming from embedded cameras of self-driving cars. Our solution outperforms the existing works on different scenarios. http://hdl.handle.net/10993/43948 Title: Making Encryption Feel Secure: Investigating how Descriptions of Encryption Impact Perceived Security <br/> <br/>Author, co-author: Distler, Verena; Lallemand, Carine; Koenig, Vincent <br/> <br/>Abstract: When communication about security to end users is ineffective, people frequently misinterpret the protection offered by a system. The discrepancy between the security users perceive a system to have and the actual system state can lead to potentially risky behaviors. It is thus crucial to understand how security perceptions are shaped by interface elements such as text-based descriptions of encryption. This article addresses the question of how encryption should be described to non-experts in a way that enhances perceived security. We tested the following within-subject variables in an online experiment (N=309): a) how to best word encryption, b) whether encryption should be described with a focus on the process or outcome, or both c) whether the objective of encryption should be mentioned d) when mentioning the objective of encryption, how to best describe it e) whether a hash should be displayed to the user. We also investigated the role of context (between subjects). The verbs “encrypt” and “secure” performed comparatively well at enhancing perceived security. Overall, participants stated that they felt more secure not knowing about the objective of encryption. When it is necessary to state the objective, positive wording of the objective of encryption worked best. We discuss implications and why using these results to design for perceived lack of security might be of interest as well. This leads us to discuss ethical concerns, and we give guidelines for the design of user interfaces where encryption should be communicated to end users. http://hdl.handle.net/10993/43941 Title: Blockchain-enabled Traceability and Immutability for Financial Applications <br/> <br/>Author, co-author: Khan, Nida <br/> <br/>Abstract: 􏰔􏰕􏰇􏰖􏰗􏰖􏰓􏰆􏰁The dissertation explores the efficacy of exploiting the transparency and immutability characteristics of blockchain platforms in a financial ecosystem. It elaborates on blockchain technology employing a succinct approach, which serves as the foundation to comprehend the contributions of the present research work. The dissertation gives a verified mathematical model, derived using Nash equilibrium, to function as a framework for blockchain governance. The work elucidates the design, implementation and evaluation of a management plane to monitor and manage blockchain-based decentralized applications. The dissertation also solves the problem of data privacy by the development and evaluation of a management plane for differential privacy preservation through smart contracts. Further, the research work discusses the compliance of the privacy management plane to GDPR using a permissioned blockchain platform. The dissertation is a pioneer in conducting an implementation-based, comparative and an exploratory analysis of tokenization of ethical investment certificates. The dissertation also verifies the utility of blockchain to solve some prevalent issues in social finance. It accomplishes this through the development and testing of a blockchain-based donation application. A qualitative review of the economic impact of blockchain-based micropayments has also been conducted. The discussion on the economic impact also includes a proposition for extending the access of blockchain-based financial services to the underbanked and unbanked people. The work concludes with a hypothetical model of a financial ecosystem, depicting the deployment of the major contributions of this dissertation. 􏰃􏰝􏰃􏰄􏰧􏰁􏰈􏰧􏰨 􏰞􏰇􏰉􏰈􏰏􏰆􏰅􏰁􏰇􏰈􏰆􏰕􏰨 􏰏􏰁􏰂􏰄􏰉􏰊􏰅􏰁􏰋􏰃 􏰅􏰃􏰖􏰓􏰈􏰇􏰕􏰇􏰧􏰛 􏰩􏰁􏰅􏰓 􏰅􏰓􏰃 􏰊􏰇􏰅􏰃􏰈􏰅􏰁􏰆􏰕 􏰅􏰇 􏰖􏰇􏰝􏰊􏰕􏰃􏰅􏰃􏰕􏰛 􏰇􏰋􏰃􏰄􏰓􏰆􏰉􏰕 􏰅􏰓􏰃 􏰃􏰪􏰁􏰂􏰅􏰁􏰈􏰧 􏰫􏰈􏰆􏰈􏰖􏰁􏰆􏰕 􏰁􏰈􏰞􏰄􏰆􏰂􏰅􏰄􏰉􏰖􏰅􏰉􏰄􏰃􏰍 􏰚􏰓􏰃 􏰫􏰈􏰆􏰈􏰖􏰃 􏰂􏰃􏰖􏰅􏰇􏰄 􏰁􏰂 􏰕􏰃􏰆􏰏􏰁􏰈􏰧 􏰁􏰈 􏰅􏰓􏰃 􏰏􏰃􏰊􏰕􏰇􏰛􏰝􏰃􏰈􏰅 􏰇􏰞 􏰙􏰕􏰇􏰖􏰗􏰖􏰓􏰆􏰁􏰈 􏰅􏰇 􏰄􏰃􏰂􏰇􏰕􏰋􏰃 􏰃􏰈􏰏􏰃􏰝􏰁􏰖 􏰁􏰂􏰂􏰉􏰃􏰂 􏰄􏰃􏰕􏰆􏰅􏰃􏰏 􏰅􏰇 􏰅􏰄􏰆􏰈􏰂􏰊􏰆􏰄􏰃􏰈􏰖􏰛􏰨 􏰅􏰓􏰁􏰄􏰏􏰘􏰊􏰆􏰄􏰅􏰛 􏰞􏰄􏰆􏰉􏰏 􏰆􏰂 􏰩􏰃􏰕􏰕 􏰆􏰂 􏰅􏰁􏰝􏰃􏰘 􏰖􏰇􏰈􏰂􏰉􏰝􏰁􏰈􏰧 􏰆􏰈􏰏 􏰃􏰪􏰊􏰃􏰈􏰂􏰁􏰋􏰃 􏰅􏰄􏰆􏰈􏰂􏰆􏰖􏰅􏰁􏰇􏰈􏰂􏰍 􏰚􏰓􏰃 􏰫􏰈􏰆􏰈􏰖􏰃 􏰂􏰃􏰖􏰅􏰇􏰄 􏰓􏰆􏰂 􏰈􏰇􏰅 􏰙􏰃􏰃􏰈 􏰆􏰙􏰕􏰃 􏰅􏰇 􏰂􏰃􏰄􏰋􏰃 􏰅􏰓􏰃 􏰉􏰈􏰏􏰃􏰄􏰙􏰆􏰈􏰗􏰃􏰏 􏰆􏰈􏰏 􏰉􏰈􏰙􏰆􏰈􏰗􏰃􏰏 􏰊􏰇􏰊􏰉􏰕􏰆􏰅􏰁􏰇􏰈􏰂 􏰇􏰞 􏰅􏰓􏰃 􏰩􏰇􏰄􏰕􏰏 􏰂􏰇 􏰞􏰆􏰄􏰍 􏰬􏰭􏰮􏰜􏰀􏰘􏰯􏰰 􏰁􏰈 􏰱􏰲􏰱􏰲 􏰓􏰆􏰂 􏰁􏰈􏰏􏰁􏰖􏰆􏰅􏰃􏰏 􏰅􏰓􏰆􏰅 􏰆 􏰂􏰅􏰄􏰇􏰈􏰧 􏰏􏰁􏰧􏰁􏰅􏰆􏰕 􏰁􏰈􏰞􏰄􏰆􏰂􏰅􏰄􏰉􏰖􏰅􏰉􏰄􏰃 􏰁􏰂 􏰈􏰃􏰃􏰏􏰃􏰏 􏰅􏰇 􏰙􏰃 􏰆􏰙􏰕􏰃 􏰅􏰇 􏰏􏰃􏰆􏰕 􏰙􏰃􏰅􏰅􏰃􏰄 􏰩􏰁􏰅􏰓 􏰏􏰁􏰂􏰄􏰉􏰊􏰅􏰁􏰇􏰈 􏰆􏰈􏰏 􏰙􏰕􏰇􏰖􏰗􏰖􏰓􏰆􏰁􏰈 􏰖􏰆􏰈 􏰊􏰕􏰆􏰛 􏰆 􏰊􏰁􏰋􏰇􏰅􏰆􏰕 􏰄􏰇􏰕􏰃 􏰁􏰈 􏰃􏰂􏰅􏰆􏰙􏰕􏰁􏰂􏰓􏰁􏰈􏰧 􏰅􏰓􏰁􏰂 􏰏􏰁􏰧􏰁􏰅􏰆􏰕 􏰁􏰈􏰞􏰄􏰆􏰂􏰅􏰄􏰉􏰖􏰅􏰉􏰄􏰃􏰍 􏰚􏰓􏰃 􏰏􏰁􏰂􏰂􏰃􏰄􏰅􏰆􏰅􏰁􏰇􏰈 􏰃􏰪􏰊􏰕􏰇􏰄􏰃􏰂 􏰅􏰓􏰃 􏰃􏰳􏰖􏰆􏰖􏰛 􏰇􏰞 􏰃􏰪􏰊􏰕􏰇􏰁􏰅􏰁􏰈􏰧 􏰅􏰓􏰃 􏰅􏰄􏰆􏰈􏰂􏰊􏰆􏰄􏰃􏰈􏰖􏰛 􏰆􏰈􏰏 􏰁􏰝􏰝􏰉􏰅􏰆􏰙􏰁􏰕􏰁􏰅􏰛 􏰖􏰓􏰆􏰄􏰆􏰖􏰅􏰃􏰄􏰁􏰂􏰅􏰁􏰖􏰂 􏰇􏰞 􏰙􏰕􏰇􏰖􏰗􏰖􏰓􏰆􏰁􏰈 􏰊􏰕􏰆􏰅􏰞􏰇􏰄􏰝􏰂 􏰁􏰈 􏰆 􏰫􏰈􏰆􏰈􏰖􏰁􏰆􏰕 􏰃􏰖􏰇􏰂􏰛􏰂􏰅􏰃􏰝􏰍 􏰚􏰓􏰃 􏰏􏰁􏰂􏰂􏰃􏰄􏰅􏰆􏰅􏰁􏰇􏰈 􏰃􏰕􏰆􏰙􏰇􏰄􏰆􏰅􏰃􏰂 􏰇􏰈 􏰙􏰕􏰇􏰖􏰗􏰖􏰓􏰆􏰁􏰈 􏰅􏰃􏰖􏰓􏰈􏰇􏰕􏰇􏰧􏰛 􏰃􏰝􏰊􏰕􏰇􏰛􏰁􏰈􏰧 􏰆 􏰂􏰉􏰖􏰖􏰁􏰈􏰖􏰅 􏰆􏰊􏰊􏰄􏰇􏰆􏰖􏰓􏰨 􏰩􏰓􏰁􏰖􏰓 􏰂􏰃􏰄􏰋􏰃􏰂 􏰆􏰂 􏰅􏰓􏰃 􏰞􏰇􏰉􏰈􏰏􏰆􏰅􏰁􏰇􏰈 􏰅􏰇 􏰖􏰇􏰝􏰊􏰄􏰃􏰓􏰃􏰈􏰏 􏰅􏰓􏰃 􏰖􏰇􏰈􏰅􏰄􏰁􏰙􏰉􏰅􏰁􏰇􏰈􏰂 􏰇􏰞 􏰅􏰓􏰃 􏰊􏰄􏰃􏰂􏰃􏰈􏰅 􏰄􏰃􏰂􏰃􏰆􏰄􏰖􏰓 􏰩􏰇􏰄􏰗􏰍 􏰔􏰕􏰇􏰖􏰗􏰖􏰓􏰆􏰁􏰈 􏰧􏰇􏰋􏰘 􏰃􏰄􏰈􏰆􏰈􏰖􏰃 􏰁􏰂 􏰆􏰈 􏰉􏰈􏰄􏰃􏰂􏰇􏰕􏰋􏰃􏰏 􏰞􏰆􏰖􏰃􏰅 􏰇􏰞 􏰅􏰓􏰃 􏰅􏰃􏰖􏰓􏰈􏰇􏰕􏰇􏰧􏰛􏰨 􏰁􏰈 􏰅􏰓􏰃 􏰆􏰙􏰂􏰃􏰈􏰖􏰃 􏰇􏰞 􏰩􏰓􏰁􏰖􏰓􏰨 􏰅􏰓􏰃 􏰏􏰁􏰂􏰅􏰄􏰁􏰙􏰉􏰅􏰃􏰏 􏰈􏰃􏰅􏰩􏰇􏰄􏰗 􏰖􏰆􏰈 􏰞􏰆􏰁􏰕 􏰅􏰇 􏰞􏰉􏰈􏰖􏰅􏰁􏰇􏰈 􏰇􏰊􏰅􏰁􏰝􏰆􏰕􏰕􏰛 􏰇􏰄 􏰃􏰋􏰃􏰈 􏰂􏰅􏰆􏰕􏰕􏰍 􏰚􏰓􏰃 􏰏􏰁􏰂􏰂􏰃􏰄􏰅􏰆􏰅􏰁􏰇􏰈 􏰧􏰁􏰋􏰃􏰂 􏰆 􏰋􏰃􏰄􏰁􏰫􏰃􏰏 􏰝􏰆􏰅􏰓􏰃􏰝􏰆􏰅􏰁􏰖􏰆􏰕 􏰝􏰇􏰏􏰃􏰕􏰨 􏰏􏰃􏰘 􏰄􏰁􏰋􏰃􏰏 􏰉􏰂􏰁􏰈􏰧 􏰑􏰆􏰂􏰓 􏰃􏰴􏰉􏰁􏰕􏰁􏰙􏰄􏰁􏰉􏰝􏰨 􏰅􏰇 􏰞􏰉􏰈􏰖􏰅􏰁􏰇􏰈 􏰆􏰂 􏰆 􏰞􏰄􏰆􏰝􏰃􏰩􏰇􏰄􏰗 􏰞􏰇􏰄 􏰙􏰕􏰇􏰖􏰗􏰖􏰓􏰆􏰁􏰈 􏰧􏰇􏰋􏰃􏰄􏰈􏰆􏰈􏰖􏰃􏰍 􏰚􏰓􏰃 􏰉􏰂􏰆􏰧􏰃 􏰇􏰞 􏰙􏰕􏰇􏰖􏰗􏰖􏰓􏰆􏰁􏰈 􏰁􏰈 􏰫􏰈􏰆􏰈􏰖􏰁􏰆􏰕 􏰇􏰄􏰧􏰆􏰈􏰁􏰵􏰆􏰅􏰁􏰇􏰈􏰂 􏰃􏰈􏰅􏰆􏰁􏰕􏰂 􏰅􏰓􏰃 􏰄􏰃􏰴􏰉􏰁􏰄􏰃􏰝􏰃􏰈􏰅 􏰇􏰞 􏰆 􏰂􏰇􏰉􏰈􏰏 􏰝􏰆􏰈􏰆􏰧􏰃􏰝􏰃􏰈􏰅 􏰂􏰅􏰄􏰆􏰅􏰃􏰧􏰛 􏰅􏰇 􏰇􏰙􏰘 􏰞􏰉􏰂􏰖􏰆􏰅􏰃 􏰅􏰓􏰃 􏰖􏰇􏰝􏰊􏰕􏰃􏰪􏰁􏰅􏰁􏰃􏰂 􏰇􏰞 􏰅􏰓􏰃 􏰅􏰃􏰖􏰓􏰈􏰇􏰕􏰇􏰧􏰛 􏰆􏰈􏰏 􏰄􏰃􏰊􏰕􏰁􏰖􏰆􏰅􏰃 􏰅􏰓􏰃 􏰆􏰏􏰝􏰁􏰈􏰁􏰂􏰅􏰄􏰆􏰅􏰁􏰋􏰃 􏰞􏰉􏰈􏰖􏰅􏰁􏰇􏰈􏰂 􏰃􏰪􏰁􏰂􏰅􏰁􏰈􏰧 􏰁􏰈 􏰕􏰃􏰧􏰆􏰖􏰛 􏰂􏰛􏰂􏰅􏰃􏰝􏰂􏰍 􏰚􏰓􏰃 􏰄􏰃􏰂􏰃􏰆􏰄􏰖􏰓 􏰩􏰇􏰄􏰗 􏰃􏰕􏰉􏰖􏰁􏰏􏰆􏰅􏰃􏰂 􏰅􏰓􏰃 􏰏􏰃􏰂􏰁􏰧􏰈􏰨 􏰁􏰝􏰊􏰕􏰃􏰝􏰃􏰈􏰅􏰆􏰅􏰁􏰇􏰈 􏰆􏰈􏰏 􏰃􏰋􏰆􏰕􏰉􏰆􏰅􏰁􏰇􏰈 􏰇􏰞 􏰆 􏰝􏰆􏰈􏰆􏰧􏰃􏰝􏰃􏰈􏰅 􏰊􏰕􏰆􏰈􏰃 􏰅􏰇 􏰝􏰇􏰈􏰁􏰅􏰇􏰄 􏰆􏰈􏰏 􏰝􏰆􏰈􏰆􏰧􏰃 􏰙􏰕􏰇􏰖􏰗􏰖􏰓􏰆􏰁􏰈􏰘􏰙􏰆􏰂􏰃􏰏 􏰏􏰃􏰖􏰃􏰈􏰅􏰄􏰆􏰕􏰁􏰵􏰃􏰏 􏰆􏰊􏰊􏰕􏰁􏰖􏰆􏰅􏰁􏰇􏰈􏰂􏰍 􏰶􏰄􏰁􏰋􏰆􏰖􏰛 􏰇􏰞 􏰫􏰈􏰆􏰈􏰖􏰁􏰆􏰕 􏰏􏰆􏰅􏰆 􏰁􏰂 􏰃􏰪􏰅􏰄􏰃􏰝􏰃􏰕􏰛 􏰁􏰝􏰊􏰇􏰄􏰅􏰆􏰈􏰅 􏰞􏰇􏰄 􏰆􏰈􏰛 􏰫􏰈􏰆􏰈􏰖􏰁􏰆􏰕 􏰇􏰄􏰧􏰆􏰈􏰁􏰵􏰆􏰅􏰁􏰇􏰈 􏰙􏰉􏰅 􏰙􏰕􏰇􏰖􏰗􏰖􏰓􏰆􏰁􏰈􏰨 􏰙􏰛 􏰋􏰁􏰄􏰅􏰉􏰃 􏰇􏰞 􏰁􏰅􏰂 􏰁􏰈􏰓􏰃􏰄􏰃􏰈􏰅 􏰁􏰈􏰞􏰄􏰆􏰂􏰘 􏰅􏰄􏰉􏰖􏰅􏰉􏰄􏰃􏰨 􏰊􏰇􏰂􏰃􏰂 􏰆 􏰖􏰓􏰆􏰕􏰕􏰃􏰈􏰧􏰃 􏰁􏰈 􏰅􏰓􏰁􏰂 􏰄􏰃􏰂􏰊􏰃􏰖􏰅􏰍 􏰚􏰓􏰁􏰂 􏰁􏰂 􏰆􏰕􏰂􏰇 􏰇􏰈􏰃 􏰇􏰞 􏰅􏰓􏰃 􏰇􏰋􏰃􏰄􏰆􏰄􏰖􏰓􏰁􏰈􏰧 􏰞􏰆􏰖􏰅􏰇􏰄􏰂 􏰅􏰓􏰆􏰅 􏰝􏰆􏰗􏰃􏰂 􏰉􏰂􏰆􏰧􏰃 􏰇􏰞 􏰙􏰕􏰇􏰖􏰗􏰖􏰓􏰆􏰁􏰈 􏰴􏰉􏰃􏰂􏰅􏰁􏰇􏰈􏰆􏰙􏰕􏰃 􏰞􏰄􏰇􏰝 􏰅􏰓􏰃 􏰷􏰉􏰄􏰇􏰊􏰃􏰆􏰈 􏰸􏰀􏰶􏰎 􏰊􏰃􏰄􏰂􏰊􏰃􏰖􏰅􏰁􏰋􏰃􏰍 􏰶􏰄􏰁􏰋􏰆􏰖􏰛􏰘􏰊􏰄􏰃􏰂􏰃􏰄􏰋􏰁􏰈􏰧 􏰙􏰕􏰇􏰖􏰗􏰖􏰓􏰆􏰁􏰈 􏰊􏰕􏰆􏰅􏰞􏰇􏰄􏰝􏰂 􏰓􏰆􏰋􏰃 􏰆􏰕􏰂􏰇 􏰊􏰄􏰇􏰋􏰃􏰏 􏰅􏰇 􏰙􏰃 􏰋􏰉􏰕􏰈􏰃􏰄􏰆􏰙􏰕􏰃 􏰅􏰇 􏰏􏰆􏰅􏰆 􏰙􏰄􏰃􏰆􏰖􏰓􏰃􏰂􏰍 􏰚􏰓􏰃 􏰏􏰁􏰂􏰂􏰃􏰄􏰅􏰆􏰅􏰁􏰇􏰈 􏰂􏰇􏰕􏰋􏰃􏰂 􏰅􏰓􏰁􏰂 􏰊􏰄􏰇􏰙􏰕􏰃􏰝 􏰙􏰛 􏰁􏰋 􏰀􏰁􏰂􏰂􏰃􏰄􏰅􏰆􏰅􏰁􏰇􏰈 􏰂􏰉􏰊􏰃􏰄􏰋􏰁􏰂􏰇􏰄􏰌 􏰀􏰄􏰍 􏰎􏰆􏰏􏰉 􏰐􏰅􏰆􏰅􏰃 􏰑􏰁􏰏􏰆 􏰒􏰓􏰆􏰈 􏰅􏰓􏰃 􏰏􏰃􏰋􏰃􏰕􏰇􏰊􏰝􏰃􏰈􏰅 􏰆􏰈􏰏 􏰃􏰋􏰆􏰕􏰉􏰆􏰅􏰁􏰇􏰈 􏰇􏰞 􏰆 􏰝􏰆􏰈􏰆􏰧􏰃􏰝􏰃􏰈􏰅 􏰊􏰕􏰆􏰈􏰃 􏰞􏰇􏰄 􏰏􏰁􏰹􏰃􏰄􏰃􏰈􏰅􏰁􏰆􏰕 􏰊􏰄􏰁􏰋􏰆􏰖􏰛 􏰊􏰄􏰃􏰂􏰃􏰄􏰋􏰆􏰅􏰁􏰇􏰈 􏰅􏰓􏰄􏰇􏰉􏰧􏰓 􏰂􏰝􏰆􏰄􏰅 􏰖􏰇􏰈􏰅􏰄􏰆􏰖􏰅􏰂􏰍 􏰚􏰓􏰃 􏰄􏰃􏰂􏰃􏰆􏰄􏰖􏰓 􏰩􏰇􏰄􏰗 􏰏􏰁􏰂􏰖􏰉􏰂􏰂􏰃􏰂 􏰅􏰓􏰃 􏰖􏰇􏰝􏰊􏰕􏰁􏰆􏰈􏰖􏰃 􏰇􏰞 􏰅􏰓􏰃 􏰊􏰄􏰁􏰋􏰆􏰖􏰛 􏰝􏰆􏰈􏰆􏰧􏰃􏰝􏰃􏰈􏰅 􏰊􏰕􏰆􏰈􏰃 􏰅􏰇 􏰸􏰀􏰶􏰎 􏰉􏰂􏰁􏰈􏰧 􏰆 􏰊􏰃􏰄􏰝􏰁􏰂􏰂􏰁􏰇􏰈􏰃􏰏 􏰙􏰕􏰇􏰖􏰗􏰖􏰓􏰆􏰁􏰈 􏰊􏰕􏰆􏰅􏰞􏰇􏰄􏰝􏰍 􏰚􏰓􏰃 􏰈􏰃􏰩 􏰃􏰖􏰇􏰈􏰇􏰝􏰁􏰖 􏰊􏰆􏰄􏰆􏰏􏰁􏰧􏰝 􏰃􏰈􏰞􏰇􏰄􏰖􏰃􏰏 􏰙􏰛 􏰙􏰕􏰇􏰖􏰗􏰖􏰓􏰆􏰁􏰈􏰨 􏰏􏰃􏰖􏰃􏰈􏰅􏰄􏰆􏰕􏰁􏰵􏰃􏰏 􏰫􏰈􏰆􏰈􏰖􏰃􏰨 􏰊􏰄􏰃􏰂􏰃􏰈􏰅􏰂 􏰈􏰇􏰋􏰃􏰕 􏰖􏰓􏰆􏰕􏰘 􏰕􏰃􏰈􏰧􏰃􏰂 􏰆􏰈􏰏 􏰉􏰈􏰊􏰄􏰃􏰖􏰃􏰏􏰃􏰈􏰅􏰃􏰏 􏰂􏰅􏰄􏰆􏰅􏰃􏰧􏰁􏰖 􏰆􏰏􏰋􏰆􏰈􏰅􏰆􏰧􏰃􏰂􏰍 􏰚􏰓􏰃 􏰏􏰁􏰂􏰂􏰃􏰄􏰅􏰆􏰅􏰁􏰇􏰈 􏰁􏰂 􏰆 􏰊􏰁􏰇􏰈􏰃􏰃􏰄 􏰁􏰈 􏰖􏰇􏰈􏰏􏰉􏰖􏰅􏰁􏰈􏰧 􏰆􏰈 􏰁􏰝􏰊􏰕􏰃􏰝􏰃􏰈􏰅􏰆􏰅􏰁􏰇􏰈􏰘􏰙􏰆􏰂􏰃􏰏􏰨 􏰖􏰇􏰝􏰊􏰆􏰄􏰆􏰅􏰁􏰋􏰃 􏰆􏰈􏰏 􏰆􏰈 􏰃􏰪􏰊􏰕􏰇􏰄􏰆􏰅􏰇􏰄􏰛 􏰆􏰈􏰆􏰕􏰛􏰂􏰁􏰂 􏰇􏰞 􏰅􏰇􏰗􏰃􏰈􏰁􏰵􏰆􏰅􏰁􏰇􏰈 􏰇􏰞 􏰃􏰅􏰓􏰁􏰖􏰆􏰕 􏰁􏰈􏰋􏰃􏰂􏰅􏰝􏰃􏰈􏰅 􏰖􏰃􏰄􏰅􏰁􏰫􏰖􏰆􏰅􏰃􏰂􏰍 􏰐􏰇􏰖􏰁􏰆􏰕 􏰫􏰈􏰆􏰈􏰖􏰃 􏰝􏰆􏰄􏰗􏰃􏰅􏰂 􏰓􏰆􏰋􏰃 􏰙􏰃􏰃􏰈 􏰏􏰃􏰋􏰃􏰕􏰇􏰊􏰁􏰈􏰧 􏰁􏰈 􏰷􏰉􏰄􏰇􏰊􏰃 􏰆􏰈􏰏 􏰆􏰄􏰃 􏰋􏰁􏰃􏰩􏰃􏰏 􏰆􏰂 􏰂􏰉􏰂􏰅􏰆􏰁􏰈􏰆􏰙􏰕􏰃 􏰫􏰘 􏰈􏰆􏰈􏰖􏰃 􏰙􏰛 􏰅􏰓􏰃 􏰷􏰉􏰄􏰇􏰊􏰃􏰆􏰈 􏰬􏰇􏰝􏰝􏰁􏰂􏰂􏰁􏰇􏰈􏰍 􏰚􏰓􏰃 􏰄􏰃􏰂􏰃􏰆􏰄􏰖􏰓 􏰩􏰇􏰄􏰗 􏰋􏰃􏰄􏰁􏰫􏰃􏰂 􏰅􏰓􏰃 􏰉􏰅􏰁􏰕􏰁􏰅􏰛 􏰇􏰞 􏰙􏰕􏰇􏰖􏰗􏰖􏰓􏰆􏰁􏰈 􏰅􏰇 􏰂􏰇􏰕􏰋􏰃 􏰂􏰇􏰝􏰃 􏰊􏰄􏰃􏰋􏰆􏰕􏰃􏰈􏰅 􏰁􏰂􏰂􏰉􏰃􏰂 􏰁􏰈 􏰂􏰇􏰖􏰁􏰆􏰕 􏰫􏰈􏰆􏰈􏰖􏰃􏰍 􏰚􏰓􏰃 􏰩􏰇􏰄􏰗 􏰆􏰖􏰖􏰇􏰝􏰊􏰕􏰁􏰂􏰓􏰃􏰂 􏰅􏰓􏰁􏰂 􏰅􏰓􏰄􏰇􏰉􏰧􏰓 􏰅􏰓􏰃 􏰏􏰃􏰋􏰃􏰕􏰇􏰊􏰝􏰃􏰈􏰅 􏰆􏰈􏰏 􏰅􏰃􏰂􏰅􏰁􏰈􏰧 􏰇􏰞 􏰆 􏰙􏰕􏰇􏰖􏰗􏰖􏰓􏰆􏰁􏰈􏰘􏰙􏰆􏰂􏰃􏰏 􏰏􏰇􏰈􏰆􏰅􏰁􏰇􏰈 􏰆􏰊􏰊􏰕􏰁􏰖􏰆􏰅􏰁􏰇􏰈􏰍 􏰠 􏰴􏰉􏰆􏰕􏰁􏰅􏰆􏰅􏰁􏰋􏰃 􏰄􏰃􏰋􏰁􏰃􏰩 􏰇􏰞 􏰅􏰓􏰃 􏰃􏰖􏰇􏰈􏰇􏰝􏰁􏰖 􏰁􏰝􏰊􏰆􏰖􏰅 􏰇􏰞 􏰙􏰕􏰇􏰖􏰗􏰖􏰓􏰆􏰁􏰈􏰘􏰙􏰆􏰂􏰃􏰏 􏰝􏰁􏰖􏰄􏰇􏰊􏰆􏰛􏰝􏰃􏰈􏰅􏰂 􏰓􏰆􏰂 􏰆􏰕􏰂􏰇 􏰙􏰃􏰃􏰈 􏰖􏰇􏰈􏰏􏰉􏰖􏰅􏰃􏰏􏰍 􏰚􏰓􏰃 􏰏􏰁􏰂􏰖􏰉􏰂􏰂􏰁􏰇􏰈 􏰇􏰈 􏰅􏰓􏰃 􏰃􏰖􏰇􏰈􏰇􏰝􏰁􏰖 􏰁􏰝􏰊􏰆􏰖􏰅 􏰆􏰕􏰂􏰇 􏰁􏰈􏰖􏰕􏰉􏰏􏰃􏰂 􏰆 􏰊􏰄􏰇􏰊􏰇􏰂􏰁􏰅􏰁􏰇􏰈 􏰞􏰇􏰄 􏰃􏰪􏰅􏰃􏰈􏰏􏰁􏰈􏰧 􏰅􏰓􏰃 􏰆􏰖􏰖􏰃􏰂􏰂 􏰇􏰞 􏰙􏰕􏰇􏰖􏰗􏰖􏰓􏰆􏰁􏰈􏰘􏰙􏰆􏰂􏰃􏰏 􏰫􏰈􏰆􏰈􏰖􏰁􏰆􏰕 􏰂􏰃􏰄􏰋􏰁􏰖􏰃􏰂 􏰅􏰇 􏰅􏰓􏰃 􏰉􏰈􏰘 􏰏􏰃􏰄􏰙􏰆􏰈􏰗􏰃􏰏 􏰆􏰈􏰏 􏰉􏰈􏰙􏰆􏰈􏰗􏰃􏰏 􏰊􏰃􏰇􏰊􏰕􏰃􏰍 􏰚􏰓􏰃 􏰩􏰇􏰄􏰗 􏰖􏰇􏰈􏰖􏰕􏰉􏰏􏰃􏰂 􏰩􏰁􏰅􏰓 􏰆 􏰓􏰛􏰊􏰇􏰅􏰓􏰃􏰅􏰁􏰖􏰆􏰕 􏰝􏰇􏰏􏰃􏰕 􏰇􏰞 􏰆 􏰫􏰈􏰆􏰈􏰖􏰁􏰆􏰕 􏰃􏰖􏰇􏰂􏰛􏰂􏰅􏰃􏰝􏰨 􏰏􏰃􏰊􏰁􏰖􏰅􏰁􏰈􏰧 􏰅􏰓􏰃 􏰏􏰃􏰊􏰕􏰇􏰛􏰝􏰃􏰈􏰅 􏰇􏰞 􏰅􏰓􏰃 􏰝􏰆􏰺􏰇􏰄 􏰖􏰇􏰈􏰅􏰄􏰁􏰙􏰉􏰅􏰁􏰇􏰈􏰂 􏰇􏰞 􏰅􏰓􏰁􏰂 􏰏􏰁􏰂􏰂􏰃􏰄􏰅􏰆􏰅􏰁􏰇􏰈􏰍 http://hdl.handle.net/10993/43900 Title: Leveraging Natural-language Requirements for Deriving Better Acceptance Criteria from Models <br/> <br/>Author, co-author: Veizaga Campero, Alvaro Mario; Alferez, Mauricio; Torre, Damiano; Sabetzadeh, Mehrdad; Briand, Lionel; Pitskhelauri, Elene <br/> <br/>Abstract: In many software and systems development projects, analysts specify requirements using a combination of modeling and natural language (NL). In such situations, systematic acceptance testing poses a challenge because defining the acceptance criteria (AC) to be met by the system under test has to account not only for the information in the (requirements) model but also that in the NL requirements. In other words, neither models nor NL requirements per se provide a complete picture of the information content relevant to AC. Our work in this paper is prompted by the observation that a reconciliation of the information content in NL requirements and models is necessary for obtaining precise AC. We perform such reconciliation by devising an approach that automatically extracts AC-related information from NL requirements and helps modelers enrich their model with the extracted information. An existing AC derivation technique is then applied to the model that has now been enriched by the information extracted from NL requirements. Using a real case study from the financial domain, we evaluate the usefulness of the AC-related model enrichments recommended by our approach. Our evaluation results are very promising: Over our case study system, a group of five domain experts found 89% of the recommended enrichments relevant to AC and yet absent from the original model (precision of 89%). Furthermore, the experts could not pinpoint any additional information in the NL requirements which was relevant to AC but which had not already been brought to their attention by our approach (recall of 100%) http://hdl.handle.net/10993/43895 Title: Metaheuristics for the Online Printing Shop Scheduling Problem <br/> <br/>Author, co-author: Tessaro Lunardi, Willian; Birgin, Ernesto G.; Ronconi, Débora P.; Voos, Holger <br/> <br/>Abstract: In this work, the online printing shop scheduling problem introduced in (Lunardi et al., Mixed Integer Linear Programming and Constraint Programming Models for the Online Printing Shop Scheduling Problem, Computers & Operations Research, to appear) is considered. This challenging real scheduling problem, that emerged in the nowadays printing industry, corresponds to a flexible job shop scheduling problem with sequencing flexibility; and it presents several complicating specificities such as resumable operations, periods of unavailability of the machines, sequence-dependent setup times, partial overlapping between operations with precedence constraints, and fixed operations, among others. A local search strategy and metaheuristic approaches for the problem are proposed and evaluated. Based on a common representation scheme, trajectory and populational metaheuristics are considered. Extensive numerical experiments with large-sized instances show that the proposed methods are suitable for solving practical instances of the problem; and that they outperform a half-heuristic-half-exact off-the-shelf solver by a large extent. Numerical experiments with classical instances of the flexible job shop scheduling problem show that the introduced methods are also competitive when applied to this particular case.