Game Theoretic Modeling of Malicious Users in Collaborative Networks
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
This paper summarizes the round-table discussion that was held during the European Congress of Chemical Engineering (ECCE) in Nice, France, in October 2015 on this topic. The panellists come from different fields of chemical engineering and have thus broug ...
We introduce a suitable concept of weak evolution in the context of the radial quintic focussing semilinear wave equation on R^{3+1}, that is adapted to continuation past type II singularities. We show that the weak extension leads to type I singularity fo ...
Tetra-n-butylammonium (TBA) (eta(6)-biphenyl)diphenyfferrate was formed unexpectedly in the reaction of (TBA)(2)[Fe4S4Cl4] with an excess of phenyllithium. This complex belongs to a novel type of organoferrate. ...
The recently discovered type-II Weyl points appear at the boundary between electron and hole pockets. Type-II Weyl semimetals that host such points are predicted to exhibit a new type of chiral anomaly and possess thermodynamic properties very different fr ...
We consider the problem where a group of wireless nodes, connected to the same broadcast domain, want to create pairwise secrets, in the presence of an adversary Eve, who tries to listen in and steal these secrets. Existing solutions assume that Eve cannot ...
Institute of Electrical and Electronics Engineers Inc.2013
We propose to investigate a new approach to effect checking that has an elegant solution to the effect polymorphism problem. The central idea is that instead of talking about effects we talk about capabilities. For instance, instead of saying a function “t ...
In this paper the development of a Wireless Sensor Network (WSN) for construction noise identification and sound locating is investigated using the novel application of Bluetooth Low Energy (BLE). Three WSNs using different system-on-chip (SoC) devices and ...
Our work studies network neutrality, a property of communication networks which means that they treat all traffic the same, regardless of application, content provider or communication protocol. This is an important problem, because sometimes users suspect ...
The Locomotive Assignment Problem (LAP) is a class of planning and scheduling problems solved by assigning a fleet of locomotives to a network of trains. In the planning versions of the LAP, the type of consist (a group of linked locomotives) assigned to e ...
We define a new primitive, input-aware equivocable commitment, baring similar hardness assumptions as plaintext-aware encryption and featuring equivocability. We construct an actual input-aware equivocable commitment protocol, based on a flavor of Diffie-H ...
