A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
We also prove a communication complexity lower bound on protocols that securely compute a large class of functionalities in this setting. ... In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties. ... I would like to thank Boaz Barak and Jonathan Katz for helpful discussions. ...doi:10.1007/978-3-540-24638-1_12 fatcat:n5k3vligqzdvhf5ogjf4bdsaua
In this paper, we prove lower bounds and impossibility results for secure protocols in this setting. ... Keywords: secure computation, protocol composition, self and general composition, impossibility results, lower bounds, non-black-box and black-box simulation. * This paper combines results that appeared ... Acknowledgements I would like to express deep thanks to Ran Canetti for his help in this work. Among other things, some key ideas in the proof of the black-box lower bound are due to Ran. ...doi:10.1007/s00145-007-9015-5 fatcat:clx76ielrvgv7b3yjj7xpqgz7e
lower bound for the layout area of a specific Boolean function. ... (iii) The maximal code problem for deterministic finite automata is shown to be in DET and NL-hard, while a PSPACE upper bound and NP- hardness lower bound hold for the case of nondeterministic finite ...
Aids and Behavior
DHS data produce significantly lower estimates of all indicators for both sexes in all countries. ... PSI estimates of multiple partnerships are 1.7 times higher [1.4 for men (M), 3.0 for women (W)], cumulative prevalence of concurrency is 2.4 times higher (2.2 M, 2.7 W), the point prevalence of concurrency ... Acknowledgments We would like to thank Measure DHS for generously sharing the data. ...doi:10.1007/s10461-013-0618-6 pmid:24077973 pmcid:PMC4097893 fatcat:wk3u6cxvwzhrzj7lus3bw3q75e
lower, derivation for simulation of queue, stacks, and tapes, 78, 56 upper and lower, definition for computation of square parts of integers, 78, 246 for analysis of minimum polygonal separafast, for ... parallel randomized algorithms, 76, 1 Algebras concrete process, introduction of global renaming operators, 78, 205 Algorithms Book embeddings graphs, trade-08 between page number and page width, 79, 155 Bounds ... semantics for, 79, 210 square parts of integers, survey of related work and definition of upper and lower bounds, 78, 246 Concurrency real-time, model for distributed comput- ing, compositional ...doi:10.1016/0890-5401(88)90023-5 fatcat:xnrqpyeuefaepjhrbx4w5pqz4e
68028 68Q15 68Q25 92B20 Green, F. (1-CLRK; Worcester, MA) A lower bound for monotone perceptrons. ... Summary: “We prove a tight log lower bound on middle space for one-way alternating Turing machines that accept nonregular tally languages. ...
Concurrent analysis of composite materials can provide the interaction among scales for better composite design, analysis, and performance prediction. ... A data-driven concurrent n-scale modeling theory (FExSCA^n-1) is proposed in this paper utilizing a mechanistic reduced order model (ROM) called self-consistent clustering analysis (SCA). ... Acknowledgements The financial support for this project was provided by AFOSR (FA9550-18-1-0381) and National Science Foundation's Mechanics of Materials and Structures (MOMS) program under the Grant No ...arXiv:2105.10411v2 fatcat:irpirclqp5gt3gvnkbvrmkbdxy
Lecture Notes in Computer Science
We evaluate the effectiveness of preemption sealing, implemented in the Chess tool, for these two scenarios on newly released concurrency libraries for Microsoft's .NET framework. ... We demonstrate that this strategy is effective in addressing two key problems in testing industrial-scale concurrent programs: (1) tolerating existing errors in order to find more errors, and (2) compositional ... (Rows 1-4) , and for compositional testing (Row 5). ...doi:10.1007/978-3-642-12002-2_35 fatcat:2paghdjh6rdlfcw6a5tjmwf7km
In this paper, in discrete-event systems modeled by finite-state automata (FSAs), we show new thinking on the tools of detector and concurrent composition and derive two new algorithms for verifying strong ... These results strengthen the NL upper bound on verifying SPD and the PSPACE upper bound on verifying SPDD for deadlock-free and divergence-free FSAs in the literature. ... Later in  , an NL upper bound was given for the verification problem of strong detectability based on the concurrent-composition method. ...arXiv:2109.08854v1 fatcat:obamugnvqrcapn5zxncjbozro4
Furthermore, a numerical solution of the optimization problem will always yield upper bounds for concurrence, what cannot help to distinguish separable from entangled states: what is needed are lower bounds ... Equation (5) allows for the derivation of a hierarchy of lower bounds of mixed state concurrence of multipartite quantum systems of arbitrary finite dimension, which are obtained by optimization over a ...doi:10.1140/epjst/e2008-00692-0 fatcat:eagg5vkxfngfvlpyvmab2bxdfm
Internal consistency was high for measures of Cronbach's alpha (0.87 to 0.94), omega (0.87 to 0.93), and greatest lower bound (0.90 to 0.95). ... Arthritis self-efficacy is important for successful disease management. ... Acknowledgments This research was supported by the Centers for Disease Control and Prevention's National Center for Chronic Disease Prevention and Health Promotion by Cooperative Agreement no. ...doi:10.1155/2014/385256 pmid:25215233 pmcid:PMC4158258 fatcat:hv664asfnjfbpmunvwcwtcd3ou
+c FIG. 1 : 1 Squared mixed-state concurrence c( ) 2 , approximated by its measurable lower bound Tr ( ⊗ (V1 + V2)/2) as given by(2), vs. its lower bound in quasi pure approximation, for random states ... Thus, Eq. (2) provides a reliable and directly measurable bound for an unknown state's concurrence. ...doi:10.1103/physrevlett.98.140505 pmid:17501257 fatcat:wav2izv3zzbh3ejufo6xvmp3rq
Lecture Notes in Computer Science
As a demonstration of our techniques, we give a self-contained proof of the o(log n/ log log n) lower bound for the round complexity of black-box concurrent zero-knowledge protocols, first shown by Canetti ... We also construct a modular procedure to amplify simulator-query lower bounds (as above), to generic lower bounds in the black-box concurrent zero-knowledge setting. ... Acknowledgments We thank to Iftach Haitner and Johan Håstad for useful discussion in the early stage of this research. ...doi:10.1007/978-3-642-28914-9_29 fatcat:p7f2eq2dcrc23dq5pidmjy2mty
We derive upper and lower bounds on the interference in the worst case. Applications to distributed computation are also discussed.” Balcazar, José L. ... We present a scheme for designing effi- cient concurrent algorithms to add and remove elements from a shared pool of elements. ...
rather than only select the best composition solution for a given request. ... When a composite service is planned in the context of dynamic service environments, there is another aspect which has not been taken into account by existing works, namely, concurrency -the fact that multiple ... Therefore, for each entry the lower bound dominates the upper bound, i.e., LB(e 1 ) UB(e 1 ), LB(e 2 ) UB(e 2 ), and so on. As can be seen from Fig. 4: 1. ...doi:10.5626/jcse.2012.6.2.89 fatcat:ensueuczi5gtrkdco4a66vgf7m
« Previous Showing results 1 — 15 out of 52,183 results