Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “allocation”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 739 records · Page 41

Block-structured, equal-workload, multi-grid-nesting interface for the Boussinesq wave model FUNWAVE-TVD (Total Variation Diminishing)

Abstract. We describe the development of a block-structured, equal-CPU-load (central processing unit), multi-grid-nesting interface for the Boussinesq wave model FUNWAVE-TVD (Fully Nonlinear Boussinesq Wave Model with Total Variation Diminishing Solver). The new model framework does not interfere with the core solver, and thus the core program, FUNWAVE-TVD, is still a standalone model used for a single grid. The nesting interface manages the time sequencing and two-way nesting processes between the parent grid and child grid with grid refinement in a hierarchical manner. Workload balance in the MPI-based (message passing interface) parallelization is handled by an equal-load scheme. A strategy of shared array allocation is applied for data management that allows for a large number of nested grids without creating additional memory allocations. Four model tests are conducted to verify the nesting algorithm with assessments of model accuracy and the robustness in the application in modeling transoceanic tsunamis and coastal effects.

Choi, Young-Kwang↗

A comparison of eight optimization methods applied to a wind farm layout optimization problem

Abstract. Selecting a wind farm layout optimization method is difficult. Comparisons between optimization methods in different papers can be uncertain due to the difficulty of exactly reproducing the objective function. Comparisons by just a few authors in one paper can be uncertain if the authors do not have experience using each algorithm. In this work we provide an algorithm comparison for a wind farm layout optimization case study between eight optimization methods applied, or directed, by researchers who developed those algorithms or who had other experience using them. We provided the objective function to each researcher to avoid ambiguity about relative performance due to a difference in objective function. While these comparisons are not perfect, we try to treat each algorithm more fairly by having researchers with experience using each algorithm apply each algorithm and by having a common objective function provided for analysis. The case study is from the International Energy Association (IEA) Wind Task 37, based on the Borssele III and IV wind farms with 81 turbines. Of particular interest in this case study is the presence of disconnected boundary regions and concave boundary features. The optimization methods studied represent a wide range of approaches, including gradient-free, gradient-based, and hybrid methods; discrete and continuous problem formulations; single-run and multi-start approaches; and mathematical and heuristic algorithms. We provide descriptions and references (where applicable) for each optimization method, as well as lists of pros and cons, to help readers determine an appropriate method for their use case. All the optimization methods perform similarly, with optimized wake loss values between 15.48 % and 15.70 % as compared to 17.28 % for the unoptimized provided layout. Each of the layouts found were different, but all layouts exhibited similar characteristics. Strong similarities across all the layouts include tightly packing wind turbines along the outer borders, loosely spacing turbines in the internal regions, and allocating similar numbers of turbines to each discrete boundary region. The best layout by annual energy production (AEP) was found using a new sequential allocation method, discrete exploration-based optimization (DEBO). Based on the results in this study, it appears that using an optimization algorithm can significantly improve wind farm performance, but there are many optimization methods that can perform well on the wind farm layout optimization problem, given that they are applied correctly.

17 WIND ENERGY↗

Demeter – A Land Use and Land Cover Change Disaggregation Model

Demeter is an open source Python package that was built to disaggregate projections of future land allocations generated by an integrated assessment model (IAM). Projected land allocation from IAMs is traditionally transferred to Earth System Models (ESMs) in a variety of gridded formats and spatial resolutions as inputs for simulating biophysical and biogeochemical fluxes. Existing tools for performing this translation generally require a number of manual steps which introduces error and is inefficient. Demeter makes this process seamless and repeatable by providing gridded and land cover change (LULCC) products derived directly from an IAM—in this case, the Global Change Assessment Model (GCAM)—in a variety of formats and resolutions commonly used by ESMs. Demeter is publicly available via GitHub and has an extensible output module allowing for future ESM needs to be easily accommodated.

54 ENVIRONMENTAL SCIENCES↗

gcamland v1.0 – An R Package for Modelling Land Use and Land Cover Change

gcamland is an open source R package that was built to allocate land across a variety of types based on changes in agricultural yield and commodity price. The land allocation algorithm is based on the one included in the Global Change Assessment Model (GCAM). gcamland includes the ability to run in a historical mode, enabling model validation and parameter estimation, or in a future mode, simulating changes in land use/land cover in the future. For both modes, gcamland can run a single simulation or a large ensemble of simulations with different parameters. When ensembles are generated in the historical mode, gcamland calculates the likelihood of a given parameter set by comparing to observational data. gcamland is publicly available via GitHub and has can be adjusted to represent alternative scenarios or configured to different regions and land types.

