Search NASA⌕ Search

SEARCH · Search NASA

Results for “allocation methods”

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 73 records · Page 4

Method for resource control in parallel environments using program organization and run-time support

A system and method for dynamic scheduling and allocation of resources to parallel applications during the course of their execution. By establishing well-defined interactions between an executing job and the parallel system, the system and method support dynamic reconfiguration of processor partitions, dynamic distribution and redistribution of data, communication among cooperating applications, and various other monitoring actions. The interactions occur only at specific points in the execution of the program where the aforementioned operations can be performed efficiently.

Ekanadham, Kattamuri↗

Method for resource control in parallel environments using program organization and run-time support

A system and method for dynamic scheduling and allocation of resources to parallel applications during the course of their execution. By establishing well-defined interactions between an executing job and the parallel system, the system and method support dynamic reconfiguration of processor partitions, dynamic distribution and redistribution of data, communication among cooperating applications, and various other monitoring actions. The interactions occur only at specific points in the execution of the program where the aforementioned operations can be performed efficiently.

Ekanadham, Kattamuri↗

Two phase sampling for wheat acreage estimation

A two phase LANDSAT-based sample allocation and wheat proportion estimation method was developed. This technique employs manual, LANDSAT full frame-based wheat or cultivated land proportion estimates from a large number of segments comprising a first sample phase to optimally allocate a smaller phase two sample of computer or manually processed segments. Application to the Kansas Southwest CRD for 1974 produced a wheat acreage estimate for that CRD within 2.42 percent of the USDA SRS-based estimate using a lower CRD inventory budget than for a simulated reference LACIE system. Factor of 2 or greater cost or precision improvements relative to the reference system were obtained.

Thomas, R. W.↗

Two phase sampling for wheat acreage estimation

A two-phase Landsat-based sample allocation and wheat proportion estimation method was developed. The technique employs manual, Landsat full frame-based wheat or cultivated land proportion estimates from a large number of segments comprising a first sample phase to optimally allocate a small phase-two sample of computer or manually processed segments. Proportion estimates from each phase are then linked by regression or probability proportional to estimated size estimators to provide wheat proportion estimates and standard errors by reporting unit. Application to the Kansas Southwest CRD (Crop Reporting District) for 1974 produced a wheat acreage estimate for that CRD within 2.42% of the USDA SRS-based estimate using a lower CRD inventory budget than for a simulated reference LACIE (Large Area Crop Inventory Experiment) system.

Thomas, R. W.↗

Two phase sampling for wheat acreage estimation

A two phase Landsat-based sample allocation and wheat proportion estimation method was developed. This technique employs manual, Landsat full frame-based wheat or cultivated land proportion estimates from a large number of segments comprising a first sample phase to optimally allocate a smaller phase two sample of computer or manually processed segments. Application to the Kansas Southwest CRD for 1974 produced a wheat acreage estimate for that CRD within 2.42 percent of the USDA SRS-based estimate using a lower CRD inventory budget than for a simulated reference LACIE system. Factor of 2 or greater cost or precision improvements relative to the reference system were obtained

Thomas, R. W.↗

Parametric State Space Structuring

Structured approaches based on Kronecker operators for the description and solution of the infinitesimal generator of a continuous-time Markov chains are receiving increasing interest. However, their main advantage, a substantial reduction in the memory requirements during the numerical solution, comes at a price. Methods based on the "potential state space" allocate a probability vector that might be much larger than actually needed. Methods based on the "actual state space", instead, have an additional logarithmic overhead. We present an approach that realizes the advantages of both methods with none of their disadvantages, by partitioning the local state spaces of each submodel. We apply our results to a model of software rendezvous, and show how they reduce memory requirements while, at the same time, improving the efficiency of the computation.

Ciardo, Gianfranco↗

Application of Sliding Mode Methods to the Design of Reconfigurable Flight Control Systems

