Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “EXPLOITS”

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 379 records · Page 21

Exploiting fast detectors to enter a new dimension in room-temperature crystallography

A departure from a linear or an exponential decay in the diffracting power of macromolecular crystals is observed and accounted for through consideration of a multi-state sequential model. A departure from a linear or an exponential intensity decay in the diffracting power of protein crystals as a function of absorbed dose is reported. The observation of a lag phase raises the possibility of collecting significantly more data from crystals held at room temperature before an intolerable intensity decay is reached. A simple model accounting for the form of the intensity decay is reintroduced and is applied for the first time to high frame-rate room-temperature data collection.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Improved Distributed-memory Triangle Counting by Exploiting the Graph Structure

Graphs are ubiquitous in modeling complex systems and representing interactions between entities to uncover structural information of the domain. Traditionally, graph analytics workloads are challenging to efficiently scale (both strong and weak cases) on distributed memory due to the irregular memory-access driven nature (with little or no computations) of the methods. The structure of graphs and their relative distribution over the processing elements poses another level of complexity, making it difficult to attain sustainable scalability across platforms. In this paper, we discuss enhancements to TriC, a distributed-memory implementation of graph triangle counting using Message Passing Interface (MPI), which was featured in the 2020 Graph Challenge competition. We have made some incremental enhancements to TriC, primarily adopting a user-defined buffering strategy to overcome the startup problem for large graphs (by fixing the memory for intermediate data), and experimenting with probabilistic data structures such as bloom filter to improve the query response time for assessing edge existence, at the expense of increasing the overall false positive rate. These adjustments have led to a modest improvements in most cases, as compared to the previous version.

Graph Analytics, HPC↗

A New Vehicle-to-Grid System for Battery Charging exploiting IoT protocols

The continuously rising demand for electricity has prompted governments and industries to research more effective energy management systems. The Internet of Things paradigm is a valuable add-on for controlling and managing the energy appliances such as Plug-in Electrical Vehicles (PEV) charging stations. In this paper, we present a Demand Response implementation for PEV charging stations able to use Wireless Sensor Network technologies based on the Constrained Application Protocol (CoAP). We developed a self-service kiosk system by which the user can autonomously swipe his/her credit card and choose the charging station to enable. When a user plugs his/her vehicle to the station, s/he subscribes his availability to share a portion of its energy. When the grid requests a contribution from the PEVs, the kiosk sends a CoAP message to the available stations and the energy flow is inverted (Vehicle-to-Grid). At the end of the charging process, the user's credit card gets charged with a discounted bill.

Fachechi, Alessio↗

Exploiting Data Similarity to Reduce Memory Footprints

Memory size has long limited large-scale applications on high-performance computing (HPC) systems. Since compute nodes frequently do not have swap space, physical memory often limits problem sizes. Increasing core counts per chip and power density constraints, which limit the number of DIMMs per node, have exacerbated this problem. Further, DRAM constitutes a significant portion of overall HPC system cost. Therefore, instead of adding more DRAM to the nodes, mechanisms to manage memory usage more efficiently - preferably transparently - could increase effective DRAM capacity and thus the benefit of multicore nodes for HPC systems. MPI application processes often exhibit significant data similarity. These data regions occupy multiple physical locations across the individual rank processes within a multicore node and thus offer a potential savings in memory capacity. These regions, primarily residing in heap, are dynamic, which makes them difficult to manage statically. Our novel memory allocation library, SBLLmalloc, automatically identifies identical memory blocks and merges them into a single copy. SBLLmalloc does not require application or OS changes since we implement it as a user-level library. Overall, we demonstrate that SBLLmalloc reduces the memory footprint of a range of MPI applications by 32.03% on average and up to 60.87%. Further, SBLLmalloc supports problem sizes for IRS over 21.36% larger than using standard memory management techniques, thus significantly increasing effective system size. Similarly, SBLLmalloc requires 43.75% fewer nodes than standard memory management techniques to solve an AMG problem.

97 MATHEMATICS AND COMPUTING↗

Exploiting Performance Portability in Search Algorithms for Autotuning

Autotuning seeks the best configuration of an application by orchestrating hardware and software knobs that affect performance on a given machine. Autotuners adopt various search techniques to efficiently find the best configuration, but they often ignore lessons learned on one machine when tuning for another machine. We demonstrate that a surrogate model built from performance results on one machine can speedup the autotuning search by 1.6X to 130X on a variety of modern architectures.

Performance↗

Exploiting Fixed Charge to Control Schottky Barrier Height in Si|Al 2 O 3 |MoO x – based Tunnel Diodes

The insertion of a tunneling atomic layer deposited (ALD) Al 2 O 3 film between MoO x and p-type Si has been studied to investigate Schottky barrier height tunability with varied negative fixed charge density. This work seeks to increase the hole-selectivity of MoO x -based contacts through manipulation of interface fixed charge. Fixed charge density and interface trap state densities are determined as a function of alumina processing conditions in metal-oxide-semiconductor capacitors (MOSCAPs). Schottky barrier heights were determined from Mott-Schottky analysis of tunnel diodes. An alumina deposition temperature of 80°C and post-deposition annealing at 425°C yielded the highest magnitude of negative fixed charge density (-3.5 × 10 12 q . cm –2 ). High deposition temperature and/or post-deposition annealing produced the lowest interface trap state density (1 × 10 12 eV -1 . cm –2 ). On p-type silicon, Schottky barrier height minimization was not clearly correlated with increasing fixed charge density. However, on n-type silicon, a significant increase in Schottky barrier height was evident (~0.8 eV to > 1 eV) and is attributed to the large negative fixed charge. Here, the findings from this work indicate that Schottky barrier height in carrier selective contacts can be tuned by electrostatic engineering of the SiO x |Al 2 O 3 interface.

aluminum oxide↗

Distributed State Estimation Over Time-Varying Graphs: Exploiting the Age-of-Information

Here, we study the problem of designing a distributed observer for an LTI system over a time-varying communication graph. The limited existing work on this topic imposes various restrictions either on the observation model or on the sequence of communication graphs. In contrast, we propose a single-time-scale distributed observer that works under mild assumptions. Specifically, our communication model only requires strong-connectivity to be preserved over non-overlapping, contiguous intervals that are even allowed to grow unbounded over time. We show that under suitable conditions that bound the growth of such intervals, joint observability is sufficient to track the state of any discrete-time LTI system exponentially fast, at any desired rate. We also develop a variant of our algorithm that is provably robust to worst-case adversarial attacks, provided the sequence of graphs is sufficiently connected over time. The key to our approach is the notion of a "freshness-index" that keeps track of the age-of-information being diffused across the network. Such indices enable nodes to reject stale estimates of the state, and, in turn, contribute to stability of the error dynamics.

42 ENGINEERING↗

Exploiting Spatial Signatures of Power ENF Signal for Measurement Source Authentication

Electric Network Frequency (ENF) signals are the signatures of power systems that are either directly recorded from the power outlets or extracted from multimedia recordings near the electrical activities. Variations of ENF signals collected at different locations possess local environmental characteristics, which can be used as a potential fingerprint for authenticating measurements' source information. Within this paper is proposed a computational intelligence-based framework to recognize the source locations of power ENF signals within a distribution network in the US. To be more specific, a set of informative location-sensitive signatures from ENF measurements are initially extract with such measurements representative of local grid characteristics. Then these distinctive location-dependent signatures are further fed into a data mining algorithm yielding the “source-of-origin” of ENF measurements. Experimental results using ENF data at multiple intra-grid locations have validated the proposed methodology.

CUI, YI↗