Within the framework of the superadditive duality theory of integer programming, we study two types of dual-feasible functions of a single real variable (Alves et al., 2016). We introduce software that automates testi...
详细信息
Within the framework of the superadditive duality theory of integer programming, we study two types of dual-feasible functions of a single real variable (Alves et al., 2016). We introduce software that automates testing piecewise linear functions for maximality and extremality, enabling a computer-based search. We build a connection to cut-generating functions in the Gomory-Johnson and related models, complete the characterization of maximal functions, and prove analogues of the Gomory-Johnson 2-slope theorem and the Basu-Hildebrand-Molinaro approximation theorem. (c) 2019 Elsevier B.V. All rights reserved.
Parallel programming remains a daunting challenge, from the struggle to express a parallel algorithm without cluttering the underlying synchronous logic, to describing which devices to employ in a calculation, to corr...
详细信息
As we increasingly rely on artificial intelligence systems, we must ensure that those systems are reliable and need to know how much we can rely on them. In software quality assurance, testing is a useful method to hi...
详细信息
ISBN:
(纸本)9783031808883;9783031808890
As we increasingly rely on artificial intelligence systems, we must ensure that those systems are reliable and need to know how much we can rely on them. In software quality assurance, testing is a useful method to highlight and fix issues during development to avoid unexpected behavior after the system has been deployed. Artificial intelligence engineers are increasingly becoming aware of quality assurance as a requirement. Previous results in the area of answer set programming suggest that a high proportion of errors can be found when testing a program against a small scope, i.e. by inputs from a small domain. However, these results are based on assumptions that may be impractical for testing. To find out whether small scopes remain sufficient in practice, we evaluate several benchmarks against actual test oracles. Our findings suggest that small scopes can indeed find a high proportion of errors, but results depend on the observed benchmark and appropriate test oracles are required to achieve reliable scores.
Because of the structural parallelisms between music and computing, it has long been suggested that coding music could be a good way for young children to engage in and learn about computerscience (CS). Despite these...
详细信息
ISBN:
(纸本)9798400701313
Because of the structural parallelisms between music and computing, it has long been suggested that coding music could be a good way for young children to engage in and learn about computerscience (CS). Despite these suggestions, coding music has not reached a wider audience of young children, and the approach's potential to engage them has not been thoroughly demonstrated. To facilitate the adoption of coding music activities, we created M-flow, a flow-based programming platform that allows young children to code music intuitively from the outset. Then, we developed a standards-aligned curriculum that teachers applied in their fourth-grade classrooms. Surveys indicate that children were greatly engaged, the experience successfully exposed them to and increased their self-efficacy toward programming. Our results indicate that with the appropriate coding platform, coding music can be a powerful way to engage children in CS.
We present a hardware implementation of the high-level multi-paradigm language OCAML using a declarative language called Eclat. Eclat is tailored for programming reactive hardware applications mixing interaction with ...
详细信息
ISBN:
(纸本)9783031520372;9783031520389
We present a hardware implementation of the high-level multi-paradigm language OCAML using a declarative language called Eclat. Eclat is tailored for programming reactive hardware applications mixing interaction with physical devices and long-running computations. It is compiled to synthesizable hardware descriptions for configuring Field Programmable Gate Arrays (FPGAs). We have implemented the OCAML Virtual Machine as an Eclat function to execute complex computations (programmed in OCAML) in reactive applications (programmed in Eclat). This implementation comprises a bytecode interpreter and a runtime system with automatic memory management. The OCAML programmers can customize this runtime by defining external Eclat functions, i.e., hardware accelerators.
Stream processing systems must often cope with workloads varying in content, format, size, and input rate. The high variability and unpredictability make statically fine-tuning them very challenging. Our work addresse...
详细信息
ISBN:
(纸本)9783031695827;9783031695834
Stream processing systems must often cope with workloads varying in content, format, size, and input rate. The high variability and unpredictability make statically fine-tuning them very challenging. Our work addresses this limitation by providing a new framework and run-time system to simplify implementing and assessing new self-adaptive algorithms and optimizations. We implement a prototype on top of MPI called MPR and show its functionality. We focus on horizontal scaling by supporting the addition and removal of processes during execution time. Experiments reveal that MPR can achieve performance similar to that of a handwritten static MPI application. We also assess MPR's adaptation capabilities, showing that it can readily re-configure itself, with the help of a self-adaptive algorithm, in response to workload variations.
For a given undirected graph G = (V, E) with a non-negative weight function w : E -> R+ and subsets G(1),..., G(k) of V, the Group Steiner Tree (GST) problem consists of constructing a tree T = (V-T, E-T) with mini...
详细信息
ISBN:
(纸本)9783031629112;9783031629129
For a given undirected graph G = (V, E) with a non-negative weight function w : E -> R+ and subsets G(1),..., G(k) of V, the Group Steiner Tree (GST) problem consists of constructing a tree T = (V-T, E-T) with minimal cost, where V-T. subset of V, E-T subset of E, and T spans at least one node from each of the groups. We develop a VNS-based metaheuristics approach for solving the GST problem. Our main contribution is that we propose a new problem-specific node release strategy that mimics the steps of a VNS-based heuristic. Instead of exploring different neighborhoods by combinatorially enumerating neighboring solutions, as in classical local search, we use a provably good Integer Linear programming (ILP) formulation to solve a sequence of subproblems of the original problem. Our approach leads to an improvement over the state-of-theart Gurobi solver both in terms of quality and runtime of the instances available in the literature.
In recent decades, the demand for STEM professionals has increased, and consequently, the effort of educational institutions to sponsor their STEM degrees. In the context of a university program promoting STEM careers...
详细信息
ISBN:
(纸本)9783031616877;9783031616884
In recent decades, the demand for STEM professionals has increased, and consequently, the effort of educational institutions to sponsor their STEM degrees. In the context of a university program promoting STEM careers among high-school students, we designed a workshop for middle and high-school students to show them a different perspective of computing as a pragmatic, social, and people-centered profession. We focus on teaching basic concepts of Human-computer Interaction (HCI) as part of a problem-solving strategy to offer creative solutions to real problems of real people. The workshop proposes a list of well-known problems in urban environments, like social integration, elderly loneliness, or recycling, and asks the students to solve them envisioning an innovative mobile app by following a design thinking approach and applying several design artifacts, like scenario boards, user personas, thematic cards, and paper-based sketches. The results show that with little or no experience in designing and programming, participants engage in fruitful brainstorming sessions, offer creative solutions, and even implement low-level prototypes.
This study explores the impact of free choice of examination format on student performance in the ‘programming of Mobile Applications’ (PMA) course at the Saxon University of Cooperative Education. The PMA course, o...
详细信息
As computerscience is integrated into a wider variety of fields, block-based programming languages like Snap!, which assemble code with visual blocks rather than text syntax, are increasingly used to teach computatio...
详细信息
ISBN:
(纸本)9781450394338
As computerscience is integrated into a wider variety of fields, block-based programming languages like Snap!, which assemble code with visual blocks rather than text syntax, are increasingly used to teach computational thinking (CT) to students from diverse backgrounds. Although automated evaluators (autograders) for programming assignments usually focus on runtime efficiency and output accuracy, effective evaluation of a student's CT skills requires assessing coding best practices, such as decomposition, abstraction, and algorithm design. While autograders are commonplace for text languages like Python, we present a machine learning approach to assess how effectively block-based code demonstrates understanding of CT fundamentals. Our dataset consists of Snap! programs written by students new to coding and evaluated by instructors using a CT rubric. We explore how to best transform these programs into low-dimensional features to allow encapsulation and repetition patterns to emerge. Experimentation involves comparing the effectiveness of a suite of clustering models and similarity metrics by analyzing how directly automated feedback correlates to the course staff's manual evaluation. Lastly, we demonstrate the practical application of the autograder in a classroom setting and discuss scalability and feasibility in other domains of CS education.
暂无评论