Search results for "arithmetic"
showing 10 items of 271 documents
Modelización matemática en la educación secundaria: manual de uso
2019
[EN] One of the main problems that arise when implementing a mathematical modeling task to the secondary classroom is the lack of a detailed description, from the didactic perspective, that helps and guides the in-service teachers in the implementation of this type of activity and that allows them to identify which are the learning objectives being pursued; if this kind of activities t within the oficial curriculum; the type of tasks that allow these objectives to be achieved; how to carry out their evaluation or what methodology to use. In this article we will address all these aspects from the perspective of a classroom experience, detailing each of the phases involved in the implementati…
<title>Achieving high performances at lower cost for real-time image rotation by using dynamic reconfiguration</title>
2001
FPGA components are widely used today to perform various algorithms (digital filtering) in real time. The emergence of Dynamically Reconfigurable (DR) FPGAs made it possible to reduce the number of necessary resources to carry out an image processing application (tasks chain). We present in this article an image processing application (image rotation) that exploits the FPGA's dynamic reconfiguration feature. A comparison is undertaken between the dynamic and static reconfiguration by using two criteria, cost and performance criteria. For the sake of testing the validity of our approach in terms of Algorithm and Architecture Adequacy , we realized an AT40K40 based board ARDOISE.
The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words
2013
The Burrows-Wheeler Transform (BWT) is a tool of fundamental importance in Data Compression and, recently, has found many applications well beyond its original purpose. The main goal of this paper is to highlight the mathematical and combinatorial properties on which the outstanding versatility of the $BWT$ is based, i.e. its reversibility and the clustering effect on the output. Such properties have aroused curiosity and fervent interest in the scientific world both for theoretical aspects and for practical effects. In particular, in this paper we are interested both to survey the theoretical research issues which, by taking their cue from Data Compression, have been developed in the conte…
Reducing complexity in H.264/AVC motion estimation by using a GPU
2011
H.264/AVC applies a complex mode decision technique that has high computational complexity in order to reduce the temporal redundancies of video sequences. Several algorithms have been proposed in the literature in recent years with the aim of accelerating this part of the encoding process. Recently, with the emergence of many-core processors or accelerators, a new approach can be adopted for reducing the complexity of the H.264/AVC encoding algorithm. This paper focuses on reducing the inter prediction complexity adopted in H.264/AVC and proposes a GPU-based implementation using CUDA. Experimental results show that the proposed approach reduces the complexity by as much as 99% (100x of spe…
Numerical evaluation of multiple polylogarithms
2004
Multiple polylogarithms appear in analytic calculations of higher order corrections in quantum field theory. In this article we study the numerical evaluation of multiple polylogarithms. We provide algorithms, which allow the evaluation for arbitrary complex arguments and without any restriction on the weight. We have implemented these algorithms with arbitrary precision arithmetic in C++ within the GiNaC framework.
ADDITIVITY FROM MULTIPLE PRIMES IN IDENTIFYING BACKWARD WRITTEN WORDS
1988
Activational theories of memory assume that activation from several sources adds up to an intersecting node. We tested this idea in one experiment where we kept constant the number of primes presented and we manipulated the number of different primes related to the target, the number of presentations of the same prime, or the same target, presented as a prime. We used a task in which the target was always a word, which appeared written backward and had to be identified. We found a strong effect of target repetition and diminished priming in the condition in which the target was repeated. We obtained additivity (greater activation) mainly in the condition in which we presented several diffe…
Validation in Young Soccer Players of the Modified Version of the Harre Circuit Test: The Petrucci Ability Test
2021
The evaluation of soccer players’ physical fitness from youth onward is important for monitoring performance and planning training. While health-related factors present valid and reliable tests, the skill-related component should be studied in depth. An interesting test to evaluate the skill-related factors is the Harre circuit test (HTC); unfortunately, this test includes the somersault, an element not present in soccer. The aim of the present study is the validation of the Petrucci ability test (PAT), a variation of the HTC without the somersault for young soccer players. Children and adolescents (age range 10–13 years old) soccer players concluded the 20-m, the HTC and the PAT. To establ…
The ACM property for unions of lines in P1×P2
2021
This paper examines the Arithmetically Cohen-Macaulay (ACM) property for certain codimension 2 varieties in P1×P2 called sets of lines in P1×P2 (not necessarily reduced). We discuss some obstacles to finding a general characterization. We then consider certain classes of such curves, and we address two questions. First, when are they themselves ACM? Second, in a non-ACM reduced configuration, is it possible to replace one component of a primary (prime) decomposition by a suitable power (i.e. to “fatten” one line) to make the resulting scheme ACM? Finally, for our classes of such curves, we characterize the locally Cohen-Macaulay property in combinatorial terms by introducing the definition …
The minimal free resolution of fat almost complete intersections in ℙ1 x ℙ1
2017
AbstractA current research theme is to compare symbolic powers of an ideal I with the regular powers of I. In this paper, we focus on the case where I = IX is an ideal deûning an almost complete intersection (ACI) set of points X in ℙ1 × ℙ1. In particular, we describe a minimal free bigraded resolution of a non-arithmetically Cohen-Macaulay (also non-homogeneous) set 𝒵 of fat points whose support is an ACI, generalizing an earlier result of Cooper et al. for homogeneous sets of triple points. We call 𝒵 a fat ACI.We also show that its symbolic and ordinary powers are equal, i.e, .
On a Linear Diophantine Problem of Frobenius: Extending the Basis
1998
LetXk={a1, a2, …, ak},k>1, be a subset of N such that gcd(Xk)=1. We shall say that a natural numbernisdependent(onXk) if there are nonnegative integersxisuch thatnhas a representationn=∑ki=1 xiai, elseindependent. The Frobenius numberg(Xk) ofXkis the greatest integer withnosuch representation. Selmer has raised the problem of extendingXkwithout changing the value ofg. He showed that under certain conditions it is possible to add an elementc=a+kdto the arithmetic sequencea,a+d,a+2d, …, a+(k−1) d, gcd(a, d)=1, without alteringg. In this paper, we give the setCof all independent numberscsatisfyingg(A, c)=g(A), whereAcontains the elements of the arithmetic sequence. Moreover, ifa>kthen we give …