812 resultados para Autonomic Computing
Resumo:
El presente documento introduce a las pequeñas y medianas empresas en el mundo de la virtualización y el cloud computing. Partiendo de la presentación de ambas tecnologías, se recorren las diferentes fases por las que atraviesa un proyecto tecnológico consistente en la instalación de una plataforma virtualizada que alberga los sistemas informáticos básicos en una PYME.
Resumo:
Different procedures to obtain atom condensed Fukui functions are described. It is shown how the resulting values may differ depending on the exact approach to atom condensed Fukui functions. The condensed Fukui function can be computed using either the fragment of molecular response approach or the response of molecular fragment approach. The two approaches are nonequivalent; only the latter approach corresponds in general with a population difference expression. The Mulliken approach does not depend on the approach taken but has some computational drawbacks. The different resulting expressions are tested for a wide set of molecules. In practice one must make seemingly arbitrary choices about how to compute condensed Fukui functions, which suggests questioning the role of these indicators in conceptual density-functional theory
Resumo:
The alignment between competences, teaching-learning methodologies and assessment is a key element of the European Higher Education Area. This paper presents the efforts carried out by six Telematics, Computer Science and Electronic Engineering Education teachers towards achieving this alignment in their subjects. In a joint work with pedagogues, a set of recommended actions were identified. A selection of these actions were applied and evaluated in the six subjects. The cross-analysis of the results indicate that the actions allow students to better understand the methodologies and assessment planned for the subjects, facilitate (self-) regulation and increase students’ involvement in the subjects.
Resumo:
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.
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:
The purpose of this study was to investigate changes in post-exercise heart rate recovery (HRR) and heart rate variability (HRV) during an overload-tapering paradigm in marathon runners and examine their relationship with running performance. 9 male runners followed a training program composed of 3 weeks of overload followed by 3 weeks of tapering (-33±7%). Before and after overload and during tapering they performed an exhaustive running test (Tlim). At the end of this test, HRR variables (e.g. HRR during the first 60 s; HRR60 s) and vagal-related HRV indices (e.g. RMSSD5-10 min) were examined. Tlim did not change during the overload training phase (603±105 vs. 614±132 s; P=0.992), but increased (727±185 s; P=0.035) during the second week of tapering. Compared with overload, RMSSD5-10 min (7.6±3.3 vs. 8.6±2.9 ms; P=0.045) was reduced after the 2(nd) week of tapering. During tapering, the improvements in Tlim were negatively correlated with the change in HRR60 s (r=-0.84; P=0.005) but not RMSSD5-10 min (r=-0.21; P=0.59). A slower HRR during marathon tapering may be indicative of improved performance. In contrast, the monitoring of changes in HRV as measured in the present study (i.e. after exercise on a single day), may have little or no additive value.
Resumo:
To determine whether skin blood flow is local or takes part in general regulatory mechanisms, we recorded laser-Doppler flowmetry (LDF; left and right index fingers), blood pressure, muscle sympathetic nerve activity (MSNA), R-R interval, and respiration in 10 healthy volunteers and 3 subjects after sympathectomy. We evaluated 1) the synchronism of LDF fluctuations in two index fingers, 2) the relationship with autonomically mediated fluctuations in other signals, and 3) the LDF ability to respond to arterial baroreflex stimulation (by neck suction at frequencies from 0.02 to 0.20 Hz), using spectral analysis (autoregressive uni- and bivariate, time-variant algorithms). Synchronous LDF fluctuations were observed in the index fingers of healthy subjects but not in sympathectomized patients. LDF fluctuations were coherent with those obtained for blood pressure, MSNA, and R-R interval. LDF fluctuations were leading blood pressure in the low-frequency (LF; 0.1 Hz) band and lagging in the respiratory, high-frequency (HF; approximately 0.25 Hz) band, suggesting passive "downstream" transmission only for HF and "upstream" transmission for LF from the microvessels. LDF fluctuations were responsive to sinusoidal neck suction up to 0.1 Hz, indicating response to sympathetic modulation. Skin blood flow thus reflects modifications determined by autonomic activity, detectable by frequency analysis of spontaneous fluctuations.
Resumo:
Autonomic neuropathy is a well known complication of diabetes. Diabetes is often superimposed on obesity. A reduction in the variability of the heart rate in the resting state has been demonstrated in 16 obese diabetic subjects as well as in 34 obese non-diabetic subjects. The coefficient of variation (CV) of the heart rate during 30 minutes of resting was significantly decreased in both obese groups (3.9 +/- 0.2% for the diabetics; 5.2 +/- 0.2%, p less than 0.01 for the non diabetics) as compared to their own controls (4.5 +/- 0.6% and 6.5 +/- 0.4%, respectively). Age also contributes to decreased heart rate variability. Furthermore, this defect of autonomic function has been correlated with the blunted glucose-induced thermogenesis (GIT) seen in both obese groups (r = 0.52, p. less than 0.001): the increase in energy expenditure over basal values following a 100 g oral glucose load was only 4.8 +/- 0.8% for the diabetic obese group (p less than 0.001), and 8.5 +/- 0.7% for the non-diabetic obese group (p less than 0.001) as opposed to their own controls (12.4 +/- 1.3% and 13.3 +/- 0.6% respectively). Measurement of the variability of heart rate in obese individuals may be of predictive value in assessing blunted glucose-induced thermogenesis in non diabetic and diabetic obese patients.
Resumo:
This study looks at how increased memory utilisation affects throughput and energy consumption in scientific computing, especially in high-energy physics. Our aim is to minimise energy consumed by a set of jobs without increasing the processing time. The earlier tests indicated that, especially in data analysis, throughput can increase over 100% and energy consumption decrease 50% by processing multiple jobs in parallel per CPU core. Since jobs are heterogeneous, it is not possible to find an optimum value for the number of parallel jobs. A better solution is based on memory utilisation, but finding an optimum memory threshold is not straightforward. Therefore, a fuzzy logic-based algorithm was developed that can dynamically adapt the memory threshold based on the overall load. In this way, it is possible to keep memory consumption stable with different workloads while achieving significantly higher throughput and energy-efficiency than using a traditional fixed number of jobs or fixed memory threshold approaches.
Resumo:
Motivation: Genome-wide association studies have become widely used tools to study effects of genetic variants on complex diseases. While it is of great interest to extend existing analysis methods by considering interaction effects between pairs of loci, the large number of possible tests presents a significant computational challenge. The number of computations is further multiplied in the study of gene expression quantitative trait mapping, in which tests are performed for thousands of gene phenotypes simultaneously. Results: We present FastEpistasis, an efficient parallel solution extending the PLINK epistasis module, designed to test for epistasis effects when analyzing continuous phenotypes. Our results show that the algorithm scales with the number of processors and offers a reduction in computation time when several phenotypes are analyzed simultaneously. FastEpistasis is capable of testing the association of a continuous trait with all single nucleotide polymorphism ( SNP) pairs from 500 000 SNPs, totaling 125 billion tests, in a population of 5000 individuals in 29, 4 or 0.5 days using 8, 64 or 512 processors.
Resumo:
The M-Coffee server is a web server that makes it possible to compute multiple sequence alignments (MSAs) by running several MSA methods and combining their output into one single model. This allows the user to simultaneously run all his methods of choice without having to arbitrarily choose one of them. The MSA is delivered along with a local estimation of its consistency with the individual MSAs it was derived from. The computation of the consensus multiple alignment is carried out using a special mode of the T-Coffee package [Notredame, Higgins and Heringa (T-Coffee: a novel method for fast and accurate multiple sequence alignment. J. Mol. Biol. 2000; 302: 205-217); Wallace, O'Sullivan, Higgins and Notredame (M-Coffee: combining multiple sequence alignment methods with T-Coffee. Nucleic Acids Res. 2006; 34: 1692-1699)] Given a set of sequences (DNA or proteins) in FASTA format, M-Coffee delivers a multiple alignment in the most common formats. M-Coffee is a freeware open source package distributed under a GPL license and it is available either as a standalone package or as a web service from www.tcoffee.org.