Search results for "CoDi"
showing 10 items of 1391 documents
Formal verification of a Cooperative Automatic Repeat reQuest MAC protocol
2012
Author's version of an article published in the journal: Computer Standards & Interfaces. Also available from the publisher at: http://dx.doi.org/10.1016/j.csi.2011.12.001 Cooperative communications, in which a relay node helps the source node to deliver its packets to the destination node, are able to obtain significant benefits in terms of transmission reliability, coverage extension and energy efficiency. A Cooperative Automatic Repeat reQuest (C-ARQ) MAC protocol has been recently proposed to exploit cooperative diversity at the MAC layer. in this paper, we validate the integrity and the validity of the C-ARQ protocol using formal methods. The protocol logic is modeled in SDL and implem…
The nature of quantities influences the representation of arithmetic problems: evidence from drawings and solving procedures in children and adults
2017
International audience; When solving arithmetic problems, semantic factors influence the representations built (Gamo, Sander & Richard, 2010). In order to specify such interpretative processes, we created structurally isomorphic word problems that could be solved with two distinct algorithms. We tested whether a distinction between cardinal and ordinal quantities would lead solvers, due to their daily-life knowledge, to build different representations, influencing their strategies as well as the nature of their drawings. We compared 5th grade children and adults in order to assess the validity of this hypothesis with participants of varying arithmetic proficiency. The results confirmed that…
Eukaryotic snoRNAs: a paradigm for gene expression flexibility.
2009
AbstractSmall nucleolar RNAs (snoRNAs) are one of the most ancient and numerous families of non-protein-coding RNAs (ncRNAs). The main function of snoRNAs – to guide site-specific rRNA modification – is the same in Archaea and all eukaryotic lineages. In contrast, as revealed by recent genomic and RNomic studies, their genomic organization and expression strategies are the most varied. Seemingly snoRNA coding units have adopted, in the course of evolution, all the possible ways of being transcribed, thus providing a unique paradigm of gene expression flexibility. By focusing on representative fungal, plant and animal genomes, we review here all the documented types of snoRNA gene organizati…
Minimal star-varieties of polynomial growth and bounded colength
2018
Abstract Let V be a variety of associative algebras with involution ⁎ over a field F of characteristic zero. Giambruno and Mishchenko proved in [6] that the ⁎-codimension sequence of V is polynomially bounded if and only if V does not contain the commutative algebra D = F ⊕ F , endowed with the exchange involution, and M , a suitable 4-dimensional subalgebra of the algebra of 4 × 4 upper triangular matrices , endowed with the reflection involution. As a consequence the algebras D and M generate the only varieties of almost polynomial growth. In [20] the authors completely classify all subvarieties and all minimal subvarieties of the varieties var ⁎ ( D ) and var ⁎ ( M ) . In this paper we e…
Polynomial growth and star-varieties
2016
Abstract Let V be a variety of associative algebras with involution over a field F of characteristic zero and let c n ⁎ ( V ) , n = 1 , 2 , … , be its ⁎-codimension sequence. Such a sequence is polynomially bounded if and only if V does not contain the commutative algebra F ⊕ F , endowed with the exchange involution, and M, a suitable 4-dimensional subalgebra of the algebra of 4 × 4 upper triangular matrices. Such algebras generate the only varieties of ⁎-algebras of almost polynomial growth, i.e., varieties of exponential growth such that any proper subvariety is polynomially bounded. In this paper we completely classify all subvarieties of the ⁎-varieties of almost polynomial growth by gi…
Der kontaminierte Hippokrates: Textkritischer Wert und Vorlagen der Handschrift Parisinus gr. 2142.
2014
Il manoscritto Parisinus Graecus 2142 è uno dei più antichi ed importanti tra i cosiddetti codici recenziori della tradizione manoscritta del corpus ippocratico, e si presta particolarmente per la sua natura bipartita e contaminata ad essere riesaminato dal punto di vista del suo valore per l'editore di testi ippocratici. Una tale analisi critica non può prescindere dal problema delle origini delle contaminazioni cui le diverse mani che hanno vergato il Parisinus avrebbero avuto accesso. L'analisi dettagliata delle diverse mani correttrici e del loro apporto alla constitutio del testo di un campione significativo di scritti ippocratici mostra il particolare rilievo del Parisinus, specie del…
ETAT: Expository Text Analysis Tool.
2002
Qualitative methods that analyze the coherence of expository texts not only are time consuming, but also present challenges in collecting data on coding reliability. We describe software that analyzes expository texts more rapidly and produces a notable level of objectivity. ETAT (Expository Text Analysis Tool) analyzes the coherence of expository texts. ETAT adopts a symbolic representational system, known as conceptual graph structures. ETAT follows three steps: segmentation of a text into nodes, classification of the unidentified nodes, and linking the nodes with relational arcs. ETAT automatically constructs a graph in the form of nodes and their interrelationships, along with various a…
Improving Karhunen-Loeve based transform coding by using square isometries
2002
We propose, for an image compression system based on the Karhunen-Loeve transform implemented by neural networks, to take into consideration the 8 square isometries of an image block. The proper isometry applied puts the 8*8 square image block in a standard position, before applying the image block as input to the neural network architecture. The standard position is defined based on the variance of its four 4*4 sub-blocks (quadro partitioned) and brings the sub-block having the greatest variance in a specific corner and in another specific adjoining corner the sub-block having the second variance (if this is not possible the third is considered). The use of this "preprocessing" phase was e…
Concurrent and Distributed Projection through Local Interference for Wireless Sensor Networks
2012
In this paper we use a gossip algorithm to obtain the projection of the observed signal into a subspace of lower dimension. Gossip algorithms allow distributed, fast and efficient computations on a Wireless Sensor Network and they can be properly modified to evaluate the sought projection. By combining computation coding with gossip algorithms we proposed a novel strategy that leads to important saving on convergence time as well as exponentially decreasing energy consumption, as the size of the network increases.
Some thoughts about the conceptual / procedural distinction in translation: a key-logging and eye-tracking study of processing effort
2014
This article builds on the conceptual / procedural distinction postulated by Relevance Theory to investigate processing effort in translation task execution. Drawing on relevance-theoretic assumptions, it assumes that instances related to procedural encodings will require more effortful processing not only in relation to the time spent on the task but also in terms of product indicators such as seconds per word and number of micro translation units per word. Drawing on key-logging and eye-tracking data, the article shows that there are statistically significant differences when conceptual and procedural encodings are analysed in selected areas of interest, with instances related to procedur…