aim and background: it has been shown in several studies that, students with mathematics learning disabilities have memory problems. this research compares memory profile of students with and without mathematics learning disabilities. methods and materials: the design of research was cross-sectional with causal-comparative method. the statistical population were 3 rd grade student boys in isfah...

As computers become faster they must become smaller because of the niteness of the speed of light. The history of computer technology has involved a sequence of changes from one type of physical realisation to another-from gears to relays to valves to transistors to integrated circuits and so on. Quantum mechanics is already important in the design of microelectronic components. Soon it will be...

Constructive Mathematics might be regarded as a fragment of classical mathematics in which any proof of an existence theorem is equipped with a computable function giving the solution of the theorem. Limit Computable Mathematics (LCM) considered in this note is a fragment of classical mathematics in which any proof of an existence theorem is equipped with a function computing the solution of th...

We introduces the umodules, a generalisation of the notion of graph module. The theory we develop captures among others undirected graphs, tournaments, digraphs, and 2−structures. We show that, under some axioms, a unique decomposition tree exists for umodules. Polynomial-time algorithms are provided for: non-trivial umodule test, maximal umodule computation, and decomposition tree computation ...

We present a simple algorithm to compute a convex decomposition of a non-convex, non-manifold polyhedron of arbitrary genus (handles). The algorithm takes a non-convex polyhedron with n edges and r notches (features causing non-convexity in the polyhedra) and produces a worst-case optimal O(r2 ) number of convex polyhedra Si, with U;S; = S, in O(nr2 ) time and O(nr) space. Recenlly, Chazelle an...

We determine explicitly the Picard groups of the universal Jacobian stack and of its compactification over the stack of stable curves. Along the way, we prove some results concerning the gerbe structure of the universal Jacobian stack over its rigidification by the natural action of the multiplicative group and relate this with the existence of generalized Poincaré line bundles. We also compare...

The rapid development of computers and the internet has given new opportunities for engineering work as wells as for teaching and learning. The use of advanced modern mathematics is becoming increasingly more popular in the engineering community and and most problem solutions and developments incorporate high precision digital models, numerical analyses and simulations. However, this kind of ma...

some arguments against infinite regress in islamic philosophy such as applied proof or argument of ones and thousands are based on the mathematical foundations and preliminaries. extraction and analysis of these preliminaries exposes mathematical nature of these arguments and shows that besides philosophical approach to these arguments should also look at them from perspective of mathematics. a...

In this paper we consider some problems in the Arakelov geometry of Mg, the moduli space of smooth projective curves of genus g over C. Specifically, we are interested in naturally metrized line bundles over Mg and their extensions to Mg, the Deligne-Mumford compactification of Mg. These line bundles typically occur when computing the archimedean height of a curve. Here they arise in computatio...

Let C be an arbitrary smooth algebraic curve of genus g over a large finite field K. We revisit fast addition algorithms in the Jacobian of C due to Khuri-Makdisi (math.NT/0409209, to appear in Mathematics of Computation). The algorithms, which reduce to linear algebra in vector spaces of dimension O(g) once |K| ≫ g and which asymptotically require O(g) field operations using fast linear algebr...