Recomendaciones de fertilización en maíz según la forma algebraica del modelo predictivo empleado

p.155-164

Layers of generality and types of generalization in pattern activities

Pattern generalization is considered one of the prominent routes for in-troducing students to algebra. However, not all generalizations are al-gebraic. In the use of pattern generalization as a route to algebra, we —teachers and educators— thus have to remain vigilant in order not to confound algebraic generalizations with other forms of dealing with the general. But how to distinguish between algebraic and non-algebraic generalizations? On epistemological and semiotic grounds, in this arti-cle I suggest a characterization of algebraic generalizations. This char-acterization helps to bring about a typology of algebraic and arithmetic generalizations. The typology is illustrated with classroom examples.

Mathematical prerequisites for learning statistics in Psychology: Assessing core skills of numeracy and mathematical reasoning among undergraduates.

This study sought to extend earlier work by Mulhern and Wylie (2004) to investigate a UK-wide sample of psychology undergraduates. A total of 890 participants from eight universities across the UK were tested on six broadly defined components of mathematical thinking relevant to the teaching of statistics in psychology - calculation, algebraic reasoning, graphical interpretation, proportionality and ratio, probability and sampling, and estimation. Results were consistent with Mulhern and Wylie's (2004) previously reported findings. Overall, participants across institutions exhibited marked deficiencies in many aspects of mathematical thinking. Results also revealed significant gender differences on calculation, proportionality and ratio, and estimation. Level of qualification in mathematics was found to predict overall performance. Analysis of the nature and content of errors revealed consistent patterns of misconceptions in core mathematical knowledge , likely to hamper the learning of statistics.

K-Theory of non-linear projective toric varieties

We define a category of quasi-coherent sheaves of topological spaces on projective toric varieties and prove a splitting result for its algebraic K-theory, generalising earlier results for projective spaces. The splitting is expressed in terms of the number of interior lattice points of dilations of a polytope associated to the variety. The proof uses combinatorial and geometrical results on polytopal complexes. The same methods also give an elementary explicit calculation of the cohomology groups of a projective toric variety over any commutative ring.

Multidimensional operator multipliers

We introduce multidimensional Schur multipliers and characterise them, generalising well-known results by Grothendieck and Peller. We define a multidimensional version of the two-dimensional operator multipliers studied recently by Kissin and Shulman. The multidimensional operator multipliers are defined as elements of the minimal tensor product of several C *-algebras satisfying certain boundedness conditions. In the case of commutative C*-algebras, the multidimensional operator multipliersreduce to continuousmul-tidimensional Schur multipliers. We show that the multiplierswith respect to some given representations of the corresponding C*-algebrasdo not change if the representations are replaced by approximately equivalent ones. We establish a non-commutative and multidimensional version of the characterisations by Grothendieck and Peller which shows that universal operator multipliers can be obtained ascertain weak limits of elements of the algebraic tensor product of the corresponding C *-algebras.

Pointwise universal trigonometric series

A series $S_a=\sum\limits_{n=-\infty}^\infty a_nz^n$ is called a {\it pointwise universal trigonometric series} if for any $f\in C(\T)$, there exists a strictly increasing sequence $\{n_k\}_{k\in\N}$ of positive integers such that $\sum\limits_{j=-n_k}^{n_k} a_jz^j$ converges to $f(z)$ pointwise on $\T$. We find growth conditions on coefficients allowing and forbidding the existence of a pointwise universal trigonometric series. For instance, if $|a_n|=O(\e^{\,|n|\ln^{-1-\epsilon}\!|n|})$ as $|n|\to\infty$ for some $\epsilon>0$, then the series $S_a$ can not be pointwise universal. On the other hand, there exists a pointwise universal trigonometric series $S_a$ with $|a_n|=O(\e^{\,|n|\ln^{-1}\!|n|})$ as $|n|\to\infty$.

Double complexes and vanishing of Novikov cohomology

We consider non-standard totalisation functors for double complexes, involving left or right truncated products. We show how properties of these imply that the algebraic mapping torus of a self map h of a cochain complex of finitely presented modules has trivial negative Novikov cohomology, and has trivial positive Novikov cohomology provided h is a quasi-isomorphism. As an application we obtain a new and transparent proof that a finitely dominated cochain complex over a Laurent polynomial ring has trivial (positive and negative) Novikov cohomology.

Semiring induced valuation algebras: Exact and approximate local computation algorithms