97 MATHEMATICS AND COMPUTING↗

Fault Diagnosis of Hybrid Computing Systems Using Chaotic-Map Method

Computing systems are becoming increasingly complex with nodes consisting of a combination of multi-core central processing units (CPUs), many integrated core (MIC) and graphics processing unit (GPU) accelerators. These computing units and their interconnections are subject to different classes of hardware and software faults, which should be detected to support mitigation measures. We present the chaotic-map method that uses the exponential divergence and wide Fourier properties of the trajectories, combined with memory allocations and assignments to diagnose component-level faults in these hybrid computing systems. We propose lightweight codes that utilize highly parallel chaotic-map computations tailored to isolate faults in arithmetic units, memory elements and interconnects. The diagnosis module on a node utilizes pthreads to place chaotic-map threads on CPU and MIC cores, and CUDA C and OpenCL kernels on GPU blocks. We present experimental diagnosis results on five multi-core CPUs; one MIC; and, seven GPUs with typical diagnosis run-times under a minute.

Rao, Nageswara↗

High-resolution (30-m) urban land cover projections for Los Angeles California Urban Area: 2010 to 2100 under SSP5

These data represent simulations of future land use and land cover (LULCC) for Los Angeles urban area (U.S. Census Bureau defined area) as raster tiff images at a 30-m pixel resolution and at decadal time steps from 2010 to 2100. LULCC classes in this product follow the National Land Cover Dataset (NLCD) classification. NLCD 21-24 correspond to open developed, low developed, medium developed, and high developed urban land classes, respectively. Only urban land cover classes (NLCD class 21, 22, 23, and 24) are dynamic over time; however, all NLCD classes are included in the final product. Therefore, NLCD classes that do not convert to an urban class will be similar to year 2000. The products were developed using a hybridized statistical and cellular automata approach. Linear mixed models (LMMs) were used to estimate future urban land budgets based on 1-km urban land fraction projections from Gao and Pesaresi (2021), whereas separate generalized linear mixed models (GLMMs) were used to estimate shifts in urban land intensities based on retrospective shifts in NLCD urban class intensities over a 20- year period. Based on urban land allocations from the statistical models, a cellular-automata and downscaling routine was used to simulate dynamic urban land expansion at a 30-m resolution based on suitability criteria. Scenarios of future urban landcover change projections include variant solutions for the Shared Socioeconomic Pathway 5 (SSP5) based on different population assumptions, different land use intensification assumptions, variable land zoning constraints, and iterative adjustments to correct for over allocation of urban expansion across decadal time periods from 2010 to 2100. This results in 320 raster products.

Land↗

HarDWR - Harmonized Water Rights Records

