31,490 Hits in 4.9 sec

Counting Successes: Effects and Transformations for Non-deterministic Programs [chapter]

Nick Benton, Andrew Kennedy, Martin Hofmann, Vivek Nigam
2016 Lecture Notes in Computer Science  
A relational semantics for the effect system establishes the soundness of both the analysis and its use in effect-based program transformations.  ...  We give a simple effect system for non-deterministic programs, tracking static approximations to the number of results that may be produced by each computation.  ...  We thank the referees for their thorough and helpful comments.  ... 
doi:10.1007/978-3-319-30936-1_3 fatcat:dx3sffxt2jd7vdw44axu4iwidq

Model Counting Modulo Theories [article]

Quoc-Sang Phan
2015 arXiv   pre-print
These techniques are scalable to real-world programs, and illustrative case studies include C programs from Linux kernel, a Java program from a European project and anonymity protocols.  ...  In this thesis, we present a novel approach to the problem by reducing it to a model counting problem on first-order logic, which we name Model Counting Modulo Theories or #SMT for brevity.  ...  [87] implemented this type-directed transformation and used Dynamic Symbolic Execution (also known as concolic testing) as a program analysis tool for non-interference.  ... 
arXiv:1504.02796v1 fatcat:vf5khgpgkfdqvhhdsivlmb4f5y

Projected Model Counting [article]

Rehan Abdul Aziz and Geoffrey Chu and Christian Muise and Peter Stuckey
2015 arXiv   pre-print
We discuss three different approaches to projected model counting (two of which are novel), and compare their performance on different benchmark problems.  ...  The task is to compute the number of assignments to P such that there exists an extension to 'non-priority' variables V\P that satisfies F.  ...  DPLL-style model counting One of the most successful approaches for model counting extends the DPLL algorithm (see [2, 16, 18] ).  ... 
arXiv:1507.07648v1 fatcat:d5tvldy6yncenpv7xl5nmssxre

Towards Capturing PTIME with no Counting Construct (but with a Choice Operator) [article]

Eugenia Ternovska
2021 arXiv   pre-print
We show how counting, reachability and "mixed" examples (that include linear equations modulo two) are axiomatized in the logic, and how an arbitrary PTIME Turing machine can be encoded.  ...  Towards this goal, we define a logic that is obtained from first-order logic with fixed points, FO(FP), by a series of transformations that include restricting logical connectives and adding a dynamic  ...  A standard approach is then to transform the AFW to a non-deterministic finite automaton (NFA).  ... 
arXiv:2111.07978v1 fatcat:s2jiasyeafd7hb2kp4uka5ugii

Approximate Counting with Deterministic Guarantees for Affinity Computation [chapter]

Clément Viricel, David Simoncini, David Allouche, Simon de Givry, Sophie Barbe, Thomas Schiex
2015 Advances in Intelligent Systems and Computing  
Usual criteria for design include stability of the designed protein and affinity between it and a ligand of interest.  ...  Because of its extreme computational cost, bio-physicists have designed the K * algorithm, which combines Best-First A * search with dominance analysis to provide an estimate of the partition function with deterministic  ...  In our knowledge, our algorithm is the first deterministic algorithm for weighted counting that exploits soft local consistency reformulation based lower bounds for counting with deterministic guarantees  ... 
doi:10.1007/978-3-319-18167-7_15 fatcat:4227mbucurhi5miz7ck2t6gkta

Parallel Triangles Counting Using Pipelining [article]

Julián Aráoz, Cristina Zoltan
2015 arXiv   pre-print
We present another program schema that is useful for describing problem solutions, that can exploit dynamic pipeline parallelism without having to deal with replica- tion factors.  ...  We present the schema in an example: counting triangles in graphs, in particular when the graph do not fit in memory.  ...  A dynamic scheduler for executing transformations on a NiMo program scales up to the number of available processors.  ... 
arXiv:1510.03354v1 fatcat:czangjzbvjh7djvnbgki3tsmae

$$\#\exists $$ SAT: Projected Model Counting [chapter]

Rehan Abdul Aziz, Geoffrey Chu, Christian Muise, Peter Stuckey
2015 Lecture Notes in Computer Science  
We discuss three different approaches to #∃SAT (two of which are novel), and compare their performance on different benchmark problems.  ...  The task is to compute the number of assignments to P such that there exists an extension to non-priority variables V \ P that satisfies F . We denote this as #∃SAT.  ...  Consider the following program F with priority variables p, q, r and non-priority variables x, y, z.  ... 
doi:10.1007/978-3-319-24318-4_10 fatcat:5t2w54bkbzbcdfemvdigrgsfee

Predicting U.S. Tuberculosis Case Counts through 2020

