Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Markov Model”

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 217 records · Page 12

On the Performance of Detecting Injection of Fabricated Messages into the CAN Bus

There have been several public demonstrations of attacks on connected vehicles showing the ability of an attacker to take control of a targeted vehicle by injecting messages into their Controller Area Network (CAN) bus. In this article, using injected speed reading and Revolutions Per Minute (RPM) reading messages in in-motion vehicle, we examine the ability of the Pearson correlation and the unsupervised learning methods k-means clustering and Hidden Markov Model (HMM) to differentiate ’no-attack’ and ’under-attack’ states of the given vehicle. We found that the Pearson correlation distinguishes the two states, the k-means clustering method has an acceptable accuracy but high false positive rate and HMM detects attacks with acceptable detection rate but has a high false positive in detecting attacks from speed readings when there is no attack. The accuracy of these unsupervised learning methods are comparable to the ones of the supervised learning methods used by CAN bus Intrusion Detection System (IDS) suppliers. In addition, the article shows that studying CAN anomaly detection techniques using off-vehicle test facilities may not properly evaluate the performance of the detection techniques. Finally, the results suggest using other features besides the data content of the CAN messages and integrate knowledge about how the Electronic Control Units (ECUs) collaborate in building effective techniques for the detection of injection of fabricated message attacks.

97 MATHEMATICS AND COMPUTING↗

A Stochastic Multi-Criteria Decision-Making Algorithm for Dynamic Load Prioritization in Grid-Interactive Efficient Buildings

Increasing deployment of advanced sensing, controls, and communication infrastructure enables buildings to provide services to the power grid, leading to the concept of grid-interactive efficient buildings. Since occupant activities and preferences primarily drive the availability and operational flexibility of building devices, there is a critical need to develop occupant-centric approaches that prioritize devices for providing grid services, while maintaining the desired end-use quality of service. In this paper, we present a decision-making framework that facilitates a building owner/operator to effectively prioritize loads for curtailment service under uncertainties, while minimizing any adverse impact on the occupants. The proposed framework uses a stochastic (Markov) model to represent the probabilistic behavior of device usage from power consumption data, and a load prioritization algorithm that dynamically ranks building loads using a stochastic multi-criteria decision-making algorithm. The proposed load prioritization framework is illustrated via numerical simulations in a residential building use-case, including plug-loads, air-conditioners, and plug-in electric vehicle chargers, in the context of load curtailment as a grid service. Suitable metrics are proposed to evaluate the closed-loop performance of the proposed prioritization algorithm under various scenarios and design choices. Scalability of the proposed algorithm is established via computational analysis, while time-series plots are used for intuitive explanation of the ranking choices.

24 POWER TRANSMISSION AND DISTRIBUTION↗

CAHS: Context-Aware Homology Search

Protein homology search is foundational to bioinformatics: it supports annotation transfer, structure/function inference, and evolutionary analysis over rapidly expanding sequence repositories (e.g., UniProtKB). Profile hidden Markov models (pHMMs), as implemented in HMMER, remain the most widely trusted approach because they provide statistically calibrated E-values; however, their gap behavior is fixed once a profile is trained, despite biological evidence that insertion/deletion tolerance varies across flexible loops and intrinsically disordered regions. We present CAHS (Context-Aware Homology Search), a lightweight query-time adapter for pHMM search that incorporates learned and biologically motivated signals without changing HMMER's downstream search pipeline or its calibrated E-value reporting. Given a query sequence, CAHS computes per-residue representations from a protein language model and a disorder predictor, maps these to profile coordinates, and modulates only match-state transition rows (gap-open and gap-extension probabilities) while preserving Plan7 constraints. We comprehensively evaluate CAHS across six structurally diverse protein families and multi-domain architectures against a 570k-sequence target corpus. CAHS expands detection capability, retrieving thousands of additional remote homologs at relaxed thresholds by maintaining alignment quality through flexible regions. For multi-domain proteins, context-aware modulation resolves 94% of fragmented alignments. Crucially, CAHS preserves hit-set invariance at stringent operating points (E<10-10), demonstrating increased statistical confidence without inflating false positives. Furthermore, sharper statistical distinction between homologs and background noise during early filter stages yields up to a 3.87× acceleration in end-to-end wall-clock time on high-performance computing clusters. Overall, CAHS illustrates a practical AI-for-science design pattern: augmenting a trusted probabilistic model with query-specific learned signals to improve interpretable, reproducible inference in data-rich biology.

