Search results for "COD"
showing 10 items of 2985 documents
Prior precision modulates the minimisation of prediction error in human auditory cortex
2018
AbstractThe predictive coding model of perception proposes that successful representation of the perceptual world depends upon cancelling out the discrepancy between prediction and sensory input (i.e., prediction error). Recent studies further suggest a distinction between prediction error associated with non-predicted stimuli of different prior precision (i.e., inverse variance). However, it is not fully understood how prediction error from different precision levels is minimised in the predictive process. The current research used magnetoencephalography (MEG) to examine whether prior precision modulates the cortical dynamics of the making of perceptual inferences. We presented participant…
Scheda su Sentenza Corte EDU Kara c. Regno Unito n. 36528/97
2011
Non costituisce violazione dell’articolo 8 il divieto imposto ad un dipendente di sesso maschile di indossare abiti femminili sul luogo di lavoro. Quando, infatti, per la funzione svolta tale atteggiamento possa pregiudicare l’immagine e l’attività del datore di lavoro, l’interferenza nella vita privata dell’individuo deve considerarsi legittima, ai sensi del comma secondo dell’articolo 8 della Convenzione.
Algebras with intermediate growth of the codimensions
2006
AbstractLet F be a field of characteristic zero and let A be an F-algebra. The polynomial identities satisfied by A can be measured through the asymptotic behavior of the sequence of codimensions and the sequence of colengths of A. For finite dimensional algebras we show that the colength sequence of A is polynomially bounded and the codimension sequence cannot have intermediate growth. We then prove that for general nonassociative algebras intermediate growth of the codimensions is allowed. In fact, for any real number 0<β<1, we construct an algebra A whose sequence of codimensions grows like nnβ.
Asymptotics for Capelli polynomials with involution
2021
Let F be the free associative algebra with involution ∗ over a field F of characteristic zero. We study the asymptotic behavior of the sequence of ∗- codimensions of the T-∗-ideal Γ∗ M+1,L+1 of F generated by the ∗-Capelli polynomials Cap∗ M+1[Y, X] and Cap∗ L+1[Z, X] alternanting on M + 1 symmetric variables and L + 1 skew variables, respectively. It is well known that, if F is an algebraic closed field of characteristic zero, every finite dimensional ∗-simple algebra is isomorphic to one of the following algebras: · (Mk(F ), t) the algebra of k × k matrices with the transpose involution; · (M2m(F ), s) the algebra of 2m × 2m matrices with the symplectic involution; · (Mh(F ) ⊕ Mh(F )op, e…
A Geometric Algebra Based Distributional Model to Encode Sentences Semantics
2013
Word space models are used to encode the semantics of natural language elements by means of high dimensional vectors [23]. Latent Semantic Analysis (LSA) methodology [15] is well known and widely used for its generalization properties. Despite of its good performance in several applications, the model induced by LSA ignores dynamic changes in sentences meaning that depend on the order of the words, because it is based on a bag of words analysis. In this chapter we present a technique that exploits LSA-based semantic spaces and geometric algebra in order to obtain a sub-symbolic encoding of sentences taking into account the words sequence in the sentence. © 2014 Springer-Verlag Berlin Heidel…
Lightweight algorithms for constructing and inverting the BWT of string collections
2013
Recent progress in the field of \{DNA\} sequencing motivates us to consider the problem of computing the Burrows‚ÄìWheeler transform (BWT) of a collection of strings. A human genome sequencing experiment might yield a billion or more sequences, each 100 characters in length. Such a dataset can now be generated in just a few days on a single sequencing machine. Many algorithms and data structures for compression and indexing of text have the \{BWT\} at their heart, and it would be of great interest to explore their applications to sequence collections such as these. However, computing the \{BWT\} for 100 billion characters or more of data remains a computational challenge. In this work we ad…
Silhouette encoding and synthesis using elliptic Fourier descriptors, and applications to videoconferencing
2004
Abstract This paper investigates the use of elliptic Fourier descriptors as a shape descriptor for encoding the silhouette of a person. Shape descriptors are here used for predicting the shape of silhouettes in missing frames within a sequence. This prediction scheme is applied to the case of generating in-between images in a low frame rate videoconferencing system, where the reconstructed silhouette is used as a binary mask for reducing the computational time for the frame reconstruction.
PMG-Pro: A Model-Driven Development Method of Service-Based Applications
2011
Published version of a chapter published in the book: SDL 2011: Integrating System and Software Modeling. Also available from the publisher at: http://dx.doi.org/10.1007/978-3-642-25264-8_12 In the Internet of Things, billions of networked and software-driven devices will be connected to the Internet. They can communicate and cooperate with each other to form a composite system. In this paper, we propose PMG-pro (present, model, generate and provide), a language independent, bottom-up and model-driven method for the development of such composite system. We envision that all devices in the Internet of Things provide their functionalities as services. From a service description, a service pre…
Discovering web services in social web service repositories using deep variational autoencoders
2020
Abstract Web Service registries have progressively evolved to social networks-like software repositories. Users cooperate to produce an ever-growing, rich source of Web APIs upon which new value-added Web applications can be built. Such users often interact in order to follow, comment on, consume and compose services published by other users. In this context, Web Service discovery is a core functionality of modern registries as needed Web Services must be discovered before being consumed or composed. Many efforts to provide effective keyword-based service discovery mechanisms are based on Information Retrieval techniques as services are described using structured or unstructured textdocumen…
A New Multicast Technique for Video Transmission over ABR Services in ATM Networks
2000
Multicast techniques are the only way to simultaneously provide flows of information from one source to several destinations. The intention of this paper is to study and to evaluate different multicast techniques using a video coder based on an adaptive video compression algorithm with subband coding and a best effort network service like ATM with the Available Bit Rate (ABR) service. This video transmission can adapt faster and easily to changing network conditions. In this way, we present an evaluation process for a determined network configuration. Thereafter we discuss the results obtained by simulation and propose for this video transmission a trade-off between these multicast techniqu…