For a detailed description of the database of which this record is only one part, please see the HarDWR meta-record. Here we present a new dataset of western U.S. water rights records. This dataset provides consistent unique identifiers for each spatial unit of water management across the domain, unique identifiers for each water right record, and a consistent categorization scheme that puts each water right record into one of 7 broad use categories. These data were instrumental in conducting a study of the multi-sector dynamics of intersectoral water allocation changes through water markets (Grogan et al., in review). Specifically, the data were formatted for use as input to a process-based hydrologic model, WBM, with a water rights module (Grogan et al., in review). While this specific study motivated the development of the database presented here, U.S. west water management is a rich area of study (e.g., Anderson and Woosly, 2005; Tidwell, 2014; Null and Prudencio, 2016; Carney et al, 2021) so releasing this database publicly with documentation and usage notes will enable other researchers to do further work on water management in the U.S. west. The raw downloaded data for each state is described in Lisk et al. (in review), as well as here. The dataset is a collection of objects stored within an RDate file, stateWaterRightsHarmonized.RData. Each object either describes how one should interact with the other objects, or contains the harmonized water rights data. Here is each object described in detail: states: A character vector containing the state names for those states in which data was collected for. More importantly, the index of the state name is also the index in which that state's data can be found in the various following list objects. For example, if California is the third index in this object, the data for California will also be in the third index for each accompanying list. rightsByState_ground: A list of data frames with the cleaned ground water rights collected from each state. The column headers for each data frame are: waterRightID - The unique identifying ID of the water right, the same identifier as its state uses. basinNum - The alpha-numeric identifier of the WMA the record belongs to. priorityDate - The priority date associated with the right. allocatedFlow - The maximum flow of the allocation in cubic feet per second (ft3s-1). source - Whether the right is for surface water or groundwater. origWaterUse - The original stated water use from the state. waterUse - The water use category under the unified use categories established here. rightsByState_surface: A list of the cleaned surface water rights collected from each state. See rightsByState_ground for more details on how the data is formatted. fullRightsRecs: A list of the combined groundwater and surface water records for each state. Essentially, these lists are the merging of rightsByState_ground and rightsByState_surface by state. See rightsByState_ground for more details on how the data is formatted. projProj: The spatial projection used for map creation in the beginning of the project. Specifically, the World Geodetic System (WGS84) as a coordinate reference system (CRS) string in PROJ.4 format. wmaStateLabel: The name and/or abbreviation for what each state legally calls their WMAs. h2oUseByState: A list of spatial polygon data frames which contain the area(s) in which each water right is claimed to be used. It should be noted that not all water right records have a listed area(s) of use in this object. Currently, only Idaho and Washington provided valid data to be included in this object. h2oDivByState: A list of spatial points data frames which identifies the location of the Point of Diversion for the state's water rights. It should be noted that not all water right records have a listed Point of Diversion in this object. spatialWMAByState: A list of spatial polygon data frames which contain the spatial WMA boundaries for each state. The only data contained within the table are identifiers for each polygon. It is worth reiterating that Arizona is the only state in which the surface and groundwater WMA boundaries are not the same. wmaIDByState: A list which contains the unique ID values of the WMAs for each state. plottingDim: A character vector used to inform mapping functions for internal map making. Each state is classified as either "tall" or "wide", to maximize space on a typical 8x11 page.

Economics↗

HarDWR - Harmonized Water Rights Records

For a detailed description of the database of which this record is only one part, please see the HarDWR meta-record. Here we present a new dataset of western U.S. water rights records. This dataset provides consistent unique identifiers for each spatial unit of water management across the domain, unique identifiers for each water right record, and a consistent categorization scheme that puts each water right record into one of 7 broad use categories. These data were instrumental in conducting a study of the multi-sector dynamics of intersectoral water allocation changes through water markets (Grogan et al., in review). Specifically, the data were formatted for use as input to a process-based hydrologic model, WBM, with a water rights module (Grogan et al., in review). While this specific study motivated the development of the database presented here, U.S. west water management is a rich area of study (e.g., Anderson and Woosly, 2005; Tidwell, 2014; Null and Prudencio, 2016; Carney et al, 2021) so releasing this database publicly with documentation and usage notes will enable other researchers to do further work on water management in the U.S. west. The raw downloaded data for each state is described in Lisk et al. (in review), as well as here. The dataset is a series of various files organized by state sub-directories. The first two characters of each file name is the abbreviation for the state the in which the file contains data for. After the abbreviation is the text which describes the contents of the file. Here is each file type described in detail: XXFullHarmonizedRights.csv: A file of the combined groundwater and surface water records for each state. Essentially, this file is the merging of XXGroundwaterHarmonizedRights.csv and XXSurfaceWaterHarmonizedRights.csv by state. The column headers for each of this type of file are: state - The name of the state the data comes from. FIPS - The two digit numeric state ID code. waterRightID - The unique identifying ID of the water right, the same identifier as its state uses. priorityDate - The priority date associated with the right. origWaterUse - The original stated water use from the state. waterUse - The water use category under the unified use categories established here. source - Whether the right is for surface water or groundwater. basinNum - The alpha-numeric identifier of the WMA the record belongs to. CFS - The maximum flow of the allocation in cubic feet per second (ft3s-1). Arizona is unique among the states, as its surface and groundwater resources are managed with two different sets of boundaries. So, for Arizona, the basinNum column is missing and instead there are two columns: surBasinNum - The alpha-numeric identifier of the surface water WMA the record belongs to. grdBasinNum - The alpha-numeric identifier of the groundwater WMA the record belongs to. XXStatePOD.shp: A shapefile which identifies the location of the Points of Diversion for the state's water rights. It should be noted that not all water right records in XXFullHarmonizedRights.csv have coordinates, and therefore may be missing from this file. XXStatePOU.shp: A shapefile which contains the area(s) in which each water right is claimed to be used. Currently, only Idaho and Washington provided valid data to included within this file. XXGroundwaterHarmonizedRights.csv: A file which contains only harmonized groundwater rights collected from each state. See XXFullHarmonizedRights.csv for more details on how the data is formatted. XXSurfaceWaterHarmonizedRights.csv: A file which contains only harmonized surface water rights collected from each state. See XXFullHarmonizedRights.csv for more details on how the data is formatted. Additionally, one file, stateWMALabels.csv, is not stored within a sub-directory. While we have referred to the spatial boundaries that each state uses to manage its water resources as WMAs, this term is not shared across all states. This file lists the proper name for each boundary set, by state.

