32 resultados para Affective Computing
Resumo:
Classical planning has been notably successful in synthesizing finite plans to achieve states where propositional goals hold. In the last few years, classical planning has also been extended to incorporate temporally extended goals, expressed in temporal logics such as LTL, to impose restrictions on the state sequences generated by finite plans. In this work, we take the next step and consider the computation of infinite plans for achieving arbitrary LTL goals. We show that infinite plans can also be obtained efficiently by calling a classical planner once over a classical planning encoding that represents and extends the composition of the planningdomain and the B¨uchi automaton representingthe goal. This compilation scheme has been implemented and a number of experiments are reported.
Resumo:
Statistical computing when input/output is driven by a Graphical User Interface is considered. A proposal is made for automatic control ofcomputational flow to ensure that only strictly required computationsare actually carried on. The computational flow is modeled by a directed graph for implementation in any object-oriented programming language with symbolic manipulation capabilities. A complete implementation example is presented to compute and display frequency based piecewise linear density estimators such as histograms or frequency polygons.
Resumo:
This article starts a computational study of congruences of modular forms and modular Galoisrepresentations modulo prime powers. Algorithms are described that compute the maximum integermodulo which two monic coprime integral polynomials have a root in common in a sensethat is defined. These techniques are applied to the study of congruences of modular forms andmodular Galois representations modulo prime powers. Finally, some computational results withimplications on the (non-)liftability of modular forms modulo prime powers and possible generalisationsof level raising are presented.
Resumo:
We consider the numerical treatment of the optical flow problem by evaluating the performance of the trust region method versus the line search method. To the best of our knowledge, the trust region method is studied here for the first time for variational optical flow computation. Four different optical flow models are used to test the performance of the proposed algorithm combining linear and nonlinear data terms with quadratic and TV regularization. We show that trust region often performs better than line search; especially in the presence of non-linearity and non-convexity in the model.
Resumo:
Background.Schizo-affective disorder has not been studied to any significant extent using functional imaging. The aim of this study was to examine patterns of brain activation and deactivation in patients meeting strict diagnostic criteria for the disorder. METHOD: Thirty-two patients meeting research diagnostic criteria (RDC) for schizo-affective disorder (16 schizomanic and 16 schizodepressive) and 32 matched healthy controls underwent functional magnetic resonance imaging (fMRI) during performance of the n-back task. Linear models were used to obtain maps of activations and deactivations in the groups. RESULTS: Controls showed activation in a network of frontal and other areas and also deactivation in the medial frontal cortex, the precuneus and the parietal cortex. Schizo-affective patients activated significantly less in prefrontal, parietal and temporal regions than the controls, and also showed failure of deactivation in the medial frontal cortex. When task performance was controlled for, the reduced activation in the dorsolateral prefrontal cortex (DLPFC) and the failure of deactivation of the medial frontal cortex remained significant. CONCLUSIONS: Schizo-affective disorder shows a similar pattern of reduced frontal activation to schizophrenia. The disorder is also characterized by failure of deactivation suggestive of default mode network dysfunction.
Resumo:
Background.Schizo-affective disorder has not been studied to any significant extent using functional imaging. The aim of this study was to examine patterns of brain activation and deactivation in patients meeting strict diagnostic criteria for the disorder. METHOD: Thirty-two patients meeting research diagnostic criteria (RDC) for schizo-affective disorder (16 schizomanic and 16 schizodepressive) and 32 matched healthy controls underwent functional magnetic resonance imaging (fMRI) during performance of the n-back task. Linear models were used to obtain maps of activations and deactivations in the groups. RESULTS: Controls showed activation in a network of frontal and other areas and also deactivation in the medial frontal cortex, the precuneus and the parietal cortex. Schizo-affective patients activated significantly less in prefrontal, parietal and temporal regions than the controls, and also showed failure of deactivation in the medial frontal cortex. When task performance was controlled for, the reduced activation in the dorsolateral prefrontal cortex (DLPFC) and the failure of deactivation of the medial frontal cortex remained significant. CONCLUSIONS: Schizo-affective disorder shows a similar pattern of reduced frontal activation to schizophrenia. The disorder is also characterized by failure of deactivation suggestive of default mode network dysfunction.
Resumo:
Background.Schizo-affective disorder has not been studied to any significant extent using functional imaging. The aim of this study was to examine patterns of brain activation and deactivation in patients meeting strict diagnostic criteria for the disorder. METHOD: Thirty-two patients meeting research diagnostic criteria (RDC) for schizo-affective disorder (16 schizomanic and 16 schizodepressive) and 32 matched healthy controls underwent functional magnetic resonance imaging (fMRI) during performance of the n-back task. Linear models were used to obtain maps of activations and deactivations in the groups. RESULTS: Controls showed activation in a network of frontal and other areas and also deactivation in the medial frontal cortex, the precuneus and the parietal cortex. Schizo-affective patients activated significantly less in prefrontal, parietal and temporal regions than the controls, and also showed failure of deactivation in the medial frontal cortex. When task performance was controlled for, the reduced activation in the dorsolateral prefrontal cortex (DLPFC) and the failure of deactivation of the medial frontal cortex remained significant. CONCLUSIONS: Schizo-affective disorder shows a similar pattern of reduced frontal activation to schizophrenia. The disorder is also characterized by failure of deactivation suggestive of default mode network dysfunction.
Resumo:
Our efforts are directed towards the understanding of the coscheduling mechanism in a NOW system when a parallel job is executed jointly with local workloads, balancing parallel performance against the local interactive response. Explicit and implicit coscheduling techniques in a PVM-Linux NOW (or cluster) have been implemented. Furthermore, dynamic coscheduling remains an open question when parallel jobs are executed in a non-dedicated Cluster. A basis model for dynamic coscheduling in Cluster systems is presented in this paper. Also, one dynamic coscheduling algorithm for this model is proposed. The applicability of this algorithm has been proved and its performance analyzed by simulation. Finally, a new tool (named Monito) for monitoring the different queues of messages in such an environments is presented. The main aim of implementing this facility is to provide a mean of capturing the bottlenecks and overheads of the communication system in a PVM-Linux cluster.
Resumo:
A Fundamentals of Computing Theory course involves different topics that are core to the Computer Science curricula and whose level of abstraction makes them difficult both to teach and to learn. Such difficulty stems from the complexity of the abstract notions involved and the required mathematical background. Surveys conducted among our students showed that many of them were applying some theoretical concepts mechanically rather than developing significant learning. This paper shows a number of didactic strategies that we introduced in the Fundamentals of Computing Theory curricula to cope with the above problem. The proposed strategies were based on a stronger use of technology and a constructivist approach. The final goal was to promote more significant learning of the course topics.
Resumo:
Background.Schizo-affective disorder has not been studied to any significant extent using functional imaging. The aim of this study was to examine patterns of brain activation and deactivation in patients meeting strict diagnostic criteria for the disorder. METHOD: Thirty-two patients meeting research diagnostic criteria (RDC) for schizo-affective disorder (16 schizomanic and 16 schizodepressive) and 32 matched healthy controls underwent functional magnetic resonance imaging (fMRI) during performance of the n-back task. Linear models were used to obtain maps of activations and deactivations in the groups. RESULTS: Controls showed activation in a network of frontal and other areas and also deactivation in the medial frontal cortex, the precuneus and the parietal cortex. Schizo-affective patients activated significantly less in prefrontal, parietal and temporal regions than the controls, and also showed failure of deactivation in the medial frontal cortex. When task performance was controlled for, the reduced activation in the dorsolateral prefrontal cortex (DLPFC) and the failure of deactivation of the medial frontal cortex remained significant. CONCLUSIONS: Schizo-affective disorder shows a similar pattern of reduced frontal activation to schizophrenia. The disorder is also characterized by failure of deactivation suggestive of default mode network dysfunction.
Resumo:
We consider the numerical treatment of the optical flow problem by evaluating the performance of the trust region method versus the line search method. To the best of our knowledge, the trust region method is studied here for the first time for variational optical flow computation. Four different optical flow models are used to test the performance of the proposed algorithm combining linear and nonlinear data terms with quadratic and TV regularization. We show that trust region often performs better than line search; especially in the presence of non-linearity and non-convexity in the model.
Resumo:
Concurrent aims to be a different type of task distribution system compared to what MPI like system do. It adds a simple but powerful application abstraction layer to distribute the logic of an entire application onto a swarm of clusters holding similarities with volunteer computing systems. Traditional task distributed systems will just perform simple tasks onto the distributed system and wait for results. Concurrent goes one step further by letting the tasks and the application decide what to do. The programming paradigm is then totally async without any waits for results and based on notifications once a computation has been performed.
Resumo:
Clúster format per una màquina principal HEAD Node més 19 nodes de càlcul de la gama SGI13 Altix14 XE Servers and Clusters, unides en una topologia de màster subordinat, amb un total de 40 processadors Dual Core i aproximadament 160Gb de RAM.