Sciweavers

    ENTCS
    2007
    135views more  ENTCS 2007»
    Towards a Hybrid Dynamic Logic for Hybrid Dynamic Systems
    14 years 12 days ago
    Towards a Hybrid Dynamic Logic for Hybrid Dynamic Systems
    Download  symbolaris.com
    We introduce a hybrid variant of a dynamic logic with continuous state transitions along differential equations, and we present a sequent calculus for this extended hybrid dynami...
    André Platzer
    claim paper
    Read More »
    ENTCS
    2007
    110views more  ENTCS 2007»
    Data Anonymity in the FOO Voting Scheme
    14 years 12 days ago
    Data Anonymity in the FOO Voting Scheme
    Download  www.win.tue.nl
    We study one of the many aspects of privacy, which is referred to as data anonymity, in a formal context. Data anonymity expresses whether some piece of observed data, such as a v...
    Sjouke Mauw, Jan Verschuren, Erik P. de Vink
    claim paper
    Read More »
    ENTCS
    2007
    121views more  ENTCS 2007»
    Audit-Based Access Control for Electronic Health Records
    14 years 12 days ago
    Audit-Based Access Control for Electronic Health Records
    Download  wwwhome.cs.utwente.nl
    Traditional access control mechanisms aim to prevent illegal actions a-priori occurrence, i.e. before granting a request for a document. There are scenarios however where the secu...
    M. A. C. Dekker, Sandro Etalle
    claim paper
    Read More »
    ENTCS
    2007
    112views more  ENTCS 2007»
    A Holistic Approach to Security Policies - Policy Distribution with XACML over COPS
    14 years 12 days ago
    A Holistic Approach to Security Policies - Policy Distribution with XACML over COPS
    Download  private.sit.fraunhofer.de
    The potentials of modern information technology can only be exploited, if the underlying infrastructure and the applied applications sufficiently take into account all aspects of ...
    Jan Peters, Roland Rieke, Taufiq Rochaeli, Bjö...
    claim paper
    Read More »
    ENTCS
    2007
    131views more  ENTCS 2007»
    Architecting Fault-tolerant Component-based Systems: from requirements to testing
    14 years 12 days ago
    Architecting Fault-tolerant Component-based Systems: from requirements to testing
    Download  www.imtlucca.it
    Fault tolerance is one of the most important means to avoid service failure in the presence of faults, so to guarantee they will not interrupt the service delivery. Software testi...
    Antonio Bucchiarone, Henry Muccini, Patrizio Pelli...
    claim paper
    Read More »
    ENTCS
    2007
    96views more  ENTCS 2007»
    Cryptographic Pattern Matching
    14 years 12 days ago
    Cryptographic Pattern Matching
    Download  www2.imm.dtu.dk
    We construct a language extension for process calculi for modelling the exchange of cryptographically composed data. More specifically, we devise a succinct syntax for terms and ...
    Christoffer Rosenkilde Nielsen, Flemming Nielson, ...
    claim paper
    Read More »
    ENTCS
    2007
    140views more  ENTCS 2007»
    Admissible Representations of Probability Measures
    14 years 12 days ago
    Admissible Representations of Probability Measures
    Download  homepages.inf.ed.ac.uk
    In a recent paper, probabilistic processes are used to generate Borel probability measures on topological spaces X that are equipped with a representation in the sense of Type-2 T...
    Matthias Schröder
    claim paper
    Read More »
    ENTCS
    2007
    153views more  ENTCS 2007»
    The Methods of Approximation and Lifting in Real Computation
    14 years 12 days ago
    The Methods of Approximation and Lifting in Real Computation
    Download  www.math.ist.utl.pt
    The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
    Manuel Lameiras Campagnolo, Kerry Ojakian
    claim paper
    Read More »
    ENTCS
    2007
    91views more  ENTCS 2007»
    A Cappable Almost Everywhere Dominating Computably Enumerable Degree
    14 years 12 days ago
    A Cappable Almost Everywhere Dominating Computably Enumerable Degree
    Download  www.math.uchicago.edu
    We show that there exists an almost everywhere (a.e.) dominating computably enumerable (c.e.) degree which is half of a minimal pair.
    George Barmpalias, Antonio Montalbán
    claim paper
    Read More »
    ENTCS
    2007
    65views more  ENTCS 2007»
    Effective Randomness for Computable Probability Measures
    14 years 12 days ago
    Effective Randomness for Computable Probability Measures
    Download  www.ens-lyon.fr
    Laurent Bienvenu, Wolfgang Merkle
    claim paper
    Read More »
    « first‹ previous…192021222324252627next ›last »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.