Search NASA⌕ Search

SEARCH · Search NASA

Results for “Performance Optimized Space Networks”

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 199 records · Page 11

Fast Query-Optimized Kernel-Machine Classification

A recently developed algorithm performs kernel-machine classification via incremental approximate nearest support vectors. The algorithm implements support-vector machines (SVMs) at speeds 10 to 100 times those attainable by use of conventional SVM algorithms. The algorithm offers potential benefits for classification of images, recognition of speech, recognition of handwriting, and diverse other applications in which there are requirements to discern patterns in large sets of data. SVMs constitute a subset of kernel machines (KMs), which have become popular as models for machine learning and, more specifically, for automated classification of input data on the basis of labeled training data. While similar in many ways to k-nearest-neighbors (k-NN) models and artificial neural networks (ANNs), SVMs tend to be more accurate. Using representations that scale only linearly in the numbers of training examples, while exploring nonlinear (kernelized) feature spaces that are exponentially larger than the original input dimensionality, KMs elegantly and practically overcome the classic curse of dimensionality. However, the price that one must pay for the power of KMs is that query-time complexity scales linearly with the number of training examples, making KMs often orders of magnitude more computationally expensive than are ANNs, decision trees, and other popular machine learning alternatives. The present algorithm treats an SVM classifier as a special form of a k-NN. The algorithm is based partly on an empirical observation that one can often achieve the same classification as that of an exact KM by using only small fraction of the nearest support vectors (SVs) of a query. The exact KM output is a weighted sum over the kernel values between the query and the SVs. In this algorithm, the KM output is approximated with a k-NN classifier, the output of which is a weighted sum only over the kernel values involving k selected SVs. Before query time, there are gathered statistics about how misleading the output of the k-NN model can be, relative to the outputs of the exact KM for a representative set of examples, for each possible k from 1 to the total number of SVs. From these statistics, there are derived upper and lower thresholds for each step k. These thresholds identify output levels for which the particular variant of the k-NN model already leans so strongly positively or negatively that a reversal in sign is unlikely, given the weaker SV neighbors still remaining. At query time, the partial output of each query is incrementally updated, stopping as soon as it exceeds the predetermined statistical thresholds of the current step. For an easy query, stopping can occur as early as step k = 1. For more difficult queries, stopping might not occur until nearly all SVs are touched. A key empirical observation is that this approach can tolerate very approximate nearest-neighbor orderings. In experiments, SVs and queries were projected to a subspace comprising the top few principal- component dimensions and neighbor orderings were computed in that subspace. This approach ensured that the overhead of the nearest-neighbor computations was insignificant, relative to that of the exact KM computation.

Mazzoni, Dominic↗

Data Farming and Defense Applications

.Data farm,ing uses simulation modeling, high performance computing, experimental design and analysis to examine questions of interest with large possibility spaces. This methodology allows for the examination of whole landscapes of potential outcomes and provides the capability of executing enough experiments so that outliers might be captured and examined for insights. It can be used to conduct sensitivity studies, to support validation and verification of models, to iteratively optimize outputs using heuristic search and discovery, and as an aid to decision-makers in understanding complex relationships of factors. In this paper we describe efforts at the Naval Postgraduate School in developing these new and emerging tools. We also discuss data farming in the context of application to questions inherent in military decision-making. The particular application we illustrate here is social network modeling to support the countering of improvised explosive devices.

Horne, Gary↗

Decision Support Systems for Launch and Range Operations Using Jess

The virtual test bed for launch and range operations developed at NASA Ames Research Center consists of various independent expert systems advising on weather effects, toxic gas dispersions and human health risk assessment during space-flight operations. An individual dedicated server supports each expert system and the master system gather information from the dedicated servers to support the launch decision-making process. Since the test bed is based on the web system, reducing network traffic and optimizing the knowledge base is critical to its success of real-time or near real-time operations. Jess, a fast rule engine and powerful scripting environment developed at Sandia National Laboratory has been adopted to build the expert systems providing robustness and scalability. Jess also supports XML representation of knowledge base with forward and backward chaining inference mechanism. Facts added - to working memory during run-time operations facilitates analyses of multiple scenarios. Knowledge base can be distributed with one inference engine performing the inference process. This paper discusses details of the knowledge base and inference engine using Jess for a launch and range virtual test bed.

