Open Access. Powered by Scholars. Published by Universities.®

Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Portland State University

2011

Physical Sciences and Mathematics

Keyword
Publication
Publication Type

Articles 1 - 16 of 16

Full-Text Articles in Engineering

Thirdhand Tobacco Smoke: Emerging Evidence And Arguments For A Multidisciplinary Research Agenda, Georg E. Matt, Penelope J. Quintana, Hugo Destaillats, Lara A. Gundel, Mohamad Sleiman, Brett C. Singer, Peyton Jacob, Jonathan P. Winickoff, Prue Talbot, Suzaynn Schick, Yinsheng Wang, Bo Hang, Manuela Martins-Green, James F. Pankow, Melbourne F. Hovell, Neal L. Benowitz, Virender K. Rehan, Jonathan M. Samet Sep 2011

Thirdhand Tobacco Smoke: Emerging Evidence And Arguments For A Multidisciplinary Research Agenda, Georg E. Matt, Penelope J. Quintana, Hugo Destaillats, Lara A. Gundel, Mohamad Sleiman, Brett C. Singer, Peyton Jacob, Jonathan P. Winickoff, Prue Talbot, Suzaynn Schick, Yinsheng Wang, Bo Hang, Manuela Martins-Green, James F. Pankow, Melbourne F. Hovell, Neal L. Benowitz, Virender K. Rehan, Jonathan M. Samet

Civil and Environmental Engineering Faculty Publications and Presentations

There is broad consensus regarding the health impact of tobacco use and secondhand smoke exposure, yet considerable ambiguity exists about the nature and consequences of thirdhand smoke (THS). We introduce definitions of THS and THS exposure and review recent findings about constituents, indoor sorption-desorption dynamics, and transformations of THS; distribution and persistence of THS in residential settings; implications for pathways of exposure; potential clinical significance and health effects; and behavioral and policy issues that affect and are affected by THS. Physical and chemical transformations of tobacco smoke pollutants take place over time scales ranging from seconds to months and include …


Determination Of The Electric Field Intensity And Space Charge Density Versus Height Prior To Triggered Lightning, Christopher J. Biagi, Martin A. Uman, Jay Gopalakrishnan, J. D. Hill, Vladimir A. Rakov, T. Ngin, Douglas M. Jordan Aug 2011

Determination Of The Electric Field Intensity And Space Charge Density Versus Height Prior To Triggered Lightning, Christopher J. Biagi, Martin A. Uman, Jay Gopalakrishnan, J. D. Hill, Vladimir A. Rakov, T. Ngin, Douglas M. Jordan

Mathematics and Statistics Faculty Publications and Presentations

We infer the vertical profiles of space charge density and electric field intensity above ground by comparing modeling and measurements of the ground-level electric field changes caused by elevating grounded lightning-triggering wires. The ground-level electric fields at distances of 60 m and 350 m were measured during six wire launches that resulted in triggered lightning. The wires were launched when ground-level electric fields ranged from 3.2 to 7.6 kV m−1 and the triggering heights ranged from 123 to 304 m. From wire launch time to lightning initiation time, the ground-level electric field reduction at 60 m ranged from 2.2 …


Interview With Adam Boesel, Green Micro Gym, 2011 (Audio), Adam Boesel Jul 2011

Interview With Adam Boesel, Green Micro Gym, 2011 (Audio), Adam Boesel

All Sustainability History Project Oral Histories

Interview of Adam Boesel by Teresa Celestine at Green Micro Gym Portland, Oregon on July 29th, 2011.

The interview index is available for download.


Resizable, Scalable, Concurrent Hash Tables, Josh Triplett, Paul E. Mckenney, Jonathan Walpole Jun 2011

Resizable, Scalable, Concurrent Hash Tables, Josh Triplett, Paul E. Mckenney, Jonathan Walpole

Computer Science Faculty Publications and Presentations

We present algorithms for shrinking and expanding a hash table while allowing concurrent, wait-free, linearly scalable lookups. These resize algorithms allow the hash table to maintain constant-time performance as the number of entries grows, and reclaim memory as the number of entries decreases, without delaying or disrupting readers.

