Two-step sinter-crystallization of K2O–CaO–P2O5–SiO2 (45S5-K) bioactive glass

Bioactive glasses and glass-ceramics (GCs) effectively regenerate bone tissue, however most GCs show improved mechanical properties. In this work, we developed and tested a rarely studied bioactive glass composition (24.4K₂O-26.9CaO-46.1SiO₂-2.6P₂O₅ mol%, identified as 45S5-K) with different particle sizes and heating rates to obtain a sintered GC that combines good fracture strength, low elastic modulus, and bioactivity. We analyzed the influence of the sintering processing conditions in the elastic modulus, Vickers microhardness, density, and crystal phase formation in the GC. The best GC shows improved properties compared with its parent glass. This glass achieves a good densification degree with a two-step viscous flow sintering approach and the resulting GC shows as high bioactivity as that of the standard 45S5 Bioglass®. Furthermore, the GC elastic modulus (56 GPa) is relatively low, minimizing stress shielding. Therefore, we unveiled the glass sintering behavior with concurrent crystallization of this complex bioactive glass composition and developed a potential GC for bone regeneration.     

A new family of sugar-inducible expression vectors for Escherichia coli

A set of 11 expression vectors was constructed, each of themharbouring a cloning cassette under the control of the promoter.Some of these vectors enable expression of foreign proteinsin the cytoplasm, while others include a synthetic sequencecoding for a very efficient secretion signal sequence. Otherfeatures are an fl origin of replication (in plus or minus orientation)and a promoter^up mutation that enhances the already very highlevel of expression from these vectors. With such a versatilevector family, cloning, sequencing and sitedirected mutagenesiscan be performed on the same vector, and the level of expressioncan be defined according to the specific constraints of a givenprotein.     

Optimal infinite scheduling for multi-priced timed automata

This paper is concerned with the derivation of infinite schedules for timed automata that are in some sense optimal. To cover a wide class of optimality criteria we start out by introducing an extension of the (priced) timed automata model that includes both costs and rewards as separate modelling features. A precise definition is then given of what constitutes optimal infinite behaviours for this class of models. We subsequently show that the derivation of optimal non-terminating schedules for such double-priced timed automata is computable. This is done by a reduction of the problem to the determination of optimal mean-cycles in finite graphs with weighted edges. This reduction is obtained by introducing the so-called corner-point abstraction, a powerful abstraction technique of which we show that it preserves optimal schedules. This work has been mostly done while visiting CISS at Aalborg University in Denmark and has been supported by CISS and by ACI Cortos, a program of the French Ministry of Research.     

Multisensory VR interaction for protein-docking in the CoRSAIRe project

Proteins take on their function in the cell by interacting with other proteins or biomolecular complexes. To study this process, computational methods, collectively named protein docking, are used to predict the position and orientation of a protein ligand when it is bound to a protein receptor or enzyme, taking into account chemical or physical criteria. This process is intensively studied to discover new biological functions for proteins and to better understand how these macromolecules take on these functions at the molecular scale. Pharmaceutical research also employs docking techniques for a variety of purposes, most notably in the virtual screening of large databases of available chemicals to select likely molecular candidates for drug design. The basic hypothesis of our work is that Virtual Reality (VR) and multimodal interaction can increase efficiency in reaching and analysing docking solutions, in addition to fully a computational docking approach. To this end, we conducted an ergonomic analysis of the protein–protein current docking task as it is carried out today. Using these results, we designed an immersive and multimodal application where VR devices, such as the three-dimensional mouse and haptic devices, are used to interactively manipulate two proteins to explore possible docking solutions. During this exploration, visual, audio, and haptic feedbacks are combined to render and evaluate chemical or physical properties of the current docking configuration.     

A strategy for allowing meaningful and comparable scores in approximate matching

Approximate data matching aims at assessing whether two distinct instances of data represent the same real-world object. The comparison between data values is usually done by applying a similarity function which returns a similarity score. If this score surpasses a given threshold, both data instances are considered as representing the same real-world object. These score values depend on the algorithm that implements the function and have no meaning to the user. In addition, score values generated by different functions are not comparable. This will potentially lead to problems when the scores returned by different similarity functions need to be combined for computing the similarity between records. In this article, we propose that thresholds should be defined in terms of the precision that is expected from the matching process rather than in terms of the raw scores returned by the similarity function. Precision is a widely known similarity metric and has a clear interpretation from the user's point of view. Our approach defines mappings from score values to precision values, which we call adjusted scores. In order to obtain such mappings, our approach requires training over a small dataset. Experiments show that training can be reused for different datasets on the same domain. Our results also demonstrate that existing methods for combining scores for computing the similarity between records may be enhanced if adjusted scores are used.     

An algebraic approach to data languages and timed languages

Algebra offers an elegant and powerful approach to understand regular languages and finite automata. Such framework has been notoriously lacking for timed languages and timed automata. We introduce the notion of monoid recognizability for data languages, which includes timed languages as special case, in a way that respects the spirit of the classical situation. We study closure properties and hierarchies in this model and prove that emptiness is decidable under natural hypotheses. Our class of recognizable languages properly includes many families of deterministic timed languages that have been proposed until now, and the same holds for non-deterministic versions.     

Forward Analysis of Updatable Timed Automata

Timed automata are a widely studied model. Its decidability has been proved using the so-called region automaton construction. This construction provides a correct abstraction for the behaviours of timed automata, but it suffers from a state explosion and is thus not used in practice. Instead, algorithms based on the notion of zones are implemented using adapted data structures like DBMs. When we focus on forward analysis algorithms, the exact computation of all the successors of the initial configurations does not always terminate. Thus, some abstractions are often used to ensure termination, among which, a widening operator on zones.In this paper, we study in detail this widening operator and the corresponding forward analysis algorithm. This algorithm is most used and implemented in tools like KRONOS and UPPAAL. One of our main results is that it is hopeless to find a forward analysis algorithm for general timed automata, that uses such a widening operator, and which is correct. This goes really against what one could think. We then study in detail this algorithm in the more general framework of updatable timed automata, a model which has been introduced as a natural syntactic extension of classical timed automata. We describe subclasses of this model for which a correct widening operator can be found.     

From a Conceptual Framework for Agents and Objects to a Multi-Agent System Modeling Language

In this paper we propose a multi-agent system modeling language (MAS-ML) that extends UML (Unified Modeling Language) based on structural and dynamic properties presented in a conceptual framework (metamodel) called Taming Agents and Objects (TAO). Our focus is the adaptation according to TAO concepts of the static Class diagram and the interaction Sequence diagram proposed by UML. These two diagrams have been chosen because they are the most commonly used and because it is possible to use them to illustrate both the structural and dynamic aspects of TAO metamodel. We propose a conservative extension of the UML metamodel, which includes agent-related notions that are part of the TAO conceptual framework while preserving all object-related concepts, which constitute the UML metamodel. The main difference between our approach and the others presented in the literature is the clear definition and representation of the elements that compose MASs and their corresponding behavior. In order to extend UML with TAO non-object concepts, it is not possible to use only the three basic extensions mechanisms provided by UML and new metaclasses and stereotypes have been created and associated with the UML metamodel.     

Overview of the local production process of raw milk butter in Wallonia (Belgium)

This study aims to describe the procedures and practices used in local production of raw milk butter. The demand for local products is increasing; hence, there is a need to describe the practices used in the artisanal production of raw milk butter. Therefore, a survey of 147 raw milk butter producers was carried out. The results from the survey indicate that there is not one single way to produce butter at artisanal level. In terms of maturation, six temperature sequences were distinguished. Attention is required at every step of production starting from breeding.