Events

Sep 16

ESM/MATSE Career Fair


6:00-8:00 pm 102 ECoRE

Meet students from the ESM and MATSE departments! We are seeking company representatives to meet our students during the career fair. Please RSVP below.

Details...

Sep 16-17

Graph Algorithms: Structural Parameters and Applications in Algorithmic Game Theory

W375 Westgate Building
10:00am

This dissertation studies graph algorithms from two perspectives: exploiting structural decompositions to solve hard problems on graphs and applying graph-algorithmic techniques to fairness in resource allocation. Part I asks how efficiently the structure of a graph can be measured and exploited. Structural width parameters and separator decompositions are what make hard problems tractable on sparse graphs; part I explores the price of obtaining and using them. The first chapter presents an improved algorithm for 2-approximate treewidth computation, reducing the exponential base from 1782^k to 81^k while maintaining linear dependence on n. The second chapter studies the leading constant of the fill bound for planar nested dissection and analyzes approaches to decreasing it. We reduce the constant from 55.8 to 34.2 unconditionally, and show that further gains require a separator balancing the inherited boundary and vertex count. We also prove simulating such a separator by vertex weighting cannot be certified by a potential function of the classical form. For both chapters, the asymptotic landscape is settled by prior work; the contributions are to the constants that govern practical performance. Part II maps the computational landscape of envy minimization in house allocation and applies graph-algorithmic techniques to algorithmic game theory. Here, the structure in question is the pattern of comparisons between agents, and the objective is to maximize fairness in the allocation of indivisible resources. The third chapter analyzes the complexity and trade-offs involved in balancing three distinct efficiency notions (allocation size, utilitarian welfare, egalitarian welfare) against four envy measures. We show that maximizing utilitarian welfare makes every envy-minimization variant polynomial, while egalitarian welfare preserves NP-hardness. The fourth chapter introduces minimax envy on graphs embedding social networks and analyzes the complexity of finding an allocation when only adjacent neighbors may envy each other. We find an exact solution in O^*(6^n) for identical strict preferences, and show that arbitrary distinct preferences yield an upper bound 2^{O(nlog n)} poly(m) FPT algorithm. We also provide exact algorithms, singly exponential in n, parameterized by treewidth tw and the disagreement. In both parts, the object of the study remains the same: understanding how the structure of the graph makes difficult problems tractable.

Details...

Sep 16

Seeing the Invisible Order in Biological Materials using a Nonlinear Vibrational Spectroscopy Technique

254 Health and Human Development
3:35-4:25 pm

E SC/E MCH 514 graduate Seminar

Additional Information:

Dr. Seong H. Kim is the Department Head and Walter L. Robb Family Endowed Chair in the Robert V. Waltemyer Department of Chemical Engineering at The Pennsylvania State University. A globally recognized expert in surface science and tribology, Dr. Kim’s research spans a wide range of materials including silicate glasses, natural biopolymers, and advanced carbon coatings. His work has significantly advanced the understanding of surface chemistry, mechanochemistry, and the durability of materials under environmental and mechanical stresses. His recent research focuses on characterizing invisible subsurface damage in glass, tribochemical reactions at sliding interfaces, and the structural analysis of natural materials using advanced spectroscopic techniques. Dr. Kim’s interdisciplinary approach continues to influence both fundamental science and industrial applications, particularly in the fields of nuclear waste management, display glass technology, and sustainable materials. Dr. Kim earned his Ph.D. in Chemistry from Northwestern University and completed postdoctoral research at the University of California, Berkeley. Since joining Penn State in 2001, he has held numerous leadership roles and was named a Distinguished Professor in 2021. He has authored over 400 peer-reviewed publications (with h-index of 78), wrote textbook Surface and Interface Analysis: Principles and Applications, and is a Fellow of the Society of Tribologists and Lubrication Engineers.

Details...

Sep 17

Data Importance for Semantic Communication and Networking

W375 Westgate Building
1:30pm

