Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “heuristic”

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 181 records · Page 10

Inter-Domain Fusion for Enhanced Intrusion Detection in Power Systems: An Evidence Theoretic and Meta-Heuristic Approach

False alerts due to misconfigured or compromised intrusion detection systems (IDS) in industrial control system (ICS) networks can lead to severe economic and operational damage. However, research using deep learning to reduce false alerts often requires the physical and cyber sensor data to be trustworthy. Implicit trust is a major problem for artificial intelligence or machine learning (AI/ML) in cyber-physical system (CPS) security, because when these solutions are most urgently needed is also when they are most at risk (e.g., during an attack). To address this, the Inter-Domain Evidence theoretic Approach for Inference (IDEA-I) is proposed that reframes the detection problem as how to make good decisions given uncertainty. Specifically, an evidence theoretic approach leveraging Dempster–Shafer (DS) combination rules and their variants is proposed for reducing false alerts. A multi-hypothesis mass function model is designed that leverages probability scores obtained from supervised-learning classifiers. Using this model, a location-cum-domain-based fusion framework is proposed to evaluate the detector’s performance using disjunctive, conjunctive, and cautious conjunctive rules. The approach is demonstrated in a cyber-physical power system testbed, and the classifiers are trained with datasets from Man-In-The-Middle attack emulation in a large-scale synthetic electric grid. For evaluating the performance, we consider plausibility, belief, pignistic, and general Bayesian theorem-based metrics as decision functions. To improve the performance, a multi-objective-based genetic algorithm is proposed for feature selection considering the decision metrics as the fitness function. Finally, we present a software application to evaluate the DS fusion approaches with different parameters and architectures.

42 ENGINEERING↗

Heuristic approach to the development of ratings and tactics applicable to the one-on-one aerial combat (dogfight) encounter

Computer simulations of the one-on-one aerial combat encounter are generated under the control of specified guidance laws. Given an initial state, the vehicle and atmospheric characteristics, and the guidance laws, the aerial combat encounter is simulated by forward integration of the two vehicles' motions. The development of a combat guidance law which converts positional advantage into an improved firing opportunity is reported. A combination of lag, line of sight, and lead pursuit steering paths are followed in the guidance law. The law is based on steering error, target angle-off and the relative velocities. It readily is automated either as an onboard aid to manned aircraft pilots or as a combat guidance law for unmanned vehicles.

Hague, D. S.↗

A heuristic mathematical model for the dynamics of sensory conflict and motion sickness

The etiology of motion sickness is explained in terms of a qualitatively formulated sensory conflict hypothesis. By consideration of the information processing task faced by the central nervous system in estimating body spatial orientation and in controlling active body movement using an internal model referenced control strategy, a mathematical model for sensory conflict generation is developed. The model postulates a major dynamic functional role for sensory conflict signals in movement control, as well as in sensory-motor adaptation. It accounts for the role of active movement in creating motion sickness symptoms in some experimental circumstances, and in alleviating them in others. The relationship between motion sickness produced by sensory rearrangement and that resulting from external motion disturbances is explicitly defined. A nonlinear conflict averaging model is proposed which describes dynamic aspects of experimentally observed subjective discomfort sensation, and suggests resulting behaviors.

Oman, C. M.↗

A heuristic mathematical model for the dynamics of sensory conflict and motion sickness

The etiology of motion sickness is now usually explained in terms of a qualitatively formulated sensory conflict hypothesis. By consideration of the information processing task faced by the central nervous system in estimating body spatial orientation and in controlling active body movement using an internal model referenced control strategy, a mathematical model for sensory conflict generation is developed. The model postulates a major dynamic functional role for sensory conflict signals in movement control, as well as in sensory motor adaptation. It accounts for the role of active movement in creating motion sickness symptoms in some experimental circumstances, and in alleviating them in others. The relationship between motion sickness produced by sensory rearrangement and that resulting from external motion disturbances is explicitly defined. A nonlinear conflict averaging model describes dynamic aspects of experimentally observed subjective discomfort sensation, and suggests resulting behavior.

Oman, C. M.↗

Heuristic explanation of journal bearing instability

