The Inner Corona Algebra of a C0(X)-Algebra

Date of Acceptance: 15/07/2015

The Inner Corona Algebra of a C0(X)-Algebra

Date of Acceptance: 15/07/2015

Begreppens roll vid inlärning av algebra : En litteraturstudie om den roll begrepp och begreppsförmåga spelar vid inlärning av algebra för elever i årskurs 4-6

Svenska elever har presterat dåligt i internationella undersökningar en längre tid när det gäller algebraområdet i matematik. Elevernas begreppsförståelse har pekats ut som en faktor som spelar in i de dåliga resultaten för svenska elever del. Syftet med denna studie har därför varit att ta reda på den roll som begrepp och begreppsförmåga spelar vid inlärning av algebra samt vilken begreppsförståelse elever i årskurs 4-6 har. Genom en systematisk litteraturstudie har frågeställningarna besvarats. Resultaten visar att brister i begreppsförståelse i algebra också leder till brister i kunskap i algebra. Undervisning med fokus på begrepp leder till bättre förståelse för begrepp samtidigt som det även leder till procedurell kunskap. Elever i årskurs 4-6 kan hantera variabler och använda dem i matematiska uttryck. Fördelar med en tidig introduktion av variabelbegreppet är att elever bygger en bättre förståelse för begreppet.

Begreppens roll vid inlärning av algebra : En litteraturstudie om den roll begrepp och begreppsförmåga spelar vid inlärning av algebra för elever i årskurs 4-6

Svenska elever har presterat dåligt i internationella undersökningar en längre tid när det gäller algebraområdet i matematik. Elevernas begreppsförståelse har pekats ut som en faktor som spelar in i de dåliga resultaten för svenska elever del. Syftet med denna studie har därför varit att ta reda på den roll som begrepp och begreppsförmåga spelar vid inlärning av algebra samt vilken begreppsförståelse elever i årskurs 4-6 har. Genom en systematisk litteraturstudie har frågeställningarna besvarats. Resultaten visar att brister i begreppsförståelse i algebra också leder till brister i kunskap i algebra. Undervisning med fokus på begrepp leder till bättre förståelse för begrepp samtidigt som det även leder till procedurell kunskap. Elever i årskurs 4-6 kan hantera variabler och använda dem i matematiska uttryck. Fördelar med en tidig introduktion av variabelbegreppet är att elever bygger en bättre förståelse för begreppet.

Constructing strongly-MDS convolutional codes with maximum distance profile

This paper revisits strongly-MDS convolutional codes with maximum distance profile (MDP). These are (non-binary) convolutional codes that have an optimum sequence of column distances and attains the generalized Singleton bound at the earliest possible time frame. These properties make these convolutional codes applicable over the erasure channel, since they are able to correct a large number of erasures per time interval. The existence of these codes have been shown only for some specific cases. This paper shows by construction the existence of convolutional codes that are both strongly-MDS and MDP for all choices of parameters.

Superregular matrices and applications to convolutional codes

The main results of this paper are twofold: the first one is a matrix theoretical result. We say that a matrix is superregular if all of its minors that are not trivially zero are nonzero. Given a a×b, a ≥ b, superregular matrix over a field, we show that if all of its rows are nonzero then any linear combination of its columns, with nonzero coefficients, has at least a−b + 1 nonzero entries. Secondly, we make use of this result to construct convolutional codes that attain the maximum possible distance for some fixed parameters of the code, namely, the rate and the Forney indices. These results answer some open questions on distances and constructions of convolutional codes posted in the literature.

Computer-aided tool for the teaching of relational algebra in data base courses

This article describes the design and implementation of computer-aided tool called Relational Algebra Translator (RAT) in data base courses, for the teaching of relational algebra. There was a problem when introducing the relational algebra topic in the course EIF 211 Design and Implementation of Databases, which belongs to the career of Engineering in Information Systems of the National University of Costa Rica, because students attending this course were lacking profound mathematical knowledge, which led to a learning problem, being this an important subject to understand what the data bases search and request do RAT comes along to enhance the teaching-learning process.It introduces the architectural and design principles required for its implementation, such as: the language symbol table, the gramatical rules and the basic algorithms that RAT uses to translate from relational algebra to SQL language. This tool has been used for one periods and has demonstrated to be effective in the learning-teaching process.  This urged investigators to publish it in the web site: www.slinfo.una.ac.cr in order for this tool to be used in other university courses.