In this talk, we present an importance-driven cross-layer design for semantic communication and networking. Building on statistical decision theory, we introduce an information-theoretic measure of per-sample data importance that quantifies the task-specific value of each data sample. Specifically, the importance, or value, of each data sample is characterized by the reduction in task-specific loss achieved by observing that sample. Using this metric, we formulate a cross-layer optimization problem that jointly optimizes (i) physical-layer joint source-channel coding (JSCC) and (ii) MAC-layer resource allocation, with the objective of maximizing semantic spectrum efficiency, defined as the data value delivered per unit bandwidth per unit time. At the physical layer, we develop the Meta-Learning Variational Information Bottleneck (Meta-VIB), a semantic communication transceiver that uses a compact neural network model with only 4.16 million parameters to generalize across varying signal-to-noise ratio (SNR), codelength, and Age of Information (AoI) values without requiring online retraining. At the MAC layer, we formulate channel allocation as a Multi-Action Restless Multi-Armed Bandit (MA-RMAB) problem and develop the Q-Maximization algorithm for dynamic channel resource allocation among sensors. Experimental results on a real-world pedestrian safety dataset collected at Toomer’s Corner in Auburn, Alabama, demonstrate that the proposed cross-layer design achieves substantial gains in semantic spectrum efficiency over baseline methods. We will also introduce SafeStep (https://safestep.eng.auburn.edu), a live, browser-based interactive platform for demonstrating semantic communication in pedestrian safety monitoring.

Additional Information:

BIOGRAPHY

Yin Sun is the Bryghte D. and Patricia M. Godbold Endowed Associate Professor in the Department of Electrical and Computer Engineering at Auburn University, Alabama. He received his B.Eng. and Ph.D. degrees in Electronic Engineering from Tsinghua University in 2006 and 2011, respectively. From 2011 to 2017, he was a Postdoctoral Scholar and Research Associate at The Ohio State University. He joined Auburn University as an Assistant Professor in 2017 and was promoted to Associate Professor in 2023. His research interests include Age and Semantics of Information, wireless networks, AI for 6G wireless systems, agriculture, education, and robotics. Dr. Sun has served on the editorial boards of the IEEE/ACM Transactions on NetworkingIEEE Transactions on Information TheoryIEEE Transactions on Network Science and EngineeringIEEE Transactions on Green Communications and Networking, and the Journal of Communications and Networks. He has also served on the organizing committees of numerous international conferences, including as Technical Program Committee Chair for ACM MobiHoc 2025 and General Chair for IEEE/IFIP WiOpt 2026. He founded the Age and Semantics of Information (ASoI) Workshop in 2018 and the Modeling and Optimization in Semantic Communications (MOSC) Workshop in 2023. His publications have received multiple recognitions, including the Best Student Paper Award at IEEE/IFIP WiOpt 2013, the Best Paper Award at IEEE/IFIP WiOpt 2019, runner-up for the Best Paper Award at ACM MobiHoc 2020, the Best Paper Award from the Journal of Communications and Networks in 2021, the IEEE Communications Society William R. Bennett Prize in 2025, and the IEEE INFOCOM 2026 Test-of-Time Paper Award. He received the Auburn Author Award in 2020 and the National Science Foundation (NSF) CAREER Award in 2023.

Details...

Sep 18

Expanding the Analog Mandate: What It Can Compute and What It Can Conceal

108 Chambers Building
1:25 – 2:35 p.m.

Details...

Sep 23

How Safe Is Safe Enough? Ensuring Safety and Resilience in Critical Infrastructure Control Systems

254 Health and Human Development
3:35-4:25 pm

Details...

Sep 25

What Is AI, What Is Ethics, and What Is AI Ethics? A Hands-On Scoping Review for Aspiring Engineers

108 Chambers Building
1:25 – 2:35 p.m.

Details...

Sep 30

Scaling Photonic Computing Across Device, Architecture, and System Levels

254 Health and Human Development
3:35-4:25 pm

Details...

Oct 02

Field- and Carrier-facilitated Nonlinear Optical Phenomena in Nanophotonics

108 Chambers Building
1:25 – 2:35 p.m.

Details...

Oct 07

Breaking the Memory Wall with Optical Interconnects and In-Memory Computing

254 Health and Human Development
3:35-4:25 pm

Additional Information:

BIO: Ning Li is an associate professor in the Department of Electrical Engineering and Materials Research Institute at The Pennsylvania State University. He was a research staff member at IBM T.J. Watson Research Center from 2010 to 2022. His research experience includes photonic components and links for communications and interconnects, heterogeneous integration of materials and devices for new applications, nonvolatile memories for in-memory computing. He was awarded more than 250 U.S. patents, many High Value Patent Awards, and multiple Master Inventor Awards. He published in scientific journals and conferences including Nature Photonics, Nature Communications, Advanced Materials, Optical Fiber Communication (OFC), etc. His work has been featured on Nature Research Highlight, Semiconductor Today, etc. He received his BS degree from Tsinghua University and PhD degree from The University of Texas at Austin.

Details...

Oct 14

Modern Applications of Quantitative Ultrasound for Medical Research

254 Health and Human Development
3:35-4:25 pm

Details...

Oct 21

Ferroelectric Polymers and Composites with High Piezoelectricity

3:35 - 4:25 p.m.
254 Health and Human Development Building

Details...

Nov 04

Ultrasonic Imaging to Reveal the Physics of Earthquake Precursors

254 Health and Human Development
3:35-4:25 pm

Details...

Dec 02

Manipulating defect structure and behavior through segregation-induced complexion transitions

254 Health and Human Development
3:35-4:25 pm

Details...

Button for all College of Engineering events link
 
 

About

The School of Electrical Engineering and Computer Science was created in the spring of 2015 to allow greater access to courses offered by both departments for undergraduate and graduate students in exciting collaborative research fields.

We offer B.S. degrees in electrical engineering, computer science, computer engineering and data science and graduate degrees (master's degrees and Ph.D.'s) in electrical engineering and computer science and engineering. EECS focuses on the convergence of technologies and disciplines to meet today’s industrial demands.

School of Electrical Engineering and Computer Science

The Pennsylvania State University

207 Electrical Engineering West

University Park, PA 16802

814-863-6740

Department of Computer Science and Engineering

814-865-9505

Department of Electrical Engineering

814-865-7039