Economics↗

HarDWR - Harmonized Water Rights Records

For a detailed description of the database of which this record is only one part, please see the HarDWR meta-record. Here we present a new dataset of western U.S. water rights records. This dataset provides consistent unique identifiers for each spatial unit of water management across the domain, unique identifiers for each water right record, and a consistent categorization scheme that puts each water right record into one of 7 broad use categories. These data were instrumental in conducting a study of the multi-sector dynamics of intersectoral water allocation changes through water markets (Grogan et al., in review). Specifically, the data were formatted for use as input to a process-based hydrologic model, WBM, with a water rights module (Grogan et al., in review). While this specific study motivated the development of the database presented here, U.S. west water management is a rich area of study (e.g., Anderson and Woosly, 2005; Tidwell, 2014; Null and Prudencio, 2016; Carney et al, 2021) so releasing this database publicly with documentation and usage notes will enable other researchers to do further work on water management in the U.S. west. The raw downloaded data for each state is described in Lisk et al. (in review), as well as here. The dataset is a series of various files organized by state sub-directories. The first two characters of each file name is the abbreviation for the state the in which the file contains data for. After the abbreviation is the text which describes the contents of the file. Here is each file type described in detail: XXFullHarmonizedRights.csv: A file of the combined groundwater and surface water records for each state. Essentially, this file is the merging of XXGroundwaterHarmonizedRights.csv and XXSurfaceWaterHarmonizedRights.csv by state. The column headers for each of this type of file are: state - The name of the state the data comes from. FIPS - The two-digit numeric state ID code. waterRightID - The unique identifying ID of the water right, the same identifier as its state uses. priorityDate - The priority date associated with the right. origWaterUse - The original stated water use(s) from the state. waterUse - The water use category under the unified use categories established here. source - Whether the right is for surface water or groundwater. basinNum - The alpha-numeric identifier of the WMA the record belongs to. CFS - The maximum flow of the allocation in cubic feet per second (ft3s-1). Arizona is unique among the states, as its surface and groundwater resources are managed with two different sets of boundaries. So, for Arizona, the basinNum column is missing and instead there are two columns: surBasinNum - The alpha-numeric identifier of the surface water WMA the record belongs to. grdBasinNum - The alpha-numeric identifier of the groundwater WMA the record belongs to. XXStatePOD.shp: A shapefile which identifies the location of the Points of Diversion for the state's water rights. It should be noted that not all water right records in XXFullHarmonizedRights.csv have coordinates, and therefore may be missing from this file. XXStatePOU.shp: A shapefile which contains the area(s) in which each water right is claimed to be used. Currently, only Idaho and Washington provided valid data to include within this file. XXGroundwaterHarmonizedRights.csv: A file which contains only harmonized groundwater rights collected from each state. See XXFullHarmonizedRights.csv for more details on how the data is formatted. XXSurfaceWaterHarmonizedRights.csv: A file which contains only harmonized surface water rights collected from each state. See XXFullHarmonizedRights.csv for more details on how the data is formatted. Additionally, one file, stateWMALabels.csv, is not stored within a sub-directory. While we have referred to the spatial boundaries that each state uses to manage its water resources as WMAs, this term is not shared across all states. This file lists the proper name for each boundary set, by state. For those whom may be interested in exploring our code more in depth, we are also making available an internal data file for convenience. The file is in .RData format and contains everything described above as well as some minor additional objects used within the code calculating the cumulative curves. For completeness, here is a detailed description of the various objects which can be found within the .RData file: states: A character vector containing the state names for those states in which data was collected for. More importantly, the index of the state name is also the index in which that state's data can be found in the various following list objects. For example, if California is the third index in this object, the data for California will also be in the third index for each accompanying list. rightsByState_ground: A list of data frames with the cleaned ground water rights collected from each state. This object holds the the data that is exported to created the xxGroundwaterHarmonizedRights.csv files. rightsByState_surface: A list of data frames with the cleaned surface water rights collected from each state. This object holds the the data that is exported to created the xxSurfaceWaterHarmonizedRights.csv files. fullRightsRecs: A list of the combined groundwater and surface water records for each state. This object holds the the data that is exported to created the xxFullHarmonizedRights.csv files. projProj: The spatial projection used for map creation in the beginning of the project. Specifically, the World Geodetic System (WGS84) as a coordinate reference system (CRS) string in PROJ.4 format. wmaStateLabel: The name and/or abbreviation for what each state legally calls their WMAs. h2oUseByState: A list of spatial polygon data frames which contain the area(s) in which each water right is claimed to be used. It should be noted that not all water right records have a listed area(s) of use in this object. Currently, only Idaho and Washington provided valid data to be included in this object. h2oDivByState: A list of spatial points data frames which identifies the location of the Point of Diversion for the state's water rights. It should be noted that not all water right records have a listed Point of Diversion in this object. spatialWMAByState: A list of spatial polygon data frames which contain the spatial WMA boundaries for each state. The only data contained within the table are identifiers for each polygon. It is worth reiterating that Arizona is the only state in which the surface and groundwater WMA boundaries are not the same. wmaIDByState: A list which contains the unique ID values of the WMAs for each state. plottingDim: A character vector used to inform mapping functions for internal map making. Each state is classified as either "tall" or "wide", to maximize space on a typical 8x11 page. The code related to the creation of this dataset can be viewed within HarDWR GitHub Repository/dataHarmonization.

