References of "Lecture Notes in Computer Science"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailHow to Assess the Usability Metrics of E-Voting Schemes
Marky, Karola; Zollinger, Marie-Laure UL; Funk, Markus et al

in Lecture Notes in Computer Science (2019, February)

Detailed reference viewed: 83 (7 UL)
Full Text
Peer Reviewed
See detailFast and optimal countermeasure selection for attack defence trees
Muller, Steve UL; Harpes, Carlo; Muller, Cédric

in Lecture Notes in Computer Science (2017), 10224 LNCS

Risk treatment is an important part of risk management, and deals with the question which security controls shall be implemented in order to mitigate risk. Indeed, most notably when the mitigated risk is ... [more ▼]

Risk treatment is an important part of risk management, and deals with the question which security controls shall be implemented in order to mitigate risk. Indeed, most notably when the mitigated risk is low, the costs engendered by the implementation of a security control may exceed its benefits. The question becomes particularly interesting if there are several countermeasures to choose from. A promising candidate for modeling the effect of defensive mechanisms on a risk scenario are attack–defence trees. Such trees allow one to compute the risk of a scenario before and after the implementation of a security control, and thus to weigh its benefits against its costs. A naive approach for finding an optimal set of security controls is to try out all possible combinations. However, such a procedure quickly reaches its limits already for a small number of defences. This paper presents a novel branch-and-bound algorithm, which skips a large part of the combinations that cannot lead to an optimal solution. The performance is thereby increased by several orders of magnitude compared to the pure brute–force version. © 2017, Springer International Publishing AG. [less ▲]

Detailed reference viewed: 54 (9 UL)
Full Text
Peer Reviewed
See detailPump Efficiency Analysis of Waste Water Treatment Plants: A Data Mining Approach Using Signal Decomposition for Decision Making
Torregrossa, Dario; Hansen, Joachim UL; Cornelissen, Alex et al

in Lecture Notes in Computer Science (2017)

Detailed reference viewed: 100 (15 UL)
Full Text
Peer Reviewed
See detailComputational Complexity of Input/Output Logic
Sun, Xin UL; Ambrossio, Diego Agustin UL

in Lecture Notes in Computer Science (2015), 9426

Input/output logics are abstract structures designed to represent conditional norms. The complexity of input/output logic has been sparsely developed. In this paper we study the complexity of input/output ... [more ▼]

Input/output logics are abstract structures designed to represent conditional norms. The complexity of input/output logic has been sparsely developed. In this paper we study the complexity of input/output logics. We show that the lower bound of the complexity of the fulfillment problem of 4 input/output logics is coNP, while the upper bound is either coNP or P^NP. [less ▲]

Detailed reference viewed: 64 (6 UL)
Full Text
Peer Reviewed
See detailDo graphical cues effectively inform users? A socio-technical security study in accessing wifi networks.
Ferreira, Ana UL; Huynen, Jean-Louis UL; Koenig, Vincent UL et al

in Lecture Notes in Computer Science (2015), 9190

We study whether the padlock and the signal strength bars, two visual cues shown in network managers, convey their intended messages. Since users often choose insecure networks when they should not ... [more ▼]

We study whether the padlock and the signal strength bars, two visual cues shown in network managers, convey their intended messages. Since users often choose insecure networks when they should not, finding the answer is not obvious; in our study we clarify whether the problem lies in uninformative and ambiguous cues or in the user who, despite understanding the cues, chooses otherwise. This paper describes experiments and comments the results that bring evidence to our study. [less ▲]

Detailed reference viewed: 246 (92 UL)
Full Text
Peer Reviewed
See detailComputing coalitions in Multiagent Systems: A contextual reasoning approach
bikakis, Antonis; Caire, Patrice UL

in Lecture Notes in Computer Science (2015), 8953

In multiagent systems, agents often have to rely on other agents to reach their goals, for example when they lack a needed resource or do not have the capability to perform a required action. Agents there ... [more ▼]

In multiagent systems, agents often have to rely on other agents to reach their goals, for example when they lack a needed resource or do not have the capability to perform a required action. Agents there- fore need to cooperate. Some of the questions then raised, such as, which agent to cooperate with, are addressed in the field of coalition formation. In this paper we go further and first, address the question of how to com- pute the solution space for the formation of coalitions using a contextual reasoning approach. We model agents as contexts in Multi-Context Sys- tems (MCS) and dependence relations among agents as bridge rules. We then systematically compute all potential coalitions using algorithms for MCS equilibria. Finally, given a set of functional and non-functional requirements, we propose ways to select the best solutions. We illustrate our approach with an example from robotics. [less ▲]

Detailed reference viewed: 98 (4 UL)
Full Text
Peer Reviewed
See detailA Conceptual Framework to Study Socio-Technical Security
Ferreira, Ana UL; Huynen, Jean-Louis UL; Koenig, Vincent UL et al

in Lecture Notes in Computer Science (2014)

We propose an operational framework for a social, technical and contextual analysis of security. The framework provides guidelines about how to model a system as a layered set of interacting elements, and ... [more ▼]

