Cabri's role in the task of proving within the activity of building part of an axiomatic system

We want to show how we use the software Cabri, in a Geometry class for preservice mathematics teachers, in the process of building part of an axiomatic system of Euclidean Geometry. We will illustrate the type of tasks that engage students to discover the relationship between the steps of a geometric construction and the steps of a formal justification of the related geometric fact to understand the logical development of a proof; understand dependency relationships between properties; generate ideas that can be useful for a proof; produce conjectures that correspond to theorems of the system; and participate in the deductive organization of a set of statements obtained as solution to open-ended problems

Two Case Studies of Subsystem Design for General-Purpose CSCW Software Architectures

This paper discusses subsystem design guidelines for the software architecture of general-purpose computer supported cooperative work systems, i.e., systems that are designed to be applicable in various application areas requiring explicit collaboration support. In our opinion, guidelines for subsystem level design are rarely given most guidelines currently given apply to the programming language level. We extract guidelines from a case study of the redesign and extension of an advanced commercial workflow management system and place them into the context of existing software engineering research. The guidelines are then validated against the design decisions made in the construction of a widely used web-based groupware system. Our approach is based on the well-known distinction between essential (logical) and physical architectures. We show how essential architecture design can be based on a direct mapping of abstract functional concepts as found in general-purpose systems to modules in the essential architecture. The essential architecture is next mapped to a physical architecture by applying software clustering and replication to achieve the required distribution and performance characteristics

Logical Segmentation of Source Code

Many software analysis methods have come to rely on machine learning approaches. Code segmentation - the process of decomposing source code into meaningful blocks - can augment these methods by featurizing code, reducing noise, and limiting the problem space. Traditionally, code segmentation has been done using syntactic cues; current approaches do not intentionally capture logical content. We develop a novel deep learning approach to generate logical code segments regardless of the language or syntactic correctness of the code. Due to the lack of logically segmented source code, we introduce a unique data set construction technique to approximate ground truth for logically segmented code. Logical code segmentation can improve tasks such as automatically commenting code, detecting software vulnerabilities, repairing bugs, labeling code functionality, and synthesizing new code.Comment: SEKE2019 Conference Full Pape

On the derivation of class diagrams from use cases and logical software architectures

The transformation of user requirements into system requirements models can be achieved using the 4-Step Rule Set (4SRS) method that transforms UML use case diagrams into system-level object diagrams. These diagrams represent the logical architecture of the system, integrating the system-level entities, their responsibilities and the relationships among them. The logical architecture captures the system functional requirements and its nonfunctional intentionalities. Although contributing to the formalization of the design of software architectures, the 4SRS method needs to be extended in order to support the design of the database subsystems that may be considered pertinent within the specified logical architecture. This paper presents the extension of the 4SRS method to support the construction of the class diagram that complements the logical architecture, and shows, through the presentation of a demonstration case, the applicability of the proposed approach.(undefined

Low thrust orbit determination program

Logical flow and guidelines are provided for the construction of a low thrust orbit determination computer program. The program, tentatively called FRACAS (filter response analysis for continuously accelerating spacecraft), is capable of generating a reference low thrust trajectory, performing a linear covariance analysis of guidance and navigation processes, and analyzing trajectory nonlinearities in Monte Carlo fashion. The choice of trajectory, guidance and navigation models has been made after extensive literature surveys and investigation of previous software. A key part of program design relied upon experience gained in developing and using Martin Marietta Aerospace programs: TOPSEP (Targeting/Optimization for Solar Electric Propulsion), GODSEP (Guidance and Orbit Determination for SEP) and SIMSEP (Simulation of SEP)

Embodied truths: How dynamic gestures and speech contribute to mathematical proof practices

Grounded and embodied theories of cognition suggest that both language and the body play crucial roles in grounding higher-order thought. This paper investigates how particular forms of speech and gesture function together to support abstract thought in mathematical proof construction. We use computerized text analysis software to evaluate how speech patterns support valid proof construction for two different tasks, and we use gesture analysis to investigate how dynamic gestures—those gestures that depict and transform mathematical objects—further support proof practices above and beyond speech patterns. We also evaluate the degree to which speech and gesture convey distinct information about mathematical reasoning during proving. Dynamic gestures and speech indicating logical inference support valid proof construction, and both dynamic gestures and speech uniquely predict variance in valid proof construction. Thus, dynamic gestures and speech each make separate and important contributions to the formulation of mathematical arguments, and both modalities can convey elements of students’ understanding to teachers and researchers

Connection Management in Reconfigurable Distributed Systems

The Programmer\u27s Playground takes a new approach to simplifying and supporting the construction of distributed applications. The approach, called I/O abstraction, separates the description of a system\u27s communication structure from the descriptions of its computational components so that software modules written in existing programming languages cna be integrated flexibly and dynamically by both programmers and end-users. This separation is achieved by estabishing logical connectinos among the data interfaces of independent software modules. The logical connections provide a uniform high-level view of communication for both discrete and continuous data. The I/O abstraction approach inherits ideas from the I/O automaton model, a formal model of distributed computing that provides compositionality properties and supports behavioral specifications of system modules. Implications of I/O abstraction for process migration and the ordering of events in a distributed system will be studied. Software supporting the I/O abstraction programming model will be constructed. A high speed ATM network developed at Washington University will be used as a testbed for the devlopment work. The availability of this campus network offers an unusual opportunity to construct novel distributed (multimedia) applications and to test our ideas in realistic settings. The connection management network protocol (CMNP), the underlying protocol for the ATM networks, will be formally studied by giving a formal specification

Full stack development toward a trapped ion logical qubit

Quantum error correction is a key step toward the construction of a large-scale quantum computer, by preventing small infidelities in quantum gates from accumulating over the course of an algorithm. Detecting and correcting errors is achieved by using multiple physical qubits to form a smaller number of robust logical qubits. The physical implementation of a logical qubit requires multiple qubits, on which high fidelity gates can be performed. The project aims to realize a logical qubit based on ions confined on a microfabricated surface trap. Each physical qubit will be a microwave dressed state qubit based on 171Yb+ ions. Gates are intended to be realized through RF and microwave radiation in combination with magnetic field gradients. The project vertically integrates software down to hardware compilation layers in order to deliver, in the near future, a fully functional small device demonstrator. This thesis presents novel results on multiple layers of a full stack quantum computer model. On the hardware level a robust quantum gate is studied and ion displacement over the X-junction geometry is demonstrated. The experimental organization is optimized through automation and compressed waveform data transmission. A new quantum assembly language purely dedicated to trapped ion quantum computers is introduced. The demonstrator is aimed at testing implementation of quantum error correction codes while preparing for larger scale iterations.Open Acces