Economics↗

High-resolution (30-m) urban land cover projections for Los Angeles California Urban Area: 2010 to 2100 under SSP3 and SSP5 [Updated simulations based on population-driven urban intensity transitions]

These data (v3) are updated from previous versions (1 and 2) in that they include consider the effects of population on transitions in urban land intensity. This leads to more reasonable differences in urban land projections under variant SSPs. For the present dataset, both SSP3 and SSP5 are provided. These data represent simulations of future land use and land cover (LULCC) for Los Angeles urban area (U.S. Census Bureau defined area) as raster tiff images at a 30-m pixel resolution and at decadal time steps from 2010 to 2100. LULCC classes in this product follow the National Land Cover Dataset (NLCD) classification. NLCD 21-24 correspond to open developed, low developed, medium developed, and high developed urban land classes, respectively. Only urban land cover classes (NLCD class 21, 22, 23, and 24) are dynamic over time; however, all NLCD classes are included in the final product. Therefore, NLCD classes that do not convert to an urban class will be similar to year 2000. The products were developed using a hybridized statistical and cellular automata approach. Linear mixed models (LMMs) were used to estimate future urban land budgets based on 1-km urban land fraction projections from Gao and Pesaresi (2021), whereas separate generalized linear mixed models (GLMMs) were used to estimate shifts in urban land intensities based on retrospective shifts in NLCD urban class intensities over a 20- year period. Based on urban land allocations from the statistical models, a cellular-automata and downscaling routine was used to simulate dynamic urban land expansion at a 30-m resolution based on suitability criteria. Scenarios of future urban landcover change projections include variant solutions for the Shared Socioeconomic Pathway 5 (SSP5) and SSP 3 based on different population assumptions, different land use intensification assumptions, variable land zoning constraints, and iterative adjustments to correct for over allocation of urban expansion across decadal time periods from 2010 to 2100. This results in 320 raster products.

Land↗

Overall Energy Considerations for Algae Species Comparison and Selection in Algae-to-Fuels Processes