A case study of a district's intended and unintended results connected to the implementation of a required ninth-grade algebra 1 strategic initiative

There is a long history of debate around mathematics standards, reform efforts, and accountability. This research identified ways that national expectations and context drive local implementation of mathematics reform efforts and identified the external and internal factors that impact teachers’ acceptance or resistance to policy implementation at the local level. This research also adds to the body of knowledge about acceptance and resistance to policy implementation efforts. This case study involved the analysis of documents to provide a chronological perspective, assess the current state of the District’s mathematics reform, and determine the District’s readiness to implement the Common Core Curriculum. The school system in question has continued to struggle with meeting the needs of all students in Algebra 1. Therefore, the results of this case study will be useful to the District’s leaders as they include the compilation and analysis of a decade’s worth of data specific to Algebra 1.

Inductive Theorem Proving and Computer Algebra in the Mathweb Software Bus

Reasoning systems have reached a high degree of maturity in the last decade. However, even the most successful systems are usually not general purpose problem solvers but are typically specialised on problems in a certain domain. The MathWeb SOftware Bus (Mathweb-SB) is a system for combining reasoning specialists via a common osftware bus. We described the integration of the lambda-clam systems, a reasoning specialist for proofs by induction, into the MathWeb-SB. Due to this integration, lambda-clam now offers its theorem proving expertise to other systems in the MathWeb-SB. On the other hand, lambda-clam can use the services of any reasoning specialist already integrated. We focus on the latter and describe first experimnents on proving theorems by induction using the computational power of the MAPLE system within lambda-clam.

Deep convolutional neural networks for semantic video object segmentation

In this thesis, we propose to infer pixel-level labelling in video by utilising only object category information, exploiting the intrinsic structure of video data. Our motivation is the observation that image-level labels are much more easily to be acquired than pixel-level labels, and it is natural to find a link between the image level recognition and pixel level classification in video data, which would transfer learned recognition models from one domain to the other one. To this end, this thesis proposes two domain adaptation approaches to adapt the deep convolutional neural network (CNN) image recognition model trained from labelled image data to the target domain exploiting both semantic evidence learned from CNN, and the intrinsic structures of unlabelled video data. Our proposed approaches explicitly model and compensate for the domain adaptation from the source domain to the target domain which in turn underpins a robust semantic object segmentation method for natural videos. We demonstrate the superior performance of our methods by presenting extensive evaluations on challenging datasets comparing with the state-of-the-art methods.

MDP periodically time-varying convolutional codes

In this paper we use some classical ideas from linear systems theory to analyse convolutional codes. In particular, we exploit input-state-output representations of periodic linear systems to study periodically time-varying convolutional codes. In this preliminary work we focus on the column distance of these codes and derive explicit necessary and sufficient conditions for an (n, 2, 1) periodically time-varying convolutional code to have Maximum Distance Profile (MDP).

Input-state-output representations of concatenated 2D convolutional codes

In this paper we investigate a novel model of concatenation of a pair of two-dimensional (2D) convolutional codes. We consider finite-support 2D convolutional codes and choose the so-called Fornasini-Marchesini input-state-output (ISO) model to represent these codes. More concretely, we interconnect in series two ISO representations of two 2D convolutional codes and derive the ISO representation of the ob- tained 2D convolutional code. We provide necessary condition for this representation to be minimal. Moreover, structural properties of modal reachability and modal observability of the resulting 2D convolutional codes are investigated.

Rank metric convolutional codes

In this contribution, we propose a first general definition of rank-metric convolutional codes for multi-shot network coding. To this aim, we introduce a suitable concept of distance and we establish a generalized Singleton bound for this class of codes.

On MDS convolutional codes over Z_p^r

Maximum distance separable (MDS) convolutional codes are characterized through the property that the free distance meets the generalized Singleton bound. The existence of free MDS convolutional codes over Zpr was recently discovered in Oued and Sole (IEEE Trans Inf Theory 59(11):7305–7313, 2013) via the Hensel lift of a cyclic code. In this paper we further investigate this important class of convolutional codes over Zpr from a new perspective. We introduce the notions of p-standard form and r-optimal parameters to derive a novel upper bound of Singleton type on the free distance. Moreover, we present a constructive method for building general (non necessarily free) MDS convolutional codes over Zpr for any given set of parameters.