We implemented our algorithms in the Linux kernel, to test their performance and scalability. Benchmarks show lookup scalability improved 125x over readerwriter locking, and 56% over the current state-of-the-art for Linux, with no performance degradation for lookups during a resize.

To achieve this performance, this hash table implementation uses a new concurrent …


Resizable, Scalable, Concurrent Hash Tables Via Relativistic Programming, Josh Triplett, Paul E. Mckenney, Jonathan Walpole Jun 2011

Resizable, Scalable, Concurrent Hash Tables Via Relativistic Programming, Josh Triplett, Paul E. Mckenney, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Presentation focusing on software synchronization, thread locking, transactional memory, and relativistic programming. Hash table algorithms are presented with examples of relativistic list insertion and removal, and related data structures. Existing approaches are compared to new methodologies and future work with relativistic data structures.


Systems Ideas For The Scientific And Societal Imperatives Of The Coastal Ocean: Case Of The Bp Oil Gusher In The Gulf Of Mexico, Spring & Summer 2010, Christopher Mooers May 2011

Systems Ideas For The Scientific And Societal Imperatives Of The Coastal Ocean: Case Of The Bp Oil Gusher In The Gulf Of Mexico, Spring & Summer 2010, Christopher Mooers

Systems Science Friday Noon Seminar Series

In recent decades, great progress has been made in advancing the scientific understanding of the coastal ocean (i.e., the 200 nautical mile Exclusive Economic Zone (EEZ)) across a broad set of disciplines. Simultaneously, the societal use of the coastal ocean has skyrocketed through, for example, increased shipping & boating, sports & commercial fishing, and exploitation of non-living resources, such as, oil & gas extraction and sand & gravel mining. International law and national policy assign coastal nations the responsibility for stewardship (i.e., wise management) of their respective EEZs. The scope of the stewardship and applications can be summarized as (1) …


A Relativistic Enhancement To Software Transactional Memory, Philip William Howard, Jonathan Walpole May 2011

A Relativistic Enhancement To Software Transactional Memory, Philip William Howard, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Relativistic Programming is a technique that allows low overhead, linearly-scalable concurrent reads. It also allows joint access parallelism between readers and a writer. Unfortunately, it has so far been limited to a single writer so it does not scale on the write side. Software Transactional Memory (STM) is a technique that allows programs to take advantage of disjoint access parallelism on both the read-side and write-side. Unfortunately, STM systems have a higher overhead than many other synchronization mechanisms so although STM scales, STM starts from a lower baseline. We propose combining relativistic programming and software transactional memory in a way …


Research On Coupled Human And Natural Systems (Chans): Approach, Challenges, And Strategies, Marina Alberti, Heidi Asbjornsen, Lawrence A. Baker, Nicholas Brozović, Laurie E. Drinkwater, Scott A. Drzyzga, Claire A. Jantz, José Fragoso, Daniel S. Holland, Timothy A. Kohler, Jianguo Liu, William J. Mcconnell, Herbert D. G. Maschner, James D. A. Millington, Michael Monticino, Guillermo Podestá, Robert Gilmore Pontius Jr., Charles L. Redman, Nicholas J. Reo, David J. Sailor, Gerald Urquhart Apr 2011

Research On Coupled Human And Natural Systems (Chans): Approach, Challenges, And Strategies, Marina Alberti, Heidi Asbjornsen, Lawrence A. Baker, Nicholas Brozović, Laurie E. Drinkwater, Scott A. Drzyzga, Claire A. Jantz, José Fragoso, Daniel S. Holland, Timothy A. Kohler, Jianguo Liu, William J. Mcconnell, Herbert D. G. Maschner, James D. A. Millington, Michael Monticino, Guillermo Podestá, Robert Gilmore Pontius Jr., Charles L. Redman, Nicholas J. Reo, David J. Sailor, Gerald Urquhart

Mechanical and Materials Engineering Faculty Publications and Presentations