The controlled growth of microalgae as a feedstock for alternative transportation fuel continues to receive much attention. Microalgae have the characteristics of rapid growth rate, high oil (lipid) content, and ability to be grown in unconventional scenarios. Algae have also been touted as beneficial for CO{sub 2} reuse, as algae can be grown using CO{sub 2} emissions from fossil-based energy generation. Moreover, algae does not compete in the food chain, lessening the 'food versus fuel' debate. Most often, it is assumed that either rapid production rate or high oii content should be the primary factor in algae selection for algae-to-fuels production systems. However, many important characteristics of algae growth and lipid production must be considered for species selection, growth condition, and scale-up. Under light limited, high density, photoautotrophic conditions, the inherent growth rate of an organism does not affect biomass productivity, carbon fixation rate, and energy fixation rate. However, the oil productivity is organism dependent, due to physiological differences in how the organisms allocate captured photons for growth and oil production and due to the differing conditions under which organisms accumulate oils. Therefore, many different factors must be considered when assessing the overall energy efficiency of fuel production for a given algae species. Two species, Chlorella vulgaris and Botryococcus braunii, are popular choices when discussing algae-to-fuels systems. Chlorella is a very robust species, often outcompeting other species in mixed-culture systems, and produces a lipid that is composed primarily of free fatty acids and glycerides. Botryococcus is regarded as a slower growing species, and the lipid that it produces is characterized by high hydrocarbon content, primarily C28-C34 botryococcenes. The difference in growth rates is often considered to be an advantage oiChlorella. However, the total energy captured by each algal species in the same photobioreactor system should be similar at light limited growth conditions based on photon flux. It is how the algae 'allocate' this energy captured that will vary: Data will be presented that shows that Botryococcus invests greater energy in oil production than Chlorella under these growth conditions. In essence, the Chlorella can grow 'fast and lean' or can be slowed to grow 'slow and fat'. The overall energy potential between the Chlorella and Botryococcus, then, becomes much more equivalent on a per-photon basis. This work will indicate an interesting relationship between two very different algae species, in terms of growth rate, lipid content and composition, and energy efficiency of the overall process. The presentation will indicate that in light-limited growth, it cannot be assumed that either rapid growth rate or lipid production rate can be used as stand-alone indicators of which species-lipid relationships will truly be more effective in algae-to-fuels scenarios.

36 MATERIALS SCIENCE↗

Evaluation of Dynamic Channel and Power Assignment for Cognitive Networks

In this paper, we develop a unifying optimization formulation to describe the Dynamic Channel and Power Assignment (DCPA) problem and evaluation method for comparing DCPA algorithms. DCPA refers to the allocation of transmit power and frequency channels to links in a cognitive network so as to maximize the total number of feasible links while minimizing the aggregate transmit power. We apply our evaluation method to five algorithms representative of DCPA used in literature. This comparison illustrates the tradeoffs between control modes (centralized versus distributed) and channel/power assignment techniques. We estimate the complexity of each algorithm. Through simulations, we evaluate the effectiveness of the algorithms in achieving feasible link allocations in the network, as well as their power efficiency. Our results indicate that, when few channels are available, the effectiveness of all algorithms is comparable and thus the one with smallest complexity should be selected. The Least Interfering Channel and Iterative Power Assignment (LICIPA) algorithm does not require cross-link gain information, has the overall lowest run time, and highest feasibility ratio of all the distributed algorithms; however, this comes at a cost of higher average power per link.

42 ENGINEERING↗

Continuous Time Group Discovery in Dynamic Graphs

With the rise in availability and importance of graphs and networks, it has become increasingly important to have good models to describe their behavior. While much work has focused on modeling static graphs, we focus on group discovery in dynamic graphs. We adapt a dynamic extension of Latent Dirichlet Allocation to this task and demonstrate good performance on two datasets. Modeling relational data has become increasingly important in recent years. Much work has focused on static graphs - that is fixed graphs at a single point in time. Here we focus on the problem of modeling dynamic (i.e. time-evolving) graphs. We propose a scalable Bayesian approach for community discovery in dynamic graphs. Our approach is based on extensions of Latent Dirichlet Allocation (LDA). LDA is a latent variable model for topic modeling in text corpora. It was extended to deal with topic changes in discrete time and later in continuous time. These models were referred to as the discrete Dynamic Topic Model (dDTM) and the continuous Dynamic Topic Model (cDTM), respectively. When adapting these models to graphs, we take our inspiration from LDA-G and SSN-LDA, applications of LDA to static graphs that have been shown to effectively factor out community structure to explain link patterns in graphs. In this paper, we demonstrate how to adapt and apply the cDTM to the task of finding communities in dynamic networks. We use link prediction to measure the quality of the discovered community structure and apply it to two different relational datasets - DBLP author-keyword and CAIDA autonomous systems relationships. We also discuss a parallel implementation of this approach using Hadoop. In Section 2, we review LDA and LDA-G. In Section 3, we review the cDTM and introduce cDTMG, its adaptation to modeling dynamic graphs. We discuss inference for the cDTM-G and details of our parallel implementation in Section 4 and present its performance on two datasets in Section 5 before concluding in Section 6.

