Over the academic year 2022-23, we discussed the teaching of software performance engineering with more than a dozen faculty across North America and beyond. Our outreach was centered on research-focused faculty with ...
详细信息
ISBN:
(纸本)9798350364613;9798350364606
Over the academic year 2022-23, we discussed the teaching of software performance engineering with more than a dozen faculty across North America and beyond. Our outreach was centered on research-focused faculty with an existing interest in this course material. These discussions revealed an enthusiasm for making software pertimmance engineering a more prominent part of a curriculum for computer scientists and engineers. Here, we discuss how MIT's longstanding efforts in this area may serve as a launching point for community development of a software performance engineering curriculum, challenges in and solutions for providing the necessary infrastructure to universities, and future directions.
Computing learners may not master basic concepts, or forget them between courses or from infrequent use. Learners also often struggle with advanced computing courses, perhaps from weakness with prerequisite concepts. ...
详细信息
ISBN:
(纸本)9781450382939
Computing learners may not master basic concepts, or forget them between courses or from infrequent use. Learners also often struggle with advanced computing courses, perhaps from weakness with prerequisite concepts. One underlying challenge for researchers and instructors is determining the reason why a learner gets an advanced question wrong. Was the wrong answer because the learner lacked prerequisite skills, has not mastered the advanced skill, or some combination of the two? We contribute a design investigation into how to create differentiated questions which diagnose prerequisite and advanced skills at the same time. We focused on tracing and related skills as prerequisites, and on advanced object-oriented programming, concurrency, algorithm and datastructures as the advanced skills. We conducted an inductive qualitative analysis of existing assessment questions from instructors and from a concept inventory with a validity argument (the Basic datastructures Inventory). We found dependencies on a variety of prerequisite knowledge and mixed potential for diagnosing difficulties with prerequisites. Inspired by this analysis, we developed examples of differentiated assessments and reflected on design principles for creating/modifying assessments to better assess both advanced and prerequisite skills. Our example differentiated assessment questions and methods help enable research into how prerequisites skills affect learning of advanced concepts. They also may help instructors better understand and help learners with varying prerequisite knowledge, which may improve equity of learning outcomes. Our work also raises theoretical questions about what assessments really assess and how separate advanced topics and prerequisite skills are.
The Minimum -Weight Parity Factor (MWPF) decoder is renowned for its accuracy in Quantum Error Correction (QEC) for various space-time codes, including surface codes and quantum LDPC codes. This work explores the scal...
详细信息
ISBN:
(纸本)9798331541378
The Minimum -Weight Parity Factor (MWPF) decoder is renowned for its accuracy in Quantum Error Correction (QEC) for various space-time codes, including surface codes and quantum LDPC codes. This work explores the scalability of MWPF decoders through parallelization, similar to parallel MWPM decoders. We introduce a dynamic fusion graph to schedule fusion operations in dynamic quantum circuits. It allows parts of the decoding graph to be solved and fused at a later stage, without having the full fusion tree at the very beginning. It also reduces the overhead caused by the traversing of the fusion tree. The dynamic fusion graph represents a novel and efficient method for real-time QEC decoding, providing enhancements in throughput and scalability for fault -tolerant quantum computing.
It is assumed that P is the product of two prime numbers q(1) and q(2). If there is an integer 0 < M < P such that M-2 equivalent to C (mod P), i. e., the congruence has a solution, then C is said to be a quadra...
详细信息
ISBN:
(纸本)9780769548982;9781467345668
It is assumed that P is the product of two prime numbers q(1) and q(2). If there is an integer 0 < M < P such that M-2 equivalent to C (mod P), i. e., the congruence has a solution, then C is said to be a quadratic congruence (mod P). Quadratic congruence (mod P) is a NP-complete problem. If the value of C is equal to one, then four integer solutions for M-2 equivalent to 1 (mod P) are, respectively, b, P - b, 1 and P - 1, where 1 < P - b < (P / 2) and (P / 2) < b < P - 1. This is a special case of quadratic congruence (mod P). In this paper, it is shown that four integer solutions for M-2 equivalent to 1 (mod P) can be found by means of the proposed quantum algorithms with polynomial quantum gates, polynomial quantum bits and the successful probability that is the same as that of Shor's order-finding algorithm.
We discuss two video series, one that serves as an introduction to Binary Search, and the other to Selection Sort. Each narrated series begins with an overview of the algorithm and step-by-step simulations on an inter...
详细信息
ISBN:
(纸本)9781450346986
We discuss two video series, one that serves as an introduction to Binary Search, and the other to Selection Sort. Each narrated series begins with an overview of the algorithm and step-by-step simulations on an interactive blackboard. The series next proceeds to a video that illustrates how to perform a complexity analysis with guided examples, and then applies that process to the associated algorithm. The series concludes with a video showcasing a song with algorithm pseudocode as lyrics, which are utilized line by line to implement the algorithm in code. These video series were piloted among a set of introductory courses involving coding and algorithmic concepts at two colleges. We assess the effectiveness of each series in terms of conceptual understanding and changes in student attitudes.
This Innovative Practice Full paper presents an effort on fostering student motivation and autonomy in support of adaptive learning. Higher education has been transformed by digital technology to be more interactive, ...
详细信息
ISBN:
(纸本)9781665438513
This Innovative Practice Full paper presents an effort on fostering student motivation and autonomy in support of adaptive learning. Higher education has been transformed by digital technology to be more interactive, self-paced, and adaptive to students. But this technology presupposes that students possess autonomy and are innately well motivated. Unfortunately, many students entering college lack motivation and self-control. These dispositions retard self-paced adaptive learning and limit the effectiveness of imparting improved adaptability in this technology. Taking inspiration from the self-determination theory, we investigated, in the context of adaptive learning, the importance of nurturing student autonomy and enhancing student situated motivation. In this paper, we present our experiential study in a gateway core course of computer science, in which adaptive preparation and learning pedagogy has been adopted for four semesters, one semester without motivating support and others with this support. By comparing and analyzing student engagement and performance over these four semesters, we observe that nurturing student autonomy and enhancing motivation are critical factors in maximizing the effectiveness of adaptive learning.
Fractional cascading is one of the influential and important techniques in datastructures, as it provides a general framework for solving a common important problem: the iterative search problem. In the problem, the ...
详细信息
ISBN:
(纸本)9781728196213
Fractional cascading is one of the influential and important techniques in datastructures, as it provides a general framework for solving a common important problem: the iterative search problem. In the problem, the input is a graph G with constant degree. Also as input, we are given a set of values for every vertex of G. The goal is to preprocess G such that when we are given a query value q, and a connected subgraph pi of G, we can find the predecessor of q in all the sets associated with the vertices of pi. The fundamental result of fractional cascading, by Chazelle and Guibas, is that there exists a data structure that uses linear space and it can answer queries in O(log n + vertical bar pi vertical bar) time, at essentially constant time per predecessor [15]. While this technique has received plenty of attention in the past decades, an almost quadratic space lower bound for "two-dimensional fractional cascading" by Chazelle and Liu in STOC 2001 [17] has convinced the researchers that fractional cascading is fundamentally a one-dimensional technique. In two-dimensional fractional cascading, the input includes a planar subdivision for every vertex of G and the query is a point q and a subgraph pi and the goal is to locate the cell containing q in all the subdivisions associated with the vertices of pi. In this paper, we show that it is actually possible to circumvent the lower bound of Chazelle and Liu for axis-aligned planar subdivisions. We present a number of upper and lower bounds which reveal that in two-dimensions, the problem has a much richer structure. When G is a tree and pi is a path, then queries can be answered in O (log n + vertical bar pi vertical bar + min{vertical bar pi vertical bar root log n;alpha(n) root vertical bar pi vertical bar log n}) time using linear space where alpha is an inverse Ackermann function;surprisingly, we show both branches of this bound are tight, up to the inverse Ackermann factor. When G is a general graph or when pi i
Hierarchical terrain models provide a multiresolution description of a topographic surface based on a nested partition of the domain. The tree-like structure of these models is an effective support to processing spati...
详细信息
Hierarchical terrain models provide a multiresolution description of a topographic surface based on a nested partition of the domain. The tree-like structure of these models is an effective support to processing spatial operations. In this paper, we consider visibility computations on hierarchical terrain models based on triangular subdivisions, called Hierarchical Triangulated Irregular Networks (HTINs). We address two basic problems in visibility computation, namely determining the visibility of a query object, and computing the viewshed of a given viewpoint. We propose algorithms for performing such operations on an HTIN at variable resolution. A general drawback of hierarchical models is in the inconsistency of representations at variable resolution obtained from them, since vertical gaps may occur at edges where different resolutions meet. The algorithms proposed here avoid this undesired effect. A related, but independent, contribution of this paper is also a new algorithm for extracting a consistent terrain representation at variable resolution from an HTIN.
This paper addresses the problem of computing least-cost-path surfaces for massive grid terrains. Consider a grid terrain T and let C be a cost grid for T such that every point in C stores a value that represents the ...
详细信息
In this paper we provide a parallel algorithm that given any n-node m-edge directed graph and source vertex s computes all vertices reachable from s with (O) over tilde (m) work and n(1/2+o(1)) depth with high probabi...
详细信息
ISBN:
(纸本)9781728149523
In this paper we provide a parallel algorithm that given any n-node m-edge directed graph and source vertex s computes all vertices reachable from s with (O) over tilde (m) work and n(1/2+o(1)) depth with high probability in n. This algorithm also computes a set of (O) over tilde (n) edges which when added to the graph preserves reachability and ensures that the diameter of the resulting graph is at most n(1/2+o(1)) Our result improves upon the previous best known almost linear work reachability algorithm due to Fineman [1] which had depth (O) over tilde (n(2/3)). Further, we show how to leverage this algorithm to achieve improved distributed algorithms for single source reachability in the CONGEST model. In particular, we provide a distributed algorithm that given a n-node digraph of undirected hop diameter D solves the single source reachability problem with (O) over tilde (n(1/2) + n(1/3+0(1)) D-2/3) rounds of the communication in the CONGEST model with high probability in n. Our algorithm is nearly optimal whenever D = 0(n(1/4-epsilon)) for any constant epsilon > 0 and is the first nearly optimal algorithm for general graphs whose diameter is Omega(n(delta)) for any constant delta.
暂无评论