Local computation in join trees or acyclic hypertrees has been shown to be linked to a particular algebraic structure, called valuation algebra.There are many models of this algebraic structure ranging from probability theory to numerical analysis, relational databases and various classical and non-classical logics. It turns out that many interesting models of valuation algebras may be derived from semiring valued mappings. In this paper we study how valuation algebras are induced by semirings and how the structure of the valuation algebra is related to the algebraic structure of the semiring. In particular, c-semirings with idempotent multiplication induce idempotent valuation algebras and therefore permit particularly efficient architectures for local computation. Also important are semirings whose multiplicative semigroup is embedded in a union of groups. They induce valuation algebras with a partially defined division. For these valuation algebras, the well-known architectures for Bayesian networks apply. We also extend the general computational framework to allow derivation of bounds and approximations, for when exact computation is not feasible.

Logics for belief functions on MV-algebras

In this paper we present a generalization of belief functions over fuzzy events. In particular we focus on belief functions defined in the algebraic framework of finite MV-algebras of fuzzy sets. We introduce a fuzzy modal logic to formalize reasoning with belief functions on many-valued events. We prove, among other results, that several different notions of belief functions can be characterized in a quite uniform way, just by slightly modifying the complete axiomatization of one of the modal logics involved in the definition of our formalism. © 2012 Elsevier Inc. All rights reserved.

Local framings

Framings provide a way to construct Quillen functors from simplicial sets to any given model category. A more structured set- up studies stable frames giving Quillen functors from spectra to stable model categories. We will investigate how this is compatible with Bousfield localisation to gain insight into the deeper structure of the stable homotopy category. We further show how these techniques relate to rigidity questions and how they can be used to study algebraic model categories.

Model categories for orthogonal calculus

We restate the notion of orthogonal calculus in terms of model categories. This provides a cleaner set of results and makes the role of O(n)-equivariance clearer. Thus we develop model structures for the category of n-polynomial and n-homogeneous functors, along with Quillen pairs relating them. We then classify n-homogeneous functors, via a zig-zag of Quillen equivalences, in terms of spectra with an O(n)-action. This improves upon the classification theorem of Weiss. As an application, we develop a variant of orthogonal calculus by replacing topological spaces with orthogonal spectra.

Analysis of Dependence Tracking Algorithms for Task Dataflow Execution

Processor architectures has taken a turn towards many-core processors, which integrate multiple processing cores on a single chip to increase overall performance, and there are no signs that this trend will stop in the near future. Many-core processors are harder to program than multi-core and single-core processors due to the need of writing parallel or concurrent programs with high degrees of parallelism. Moreover, many-cores have to operate in a mode of strong scaling because of memory bandwidth constraints. In strong scaling increasingly finer-grain parallelism must be extracted in order to keep all processing cores busy.

Task dataflow programming models have a high potential to simplify parallel program- ming because they alleviate the programmer from identifying precisely all inter-task de- pendences when writing programs. Instead, the task dataflow runtime system detects and enforces inter-task dependences during execution based on the description of memory each task accesses. The runtime constructs a task dataflow graph that captures all tasks and their dependences. Tasks are scheduled to execute in parallel taking into account dependences specified in the task graph.

Several papers report important overheads for task dataflow systems, which severely limits the scalability and usability of such systems. In this paper we study efficient schemes to manage task graphs and analyze their scalability. We assume a programming model that supports input, output and in/out annotations on task arguments, as well as commutative in/out and reductions. We analyze the structure of task graphs and identify versions and generations as key concepts for efficient management of task graphs. Then, we present three schemes to manage task graphs building on graph representations, hypergraphs and lists. We also consider a fourth edge-less scheme that synchronizes tasks using integers. Analysis using micro-benchmarks shows that the graph representation is not always scalable and that the edge-less scheme introduces least overhead in nearly all situations.

Rational equivariant rigidity

We prove that if G is S1 or a profinite group, then all of the homotopical information of the category of rational G-spectra is captured by the triangulated structure of the rational G-equivariant stable homotopy category.

That is, for G profinite or S1, the rational G-equivariant stable homotopy category is rigid. For the case of profinite groups this rigidity comes from an intrinsic formality statement, so we carefully relate the notion of intrinsic formality of a differential graded algebra to rigidity.

Dynamic identification of building structures: new strategies:Meccanica dei materiali e delle strutture

In this paper the evolution of a time domain dynamic identification technique based on a statistical moment approach is presented. This technique can be used in the case of structures under base random excitations in the linear state and in the non linear one. By applying Itoˆ stochastic calculus, special algebraic equations can be obtained depending on the statistical moments of the response of the system to be identified. Such equations can be used for the dynamic identification of the mechanical parameters and of the input. The above equations, differently from many techniques in the literature, show the possibility of obtaining the identification of the dissipation characteristics independently from the input. Through the paper the first formulation of this technique, applicable to non linear systems, based on the use of a restricted class of the potential models, is presented. Further a second formulation of the technique in object, applicable to each kind of linear systems and based on the use of a class of linear models, characterized by a mass proportional damping matrix, is described.