Search for dissertations about: "expressiveness"
Showing result 1 - 5 of 51 swedish dissertations containing the word expressiveness.
-
1. Logics of Knowledge and Cryptography : Completeness and Expressiveness
Abstract : An understanding of cryptographic protocols requires that we examine the knowledge of protocol participants and adversaries: When a participant receives a message, does she know who sent it? Does she know that the message is fresh, and not merely a replay of some old message? Does a network spy know who is talking to whom? This thesis studies logics of knowledge and cryptography. Specifically, the thesis addresses the problem of how to make the concept of knowledge reflect feasible computability within a Kripke-style semantics. READ MORE
-
2. Real-Time Workload Models : Expressiveness vs. Analysis Efficiency
Abstract : The requirements for real-time systems in safety-critical applications typically contain strict timing constraints. The design of such a system must be subject to extensive validation to guarantee that critical timing constraints will never be violated while the system operates. READ MORE
-
3. Expressiveness in virtual talking faces
Abstract : In this thesis, different aspects concerning how to make synthetic talking faces more expressive have been studied. How can we collect data for the studies, how is the lip articulation affected by expressive speech, can the recorded data be used interchangeably in different face models, can we use eye movements in the agent for communicative purposes? The work of this thesis includes studies of these questions and also an experiment using a talking head as a complement to a targeted audio device, in order to increase the intelligibility of the speech. READ MORE
-
4. Chain Graphs : Interpretations, Expressiveness and Learning Algorithms
Abstract : Probabilistic graphical models are currently one of the most commonly used architectures for modelling and reasoning with uncertainty. The most widely used subclass of these models is directed acyclic graphs, also known as Bayesian networks, which are used in a wide range of applications both in research and industry. READ MORE
-
5. The Fusion Calculus : Expressiveness and Symmetry in Mobile Processes
Abstract : The fusion calculus is presented as a significant step towards a canonical calculus of concurrency. It simplifies and extends the π-calculus of Milner, Parrow and Walker.The fusion calculus contains the polyadic π-calculus as a proper subcalculus and thus inherits all its expressive power. READ MORE