@neurIST infrastructure for advanced disease management through integration of heterogeneous data, computing, and complex processing services

The increasing volume of data describing humandisease processes and the growing complexity of understanding, managing, and sharing such data presents a huge challenge for clinicians and medical researchers. This paper presents the@neurIST system, which provides an infrastructure for biomedical research while aiding clinical care, by bringing together heterogeneous data and complex processing and computing services. Although @neurIST targets the investigation and treatment of cerebral aneurysms, the system’s architecture is generic enough that it could be adapted to the treatment of other diseases.Innovations in @neurIST include confining the patient data pertaining to aneurysms inside a single environment that offers cliniciansthe tools to analyze and interpret patient data and make use of knowledge-based guidance in planning their treatment. Medicalresearchers gain access to a critical mass of aneurysm related data due to the system’s ability to federate distributed informationsources. A semantically mediated grid infrastructure ensures that both clinicians and researchers are able to seamlessly access andwork on data that is distributed across multiple sites in a secure way in addition to providing computing resources on demand forperforming computationally intensive simulations for treatment planning and research.

Computing infinite plans for LTL goals using a classical planner

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.

Implementing interactive computing in an object-oriented environment

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.

Computing congruences of modular forms and Galois representations modulo prime powers

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.

Mathematics in Catalonia: 1996-2002

The aim of this article is to present the main conclusions of the Report on research in Catalonia for the area of mathematics**. The report was prepared by Joaquim Bruna, Marta Sanz, Joan de Solà-Morales and the author of this text, and published by the Institute for Catalan Studies in 1998. In the report, scientific activity in the area of mathematics was measured essentially by examining two parameters: papers published in specialised journals and doctoral theses read. It should be recognised that a considerable amount of activity in the field of mathematics consists of applying existing knowledge to the resolution of practical technological problems that arise in particular companies. This kind of scientific activity was not measured in any way in the report due to the difficulty of obtaining objective data. This article is divided into the following sections: human resources, scientific production, funding, research publications, research centres, and conclusions.

A Spanish version of the short Mathematics Anxiety Rating Scale (sMARS)

The aim of this studywas to adapt and assess the psychometric properties of the Spanish version of the sMARS in terms of evidence of validity and reliability of scores. The sMARS was administered to 342 students and, in order to assess convergent and discriminant validity, several subsamples completed a series of related tests. The factorial structure of the sMARSwas analyzed by means of a confirmatory factor analysis and results showed that the three-factor structure reported in the original test fits well with the data. Thus, three dimensions were established in the test: math test, numerical task and math course anxiety. The results of this study provide sound evidence that demonstrates the good psychometric properties of the scores of the Spanish version of the sMARS: strong internal consistency, high 7-week testretest reliability and good convergent/discriminant validity were evident. Overall, this study provides an instrument that allows us to obtain valid and reliable math anxiety measurements. This instrument may be a useful tool for educators and psychologists interested in identifying individuals that may have a low level of math mastery because of their anxiety.

Line search multilevel optimization as computational methods for dense optical flow

We evaluate the performance of different optimization techniques developed in the context of optical flow computation with different variational models. In particular, based on truncated Newton methods (TN) that have been an effective approach for large-scale unconstrained optimization, we de- velop the use of efficient multilevel schemes for computing the optical flow. More precisely, we evaluate the performance of a standard unidirectional mul- tilevel algorithm - called multiresolution optimization (MR/OPT), to a bidrec- tional multilevel algorithm - called full multigrid optimization (FMG/OPT). The FMG/OPT algorithm treats the coarse grid correction as an optimiza- tion search direction and eventually scales it using a line search. Experimental results on different image sequences using four models of optical flow com- putation show that the FMG/OPT algorithm outperforms both the TN and MR/OPT algorithms in terms of the computational work and the quality of the optical flow estimation.

Are figures accessible in mathematics academic journals?

Are figures accessible in mathematics academic journals? An analysis of current image accessibility in highly cited mathematics journals.

Are figures accessible in mathematics academic journals?

Are figures accessible in mathematics academic journals? An analysis of current image accessibility in highly cited mathematics journals.

Coscheduling techniques and monitoring tools for non-dedicated cluster computing

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.

Teaching fundamentals of computing theory: a constructivist approach

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.

Why Mathematics is essential in Biomedical Sciences degree?

Improvement of mathematical education and motivation of students in the mathematics" area is needed. What can be done? We introduce some ideas to generate the student"s interest for mathematics, because they often present difficulties in appreciating the relevance of mathematics and its role in the health sciences. We consider that a cornerstone in the strategy to attract the students" interest is linking the mathematics with real biomedical situations. We proceed in the following manner: We first present a real biomedical situation to produce interest and to generate curiosity. Second, we ask thought-provoking questions to students as: Which is the biomedical problem presented? Which is my knowledge on this situation? What could I do to solve this biomedical situation? Do I need some new mathematical concepts and procedures? Thereupon, the teacher explains the mathematical concepts necessary to solve the case presented, providing definitions, properties and tools for graphical display and/or mathematical calculations. In this learning methodology, ICTs were cornerstones for reaching the proposed competences. Furthermore, ICTs can also be used in the evaluative task in its two possible aspects: formative and for obtaining a qualification. Comments from students about this new mathematics teaching method indicate that the use of real biomedical case studies kept the lessons in mathematics interesting.

Concurrent : Easy to use Python computing environment

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.