Thirumalainambi, Rajkumar↗

The Ground Flash Fraction Retrieval Algorithm Employing Differential Evolution: Simulations and Applications

The ability to estimate the fraction of ground flashes in a set of flashes observed by a satellite lightning imager, such as the future GOES-R Geostationary Lightning Mapper (GLM), would likely improve operational and scientific applications (e.g., severe weather warnings, lightning nitrogen oxides studies, and global electric circuit analyses). A Bayesian inversion method, called the Ground Flash Fraction Retrieval Algorithm (GoFFRA), was recently developed for estimating the ground flash fraction. The method uses a constrained mixed exponential distribution model to describe a particular lightning optical measurement called the Maximum Group Area (MGA). To obtain the optimum model parameters (one of which is the desired ground flash fraction), a scalar function must be minimized. This minimization is difficult because of two problems: (1) Label Switching (LS), and (2) Parameter Identity Theft (PIT). The LS problem is well known in the literature on mixed exponential distributions, and the PIT problem was discovered in this study. Each problem occurs when one allows the numerical minimizer to freely roam through the parameter search space; this allows certain solution parameters to interchange roles which leads to fundamental ambiguities, and solution error. A major accomplishment of this study is that we have employed a state-of-the-art genetic-based global optimization algorithm called Differential Evolution (DE) that constrains the parameter search in such a way as to remove both the LS and PIT problems. To test the performance of the GoFFRA when DE is employed, we applied it to analyze simulated MGA datasets that we generated from known mixed exponential distributions. Moreover, we evaluated the GoFFRA/DE method by applying it to analyze actual MGAs derived from low-Earth orbiting lightning imaging sensor data; the actual MGA data were classified as either ground or cloud flash MGAs using National Lightning Detection Network[TM] (NLDN) data. Solution error plots are provided for both the simulations and actual data analyses.

Koshak, William↗

Considerations for Isochronous Data Services over the Proximity-1 Space Link

Future mission concepts for robotic and human explorations will involve a high level of real time control/monitoring operations such as tele-operation for spacecraft rendezvous and surface mobile platforms carrying life-support equipments. The timely dissemination of voice, command, and real-time telemetry for monitoring and coordination purposes is critical for mission success. It is envisioned that future missions will require a network infrastructure capable of supporting isochronous data services. The CCSDS Proximity-1 Space Link Protocol1 could be used to provide isochronous service over the surface-to-Earth relay as well as "beyond-the-horizon" communications between distant Lunar or Mars surface elements. This paper will analyze the latency, jitter, and throughput performance of the Proximity-1 protocol for isochronous applications. In particular we will focus on constrained scenarios where the protocol operates in full-duplex mode, carrying isochronous traffic in one direction and error-controlled traffic in the other direction. We analyze the impact of the strict priority scheme in Proximity-1 on delay jitter and the impact of the isochronous traffic on the efficiency of the reliable data transfer in the other direction, and discuss methods for performance optimization. In general, jitter performance is driving by relative loading of isochronous traffic on the forward link compared to the acknowledgement traffic. Under light loading condition, the upper-bound of the delay jitter is the transmission duration of an acknowledgement frame on the forward link; for higher loading scenarios, the maximum jitter is scaled up by the inverse of the residual bandwidth, i.e., the spare capacity available in the forward link to carry isochronous traffic.

isochronous communications↗

Geothermal-integrated thermally anisotropic building envelope for energy and peak-demand reduction

Buildings consume large amounts of energy for heating and cooling, while peak electricity demand places significant stress on the power grid. This paper presents a reduced-order co-simulation framework and load-oriented supervisory control strategy for a geothermal-integrated thermally anisotropic building envelope with a ground loop (TABE+GL). In TABE+GL, a hydronic loop embedded in the building envelope is directly coupled with a geothermal ground loop, allowing for bidirectional heat exchange between the envelope, the ground, and the indoor environment. A hybrid co-simulation framework was established by coupling a reduced-order resistor–capacitor (RC) thermal network model with EnergyPlus augmented with GHEDesigner modules. The RC model generated feasible heat flux options under three operating modes, and EnergyPlus predicted sensible loads, energy use, and pump energy demand. At each simulation step, a supervisory control algorithm selected the optimal loop configuration and duty factor that maximizes useful TABE geothermal utilization without exceeding the predicted sensible load, thereby avoiding overheating or cooling. Case studies were conducted for Los Angeles, California, Charleston, South Carolina, and Denver, Colorado. Results showed that the proposed framework reduced HVAC electricity consumption by 43%–67%, natural gas use for space heating by 11%–38%, and peak electricity demand by 43%–88%. These results highlight the potential of combining reduced-order envelope modeling, direct geothermal coupling, and load-oriented supervisory control to improve whole building energy performance and reduce peak demand across diverse weather conditions.

