2,774 Hits in 5.8 sec

EPR-Based Bounded Model Checking at Word Level [chapter]

Moshe Emmer, Zurab Khasidashvili, Konstantin Korovin, Christoph Sticksel, Andrei Voronkov
2012 Lecture Notes in Computer Science  
We propose a word level, bounded model checking (BMC) algorithm based on translation into the effectively propositional fragment (EPR) of firstorder logic.  ...  We evaluate our EPR-based encoding on model checking problems obtained from industrial hardware designs used at Intel.  ...  These results show that EPR-based model checking is a promising alternative to SAT-based model checking at word-level, scalable to industrial hardware designs.  ... 
doi:10.1007/978-3-642-31365-3_18 fatcat:c27sk36mrfg7lpz5427qkcsbum

Quantum Reading of a Classical Digital Memory

Stefano Pirandola
2011 Physical Review Letters  
We consider a basic model of digital memory where each cell is composed of a reflecting medium with two possible reflectivities.  ...  FIG. 1 : 1 Basic model of memory. where θ u := [E(r u ) ⊗ I](|ξ ξ|). In other words, at least 1 − H(Q) bits per cell can be retrieved from the memory. Exploiting Eqs. ( FIG. 2 : 2 Left.  ...  In other words, in the regime of few photons, narrowband EPR transmitters are generally sufficient to overcome every classical transmitter.  ... 
doi:10.1103/physrevlett.106.090504 pmid:21405610 fatcat:5e3j2rlf2ffzfix74hkftq6zx4

The effect of recency to human mobility

Hugo Barbosa, Fernando B de Lima-Neto, Alexandre Evsukoff, Ronaldo Menezes
2015 EPJ Data Science  
According to them, human movement is based on an exploration/exploitation dichotomy in which individuals choose new locations (exploration) or return to frequently-visited locations (exploitation).  ...  In recent years, we have seen scientists attempt to model and explain human dynamics and, in particular, human movement.  ...  Figure 6 6 Comparison between the EPR model and the recency-based (RM) model.  ... 
doi:10.1140/epjds/s13688-015-0059-8 fatcat:cwyrtusxrrapvctgryanunlht4

Quantum Reading of Digital Memories [article]

Stefano Pirandola
2011 arXiv   pre-print
We consider a basic model of digital memory where each cell is composed of a reflecting medium with two possible reflectivities.  ...  In other words, at least 1 − H(Q) bits per cell can be retrieved from the memory. Exploiting Eqs.  ...  In this problem, for fixed (finite) energy N , the bound B(M, N ) is not monotonic in M (easy to check numerically).  ... 
arXiv:0907.3398v4 fatcat:ke67zolk25ej5fb7f6sqzv5el4

Inferring Invariants with Quantifier Alternations: Taming the Search Space Explosion [article]

Jason R. Koenig, Oded Padon, Sharon Shoham, Alex Aiken
2021 arXiv   pre-print
Recently, [30] suggested combining synthesis and PDR/IC3, but they focus on word-level hardware model checking and do not support quantifier alternations.  ...  At a high level, the SAT-based algorithm for separation from [19] uses Boolean variables to encode the kind (∀/∃) and sort of each quantifier, and additional variables for the presence of each syntactically  ... 
arXiv:2112.05304v1 fatcat:k4vz5cctmvd7xcqvlcxg4ezgme

bv2epr: A Tool for Polynomially Translating Quantifier-Free Bit-Vector Formulas into EPR [chapter]

Gergely Kovásznai, Andreas Fröhlich, Armin Biere
2013 Lecture Notes in Computer Science  
In this paper, we present a tool based on a new polynomial translation from QF BV into Effectively Propositional Logic (EPR).  ...  This allows us to solve QF BV problems using EPR solvers and avoids the exponential growth that comes with bit-blasting.  ...  Tab. 1 summarizes these results, when word-level rewriting in Boolector is switched off.  ... 
doi:10.1007/978-3-642-38574-2_32 fatcat:ioosk4j7hjcmdenxmtdwxzg6fm

One-party Quantum Error Correcting Codes for Unbalanced Errors: Principles and Application to Quantum Dense Coding and Quantum Secure Direct Communications [article]

Kai Wen, Gui Lu Long
2007 arXiv   pre-print
As a result, a large number of quantum secure direct communication protocols based on dense coding is also able to be protected by this new type of one-party-QECC.  ...  In some quantum communication tasks using entangled pairs, the error distributions between two parts of the pairs are unbalanced, and. one party holds the whole entangled pairs at the final stage, and  ...  are of great probability bounded by the error rates in the check pairs.  ... 
arXiv:quant-ph/0609207v2 fatcat:522mbge6kzhc7nlkgpowjdui7y

Implementing QVT-R via semantic interpretation in UML-RSDS

K. Lano, S. Kolahdouz-Rahimi
2020 Journal of Software and Systems Modeling  
The QVT-Relations (QVT-R) model transformation language is an OMG standard notation for model transformation specification.  ...  It has a precise mathematical semantics and criteria for ensuring correctness of applications (including model transformations) by construction.  ...  Check-before-enforce is a coarse-grain mechanism, applying at the level of entire target domains.  ... 
doi:10.1007/s10270-020-00824-3 fatcat:74dso64xzve25piguwltiqadgm

Quantum Direct Communication [chapter]

Gui Lu, Chuan Wang, Fu-Guo Deng, Wan-Ying Wang
2010 Advances in Lasers and Electro Optics  
Recently, Li et al. [17] proposed the first QSDC network based on the two-step QSDC protocol with the EPR states.  ...  If the error rate is lower than the security bound, Carol performs one of the four operations randomly on one photon of each EPR pair and sends all the pairs to Alice.  ...  In a word, the insecurity point of these two DSQC protocols is that there is only one security checking for a two-way quantum communication.  ... 
doi:10.5772/8644 fatcat:5w37szu47fd4haelady2stj2ey

Efficient Quantum Key Distribution Scheme And Proof of Its Unconditional Security [article]

Hoi-Kwong Lo, H. F. Chau (University of Hong Kong), M. Ardehali
2005 arXiv   pre-print
The first major ingredient of our scheme is the assignment of significantly different probabilities to the different polarization bases during both transmission and reception, thus reducing the fraction  ...  Up till now, most proposed proofs of security of single-particle type quantum key distribution schemes have relied heavily upon the fact that the bases are chosen uniformly, randomly and independently.  ...  In other words, the two bases are chosen with substantially different probabilities.  ... 
arXiv:quant-ph/0011056v3 fatcat:6sg372lflrgcfa2i5j6jpteu3i

Efficiently solving quantified bit-vector formulas

Christoph M. Wintersteiger, Youssef Hamadi, Leonardo de Moura
2012 Formal methods in system design  
, and model finding techniques based on skeletons/templates.  ...  We present a new approach based on a set of effective word-level simplifications that are traditionally employed in automated theorem proving, heuristic quantifier instantiation methods used in SMT solvers  ...  We say MC is a model checking procedure. Before we describe how MC can be constructed, let us take a look at how structures are encoded in our approach.  ... 
doi:10.1007/s10703-012-0156-2 fatcat:osy3wkp6ovbhjirjfeslakkoyq

Demonstration of Short-lived Complexes of Cytochromecwith Cytochromebc1by EPR Spectroscopy

Marcin Sarewicz, Arkadiusz Borek, Fevzi Daldal, Wojciech Froncisz, Artur Osyczka
2008 Journal of Biological Chemistry  
We concluded that EPR monitors just the tightly bound state of the association and that an averaged lifetime of this state decreases from over 100 s at low ionic strength to less than 400 ns at an ionic  ...  Our data show a successive decrease of the bound cytochrome c fraction as the ionic strength increases, with a limit of ϳ120 mM NaCl above which essentially no bound cytochrome c can be detected by EPR  ...  , at salt concentrations where a minimal amount of or no bound cytochrome c is observed with EPR, enzymatic activity still remains at the maximum level.  ... 
doi:10.1074/jbc.m802174200 pmid:18617515 pmcid:PMC2529009 fatcat:hoxudp3mxran3oragdf3sidvcy

Faithful to the Earth: Reporting Experiences of Artifact-Centered Design in Healthcare [chapter]

Federico Cabitza
2010 Proceedings of COOP 2010  
on a very well structured paper-based patient record that supported the management of approximately 15,000 hospitalizations yearly and that had been progressively and collaboratively optimized by both  ...  The task we were assigned to as requirement analysts was slightly different for either settings: the MOHU was involved in a process of digitization of its paperbased drug ordering system; this was based  ...  are the models on which EPRs are based [ 15 ] .  ... 
doi:10.1007/978-1-84996-211-7_3 dblp:conf/coop/Cabitza10 fatcat:mgjwvbq55jhldo5746rxuuwrka

WS-Naming: location migration, replication, and failure transparency support for Web Services

Andrew Grimshaw, Mark Morgan, Karolina Sarnowska
2009 Concurrency and Computation  
Before a client can communicate with a resource named via an abstract name, the abstract name must first be resolved or bound to an address.  ...  While targeted at Web Services, the same techniques can be used in a REST setting as well. The remainder of this paper is organized as follows.  ...  Bind time: The point at which an abstract name is bound to a resource address.  ... 
doi:10.1002/cpe.1407 fatcat:rrwlkiwi55bejmvdqfrrl6yjem

Test of Einstein-Podolsky-Rosen Steering Based on the All-Versus-Nothing Proof

Chunfeng Wu, Jing-Ling Chen, Xiang-Jun Ye, Hong-Yi Su, Dong-Ling Deng, Zhenghan Wang, C. H. Oh
2014 Scientific Reports  
Through the bound of probabilities imposed by local-hidden-state model, the proposed test shows that steering can be detected by the all-versus-nothing argument experimentally even in the presence of imprecision  ...  Recently, a simple approach was presented to identify Einstein-Podolsky-Rosen steering based on all-versus-nothing argument, offering a strong condition to witness the steerability of a family of two-qubit  ...  located at r a !  ... 
doi:10.1038/srep04291 pmid:24598858 pmcid:PMC3944728 fatcat:nsj77sfy2zbsfl37fj6zr6mohm
« Previous Showing results 1 — 15 out of 2,774 results