Doubly-striped disk mirroring: Reliable storage for video servers

Disk striping is essential in Video-On-Demand servers to allow concurrent access for a large number of users to the same copy of a video object. On the other hand, disk striping makes the system more vulnerable to component failures. We propose a replication scheme for video content and an associated I/O scheduling algorithm that enables the system to tolerate a component failure. The scheme, called doubly-striped mirrors, compares favorably to other approaches for implementing redundancy such as RAID in terms of cost, bandwidth efficiency, buffer usage and system availability.     

Intelligent process monitoring by interfacing knowledge-based systems and multivariate statistical monitoring

An intelligent process monitoring and fault diagnosis environment has been developed by interfacing multivariate statistical process monitoring (MSPM) techniques and knowledge-based systems (KBS) for monitoring multivariable process operation. The real-time KBS developed in G2 is used with multivariate SPM methods based on canonical variate state space (CVSS) process models. Fault detection is based on T ² charts of state variables. Contribution plots in G2 are used for determining the process variables that have contributed to the out-of-control signal indicated by large T ² values, and G2 Diagnostic Assistant (GDA) is used to diagnose the source causes of abnormal process behavior. The MSPM modules developed in Matlab are linked with G2. This intelligent monitoring and diagnosis system can be used to monitor multivariable processes with autocorrelated, crosscorrelated, and collinear data. The structure of the integrated system is described and its performance is illustrated by simulation studies.     

Desynchronization and inhibition of Kuramoto oscillators by scalar mean-field feedback

Motivated by neuroscience applications, and in particular by the deep brain stimulation treatment for Parkinson’s disease, we have recently derived a simplified model of an interconnected neuronal population under the effect of its mean-field proportional feedback. In this paper, we rely on that model to propose conditions under which proportional mean-field feedback achieves either oscillation inhibition or desynchronization. More precisely, we show that for small natural frequencies, this scalar control signal induces an inhibition of the collective oscillation. For the closed-loop system, this situation corresponds to a fixed point which is shown to be almost globally asymptotically stable in the fictitious case of zero natural frequencies and all-to-all coupling and feedback. In the case of an odd number of oscillators, this property is shown to be robust to small natural frequencies and heterogencities in both the coupling and feedback topology. On the contrary, for large natural frequencies, we show that scalar proportional mean-field feedback is able to induce desynchronization. After having recalled a formal definition for desynchronization, we show how it can be induced in a network of originally synchronized oscillators.     

GPELab,a Matlab toolbox to solve Gross–Pitaevskii equations I: Computation of stationary solutions

This paper presents GPELab (Gross–Pitaevskii Equation Laboratory), an advanced easy-to-use and flexible Matlab toolbox for numerically simulating many complex physics situations related to Bose–Einstein condensation. The model equation that GPELab solves is the Gross–Pitaevskii equation. The aim of this first part is to present the physical problems and the robust and accurate numerical schemes that are implemented for computing stationary solutions, to show a few computational examples and to explain how the basic GPELab functions work. Problems that can be solved include: 1d, 2d and 3d situations, general potentials, large classes of local and nonlocal nonlinearities, multi-components problems, and fast rotating gases. The toolbox is developed in such a way that other physics applications that require the numerical solution of general Schrödinger-type equations can be considered.     

On the composition of ISO 25964 hierarchical relations (BTG,BTP, BTI)