Understanding the complexity of human–nature interactions is central to the quest for both human well-being and global sustainability. To build an understanding of these interactions, scientists, planners, resource managers, policy makers, and communities increasingly are collaborating across wide-ranging disciplines and knowledge domains. Scientists and others are generating new integrated knowledge on top of their requisite specialized knowledge to understand complex systems in order to solve pressing environmental and social problems (e.g., Carpenter et al. 2009). One approach to this sort of integration, bringing together detailed knowledge of various disciplines (e.g., social, economic, biological, and geophysical), has become known as the …


Generalized Construction Of Scalable Concurrent Data Structures Via Relativistic Programming, Josh Triplett, Paul E. Mckenney, Philip W. Howard, Jonathan Walpole Mar 2011

Generalized Construction Of Scalable Concurrent Data Structures Via Relativistic Programming, Josh Triplett, Paul E. Mckenney, Philip W. Howard, Jonathan Walpole

Computer Science Faculty Publications and Presentations

We present relativistic programming, a concurrent programming model based on shared addressing, which supports efficient, scalable operation on either uniform shared-memory or distributed shared- memory systems. Relativistic programming provides a strong causal ordering property, allowing a series of read operations to appear as an atomic transaction that occurs entirely between two ordered write operations. This preserves the simple immutable-memory programming model available via mutual exclusion or transactional memory. Furthermore, relativistic programming provides joint-access parallelism, allowing readers to run concurrently with a writer on the same data. We demonstrate a generalized construction technique for concurrent data structures based on relativistic programming, …


Scalable Correct Memory Ordering Via Relativistic Programming, Josh Triplett, Philip William Howard, Paul E. Mckenney, Jonathan Walpole Mar 2011

Scalable Correct Memory Ordering Via Relativistic Programming, Josh Triplett, Philip William Howard, Paul E. Mckenney, Jonathan Walpole

Computer Science Faculty Publications and Presentations

We propose and document a new concurrent programming model, relativistic programming. This model allows readers to run concurrently with writers, without blocking or using expensive synchronization. Relativistic programming builds on existing synchronization primitives that allow writers to wait for current readers to finish with minimal reader overhead. Our methodology models data structures as graphs, and reader algorithms as traversals of these graphs; from this foundation we show how writers can implement arbitrarily strong ordering guarantees for the visibility of their writes, up to and including total ordering.


Polynomial Extension Operators. Part Iii, Leszek Demkowicz, Jay Gopalakrishnan, Joachim Schöberl Jan 2011

Polynomial Extension Operators. Part Iii, Leszek Demkowicz, Jay Gopalakrishnan, Joachim Schöberl

Mathematics and Statistics Faculty Publications and Presentations

In this concluding part of a series of papers on tetrahedral polynomial extension operators, the existence of a polynomial extension operator in the Sobolev space H(div) is proven constructively. Specifically, on any tetrahedron K, given a function w on the boundary ∂K that is a polynomial on each face, the extension operator applied to w gives a vector function whose components are polynomials of at most the same degree in the tetrahedron. The vector function is an extension in the sense that the trace of its normal component on the boundary ∂K coincides with w. Furthermore, the extension operator is …


Floorplan Design And Yield Enhancement Of 3-D Integrated Circuits, Rajeev Kumar Nain Jan 2011

Floorplan Design And Yield Enhancement Of 3-D Integrated Circuits, Rajeev Kumar Nain

Dissertations and Theses

We have developed a placement-aware 3-D floorplanning algorithm that enables additional wirelength reduction by planning for 3-D placement of logic gates in selected circuit modules during the floorplanning stage. Thus it also bridges the existing gap between 3-D floorplanning and 3-D placement. To reduce the solution space of 3-D floorplanning which is known to be an NP-hard problem, we derive a set of feasibility conditions on the topological representation of a floorplan. In addition, we have designed a fast module packing algorithm that satisfies a set of constraints for placement-aware 3-D floorplanning. Furthermore, we have designed an efficient evolutionary algorithm …


