Combinatorics

Cross-listed with CompSci 575. A basic introduction to combinatorics and graph theory for advanced students in computer science, mathematics, and related fields. Topics include elements of graph theory, Euler and Hamiltonian circuits, graph coloring, matching, basic counting methods, generating functions, recurrences, inclusion-exclusion, Polya's theory of counting. Prerequisites: mathematical maturity, calculus, linear algebra, discrete mathematics course such as CompSci 250 or Math 455. Math 411 recommended but not required.

ST- Digital Behavioral Data

Algorithms and data increasingly power our private and civic life. Companies, nonprofits, and governments have invested heavily in data mining - the bulk collection of user behavior data from web platforms to understand public opinion and to forecast trends. A lot of fashionable terms, such as artificial intelligence and big data, are being thrown around these days. The public and regulators also become increasingly wary of the dark side of algorithms ?

Combntrcs&Graph Thry

Cross-listed with Math 513. A basic introduction to combinatorics and graph theory for advanced students in computer science, mathematics, and related fields. Topics include elements of graph theory, Euler and Hamiltonian circuits, graph coloring, matching, basic counting methods; generating functions; recurrences; inclusion-exclusion; Polya's theory of counting. Prerequisites: mathematical maturity; calculus; linear algebra; discrete mathematics course such as Comp-Sci 250 or Math 455. Math 411 recommended but not required.

Combntrcs&Graph Thry

Cross-listed with Math 513. A basic introduction to combinatorics and graph theory for advanced students in computer science, mathematics, and related fields. Topics include elements of graph theory, Euler and Hamiltonian circuits, graph coloring, matching, basic counting methods; generating functions; recurrences; inclusion-exclusion; Polya's theory of counting. Prerequisites: mathematical maturity; calculus; linear algebra; discrete mathematics course such as Comp-Sci 250 or Math 455. Math 411 recommended but not required.

Make: Physical Computing

Inspired by the Maker movement, this course provides a hands-on introduction to physical computing: sensing and responding to the physical world using computers. Specific topics include: basic electronics and circuit design, microcontroller programming using Arduinos, sensing and responding to the physical world, rapid prototyping (3D printing and laser cutting etc.), soft circuits and wearable electronics. The course will encourage and empower students to invent, design, and build practical hardware projects that interact with the physical world.

ST-SignalizedIntrsctins/Systms

Traffic control at intersections with an emphasis on intersection signalization; warrants that justify the installation of signals; signal sequence, timing, and phasing; pre-timed and actuated signals; traffic detection and signal controllers; computer simulation and modeling; algorithms and tools for evaluating the effectiveness of signals.

Sem-Form &Theory of Poetry

We will discuss how occult and paranormal experiences and practices of poets in the past show us the way to trusting these same forces are also alive and at work for us today. Rumi, Hannah Weiner, Will Alexander, Hoa Nguyen, Alice Notley, and Ariana Reines are some of the poets whose work and practices we will investigate. We will examine how fusions of poetry and the occult are reestablishing themselves with new outcomes, like the Emily Dickinson tarot deck produced by Amherst publisher Factory Hollow Press.
Subscribe to