Elaboración de prototipos para el desarrollo de productos de tecnología social [

[ES] Concretamente, para el caso de las Matemáticas, encontramos numerosas aplicaciones orientadas al aprendizaje de operaciones básicas: suma, resta, multiplicación, división, pero ninguna que enseñe a los niños a aplicar dichas operaciones para la resolución de problemas.
 Y este es el fin de este Trabajo Fin de Grado; diseñar un prototipo de aplicación orientada a Tabletas, con tecnología Android, para la resolución de problemas matemáticos para alumnos de niños de 5º de primaria, con tres características fundamentales:
 1. La posibilidad de disponer de un espacio, en el cual los alumnos puedan realizar los cálculos necesarios para solucionar los problemas. 2. La posibilidad de incorporar un mecanismo, gracias al cual los usuarios puedan aportar nuevos problemas matemáticos, a modo de feedback con el usuario. 3. La combinación del aspecto lúdico con el académico. El principal objetivo de este Trabajo Fin de Grado es el de : desarrollar un prototipo orientado hacia dispositivos Tablet basados en Android, que permitan el aprendizaje sobre la materia de Matemáticas para un nivel de alumnos de 5º de primaria; y que cumpla con las características fundamentales anteriormente descritas.

Constraint handling rules. Compositional semantics and program transformation

This thesis intends to investigate two aspects of Constraint Handling Rules (CHR). It proposes a compositional semantics and a technique for program transformation. CHR is a concurrent committed-choice constraint logic programming language consisting of guarded rules, which transform multi-sets of atomic formulas (constraints) into simpler ones until exhaustion [Frü06] and it belongs to the declarative languages family. It was initially designed for writing constraint solvers but it has recently also proven to be a general purpose language, being as it is Turing equivalent [SSD05a]. Compositionality is the first CHR aspect to be considered. A trace based compositional semantics for CHR was previously defined in [DGM05]. The reference operational semantics for such a compositional model was the original operational semantics for CHR which, due to the propagation rule, admits trivial non-termination. In this thesis we extend the work of [DGM05] by introducing a more refined trace based compositional semantics which also includes the history. The use of history is a well-known technique in CHR which permits us to trace the application of propagation rules and consequently it permits trivial non-termination avoidance [Abd97, DSGdlBH04]. Naturally, the reference operational semantics, of our new compositional one, uses history to avoid trivial non-termination too. Program transformation is the second CHR aspect to be considered, with particular regard to the unfolding technique. Said technique is an appealing approach which allows us to optimize a given program and in more detail to improve run-time efficiency or spaceconsumption. Essentially it consists of a sequence of syntactic program manipulations which preserve a kind of semantic equivalence called qualified answer [Frü98], between the original program and the transformed ones. The unfolding technique is one of the basic operations which is used by most program transformation systems. It consists in the replacement of a procedure-call by its definition. In CHR every conjunction of constraints can be considered as a procedure-call, every CHR rule can be considered as a procedure and the body of said rule represents the definition of the call. While there is a large body of literature on transformation and unfolding of sequential programs, very few papers have addressed this issue for concurrent languages. We define an unfolding rule, show its correctness and discuss some conditions in which it can be used to delete an unfolded rule while preserving the meaning of the original program. Finally, confluence and termination maintenance between the original and transformed programs are shown. This thesis is organized in the following manner. Chapter 1 gives some general notion about CHR. Section 1.1 outlines the history of programming languages with particular attention to CHR and related languages. Then, Section 1.2 introduces CHR using examples. Section 1.3 gives some preliminaries which will be used during the thesis. Subsequentely, Section 1.4 introduces the syntax and the operational and declarative semantics for the first CHR language proposed. Finally, the methodologies to solve the problem of trivial non-termination related to propagation rules are discussed in Section 1.5. Chapter 2 introduces a compositional semantics for CHR where the propagation rules are considered. In particular, Section 2.1 contains the definition of the semantics. Hence, Section 2.2 presents the compositionality results. Afterwards Section 2.3 expounds upon the correctness results. Chapter 3 presents a particular program transformation known as unfolding. This transformation needs a particular syntax called annotated which is introduced in Section 3.1 and its related modified operational semantics !0t is presented in Section 3.2. Subsequently, Section 3.3 defines the unfolding rule and prove its correctness. Then, in Section 3.4 the problems related to the replacement of a rule by its unfolded version are discussed and this in turn gives a correctness condition which holds for a specific class of rules. Section 3.5 proves that confluence and termination are preserved by the program modifications introduced. Finally, Chapter 4 concludes by discussing related works and directions for future work.

An improved bit parallel exact maximum clique algorithm

This paper describes new improvements for BB-MaxClique (San Segundo et al. in Comput Oper Resour 38(2):571–581, 2011 ), a leading maximum clique algorithm which uses bit strings to efficiently compute basic operations during search by bit masking. Improvements include a recently described recoloring strategy in Tomita et al. (Proceedings of the 4th International Workshop on Algorithms and Computation. Lecture Notes in Computer Science, vol 5942. Springer, Berlin, pp 191–203, 2010 ), which is now integrated in the bit string framework, as well as different optimization strategies for fast bit scanning. Reported results over DIMACS and random graphs show that the new variants improve over previous BB-MaxClique for a vast majority of cases. It is also established that recoloring is mainly useful for graphs with high densities.

Improving abstract interpretations by combining domains

This article considers static analysis based on abstract interpretation of logic programs over combined domains. It is known that analyses over combined domains provide more information potentially than obtained by the independent analyses. However, the construction of a combined analysis often requires redefining the basic operations for the combined domain. A practical approach to maintain precision in combined analyses of logic programs which reuses the individual analyses and does not redefine the basic operations is illustrated. The advantages of the approach are that proofs of correctness for the new domains are not required and implementations can be reused. The approach is demonstrated by showing that a combined sharing analysis — constructed from "old" proposals — compares well with other "new" proposals suggested in recent literature both from the point of view of efficiency and accuracy.

An Architecture forRepresenting Biological Processes based on Networks of Bio-inspired Processors

n this paper we propose the use of Networks of Bio-inspired Processors (NBP) to model some biological phenomena within a computational framework. In particular, we propose the use of an extension of NBP named Network Evolutionary Processors Transducers to simulate chemical transformations of substances. Within a biological process, chemical transformations of substances are basic operations in the change of the state of the cell. Previously, it has been proved that NBP are computationally complete, that is, they are able to solve NP complete problems in linear time, using massively parallel computations. In addition, we propose a multilayer architecture that will allow us to design models of biological processes related to cellular communication as well as their implications in the metabolic pathways. Subsequently, these models can be applied not only to biological-cellular instances but, possibly, also to configure instances of interactive processes in many other fields like population interactions, ecological trophic networks, in dustrial ecosystems, etc.

Enhancing iDynoMiCS framework with a plasmid conjugation module

Actualmente existen aplicaciones que permiten simular el comportamiento de bacterias en distintos hábitats y los procesos que ocurren en estos para facilitar su estudio y experimentación sin la necesidad de un laboratorio. Una de las aplicaciones de software libre para la simulación de poblaciones bacteriológicas mas usada es iDynoMiCS (individual-based Dynamics of Microbial Communities Simulator), un simulador basado en agentes que permite trabajar con varios modelos computacionales de bacterias en 2D y 3D. Este simulador permite una gran libertad al configurar una numerosa cantidad de variables con respecto al entorno, reacciones químicas y otros detalles importantes. Una característica importante es el poder simular de manera sencilla la conjugación de plásmidos entre bacterias. Los plásmidos son moléculas de ADN diferentes del cromosoma celular, generalmente circularles, que se replican, transcriben y conjugan independientemente del ADN cromosómico. Estas están presentes normalmente en bacterias procariotas, y en algunas ocasiones en eucariotas, sin embargo, en este tipo de células son llamados episomas. Dado el complejo comportamiento de los plásmidos y la gama de posibilidades que estos presentan como mecanismos externos al funcionamiento básico de la célula, en la mayoría de los casos confiriéndole distintas ventajas evolutivas, como por ejemplo: resistencia antibiótica, entre otros, resulta importante su estudio y subsecuente manipulación. Sin embargo, el marco operativo del iDynoMiCS, en cuanto a simulación de plásmidos se refiere, es demasiado sencillo y no permite realizar operaciones más complejas que el análisis de la propagación de un plásmido en la comunidad. El presente trabajo surge para resolver esta deficiencia de iDynomics. Aquí se analizarán, desarrollarán e implementarán las modificaciones necesarias para que iDynomics pueda simular satisfactoriamente y mas apegado a la realidad la conjugación de plásmidos y permita así mismo resolver distintas operaciones lógicas, como lo son los circuitos genéticos, basadas en plásmidos. También se analizarán los resultados obtenidos de acuerdo a distintos estudios relevantes y a la comparación de los resultados obtenidos con el código original de iDynomics. Adicionalmente se analizará un estudio comparando la eficiencia de detección de una sustancia mediante dos circuitos genéticos distintos. Asimismo el presente trabajo puede tener interés para el grupo LIA de la Facultad de Informática de la Universidad Politécnica de Madrid, el cual está participando en el proyecto europeo BACTOCOM que se centra en el estudio de la conjugación de plásmidos y circuitos genéticos. --ABSTRACT--Currently there are applications that simulate the behavior of bacteria in different habitats and the ongoing processes inside them to facilitate their study and experimentation without the need for an actual laboratory. One of the most used open source applications to simulate bacterial populations is iDynoMiCS (individual-based Dynamics of Microbial Communities Simulator), an agent-based simulator that allows working with several computer models of 2D and 3D bacteria in biofilms. This simulator allows great freedom by means of a large number of configurable variables regarding environment, chemical reactions and other important details of the simulation. Within these characteristics there exists a very basic framework to simulate plasmid conjugation. Plasmids are DNA molecules physically different from the cell’s chromosome, commonly found as small circular, double-stranded DNA molecules that are replicated, conjugated and transcribed independently of chromosomal DNA. These bacteria are normally present in prokaryotes and sometimes in eukaryotes, which in this case these cells are called episomes. Plasmids are external mechanisms to the cells basic operations, and as such, in the majority of the cases, confer to the host cell various evolutionary advantages, like antibiotic resistance for example. It is mperative to further study plasmids and the possibilities they present. However, the operational framework of the iDynoMiCS plasmid simulation is too simple, and does not allow more complex operations that the analysis of the spread of a plasmid in the community. This project was conceived to resolve this particular deficiency in iDynomics, moreover, in this paper is discussed, developed and implemented the necessary changes to iDynomics simulation software so it can satisfactorily and realistically simulate plasmid conjugation, and allow the possibility to solve various ogic operations, such as plasmid-based genetic circuits. Moreover the results obtained will be analyzed and compared with other relevant studies and with those obtained with the original iDynomics code. Conjointly, an additional study detailing the sensing of a substance with two different genetic circuits will be presented. This work may also be relevant to the LIA group of the Faculty of Informatics of the Polytechnic University of Madrid, which is participating in the European project BACTOCOM that focuses on the study of the of plasmid conjugation and genetic circuits.

Watching subgraphs to improve efficiency in maximum clique search

This paper describes a new technique referred to as watched subgraphs which improves the performance of BBMC, a leading state of the art exact maximum clique solver (MCP). It is based on watched literals employed by modern SAT solvers for boolean constraint propagation. In efficient SAT algorithms, a list of clauses is kept for each literal (it is said that the clauses watch the literal) so that only those in the list are checked for constraint propagation when a (watched) literal is assigned during search. BBMC encodes vertex sets as bit strings, a bit block representing a subset of vertices (and the corresponding induced subgraph) the size of the CPU register word. The paper proposes to watch two subgraphs of critical sets during MCP search to efficiently compute a number of basic operations. Reported results validate the approach as the size and density of problem instances rise, while achieving comparable performance in the general case.

Trajectory-Based Morphological Operators: A Model for Efficient Image Processing

Mathematical morphology has been an area of intensive research over the last few years. Although many remarkable advances have been achieved throughout these years, there is still a great interest in accelerating morphological operations in order for them to be implemented in real-time systems. In this work, we present a new model for computing mathematical morphology operations, the so-called morphological trajectory model (MTM), in which a morphological filter will be divided into a sequence of basic operations. Then, a trajectory-based morphological operation (such as dilation, and erosion) is defined as the set of points resulting from the ordered application of the instant basic operations. The MTM approach allows working with different structuring elements, such as disks, and from the experiments, it can be extracted that our method is independent of the structuring element size and can be easily applied to industrial systems and high-resolution images.

A new boundary-based morphological model

Mathematical morphology addresses the problem of describing shapes in an n-dimensional space using the concepts of set theory. A series of standardized morphological operations are defined, and they are applied to the shapes to transform them using another shape called the structuring element. In an industrial environment, the process of manufacturing a piece is based on the manipulation of a primitive object via contact with a tool that transforms the object progressively to obtain the desired design. The analogy with the morphological operation of erosion is obvious. Nevertheless, few references about the relation between the morphological operations and the process of design and manufacturing can be found. The non-deterministic nature of classic mathematical morphology makes it very difficult to adapt their basic operations to the dynamics of concepts such as the ordered trajectory. A new geometric model is presented, inspired by the classic morphological paradigm, which can define objects and apply morphological operations that transform these objects. The model specializes in classic morphological operations, providing them with the determinism inherent in dynamic processes that require an order of application, as is the case for designing and manufacturing objects in professional computer-aided design and manufacturing (CAD/CAM) environments. The operators are boundary-based so that only the points in the frontier are handled. As a consequence, the process is more efficient and more suitable for use in CAD/CAM systems.

Introduction to the Maple Power Tool Intpakx

The paper has been presented at the 12th International Conference on Applications of Computer Algebra, Varna, Bulgaria, June, 2006

El ábaco japonés : una mediación que da sentido al razonamiento matemático

La problemática existente en estos momentos en el campo educativo en Colombia, exige un cambio en todos los campos de la comunidad educativa, este cambio debe ser profundo y eficiente, a fin de garantizar un buen futuro para los niños y jóvenes y aportar mejores expectativas para la nación. De acuerdo con esto, en este trabajo, se plantea la posibilidad de aplicar el ábaco japonés en la enseñanza-aprendizaje de las matemáticas, sin demeritar la tecnología actual pero conscientes de que es necesario que los estudiantes mejoren su creatividad y capacidad para tomar decisiones. El trabajo está desarrollado en dos partes, la primera hace referencia al campo numérico (definiciones, operaciones, propiedades,...), y a la forma como aprenden los niños matemáticas en la escuela ; la segunda es la creación de un manual que sirva de apoyo en la enseñanza-aprendizaje de las operaciones matemáticas en el ábaco japonés, en él se hace una breve recopilación histórica del ábaco, en América prehispánica y los países orientales, se plantean diversas actividades lúdicas como preámbulo a la suma, resta, multiplicación y división para realizar con los alumnos y se explica paso a paso el manejo del ábaco japonés y como utilizarlo en el planteamiento y solución de dichas operaciones. Con ambas partes del proyecto de investigación se pretende brindar herramientas útiles para realizar un correcto trabajo en el aula, en el que se desarrolle la capacidad de análisis y habilidades de cálculo mental en los niños, como un sistema de aprendizaje dinámico y divertido. Durante la aplicación de la propuesta de enseñar las operaciones básicas teniendo como herramienta el ábaco japonés, se evidencio la creciente motivación por parte de los alumnos y razonamiento constante durante su manipulación al realizar las operaciones, además según lo expresado por los padres de familia se ha notado mejoría en otras asignaturas.

Learning math through movement: physical education as another alternative

The purpose of this study was to determine the cognitive effects of applying physical recreational activities to two groups of pre-school students, related to mathematics to one of the groups and recreational games to the other.  A total of 27 subjects (13 girls and 14 boys) of 5 and a half and 6 and half years of age participated in the study.  The instrument used was a questionnaire including basic math concepts such as geometry, basic operations with concrete elements, and how to read the clock, based on the topics established by the Costa Rican Ministry of Public Education.  Once the instrument was developed, a plan of physical recreational activities related to math was prepared and applied to the experimental group (pre-school B) for one and a half months, while the other group played recreational games.  Data was analyzed using descriptive and inferential statistics.  Positive and significant effects were found in the physical recreational activity program regarding student performance in 10 of the 12 items that were applied to assess mastery of basic math concepts.  In conclusion, using physical education as another instrument to teach other disciplines represents an excellent alternative for pre-school teachers that try to satisfy the learning needs of children that will soon be attending school.  Using movement as part of guided and planned activities plays an indispensable role in children’s lives; therefore, learning academic subjects should be adapted to their needs to explore and know their environment.

Getting started with power tools; a basic readily understandable book on the fundamental operations of power-tool equipment.

Mode of access: Internet.

Hand receipt covering contents of Components of End Item (COEI), Basic Issue Items (BII), and Additional Authorization Lists (AAL) for teletypewriter operations, central, AN/MGC-19A (NSN 5815-01-041-5104).

"1 October 1980."