The Integrated Wrf/Urban Modeling System: Development, Evaluation, And Applications To Urban Environmental Problems, Fei Chen, Hiroyuki Kusaka, Robert Bornstein, Jason Ching, C.S.B. Grimmond, Susanne Grossman-Clarke, Thomas Loridan, Kevin W. Manning, Alberto Martilli, Shiguang Miao, David J. Sailor, Francisco P. Salamanca, Haider Taha, Mukul Tewari, Xuemei Wang, Andrzej A. Wyszogrodzki, Chaolin Zhang Jan 2011

The Integrated Wrf/Urban Modeling System: Development, Evaluation, And Applications To Urban Environmental Problems, Fei Chen, Hiroyuki Kusaka, Robert Bornstein, Jason Ching, C.S.B. Grimmond, Susanne Grossman-Clarke, Thomas Loridan, Kevin W. Manning, Alberto Martilli, Shiguang Miao, David J. Sailor, Francisco P. Salamanca, Haider Taha, Mukul Tewari, Xuemei Wang, Andrzej A. Wyszogrodzki, Chaolin Zhang

Mechanical and Materials Engineering Faculty Publications and Presentations

To bridge the gaps between traditional mesoscale modeling and microscale modeling, the National Center for Atmospheric Research (NCAR), in collaboration with other agencies and research groups, has developed an integrated urban modeling system coupled to the Weather Research and Forecasting (WRF) model as a community tool to address urban environmental issues. The core of this WRF/urban modeling system consists of: 1) three methods with different degrees of freedom to parameterize urban surface processes, ranging from a simple bulk parameterization to a sophisticated multi-layer urban canopy model with an indoor outdoor exchange sub-model that directly interacts with the atmospheric boundary layer, …


Crystallite Phase And Orientation Determinations Of (Mn, Ga) As/Gaas-Crystallites Using Analyzed (Precession) Electron Diffraction Patterns, Ines Häusler, Stavros Nicolopoulos, Edgar F. Rauch, K. Volz, Peter Moeck Jan 2011

Crystallite Phase And Orientation Determinations Of (Mn, Ga) As/Gaas-Crystallites Using Analyzed (Precession) Electron Diffraction Patterns, Ines Häusler, Stavros Nicolopoulos, Edgar F. Rauch, K. Volz, Peter Moeck

Physics Faculty Publications and Presentations

Outline of the presentation:

1. Material system: (Mn,Ga)As/GaAs-crystallites

2. Structure analysis using Nano-beam Diffraction (NBD) Precession Electron Diffraction Technique (PED) --> Structure type I + II

3. Phase and orientation mapping using ASTAR

4. Conclusion


Relativistic Red-Black Trees, Philip William Howard, Jonathan Walpole Jan 2011

Relativistic Red-Black Trees, Philip William Howard, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Operating system performance and scalability on sharedmemory many-core systems depends critically on efficient access to shared data structures. Scalability has proven difficult to achieve for many data structures. In this paper we present a novel and highly scalable concurrent red-black tree. Red-black trees are widely used in operating systems, but typically exhibit poor scalability. Our red-black tree has linear read scalability, uncontended read performance that is at least 25% faster than other known approaches, and deterministic lookup times for a given tree size, making it suitable for realtime applications.


The Ordering Requirements Of Relativistic And Reader-Writer Locking Approaches To Shared Data Access, Philip William Howard, Josh Triplett, Jonathan Walpole, Paul E. Mckenney Jan 2011

The Ordering Requirements Of Relativistic And Reader-Writer Locking Approaches To Shared Data Access, Philip William Howard, Josh Triplett, Jonathan Walpole, Paul E. Mckenney

Computer Science Faculty Publications and Presentations

The semantics of reader-writer locks allow read-side concurrency. Unfortunately, the locking primitives serialize access to the lock variable to an extent that little or no concurrency is realized in practice for small critical sections. Relativistic programming is a methodology that also allows read- side concurrency. Relativistic programming uses dfferent ordering constraints than reader-writer locking. The different ordering constraints allow relativistic readers to proceed without synchronization so relativistic readers scale even for very short critical sections. In this paper we explore the diferences between the ordering constraints for reader-writer locking and relativistic programs. We show how and why the dfferent ordering …