Observer-based sliding mode control is investigated for application to aircraft reconfigurable flight control. A comprehensive overview of reconfigurable flight control is given, including, a review of the current state-of-the-art within the subdisciplines of fault detection, parameter identification, adaptive control schemes, and dynamic control allocation. Of the adaptive control methods reviewed, sliding mode control (SMC) appears very promising due its property of invariance to matched uncertainty. An overview of sliding mode control is given and its remarkable properties are demonstrated by example. Sliding mode methods, however, are difficult to implement because unmodeled parasitic dynamics cause immediate and severe instability. This presents a challenge for all practical applications with limited bandwidth actuators. One method to deal with parasitic dynamics is the use of an asymptotic observer in the feedback path. Observer-based SMC is investigated, and a method for selecting observer gains is offered. An additional method for shaping the feedback loop using a filter is also developed. It is shown that this SMC prefilter is equivalent to a form of model reference hedging. A complete design procedure is given which takes advantage of the sliding mode boundary layer to recast the SMC as a linear control law. Frequency domain loop shaping is then used to design the sliding manifold. Finally, three aircraft applications are demonstrated. An F-18/HARV is used to demonstrate a SISO pitch rate tracking controller. It is also used to demonstrate a MIMO lateral-directional roll rate tracking controller. The last application is a full linear six degree-of-freedom advanced tailless fighter model. The observer-based SMC is seen to provide excellent tracking with superior robustness to parameter changes and actuator failures.

Wells, Scott R.↗

Determining optical depth in different parts of the Fraunhofer line contour

The method of approximate determination of the optical depth tau in the profile of the Fraunhofer line is considered. In the method the observed profile and allocation of tau to the temperature in the photosphere must be known. If the source function B prime (tau) in the line seems not to be equal to the Planck function, the dependence B prime (tau) on tau is needed. The method for the determination of B prime (tau) using the center-to-limb observations of the central intensities of the line is suggested.

Gurtovenko, E. A.↗

Transmission Scheduling and Routing Algorithms for Delay Tolerant Networks

The challenges of data processing, transmission scheduling and routing within a space network present a multi-criteria optimization problem. Long delays, intermittent connectivity, asymmetric data rates and potentially high error rates make traditional networking approaches unsuitable. The delay tolerant networking architecture and protocols attempt to mitigate many of these issues, yet transmission scheduling is largely manually configured and routes are determined by a static contact routing graph. A high level of variability exists among the requirements and environmental characteristics of different missions, some of which may allow for the use of more opportunistic routing methods. In all cases, resource allocation and constraints must be balanced with the optimization of data throughput and quality of service. Much work has been done researching routing techniques for terrestrial-based challenged networks in an attempt to optimize contact opportunities and resource usage. This paper examines several popular methods to determine their potential applicability to space networks.

Space Networking↗

A mission planning concept and mission planning system for future manned space missions

The international character of future manned space missions will compel the involvement of several international space agencies in mission planning tasks. Additionally, the community of users requires a higher degree of freedom for experiment planning. Both of these problems can be solved by a decentralized mission planning concept using the so-called 'envelope method,' by which resources are allocated to users by distributing resource profiles ('envelopes') which define resource availabilities at specified times. The users are essentially free to plan their activities independently of each other, provided that they stay within their envelopes. The new developments were aimed at refining the existing vague envelope concept into a practical method for decentralized planning. Selected critical functions were exercised by planning an example, founded on experience acquired by the MSCC during the Spacelab missions D-1 and D-2. The main activity regarding future mission planning tasks was to improve the existing MSCC mission planning system, using new techniques. An electronic interface was developed to collect all formalized user inputs more effectively, along with an 'envelope generator' for generation and manipulation of the resource envelopes. The existing scheduler and its data base were successfully replaced by an artificial intelligence scheduler. This scheduler is not only capable of handling resource envelopes, but also uses a new technology based on neuronal networks. Therefore, it is very well suited to solve the future scheduling problems more efficiently. This prototype mission planning system was used to gain new practical experience with decentralized mission planning, using the envelope method. In future steps, software tools will be optimized, and all data management planning activities will be embedded into the scheduler.

Wickler, Martin↗

8-PSK Signaling over non-linear satellite channels

Space agencies are under pressure to utilize better bandwidth-efficient communication methods due to the actual allocated frequency bands becoming more congested. Also budget reductions is another problem that the space agencies must deal with. This budget constraint results in simpler spacecraft carrying less communication capabilities and also the reduction in staff to capture data in the earth stations. It is then imperative that the most bandwidth efficient communication methods be utilized. This thesis presents a study of 8-ary Phase Shift Keying (8PSK) modulation with respect to bandwidth, power efficiency, spurious emissions and interference susceptibility over a non-linear satellite channel.

