نتایج جستجو برای: de morgan stone semi

تعداد نتایج: 1698255  

Journal: :Journal of Mathematical Analysis and Applications 1984

Journal: :SIAM J. Matrix Analysis Applications 2014
Emmanuel Agullo Luc Giraud Yan-Fei Jing

We consider the solution of large linear systems with multiple right-hand sides using a block GMRES approach. We introduce a new algorithm that effectively handles the situation of almost rank deficient block generated by the block Arnoldi procedure and that enables the recycling of spectral information at restart. The first feature is inherited from an algorithm introduced by Robbé and Sadkane...

Journal: :Electr. Notes Theor. Comput. Sci. 2004
Michael Huth Shekhar Pradhan

We propose assertion-consistency (AC) semi-lattices as suitable orders for the analysis of partial models. Such orders express semantic entailment, multiple-viewpoint and multiple-valued analysis, maintain internal consistency of reasoning, and subsume finite De Morgan lattices. We classify those orders that are finite and distributive and apply them to design an efficient algorithm for multipl...

Journal: :International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 2012
Carol L. Walker Elbert A. Walker

The algebra of truth values for fuzzy sets of type-2 consists of all mappings from the unit interval into itself, with operations certain convolutions of these mappings with respect to pointwise max and min. This algebra generalizes the truth-value algebras of both type-1 and of interval-valued fuzzy sets, and has been studied rather extensively both from a theoretical and applied point of view...

2013
Anat Ganor Ilan Komargodski Troy Lee Ran Raz

We show a connection between the De Morgan formula size of a Boolean function f : {0, 1}n → {0, 1} and the noise stability of the function. Specifically, we prove that for 0 < p ≤ 1/2 it holds that NSp(f) ≥ 1− 2p √ L(f) · ‖f‖2 · (1− ‖f‖2) where NSp(f) is the noise stability of f with noise parameter p, ‖f‖ is the L2 norm of f , and L(f) is the De Morgan formula size of f . This result stems fro...

2014
Linda R. Watson Amy M. Wetherby Paul J. Yoder Lonnie Zwaigenbaum Wendy Roberts Sally J. Rogers Hannah H. Schertz Isabel M. Smith Wendy L. Stone Rebecca J. Landa Catherine Lord Daniel S. Messinger Peter Mundy Samuel L. Odom Susan E. Bryson Alice S. Carter Elizabeth R. Crais Annette Estes Connie Kasari Michael Siller Lindee Morgan Lauren Turner-Brown Kathleen M. Baggett Grace T. Baranek J. Steven Reznick

http://jei.sagepub.com/content/early/2014/07/11/1053815114542507 The online version of this article can be found at: DOI: 10.1177/1053815114542507 published online 11 July 2014 Journal of Early Intervention Linda R. Watson, Amy M. Wetherby, Paul J. Yoder and Lonnie Zwaigenbaum Reznick, Wendy Roberts, Sally J. Rogers, Hannah H. Schertz, Isabel M. Smith, Wendy L. Stone, Rebecca J. Landa, Catherin...

Journal: :Turkish journal of urology 2017
Yasser A Noureldin Alexandrine da Silva Nader Fahmy Sero Andonian

OBJECTIVE To study the effect of ascorbic acid (AA) supplementation on urinary pH, metabolic stone workup parameters, and development of de novo urolithiasis in stone-forming patients. MATERIAL AND METHODS A retrospective review of the patients followed-up at a tertiary stone centre between September 2009 and October 2015 was performed. Patients with recurrent urolithiasis who received AA sup...

Journal: :CoRR 2017
Alexander Golovnev Daniel Reichman Igor Shinkar

Detecting patterns in strings and images is a fundamental and well studied problem. We study the circuit complexity of the string matching problem under two popular choices of gates: De Morgan and threshold gates. For strings of length n and patterns of length log n k ≤ n− o(n), we prove super polynomial lower bounds for De Morgan circuits of depth 2, and nearly linear lower bounds for depth 2 ...

2017
Alexander Golovnev Daniel Reichman Igor Shinkar

Detecting patterns in strings and images is a fundamental and widely studied problem. Motivated by the proliferation of specialized circuits in pattern recognition tasks, we study the circuit complexity of pattern matching under two popular choices of gates: De Morgan and threshold gates. For strings of length n and patterns of length log n k ≤ n− o(n), we prove super polynomial lower bounds fo...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید