Being an IEEE Member has its perks - networking, technology, conferences, the list goes on. What about the Other benefits to being an IEEE Member? As part of this lunch webinar, learn about the different programs you can take advantage of with your IEEE membership! This webinar will be presented by: Emily Surratt Associate Manager Member Group Insurance Programs, Finance and Administration Virtual: https://events.vtools.ieee.org/m/371005

The IEEE Vehicular Technology Society (VTS) Philadelphia Chapter is holding a technical meeting. The topic is DC Traction Power Systems Design. Our speaker is Fernando Soares, Traction Power North America Sales Lead, with Powell Industries. This presentation discusses the different elements, applicable standards, and common industry practices used in dc traction power substation design. The objective of this presentation is to provide designers and specifiers with helpful and technical knowledge on traction power substation equipment as well as recommendations for developing project requirements. Attendees may apply for 1.0 PDH provided through the IEEE Certificates Program, accepted in all states. Send $5.00 (USD) payment to Brandon Swartley via Zelle at [email protected] and complete the online evaluation at https://r2.ieee.org/philadelphia-vts/forms/. Evaluation form must be completed and payment received within one week to receive PDH certificate. Speaker(s): Fernando Soares Agenda: Introduction Technical presentation - Most Common North American DC Rail Systems and Categories - LRT DC Traction Power Distribution Network Overview - Introduction to a DC Traction Power Substation - DC Traction Substation Grounding Practices - Medium Voltage Switchgear - Transformer Rectifier Units - DC Switchgear - DC Disconnect Switches - Negative Grounding Devices - Substation Automation System - Power Control Rooms/Prefabricated Buildings Questions Virtual: https://events.vtools.ieee.org/m/372462

The development of IEEE Technology Roadmaps bring together a bevy of international experts to chart out a mapping of continued evolution and predictions of the underlying basic technologies. In this talk the speaker, Rakesh Kumar, will show examples of the evolution of silicon, wide bandgap semiconductor, heterogeneous integration technologies and Next generation Networking Technologies and will illustrate how they provide the groundwork for making these humanitarian solutions possible. He will provide select examples of some exciting solutions using Wireless and Compute technologies, IoT, AI/ML and similar capabilities to create solutions in spaces such as Agriculture, Healthcare, Smart Lighting and Power Generation and Distribution, and many others. Technology innovations are the enablers as we develop humanitarian solutions. Speaker(s): Rakesh Kumar, Room: Meeting Room, Bldg: Patrick Henry Library, 101 Maple Ave E, Vienna, Virginia, United States, Virtual: https://events.vtools.ieee.org/m/369368

Identifying shortest paths between nodes in a network is a common graph analysis problem that is important for many applications involving routing of resources. An adversary that can manipulate the graph structure could alter traffic patterns to gain some benefit (e.g., make more money by directing traffic to a toll road). This presentation considers a recently published attack in which an adversary removes edges from a graph to make a particular path the shortest between its terminal nodes. We develop a defense against such attacks by modifying the weights of the graph that users observe. The defender must balance inhibiting the attacker against any negative effects of the defense on benign users. Specifically, the defender's goals are: (a) to recommend the shortest paths possible to users, (b) for the lengths of the shortest paths in the published graph to be close to those of the same paths in the true graph, and (c) to minimize the probability of an attack. We formulate the defense as a Stackelberg game in which the defender is the leader and the attacker is the follower. In this context, we also consider a zero-sum version of the game, in which the defender's goal is to minimize cost while achieving the minimum possible attack probability. We show that this problem is NP-hard and propose heuristic solutions based on increasing edge weights along target paths in both the zero-sum and non-zero-sum settings. We present defense results with both synthetic and real network datasets and show that these methods often reach the lower bound of the defender's cost. Speaker(s): Dr. Benjamin Miller, Virtual: https://events.vtools.ieee.org/m/374165