نتایج جستجو برای: boolean element

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

1993
SERBAN D. PROTOPOPESCU XERXES TATA

We review the physics assumptions and input used in ISAJET 7.0 / ISASUSY 1.0 that are relevant for simulating fundamental processes within the framework of the Minimal Supersymmetric Standard Model (MSSM) at p¯ p and pp colliders. After a brief discussion of the underlying MSSM framework, we discuss event simulation and list the sparticle production processes and decay modes that have been inco...

The aim of this paper is to extend results established by H. Onoand T. Kowalski regarding directly indecomposable commutative residuatedlattices to the non-commutative case. The main theorem states that a residuatedlattice A is directly indecomposable if and only if its Boolean center B(A)is {0, 1}. We also prove that any linearly ordered residuated lattice and anylocal residuated lattice are d...

2007
Joel Ratsaby

The Sauer-Shelah lemma has been instrumental in the analysis of algorithms in many areas including learning theory, combinatorial geometry, graph theory. Algorithms over discrete structures, for instance, sets of Boolean functions, often involve a search over a constrained subset which satisfies some properties. In this paper we study the complexity of classes of functions h of finite VCdimensi...

2002
Stefano Moretti Kosuke Odagiri Peter Richardson Michael H. Seymour Bryan R. Webber

We describe the implementation of supersymmetric processes in the HERWIG Monte Carlo event generator. We define relevant parameter and mixing conventions and list the hard scattering matrix elements. Our implementation is based on the Minimum Supersymmetric Standard Model, with the option of R-parity violation. The sparticle spectrum is completely general. Both hadron–hadron and lepton–lepton c...

2012
Andrey Mokhov

A switch, mechanical or electrical, is a fundamental building element of digital systems. The theory of switching networks, or simply circuits, dates back to Shannon’s thesis (1937), where he employed Boolean algebra for reasoning about the functionality of switching networks, and graph theory for describing and manipulating their structure. Following this classic approach, one can deduce funct...

2004
Ivo Düntsch Michael Winter

The origins of Boolean contact algebras go back to the works of Leśniewski [8] on mereology and Leonard and Goodman [7] on the calculus of individuals on the one hand, and, on the other hand, the efforts of e.g. de Laguna [2], Tarski [12] and Whitehead [13] to use regions instead of points as the basic entity of geometry. A central role played the notion of “connection” (or “contact”) of region...

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

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