The School of Engineering and Applied Science, established in 1852, is composed of six academic departments and numerous interdisciplinary centers, institutes, and laboratories. At Penn Engineering, we are preparing the next generation of innovative engineers, entrepreneurs and leaders. Our unique culture of cooperation and teamwork, emphasis on research, and dedicated faculty advisors who teach as well as mentor, provide the ideal environment for the intellectual growth and development of well-rounded global citizens.
- Department of Bioengineering
- Department of Chemical & Biomolecular Engineering
- Department of Computer & Information Science
- Department of Electrical & Systems Engineering
- Department of Materials Science & Engineering
- Department of Mechanical Engineering & Applied Mechanics
- Energy Research Group
- Engineering Documents
- General Robotics, Automation, Sensing and Perception Laboratory
- Institute for Medicine and Engineering
- Laboratory for Research on the Structure of Matter
PublicationEnforcing Robust Declassification(2004-06-28) Myers, Andrew C; Sabelfeld, Andrei; Zdancewic, Stephan A.Noninterference requires that there is no information flow from sensitive to public data in a given system. However, many systems perform intentional release of sensitive information as part of their correct functioning and therefore violate noninterference. To control information flow while permitting intentional information release, some systems have a downgrading or declassification mechanism. A major danger of such a mechanism is that it may cause unintentional information release. This paper shows that a robustness property can be used to characterize programs in which declassification mechanisms cannot be exploited by attackers to release more information than intended. It describes a simple way to provably enforce this robustness property through a type-based compile-time program analysis. The paper also presents a generalization of robustness that supports upgrading (endorsing) data integrity. PublicationSingle-walled carbon nanotubes in superacid: X-ray and calorimetric evidence for partly ordered H2SO4(2005-07-01) Zhou, Wei; Fischer, John E; Heiney, P. A; Fan, H.; Davis, Virginia A; Pasquali, M.; Smalley, Richard ELiquid anhydrous sulfuric acid forms a partly ordered structure in the presence of single-walled carbon nanotubes (SWNTs). X-ray scattering from aligned fibers immersed in acid shows the formation of molecular shells wrapped around SWNTs. Differential scanning calorimetry of SWNT-acid suspensions exhibits concentration-dependent supercooling/melting behavior, confirming that the partly ordered molecules are a new phase. We propose that charge transfer between nanotube π electrons and highly oxidizing superacid is responsible for the unique partly ordered structure. PublicationAuthoring Multi-Actor Behaviors in Crowds With Diverse Personalities(2013-01-01) Kapadia, Mubbasir; Shoulson, Alexander; Durupinar, Funda; Badler, Norman IMulti-actor simulation is critical to cinematic content creation, disaster and security simulation, and interactive entertainment. A key challenge is providing an appropriate interface for authoring high-fidelity virtual actors with featurerich control mechanisms capable of complex interactions with the environment and other actors. In this chapter, we present work that addresses the problem of behavior authoring at three levels: Individual and group interactions are conducted in an event-centric manner using parameterized behavior trees, social crowd dynamics are captured using the OCEAN personality model, and a centralized automated planner is used to enforce global narrative constraints on the scale of the entire simulation. We demonstrate the benefits and limitations of each of these approaches and propose the need for a single unifying construct capable of authoring functional, purposeful, autonomous actors which conform to a global narrative in an interactive simulation. PublicationA Reasoning Framework for Autonomous Urban Driving(2008-06-04) Ferguson, Dave; Baker, Christopher; Likhachev, Maxim; Dolan, JohnUrban driving is a demanding task for autonomous vehicles as it requires the development and integration of several challenging capabilities, including high-level route planning, interaction with other vehicles, complex maneuvers, and ultra-reliability. In this paper, we present a reasoning framework for an autonomous vehicle navigating through urban environments. Our approach combines route-level planning, context-sensitive local decision making, and sophisticated motion planning to produce safe, intelligent actions for the vehicle. We provide examples from an implementation on an autonomous passenger vehicle that has driven over 3000 autonomous kilometers and competed in, and won, the Urban Challenge. PublicationPhotoacoustic effect for multiply scattered light(2007-09-25) Fisher, Andrew R; Schissler, Andrew J; Schotland, John CWe consider the photoacoustic effect for multiply scattered light in a random medium. Within the accuracy of the diffusion approximation to the radiative transport equation, we present a general analysis of the sensitivity of a photoacoustic wave to the presence of one or more small absorbing objects. Applications to tumor detection by photoacoustic imaging are suggested. PublicationQuantifying the Gap Between Embedded Control Models and Time-Triggered Implementations(2005-12-08) Yazarel, Hakan; Girard, Antoine; Pappas, George J.; Alur, RajeevMapping a set of feedback control components to executable code introduces errors due to a variety of factors such as discretization, computational delays, and scheduling policies. We argue that the gap between the model and the implementation can be rigorously quantified leading to predictability if the implementation is viewed as a sequence of control blocks executed in statically allocated time slots on a time-triggered platform. For linear systems controlled by linear controllers, we show how to calculate the exact error between the model-level semantics and the execution semantics of an implementation, allowing us to compare different implementations. The calculated error of different implementations is demonstrated using simulations on illustrative examples. PublicationStructure and properties of C60@SWNT(2001-11-26) Smith, Brian W; Russo, Richard M; Chikkannanavar, Satishkumar B; Stercel, Ferenc; Luzzi, David EOur recent achievement of high-yield C60@SWNT synthesis facilitates characterization by various techniques, including selected area electron diffraction (SAD) and Raman spectroscopy. The obtained SAD patterns show that interior C60 molecules sit on a simple 1-D lattice having a parameter of 1.00 nm. Simulated SAD patterns and real-space measurements both support this determination and do not indicate a lattice with a more complex basis, e.g. a dimer basis. Empty and bulk-filled SWNTs (22%, 56%, and 90% yields), each subjected to identical processing steps, were examined by room temperature Raman spectroscopy. Systematic differences are seen between the spectra of filled and unfilled SWNTs, particularly with respect to the G- and RBM-bands of the nanotubes. We present a possible explanation for this behavior. PublicationNGL/LPG Extraction from Marcellus Shale Gas(2015-05-04) Champagne, Jocelyn; Ordonez, Freddy; Zhang, ZhiyiThis process describes a design in which 6 million metric tons per annum of Marcellus Shale Gas is separated into its components through heat exchangers, pressure drops, and, finally, flowing through distillation columns. The goal was essentially to remove all of the methane gas as the overhead product of the heavy removal column and use the subsequent columns to fraction off heavier hydrocarbons. Heat exchangers could not remove sufficient heat from the feed prior to entering the columns and as a result, the overhead product for the heavy removal column consists of 84% by mole of methane and 15% by mole of ethane. Essentially all of the methane is being removed with the overhead product of the HRC but 85% of ethane is being removed here as well. By selling the major product (ethane) and the byproducts (propane and butane), our process design solution yields a net present value of $166.0 million, with an internal rate of return of 32.3%. The high profitability is secured in a sensitivity analysis on the ethane selling price, the total permanent investment, and the total fixed cost. PublicationTopological conditions for in-network stabilization of dynamical systems(2013-04-01) Pajic, Miroslav; Sundaram, Shreyas; Mangharam, Rahul; Pappas, GeorgeWe study the problem of stabilizing a linear system over a wireless network using a simple in-network computation method. Specifically, we study an architecture called the "Wireless Control Network'' (WCN), where each wireless node maintains a state, and periodically updates it as a linear combination of neighboring plant outputs and node states. This architecture has previously been shown to have low computational overhead and beneficial scheduling and compositionality properties. In this paper we characterize fundamental topological conditions to allow stabilization using such a scheme. To achieve this, we exploit the fact that the WCN scheme causes the network to act as a linear dynamical system, and analyze the coupling between the plant's dynamics and the dynamics of the network. We show that stabilizing control inputs can be computed in-network if the vertex connectivity of the network is larger than the geometric multiplicity of any unstable eigenvalue of the plant. This condition is analogous to the typical min-cut condition required in classical information dissemination problems. Furthermore, we specify equivalent topological conditions for stabilization over a wired (or point-to-point) network that employs network coding in a traditional way -- as a communication mechanism between the plant's sensors and decentralized controllers at the actuators. PublicationA Bisimulation for Type Abstraction and Recursion(2005-01-12) Sumii, Eijiro; Pierce, Benjamin CWe present a sound, complete, and elementary proof method, based on bisimulation, for contextual equivalence in a λ-calculus with full universal, existential, and recursive types. Unlike logical relations (either semantic or syntactic), our development is elementary, using only sets and relations and avoiding advanced machinery such as domain theory, admissibility, and TT-closure. Unlike other bisimulations, ours is complete even for existential types. The key idea is to consider sets of relations—instead of just relations—as bisimulations.