Supervisory control using variable lookahead policies

This paper deals with the efficient on-line calculation of supervisory controls for discrete event systems (DES's) in the framework of limited lookahead control policies (or LLPs) that we introduced in previous papers. In the LLP scheme, the control action after a given trace of events has been executed is calculated on-line on the basis of anN-step ahead projection of the behavior of the DES. To compute these controls, one must calculate after the execution of each event the supremal controllable sublanguage of a finite language with respect to another finite larger language. In our previous work, we showed how the required supremal controllable sublanguage calculation can be performed by using a backward dynamic programming algorithm over the nodes of the tree representation of these two languages. In this paper, we pursue the same approach for the calculation of LLP controls, but instead we adopt a forward calculation procedure over theN-level tree of interest. This forward procedure improves upon previous work by avoiding the explicit consideration of all the nodes of theN-level tree, while still permitting tree-to-tree recursiveness as enabled events are executed by the system. The forward search ends whenever a control decision can be made unambiguously or whenever the boundary of theN-level tree is reached, whichever comes first. This motivates the name Variable Lookahead Policy (or VLP) for this implementation of the LLP supervisory control scheme. This paper presents a general VLP algorithm and studies the properties of several special cases of it. The paper also discusses the implementation of the VLP algorithms and presents computational results regarding the application of these algorithms to a time-varying DES.     

3D Semantic Scene Completion: A Survey

International Journal of Computer Vision - Semantic scene completion (SSC) aims to jointly estimate the complete geometry and semantics of a scene, assuming partial sparse input. In the last years...     

Selective toxicity of hydroxyl-rich carbon nanodots for cancer research

Nano Research - The toxicity of nanoparticles in a biological system is an integration of effects arising from surface functionality, particle size, ionic dissolution, etc. This complexity suggests...     

Complexity issues in color-preserving graph embeddings

In the context of comparative analysis of protein–protein interaction graphs, we use a graph-based formalism to detect the preservation of a given protein complex (pattern graph) in the protein–protein interaction graph (target graph) of another species with respect to (w.r.t.) orthologous proteins. We give an efficient exponential-time randomized algorithm in case the occurrence of the pattern graph in the target graph is required to be exact. For approximate occurrences, we prove a tight inapproximability result and give four approximation algorithms that deal with bounded degree graphs, small ortholog numbers, linear forests and very simple yet hard instances, respectively.     

Mixed-Signal Approximate Computation: A Neural Predictor Case Study

As transistors shrink and processors trend toward low power, maintaining precise digital behavior grows more expensive. Replacing digital units with analog equivalents sometimes allows similar computation to be performed at higher speed using less power. As a case study in mixed-signal approximate computation, the authors describe an enhanced neural prediction algorithm and its efficient analog implementation.     

IsoGeometric analysis using T-splines on two-patch geometries

We develop optimal approximation estimates for T-splines in the case of geometries obtained by gluing two standard tensor product patches. We derive results both for the T-spline space in the parametric domain and the mapped T-NURBS in the physical one. A set of numerical tests in complete accordance with the theoretical developments is also presented.     

A Neuro-fuzzy Coding for Processing Incomplete Data: Application to the Classification of Seismic Events

This letter presents a method for modelling and processing incomplete data in connectionist systems. The approach consists in applying a neuro-fuzzy coding to the input data of a neural network. After an introduction to the different kinds of imperfections, we propose a neuro-fuzzy coding in order to take incomplete data into account. We show the efficiency of this coding on the problem of the classification of seismic events. The results show that a neuro-fuzzy coding of the inputs of a neural network increases the performance and classifies incomplete data with little affect on the results.