Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision		Previous revision
department:cs_research_seminar_talks [2022/10/06 15:28] – [Fall 2022 Schedule] bowersjcdepartment:cs_research_seminar_talks [2025/09/19 13:27] (current) – [CS Research Seminar Talks] bowersjc
Line 1: Line 1:
- 
 ====== CS Research Seminar Talks ====== ====== CS Research Seminar Talks ======
  
-The CS Research Seminar Talks are talks given by faculty members and undergraduate research assistants on a variety of topics at the cutting edge of computer science research. Talks happen on Fridays at 12:40 pm and are usually held in King Hall room 236.  The format is a 40-45 minute research talk with 5-10 minutes reserved for questions. All CS students (and other interested students and faculty) are invited to attend. Email announcements about each seminar will be sent to the CS listserv.+The CS Research Seminar Talks are talks given by faculty members and undergraduate research assistants on a variety of topics at the cutting edge of computer science research. Talks happen on **Fridays at 11:25am** (Fall 2025) and are usually held in **King 243**.  The format is a 40-45 minute research talk with 5-10 minutes reserved for questions. All CS students (and other interested students and faculty) are invited to attend. Email announcements about each seminar will be sent to the CS listserv. 
 + 
 +==== Fall 2025 ==== 
 + 
 +  * Sept 19 - What is Research? (11:20-12:30 King 259) [[https://w3.cs.jmu.edu/bowersjc/what_is_research-2025.pdf|Slides]] 
 +  * Oct 10 - Isaac Wang (11:30-12:20 King 243) 
 +  * Oct 31 - Nathan Sprague (11:30-12:20 King 243) 
 +  * Nov 14 - Prajakta Belsare (11:30-12:20 King 243) 
 +  * Nov 21 - Adeen Ayub (11:30-12:20 King 243) 
 + 
 +==== Fall 2024 ==== 
 +[[https://w3.cs.jmu.edu/bowersjc/what_is_research-2024.pdf|Fall 2024 What is Research Slides]]  
 + 
 +**Abstracts for Fall 2024 Talks** 
 + 
 +**Dec 6** Dr. Zhuojun Duan - //Linking Pollution to Thunderstorm Formation Using Data Mining// 
 + 
 +**Abstract:** This project conducts a multi-variable investigation of thunderstorm environments across two distinct geographic regions to explore the aerosol and thermodynamic conditions associated with thunderstorm initiation. A 12-year dataset of cloud-to-ground (CG) lightning flashes was used to reconstruct thunderstorms within a 225 km radius centered on the Washington, D.C., and Kansas City metropolitan areas. A total of 196,836 and 310,209 thunderstorms were identified for Washington, D.C., and Kansas City, MO, respectively. Hourly meteorological and aerosol data were integrated with the thunderstorm event database. 
 +  
 +Our findings reveal that warm-season thunderstorm environments under benign synoptic conditions differ significantly in thermodynamics, aerosol properties, and concentrations between the Washington, D.C., and Kansas City regions. Despite these differences, thunderstorm intensity—measured by flash counts—appears to be governed by similar thermodynamic-aerosol interactions across both regions. Specifically, statistically significant positive relationships were observed between convective available potential energy (CAPE) and flash counts. Furthermore, aerosol concentration emerged as a more critical factor for lightning enhancement than particle size. 
 + 
 +**Nov 22** Dr. Bradley McCoy - //Guarding// 
 + 
 +**Abstract:** Given a polyhedral terrain and a set of guard points, a point q on the terrain is guarded if there is at least one point in the guard set that sees q. In this talk, we consider variations of this problem. We will look back at classical guarding results such as Chavatal's art gallery theorem. We will share recent results on guarding terrains with segments. Then, we will look forward to several open problems. The open problems have a low barrier of entry. So, please bring something to write with and be ready to participate. 
 + 
 +**Oct 25** Will Morris - //Bringing Robustness Analysis to TLA+ and Why it Matters// 
 + 
 +**Abstract:** Tired of missing subtle edge cases in your programming assignments? Come learn how to easily prove your algorithms are correct! In response to today’s increasingly complex software systems, interest is growing in formal specification languages that allow users to prove properties of high-level models of their systems. In this presentation, I will examine the merits of model checking with a special emphasis on the TLA+ specification language. I will then explore the limitations of model checking and how the notion of software robustness can address those limits. Finally, I will detail my efforts to elevate robustness to a first-class citizen of the TLA+ language. I will also talk about my experience in the (paid) Research Experience for Undergraduates program under which I did this research, with an eye towards students who might consider applying. 
 + 
 +==== Spring 2024 ==== 
 + 
 +**Apr 26** Ellona Macmillan - //MemDia: A JavaScript Library for Drawing Memory Diagrams// 
 + 
 +**Abstract:** A memory diagram is a picture that shows the contents of memory at a certain point in time while a program is running. Introductory CS courses (such as 149, 159, 240, and 261) use memory diagrams to teach subtle concepts about variables, objects, arrays, and references. Visualization tools like Python Tutor and Java Visualizer draw memory diagrams incrementally as the user steps through a program’s code. However, these tools are programming language specific and use a drawing format that is difficult for students to imitate. To address these limitations, we are developing a new library, named MemDia, for drawing memory diagrams in the browser. The user specifies a diagram in a plain text syntax, and the library draws the corresponding image in SVG format. MemDia is primarily designed for instructors and authors who wish to embed memory diagrams in classroom activities, lecture slides, and other materials. 
 + 
 +**Apr 26** Ben Saupp - //Praxly: An Online IDE for the Praxis CS Test Pseudocode// 
 + 
 +**Abstract:** CodeVA offers a 15-week professional development course for Virginia K-12 teachers to prepare for the Praxis CS test. Teachers who pass this standardized test fulfill licensure requirements to teach advanced CS courses in public schools. The test uses a pseudocode language that is quite different from traditional programming languages. Previously, teachers have not had an easy way to trace the execution of pseudocode programs when learning and practicing. This talk will present Praxly, an online IDE for teachers to visualize, run, and debug Praxis pseudocode programs. We will demo Praxly's main features including a new step debugger. We will discuss Praxly’s layered architecture and implementation details. Finally, we will summarize experiences of an initial cohort of high school teachers who used Praxly during the past five months. Future revisions to the CodeVA course will embed Praxly into Canvas as the primary means for teaching pseudocode. 
 + 
 +**Apr 12** Dr. Chris Johnson - //This is Knot Coding// 
 + 
 +**Abstract:** A knot is a path that meanders through space and returns to its start, usually crossing over itself many times. Knots have been studied by artists and mathematicians for centuries. You've seen knots in Roman, Celtic, and Islamic architecture and illuminated manuscripts. If you've ever used a Macintosh computer, you've touched one when you pressed the Command key. In this highly interactive workshop, you will learn to design your own custom knot as a mosaic of hexagonal tiles. Then you'll code it up in Twoville, a language written by Dr. Johnson for expressing shapes, and fabricate it as a vinyl sticker that you can take home. Bring a computer. 
 + 
 +**Mar 22** Dr. Siddharth Bhaskar - //How do we run a program for an infinite number of steps?//  
 + 
 +**Abstract:** The finite world is just a tiny corner in our (mathematical) universe. Many natural algorithms extend smoothly to infinite data structures, where they typically require infinitely many steps to run. However, we have no way to formalize these algorithms with code, because we have no way to endow our code with a semantics that handles such transfinite computation. In this talk, I will construct a solution. 
 + 
 + 
 +==== Fall 2023 Schedule ==== 
 + 
 +Tue 9/12: Distinguished Lecture Series, Dr. Laurent Babout (Lodz University of Technology). King 259 11:30-12:30pm 
 + 
 +Fri 9/15: Research Talk: What is Research? (With Mike Lam and Co.) King 259 11:25am-12:25pm [[https://w3.cs.jmu.edu/bowersjc/what_is_research-2023.pdf|Slides]] 
 + 
 +Fri 9/22: Research Talk: Ben Saupp. King 236 11:25am-12:25pm 
 + 
 +Thu 9/28: Distinguished Lecture Series, Dr. Everlyne Kimani (Toyota Research Institute). King 259 2:30-3:30pm.  
 + 
 +Fri 10/27: Research Talk: Dr. Chris Mayfield. King 236 11:25am-12:25pm 
 + 
 +Fri 12/1: Research Talk: Dr. Dee Weikle. King 236 11:25am-12:25pm 
 + 
 +Fri 12/8: Research Talk: Dr. Siddharth Bhaskar. King 236 11:25am-12:25pm 
 + 
 + 
 +**Abstracts for the 2023 Fall Research Talks** 
 + 
 +* **Sept. 22** Ben Saupp -- //Praxly: An Online IDE for the Praxis CS Test Pseudocode// 
 + 
 +**Abstract:** 
 +CodeVA has a new professional development (PD) course designed to prepare Virginia high school Career Technical Education (CTE) teachers for the Praxis CS test. This test uses a pseudocode language that is different from traditional programming languages. In CodeVA’s course, teachers do not have an easy way to verify the correctness of pseudocode programs when learning and practicing. This talk will introduce Praxly, an online IDE we developed over the summer, for teachers to write, visualize, and run pseudocode. We will highlight Praxly’s implementation details, outline our current research goals, and discuss next steps for the project.
  
 ==== Fall 2022 Schedule ==== ==== Fall 2022 Schedule ====
Line 8: Line 77:
 * **Oct 7** Prof. John C. Bowers  //A proof of the Koebe-Andre'ev-Thurston theorem via flow from tangency packings// * **Oct 7** Prof. John C. Bowers  //A proof of the Koebe-Andre'ev-Thurston theorem via flow from tangency packings//
  
-* **Nov 4** Prof. Siddharth Bhaskar //TBD//+* **Nov 4** Prof. Siddharth Bhaskar //Four naive questions in the theory of algorithms//
  
-* **Nov 11** Virginia Tech PhD Candidate and JMU CS Alumna Kylie Davidson //TBD//+* **Nov 11** Virginia Tech PhD Candidate and JMU CS Alumna Kylie Davidson //Exploring Sensemaking Strategies in Immersive Space to Think//
  
-* **Nov 18** Prof. Michael Kirkpatrick //TBD// 
- 
-* **Dec 2** Prof. Nathan Sprague //TBD// 
  
 **Abstracts for the 2022 Fall Research Talks** **Abstracts for the 2022 Fall Research Talks**
Line 23: Line 89:
 The beginning of the study of circle packings is the circle packing theorem, which says that any triangulation of the sphere can be realized as a pattern of interior-disjoint disks on the sphere whose tangency graph is isomorphic to the triangulation. The now classic Koebe-Andre’ev-Thurston theorem extends the circle packing theorem to weighted triangulations whose weights code for overlap angles of up to pi/2 between disks and not just tangencies. Recently Connelly and Gortler gave a new proof of the Circle Packing Theorem, which is also constructive—the proof gives rise to a numerical algorithm for computing a circle packing for any given triangulation. In this talk we will give an overview of Connelly and Gortler’s result and describe a new proof of the full Koebe-Andre’ev-Thurston theorem that extends their approach to packings with overlaps up to pi/2 and gives rise to an algorithm for computing them. We will discuss the main hurdles to the generalization and the main ideas used to overcome them. We will also show demo code for computing the packings.  The beginning of the study of circle packings is the circle packing theorem, which says that any triangulation of the sphere can be realized as a pattern of interior-disjoint disks on the sphere whose tangency graph is isomorphic to the triangulation. The now classic Koebe-Andre’ev-Thurston theorem extends the circle packing theorem to weighted triangulations whose weights code for overlap angles of up to pi/2 between disks and not just tangencies. Recently Connelly and Gortler gave a new proof of the Circle Packing Theorem, which is also constructive—the proof gives rise to a numerical algorithm for computing a circle packing for any given triangulation. In this talk we will give an overview of Connelly and Gortler’s result and describe a new proof of the full Koebe-Andre’ev-Thurston theorem that extends their approach to packings with overlaps up to pi/2 and gives rise to an algorithm for computing them. We will discuss the main hurdles to the generalization and the main ideas used to overcome them. We will also show demo code for computing the packings. 
  
 +* **Oct 7** Prof. Siddharth Bhaskar -- //Four naive questions in the theory of algorithms//
  
 +**Abstract:**
 +In this talk I will raise four questions that you could, in theory, ask after taking a first data structures and algorithms course, viz.,
 +
 +--Why are so many sorting algorithms quadratic time?
 +
 +--Why are stacks and queues the "only" implementation of certain abstract data type (namely add, query a distinguished element (the "top"), delete the top, and an empty test) for collections of unstructured data?
 +
 +--Why are there only about three different types of proofs of general lower bounds?
 +
 +--What is an algorithm anyway?
 +
 +To be clear, I don't know a definitive answer to any of these, but the questions seem to be deep and continue to inspire me. I shall discuss each question, illustrate what the underlying problem is, and say a few words about how each has inspired some specific research projects.
 +
 +
 +* **Nov 9** PhD. candidate  Kylie Davidson -- //Exploring Sensemaking Strategies in Immersive Space to Think//
 +
 +**Abstract:**
 +Existing research on immersive analytics to support the sensemaking process focuses on single-session sensemaking tasks. However, in the wild, sensemaking can take days or months to complete. In order to understand the full benefits of immersive analytic systems, we need to understand how immersive analytic systems provide flexibility for the dynamic nature of the sensemaking process. In our work, we build upon an existing immersive analytic system – Immersive Space to Think, to evaluate how immersive analytic systems can support sensemaking tasks over time. We conducted a user study with eight participants with three separate analysis sessions each. We found significant differences between analysis strategies between sessions one, two, and three, which suggest that immersive space to think can benefit analysts during multiple stages in the sensemaking process.
 ==== Spring 2022 Schedule ==== ==== Spring 2022 Schedule ====