We propose an operational framework for a social, technical and contextual analysis of security. The framework provides guidelines about how to model a system as a layered set of interacting elements, and proposes two methodologies to analyse technical and social vulnerabilities. We show how to apply the framework in a use case scenario. [less ▲]

Detailed reference viewed: 238 (46 UL)
Full Text
Peer Reviewed
See detailSocio-technical Security Analysis of Wireless Hotspots
Ferreira, Ana UL; Huynen, Jean-Louis UL; Koenig, Vincent UL et al

in Lecture Notes in Computer Science (2014)

We present a socio-technical analysis of security of Hotspot and Hotspot 2.0. The analysis focuses is user-centric, and aim at understanding which user action can compromise security in presence of a ... [more ▼]

We present a socio-technical analysis of security of Hotspot and Hotspot 2.0. The analysis focuses is user-centric, and aim at understanding which user action can compromise security in presence of a attacker. We identify research questions about possible factors that may affect user’s security decisions, and propose experiments to answer them. [less ▲]

Detailed reference viewed: 223 (26 UL)
Full Text
Peer Reviewed
See detailSocio-Technical Study On the Effect of Trust and Context when Choosing WiFi Names
Ferreira, Ana UL; Huynen, Jean-Louis UL; Koenig, Vincent UL et al

in Lecture Notes in Computer Science (2013), 8203

We study trust and context as factors influencing how people choose wireless network names. Our approach imagines the mindset of a hypothetical attacker whose goal is to ensnare unsuspecting victims into ... [more ▼]

We study trust and context as factors influencing how people choose wireless network names. Our approach imagines the mindset of a hypothetical attacker whose goal is to ensnare unsuspecting victims into accessing dishonest WiFi access points. For this purpose, we conducted an online survey. We used two separate forms. The first form asked a random group of participants to rate a list of wireless names according to their preferences (some real and others purposely made-up) and afterwards with implied trust in mind. The second form was designed to assess the effect of context and it asked a different set of respondents to rate the same list of wireless names in relation to four different contexts. Our results provide some evidence confirming the idea that trust and context can be exploited by an attacker by purposely, or strategically, naming WiFi access points with reference to trust or within certain contexts. We suggest, in certain cases, possible defence strategies. [less ▲]

Detailed reference viewed: 253 (20 UL)
Full Text
Peer Reviewed
See detailLogic of Non-Monotonic Interactive Proofs
Kramer, Simon UL

in Lecture Notes in Computer Science (2013), 7750