Howard, Daniel [Southern Adventist University]↗

Modeling and Simulation Reliable Spacecraft On-Board Computing

The proposed project will investigate modeling and simulation-driven testing and fault tolerance schemes for Spacecraft On-Board Computing, thereby achieving reliable spacecraft telecommunication. A spacecraft communication system has inherent capabilities of providing multipoint and broadcast transmission, connectivity between any two distant nodes within a wide-area coverage, quick network configuration /reconfiguration, rapid allocation of space segment capacity, and distance-insensitive cost. To realize the capabilities above mentioned, both the size and cost of the ground-station terminals have to be reduced by using reliable, high-throughput, fast and cost-effective on-board computing system which has been known to be a critical contributor to the overall performance of space mission deployment. Controlled vulnerability of mission data (measured in sensitivity), improved performance (measured in throughput and delay) and fault tolerance (measured in reliability) are some of the most important features of these systems. The system should be thoroughly tested and diagnosed before employing a fault tolerance into the system. Testing and fault tolerance strategies should be driven by accurate performance models (i.e. throughput, delay, reliability and sensitivity) to find an optimal solution in terms of reliability and cost. The modeling and simulation tools will be integrated with a system architecture module, a testing module and a module for fault tolerance all of which interacting through a centered graphical user interface.

Park, Nohpill↗

Streamlining Ground Station Network Compatibility Test for Small Satellites

A team of eight subject matter experts at NASA Goddard Space Flight Center (GSFC) completed a Lean Six Sigma project to identify process improvements for the compatibility test process for small satellites planning to use the NASA Near Earth Network (NEN). Ground station network compatibility testing is designed to reduce the risk to missions by resolving issues between the spacecraft's flight communication and navigation components and the ground systems prior to launch. Compatibility testing, which consists of a series of tests performed over a period of months and documented in reports, is an important step meant to prevent post-launch anomalies that could lead to expensive troubleshooting or mission failure. Compared to traditional missions, small satellite missions typically have a smaller budget and compressed schedules, which can result in small satellite projects' willingness to accept the risk associated with less comprehensive compatibility testing. Optimization and or refinement of the compatibility test process for small satellite missions could alleviate some of the pressures inherent with these factors. The goal of the Lean Six Sigma project was to develop alternative scalable methods of compatibility testing for small satellites. The Lean Six Sigma approach and the results of the project are reviewed in this paper.

Streamlining↗

Superconducting Sensors for Microwave and Optical Photon-Starved Communications (Plenary)

NASA mission modeling indicates a desire for approximately a tenfold data improvement per decade from the Deep Space Network through the year 2040. Some of this improvement will come from aperture enhancement and antenna arraying, increased use of Ka-band over X-band, and high performance optical terminals (e.g. 12 m ground telescope). The remainder will depend on "disruptive" technologies. Deep-space communications differs from near earth communications. One way light travel times are measured in minutes rather than seconds and distances involved are large enough such that optical signals are photon limited and microwave signals have extremely low flux density. High frequency SQIF receivers and single photon detectors for optical communications will be described. Specifically, progress towards a "noiseless" receiver based on arrays of incommensurate area SQUIDs, and single photon counting detectors based on superconducting nanowires and kinetic inductance effects, will be discussed. Finally, the design of an optimal array of optical telescopes to emulate performance of a monolithic 12 m telescope will be outlined. In this case, optimal means minimizing the initial capital investment and operational cost while maintaining performance requirements of the deep-space link.

Romanofsky, Bob↗

A Global Optimization Methodology for Rocket Propulsion Applications

