Filters








635 Hits in 4.5 sec

Optimal Upper and Lower Bounds for Boolean Expressions by Dissociation [article]

Wolfgang Gatterbauer, Dan Suciu
2011 arXiv   pre-print
This paper develops upper and lower bounds for the probability of Boolean expressions by treating multiple occurrences of variables as independent and assigning them new individual probabilities.  ...  Our technique generalizes and extends the underlying idea of a number of recent approaches which are varyingly called node splitting, variable renaming, variable splitting, or dissociation for probabilistic  ...  This work was partially supported by NSF grant IIS-0915054, and was performed in the context of the LaPushDB project (http://LaPushDB.com/).  ... 
arXiv:1105.2813v1 fatcat:umjhjqpmf5hcppi475n3mu67l4

Oblivious bounds on the probability of boolean functions

Wolfgang Gatterbauer, Dan Suciu
2014 ACM Transactions on Database Systems  
This paper develops upper and lower bounds for the probability of Boolean functions by treating multiple occurrences of variables as independent and assigning them new individual probabilities.  ...  upper or lower bound on the probability of the original formula by choosing appropriate probabilities for the dissociated variables.  ...  We would also like to thank Vibhav Gogate for helpful discussions on quantization and guidance for using his tool SampleSearch, Alexandra Meliou for suggesting the name "dissociation," and the reviewers  ... 
doi:10.1145/2532641 fatcat:6lehdkydyndzflh7rkerohgelq

Approximate lifted inference with probabilistic databases

Wolfgang Gatterbauer, Dan Suciu
2015 Proceedings of the VLDB Endowment  
In our approach, every query is evaluated entirely in the database engine by evaluating a fixed number of query plans, each providing an upper bound on the true probability, then taking their minimum.  ...  We give a detailed experimental evaluation of our approach and, in the process, provide a new way of thinking about the value of probabilistic methods over non-probabilistic methods for ranking query answers  ...  This work was supported in part by NSF grants IIS-0513877, IIS-0713576, IIS-0915054, and IIS-1115188. We thank the reviewers for their careful reading of this manuscript and their detailed feedback.  ... 
doi:10.14778/2735479.2735494 fatcat:safh6aiiwfdlxpitp3bipdxg7y

Approximate Lifted Inference with Probabilistic Databases [article]

Wolfgang Gatterbauer, Dan Suciu
2014 arXiv   pre-print
In our approach, every query is evaluated entirely in the database engine by evaluating a fixed number of query plans, each providing an upper bound on the true probability, then taking their minimum.  ...  We give a detailed experimental evaluation of our approach and, in the process, provide a new way of thinking about the value of probabilistic methods over non-probabilistic methods for ranking query answers  ...  This work was supported in part by NSF grants IIS-0513877, IIS-0713576, IIS-0915054, and IIS-1115188. We thank the reviewers for their careful reading of this manuscript and their detailed feedback.  ... 
arXiv:1412.1069v1 fatcat:pqzm45dp5rh6njv5wrybpdj3xq

Dissociation and Propagation for Approximate Lifted Inference with Standard Relational Database Management Systems [article]

Wolfgang Gatterbauer, Dan Suciu
2016 arXiv   pre-print
by evaluating a fixed number of query plans, each providing an upper bound on the true probability, then taking their minimum.  ...  We give a detailed experimental evaluation of our approach and, in the process, provide a new way of thinking about the value of probabilistic methods over non-probabilistic methods for ranking query answers  ...  We like to thank Abhay Jha for help with the experiments in the workshop version of this paper, Alexandra Meliou for suggesting the name "dissociation", and Vibhav Gogate for guidance in using his tool  ... 
arXiv:1310.6257v4 fatcat:ematfjcsdbavzd7siv3q2bikza

A "Fuzzy"-Logic Language for Encoding Multiple Physical Traits in Biomolecules

Shira Warszawski, Ravit Netzer, Dan S. Tawfik, Sarel J. Fleishman
2014 Journal of Molecular Biology  
Each trait is represented by the equilibrium fractional occupancy of the desired state relative to its alternatives, ranging from none to full occupancy, and the different traits are combined using Boolean  ...  In another paper, we presented a new combinatorial backbone design algorithm AbDesign where the fuzzy-logic framework was used to optimize protein backbones and sequences for both stability and binding  ...  Acknowledgments We thank all members of the Fleishman laboratory who read and commented on this manuscript, as well as Ingemar Andre and Amnon Horovitz for critical discussion. Research in the  ... 
doi:10.1016/j.jmb.2014.10.002 pmid:25311857 pmcid:PMC4270444 fatcat:s6ocymvaybffxfsyhmvcn2puem

A Mathematical Framework for Superintelligent Machines [article]

Daniel J. Buehrer
2018 arXiv   pre-print
Class algebra basically defines the eval/eval-1 Galois connection between the residuated Boolean algebras of 1. equivalence classes and super/sub classes of class algebra type expressions, and 2. a residual  ...  We describe a class calculus that is expressive enough to describe and improve its own learning process.  ...  In Figure 3 , the first formula is the union of the intersections of the lower/upper bounds for the side nodes. The second formula is the union of the lower/upper bounds of the bottom node.  ... 
arXiv:1804.03301v1 fatcat:nofcd7pfkjhmdhtiihkebostbu

Frequency selectivity, multistability, and oscillations emerge from models of genetic regulatory systems

Paul Smolen, Douglas A. Baxter, John H. Byrne
1998 American Journal of Physiology - Cell Physiology  
; transcriptional regulation; optimal stimulus frequencies; control theory REGULATION OF GENE expression by signals from outside and within the cell plays important roles in many biological processes,  ...  Such optimal frequencies are suggested by recent experiments comparing training paradigms for long-term memory formation and examining changes in mRNA levels in repetitively stimulated cultured cells.  ...  We thank Pramod Dash, Ron Dror, and Shogo Endo for comments on an earlier draft of the paper and B. Ermentrout for use of his XPP program for simulations.  ... 
doi:10.1152/ajpcell.1998.274.2.c531 fatcat:zkx2mwk7srgghfpo6smdmo7a54

Modeling Transcriptional Control in Gene Networks—Methods, Recent Results, and Future Directions

P Smolen
2000 Bulletin of Mathematical Biology  
For example, these elements can generate multiple stable states for gene product concentrations, state-dependent responses to stimuli, circadian rhythms and other oscillations, and optimal stimulus frequencies  ...  Mathematical models are useful for providing a framework for integrating data and gaining insights into the static and dynamic behavior of complex biological systems such as networks of interacting genes  ...  ACKNOWLEDGEMENTS Supported by NIH grants T32 NS07373, R01 RR11626, and P01 NS38310.  ... 
doi:10.1006/bulm.1999.0155 pmid:10824430 fatcat:lqoe2gmkznahvgleafh24m2w6i

Frequency selectivity, multistability, and oscillations emerge from models of genetic regulatory systems

P Smolen, D A Baxter, J H Byrne
1998 American Journal of Physiology  
Such optimal frequencies are suggested by recent experiments comparing training paradigms for long-term memory formation and examining changes in mRNA levels in repetitively stimulated cultured cells.  ...  The addition of competition between activating and repressing TFs provided a plausible explanation for optimal stimulus frequencies that give maximal transcription.  ...  We thank Pramod Dash, Ron Dror, and Shogo Endo for comments on an earlier draft of the paper and B. Ermentrout for use of his XPP program for simulations.  ... 
pmid:9486144 fatcat:2aekbomd7jduvgf5jvfg33r57y

Query Processing over Uncertain Data [chapter]

Nilesh Dalvi, Dan Olteanu
2017 Encyclopedia of Database Systems  
approximate evaluation of hard queries, e.g., computing lower and upper bounds on answer probabilities via dissociation of input probabilistic events [14] or running Monte Carlo simulations that aggregate  ...  Top-k queries can be evaluated by incrementally approximating the probabilities of the results using the above anytime algorithm until the lower bounds of k tuples are greater than the upper bounds of  ... 
doi:10.1007/978-1-4899-7993-3_80689-1 fatcat:fesows5udzcgpcihitkwzlpeze

The First Evaluation of Pseudo-Boolean Solvers (PB'05)

Vasco M. Manquinho, Olivier Roussel, Daniel Le Berre, Laurent Simon
2006 Journal on Satisfiability, Boolean Modeling and Computation  
The second goal is to stimulate the research efforts in this field and contribute to the creation of better technologies. This paper details the organization and the results of this event.  ...  The first evaluation of pseudo-boolean solvers was organized as a subtrack of the SAT 2005 competition.  ...  providing the computing resources and to Robert MONTJOY for his assistance.  ... 
doi:10.3233/sat190018 fatcat:w5gxdkngrrgljh45dlqgipibyy

Compiling constraints in clp(FD)

Philippe Codognet, Daniel Diaz
1996 The Journal of Logic Programming  
We detail its implementation, and present an abstract instruction set for the constraint solver that can be smoothly integrated into the WAM architecture.  ...  We also show that, following the "glass-box" approach, clp(FD) can be naturally enhanced with various new constraints such as constructive disjunction, Boolean constraints, nonlinear constraints, and symbolic  ...  We also thank Bjorn Carlsson, Mats Carlsson, and Gregory Sidebottom for many fruitful discussions.  ... 
doi:10.1016/0743-1066(95)00121-2 fatcat:euupmqccdbgetpvxoxkeystuea

Tractable Lineages on Treelike Instances

Antoine Amarilli, Pierre Bourhis, Pierre Senellart
2016 Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems - PODS '16  
This dichotomy relies on recent polynomial bounds on the extraction of planar graphs as minors, and implies lower bounds in non-probabilistic settings, for query evaluation and match counting in subinstance-closed  ...  By contrast, we can strengthen the previous dichotomy to lineages, and show that there are even UCQs with disequalities that have superpolynomial OBDDs on all unbounded-treewidth graph classes; we give  ...  This work was partly funded by the Télécom ParisTech Research Chair on Big Data and Market Insights.  ... 
doi:10.1145/2902251.2902301 dblp:conf/pods/AmarilliBS16 fatcat:skanmavk2vfrfgop3wqq3ebpoe

Image Computation for Polynomial Dynamical Systems Using the Bernstein Expansion [chapter]

Thao Dang, David Salinas
2009 Lecture Notes in Computer Science  
Such image computations constitute a crucial component in typical tools for set-based analysis of hybrid systems and embedded software with polynomial dynamics, which found applications in various engineering  ...  One typical example is the computation of all states reachable from a given set in one step by a continuous dynamics described by a differential or difference equation.  ...  Ivancic and O. Maler for inspiring us and for their valuable collaboration.  ... 
doi:10.1007/978-3-642-02658-4_19 fatcat:pi6w6dtt2zbupn67kkboawqqke
« Previous Showing results 1 — 15 out of 635 results