Rachel S. Y e l k Woodruff, Carla A. Winston, Roque Miramontes, Madhukar Pai
2013 PLoS ONE  
TB case count predictions will help TB control programs identify needs for cultural competency, such as languages and interpreters needed for translating materials or engaging in appropriate community  ...  TB case counts reported through the National Tuberculosis Surveillance System from 2000-2010 were log-transformed, and linear regression was performed to calculate predicted annual case counts and 95%  ...  Acknowledgments Disclaimer: The findings and conclusions are those of the authors and do not necessarily represent the views of the Centers for Disease Control and Prevention.  ... 
doi:10.1371/journal.pone.0065276 pmid:23785416 pmcid:PMC3681901 fatcat:3oqj7dye2rbljm3ntcxe6hdey4

A Portable and Customizable Profiling Framework for Java Based on Bytecode Instruction Counting [chapter]

Walter Binder
2005 Lecture Notes in Computer Science  
In contrast, program transformations allow to generate reproducible profiles in a fully portable way with significantly less overhead.  ...  Prevailing profilers for Java, which rely on standard, native-code profiling interfaces, are not portable, give imprecise results due to serious measurement perturbation, and cause excessive overheads.  ...  Many prevailing sampling profilers for Java use an external timer to trigger the sampling, resulting in non-deterministic behaviour: For the same program and input, the generated profiles may vary very  ... 
doi:10.1007/11575467_13 fatcat:l3tfvigt5zdajg5gawjxjthmlq

Deterministic Approximate Counting for Degree-2 Polynomial Threshold Functions [article]

Anindya De, Ilias Diakonikolas, Rocco A. Servedio
2013 arXiv   pre-print
This is the first deterministic algorithm for this counting problem in which the running time is polynomial in n for = o(1).  ...  As an application of our counting result, we give a deterministic FPT multiplicative (1 ±)-approximation algorithm to approximate the k-th absolute moment _x ∼{-1,1}^n[|p(x)^k|] of a degree-2 polynomial  ...  We note that the dynamic programming approach we employ could be used to do deterministic approximate counting for a decoupled n-variable Gaussian degree-2 polynomialp(x) in poly(n, 1/ǫ) time even without  ... 
arXiv:1311.7105v1 fatcat:dgp7wbox4ffcbaqobsv2wyldna

Photoelectron-Counting Distributions for Irradiance-Modulated Radiation*

Paul Diament, M. C. Teich
1970 Journal of the Optical Society of America  
Photoelectron-counting distributions are obtained for modulated radiation sources, with arbitrary modulation waveforms and depths.  ...  Modulation is shown to broaden the counting distributions, an effect interpretable as accentuated photon bunching.  ...  Perelstein in programming the computer calculations for the myriad cases from which the representative examples presented here were selected.  ... 
doi:10.1364/josa.60.000682 fatcat:dr7h35uk2jgppe35dzt2eza73e

Model Counting for Recursively-Defined Strings [chapter]

Minh-Thai Trinh, Duc-Hiep Chu, Joxan Jaffar
2017 Lecture Notes in Computer Science  
clearly displayed, and (2) non-progression, where cyclic reasoning in the reduction process may be terminated (thus allowing for the algorithm to look elsewhere).  ...  We present a new algorithm for model counting of a class of string constraints.  ...  It was also supported in part by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award).  ... 
doi:10.1007/978-3-319-63390-9_21 fatcat:vrmsafy6dncffbk7j7fdrwtbeu

Concurrent Non-deferred Reference Counting on the Microgrid: First Experiences [chapter]

Stephan Herhut, Carl Joslin, Sven-Bodo Scholz, Raphael Poss, Clemens Grelck
2011 Lecture Notes in Computer Science  
We, instead, employ a dedicated core for reference counting and use asynchronous messaging to emit reference counting operations.  ...  Non-deferred reference counting is a fundamental building block of implicit heap management of functional array languages in general and Single Assignment C in particular.  ...  , for his help in running the measurements and producing the figures presented in this paper.  ... 
doi:10.1007/978-3-642-24276-2_12 fatcat:xcdw6nguobeixecwgmqmlszgty

Strong succession in arbuscular mycorrhizal fungal communities

Cheng Gao, Liliam Montoya, Ling Xu, Mary Madera, Joy Hollingsworth, Elizabeth Purdom, Robert B. Hutmacher, Jeffery A. Dahlberg, Devin Coleman-Derr, Peggy G. Lemaux, John W. Taylor
2018 The ISME Journal  
count datasets, e.g., Bray-Curtis dissimilarity for counts v.  ...  three datasets, whether rarefied for AMF reads, for all fungal reads, or not rarified and transformed by the CLR method ( Fig. 6; Fig.  ... 
doi:10.1038/s41396-018-0264-0 pmid:30171254 fatcat:psk74z2oavb6vh4ukumrfd32bq
« Previous Showing results 1 — 15 out of 31,490 results