Anytime synthetic projection: Maximizing the probability of goal satisfaction

A projection algorithm is presented for incremental control rule synthesis. The algorithm synthesizes an initial set of goal achieving control rules using a combination of situation probability and estimated remaining work as a search heuristic. This set of control rules has a certain probability of satisfying the given goal. The probability is incrementally increased by synthesizing additional control rules to handle 'error' situations the execution system is likely to encounter when following the initial control rules. By using situation probabilities, the algorithm achieves a computationally effective balance between the limited robustness of triangle tables and the absolute robustness of universal plans

System for Anomaly and Failure Detection (SAFD) system development

This task specified developing the hardware and software necessary to implement the System for Anomaly and Failure Detection (SAFD) algorithm, developed under Technology Test Bed (TTB) Task 21, on the TTB engine stand. This effort involved building two units; one unit to be installed in the Block II Space Shuttle Main Engine (SSME) Hardware Simulation Lab (HSL) at Marshall Space Flight Center (MSFC), and one unit to be installed at the TTB engine stand. Rocketdyne personnel from the HSL performed the task. The SAFD algorithm was developed as an improvement over the current redline system used in the Space Shuttle Main Engine Controller (SSMEC). Simulation tests and execution against previous hot fire tests demonstrated that the SAFD algorithm can detect engine failure as much as tens of seconds before the redline system recognized the failure. Although the current algorithm only operates during steady state conditions (engine not throttling), work is underway to expand the algorithm to work during transient condition

Advanced detection, isolation, and accommodation of sensor failures in turbofan engines: Real-time microcomputer implementation

The objective of the Advanced Detection, Isolation, and Accommodation Program is to improve the overall demonstrated reliability of digital electronic control systems for turbine engines. For this purpose, an algorithm was developed which detects, isolates, and accommodates sensor failures by using analytical redundancy. The performance of this algorithm was evaluated on a real time engine simulation and was demonstrated on a full scale F100 turbofan engine. The real time implementation of the algorithm is described. The implementation used state-of-the-art microprocessor hardware and software, including parallel processing and high order language programming

Self-configuring data mining for ubiquitous computing

Ubiquitous computing software needs to be autonomous so that essential decisions such as how to configure its particular execution are self-determined. Moreover, data mining serves an important role for ubiquitous computing by providing intelligence to several types of ubiquitous computing applications. Thus, automating ubiquitous data mining is also crucial. We focus on the problem of automatically configuring the execution of a ubiquitous data mining algorithm. In our solution, we generate configuration decisions in a resource aware and context aware manner since the algorithm executes in an environment in which the context often changes and computing resources are often severely limited. We propose to analyze the execution behavior of the data mining algorithm by mining its past executions. By doing so, we discover the effects of resource and context states as well as parameter settings on the data mining quality. We argue that a classification model is appropriate for predicting the behavior of an algorithm?s execution and we concentrate on decision tree classifier. We also define taxonomy on data mining quality so that tradeoff between prediction accuracy and classification specificity of each behavior model that classifies by a different abstraction of quality, is scored for model selection. Behavior model constituents and class label transformations are formally defined and experimental validation of the proposed approach is also performed

Optimistic barrier synchronization

Barrier synchronization is fundamental operation in parallel computation. In many contexts, at the point a processor enters a barrier it knows that it has already processed all the work required of it prior to synchronization. The alternative case, when a processor cannot enter a barrier with the assurance that it has already performed all the necessary pre-synchronization computation, is treated. The problem arises when the number of pre-sychronization messages to be received by a processor is unkown, for example, in a parallel discrete simulation or any other computation that is largely driven by an unpredictable exchange of messages. We describe an optimistic O(log sup 2 P) barrier algorithm for such problems, study its performance on a large-scale parallel system, and consider extensions to general associative reductions as well as associative parallel prefix computations

Modeling Intelligent Control of Distributed Cooperative Inferencing

