Sökning: "completeness"

Visar resultat 1 - 5 av 107 avhandlingar innehållade ordet completeness.

1. 1. Logics of Knowledge and Cryptography : Completeness and Expressiveness

   Författare :Mika Cohen; Mads Dam; Alessio Lomuscio; KTH; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; epistemic logic; first-order logic; formal cryptography; static equivalence; security protocols; BAN logic; multi-agent system; completeness; logical omniscience problem; Computer science; Datavetenskap;

   Sammanfattning : 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. LÄS MER

3. 2. Barnhälsovårdsjournalen som kunskapskälla : En analys av fullständighet, instruktionsenlighet och tillförlitlighet : [an analysis of completeness, reliability and accuracy of recording]

   Författare :Elisabet Hagelin; Uppsala universitet; []
   Nyckelord :MEDICIN OCH HÄLSOVETENSKAP; MEDICAL AND HEALTH SCIENCES; Obstetrics and gynaecology; Records; Child Health Services; preschool children; data source; completeness; accuracy; inter-rater reliability; quality of care; Obstetrik och kvinnosjukdomar; Obstetrics and women s diseases; Obstetrik och kvinnosjukdomar; pediatrik; Pediatrics;

   Sammanfattning : Information contained in medical records is increasingly used for the evaluation of the process of care and to study the health status of individuals. Hence, if recorded information were accurate and reliable, records would be a valuable data source in quality assessment and research. LÄS MER

4. 3. Hardness of Constraint Satisfaction and Hypergraph Coloring : Constructions of Probabilistically Checkable Proofs with Perfect Completeness

   Författare :Sangxia Huang; Johan Håstad; Rishi Saket; KTH; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Combinatorial optimization; approximation; inapproximability; hardness; probabilistically checkable proofs; pcp; perfect completeness; boolean constraint satisfaction problem; csp; graph coloring; hypergraph coloring; direct sum; superposition; label cover; Computer Science; Datalogi;

   Sammanfattning : A Probabilistically Checkable Proof (PCP) of a mathematical statement is a proof written in a special manner that allows for efficient probabilistic verification. The celebrated PCP Theorem states that for every family of statements in NP, there is a probabilistic verification procedure that checks the validity of a PCP proof by reading only 3 bits from it. LÄS MER

5. 4. Data Quality in Wide-Area Monitoring and Control Systems : PMU Data Latency, Completness, and Design of Wide-Area Damping Systems

   Författare :Kun Zhu; Lars Nordström; Boming Zhang; KTH; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Phasor Measurement Units; Wide-Area Monitoring and Control systems; latency; completeness; power system communication; simulation; empirical study;

   Sammanfattning : The strain on modern electrical power system operation has led to an ever increasing utilization of new Information Communication Technology (ICT) systems to enhance the reliability and efficiency of grid operation. Among these proposals, Phasor Measurement Unit (PMU)-based Wide-Area Monitoring and Control (WAMC) systems have been recognized as one of the enablers of “Smart Grid”, particularly at the transmission level, due to their capability to improve the real-time situational awareness of the grid. LÄS MER

7. 5. Norms and Alternatives : Logical Aspects of Normative Reasoning

   Författare :Karl Nygren; Valentin Goranko; Dag Westerståhl; Ivano Ciardelli; Stockholms universitet; []
   Nyckelord :HUMANIORA; HUMANITIES; alternative semantics; norms; normative systems; deontic logic; modal logic; inquisitive semantics; inquisitive logic; semantics of questions; disjunction; free choice; obligation; permission; action; normative reasoning; ignorance; axiomatic system; completeness; Philosophy; filosofi;

   Sammanfattning : In this thesis, I develop and investigate various novel semantic frameworks for deontic logic. Deontic logic concerns the logical aspects of normative reasoning. In particular, it concerns reasoning about what is required, allowed and forbidden. I focus on two main issues: free-choice reasoning and the role of norms in deontic logic. LÄS MER