802 resultados para Playful Computing
Resumo:
Immunological systems have been an abundant inspiration to contemporary computer scientists. Problem solving strategies, stemming from known immune system phenomena, have been successfully applied to chall enging problems of modem computing. Simulation systems and mathematical modeling are also beginning use to answer more complex immunological questions as immune memory process and duration of vaccines, where the regulation mechanisms are not still known sufficiently (Lundegaard, Lund, Kesmir, Brunak, Nielsen, 2007). In this article we studied in machina a approach to simulate the process of antigenic mutation and its implications for the process of memory. Our results have suggested that the durability of the immune memory is affected by the process of antigenic mutation.and by populations of soluble antibodies in the blood. The results also strongly suggest that the decrease of the production of antibodies favors the global maintenance of immune memory.
Resumo:
Formal Concept Analysis is an unsupervised machine learning technique that has successfully been applied to document organisation by considering documents as objects and keywords as attributes. The basic algorithms of Formal Concept Analysis then allow an intelligent information retrieval system to cluster documents according to keyword views. This paper investigates the scalability of this idea. In particular we present the results of applying spatial data structures to large datasets in formal concept analysis. Our experiments are motivated by the application of the Formal Concept Analysis idea of a virtual filesystem [11,17,15]. In particular the libferris [1] Semantic File System. This paper presents customizations to an RD-Tree Generalized Index Search Tree based index structure to better support the application of Formal Concept Analysis to large data sources.
Resumo:
Chorea-acanthocytosis (ChAc) is an uncommon autosomal recessive disorder due to mutations of the VPS13A gene, which encodes for the membrane protein chorein. ChAc presents with progressive limb and orobuccal chorea, but there is often a marked dysexecutive syndrome. ChAc may first present with neuropsychiatric disturbance such as obsessive-compulsive disorder (OCD), suggesting a particular role for disruption to striatal structures involved in non-motor frontostriatal loops, such as the head of the caudate nucleus. Two previous studies have suggested a marked reduction in volume in the caudate nucleus and putamen, but did not examine morphometric change. We investigated morphometric change in 13 patients with genetically or biochemically confirmed ChAc and 26 age- and gender-matched controls. Subjects underwent magnetic resonance imaging and manual segmentation of the caudate nucleus and putamen, and shape analysis using a non-parametric spherical harmonic technique. Both structures showed significant and marked reductions in volume compared with controls, with reduction greatest in the caudate nucleus. Both structures showed significant shape differences, particularly in the head of the caudate nucleus. No significant correlation was shown between duration of illness and striatal volume or shape, suggesting that much structural change may have already taken place at the time of symptom onset. Our results suggest that striatal neuron loss may occur early in the disease process, and follows a dorsal-ventral gradient that may correlate with early neuropsychiatric and cognitive presentations of the disease. (C) 2010 Elsevier Ireland Ltd. All rights reserved.
Resumo:
Grobner bases have been generalised to polynomials over a commutative ring A in several ways. Here we focus on strong Grobner bases, also known as D-bases. Several authors have shown that strong Grobner bases can be effectively constructed over a principal ideal domain. We show that this extends to any principal ideal ring. We characterise Grobner bases and strong Grobner bases when A is a principal ideal ring. We also give algorithms for computing Grobner bases and strong Grobner bases which generalise known algorithms to principal ideal rings. In particular, we give an algorithm for computing a strong Grobner basis over a finite-chain ring, for example a Galois ring.
Resumo:
Classical dynamics is formulated as a Hamiltonian flow in phase space, while quantum mechanics is formulated as unitary dynamics in Hilbert space. These different formulations have made it difficult to directly compare quantum and classical nonlinear dynamics. Previous solutions have focused on computing quantities associated with a statistical ensemble such as variance or entropy. However a more diner comparison would compare classical predictions to the quantum predictions for continuous simultaneous measurement of position and momentum of a single system, in this paper we give a theory of such measurement and show that chaotic behavior in classical systems fan be reproduced by continuously measured quantum systems.