This poster investigated the data from the past year of CS1 and found overwhelming evidence that students who have taken calculus are significantly more likely to succeed and less likely to fail that those who do not....
详细信息
ISBN:
(纸本)9781450351034
This poster investigated the data from the past year of CS1 and found overwhelming evidence that students who have taken calculus are significantly more likely to succeed and less likely to fail that those who do not. On a Fall 2016 CS1 final exam, students who had not earned credit for a first course in college-level calculus were 2.8 times more likely to fail it than those who had (p=<0.0001,N=844). The mean final score for students with calculus was an 84, and those without was 61 (p=<0.0001). The result surprised the instructor, course staff, and faculty familiar with the course because the course itself does not emphasize mathematical or scientific computing. The course was Java-based, objects-early, and introduces both object-oriented and imperative programming fundamentals. The effect was evident across a range of problems, none seemingly requiring beyond basic algebra. In the Spring of 2017, the instructor and course staff set forth to explore these questions and close the math gap discovered in the Fall of 2016. This poster further proposes to develop interventions to aid those with a lower math maturity level through introducing a specialized CS1 to better accommodate those with a lower math maturity level by reducing the pace and installing prerequisites for the established CS1. Prospective Computer Science students at liberal arts colleges and universities enter with a wide range of mathematical backgrounds. Failing to acknowledge these disparities is demoralizing to students during their first course in CS and is counter-productive to inclusivity.
NASA Technical Reports Server (Ntrs) 20050158730: Poetry in Programs: a Brief Examination of Software Aesthetics, Including Observations on the History of programming Styles and Speculations on Post-objectprogramming...
详细信息
NASA Technical Reports Server (Ntrs) 20050158730: Poetry in Programs: a Brief Examination of Software Aesthetics, Including Observations on the History of programming Styles and Speculations on Post-objectprogramming by NASA Technical Reports Server (Ntrs); published by
This paper is dedicated to teaching issues of the object-oriented programming course for bachelor students. It emphasizes specially on problems such as choosing C++ as programming language at the first stage of teachi...
详细信息
ISBN:
(纸本)9783642217821
This paper is dedicated to teaching issues of the object-oriented programming course for bachelor students. It emphasizes specially on problems such as choosing C++ as programming language at the first stage of teaching, percentage-optimized hybrid bi-lingual teaching, careful choice of textbook and teaching materials, etc. It insists that the teachers ought to he careful and considerate in designing various phases of the delivery of the course and provide the right teaching or referencing materials according to the knowledge foundation of different students. Moreover, necessary regular teaching methods would turn out effective during the process of teaching, which has been proved by the author's five-year teaching practice.
The advantages of using method Monte Carlo for simulation of radiative transfer in complex turbid random media like biological tissues are well recognized. However, in most practical applications the wave nature of pr...
详细信息
ISBN:
(纸本)9780819484444
The advantages of using method Monte Carlo for simulation of radiative transfer in complex turbid random media like biological tissues are well recognized. However, in most practical applications the wave nature of probing optical radiation is ignored, and its propagation is considered in terms of neutral particles, so-called photon packets. Nevertheless, when the interference, polarization or coherent effects of scattering of optical/laser radiation constitute the fundamental principle of a particular optical technique the wave nature of optical radiation must be considered and taken into account. In current report we present the state-of-the art and the development prospects for application of method Monte Carlo to the point of taking into account the wave properties of optical radiation. We also introduce a novel object-oriented programming (OOP) paradigm accelerated by Graphics Processing Unit that provides an opportunity to escalate the performance of standard Monte Carlo simulation up to 100 times.
Most numerical ODE solvers require problems to be written as systems of first-order differential equations. This normally requires the user to rewrite higher-order differential equations as coupled first-order systems...
详细信息
Most numerical ODE solvers require problems to be written as systems of first-order differential equations. This normally requires the user to rewrite higher-order differential equations as coupled first-order systems. Here, we introduce the treeVar class, written in object-oriented Matlab, which is capable of algorithmically reformulating higher-order ODEs to equivalent systems of first-order equations. This allows users to specify problems using a more natural syntax and saves them from having to manually derive the first-order reformulation. The technique works by using operator overloading to build up syntax trees of expressions as mathematical programs are evaluated. It then applies a set of rules to the resulting trees to obtain the first-order reformulation, which is returned as another program. This technique has connections with algorithmic/automatic differentiation. We present how treeVar has been incorporated in Chebfun, greatly improving the ODE capabilities of the system.
One of the main drawbacks of Element Free Galerkin (EFG) method is its dependence on moving least square shape functions which don't satisfy the Kronecker Delta property, so in this method it's not possible to...
详细信息
One of the main drawbacks of Element Free Galerkin (EFG) method is its dependence on moving least square shape functions which don't satisfy the Kronecker Delta property, so in this method it's not possible to apply Dirichlet boundary conditions directly. The aim of the present paper is to discuss different aspects of three widely used methods of applying Dirichlet boundary conditions in EFG method, called Lagrange multipliers, penalty method, and coupling with finite element method. Numerical simulations are presented to compare the results of these methods form the perspective of accuracy, convergence and computational expense. These methods have been implemented in an objectoriented programing environment, called INSANE, and the results are presented and compared with the analytical solutions.
Empirical validation of code metrics has a long history of success. Many metrics have been shown to be good predictors of external features, such as correlation to bugs. Our study provides an alternative explanation t...
详细信息
Empirical validation of code metrics has a long history of success. Many metrics have been shown to be good predictors of external features, such as correlation to bugs. Our study provides an alternative explanation to such validation, attributing it to the confounding effect of size. In contradiction to received wisdom, we argue that the validity of a metric can be explained by its correlation to the size of the code artifact. In fact, this work came about in view of our failure in the quest of finding a metric that is both valid and free of this confounding effect. Our main discovery is that, with the appropriate (non-parametric) transformations, the validity of a metric can be accurately (with R-squared values being at times as high as 0.97) predicted from its correlation with size. The reported results are with respect to a suite of 26 metrics, that includes the famous Chidamber and Kemerer metrics. Concretely, it is shown that the more a metric is correlated with size, the more able it is to predict external features values, and vice-versa. We consider two methods for controlling for size, by linear transformations. As it turns out, metrics controlled for size, tend to eliminate their predictive capabilities. We also show that the famous Chidamber and Kemerer metrics are no better than other metrics in our suite. Overall, our results suggest code size is the only "unique" valid metric.
Urban areas are in need of efficient and sustainable mobility services. Public bicycle sharing systems stand out as a promising alternative and many cities have invested in their deployment. This has led to a continuo...
详细信息
Urban areas are in need of efficient and sustainable mobility services. Public bicycle sharing systems stand out as a promising alternative and many cities have invested in their deployment. This has led to a continuous and fast implementation of these systems around the world, while at the same time, research works devoted to understand the system dynamics and deriving optimal designs are being developed. In spite of this, many promoting agencies have faced the impossibility of evaluating a system design in advance, increasing the uncertainty on its performance and the risks of failure. This paper describes the development of an agent-based simulation model to emulate a bike-sharing system. The goal is to obtain a tool to evaluate and compare different alternatives for the system design before their implementation. This tool will support the decision-making process in all the stages of implementation, from the strategical planning to the daily operation. The main behavioral patterns and schemes for all agents involved are designed and implemented into a Matlab programming code. The model is validated against real data compiled from the Barcelona’s Bicing system showing good accuracy.
It is difficult to map land covers in the urban core due to the close proximity of high-rise buildings. This difficulty is overcome with a proposed hybrid, the hierarchical method via fusing PAN-sharpened WorldView-2 ...
详细信息
It is difficult to map land covers in the urban core due to the close proximity of high-rise buildings. This difficulty is overcome with a proposed hybrid, the hierarchical method via fusing PAN-sharpened WorldView-2 imagery with light detection and ranging (lidar) data for central Auckland, New Zealand, in two stages. After all features were categorized into 'ground' and 'above-ground' using lidar data, ground features were classified from the satellite data using the object-oriented method. Above-ground covers were grouped into four types from lidar-derived digital surface model (nDSM) based on rules. Ground and above-ground features were classified at an accuracy of 94.1% (kappa coefficient or kappa = 0.913) and 93.7% (kappa = 0.873), respectively. After the two results were merged, the nine covers achieved an overall accuracy of 93.7% (kappa = 0.902). This accuracy is highly comparable to those reported in the literature, but was achieved at much less computational expense and complexity owing to the hybrid workflow that optimizes the efficiency of the respective classifiers. This hybrid method of classification is robust and applicable to other scenes without modification as the required parameters are derived automatically from the data to be classified. It is also flexible in incorporating user-defined rules targeting hard-to-discriminate covers. Mapping accuracy from the fused complementary data sets was adversely affected by shadows in the satellite image and the differential acquisition time of imagery and lidar data.
In this paper we propose a new mechanism for Dynamic Rebinding, a particular kind of Dynamic Software Updating that focuses on modifying the workflow of a program. This mechanism is built upon the concurrency model of...
详细信息
In this paper we propose a new mechanism for Dynamic Rebinding, a particular kind of Dynamic Software Updating that focuses on modifying the workflow of a program. This mechanism is built upon the concurrency model of Concurrent object Groups that is adopted in programming languages like Coboxes, Creol or ABS. Using this model, which extends and solves some of the limitations of Active objects, it becomes possible for an update to wait for the program to reach a local quiescent state and then perform the update without creating any inconsistency in the program's state. We validate our mechanism by formally proving that i) no updates are performed when the program has not reached a local quiescent state, ii) an update is guaranteed to be applied if we first wait for the program to reach a local quiescent state, and iii) it is possible to perform different updates atomically. We also provide a type system that checks the good usage of the rebinding operator. We implemented a prototype supporting our mechanism in the toolchain of the ABS language, and we tested the implementation by supporting dynamic changes in the server policy of an industrial case study from the eCommerce Fredhopper platform, offered by SDL. Without our rebinding mechanism, supporting such dynamic changes in a provably correct manner would not have been so simple. Finally, we developed an implementation of type checking for the ABS language extended with our rebinding primitives, and successfully tested it for the case study discussed in the paper. (C) 2016 Elsevier Inc. All rights reserved.
暂无评论