Search NASA⌕ Search

SEARCH · Search NASA

Results for “POLICIES”

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 325 records · Page 18
All sourcesNASA NTRSDOE OSTI
NASA NTRS2023

Oregon Coast Range Ecological Conservation: Mapping Recent Logging Within Drinking Watersheds of Oregon’s Coastal Range to Support Future Resource Management Policies

Logging operations are widespread across the Oregon Coast Range and conventional logging practices pose a risk of contamination to surface water quality. The NASA DEVELOP Oregon Coast Ecological Conservation team partnered with nonprofit Oregon Wild to quantify the extent of clearcutting and commercial thinning in 80 Coast Range drinking watersheds between 2000 and 2022. This project used all available Landsat data from 1997 through June 2023 in Google Earth Engine. Sensors used include Landsat 5 Thematic Mapper, Landsat 7 Enhanced Thematic Mapper Plus, Landsat 8 Operational Land Imager, and Landsat 9 Operational Land Imager-2. The Continuous Change Detection and Classification (CCDC) algorithm was used with Landsat observations to identify clearcutting patches. Percent change in summer median Landsat Normalized Difference Vegetation Index (NDVI) images were used to identify areas of forest disturbance including commercial thinning. The team concluded that logging, including both clearcutting and commercial thinning, impacted 31% of forested area in drinking watersheds and the intensity of logging remained consistent from year to year. Clearcutting occurred primarily on private land while commercial thinning occurred primarily on state and federal lands. This study showed that CCDC effectively identifies clearcutting, and percent change in NDVI successfully identifies disturbances including commercial thinning. Key constraints included the lack of field validation data and the inability to attribute disturbances to logging with certainty. Ultimately, this study identified the drinking watersheds and communities most likely to be impacted by logging activity. These results can inform legislation aimed at balancing the commercial and environmental benefits of forestlands.

Logging↗
NASA NTRSDate not supplied

How the Open Data Policy of the Landsat Program Has Advanced Our Understanding of Environmental Change

A time series is a sequence of observations of a phenomenon taken sequentially in time. A crucial characteristic of a time series is the dependence among adjacent observations – techniques for analyzing this dependence are referred to as time series analysis. This analytical approach enables us to predict or forecast future values of a time series, study the impact of various inputs on the observed phenomenon, and examine interrelationships among related time series variables. Within the geographical sciences, time series analysis has historically been limited to coarse-resolution satellite data, as constructing time series of data suitable for studying land cover and land use dynamics, such as Landsat data, were prohibitively costly. A transformative shift occurred in 2008 when the U.S. Government decided to make free and open all past and future data collected by the Landsat satellite program. The decision brought about a paradigm shift away from analyzing individual images or observations to continuous monitoring in time. Of particular relevance to environmental remote sensing is the ability to forecast observations – if we can predict how future observations should behave, we can infer information about how the land surface is changing. In this presentation, we will examine literature examples that showcase scientific gains enabled by time series analysis of satellite data. We will delve into how the analysis of dense time series of satellite data revealed that overall rate of forest disturbance in the Amazon has increased despite a reduction in deforestation; how different types of forest degradation, previously unquantified, are now being accurately assessed in the Caucasus region; and how we now can study the highly dynamic and intricate patterns of shifting cultivation in Southeast Asia.

Pontus Olofsson↗
NASA NTRS1985

Implicit dual control for general stochastic systems

A new implicit dual technique is presented for stochastic adaptive control synthesis. In this technique, denoted as the method of utility costs (MOUC), a new control policy is derived from a known starting control policy by using a single iteration in time-varying policy space. An important result is that the new control policy yields a corresponding improvement in adaptive performance relative to the known starting policy. Since the starting policy can be chosen arbitrarily, the new policy has potentially superior performance relative to any existing design. Unlike other implicit dual designs, the MOUC can be applied to systems having constrained inputs, discontinuities, discrete valued disturbances, as well as in situations where the variances of the associated process statistics are large. A numerical example is given in which a controller is synthesized to provide improved performance relative to the Open-Loop Feedback policy of Dreyfus.

Bayard, D. S.↗
NASA NTRS1986

Dynamic remapping of parallel computations with varying resource demands

A large class of computational problems is characterized by frequent synchronization, and computational requirements which change as a function of time. When such a problem must be solved on a message passing multiprocessor machine, the combination of these characteristics lead to system performance which decreases in time. Performance can be improved with periodic redistribution of computational load; however, redistribution can exact a sometimes large delay cost. We study the issue of deciding when to invoke a global load remapping mechanism. Such a decision policy must effectively weigh the costs of remapping against the performance benefits. We treat this problem by constructing two analytic models which exhibit stochastically decreasing performance. One model is quite tractable; we are able to describe the optimal remapping algorithm, and the optimal decision policy governing when to invoke that algorithm. However, computational complexity prohibits the use of the optimal remapping decision policy. We then study the performance of a general remapping policy on both analytic models. This policy attempts to minimize a statistic W(n) which measures the system degradation (including the cost of remapping) per computation step over a period of n steps. We show that as a function of time, the expected value of W(n) has at most one minimum, and that when this minimum exists it defines the optimal fixed-interval remapping policy. Our decision policy appeals to this result by remapping when it estimates that W(n) is minimized. Our performance data suggests that this policy effectively finds the natural frequency of remapping. We also use the analytic models to express the relationship between performance and remapping cost, number of processors, and the computation's stochastic activity.

Nicol, D. M.↗
NASA NTRS1989

Analysis of random drop for gateway congestion control

Lately, the growing demand on the Internet has prompted the need for more effective congestion control policies. Currently No Gateway Policy is used to relieve and signal congestion, which leads to unfair service to the individual users and a degradation of overall network performance. Network simulation was used to illustrate the character of Internet congestion and its causes. A newly proposed gateway congestion control policy, called Random Drop, was considered as a promising solution to the pressing problem. Random Drop relieves resource congestion upon buffer overflow by choosing a random packet from the service queue to be dropped. The random choice should result in a drop distribution proportional to the bandwidth distribution among all contending TCP connections, thus applying the necessary fairness. Nonetheless, the simulation experiments demonstrate several shortcomings with this policy. Because Random Drop is a congestion control policy, which is not applied until congestion has already occurred, it usually results in a high drop rate that hurts too many connections including well-behaved ones. Even though the number of packets dropped is different from one connection to another depending on the buffer utilization upon overflow, the TCP recovery overhead is high enough to neutralize these differences, causing unfair congestion penalties. Besides, the drop distribution itself is an inaccurate representation of the average bandwidth distribution, missing much important information about the bandwidth utilization between buffer overflow events. A modification of Random Drop to do congestion avoidance by applying the policy early was also proposed. Early Random Drop has the advantage of avoiding the high drop rate of buffer overflow. The early application of the policy removes the pressure of congestion relief and allows more accurate signaling of congestion. To be used effectively, algorithms for the dynamic adjustment of the parameters of Early Random Drop to suite the current network load must still be developed.

Hashem, Emam Salaheddin↗