While the response surface method is an effective method in engineering optimization, its accuracy is often affected by the use of limited amount of data points for model construction. In this chapter, the issues related to the accuracy of the RS approximations and possible ways of improving the RS model using appropriate treatments, including the iteratively re-weighted least square (IRLS) technique and the radial-basis neural networks, are investigated. A main interest is to identify ways to offer added capabilities for the RS method to be able to at least selectively improve the accuracy in regions of importance. An example is to target the high efficiency region of a fluid machinery design space so that the predictive power of the RS can be maximized when it matters most. Analytical models based on polynomials, with controlled level of noise, are used to assess the performance of these techniques.

Source record↗

Localization of Ad-Hoc Lunar Constellations in Communication Failure Modes for Distributed Spacecraft Autonomy

As lunar missions increase in complexity inspired by NASA’s Artemis Program, they will require reliable and sufficient capability of the Position, Navigation, and Timing (PNT) system to support their scientific objectives. In addition, NASA's Commercial Lunar Payload Services (CLPS) program initiates the proliferation of public and private exploration partnerships using small satellites from commercial and private organizations, expanding traditionally confined low Earth orbit to be used for missions beyond geosynchronous orbit (Zucherman et al., 2022). Therefore, the Lunar PNT system is also required to provide navigation services compatible with the smaller platforms being sent by the public and private sectors, like CubeSats. However, traditional approaches to deep space missions’ navigation based on ground radio facilities have difficulties in providing sufficient support for the increasing number of users and communication at a distance from the Earth (Kaplev et al., 2022). In particular, the existing Lunar navigation technologies such as weak signal global positioning system (GPS) and deep space network (DSN) are not able to ensure operations of the upcoming small-scale Lunar missions due to their limitations in localization performance as well as capacity aspects. Another way to provide Lunar PNT service is to create a dedicated Lunar global navigation satellite system (GNSS) constellation, like GNSS systems on Earth. Space agencies like NASA, ESA, and JAXA are now developing the lunar communications relay and navigation systems (LCRNS) and Lunar navigation satellite systems (LNSS). In their systems, satellites will be deployed in moon orbits to provide the communication, positioning, navigation, and timing (CPNT) service at the lunar south pole region where the Artemis base camp will be expected (Murata et al., 2022). Meanwhile, common challenges considered in lunar PNT research arise from poor geometry of the terrestrial GNSS satellites when seen from the lunar user, highly perturbed lunar orbits, and limitations in power, size, and cost of the equipment on lunar satellites (Iiyama et al., 2023). It is also not clear if there will be enough Lunar users to support the cost and resources this would require as the Low-cost surface missions may not be able to support the large power, mass, and weight requirements that these navigation solutions entail (Niemoeller et al., 2022). As an alternative, existing Lunar science and exploration assets could be used to create a low-cost, autonomous, ad-hoc, and on-demand mission-centric Lunar PNT swarm capable of providing PNT services to these low-cost lunar missions (Hagenau et al., 2021). Introducing the non-dedicated and ad-hoc Lunar navigation constellation gives a way to provide PNT services on-demand. The non-dedicated swarm assets of Lunar constellations are designed to localize themselves with minimal interaction with Earth by adding cooperative autonomous localization to lunar missions, freeing up valuable bandwidth and ground segment resources. An autonomous localization of Lunar constellations is based on the concept of the decentralized PNT system with a distributed extended Kalman filter (DEKF) approach to state estimation for minimal onboard operating costs. In the distributed data processing algorithm, computation is broken down and assigned to each satellite, resulting in a considerably decreased computational amount while maintaining the accuracy of the orbit ephemeris and clock offsets as the result of centralized data processing (Wen et al., 2019). The DEKF requires spacecraft to perform two-way ranging operations with each other to communicate simultaneously, leveraging neighbor two-way intersatellite link (ISL) measurements such as pseudoranges to, and relative velocities between, visible satellites as sensor values (Frank et al., 2021). The Lunar autonomous PNT simulation (LAPS) demonstrated the feasibility of orbital asset localization among ad-hoc Lunar small-sat constellations based on the DEKF in Hagenau et al. (2021) and evaluated the matching algorithm proposed by Frank et al. (2021) in scheduling position estimation updates. In previous papers, all assets and measurements are assumed to be always available without consideration of the impact of intermittent and permanent communication failure. This study presents localization performance with increasing levels of network degradation for swarm assets and users to demonstrate the robustness of the decentralized Lunar PNT service in more realistic scenarios. Main issues arising from communication failure include spacecraft permanent or transient loss, antenna failures, message delays, etc. We tested four possible reasons for network degradation for 7 days in 21 satellites frozen with an altitude of 5500 km, evenly spaced around 3 circular, 40 inclination orbital planes where each spacecraft has two directional antennas. As anchor nodes with an independent estimate of their position are required in the DEKF approach, two ground nodes in each pole and one node in the gateway were implemented in the simulation. First, the most probable failure scenario involves the loss of a single spacecraft due to solar interference and technical malfunctions of the assets. Losing the availability of a single spacecraft means losing the two-way ISL measurement of the asset in the DEKF update. In order to provide the best possible quality of PNT service with limited time and resources, the distributed Lunar constellations must schedule the communication activities. The scheduler leverages mixed-integer linear programming (MILP) for the coordination and scheduling of the desired “as-needed” localization service (Niemoeller et al., 2022). We assume the scheduler has completely excluded the spacecraft information before the DEKF update in the failure scenario. When a random spacecraft has been turned off at a specific time, the robustness of the autonomous Lunar PNT system is evaluated. The simulation results give an 11.5% degradation in median position accuracy compared to the idealized performance excluding the asset loss. Second, a large number of assets may vanish due to major hardware problems or meteor strikes around the moon. A multiple spacecraft loss can degrade the localization performance very fast by losing the communication ability to do cross-plane measurements and in-plane measurements in a 3-plane constellation. When the matching-based scheduler is aware of ISL availability, we investigate a large number of in-plane and cross-plane asset vanishments both in close proximity and equally spaced throughout the orbital plane. According to the simulations, the loss of in-plane measurements gives 40.2% degradation while cross-plane measurements degrade 50.5% of asset localization performance among available assets. Therefore, it is concluded that cross-plane measurements are more important in improving the position estimation accuracy. Third, spacecraft failure information can be lost due to the internal message delay, resulting in the DEKF update scheduler to solve the matching problem with unavailable assets. The DEKF update cycle is comprised of network setup, communication, and computations where a global broadcast network and a 2-way ISL network setup take 6 minutes in total (Frank et al., 2021). Once the broadcast network successfully transmits and receives information, a random spacecraft may lose its availability right before solving the matching problem. This means the matching solution is no longer optimal, resulting in degradation in the localization performance. A numerical assessment shows the matching-based scheduler with knowing failure holds 11.5% of position accuracy degradation, whereas the scheduler without knowing failure gives 34% degraded localization performance without asset loss. Fourth, a transient loss of a single or multiple spacecraft may occur due to their antenna outages. After losing the two-way ISL availability for a few DEKF update cycles, the availability of spacecraft can easily be recovered as their states have been independently updated using measurements from anchor nodes. It is likely that the longer failure will result in worse localization performance. We have tested the transient failure of a random single asset for 30 min in the simulation, which is losing 3 update cycles in the DEKF system. From the simulation results, the position accuracy has been degraded to 4.84% which is better than the degraded localization performance of 11.5% from the permanent loss scenario among available assets. In conclusion, the autonomous Lunar PNT system based on the DEKF approach shows the ability to maintain resilience and robustness in the possible communication failure scenarios, ensuring that localization accuracy is preserved across various network degradation and outages. Future studies on investigating user localization performance near the South Pole and the broadcast network system will be continued in the following months.