Horan, Sheila B.↗

Generation and exploration of aggregation abstractions for scheduling and resource allocation

This paper presents research on the abstraction of computational theories for scheduling and resource allocation. The paper describes both theory and methods for the automated generation of aggregation abstractions and approximations in which detailed resource allocation constraints are replaced by constraints between aggregate demand and capacity. The interaction of aggregation abstraction generation with the more thoroughly investigated abstractions of weakening operator preconditions is briefly discussed. The purpose of generating abstract theories for aggregated demand and resources includes: answering queries about aggregate properties, such as gross feasibility; reducing computational costs by using the solution of aggregate problems to guide the solution of detailed problems; facilitating reformulating theories to approximate problems for which there are efficient problem-solving methods; and reducing computational costs of scheduling by providing more opportunities for variable and value-ordering heuristics to be effective. Experiments are being developed to characterize the properties of aggregations that make them cost effective. Both abstract and concrete theories are represented in a variant of first-order predicate calculus, which is a parameterized multi-sorted logic that facilitates specification of large problems. A particular problem is conceptually represented as a set of ground sentences that is consistent with a quantified theory.

Lowry, Michael R.↗

A method for screening of plant species for space use

A cost-effective methodology which monitors numerous dynamic aspects of carbon assimilation and allocation kinetics in live, intact plants is discussed. Analogous methods can apply to nitrogen uptake and allocation. This methodology capitalizes on the special properties of the short-lived, positron-gamma emitting isotope C-11 especially when applied as CO2-11 in a special extended square wave (ESW) pattern. The 20.4 minute half-life allows for repeated or continuous experiments on the same plant over periods of minutes, hours, days, or weeks. The steady-state isotope equilibrium approached during the ESW experiments, and the parameters which can be analyzed by this technique are also direct results of that short half-life. Additionally, the paired .511 MeV gamma rays penetrate any amount of tissue and their 180 deg opposite orientation provides good collimation and allows coincidence counting which nearly eliminates background.

Goeschl, J. D.↗

Parallel Gaussian elimination of a block tridiagonal matrix using multiple microcomputers

The solution of a block tridiagonal matrix using parallel processing is demonstrated. The multiprocessor system on which results were obtained and the software environment used to program that system are described. Theoretical partitioning and resource allocation for the Gaussian elimination method used to solve the matrix are discussed. The results obtained from running 1, 2 and 3 processor versions of the block tridiagonal solver are presented. The PASCAL source code for these solvers is given in the appendix, and may be transportable to other shared memory parallel processors provided that the synchronization outlines are reproduced on the target system.

Blech, Richard A.↗

Patrol force allocation for law enforcement: An introductory planning guide

Previous and current methods for analyzing police patrol forces are reviewed and discussed. The steps in developing an allocation analysis procedure are defined, including the prediction of the rate of calls for service, determination of the number of patrol units needed, designing sectors, and analyzing dispatch strategies. Existing computer programs used for this purpose are briefly described, and some results of their application are given.

Sohn, R. L.↗

A methodology for mapping forest latent heat flux densities using remote sensing

Surface temperatures and reflectances of an upper elevation Sierran mixed conifer forest were monitored using the Thematic Mapper Simulator sensor during the summer of 1985 in order to explore the possibility of using remote sensing to determine the distribution of solar energy on forested watersheds. The results show that the method is capable of quantifying the relative energy allocation relationships between the two cover types defined in the study. It is noted that the method also has the potential to map forest latent heat flux densities.

Pierce, Lars L.↗

An exploration of function analysis and function allocation in the commercial flight domain

The applicability is explored of functional analysis methods to support cockpit design. Specifically, alternative techniques are studied for ensuring an effective division of responsibility between the flight crew and automation. A functional decomposition is performed of the commercial flight domain to provide the information necessary to support allocation decisions and demonstrate methodology for allocating functions to flight crew or to automation. The function analysis employed 'bottom up' and 'top down' analyses and demonstrated the comparability of identified functions, using the 'lift off' segment of the 'take off' phase as a test case. The normal flight mission and selected contingencies were addressed. Two alternative methods for using the functional description in the allocation of functions between man and machine were investigated. The two methods were compared in order to ascertain their relative strengths and weaknesses. Finally, conclusions were drawn regarding the practical utility of function analysis methods.

Mcguire, James C.↗