A fluid-filled journal bearing is viewed as a powerful pump circulating fluid around the annular space between the journal and the bearing. A small whirling motion of the journal generates a wave of thickness variation progressing around the channel. The hypothesis that the fluid flow drives the whirl whenever the mean of the pumped fluid velocity is greater than the peripheral speed of the thickness variation wave is discussed and compared with other simple explanations of journal bearing instability. It is shown that for non-cavitation long bearings the hypothesis predicts instability onset correctly for unloaded bearings but gradually overpredicts the onset speed as the load is increased.

Crandall, S. H.↗

A heuristic mathematical model for the dynamics of sensory conflict and motion sickness

By consideration of the information processing task faced by the central nervous system in estimating body spatial orientation and in controlling active body movement using an internal model referenced control strategy, a mathematical model for sensory conflict generation is developed. The model postulates a major dynamic functional role for sensory conflict signals in movement control, as well as in sensory-motor adaptation. It accounts for the role of active movement in creating motion sickness symptoms in some experimental circumstance, and in alleviating them in others. The relationship between motion sickness produced by sensory rearrangement and that resulting from external motion disturbances is explicitly defined. A nonlinear conflict averaging model is proposed which describes dynamic aspects of experimentally observed subjective discomfort sensation, and suggests resulting behaviours. The model admits several possibilities for adaptive mechanisms which do not involve internal model updating. Further systematic efforts to experimentally refine and validate the model are indicated.

Oman, C. M.↗

Heuristic search in robot configuration space using variable metric

A method to generate obstacle free trajectories for both mobile robots and linked robots is proposed. The approach generates the shortest paths in a configuration space. The metric in the configuration space can be adjusted to obtain a tradeoff between safety and velocity by imposing extra costs on paths near obstacles.

Verwer, Ben J. H.↗

Iterative-deepening heuristic search for optimal and semi-optimal resource allocation

It is demonstrated that when iterative-deepening A asterisk (IDA asterisk) is applied to one type of resource allocation problem, it uses far less storage than A asterisk, but opens far more nodes and thus has unacceptable time complexity. This is shown to be due, at least in part, to the low-valued effective branching factor that is a characteristic of problems with real-valued cost functions. The semi-optimal, epsilon-admissible IDA asterisk sub epsilon search algorithm that the authors described was shown to open fewer nodes than both A asterisk and IDA asterisk with storage complexity proportional to the depth of the search tree.

Bridges, Susan M.↗

Research on blackboard architectures at the Heuristic Programming Project (HPP)

Researchers are entering the second decade of research in the Blackboard problem solving framework with focus in the following areas: (1) extensions to the basic concepts implemented in AGE-1 to address, for example, reasoning with uncertain data; (2) a new architecture and development environment, BB1, that implements methods for explicity controlling the reasoning; and (3) the design of and experimentation with multiprocessor architectures using the Blackboard as an organizing framework. A summary of these efforts is presented.

Nii, H. Penny↗

Heuristic decomposition for non-hierarchic systems

Design and optimization is substantially more complex in multidisciplinary and large-scale engineering applications due to the existing inherently coupled interactions. The paper introduces a quasi-procedural methodology for multidisciplinary optimization that is applicable for nonhierarchic systems. The necessary decision-making support for the design process is provided by means of an embedded expert systems capability. The method employs a decomposition approach whose modularity allows for implementation of specialized methods for analysis and optimization within disciplines.

Bloebaum, Christina L.↗

Formal and heuristic system decomposition methods in multidisciplinary synthesis

The multidisciplinary interactions which exist in large scale engineering design problems provide a unique set of difficulties. These difficulties are associated primarily with unwieldy numbers of design variables and constraints, and with the interdependencies of the discipline analysis modules. Such obstacles require design techniques which account for the inherent disciplinary couplings in the analyses and optimizations. The objective of this work was to develop an efficient holistic design synthesis methodology that takes advantage of the synergistic nature of integrated design. A general decomposition approach for optimization of large engineering systems is presented. The method is particularly applicable for multidisciplinary design problems which are characterized by closely coupled interactions among discipline analyses. The advantage of subsystem modularity allows for implementation of specialized methods for analysis and optimization, computational efficiency, and the ability to incorporate human intervention and decision making in the form of an expert systems capability. The resulting approach is not a method applicable to only a specific situation, but rather, a methodology which can be used for a large class of engineering design problems in which the system is non-hierarchic in nature.