97 MATHEMATICS AND COMPUTING↗

Assessing Risk and Driving Risk Mitigation for First-of-a-Kind Advanced Reactors

Planning and decision making amidst programmatic and technological risks represent significant challenges for projects. This presentation addresses the four step risk-assessment process needed to determine clear path forward to mature needed technology and design, license, and construct advanced nuclear power plants, which have never been built before, including Small Modular Reactors. This four step process has been carefully applied to the Next Generation Nuclear Plant. STEP 1 - Risk Identification Risks are identified, collected, and categorized as technical risks, programmatic risks, and project risks, each of which result in cost and schedule impacts if realized. These include risks arising from the use of technologies not previously demonstrated in a relevant application. These risks include normal and accident scenarios which the SMR could experience including events that cause the disablement of engineered safety features (typically documented in Phenomena Identification Ranking Tables (PIRT) as produced with the Nuclear Regulatory Commission) and design needs which must be addressed to further detail the design. Product - Project Risk Register contained in a database with sorting, presentation, rollup, risk work off functionality similar to the NGNP Risk Management System . STEP 2 - Risk Quantification The risks contained in the risk register are then scored for probability of occurrence and severity of consequence, if realized. Here the scoring methodology is established and the basis for the scoring is well documented. Product - Quantified project risk register with documented basis for scoring. STEP 3 - Risk Handling Strategy Risks are mitigated by applying a systematic approach to maturing the technology through Research and Development, modeling, test, and design. A Technology Readiness Assessment is performed to determine baseline Technology Readiness Levels (TRL). Tasks needed to mature the technology are developed and documented in a roadmap. Product - Risk Handling Strategy. STEP 4 - Residual Risk Work off The risk handling strategy is entered into the Project Risk Allocation Tool (PRAT) to analyze each task for its ability to reduce risk. The result is risk-informed task prioritization. The risk handling strategy is captured in the Risk Management System, a relational database that provides conventional database utility, including data maintenance, archiving, configuration control, and query ability. The tool's Hierarchy Tree allows visualization and analyses of complex relationships between risks, risk mitigation tasks, design needs, and PIRTs. Product - Project Risk Allocation Tool and Risk Management System which depict project plan to reduce risk and current progress in doing so.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Increasing available FIFO space to prevent messaging queue deadlocks in a DMA environment

Embodiments of the invention may be used to manage message queues in a parallel computing environment to prevent message queue deadlock. A direct memory access controller of a compute node may determine when a messaging queue is full. In response, the DMA may generate an interrupt. An interrupt handler may stop the DMA and swap all descriptors from the full messaging queue into a larger queue (or enlarge the original queue). The interrupt handler then restarts the DMA. Alternatively, the interrupt handler stops the DMA, allocates a memory block to hold queue data, and then moves descriptors from the full messaging queue into the allocated memory block. The interrupt handler then restarts the DMA. During a normal messaging advance cycle, a messaging manager attempts to inject the descriptors in the memory block into other messaging queues until the descriptors have all been processed.

97 MATHEMATICS AND COMPUTING↗

NVMalloc: Exposing an Aggregate SSD Store as a Memory Partition in Extreme-Scale Machines

DRAM is a precious resource in extreme-scale machines and is increasingly becoming scarce, mainly due to the growing number of cores per node. On future multi-petaflop and exaflop machines, the memory pressure is likely to be so severe that we need to rethink our memory usage models. Fortunately, the advent of non-volatile memory (NVM) offers a unique opportunity in this space. Current NVM offerings possess several desirable properties, such as low cost and power efficiency, but suffer from high latency and lifetime issues. We need rich techniques to be able to use them alongside DRAM. In this talk, we present a novel approach for exploiting NVM as a secondary memory partition so that applications can explicitly allocate and manipulate memory regions therein. More specifically, we propose an NVMalloc library with a suite of services that enables applications to access a distributed NVM storage system. We have devised ways within NVMalloc so that the storage system, built from compute node-local NVM devices, can be accessed in a byte-addressable fashion using the memory mapped I/O interface. Our approach has the potential to re-energize out-of-core computations on largescale machines by having applications allocate certain variables through NVMalloc, thereby increasing the overall memory capacity available. Our evaluation on a 128-core cluster shows that NVMalloc enables applications to compute problem sizes larger than the physical memory in a cost-effective manner. It can bring more performance/efficiency gain with increased computation time between NVM memory accesses or increased data access locality. In addition, our results suggest that while NVMalloc enables transparent access to NVM-resident variables, the explicit control it provides is crucial to optimize application performance.