Yeji Kim↗

Evaluation of GlassNet for physics-informed machine learning of glass stability and glass-forming ability

Glassy materials form the basis of many modern applications, including nuclear waste immobilization, touch-screen displays, and optical fibers, and also hold great potential for future medical and environmental applications. However, their structural complexity and large composition space make design and optimization challenging for certain applications. Of particular importance for glass processing and design is an estimate of a given composition's glass-forming ability (GFA). However, there remain many open questions regarding the underlying physical mechanisms of glass formation, especially in oxide glasses. It is apparent that a proxy for GFA would be highly useful in glass processing and design, but identifying such a surrogate property has proven itself to be difficult. While glass stability (GS) parameters have historically been used as a GFA surrogate, recent research has demonstrated that most of these parameters are not accurate predictors of the GFA of oxide glasses. Here, in this work, we explore the application of an open-source pre-trained neural network model, GlassNet, that can predict the characteristic temperatures necessary to compute GS with reasonable performance and assess the feasibility of using these physics-informed machine learning (PIML)-predicted GS parameters to estimate GFA. In doing so, we track the uncertainties at each step of the computation—from the original ML prediction errors to the compounding of errors during GS estimation, and finally to the final estimation of GFA. While GlassNet exhibits reasonable accuracy on all individual properties, we observe a large compounding of error in the combination of these individual predictions for the PIML prediction of GS, finding that random forest models offer similar accuracy to GlassNet. We also break down the performance of GlassNet on different glass families and find that the error in GS prediction is correlated with the error in crystallization peak temperature prediction. Lastly, we utilize this finding to assess the relationship between top-performing GS parameters and GFA for two ternary glass systems: sodium borosilicate and sodium iron phosphate glasses. We conclude that to obtain true ML predictive capability of GFA, significantly more data needs to be collected.