We propose a monotonic logic of internalised non-monotonic or instant interactive proofs (LiiP) and reconstruct an existing monotonic logic of internalised monotonic or persistent interactive proofs (LiP ... [more ▼]

We propose a monotonic logic of internalised non-monotonic or instant interactive proofs (LiiP) and reconstruct an existing monotonic logic of internalised monotonic or persistent interactive proofs (LiP) as a minimal conservative extension of LiiP. Instant interactive proofs effect a fragile epistemic impact in their intended communities of peer reviewers that consists in the impermanent induction of the knowledge of their proof goal by means of the knowledge of the proof with the interpreting reviewer: If my peer reviewer knew my proof then she would at least then know that its proof goal is true. Their impact is fragile and their induction of knowledge impermanent in the sense of being the case possibly only at the instant of learning the proof. This accounts for the important possibility of internalising proofs of statements whose truth value can vary, which, as opposed to invariant statements, cannot have persistent proofs. So instant interactive proofs effect a temporary transfer of certain propositional knowledge (knowable ephemeral facts) via the transmission of certain individual knowledge (knowable non-monotonic proofs) in distributed systems of multiple interacting agents. [less ▲]

Detailed reference viewed: 46 (3 UL)
Full Text
Peer Reviewed
See detailSelf-assembly models of variable resolution
Mizera, Andrzej UL; Czeizler, Eugen; Petre, Ion

in Lecture Notes in Computer Science (2012), 7625

Detailed reference viewed: 33 (0 UL)
Peer Reviewed
See detailFairness and Information-theoretic Privacy for Reputation
Schiffner, Stefan UL; Clauß, Sebastian; Steinbrecher, Sandra

in Lecture Notes in Computer Science (2011)

Detailed reference viewed: 21 (3 UL)
Full Text
Peer Reviewed
See detailDifferential Evolution Algorithms with Cellular Populations
Dorronsoro, Bernabé UL; Bouvry, Pascal UL

in Lecture Notes in Computer Science (2011), 6239

Differential Evolution (DE) algorithms are efficient Evolutionary Algorithms (EAs) for the continuous optimization domain. There exist a large number of DE variants in the literature. In this paper, we ... [more ▼]

Differential Evolution (DE) algorithms are efficient Evolutionary Algorithms (EAs) for the continuous optimization domain. There exist a large number of DE variants in the literature. In this paper, we analyze the effect of adding a cellular structure to the population of some of the most outstanding existing ones. The original algorithms will be compared versus their equivalent versions with cellular population both in terms of accuracy and convergence speed. As a result, we conclude that the cellular versions of the algorithms perform, in general, better than the equivalent state-of-the-art ones in the two considered issues. [less ▲]

Detailed reference viewed: 70 (0 UL)
Full Text
Peer Reviewed
See detailA Multi-Agent Organizational Framework for Coevolutionary Optimization
Danoy, Grégoire UL; Bouvry, Pascal UL; Boissier, Olivier

in Lecture Notes in Computer Science (2010), 4

This paper introduces DAFO, a Distributed Agent Framework for Optimization that helps in designing and applying Coevolutionary Genetic Algorithms (CGAs). CGAs have already proven to be efficient in ... [more ▼]

This paper introduces DAFO, a Distributed Agent Framework for Optimization that helps in designing and applying Coevolutionary Genetic Algorithms (CGAs). CGAs have already proven to be efficient in solving hard optimization problems, however they have not been considered in the existing agent-based metaheuristics frameworks that currently provide limited organization models. As a solution, DAFO includes a complete organization and reorganization model, Multi-Agent System for EVolutionary Optimization (MAS4EVO), that permits to formalize CGAs structure, interactions and adaptation. Examples of existing and original CGAs modeled using MAS4EVO are provided and an experimental proof of their efficiency is given on an emergent topology control problem in mobile hybrid ad hoc networks called the injection network problem. [less ▲]

Detailed reference viewed: 67 (1 UL)
Full Text
Peer Reviewed
See detailIterated Local Search for de Novo Genomic Sequencing
Dorronsoro, Bernabé UL; Bouvry, Pascal UL; Alba, Enrique

in Lecture Notes in Computer Science (2010), 6114

The sequencing process of a DNA chain for reading its components supposes a complex process, since only small DNA fragments can be read nowadays. Therefore, the use of optimization algorithms is required ... [more ▼]

The sequencing process of a DNA chain for reading its components supposes a complex process, since only small DNA fragments can be read nowadays. Therefore, the use of optimization algorithms is required to rebuild a single chain from all the small pieces. We address here a simplified version of the problem, in which no errors in the sequencing process are allowed. The methods typically used in the literature for this problem are not satisfactory when solving realistic size instances, so there is a need for new more efficient and accurate methods. We propose a new iterated local search algorithm, highly competitive with the best algorithms in the literature, and considerably faster. [less ▲]

Detailed reference viewed: 64 (0 UL)
Full Text
Peer Reviewed
See detailComputational heuristics for simplifying a biological model
Petre, Ion; Mizera, Andrzej UL; Back, Ralph-Johan

in Lecture Notes in Computer Science (2009), 5635

Detailed reference viewed: 92 (0 UL)
Full Text
Peer Reviewed
See detailUsing Game Theory to configure P2P SIP
Becker, Sheila UL; State, Radu UL; Engel, Thomas UL

in Lecture Notes in Computer Science (2009)

Detailed reference viewed: 70 (4 UL)
Peer Reviewed
See detailThe Influence of Mutation on Protein-Ligand Docking Optimization: A Locality Analysis
Tavares, Jorge; Tantar, Alexandru-Adrian UL; Melab, Nouredine et al

in LECTURE NOTES IN COMPUTER SCIENCE (2008), 5199

Evolutionary approaches to protein-ligand docking typically use a real-value encoding and mutation operators based on Gaussian and Cauchy distributions. The choice of mutation is important for an ... [more ▼]

Evolutionary approaches to protein-ligand docking typically use a real-value encoding and mutation operators based on Gaussian and Cauchy distributions. The choice of mutation is important for an efficient algorithm for this problem. We investigate the effect of mutation operators by locality analysis. High locality means that small variations in the genotype imply small variations in the phenotype. Results show that Gaussian-based operators have stronger locality than Cauchy-based ones, especially if an annealing scheme is used to control the variance. [less ▲]

Detailed reference viewed: 172 (0 UL)
Full Text
Peer Reviewed
See detailMechanical failure in microstructural heterogeneous materials
Bordas, Stéphane UL; Hoppe, R. H. W.; Petrova, S. I.

in Lecture Notes in Computer Science (2007), 4310 LNCS

Various heterogeneous materials with multiple scales and multiple phases in the microstructure have been produced in the recent years. We consider a mechanical failure due to the initiation and ... [more ▼]

Various heterogeneous materials with multiple scales and multiple phases in the microstructure have been produced in the recent years. We consider a mechanical failure due to the initiation and propagation of cracks in places of high pore density in the microstructures. A multi-scale method based on the asymptotic homogenization theory together with the mesh superposition method (s-version of FEM) is presented for modeling of cracks. The homogenization approach is used on the global domain excluding the vicinity of the crack where the periodicity of the microstructures is lost and this approach fails. The multiple scale method relies on efficient combination of both macroscopic and microscopic models. The mesh superposition method uses two independent (global and local) finite element meshes and the concept of superposing the local mesh onto the global continuous mesh in such a way that both meshes not necessarily coincide. The homogenized material model is considered on the global mesh while the crack is analyzed in the local domain (patch) which allows to have an arbitrary geometry with respect to the underlying global finite elements. Numerical experiments for biomorphic cellular ceramics with porous microstructures produced from natural wood are presented. [less ▲]

Detailed reference viewed: 46 (2 UL)