Search results for "Multia"
showing 10 items of 159 documents
Simulation-based estimation of branching models for LTR retrotransposons
2017
Abstract Motivation LTR retrotransposons are mobile elements that are able, like retroviruses, to copy and move inside eukaryotic genomes. In the present work, we propose a branching model for studying the propagation of LTR retrotransposons in these genomes. This model allows us to take into account both the positions and the degradation level of LTR retrotransposons copies. In our model, the duplication rate is also allowed to vary with the degradation level. Results Various functions have been implemented in order to simulate their spread and visualization tools are proposed. Based on these simulation tools, we have developed a first method to evaluate the parameters of this propagation …
Laser light scattering and polydispersity of polymers
1977
The application of lasers to light scattering improves the potentials of elastic scattering, especially in the high molecular weight range and enables the technique of inelastic scattering to be used. For elastic light scattering an experimental arrangement and an evaluation method is described which allows, within appropriate molecular weight ranges, the determination of the ratio Mw/Mn from the experimental scattering function with an accuracy down to 0.02. The newer technique of inelastic light scattering yields the coefficient of translational diffusion D. Besides D, the friction coefficient f is also directly accessible. The basic equations are reported, as well as an application to mi…
Robust dynamic cooperative games
2009
Classical cooperative game theory is no longer a suitable tool for those situations where the values of coalitions are not known with certainty. Recent works address situations where the values of coalitions are modelled by random variables. In this work we still consider the values of coalitions as uncertain, but model them as unknown but bounded disturbances. We do not focus on solving a specific game, but rather consider a family of games described by a polyhedron: each point in the polyhedron is a vector of coalitions’ values and corresponds to a specific game. We consider a dynamic context where while we know with certainty the average value of each coalition on the long run, at each t…
The Italian version of the Depressive Experiences Questionnaire: psychometric properties and validation in students, community, and clinical groups
2017
The current study evaluated the psychometric properties of the Italian validation of the Depressive Experiences Questionnaire (DEQ), conceived as a measure of self-criticism and dependency, i.e. two personality factors acting, according to Blatt (2004), as risk factors for depression in particular and psychopathology in general. A series of standardized measures [Beck Depression Inventory-II (BDI-II), DEQ, Symptom Checklist-90-R (SCL-90-R), Millon Clinical Multiaxial Inventory, 3rd edition (MCMI-III)] was administered to three samples (i.e., students, community and clinical). Factorial validity was evaluated along with convergent and predictive validity. In order to evaluate the reliability…
Influencia del ángulo de observación en la estimación del índice de área foliar (LAI) mediante imágenes PROBA/CHRIS
2016
La estimación de variables biofísicas como el Índice de Área Foliar (LAI) mediante técnicas de teledetección es objeto de numerosos estudios, ya que de su conocimiento se puede extraer valiosa información sobre el estado de la vegetación. En este trabajo se estudia la estimación del LAI mediante imágenes multiangulares PROBA/CHRIS, analizando el comportamiento de la reflectividad medida en sus 5 ángulos de observación, en las longitudes de onda de 665 y 705 nm correspondientes a la banda de absorción de la clorofila y la reflectividad de la vegetación en el Red-Edge, respectivamente. El Índice de Diferencia Normalizada (NDI) calculado en estas longitudes de onda, mostró una buena correlació…
Efficient cluster-based routing algorithm for body sensor networks
2018
International audience; Body Sensor Networks have gained a lot of research interest lately for the variety of applications they can serve. In such networks where nodes might hold critical information about people's lives, designing efficient routing schemes is very important to guarantee data delivery with the lowest delay and energy consumption. Even though some cluster-based routing schemes were proposed in the literature, none of them offer a complete solution that guarantees energy and delay efficient routing in BSN. In this paper, we propose a robust cluster- based algorithm that increases the routing efficiency through every step of the routing process: cluster formation, cluster head…
Deciding properties of integral relational automata
1994
This paper investigates automated model checking possibilities for CTL* formulae over infinite transition systems represented by relational automata (RA). The general model checking problem for CTL* formulae over RA is shown undecidable, the undecidability being observed already on the class of Restricted CTL formulae. The decidability result, however, is obtained for another substantial subset of the logic, called A-CTL*+, which includes all ”linear time” formulae.
A Similarity Evaluation Technique for Cooperative Problem Solving with a Group of Agents
1999
Evaluation of distance or similarity is very important in cooperative problem solving with a group of agents. Distance between problems is used by agents to recognize nearest solved problems for a new problem, distance between solutions is necessary to compare and evaluate the solutions made by different agents, and distance between agents is useful to evaluate weights of the agents to be able to integrate them by weighted voting. The goal of this paper is to develop a similarity evaluation technique to be used for cooperative problem solving with a group of agents. Virtual training environment used for this goal is represented by predicates that define relationships within three sets: prob…
Serial In-network Processing for Large Stationary Wireless Sensor Networks
2017
International audience; In wireless sensor networks, a serial processing algorithm browses nodes one by one and can perform different tasks such as: creating a schedule among nodes, querying or gathering data from nodes, supplying nodes with data, etc. Apart from the fact thatserial algorithms totally avoid collisions, numerous recent works have confirmed that these algorithms reduce communications andconsiderably save energy and time in large-dense networks. Yet, due to the path construction complexity, the proposed algorithmsare not optimal and their performances can be further enhanced. To do so, in the present paper, we propose a new serial processing algorithm that, in most of the case…
Non-linear protocols for optimal distributed consensus in networks of dynamic agents
2006
We consider stationary consensus protocols for networks of dynamic agents with fixed topologies. At each time instant, each agent knows only its and its neighbors'' state, but must reach consensus on a group decision value that is function of all the agents'' initial state. We show that the agents can reach consensus if the value of such a function is time-invariant when computed over the agents'' state trajectories. We use this basic result to introduce a non-linear protocol design rule allowing consensus on a quite general set of values. Such a set includes, e.g., any generalized mean of order p of the agents'' initial states. As a second contribution we show that our protocol design is t…