13 research outputs found
Characterizing Forced Communication in Networks
This thesis studies a problem that has been proposed as a novel way to disrupt communication networks: the load maximization problem. The load on a member of a network represents the amount of communication that the member is forced to be involved in. By maximizing the load on an important member of the network, we hope to increase that member\u27s visibility and susceptibility to capture. In this thesis we characterize load as a combinatorial property of graphs and expose possible connections between load and spectral graph theory. We specifically describe the load and how it changes in several canonical classes of graphs and determine the range of values that the load can take on. We also consider a connection between load and liquid paint flow and use this connection to build a heuristic solver for the load maximization problem. We conclude with a detailed discussion of open questions for future work
GILP: An Interactive Tool for Visualizing the Simplex Algorithm
The Simplex algorithm for solving linear programs-one of Computing in Science
& Engineering's top 10 most influential algorithms of the 20th century-is an
important topic in many algorithms courses. While the Simplex algorithm relies
on intuitive geometric ideas, the computationally-involved mechanics of the
algorithm can obfuscate a geometric understanding. In this paper, we present
gilp, an easy-to-use Simplex algorithm visualization tool designed to
explicitly connect the mechanical steps of the algorithm with their geometric
interpretation. We provide an extensive library with example visualizations,
and our tool allows an instructor to quickly produce custom interactive HTML
files for students to experiment with the algorithm (without requiring students
to install anything!). The tool can also be used for interactive assignments in
Jupyter notebooks, and has been incorporated into a forthcoming Data Science
and Decision Making interactive textbook. In this paper, we first describe how
the tool fits into the existing literature on algorithm visualizations: how it
was designed to facilitate student engagement and instructor adoption, and how
it substantially extends existing algorithm visualization tools for Simplex. We
then describe the development and usage of the tool, and report feedback from
its use in a course with roughly 100 students. Student feedback was
overwhelmingly positive, with students finding the tool easy to use: it
effectively helped them link the algebraic and geometrical views of the Simplex
algorithm and understand its nuances. Finally, gilp is open-source, includes an
extension to visualizing linear programming-based branch and bound, and is
readily amenable to further extensions.Comment: ACM SIGCSE 2023 Manuscript, 13 pages, 5 figure