Determining maximum k-width-connectivity on meshes

AbstractLet I be a n × n binary image stored in a n × n mesh of processors with one pixel per processor. Image I is k-width-connected if, informally, between any pair of 1-pixels there exists a path of width k (composed of 1-pixels only). We consider the problem of determining the largest integer k such that I is k-width-connected, and present an optimal O(n) time algorithm for the mesh architecture

The Importance of Computing Education Research

Interest in computer science is growing. As a result, computer science (CS) and related departments are experiencing an explosive increase in undergraduate enrollments and unprecedented demand from other disciplines for learning computing. According to the 2014 CRA Taulbee Survey, the number of undergraduates declaring a computing major at Ph.D. granting departments in the US has increased 60% from 2011-2014 and the number of degrees granted has increased by 34% from 2008-2013

The Importance of Computing Education Research

Interest in computer science is growing. As a result, computer science (CS) and related departments are experiencing an explosive increase in undergraduate enrollments and unprecedented demand from other disciplines for learning computing. According to the 2014 CRA Taulbee Survey, the number of undergraduates declaring a computing major at Ph.D. granting departments in the US has increased 60% from 2011-2014 and the number of degrees granted has increased by 34% from 2008-2013

Computational thinking in high school courses

All in-text references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately

The Importance of Computing Education Research

Interest in computer science is growing. As a result, computer science (CS) and related departments are experiencing an explosive increase in undergraduate enrollments and unprecedented demand from other disciplines for learning computing. According to the 2014 CRA Taulbee Survey, the number of undergraduates declaring a computing major at Ph.D. granting departments in the US has increased 60% from 2011-2014 and the number of degrees granted has increased by 34% from 2008-2013. However, this growth is not limited to higher education. New York City, San Francisco and Oakland public schools will soon be offering computer science to all students at all schools from preschool to 12th grade, although it will be an elective for high school students. This unprecedented demand means that CS departments are likely to teach not only more students in the coming decades, but more diverse students, with more varied backgrounds, motivations, preparations, and abilities. This growth is an unparalleled opportunity to expand the reach of computing education. However, this growth is also a unique research challenge, as we know very little about how best to teach our current students, let alone the students soon to arrive. The burgeoning field of Computing Education Research (CER) is positioned to address this challenge by answering research questions such as, how should we teach computer science, from programming to advanced principles, to a broader and more diverse audience? We argue that computer science departments should lead the way in establishing CER as a foundational research area of computer science, discovering the best ways to teach CS, and inventing the best technologies with which to teach it. This white paper provides a snapshot of the current state of CER and makes actionable recommendations for academic leaders to grow CER as a successful research area in their departments.Comment: A Computing Community Consortium (CCC) white paper, 12 page

Exploring the Baccalaureate Origin of Domestic Ph.D. Students in Computing Fields

Increasing the number of US students entering graduate school and receiving a Ph.D. in computer science is a goal as well as a challenge for many US Ph.D. granting institutions. Although the total computer science Ph.D. production in the U.S. has doubled between 2000 and 2010 (Figure 1), the fraction of domestic students receiving a Ph.D. from U.S. graduate programs has been below 50% since 2003 (Figure 2). The goal of the Pipeline Project of CRA-E (PiPE) is to better understand the pipeline of US citizens and Permanent Residents (henceforth termed domestic students ) who apply, matriculate, and graduate from doctoral programs in computer science. This article is the first of two articles from CRA-E examining this issue. This article provides an initial examination of the baccalaureate origins of domestic students who have matriculated to Ph.D. programs in computer science. We hope that trends and patterns in these data can be useful both in recruiting and, ultimately, in improving the quality and quantity of the domestic Ph.D. pipeline

Two-Layer Channel Routing with Vertical Unit-Length Overlap

We show that any n-net 2-terminal channel routing problem of density d can be wired on a two-layer grid of width w = d + 0 (d1J3) when vertical wire segments are allowed to overlap for a dis-tance of length 1. TItis is a considerable asymptotic improvement over the best known, and optimal, channel width of 2d-l for models in which no vertical overlap is allowed [RBM, PL]. OUf result also improves the 3d12 + 0(1) channel width achieved by a recent algorilhm [0] for the same vertical overlap model. The algorithm presented in this paper produces at most 4 over-laps of unit length between any two nets, uses 0 (n) contacts, and can be implemented to run in O(nd2l3) time. We also generalize the algorithm to multi-terminal channel routing problems for which our algorithm uses a width ofw = 2d + 0 (d 2J3)