Reliability and time‐to‐failure bounds for discrete‐time constrained Markov jump linear systems

This paper presents a methodology to obtain a guaranteed‐reliability controller for constrained linear systems, which switch between different modes according to a Markov chain (Markov jump linear systems). Inside the classical maximal robust controllable set, there is 100% guarantee of never violating constraints at future time. However, outside such set, some sequences might make hitting constraints unavoidable for some disturbance realisations. A guaranteed‐reliability controller based on a greedy heuristic approach was proposed in an earlier work for disturbance‐free, robustly stabilisable Markov jump linear systems. Here, extensions are presented by, first, considering bounded disturbances and, second, presenting an iterative algorithm based on dynamic programming. In non‐stabilisable systems, reliability is zero; therefore, prior results cannot be applied; in this case, optimisation of a mean‐time‐to‐failure bound is proposed, via minor algorithm modifications. Optimality can be proved in the disturbance‐free, finitely generated case. Copyright © 2016 John Wiley & Sons, Ltd.     

Semantic-based authorization architecture for Grid

There are a few issues that still need to be covered regarding security in the Grid area. One of them is authorization where there exist good solutions to define, manage and enforce authorization policies in Grid scenarios. However, these solutions usually do not provide Grid administrators with semantic-aware components closer to the particular Grid domain and easing different administration tasks such as conflict detection or resolution. This paper defines a proposal based on Semantic Web to define, manage and enforce security policies in a Grid scenario. These policies are defined by means of semantic-aware rules which help the administrator to create higher-level definitions with more expressiveness. These rules also permit performing added-value tasks such as conflict detection and resolution, which can be of interest in medium and large scale scenarios where different administrators define the authorization rules that should be followed before accessing a resource in the Grid. The proposed solution has been also tested providing some reasonable response times in the authorization decision process.     

Proof Pearl: a Formal Proof of Higman��s Lemma in ACL2

Higman??s lemma is an important result in infinitary combinatorics, which has been formalized in several theorem provers. In this paper we present a formalization and proof of Higman??s Lemma in the ACL2 theorem prover. Our formalization is based on a proof by Murthy and Russell, where the key termination argument is justified by the multiset relation induced by a well-founded relation. To our knowledge, this is the first mechanization of this proof.     

Device for characterization of thermal effusivity of liquids using photothermal beam deflection

We propose and study a novel optoelectronic device for thermal characterization of materials. It is based on monitoring the photothermal deflection of a laser beam within a slab of a thermo-optic material in thermal contact with the sample under study. An optical angle sensor is used to measure the laser deflection providing a simple and experimental arrangement. We demonstrate its principle and a simple procedure to measure thermal effusivity of liquids. The proposed device could be implemented into a compact sensor head for remote measurements using electrical and fiber optic links.     

Arity and alternation: a proper hierarchy in higher order logics

We study the effect of simultaneously bounding the maximal-arity of the higher-order variables and the alternation of quantifiers in higher-order logics, as to their expressive power on finite structures (or relational databases). Let $\mathit{AA}^i(r,m)$ be the class of (i?+?1)-th order logic formulae where all quantifiers are grouped together at the beginning of the formulae, forming m alternating blocks of consecutive existential and universal quantifiers, and such that the maximal-arity (a generalization of the concept of arity, not just the maximal of the arities of the quantified variables) of the higher-order variables is bounded by r. Note that, the order of the quantifiers in the prefix may be mixed. We show that, for every i?≥?1, the resulting $\mathit{AA}^i(r,m)$ hierarchy of formulae of (i?+?1)-th order logic is proper. This extends a result by Makowsky and Pnueli who proved that the same hierarchy in second-order logic is proper. In both cases the strategy used to prove the results consists in considering formulae which, represented as finite structures, satisfy themselves. As the well known diagonalization argument applies here, this gives rise, for each order i and each level of the $\mathit{AA}^i(r,m)$ hierarchy of arity and alternation, to a class of formulae which is not definable in that level, but which is definable in a higher level of the same hierarchy. We then use a similar argument to prove that the classes of $\Sigma^i_m \cup \Pi^i_m$ formulae in which the higher-order variables of all orders up to i?+?1 have maximal-arity at most r, also induce a proper hierarchy in each higher-order logic of order i?≥?3. It is not known whether the correspondent hierarchy in second-order logic is proper. Using the concept of finite model truth definitions introduced by M. Mostowski, we give a sufficient condition for that to be the case.     