36 MATERIALS SCIENCE↗

Voltage source ac-to-dc converters for high-power transmitters

This work was done to optimize the design of the components used for the beam power supply, which is a component of the transmitters in the Deep Space Network (DSN). The major findings are: (1) the difference in regulation between a six-pulse and a twelve-pulse converter is at most 7 percent worse for the twelve-pulse converter; (2) the commutation overlap angle of a current source converter equals that of a voltage source converter with continuous line currents; (3) the sources of uncharacteristic harmonics are identified with SPICE simulation; (4) the use of an imperfect phase-shifting transformer for the twelve-pulse converter generates a harmonic at six times the line frequency; and (5) the assumptions usually made in analyzing converters can be relaxed with SPICE simulation. The results demonstrate the suitability of using SPICE simulation to obtain detailed performance predictions of ac-to-dc converters.

Cormier, R.↗

Improvements to Integrated Tradespace Analysis of Communications Architectures (ITACA) Network Loading Analysis Tool

NASA's SCENIC project aims to simplify and reduce the cost of space mission planning by replicating the analysis capabilities of commercially licensed software which are integrated with relevant analysis parameters specific to SCaN assets and SCaN supported user missions. SCENIC differs from current tools that perform similar analyses in that it 1) does not require any licensing fees, 2) will provide an all-in-one package for various analysis capabilities that normally requires add-ons or multiple tools to complete. As part of SCENIC's capabilities, the ITACA network loading analysis tool will be responsible for assessing the loading on a given network architecture and generating a network service schedule. ITACA will allow users to evaluate the quality of service of a given network architecture and determine whether or not the architecture will satisfy the mission's requirements. ITACA is currently under development, and the following improvements were made during the fall of 2017: optimization of runtime, augmentation of network asset pre-service configuration time, augmentation of Brent's method of root finding, augmentation of network asset FOV restrictions, augmentation of mission lifetimes, and the integration of a SCaN link budget calculation tool. The improvements resulted in (a) 25% reduction in runtime, (b) more accurate contact window predictions when compared to STK(Registered Trademark) contact window predictions, and (c) increased fidelity through the use of specific SCaN asset parameters.

analysis↗

Machine Learning Approach for Spatiotemporal Multivariate Optimization of Environmental Monitoring Sensor Locations

Abstract Long-term environmental monitoring is critical for managing the soil and groundwater at contaminated sites. Recent improvements in state-of-the-art sensor technology, communication networks, and artificial intelligence have created opportunities to modernize this monitoring activity for automated, fast, robust, and predictive monitoring. In such modernization, it is required that sensor locations be optimized to capture the spatiotemporal dynamics of all monitoring variables as well as to make it cost-effective. The legacy monitoring datasets of the target area are important to perform this optimization. In this study, we have developed a machine-learning approach to optimize sensor locations for soil and groundwater monitoring based on ensemble supervised learning and majority voting. For spatial optimization, Gaussian process regression (GPR) is used for spatial interpolation, while the majority voting is applied to accommodate the multivariate temporal dimension. Results show that the algorithms significantly outperform the random selection of the sensor locations for predictive spatiotemporal interpolation. While the method has been applied to a four-dimensional dataset (with two-dimensional space, time, and multiple contaminants), we anticipate that it can be generalizable to higher-dimensional datasets for environmental monitoring sensor location optimization.

Siddiquee, Masudur R.↗