Bloebaum, Christina L.↗

Empirical comparison of heuristic load distribution in point-to-point multicomputer networks

The study compared several load placement algorithms using instrumented programs and synthetic program models. Salient characteristics of these program traces (total computation time, total number of messages sent, and average message time) span two orders of magnitude. Load distribution algorithms determine the initial placement for processes, a precursor to the more general problem of load redistribution. It is found that desirable workload distribution strategies will place new processes globally, rather than locally, to spread processes rapidly, but that local information should be used to refine global placement.

Grunwald, Dirk C.↗

Task Assignment Heuristics for Distributed CFD Applications

CFD applications require high-performance computational platforms: 1. Complex physics and domain configuration demand strongly coupled solutions; 2. Applications are CPU and memory intensive; and 3. Huge resource requirements can only be satisfied by teraflop-scale machines or distributed computing.

Lopez-Benitez, N.↗

Sensor Web Architectural Concepts and Implementation Challenges - An Heuristic Approach

There is a significant interest in the Earth Science remote sensing community to increase the number of observations. The obvious reasons for such a push is to improve the temporal and surface coverage of measurements. However, there is little analysis available in terms of benefits, costs and optimized set of sensors needed to make these necessary observations. In reality, this is a complex problem that should be carefully studied and balanced over many boundaries. For example, the question of technology maturity versus users desire to obtain additional measurements is non congruent. This is further complicated by the limitations of the laws of physics and the economic conditions. With the advent of advance technology, it is anticipated that the cost of the spacecraft technology will become more affordable. However, the specialized detector subsystems, and the precision flying techniques may still require substantial innovation, development time and cost. Additionally, the space deployment scheme should also be given a careful attention because of a high expense. Nonetheless, it is important to carefully examine the science priorities and steer the development efforts that can commensurate with the tangible requirements. This paper outlines a possible set of architectural concepts, operational scenarios and potential benefits of one scheme versus another. It further makes some suggestions where one can draw some boundary conditions to incrementally solve this predicament.

Habib, Shahid↗

The heuristic and motivational value of video reinforcement

Four rhesus monkeys (Macaca mulatta) were tested on joystick-based computer tasks in which they could choose to be reinforced either with pellets-only or with pellets + video. A variety of videotapes were used to reinforce task performance. The monkeys significantly preferred to be rewarded with a pellet and 10 s of a blank screen than a pellet plus 10 s of videotape. When they did choose to see videotaped images, however, they were significantly more likely to view video of themselves than video of their roommate or of unfamiliar conspecifics. These data support earlier findings of individual differences in preference for video reinforcement, and have clear implications for the study of face-recognition and self-recognition by nonhuman primates.

NASA Discipline Space Human Factors↗

Exploring Network-Related Optimization Problems Using Quantum Heuristics

Network-related connectivity optimization problems are underlying a wide range of applications and are also of high computational complexity. We consider studying network optimization problems using two types of quantum heuristics.One is quantum annealing, and the other Quantum Alternating Operator Ansatz, an extension of the Quantum Approximate Optimization Algorithms for gate-model quantum computation, in which a cost-function based unitary and a non-commuting mixing unitary are applied alternately. We present problem mappings for problems of finding the spanning-tree or spanning-graph of a graph that optimizes certain costs, and a variant that further requires the spanning-tree be degree-bounded. With quantum annealing, all constraints are cast into penalty terms in the cost Hamiltonian, and the solution is encoded as the ground state of the Hamiltonian. We provide three mappings to the quadratic unconstrained binary optimization (QUBO) form, compare the resource requirements, and analyze the tradeoffs. For QAOA, we give special focus on the design of mixers based on the constraints presented in the problem, such that the system evolution remains in a subspace of the full Hilbert space where all constraints are satisfied. In the spanning-tree problem, one such hard constraint is that a mixer applied to a spanning-tree needs also be a spanning tree. This involves checking the connectivity of a subgraph, which is a global condition common for most network-related problems. We show how this feature can be efficiently represented in the mixer in a quantum coherent way, based on manipulation of a descendant-matrix and an adjacent matrix. We further develop a mixer for the spanning-graphs based on the spanning-tree mixer.

Wang, Zhihui↗