Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “heuristic”

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 1,081 records · Page 60

Fast counting with tensor networks

We introduce tensor network contraction algorithms for counting satisfying assignments of constraint satisfaction problems (#CSPs). We represent each arbitrary #CSP formula as a tensor network, whose full contraction yields the number of satisfying assignments of that formula, and use graph theoretical methods to determine favorable orders of contraction. We employ our heuristics for the solution of #P-hard counting boolean satisfiability (#SAT) problems, namely monotone #1-in-3SAT and #Cubic-Vertex-Cover, and find that they outperform state-of-the-art solvers by a significant margin.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Application of step-response lambda tuning to proportional-integral controllers in water resource recovery facilities

Proportional-integral-derivative (PID) controllers in water resource recovery facilities (WRRFs) feedback control loops are commonplace. While simple to implement, such control loops are rarely tuned optimally or systematically. Heuristic tuning approaches are commonly applied with varying degrees of success using trial-and-error, ad hoc tuning rules, or duplication of tuning values from a similar system. However, there are effective methods, such as lambda tuning, produce acceptable tuning with limited effort. These are based on the step-response method, where a manual process perturbation is used to define the relationship between the manipulated and controlled variables. Based on such an experiment, a simple process model is constructed and used to determine the controller tuning values. In this work, we used the step-response method and lambda tuning for two control systems in full-scale WRRFs. This led to responsive and stable behavior of the controlled system as defined by the absolute average error of the controlled variable to setpoint and standard deviation of the manipulated variable. Tuning of feedback control loops can be completed successfully through a systematic approach, and this work suggests that tuning tools, like lambda, should be part of all wastewater treatment control engineers' toolbox.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Investigation of Public Discourse Methods in Energy Policy Decision-Making: A Summary of What You Told Us and What We Learned

The ground is littered with projects that failed because of strong public opposition, including natural gas and coal power plants proposed in Idaho over the past several years. This joint project , of the Idaho National Laboratory, Boise State University, Idaho State University and University of Idaho has aimed to add to the tool box to reduce project risk through encouraging the public to engage in more critical thought and be more actively involved in public or social issues. Early in a project, project managers and decision-makers can talk with no one, pro and con stakeholder groups, or members of the public. Experience has shown that talking with no one outside of the project incurs high risk because opposition stakeholders have many means to stop most (if not all) energy projects. Talking with organized stakeholder groups provides some risk reduction from mutual learning, but organized groups tend not to change positions except under conditions of a negotiated settlement. Achieving a negotiated settlement may be impossible. Furthermore, opposition often arises outside pre-existing groups. Standard public polling provides some information but does not reveal underlying motivations, intensity of attitudes, etc. Improved methods are needed that probe deeper into stakeholder (organized groups and members of the public) values and beliefs (sometimes called /heuristics) to increase the potential for change of opinions and/or out-of-box solutions. The term “heuristics” refers to the mental short-cuts, underlying beliefs, and paradigms that everyone uses to filter and interpret information, to interpret what is around us, and to guide our actions and decisions. This document is the final report of a 3-year effort to test different public discourse methods in the subject area of energy policy decision-making. We analyzed 504 mail-in surveys and 80 participants in groups on the Boise State University campus for their preference, financial support, and evaluations of eight attributes for energy conservation and efficiency, fossil fuels, nuclear energy, hydropower, and renewable energy. All participants saw a 7-person diverse energy expert panel. Some participants attended deliberation sessions; some received a 35-page briefing document that included pros and cons of the different energy options.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

A Novel Coarsening Method for Scalable and Efficient Mesh Generation

In this paper, we propose a novel mesh coarsening method called brick coarsening method. The proposed method can be used in conjunction with any graph partitioners and scales to very large meshes. This method reduces problem space by decomposing the original mesh into fixed-size blocks of nodes called bricks, layered in a similar way to conventional brick laying, and then assigning each node of the original mesh to appropriate brick. Our experiments indicate that the proposed method scales to very large meshes while allowing simple RCB partitioner to produce higher-quality partitions with significantly less edge cuts. Our results further indicate that the proposed brick-coarsening method allows more complicated partitioners like PT-Scotch to scale to very large problem size while still maintaining good partitioning performance with relatively good edge-cut metric. Graph partitioning is an important problem that has many scientific and engineering applications in such areas as VLSI design, scientific computing, and resource management. Given a graph G = (V,E), where V is the set of vertices and E is the set of edges, (k-way) graph partitioning problem is to partition the vertices of the graph (V) into k disjoint groups such that each group contains roughly equal number of vertices and the number of edges connecting vertices in different groups is minimized. Graph partitioning plays a key role in large scientific computing, especially in mesh-based computations, as it is used as a tool to minimize the volume of communication and to ensure well-balanced load across computing nodes. The impact of graph partitioning on the reduction of communication can be easily seen, for example, in different iterative methods to solve a sparse system of linear equation. Here, a graph partitioning technique is applied to the matrix, which is basically a graph in which each edge is a non-zero entry in the matrix, to allocate groups of vertices to processors in such a way that many of matrix-vector multiplication can be performed locally on each processor and hence to minimize communication. Furthermore, a good graph partitioning scheme ensures the equal amount of computation performed on each processor. Graph partitioning is a well known NP-complete problem, and thus the most commonly used graph partitioning algorithms employ some forms of heuristics. These algorithms vary in terms of their complexity, partition generation time, and the quality of partitions, and they tend to trade off these factors. A significant challenge we are currently facing at the Lawrence Livermore National Laboratory is how to partition very large meshes on massive-size distributed memory machines like IBM BlueGene/P, where scalability becomes a big issue. For example, we have found that the ParMetis, a very popular graph partitioning tool, can only scale to 16K processors. An ideal graph partitioning method on such an environment should be fast and scale to very large meshes, while producing high quality partitions. This is an extremely challenging task, as to scale to that level, the partitioning algorithm should be simple and be able to produce partitions that minimize inter-processor communications and balance the load imposed on the processors. Our goals in this work are two-fold: (1) To develop a new scalable graph partitioning method with good load balancing and communication reduction capability. (2) To study the performance of the proposed partitioning method on very large parallel machines using actual data sets and compare the performance to that of existing methods. The proposed method achieves the desired scalability by reducing the mesh size. For this, it coarsens an input mesh into a smaller size mesh by coalescing the vertices and edges of the original mesh into a set of mega-vertices and mega-edges. A new coarsening method called brick algorithm is developed in this research. In the brick algorithm, the zones in a given mesh are first grouped into fixed size blocks called bricks. These brick are then laid in a way similar to conventional brick laying technique, which reduces the number of neighboring blocks each block needs to communicate. Contributions of this research are as follows: (1) We have developed a novel method that scales to a really large problem size while producing high quality mesh partitions; (2) We measured the performance and scalability of the proposed method on a machine of massive size using a set of actual large complex data sets, where we have scaled to a mesh with 110 million zones using our method. To the best of our knowledge, this is the largest complex mesh that a partitioning method is successfully applied to; and (3) We have shown that proposed method can reduce the number of edge cuts by as much as 65%.

97 MATHEMATICS AND COMPUTING↗

Stephen Jay Kline on systems, or physics, complex systems, and the gap between.

At the end of his life, Stephen Jay Kline, longtime professor of mechanical engineering at Stanford University, completed a book on how to address complex systems. The title of the book is 'Conceptual Foundations of Multi-Disciplinary Thinking' (1995), but the topic of the book is systems. Kline first establishes certain limits that are characteristic of our conscious minds. Kline then establishes a complexity measure for systems and uses that complexity measure to develop a hierarchy of systems. Kline then argues that our minds, due to their characteristic limitations, are unable to model the complex systems in that hierarchy. Computers are of no help to us here. Our attempts at modeling these complex systems are based on the way we successfully model some simple systems, in particular, 'inert, naturally-occurring' objects and processes, such as what is the focus of physics. But complex systems overwhelm such attempts. As a result, the best we can do in working with these complex systems is to use a heuristic, what Kline calls the 'Guideline for Complex Systems.' Kline documents the problems that have developed due to 'oversimple' system models and from the inappropriate application of a system model from one domain to another. One prominent such problem is the Procrustean attempt to make the disciplines that deal with complex systems be 'physics-like.' Physics deals with simple systems, not complex ones, using Kline's complexity measure. The models that physics has developed are inappropriate for complex systems. Kline documents a number of the wasteful and dangerous fallacies of this type.

42 ENGINEERING↗

Development and Utilization of mathematical Optimization in Advanced Fuel Cycle Systems Analysis

Over the past sixty years, a wide variety of nuclear power technologies have been theorized, investigated and tested to various degrees. These technologies, if properly applied, could provide a stable, long-term, economical source of CO2-free electric power. However, the recycling of nuclear fuel introduces a degree of coupling between reactor systems which must be accounted for when making long term strategic plans. This work investigates the use of a simulated annealing optimization algorithm coupled together with the VISION fuel cycle simulation model in order to identify attractive strategies from economic, evironmental, non-proliferation and waste-disposal perspectives, which each have associated an objective function. The simulated annealing optimization algorithm works by perturbing the fraction of new reactor capacity allocated to each available reactor type (using a set of heuristic rules) then evaluating the resulting deployment scenario outcomes using the VISION model and the chosen objective functions. These new scenarios, which are either accepted or rejected according the the Metropolis Criterion, are then used as the basis for further perturbations. By repeating this process several thousand times, a family of near-optimal solutions are obtained. Preliminary results from this work using a two-step, Once-through LWR to Full-recycle/FRburner deployment scenario with exponentially increasing electric demand indicate that the algorithm is capable of nding reactor deployment pro les that reduce the long-term-heat waste disposal burden relative to an initial reference scenario. Further work is under way to re ne the current results and to extend them to include the other objective functions and to examine the optimization trade-o s that exist between these di erent objectives.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Multi-Scale Mass Transfer Processes Controlling Natural Attenuation and Engineered Remediation: An IFRC Focused on Hanford’s 300 Area Uranium Plume

The Integrated Field Research Challenge (IFRC) at the Hanford Site 300 Area uranium (U) plume addresses multi-scale mass transfer processes in a complex subsurface biogeochemical setting where groundwater and riverwater interact. A series of forefront science questions on reactive mass transfer motivates research. These questions relate to the effect of spatial heterogeneities; the importance of scale; coupled interactions between biogeochemical, hydrologic, and mass transfer processes; and measurements and approaches needed to characterize and model a mass-transfer dominated biogeochemical system. The project was initiated in February 2007, with CY 2007, CY 2008, CY 2009, and CY 2010 progress summarized in preceding reports. A project peer review was held in March 2010, and the IFRC project acted upon all suggestions and recommendations made in consequence by reviewers and SBR/DOE. These responses have included the development of 'Modeling' and 'Well-Field Mitigation' plans that are now posted on the Hanford IFRC web-site, and modifications to the IFRC well-field completed in CY 2011. The site has 35 instrumented wells, and an extensive monitoring system. It includes a deep borehole for microbiologic and biogeochemical research that sampled the entire thickness of the unconfined 300 A aquifer. Significant, impactful progress has been made in CY 2011 including: (i) well modifications to eliminate well-bore flows, (ii) hydrologic testing of the modified well-field and upper aquifer, (iii) geophysical monitoring of winter precipitation infiltration through the U-contaminated vadose zone and spring river water intrusion to the IFRC, (iv) injection experimentation to probe the lower vadose zone and to evaluate the transport behavior of high U concentrations, (v) extended passive monitoring during the period of water table rise and fall, and (vi) collaborative down-hole experimentation with the PNNL SFA on the biogeochemistry of the 300 A Hanford-Ringold contact and the underlying redox transition zone. The modified well-field has functioned superbly without any evidence for well-bore flows. Beyond these experimental efforts, our site-wide reactive transport models (PFLOTRAN and eSTOMP) have been updated to include site geostatistical models of both hydrologic properties and adsorbed U distribution; and new hydrologic characterization measurements of the upper aquifer. These increasingly robust models are being used to simulate past and recent U desorption-adsorption experiments performed under different hydrologic conditions, and heuristic modeling to understand the complex functioning of the smear zone. We continued efforts to assimilate geophysical logging and 3D ERT characterization data into our site wide geophysical model, with significant and positive progress in 2011 that will enable publication in 2012. Our increasingly comprehensive field experimental results and robust reactive transport simulators, along with the field and laboratory characterization, are leading to a new conceptual model of U(VI) flow and transport in the IFRC footprint and the 300 Area in general, and insights on the microbiological community and associated biogeochemical processes influencing N, S, C, Mn, and Fe. Collectively these findings and higher scale models are providing a unique and unparalleled system-scale understanding of the biogeochemical function of the groundwater-river interaction zone.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Deflagration Wave Profiles

Shock initiation in a plastic-bonded explosives (PBX) is due to hot spots. Current reactive burn models are based, at least heuristically, on the ignition and growth concept. The ignition phase occurs when a small localized region of high temperature (or hot spot) burns on a fast time scale. This is followed by a growth phase in which a reactive front spreads out from the hot spot. Propagating reactive fronts are deflagration waves. A key question is the deflagration speed in a PBX compressed and heated by a shock wave that generated the hot spot. Here, the ODEs for a steady deflagration wave profile in a compressible fluid are derived, along with the needed thermodynamic quantities of realistic equations of state corresponding to the reactants and products of a PBX. The properties of the wave profile equations are analyzed and an algorithm is derived for computing the deflagration speed. As an illustrative example, the algorithm is applied to compute the deflagration speed in shock compressed PBX 9501 as a function of shock pressure. The calculated deflagration speed, even at the CJ pressure, is low compared to the detonation speed. The implication of this are briefly discussed.

36 MATERIALS SCIENCE↗

Strategic Analysis of Complex Security Scenarios

Many advanced technical tools are available to prevent attacks on national infrastructure. Nevertheless, while traditional analyses of security problems have succeeded in producing good technical solutions, they have often ignored the human factor integral to these problems. Human attackers (who may be individuals or state-level attackers) expend substantial effort to breach security because they have the incentive for doing so. People involved in implementing security follow individual incentives, which need not align with global security concerns; consequently, desired security solutions are often implemented poorly, or not at all. This complex interplay between individual incentives and global (organizational and/or national) goals can be modeled and analyzed using game theoretic techniques. By analyzing not only what is possible, but also what is motivated, a holistic approach to security problems can be developed, informing policy and providing tools to policy makers. We study game theoretic models that unify several current incentive-based approaches to security, and develop simulation-based and mathematical optimization methods for analyzing such models that exploit the high-performance computing capabilities at Sandia. Our first model studies security in interdependent settings, offering a scalable local search heuristic to approximate optimal security decisions in general, and a linear programming approach, coupled with simulations of consequences, to optimally compute security in an important special case. Our second class of models addresses security patrolling problems when an adversary gets to observe the patrol location. We present a general framework, based on stochastic games, for computing optimal security policies in such settings, and present more scalable tools that apply in the important special cases. Our third contribution is a model of security that involves many defenders, but only models non-adaptive attackers (or natural disasters, inadvertent errors, etc). In this model, we demonstrate that the security decisions of many players result in global security configuration that is not very far from optimal, and is much more resilient to environment changes that an optimal solution. This positive effect dissipates, however, when the number of decision makers becomes too large.

Vorobeychik, Yevgeniy↗

INDDGO: Integrated Network Decomposition & Dynamic programming for Graph Optimization

It is well-known that dynamic programming algorithms can utilize tree decompositions to provide a way to solve some NP -hard problems on graphs where the complexity is polynomial in the number of nodes and edges in the graph, but exponential in the width of the underlying tree decomposition. However, there has been relatively little computational work done to determine the practical utility of such dynamic programming algorithms. We have developed software to construct tree decompositions using various heuristics and have created a fast, memory-efficient dynamic programming implementation for solving maximum weighted independent set. We describe our software and the algorithms we have implemented, focusing on memory saving techniques for the dynamic programming. We compare the running time and memory usage of our implementation with other techniques for solving maximum weighted independent set, including a commercial integer programming solver and a semi-definite programming solver. Our results indicate that it is possible to solve some instances where the underlying decomposition has width much larger than suggested by the literature. For certain types of problems, our dynamic programming code runs several times faster than these other methods.

Groër, Christopher S.↗

combinatorial optimization with demands (LDRD Final Report)

This report summarizes the research conducted and results obtained under the Laboratory Directed Research and Development (LDRD) project, “Combinatorial Optimization with Demands ,” from October 2010 to September 2012. Complex resource allocation problems are ubiquitous in mission-driven applications. We investigated resource allocation problems endowed with additional parameters called demands, which allow for richer modeling. Demand endowed resource allocation problems are considerably harder to solve than their traditional counterparts, and we developed a conceptually simple but powerful new framework called iterative packing which allowed us to address the added complexity of demands. By leveraging iterative packing , we designed approximation algorithms to solve a large class of hard resource allocation problems with demands. Approximation algorithms are efficient heuristics which also offer a performance guarantee on the worst case deviation from the cost of an optimal solution. Our algorithms offer better performance guarantees over previously known algorithms; moreover, we are able to show that our algorithms provide performance guarantees that are likely close to best possible.

Parekh, Ojas↗

Combining deduction and abduction: toward an integrated theory of information processing

Inference techniques play a central role in many cognitive systems. They transform low level observations of the environment into high-level, actionable knowledge which then gets used by mechanisms that drive action, problem-solving, and learning. This paper presents an initial effort at combining results from AI and psychology into a pragmatic and scalable computational reasoning system. Our approach combines a numeric notion of plausibility with first-order logic to produce an incremental inference engine that is guided by heuristics derived from the psychological literature.

Stracuzzi, David J.↗

Nanostructured carbide catalysts for the hydrogen economy

"The second grand challenge in the report centers on design and controlled synthesis of catalyst structures. Fundamental investigations of catalyst structures and the mechanisms of catalytic reactions provide the necessary foundation for the synthesis of improved catalysts." The above quote, taken from the executive summary of the Report from the US DOE Basic Energy Sciences Workshop held August 6–8, 2007, places in context the research carried out at the University of California, Santa Barbara, which is reported in this document. The enormous impact of heterogeneous catalysis is exemplified by the Haber process for the synthesis of ammonia, which consumes a few % of the world’s energy supply and natural gas, and feeds as many as a third of the world’s population. While there have been numerous advances in understanding the process, culminating in the awarding of the Nobel Prize to Gerhard Ertl in 2007, it is interesting to note that the catalysts themselves have changed very little since they were discovered heuristically in the early part of the 20th century. The thesis of this report is that modern materials chemistry, with all the empirical knowledge of solid state chemistry, combined with cutting edge structural tools, can help develop and better heterogeneous catalysis. The first part of this report describes research in the area of early transition metal carbides (notably of Mo and W), potentially useful catalysts for water gas shift (WGS) and related reactions of use to the hydrogen economy. Although these carbides have been known to be catalytically useful since the 1970s, further use of these relatively inexpensive materials have been plagued by issues of low surface areas and ill-defined, and often unreactive surfaces, in conjunction with deactivation. We have employed for the first time, a combination of constant-wavelength and time-of-flight neutron scattering, including a total scattering analysis of the latter data, to better understand what happens in these materials, in a manner that for the first time, reveals surface graphitic carbon in these materials in a quantitative manner. Problems of preparation, surface stability, and irreversible reactivity have become manifest in this class of materials that discourage us from pursuing these materials further.

08 HYDROGEN↗

Ridge-Valley Graphs: Combinatorial Ridge Detection Using Jacobi Sets

Ridges are one of the key feature of interest in areas such as computer vision and image processing. Even though a significant amount of research has been directed to defining and extracting ridges some fundamental challenges remain. For example, the most popular ridge definition (height ridge) is not invariant under monotonic transformations and its global structure is typically ignored during numerical computations. Furthermore, many existing algorithm are based on numerical heuristics and are rarely guaranteed to produce consistent results. In this paper a small change to the height ridge definition gives a definition that is consistent with the desired invariants. Nevertheless, we show that this definition results in similar structures compared to the most common traditional approach and that both formulations are equivalent for quadratic functions. Furthermore, this definition can be cast in the form of a degenerate Jacobi set, which allows insights into the global structure of ridges. In particular, we introduce the Ridge-Valley graph as the complete description of all ridges in an image. Analyzing this graph reveals similar invariants to those found for traditional ridge formulations, such as the fact that ridges do not merge. Finally, using the connection to Jacobi sets we describe a new combinatorial algorithm to extract the Ridge-Valley graph from sampled images that is guaranteed to produce a valid structure.

97 MATHEMATICS AND COMPUTING↗

Scrape-off layer flows with pressure gradient scale length ~ ρ p

A heuristic model for the plasma scrape-off width balances magnetic drifts against parallel loss at c s /2, resulting in a SOL width ~ ρ p . T sep is calculated from Spitzer–Härm parallel thermal conduction. This results in a prediction for the power scrape-off width in quantitative agreement both in magnitude and scaling with recent experimental data. To achieve the ~ c s /2 flow assumed in this model and measured experimentally sets requirements on the ratio of upstream to total SOL particle sources, relative to the square-root of the ratio of target to upstream temperature. The Pfisch-Schlüter model for equilibrium flows has been modified to allow near-sonic flows, appropriate for gradient scale lengths of order ρ p , resulting in a new quadrupole radial flow pattern. The strong parallel flows and plasma charging implied by this model suggest a mechanism for H-mode transition, consistent with many observations

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A Survey of Recent Advances in Transmission Network Switching

Optimal Transmission Switching for electric power networks is a research topic of great interest for both researchers and electric power engineers. Transmission switching is commonly considered a corrective mechanism tool for overloaded networks; however in recent years it has been sought as a means to reduce power loss in the network. Ultimately the objective of this analysis is to provide smart tools for power and economic dispatch planning, allowing utilities and engineers to utilize existing infrastructure as a means of automatic control. The optimization problem is a complex multi-objective search including criteria such as system power loss, equality/non-equality constraints, islanding management, and radial topology configuration in the case of distribution networks. Many optimization methods have been adopted for the transmission switching problem in past years using various heuristic search algorithms. The scope of methodology extends from tried and true methods such as simulated annealing to more modern methods like neural network optimization. Solution benchmarks under consideration commonly include solution state accuracy, computational burden and solution time. The objective of this presentation is to provide a comprehensive account of development in transmission switching methodologies. Benchmarking and testing strategies will be discussed as well as application of the Transmission Expansion Planning Tool in finding transmission switching solutions. Limited Discrepancy Search (LOS) and Probe Discrepancy Search (PDS) Algorithms are compared with more classic optimization strategies, as seen in defining literature and publications in this research field.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Efficient Algorithm for Locating and Sizing Series Compensation Devices in Large Transmission Grids: Model Implementation (PART 1)

We explore optimization methods for planning the placement, sizing and operations of Flexible Alternating Current Transmission System (FACTS) devices installed to relieve transmission grid congestion. We limit our selection of FACTS devices to Series Compensation (SC) devices that can be represented by modification of the inductance of transmission lines. Our master optimization problem minimizes the l 1 norm of the inductance modification subject to the usual line thermal-limit constraints. We develop heuristics that reduce this non-convex optimization to a succession of Linear Programs (LP) which are accelerated further using cutting plane methods. The algorithm solves an instance of the MatPower Polish Grid model (3299 lines and 2746 nodes) in 40 seconds per iteration on a standard laptop—a speed up that allows the sizing and placement of a family of SC devices to correct a large set of anticipated congestions. We observe that our algorithm finds feasible solutions that are always sparse, i.e., SC devices are placed on only a few lines. In a companion manuscript, we demonstrate our approach on realistically-sized networks that suffer congestion from a range of causes including generator retirement. In this manuscript, we focus on the development of our approach, investigate its structure on a small test system subject to congestion from uniform load growth, and demonstrate computational efficiency on a realistically-sized network.

25 ENERGY STORAGE↗

Rapid, autonomous analysis of He spectra I: Overview of the RadID program, user experience, and structure

RadID is a new gamma-ray spectrum analysis program for rapid screening of HPGe gamma-ray data to reveal the presence of radionuclide signatures. It is an autonomous, rule-based heuristic system that can identify well over 200 radioactive sources with particular interest in uranium and plutonium characteristics. It executes in about one second. RadID does not require knowledge of the detector efficiency, the source-to-detector distance, or the geometry of the inspected radiation source—including any shielding. In this first of a three-document series we sketch the RadID program’s origin, its minimal requirements, the user experience, and the program operation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