The ability to harness different problem-solving methods together into a cooperative system has the potential for significantly improving the performance of systems for solving NP-hard problems. The need exists for an intelligent controller that is able to effectively combine radically different problem-solving techniques with anytime and anywhere properties into a distributed cooperative environment. This controller requires models of the component algorithms in conjunction with feedback from those algorithms during run-time to manage a dynamic combination of tasks effectively. This research develops a domain-independent method for creating these models as well as a model for the controller itself. These models provide the means for the controller to select the most appropriate algorithms, both initially and during run-time. We utilize the algorithm performance knowledge contained in the algorithm models to aid in the selection process. This methodology is applicable to many NP-hard problems; applicability is only limited by the availability of anytime and anywhere algorithms for that domain. We demonstrate the capabilities of this methodology by applying it to a known NP-hard problem: uncertain inference over Bayesian Networks. Experiments using a collection of randomly generated networks and some common inference algorithms showed very promising results. Future directions for this research could involve the analysis of the impact of the accuracy of the algorithm models on the performance of the controller; the issue is whether the increased model accuracy would cause excessive system overhead, counteracting the potential increase in performance due to better algorithm selection

Detection of Small-Scale Rockfall Incidents Using Their Seismic Signature

Several algorithms have been effectively used to identify the seismic signature of rockfall incidents, which constitute a significant threat for human lives and infrastructure especially when occurring along transportation networks. These algorithms have been mostly evaluated using data from large scale rockfall events that release a large amount of energy. However, low-energy rockfall events (\u3c 100 Joules) triggered by small-sized individual rocks falling from small heights can be severely destructive. In this study, a three-parameter algorithm has been developed to identify low-energy rockfall events. An experimental setup was implemented to 1) validate the results obtained by this algorithm against visual inspection of seismic signals records, 2) define the optimal algorithm parameterization to minimize false alarms, and 3) investigate whether tri-axial vibration monitoring can be replaced by a uniaxial device in order to reduce the installation cost of a real-time rockfall monitoring system. It was found that the success rate of the proposed algorithm exceeds 80% independently of the parameters used, while event identification at a maximum distance with minimal false alarms was achieved when using mean ± 3σ as the threshold criterion and 6 ms and 4 ms as the trigger and event window parameters respectively. Finally, it was found that for the specific experimental setup, a uniaxial device could be used for rockfall event identification

Execution time as a key parameter in the waste collection problem

Proper waste management has been recognized as a tool for the green transition towards a more sustainable economy. For instance, most studies dealing with municipal solid wastes in the literature focus on environmental aspects, proposing new routes for recycling, composting and landfilling. However, there are other aspects to be improved in the systems that deal with municipal solid waste, especially in the transportation sector. Scholars have been exploring alternatives to improve the performance in waste collection tasks since the late 50s, for example, considering the waste collection problem as static. The transition from a static approach to a dynamic is necessary to increase the feasibility of the solution, requiring faster algorithms. Here we explore the improvement in the performance of the guided local search metaheuristic available in OR-Tools upon different execution times lower than 10 seconds to solve the capacitated waste collection problem. We show that increasing the execution time from 1 to 10 seconds can overcome savings of up to 1.5 km in the proposed system. Considering application in dynamic scenarios, the 9 s increase in execution time (from 1 to 10 s) would not hinder the algorithm’s feasibility. Additionally, the assessment of the relation between performance in different execution times with the dataset’s tightness revealed a correlation to be explored in more detail in future studies. The work done here is the first step towards a shift of paradigm from static scenarios in waste collection to dynamic route planning, with the execution time established according to the conclusions achieved in this study.This work has been supported by FCT—Fundação para a Ciência e a Tecnologia within the R&D Units Project Scope: UIDB/05757/2020, UIDP/05757/2020, UIDB/00690/2020, UIDB/50020/2020, and LA/P/0007/2021. Adriano Silva was supported by FCT-MIT Portugal Ph.D. grant SFRH/BD/151346/2021.info:eu-repo/semantics/publishedVersio

A novel secure artificial bee colony with advanced encryption standard technique for biomedical signal processing

Over the years, the privacy of a biomedical signal processing is protected using the encryption techniques design and meta-heuristic algorithms which are significant domain and it will be more significant shortly. Present biomedical signal processing research contained security because of their critical role in any developing technology that contains applications of cryptography and health deployment. Furthermore, implementing public-key cryptography in biomedical signal processing sequence testing equipment needs a high level of skill. Whatever key is being broken with enough computing capabilities using brute-force attack. As a result, developing a biomedical signal processing cryptography model is critical for improving the connection between existing and emerging technology. Furthermore, public-key cryptography implementation for meta-heuristic-based bio medical signal processing sequence test equipment necessitates a high level of skill. The suggested novel technique can be used to develop a secure algorithm of artificial bee colony, which depend on the advanced encryption standard (AES). AES can be used to reduce the encryption time and to increase the protection capacity for health systems. The novel secure can protect the biomedical signal processing against plain text attacks