Parameterised bounds on the sum of variables in time-series constraints

For two families of time-series constraints with the aggregator Sum and features one and width, we provide parameterised sharp lower and upper bounds on the sum of the time-series variables wrt these families of constraints. This is important in many applications, as this sum represents the cost, for example the energy used, or the manpower effort expended. We use these bounds not only to gain a priori knowledge of the overall cost of a problem, we can also use them on increasing prefixes and suffixes of the variables to avoid infeasible partial assignments under a given cost budget. Experiments show that the bounds drastically reduce the effort to find cost limited solutions

Topological Interpretation of Interactive Computation

It is a great pleasure to write this tribute in honor of Scott A. Smolka on his 65th birthday. We revisit Goldin, Smolka hypothesis that persistent Turing machine (PTM) can capture the intuitive notion of sequential interaction computation. We propose a topological setting to model the abstract concept of environment. We use it to define a notion of a topological Turing machine (TTM) as a universal model for interactive computation and possible model for concurrent computation

Recovery of mode shapes from continuous scanning laser doppler vibration data: A mode matching frequency domain approach

The paper illustrates a method for processing, in a blind way, data obtained by Continuous Scanning Laser Doppler Vibrometry (CSLDV). CSLDV makes it possible to measure the structure vibration joining together the spatial and time information. The vibration datum obtained from the laser, which continuously scans (over time and space) the structure under test, is in fact modulated by the Operational Deflection Shape (ODS) excited during the experiment. The idea that we propose in this paper is based on the fact that, if the mode shapes of the structure under test are known a priori, e.g. from a numerical model or from an analytical formulation, it is possible to settle a procedure that searches for similarities between those known mode shapes (the candidate mode shapes) and ODSs that actually modulate the signal. This procedure can be considered a pattern matching technique that makes it possible to identify the resonance frequency related to each ODS and the mode shapes that better match with ODSs excited. A detailed description of the algorithm is given in this paper

International review of natural family planning

. Linear constraint databases (LCDBs) extend relational databases to include linear arithmetic constraints in both relations and queries. A LCDB can also be viewed as a powerful extension of linear programming (LP) where the system of constraints is generalized to a database containing constraints and the objective function is generalized to a relational query containing constraints. Our major concern is query optimization in LCDBs. Traditional database approaches are not adequate for combination with LP technology. Instead, we propose a new query optimization approach, based on statistical estimations and iterated trials of potentially better evaluation plans. The resulting algorithms are not only effective on LCDBs, but also applicable to existing query languages. A number of specific constraint algebra algorithms are also developed: select-project-join for two relations, constraint sortjoin and constraint multi-join. 1. Introduction Linear programming/linear constraints is a tech..

The Turing Machine Paradigm in Contemporary Computing

this paper we will extend the Turing machine paradigm to include several key features of contemporary information processing systems

Lactic acid bacteria: reviewing the potential of a promising delivery live vector for biomedical purposes

Lactic acid bacteria (LAB) have a long history of safe exploitation by humans, being used for centuries in food production and preservation and as probiotic agents to promote human health. Interestingly, some species of these Gram-positive bacteria, which are generally recognized as safe organisms by the US Food and Drug Administration (FDA), are able to survive through the gastrointestinal tract (GIT), being capable to reach and colonize the intestine, where they play an important role. Besides, during the last decades, an important effort has been done for the development of tools to use LAB as microbial cell factories for the production of proteins of interest. Given the need to develop effective strategies for the delivery of prophylactic and therapeutic molecules, LAB have appeared as an appealing option for the oral, intranasal and vaginal delivery of such molecules. So far, these genetically modified organisms have been successfully used as vehicles for delivering functional proteins to mucosal tissues in the treatment of many different pathologies including GIT related pathologies, diabetes, cancer and viral infections, among others. Interestingly, the administration of such microorganisms would suppose a significant decrease in the production cost of the treatments agents since being live organisms, such vectors would be able to autonomously amplify and produce and deliver the protein of interest. In this context, this review aims to provide an overview of the use of LAB engineered as a promising alternative as well as a safety delivery platform of recombinant proteins for the treatment of a wide range of diseases