Search results for "arithmetic"

Algorithmic Solution of Arithmetic Problems and Operands-Answer Associations in Long-Term Memory

2001

Many developmental models of arithmetic problem solving assume that any algorithmic solution of a given problem results in an association of the two operands and the answer in memory (Logan & Klapp, 1991; Siegler, 1996). In this experiment, adults had to perform either an operation or a comparison on the same pairs of two-digit numbers and then a recognition task. It is shown that unlike comparisons, the algorithmic solution of operations impairs the recognition of operands in adults. Thus, the postulate of a necessary and automatic storage of operands-answer associations in memory when young children solve additions by algorithmic strategies needs to be qualified.

On the arithmetically Cohen-Macaulay property for sets of points in multiprojective spaces

2017

We study the arithmetically Cohen-Macaulay (ACM) property for finite sets of points in multiprojective spaces, especially ( P 1 ) n (\mathbb P^1)^n . A combinatorial characterization, the ( ⋆ ) (\star ) -property, is known in P 1 × P 1 \mathbb P^1 \times \mathbb P^1 . We propose a combinatorial property, ( ⋆ s ) (\star _s) with 2 ≤ s ≤ n 2\leq s\leq n , that directly generalizes the ( ⋆ ) (\star ) -property to ( P 1 ) n (\mathbb P^1)^n for larger n n . We show that X X is ACM if and only if it satisfies the ( ⋆ n ) (\star _n) -property. The main tool for several of our results is an extension to the multiprojective setting of certain liaison methods in projective space.

Improving Interpolants for Linear Arithmetic

2015

Craig interpolation for satisfiability modulo theory formulas have come more into focus for applications of formal verification. In this paper we, introduce a method to reduce the size of linear constraints used in the description of already computed interpolant in the theory of linear arithmetic with respect to the number of linear constraints. We successfully improve interpolants by combining satisfiability modulo theory and linear programming in a local search heuristic. Our experimental results suggest a lower running time and a larger reduction compared to other methods from the literature.

The M/G/1/1 queue with repeated attempts and different types of feedback effects

1985

Queueing systems with repeated attempts have wide practical use in designing switching networks and computer systems. The model presented in this paper not only takes into account repetitions by congestion but also considers the feedback effects from all types of failures in establishing a connection. A semi-regenerative analysis is applied in order to determine the characteristics of the underlying queueing process. Bedienungssysteme mit wiederholten Versuchen sind von groβem praktischen Nutzen bei der Bemessung von Vermittlungseinrichtungen und Computersystemen. Das Modell, das in dieser Arbeit vorgestellt wird, berucksichtigt nicht nur Wiederholungen nach vorangegangener Blockierung, son…

Pileup and underlying event mitigation with iterative constituent subtraction

2019

Abstract The hard-scatter processes in hadronic collisions are often largely contaminated with soft background coming from pileup in proton-proton collisions, or underlying event in heavy-ion collisions. This paper presents a new background subtraction method for jets and event observables (such as missing transverse energy) which is based on the previously published Constituent Subtraction algorithm. The new subtraction method, called Iterative Constituent Subtraction, applies event-wide implementation of Constituent Subtraction iteratively in order to fully equilibrate the background subtraction across the entire event. Besides documenting the new method, we provide guidelines for setting…

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.

Approximation of the Feasible Parameter Set in worst-case identification of Hammerstein models

2005

The estimation of the Feasible Parameter Set (FPS) for Hammerstein models in a worst-case setting is considered. A bounding procedure is determined both for polytopic and ellipsoidic uncertainties. It consists in the projection of the FPS of the extended parameter vector onto suitable subspaces and in the solution of convex optimization problems which provide Uncertainties Intervals of the model parameters. The bounds obtained are tighter than in the previous approaches. hes.

Prime divisors of character degrees

2008

EDA: EXAFS data-analysis software package

2021

The EXAFS data-analysis software package EDA consists of a suite of programs running under a Windows operating system environment that is designed to perform all steps of conventional EXAFS data analysis such as extraction of the XANES/EXAFS parts of the X-ray absorption coefficient, Fourier filtering and EXAFS fitting using the Gaussian and cumulant models. The package also includes two advanced approaches which allow the reconstruction of the radial distribution function (RDF) from EXAFS based on the regularization-like method and the calculation of configuration-averaged EXAFS using a set of atomic configurations obtained from molecular-dynamics or Monte Carlo simulations.---- / / / ----…

MICROPROCESSOR-BASED SUBOPTIMAL CONTROL OF CONVERTER-FED HYPO-HYPERSYNCHRONOUS CASCADE DRIVES

1984

This work consists ofi a theoretic and experimental study o£ a possible practical realization oi a micro pro cess or-based control system using a converter-fad hypo-hypersynchronous cascade. drive. Vlrstly, the design o£ a microprocessor-based controller Is carried out considering an approximate mathematical model, linear-type, o& the drive -In question, by using optimal control techniques. Several physical constraints, -buck as -input variables constraints, state variables constraints and processing time. o& microprocessor are taken -into account. The approach followed attorn us to obtain a suboptimal, closed-loop control system. In addition, In order to carry out a more accurate study ofa…