99 GENERAL AND MISCELLANEOUS↗

Probing the Quark Sea and Gluons: the Electron-Ion Collider Projects

EIC is the generic name for the nuclear science-driven Electron-Ion Collider presently considered in the US. Such an EIC would be the world’s first polarized electron-proton collider, and the world’s first e-A collider. Very little remains known about the dynamical basis of the structure of hadrons and nuclei in terms of the fundamental quarks and gluons of Quantum Chromodynamics (QCD). A large community effort to sharpen a compelling nuclear science case for an EIC occurred during a ten-week program taking place at the Institute for Nuclear Theory (INT) in Seattle from September 13 to November 19, 2010. The critical capabilities of a stage-I EIC are a range in center-of-mass energies from 20 to 70 GeV and variable, full polarization of electrons and light ions (the latter both longitudinal and transverse), ion species up to A=200 or so, multiple interaction regions, and a high luminosity of about 10{sup 34} electron-nucleons per cm{sup 2} and per second. The physics program of such a stage-I EIC encompass inclusive measurements (ep/A{yields}e'+X), which require detection of the scattered lepon and/or the full scattered hadronic debris with high precision, semi-inclusive processes (ep/A{yields}e'+h+X), which require detection in coincidence with the scattered lepton of at least one (current or target region) hadron; and exclusive processes (ep/A{yields}e'+N'/A'+{gamma}/m), which require detection of all particles in the reaction. The main science themes of an EIC are to i) map the spin and spatial structure of quarks and gluons in nucleons, ii) discover the collective effects of gluons in atomic nuclei, and (iii) understand the emergence of hadronic matter from color charge. In addition, there are opportunities at an EIC for fundamental symmetry and nucleon structure measurements using the electroweak probe. To truly make headway to image the sea quarks and gluons in nucleons and nuclei, the EIC needs high luminosity over a range of energies as more exclusive scattering probabilities are small, and any integrated detector/interaction region design needs to provide uniform coverage to detect spectator and diffractive products. This is because e-p and even more e-A colliders have a large fraction of their science related to what happens to the nucleon or ion beams. As a result, the philosophy of integration of complex detectors into an extended interaction region faces challenging constraints. Designs feature crossing angles between the protons or heavy ions during collisions with electrons, to remove potential problems for the detector induced by synchrotron radiation. Designs allocate quite some detector space before the final-focus ion quads, at the cost of luminosity, given that uniform detection coverage is a must for deep exclusive and diffractive processes. The integrated EIC detector/interaction region design at JLab focused on establishing full acceptance for such processes over a wide range of proton energies (20-100 GeV) with well achievable interaction region magnets. The detector design at BNL uses the higher ion beam energies to achieve good detection efficiency for instance for protons following a DVCS reaction, for proton beam energies starting from 100 GeV. Following a recommendation of the 2007 US Nuclear Science Long-Range Planning effort, the DOE Office of Nuclear Physics (DOE/NP) has allocated accelerator R&D funds to lay the foundation for a polarized EIC. BNL, in association with JLab and DOE/NP, has also established a generic detector R&D program to address the scientific requirements for measurements at a future EIC.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

An Analysis Framework for Investigating the Trade-offs Between System Performance and Energy Consumption in a Heterogeneous Computing Environment

Rising costs of energy consumption and an ongoing effort for increases in computing performance are leading to a significant need for energy-efficient computing. Before systems such as supercomputers, servers, and datacenters can begin operating in an energy-efficient manner, the energy consumption and performance characteristics of the system must be analyzed. In this paper, we provide an analysis framework that will allow a system administrator to investigate the tradeoffs between system energy consumption and utility earned by a system (as a measure of system performance). We model these trade-offs as a bi-objective resource allocation problem. We use a popular multi-objective genetic algorithm to construct Pareto fronts to illustrate how different resource allocations can cause a system to consume significantly different amounts of energy and earn different amounts of utility. We demonstrate our analysis framework using real data collected from online benchmarks, and further provide a method to create larger data sets that exhibit similar heterogeneity characteristics to real data sets. This analysis framework can provide system administrators with insight to make intelligent scheduling decisions based on the energy and utility needs of their systems.

Friese, Ryan↗