Knowledge organization systems (KOS) can use different types of hierarchical relations: broader generic (BTG), broader partitive (BTP), and broader instantial (BTI). The latest ISO standard on thesauri (ISO 25964) has formalized these relations in a corresponding OWL ontology (De Smedt et al., ISO 25964 part 1: thesauri for information retrieval: RDF/OWL vocabulary, extension of SKOS and SKOS-XL. http://purl.org/iso25964/skos-thes, 2013) and expressed them as properties: broaderGeneric, broaderPartitive, and broaderInstantial, respectively. These relations are used in actual thesaurus data. The compositionality of these types of hierarchical relations has not been investigated systematically yet. They all contribute to the general broader (BT) thesaurus relation and its transitive generalization broader transitive defined in the SKOS model for representing KOS. But specialized relationship types cannot be arbitrarily combined to produce new statements that have the same semantic precision, leading to cases where inference of broader transitive relationships may be misleading. We define Extended properties (BTGE, BTPE, BTIE) and analyze which compositions of the original “one-step” properties and the Extended properties are appropriate. This enables providing the new properties with valuable semantics usable, e.g., for fine-grained information retrieval purposes. In addition, we relax some of the constraints assigned to the ISO properties, namely the fact that hierarchical relationships apply to SKOS concepts only. This allows us to apply them to the Getty Art and Architecture Thesaurus (AAT), where they are also used for non-concepts (facets, hierarchy names, guide terms). In this paper, we present extensive examples derived from the recent publication of AAT as linked open data.     

Timed substitutions for regular signal-event languages

In the classical framework of formal languages, a refinement operation is modeled by a substitution and an abstraction by an inverse substitution. These mechanisms have been widely studied, because they describe a change in the specification level, from an abstract view to a more concrete one, or conversely. For timed systems, there is up to now no uniform notion of substitution. In this paper, we study timed substitutions in the general framework of signal-event languages, where both signals and events are taken into account. We prove that regular signal-event languages are closed under substitution and inverse substitution. To obtain these results, we use in a crucial way a “well known” result: regular signal-event languages are closed under intersection. In fact, while this result is indeed easy for languages defined by Alur and Dill’s timed automata, it turns out that the construction is much more tricky when considering the most involved model of signal-event automata. We give here a construction working on finite and infinite signal-event words and taking into account signal stuttering, unobservability of zero-duration τ-signals and Zeno runs. Note that if several constructions have been proposed in particular cases, it is the first time that a general construction is provided.     

Utilizing endoscopic technology to reveal real-time proteomic alterations in response to chemoprevention

Cancer chemoprevention approaches use either pharmacological or dietary agents to impede, arrest or reverse the carcinogenic process. Although several agents have shown effectiveness against colon cancer, present intervention strategies provide only partial reduction. In this study, we utilized high-resolution endoscopy to obtain colon tumor biopsy specimens from Apc mutant mice before and after 2-wk sulindac intervention. To acquire information beyond genomics, proteome analysis using the ProteomeLab PF2D platform was implemented to generate 2-D protein expression maps from biopsies. Chromatograms produced common signature profiles between sulindac and nonsulindac treated samples, and contrasting profiles termed "fingerprints". We selected a double peak that appeared in tumor biopsies from sulindac-treated mice. Further analyses using MS sequencing identified this protein as histone H2B. The location of H2B in the 1(st) dimension strongly suggested PTM, consistent with identification of two oxidized methionines. While further studies on sulindac proteomic fingerprints are underway, this study demonstrates the feasibility and advantages of "real-time" proteomic analysis for obtaining information on biomarker discovery and drug activity that would not be revealed by a genetic assay. This approach should be broadly applicable for assessing lesion responsiveness in a wide range of translational and human clinical studies.     

Linearly bounded infinite graphs

Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural class of infinite automata representing their observable computational behavior, called linearly bounded graphs. These automata naturally accept the same languages as the linearly bounded machines defining them. We present some of their structural properties as well as alternative characterizations in terms of rewriting systems and context-sensitive transductions. Finally, we compare these graphs to rational graphs, which are another class of automata accepting the context-sensitive languages, and prove that in the bounded-degree case, rational graphs are a strict sub-class of linearly bounded graphs.A preliminary version of this article appeared in MFCS 2005.     

Workload assignment for global real-time scheduling on unrelated clustered platforms

Real-Time Systems - Heterogeneous MPSoCs are being used more and more, from cellphones to critical embedded systems. Most of those systems offer heterogeneous sets of identical cores. In this...     

A framework for dynamic implicit curve approximation by an irregular discrete approach

The approximation of implicit planar curves by line segments is a very classical problem. Many algorithms use interval analysis to approximate this curve, and to handle the topology of the final reconstruction. In this article, we use discrete geometry tools to build an original geometrical and topological representation of the implicit curve. The polygonal approximation contains few segments, and the Reeb graph permits to sum up efficiently the shape and the topology of the curve. Furthermore, we propose two algorithms to process local cells refinement and local cells grouping schemes. We illustrate these schemes with a global system that efficiently handles manual or automatic fast updates on the global reconstruction, by considering topological or geometrical constraints. We also compare the speed and the quality of our approach with two classical methods.