U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Search Publications

NIST Authors in Bold

Displaying 30651 - 30675 of 143775

Double-integrating-sphere system at the National Institute of Standards and Technology in support of measurement standards for the determination of optical properties of tissue-mimicking phantoms

October 27, 2015
Author(s)
Paul Lemaillet, Jeeseong C. Hwang, David W. Allen
There is a need for a common reference point that will allow for the comparison of the optical properties of tissue mimicking phantoms. This paper provides a brief review of the methods that have been used to measure tissue mimicking phantoms. The review

HOW OLD IS IT? - 241PU/AMNUCLEAR FORENSIC CHRONOLOGY REFERENCE MATERIALS

October 27, 2015
Author(s)
Ryan P. Fitzgerald, Kenneth G. Inn
One material attribute for nuclear forensics is material age. 241Pu is almost always present in uranium- and plutonium-based nuclear weapons, which pose the greatest threat to our security. The in-growth of 241Am due to the decay of 241Pu provides an

New Results on Packing Degree Sequences and the 2-Color Discrete Tomography Problem

October 27, 2015
Author(s)
James Shook, Michael Ferrara, Jennifer Diemunsch, Sogol Jahanbekam
A sequence $\pi=(d_1,\ldots,d_n)$ is graphic if there is a simple graph $G$ with vertex set $\{v_1,\ldots,v_n\}$ such that the degree of $v_i$ is the $i$th entry of $\pi$. We say that graphic sequences $\pi_1=(d_1^{(1)},\ldots,d_n^{(1)})$ and $\pi_2=(d_1^{

Policy Machine: Features, Architecture, and Specification

October 27, 2015
Author(s)
David F. Ferraiolo, Serban I. Gavrila, Wayne Jansen
The ability to control access to sensitive data in accordance with policy is perhaps the most fundamental security requirement. Despite over four decades of security research, the limited ability for existing access control mechanisms to enforce a

The NIST Plan for Providing Public Access to Results of Federally Funded Research

October 27, 2015
Author(s)
Katherine E. Sharpless, Regina L. Avila, Sally S. Bruce, Wo L. Chang, Robert M. Dimeo, Virginia Covahey, Alan K. Dohne, Heather M. Evans, Aaron P. Fein, Donna J. Kimball, Andrea M. Medina-Smith, Alan E. Munter, James K. Olthoff, Dianne L. Poster, Kathleen M. Roberts, Susannah B. Schiller, John H. Scott, Barbara P. Silcox, James A. St Pierre, Mark D. Stiles
Documentation of the evolution of NIST's plan for providing public access to results of federally funded research is provided, including the plan itself, responses to comments made by NIST staff, and public comments received in response to a request for

The Number of Boolean Functions with Multiplicative Complexity 2

October 27, 2015
Author(s)
Magnus G. Find, Daniel C. Smith-Tone, Meltem Sonmez Turan
Multiplicative complexity is a complexity measure, which is defined as the minimum number of AND gates required to implement a given primitive by a circuit over the basis (AND, XOR, NOT), with an unlimited number of NOT and XOR gates. Implementations of

Enhanced Magnetic Trap Loading for Atomic Strontium

October 26, 2015
Author(s)
Gretchen K. Campbell, Daniel Barker, Benjamin Reschovsky, Neal Pisenti
We report on a technique to improve the continuous loading of atomic strontium into a magnetic trap from a Magneto-Optical Trap (MOT). This is achieved by adding a depumping laser tuned to the 3 P1 → 3 S 1 (688-nm) transition. The depumping laser increases
Displaying 30651 - 30675 of 143775
Was this page helpful?