Search NASA⌕ Search

SEARCH · Search NASA

Results for “Repeatability”

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 775 records · Page 43

DMA engine for repeating communication patterns

A parallel computer system is constructed as a network of interconnected compute nodes to operate a global message-passing application for performing communications across the network. Each of the compute nodes includes one or more individual processors with memories which run local instances of the global message-passing application operating at each compute node to carry out local processing operations independent of processing operations carried out at other compute nodes. Each compute node also includes a DMA engine constructed to interact with the application via Injection FIFO Metadata describing multiple Injection FIFOs where each Injection FIFO may containing an arbitrary number of message descriptors in order to process messages with a fixed processing overhead irrespective of the number of message descriptors included in the Injection FIFO.

Chen, Dong↗

Palliation and Survival After Repeated Re-188-HEDP Therapy of Hormone-Refractory Bone Metastases of Prostate Cancer: A Retrospsective Analysis

This retrospective study compared the effects of single and multiple administrations of {sup 186}Re-hydroxyethylidenediphosphonate (186Re-HEDP) on palliation and survival of prostate cancer patients presenting with more than 5 skeletal metastases. Methods: A total of 60 patients were divided into 3 groups. Group A (n = 19) consisted of patients who had received a single injection; group B (n = 19), patients who had 2 injections; and group C (n = 22), patients who had 3 or more successive injections. The {sup 188}Re-HEDP was prepared using non-carrier-added {sup 188}Re obtained from an in-house {sup 188}W/{sup 188}Re generator after dilution with carrier perrhenate. Patients data available from the referring physicians - including prostate-specific antigen levels - were entered into a Windows-based matrix and analyzed using a statistical program. The Gleason scores were similar for all 3 groups. Results: Mean survival from the start of treatment was 4.50 {+-} 0.81 mo (95% confidence interval [CI], 2.92-6.08) for group A, 9.98 {+-} 2.21 mo (95% CI, 5.65-14.31) for group B, and 15.66 {+-} 3.23 (95% CI, 9.33-22.0) for group C. Although the 3 groups did not differ in Gleason score, the number of lost life-years was significantly lower in group C than in groups A and B. Pain palliation was achieved in 89.5% of group A, 94.7% of group B, and 90.9% of group C. Conclusion: Posttreatment overall survival could be improved from 4.50 to 15.66 mo by multiple-injection bone-targeted therapy with {sup 188}Re-HEDP, when compared with a single injection. Significant pain palliation was common and independent of administration frequency.

60 APPLIED LIFE SCIENCES↗

Binary classification of items of interest in a repeatable process

A system includes host and learning machines in electrical communication with sensors positioned with respect to an item of interest, e.g., a weld, and memory. The host executes instructions from memory to predict a binary quality status of the item. The learning machine receives signals from the sensor(s), identifies candidate features, and extracts features from the candidates that are more predictive of the binary quality status relative to other candidate features. The learning machine maps the extracted features to a dimensional space that includes most of the items from a passing binary class and excludes all or most of the items from a failing binary class. The host also compares the received signals for a subsequent item of interest to the dimensional space to thereby predict, in real time, the binary quality status of the subsequent item of interest.

97 MATHEMATICS AND COMPUTING↗

Repeatable masking of sensitive data

The various technologies presented herein relate to enabling a value generated based upon a physical unclonable function (PUF) response to be available as needed, while also preventing exposure of the PUF to a malicious entity. A masked PUF response can be generated based upon applying a function to a combination of the PUF response and a data file (e.g., a bitstream), and the masked PUF response is forwarded to a requesting entity, rather than the PUF response. Hence, the PUF is masked from any entity requiring access to the PUF. The PUF can be located in a FPGA, wherein the data file is a bitstream pertinent to one or more configurable logic blocks included in the FPGA. A first masked PUF response generated with a first data file can have a different value to a second masked PUF response generated with a second data file.

Hamlet, Jason↗