Optimal filtering and generation of entangled photons for quantum applications in the presence of noise

Filtering is commonly used in quantum optics to reject noise photons, and also to enable interference between independent photons. However, filtering the joint spectrum of photon pairs can reduce the inherent coincidence probability or loss-independent heralding efficiency. Here we investigate filtering for multiphoton applications based on entanglement and interference (e.g., quantum teleportation). We multiplex C-band entangled photons and C-band classical communications into the same long-distance fibers, which enables scalable low-loss quantum networking but requires filtering of spontaneous Raman scattering noise from classical light. Using tunable-bandwidth filters, low-jitter detectors, and polarization filters, we distribute wavelength-degenerate time-bin entangled photons in the C band (1536.5 nm) over 25 km/25 km standard fibers (50 km) each carrying 10 Gbit/s C-band classical data signals. Narrow filtering enables milliwatt-level C-band power, which exceeds the power achieved by comparable studies by roughly an order of magnitude and could feasibly support terabit per second classical rates. We evaluate how performance depends on pump and filter bandwidths, multipair emission, filter shapes, loss, phase matching, and how quantum information is measured. We find a trade-off between reducing noise impact and increasing single-mode purity, and discuss mitigation methods toward optimal multiphoton applications. Importantly, these results apply to noise in free space and in quantum devices (sources, frequency converters, switches, detectors, etc.) and provide insight into filter-induced degradation of single-photon purity and rates even in noise-free environments.

Thomas, Jordan M. [Fermilab; Northwestern U.]↗

Algorithms for Automatic Alignment of Arrays

Aggregate data objects (such as arrays) are distributed across the processor memories when compiling a data-parallel language for a distributed-memory machine. The mapping determines the amount of communication needed to bring operands of parallel operations into alignment with each other. A common approach is to break the mapping into two stages: an alignment that maps all the objects to an abstract template, followed by a distribution that maps the template to the processors. This paper describes algorithms for solving the various facets of the alignment problem: axis and stride alignment, static and mobile offset alignment, and replication labeling. We show that optimal axis and stride alignment is NP-complete for general program graphs, and give a heuristic method that can explore the space of possible solutions in a number of ways. We show that some of these strategies can give better solutions than a simple greedy approach proposed earlier. We also show how local graph contractions can reduce the size of the problem significantly without changing the best solution. This allows more complex and effective heuristics to be used. We show how to model the static offset alignment problem using linear programming, and we show that loop-dependent mobile offset alignment is sometimes necessary for optimum performance. We describe an algorithm with for determining mobile alignments for objects within do loops. We also identify situations in which replicated alignment is either required by the program itself or can be used to improve performance. We describe an algorithm based on network flow that replicates objects so as to minimize the total amount of broadcast communication in replication.

Chatterjee, Siddhartha↗

Mathematical Inversion of Lightning Data: Techniques and Applications

A survey of some interesting mathematical inversion studies dealing with radio, optical, and electrostatic measurements of lightning are presented. A discussion of why NASA is interested in lightning, what specific physical properties of lightning are retrieved, and what mathematical techniques are used to perform the retrievals are discussed. In particular, a relatively new multi-station VHF time-of-arrival (TOA) antenna network is now on-line in Northern Alabama and will be discussed. The network, called the Lightning Mapping Array (LMA), employs GPS timing and detects VHF radiation from discrete segments (effectively point emitters) that comprise the channel of lightning strokes within cloud and ground flashes. The LMA supports on-going ground-validation activities of the low Earth orbiting Lightning Imaging Sensor (LIS) satellite developed at NASA Marshall Space Flight Center (MSFC) in Huntsville, Alabama. The LMA also provides detailed studies of the distribution and evolution of thunderstorms and lightning in the Tennessee Valley, and offers interesting comparisons with other meteorological/geophysical datasets. In order to take full advantage of these benefits, it is essential that the LMA channel mapping accuracy (in both space and time) be fully characterized and optimized. A new channel mapping retrieval algorithm is introduced for this purpose. To characterize the spatial distribution of retrieval errors, the algorithm has been applied to analyze literally tens of millions of computer-simulated lightning VHF point sources that have been placed at various ranges, azimuths, and altitudes relative to the LMA network. Statistical results are conveniently summarized in high-resolution, color-coded, error maps.

Koshak, William↗