Rab7 and actin cytoskeleton participate during mobilization of β1EHFNR in fibronectin-stimulated Entamoeba histolyticatrophozoites

In vitro interaction of Entamoeba histolytica trophozoites with fibronectin (FN) induces redistribution of the amoebic fibronectin receptor (β1EhFNR). Trafficking of beta1 integrins is important for cell adhesion and migration in higher eukaryotes and requires the participation of Rab proteins. In E. histolytica, the machinery involved in integrin trafficking is not completely known. EhRab7 is a 24.5-kDa protein whose alignment with other Rab7 proteins demonstrated that it shared significant homology with Rab7 proteins from other organisms, including humans. Using different types of microscopy (fluorescence and confocal microscopy), it was established that Rab7 and the actin cytoskeleton participated in the mobilization of β1EhFNR in FN-stimulated trophozoites. β1EhFNR and Rab7 co-localized only in vesicular structures at 5 min, and at longer time (1 h), both co-localized in both plasma membrane and in vesicular structures; at the same time, Rab7 co-localized with specific actin structures (phagocytic vacuoles). At 5 h the β1EhFNR, Rab7, and actin co-localized at the plasma membrane, and only β1EhFNR and Rab7 decorated vesicles of different sizes. Actin and Rab7 co-localized in a cap-like structure at one end of the cell. Fluorescence resonance energy transfer and electron microscopy confirmed the close interaction between β1EhFNR and Rab7. Moreover, the use of a lysosome-specific marker (LysoTracker) and a Golgi-specific marker (NBD C(6)-ceramide) allowed us to establish that, at some point within the endocytic route, β1EhFNR and Rab7 co-localized within a lysosome-type organelle, but not a Golgi-like organelle, which indicated that this integrin-like molecule was returned to the plasma membrane via exocytic or secretory vesicles.     

A multi-objective evolutionary algorithm for an effective tuning of?fuzzy logic controllers in?heating, ventilating and air conditioning systems

This paper focuses on the use of multi-objective evolutionary algorithms to develop smartly tuned fuzzy logic controllers dedicated to the control of heating, ventilating and air conditioning systems, energy performance, stability and indoor comfort requirements. This problem presents some specific restrictions that make it very particular and complex because of the large time requirements needed to consider multiple criteria (which enlarge the solution search space) and the long computation time models required in each evaluation.     

Self-calibrated,Multi-spectral Photometric Stereo for 3D Face Capture

This paper addresses the problem of obtaining 3d detailed reconstructions of human faces in real-time and with inexpensive hardware. We present an algorithm based on a monocular multi-spectral photometric-stereo setup. This system is known to capture high-detailed deforming 3d surfaces at high frame rates and without having to use any expensive hardware or synchronized light stage. However, the main challenge of such a setup is the calibration stage, which depends on the lights setup and how they interact with the specific material being captured, in this case, human faces. For this purpose we develop a self-calibration technique where the person being captured is asked to perform a rigid motion in front of the camera, maintaining a neutral expression. Rigidity constrains are then used to compute the head’s motion with a structure-from-motion algorithm. Once the motion is obtained, a multi-view stereo algorithm reconstructs a coarse 3d model of the face. This coarse model is then used to estimate the lighting parameters with a stratified approach: In the first step we use a RANSAC search to identify purely diffuse points on the face and to simultaneously estimate this diffuse reflectance model. In the second step we apply non-linear optimization to fit a non-Lambertian reflectance model to the outliers of the previous step. The calibration procedure is validated with synthetic and real data.     

Distance maps from unthresholded magnitudes

A straightforward algorithm that computes distance maps from unthresholded magnitudes is presented, suitable for still images and video sequences. While results on binary images are similar to classic Euclidean Distance Transforms, the proposed approach does not require a binarization step. Thus, no thresholds are needed and no information is lost in intermediate classification stages. Experiments include the evaluation of spatial and temporal coherence of distance map values, showing better results in both measurements than those obtained with Sobel or Deriche gradients and classic chessboard distance transforms.