Search results for " Languages"
showing 10 items of 1859 documents
HAWK 2.0: A Monte Carlo program for Higgs production in vector-boson fusion and Higgs strahlung at hadron colliders
2019
Abstract The Monte Carlo integrator HAWK provides precision predictions for Higgs production at hadron colliders in vector-boson fusion and Higgs strahlung, i.e. in production processes where the Higgs boson is Attached to WeaK bosons. The fully differential predictions include the full QCD and electroweak next-to-leading-order corrections. Results are computed as integrated cross sections and as binned distributions for important hadron-collider observables. Title of program: HAWK, version 2.0 Catalogue Id: AEWT_v1_0 Nature of problem Precision calculation of cross sections and differential distributions for Higgs-boson production in vector-boson fusion and Higgs strahlung at the LHC as de…
FlexibleSUSY—A spectrum generator generator for supersymmetric models
2019
This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2018) Abstract We introduce FlexibleSUSY, a Mathematica and C++ package, which generates a fast, precise C++ spectrum generator for any SUSY model specified by the user. The generated code is designed with both speed and modularity in mind, making it easy to adapt and extend with new features. The model is specified by supplying the superpotential, gauge structure and particle content in a SARAH model file; specific boundary conditions e.g. at the GUT, weak or intermediate scales are defined in a separate F... Title of program: FlexibleSUSY Catalogue Id: AEVI_v1_0 Nature of problem Determini…
AMYR 2: A new version of a computer program for pair potential calculation of molecular associations
2019
Abstract AMYR is a computer program for the calculation of molecular associations using Fraga's pairwise atom - atom potential. The interaction energy is evaluated through a 1/R expansion. The electrostatic energy is calculated through either the one-centre-per atom or the three-centres-per atom model by Hunter and Sanders. A pairwise dispersion energy term is included in the potential and corrected by a damping function. The program carries out energy minimizations through variable metric methods. Th... Title of program: AMYR 2 Catalogue Id: ADIW_v1_0 Nature of problem The program determines the optimum separation and relative orientation of two interacting molecular systems through a mini…
Equivalence closure in the two-variable guarded fragment
2015
We consider the satisfiability and finite satisfiability problems for the extension of the two-variable guarded fragment in which an equivalence closure operator can be applied to two distinguished binary predicates. We show that the satisfiability and finite satisfiability problems for this logic are 2-ExpTime-complete. This contrasts with an earlier result that the corresponding problems for the full two-variable logic with equivalence closures of two binary predicates are 2-NExpTime-complete.
On the Quantum and Classical Complexity of Solving Subtraction Games
2019
We study algorithms for solving Subtraction games, which are sometimes referred as one-heap Nim games.
Understanding star-fundamental algebras
2021
Star-fundamental algebras are special finite dimensional algebras with involution ∗ * over an algebraically closed field of characteristic zero defined in terms of multialternating ∗ * -polynomials. We prove that the upper-block matrix algebras with involution introduced in Di Vincenzo and La Scala [J. Algebra 317 (2007), pp. 642–657] are star-fundamental. Moreover, any finite dimensional algebra with involution contains a subalgebra mapping homomorphically onto one of such algebras. We also give a characterization of star-fundamental algebras through the representation theory of the symmetric group.
Complex group algebras of finite groups: Brauer’s Problem 1
2005
Brauer’s Problem 1 asks the following: what are the possible complex group algebras of finite groups? It seems that with the present knowledge of representation theory it is not possible to settle this question. The goal of this paper is to announce a partial solution to this problem. We conjecture that if the complex group algebra of a finite group does not have more than a fixed number m m of isomorphic summands, then its dimension is bounded in terms of m m . We prove that this is true for every finite group if it is true for the symmetric groups.
Learning by the Process of Elimination
2002
AbstractElimination of potential hypotheses is a fundamental component of many learning processes. In order to understand the nature of elimination, herein we study the following model of learning recursive functions from examples. On any target function, the learning machine has to eliminate all, save one, possible hypotheses such that the missing one correctly describes the target function. It turns out that this type of learning by the process of elimination (elm-learning, for short) can be stronger, weaker or of the same power as usual Gold style learning.While for usual learning any r.e. class of recursive functions can be learned in all of its numberings, this is no longer true for el…
Automatic construction of test sets: Theoretical approach
2005
We consider the problem of automatic construction of complete test set (CTS) from program text. The completeness criterion adopted is C1, i.e., it is necessary to execute all feasible branches of program at least once on the tests of CTS. A simple programming language is introduced with the property that the values used in conditional statements are not arithmetically deformed. For this language the CTS problem is proved to be algorithmically solvable and CTS construction algorithm is obtained. Some generalizations of this language containing counters, stacks or arrays are considered where the CTS problem remains solvable. In conclusion the applications of the obtained results to CTS constr…
"Table 3" of "Search for supersymmetry using final states with one lepton, jets, and missing transverse momentum with the ATLAS detector in sqrt{s} =…
2011
Distribution of M(C=EFFECTIVE) IN GEV for data and background MC calculation.