Bhattaram, Swethasree [Georgia Institute of Techno↗

viral_fam_classifier

This code applies publicly available Hidden Markov Model (HMM) profiles to publicly available reference genomes of viruses. It parses the output of these searches to determine bitscore cut-offs for viral taxonomic lineages that may be represented by each HMM. Subsequently, the code will allow the user to classify novel viral sequences using these bitscore cut-offs. This code is a work-in-progress.

Kantor, Rose [Lawrence Livermore National Laborato↗

BMC Caller: a webtool to identify and analyze bacterial microcompartment types in sequence data

Bacterial microcompartments (BMCs) are protein-based organelles found across the bacterial tree of life. They consist of a shell, made of proteins that oligomerize into hexagonally and pentagonally shaped building blocks, that surrounds enzymes constituting a segment of a metabolic pathway. The proteins of the shell are unique to BMCs. They also provide selective permeability; this selectivity is dictated by the requirements of their cargo enzymes. We have recently surveyed the wealth of different BMC types and their occurrence in all available genome sequence data by analyzing and categorizing their components found in chromosomal loci using HMM (Hidden Markov Model) protein profiles. To make this a “do-it yourself” analysis for the public we have devised a webserver, BMC Caller (https://bmc-caller.prl.msu.edu), that compares user input sequences to our HMM profiles, creates a BMC locus visualization, and defines the functional type of BMC, if known. Shell proteins in the input sequence data are also classified according to our function-agnostic naming system and there are links to similar proteins in our database as well as an external link to a structure prediction website to easily generate structural models of the shell proteins, which facilitates understanding permeability properties of the shell. Additionally, the BMC Caller website contains a wealth of information on previously analyzed BMC loci with links to detailed data for each BMC protein and phylogenetic information on the BMC shell proteins. Our tools greatly facilitate BMC type identification to provide the user information about the associated organism’s metabolism and enable discovery of new BMC types by providing a reference database of all currently known examples.

59 BASIC BIOLOGICAL SCIENCES↗

Assessing individual movement, habitat use, and behavior of non-breeding marine birds in relation to prey availability in the US Atlantic

Resource availability is a key factor driving marine bird movements and distributions, but direct information on prey availability is difficult to obtain at relevant scales. We present novel methods for describing multi-scale trophic associations, combining movement analyses of marine birds with estimates of forage fish surface aggregations from digital aerial survey data and species occupancy from bottom trawl survey data. We analyzed satellite telemetry data from northern gannets Morus bassanus , red-throated loons Gavia stellata , and long-tailed ducks Clangula hyemalis in the US Atlantic during the non-breeding period. Using discrete-time hidden Markov models to distinguish area-restricted (i.e. putative foraging) from transit movements, we examined how environmental factors influence movement, and how forage fish species distributions and surface aggregations influence habitat use by gannets and loons that have greater dietary reliance. Our results suggest that chlorophyll a concentration significantly affected movement behavior across species, highlighting the importance of higher-productivity areas around estuaries during colder months when regional productivity is low. Though variable across species and seasons, spatial cross-correlation analysis revealed that herring species (Family Clupeidae), including Atlantic menhaden Brevoortia tyrannus , may be important resources; it also showed positive spatial correlations with forage fish aggregations. This suggests that prey patch dynamics and factors driving aggregation formation may be as important as species composition. However, spatial patterns were generally low (<0.3), suggesting a mismatch in spatiotemporal resolution, exemplifying the challenges in quantifying trophic relationships in marine systems. Disentangling predator-prey relationships is critical to understanding the mechanisms driving marine bird behavior in rapidly changing marine systems.

Environmental Sciences & Ecology↗

The Bacteroidetes Aequorivita sp. and Kaistella jeonii Produce Promiscuous Esterases With PET-Hydrolyzing Activity

Certain members of the Actinobacteria and Proteobacteria are known to degrade polyethylene terephthalate (PET). Here, we describe the first functional PET-active enzymes from the Bacteroidetes phylum. Using a PETase-specific Hidden-Markov-Model- (HMM-) based search algorithm, we identified several PETase candidates from Flavobacteriaceae and Porphyromonadaceae. Among them, two promiscuous and cold-active esterases derived from Aequorivita sp. (PET27) and Kaistella jeonii (PET30) showed depolymerizing activity on polycaprolactone (PCL), amorphous PET foil and on the polyester polyurethane Impranil ® DLN. PET27 is a 37.8 kDa enzyme that released an average of 174.4 nmol terephthalic acid (TPA) after 120 h at 30°C from a 7 mg PET foil platelet in a 200 μl reaction volume, 38-times more than PET30 (37.4 kDa) released under the same conditions. The crystal structure of PET30 without its C-terminal Por-domain (PET30ΔPorC) was solved at 2.1 Å and displays high structural similarity to the Is PETase. PET30 shows a Phe-Met-Tyr substrate binding motif, which seems to be a unique feature, as Is PETase, LCC and PET2 all contain Tyr-Met-Trp binding residues, while PET27 possesses a Phe-Met-Trp motif that is identical to Cut190. Microscopic analyses showed that K. jeonii cells are indeed able to bind on and colonize PET surfaces after a few days of incubation. Homologs of PET27 and PET30 were detected in metagenomes, predominantly aquatic habitats, encompassing a wide range of different global climate zones and suggesting a hitherto unknown influence of this bacterial phylum on man-made polymer degradation.

59 BASIC BIOLOGICAL SCIENCES↗

Searching for Dark Matter with Superconducting Qubits

Dark matter is an enduring mystery in our quest to understand the fundamental constituents of our universe. Low mass bosons, such the axion or hidden photon, are compelling dark matter candidates. We leverage their potential interactions with electromagnetic fields, whereby the dark matter (of unknown mass) on rare occasion converts into a single photon, to devise a method of detecting these candidates. Current dark matter searches operating at microwave frequencies use a resonant cavity to coherently accumulate the field sourced by the dark matter and a near standard quantum limited (SQL) linear amplifier to read out the cavity signal. To further increase sensitivity to the dark matter signal and enable future searches, sub-SQL detection techniques are required.In this thesis, I report the development of a novel microwave photon counting technique and a new exclusion limit on hidden photon dark matter. We operate a superconducting qubit to make repeated quantum non-demolition measurements of cavity photons and apply a hidden Markov model analysis to reduce the noise to 15.7 dB below the quantum limit, with overall detector performance limited by a residual background of real photons. With the present device, we perform a hidden photon search and constrain the kinetic mixing angle to less than 1.68 x 10-15 in a band around 6.011 GHz (24.86 micro-eV) with an integration time of 8.33 s. This demonstrated noise reduction technique enables future dark matter searches to be sped up by a factor of 1300. By coupling a qubit to an arbitrary quantum sensor, more general sub-SQL metrology is possible with the techniques presented in this work.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Upper bound on compression ratio for run-length encoding.

Run-length encoding is a scheme which has been used to remove redundancy from video signals. Based upon a first-order Markov model of video data, an upper bound on compression ratio is found for run-length encoding. It is shown that at best run-length encoding will give a compression ratio which is approximately 60% of the maximum attainable value. This percentage is fairly independent of the particular picture involved.

Gray, K. G.↗

Worst-error analysis of batch filter and sequential filter in navigation problems

This paper proposes a worst-error analysis for dealing with problems of estimation of spacecraft trajectories in deep space missions. Navigation filters in use assume either constant or stochastic (Markov) models for their estimated parameters. When the actual behavior of these parameters does not follow the pattern of the assumed model, the filters sometimes result in very poor performance. To prepare for such pathological cases, the worst errors of both batch and sequential filters are investigated based on the incremental sensitivity studies of these filters. By finding critical switching instances of non-gravitational accelerations, intensive tracking can be carried out around those instances. Also the worst errors in the target plane provide a measure in assignment of the propellant budget for trajectory corrections. Thus the worst-error study presents useful information as well as practical criteria in establishing the maneuver and tracking strategy of spacecraft's missions.

Nishimura, T.↗

Very short range forecasts of visibility and ceiling

The development of methods for the short range forecasting of visibility and ceiling conditions is discussed. Short range forecasts of one hour or less (5 or 30 minutes), immediately after a series of local observations can be expected to be more accurate and reliable than any forecast of more than one hour. These forecasts can be accomplished by the operational implementation of fully automated aviation observation systems and the utilization of statistical techniques such as the Generalized Equivalent Markov model.

Hilsenrod, A.↗

Development and analysis of the Software Implemented Fault-Tolerance (SIFT) computer

SIFT (Software Implemented Fault Tolerance) is an experimental, fault-tolerant computer system designed to meet the extreme reliability requirements for safety-critical functions in advanced aircraft. Errors are masked by performing a majority voting operation over the results of identical computations, and faulty processors are removed from service by reassigning computations to the nonfaulty processors. This scheme has been implemented in a special architecture using a set of standard Bendix BDX930 processors, augmented by a special asynchronous-broadcast communication interface that provides direct, processor to processor communication among all processors. Fault isolation is accomplished in hardware; all other fault-tolerance functions, together with scheduling and synchronization are implemented exclusively by executive system software. The system reliability is predicted by a Markov model. Mathematical consistency of the system software with respect to the reliability model has been partially verified, using recently developed tools for machine-aided proof of program correctness.

Goldberg, J.↗

The semi-Markov unreliability range evaluator program

The SURE program is a design/validation tool for ultrareliable computer system architectures. The system uses simple algebraic formulas to compute accurate upper and lower bounds for the death state probabilities of a large class of semi-Markov models. The mathematical formulas used in the program were derived from a mathematical theorem proven by Allan White under contract to NASA Langley Research Center. This mathematical theorem is discussed along with the user interface to the SURE program.

Butler, R. W.↗

Reliability bounds for fault-tolerant systems with competing responses to component failures

Bounds are established on the probability of system failure for fault-tolerant systems of the type used, for example, in aviation control. Event series leading to system failure are assumed to follow a semi-Markov model in which the potential sojourn times associated with component failures have exponential distributions and those associated with system responses have distributions with unspecified form. A product form of the bounds is derived by using a model that provides for multiple competing system responses to component failures.

Lee, L. D.↗

Reliability bounds for fault-tolerant systems with competing responses to component failures

Bounds are established on the probability of system failure for fault-tolerant systems of the type used, for example, in aviation control. Event series leading to system failure are assumed to follow a semi-Markov model in which the potential sojourn times associated with component failures have exponential distributions and those associated with system responses have distributions with unspecified form. A product form of the bounds is derived by using a model that provides for multiple competing system responses to component failures.

Lee, L. D.↗

An approximation formula for a class of fault-tolerant computers

An approximation formula is derived for the probability of failure for fault-tolerant process-control computers. These computers use redundancy and reconfiguration to achieve high reliability. Finite-state Markov models capture the dynamic behavior of component failure and system recovery, and the approximation formula permits an estimation of system reliability by an easy examination of the model.

White, A. L.↗

Performance analysis of replication ALOHA for fading mobile communications channels

This paper describes an ALOHA random access protocol for fading communications channels. A two-state Markov model is used for the channel error process to account for the channel fading memory. The ALOHA protocol is modified to send multiple contiguous copies of a message at each transmission attempt. Both pure and slotted ALOHA channels are considered. The analysis is applicable to fading environments where the channel memory is short compared to the propagation delay. It is shown that smaller delay may be achieved using replications and, in noisy conditions, can also improve throughput.

Yan, Tsun-Yee↗

The PAWS and STEM reliability analysis programs

The PAWS and STEM programs are new design/validation tools. These programs provide a flexible, user-friendly, language-based interface for the input of Markov models describing the behavior of fault-tolerant computer systems. These programs produce exact solutions of the probability of system failure and provide a conservative estimate of the number of significant digits in the solution. PAWS uses a Pade approximation as a solution technique; STEM uses a Taylor series as a solution technique. Both programs have the capability to solve numerically stiff models. PAWS and STEM possess complementary properties with regard to their input space; and, an additional strength of these programs is that they accept input compatible with the SURE program. If used in conjunction with SURE, PAWS and STEM provide a powerful suite of programs to analyze the reliability of fault-tolerant computer systems.

Butler, Ricky W.↗