ADAM: A Decentralized Parallel Computer Architecture Featuring Fast Thread and Data Migration and a Uniform Hardware Abstraction

The furious pace of Moore's Law is driving computer architecture into a realm where the the speed of light is the dominant factor in system latencies. The number of clock cycles to span a chip are increasing, while the number of bits that can be accessed within a clock cycle is decreasing. Hence, it is becoming more difficult to hide latency. One alternative solution is to reduce latency by migrating threads and data, but the overhead of existing implementations has previously made migration an unserviceable solution so far. I present an architecture, implementation, and mechanisms that reduces the overhead of migration to the point where migration is a viable supplement to other latency hiding mechanisms, such as multithreading. The architecture is abstract, and presents programmers with a simple, uniform fine-grained multithreaded parallel programming model with implicit memory management. In other words, the spatial nature and implementation details (such as the number of processors) of a parallel machine are entirely hidden from the programmer. Compiler writers are encouraged to devise programming languages for the machine that guide a programmer to express their ideas in terms of objects, since objects exhibit an inherent physical locality of data and code. The machine implementation can then leverage this locality to automatically distribute data and threads across the physical machine by using a set of high performance migration mechanisms. An implementation of this architecture could migrate a null thread in 66 cycles -- over a factor of 1000 improvement over previous work. Performance also scales well; the time required to move a typical thread is only 4 to 5 times that of a null thread. Data migration performance is similar, and scales linearly with data block size. Since the performance of the migration mechanism is on par with that of an L2 cache, the implementation simulated in my work has no data caches and relies instead on multithreading and the migration mechanism to hide and reduce access latencies.

Compact Representations for Fast Nonrigid Registration of Medical Images

We develop efficient techniques for the non-rigid registration of medical images by using representations that adapt to the anatomy found in such images. Images of anatomical structures typically have uniform intensity interiors and smooth boundaries. We create methods to represent such regions compactly using tetrahedra. Unlike voxel-based representations, tetrahedra can accurately describe the expected smooth surfaces of medical objects. Furthermore, the interior of such objects can be represented using a small number of tetrahedra. Rather than describing a medical object using tens of thousands of voxels, our representations generally contain only a few thousand elements. Tetrahedra facilitate the creation of efficient non-rigid registration algorithms based on finite element methods (FEM). We create a fast, FEM-based method to non-rigidly register segmented anatomical structures from two subjects. Using our compact tetrahedral representations, this method generally requires less than one minute of processing time on a desktop PC. We also create a novel method for the non-rigid registration of gray scale images. To facilitate a fast method, we create a tetrahedral representation of a displacement field that automatically adapts to both the anatomy in an image and to the displacement field. The resulting algorithm has a computational cost that is dominated by the number of nodes in the mesh (about 10,000), rather than the number of voxels in an image (nearly 10,000,000). For many non-rigid registration problems, we can find a transformation from one image to another in five minutes. This speed is important as it allows use of the algorithm during surgery. We apply our algorithms to find correlations between the shape of anatomical structures and the presence of schizophrenia. We show that a study based on our representations outperforms studies based on other representations. We also use the results of our non-rigid registration algorithm as the basis of a segmentation algorithm. That algorithm also outperforms other methods in our tests, producing smoother segmentations and more accurately reproducing manual segmentations.

Fast Learning by Bounding Likelihoods in Sigmoid Type Belief Networks

Sigmoid type belief networks, a class of probabilistic neural networks, provide a natural framework for compactly representing probabilistic information in a variety of unsupervised and supervised learning problems. Often the parameters used in these networks need to be learned from examples. Unfortunately, estimating the parameters via exact probabilistic calculations (i.e, the EM-algorithm) is intractable even for networks with fairly small numbers of hidden units. We propose to avoid the infeasibility of the E step by bounding likelihoods instead of computing them exactly. We introduce extended and complementary representations for these networks and show that the estimation of the network parameters can be made fast (reduced to quadratic optimization) by performing the estimation in either of the alternative domains. The complementary networks can be used for continuous density estimation as well.

Fast Object Recognition in Noisy Images Using Simulated Annealing

A fast simulated annealing algorithm is developed for automatic object recognition. The normalized correlation coefficient is used as a measure of the match between a hypothesized object and an image. Templates are generated on-line during the search by transforming model images. Simulated annealing reduces the search time by orders of magnitude with respect to an exhaustive search. The algorithm is applied to the problem of how landmarks, for example, traffic signs, can be recognized by an autonomous vehicle or a navigating robot. The algorithm works well in noisy, real-world images of complicated scenes for model images with high information content.

Fast Sorting on a Distributed-Memory Architecture

We consider the often-studied problem of sorting, for a parallel computer. Given an input array distributed evenly over p processors, the task is to compute the sorted output array, also distributed over the p processors. Many existing algorithms take the approach of approximately load-balancing the output, leaving each processor with Θ(n/p) elements. However, in many cases, approximate load-balancing leads to inefficiencies in both the sorting itself and in further uses of the data after sorting. We provide a deterministic parallel sorting algorithm that uses parallel selection to produce any output distribution exactly, particularly one that is perfectly load-balanced. Furthermore, when using a comparison sort, this algorithm is 1-optimal in both computation and communication. We provide an empirical study that illustrates the efficiency of exact data splitting, and shows an improvement over two sample sort algorithms.

FastAero – A Precorrected FFT – Fast Multipole Tree Steady and Unsteady Potential Flow Solver

In this paper a precorrected FFT-Fast Multipole Tree (pFFT-FMT) method for solving the potential flow around arbitrary three dimensional bodies is presented. The method takes advantage of the efficiency of the pFFT and FMT algorithms to facilitate more demanding computations such as automatic wake generation and hands-off steady and unsteady aerodynamic simulations. The velocity potential on the body surfaces and in the domain is determined using a pFFT Boundary Element Method (BEM) approach based on the Green’s Theorem Boundary Integral Equation. The vorticity trailing all lifting surfaces in the domain is represented using a Fast Multipole Tree, time advected, vortex participle method. Some simple steady state flow solutions are performed to demonstrate the basic capabilities of the solver. Although this paper focuses primarily on steady state solutions, it should be noted that this approach is designed to be a robust and efficient unsteady potential flow simulation tool, useful for rapid computational prototyping.

Kinetics and dynamics measured using IntraCavity Laser Absorption Spectroscopy

IntraCavity Laser Absorption Spectroscopy (ICLAS) is a high-resolution, high sensitivity spectroscopic method capable of measuring line positions, linewidths, lineshapes, and absolute line intensities with a sensitivity that far exceeds that of a traditional multiple pass absorption cell or Fourier Transform spectrometer. From the fundamental knowledge obtained through these measurements, information about the underlying spectroscopy, dynamics, and kinetics of the species interrogated can be derived. The construction of an ICLA Spectrometer will be detailed, and the measurements utilizing ICLAS will be discussed, as well as the theory of operation and modifications of the experimental apparatus. Results include: i) Line intensities and collision-broadening coefficients of the A band of oxygen and previously unobserved, high J, rotational transitions of the A band, hot-band transitions, and transitions of isotopically substituted species. ii) High-resolution (0.013 cm-1) spectra of the second overtone of the OH stretch of trans-nitrous acid recorded between 10,230 and 10,350 cm-1. The spectra were analyzed to yield a complete set of rotational parameters and an absolute band intensity, and two groups of anharmonic perturbations were observed and analyzed. These findings are discussed in the context of the contribution of overtone-mediated processes to OH radical production in the lower atmosphere.

Thermodynamics and log–contrast analysis in fluid geochemistry

There are two principal chemical concepts that are important for studying the natural environment. The first one is thermodynamics, which describes whether a system is at equilibrium or can spontaneously change by chemical reactions. The second main concept is how fast chemical reactions (kinetics or rate of chemical change) take place whenever they start. In this work we examine a natural system in which both thermodynamics and kinetic factors are important in determining the abundance of NH+4 , NO−2 and NO−3 in superficial waters. Samples were collected in the Arno Basin (Tuscany, Italy), a system in which natural and antrophic effects both contribute to highly modify the chemical composition of water. Thermodynamical modelling based on the reduction-oxidation reactions involving the passage NH+4 -> NO−2 -> NO−3 in equilibrium conditions has allowed to determine the Eh redox potential values able to characterise the state of each sample and, consequently, of the fluid environment from which it was drawn. Just as pH expresses the concentration of H+ in solution, redox potential is used to express the tendency of an environment to receive or supply electrons. In this context, oxic environments, as those of river systems, are said to have a high redox potential because O2 is available as an electron acceptor. Principles of thermodynamics and chemical kinetics allow to obtain a model that often does not completely describe the reality of natural systems. Chemical reactions may indeed fail to achieve equilibrium because the products escape from the site of the rection or because reactions involving the trasformation are very slow, so that non-equilibrium conditions exist for long periods. Moreover, reaction rates can be sensitive to poorly understood catalytic effects or to surface effects, while variables as concentration (a large number of chemical species can coexist and interact concurrently), temperature and pressure can have large gradients in natural systems. By taking into account this, data of 91 water samples have been modelled by using statistical methodologies for compositional data. The application of log–contrast analysis has allowed to obtain statistical parameters to be correlated with the calculated Eh values. In this way, natural conditions in which chemical equilibrium is hypothesised, as well as underlying fast reactions, are compared with those described by a stochastic approach

Minimum interference routing with fast protection

One of the most effective techniques offering QoS routing is minimum interference routing. However, it is complex in terms of computation time and is not oriented toward improving the network protection level. In order to include better levels of protection, new minimum interference routing algorithms are necessary. Minimizing the failure recovery time is also a complex process involving different failure recovery phases. Some of these phases depend completely on correct routing selection, such as minimizing the failure notification time. The level of protection also involves other aspects, such as the amount of resources used. In this case shared backup techniques should be considered. Therefore, minimum interference techniques should also be modified in order to include sharing resources for protection in their objectives. These aspects are reviewed and analyzed in this article, and a new proposal combining minimum interference with fast protection using shared segment backups is introduced. Results show that our proposed method improves both minimization of the request rejection ratio and the percentage of bandwidth allocated to backup paths in networks with low and medium protection requirements

Fast calculation of the CAC convolution algorithm using the multinomial distribution function

The authors focus on one of the methods for connection acceptance control (CAC) in an ATM network: the convolution approach. With the aim of reducing the cost in terms of calculation and storage requirements, they propose the use of the multinomial distribution function. This permits direct computation of the associated probabilities of the instantaneous bandwidth requirements. This in turn makes possible a simple deconvolution process. Moreover, under certain conditions additional improvements may be achieved

Dexmedetomidina vs Remifentanil en fast track (transito rápido) durante cirugía cardiaca

Actualmente las técnicas de anestesia de tránsito rápido en cirugía cardiaca se basan en la utilización de remifentanil, sin embargo este al tener una vida media tan corta hace que sea necesaria la utilización de opioides durante el posoperatorio inmediato presentandose el riesgo de depresión ventilatoria, y complicaciones respiratorias, es por esto que la dexmedetomidina podría ser una opción bastante atractiva debida a que no produce depresión de los centros respiratorios, y disminuye el consumo de opioides en el postoperatorio hasta un 66%. Previa aprobación del comité de ética se realizó un estudio clínico controlado y aleatorizado en dos grupos de 20 pacientes, El primer grupo recibió inducción con propofol 2mg/Kg, pancuronio 0.8mg/kg, y fentanil 2mcg/kg seguido de un bolo de dexmedetomidina de 0.5mcg/kg y una infusión de 0.3 - 0.7 mcg/kg/h la cual fue suspendida al finalizar la colocación de los alambres esternales, el grupo de remifentanil recibió una inducción con propofol y pancuronio a las mismas dosis, seguido de una infusión de remifentanil de 0.1 - 0.5 mcg/kg/min suspendida al finalizar el cierre de la piel, ambos grupos recibieron analgesia con dipirona 50mg/kg, morfina 0.1mg/kg seguida de dosis de rescate de 3mg según necesidad, e infiltración de la herida quirurgica con 40cc de Bupivacaina al 0.25%. Se midio el tiempo y lugar de extubación, el consumo de medicamentos vasopresores y vasodilatadores durante la cirugiaasi como el consumo de morfina el VAS y la incidencia de nausea y vomito durante las primeras 24h posoperatorias. El 85% de los pacientes fueron extubados en salas de cirugia, sin encontrarse diferencias estadiscamente significativas entre los tiempos de extubación de ambos grupos (11.7min) para remifentanil, y (9.6min) para dexmedetomidina, en cuanto al consumo de morfina este fue significativamente menor en el grupo de dexmedetomidina 4mg vs 15mg en el grupo de remifentanil así como también lo fue la incidencia de nausea y vomito 42.9% remifentanil vs 5.2% dexmedetomidina p:0.00009. A nuestro saber este es el primer estudio clínico en la literatura en el cual se ha propuesto a la dexmedetomidina como una alternativa para técnicas anestésicas de transito rápido en cirugia cardiaca. Los resultados sugieren que es tan eficaz como el remifentanil para permitir la extubación temprana de este grupo de pacientes con una menor consumo de morfina y una menor incidencia de nauseas y vomito durante el posoperatorio. Se recomiendan la realización de estudios adicionales que permitan ratificar los resultados previamente encontrados.

Carga viral de seis tipos de Virus del Papiloma Humano de alto riesgo y su asociacion con lesiones cervicales

Introducción: La infección por un tipo de Virus del Papiloma Humano de alto riesgo (VPH-AR), es el factor principal en el desarrollo de Cáncer de Cérvix (CC). La carga viral puede modular esta asociación, por lo que resulta importante su cuantificación y el establecimiento de su relación con lesiones precursoras de CC. Metodología: 60 mujeres con lesiones escamosas intraepiteliales (LEI) y 120 mujeres sin LEI, confirmadas por colposcopia, fueron incluidas en el estudio. Se determinó la carga viral de 6 tipos de VPH-AR, mediante PCR en tiempo real. Se estimaron OR crudos y ajustados para evaluar la asociación entre la carga viral de cada tipo y las lesiones cervicales. Resultados: 93.22% de mujeres con LEI y 91.23% de mujeres negativas, fueron positivas para al menos un tipo de VPH. VPH-18 y VPH-16 fueron los tipos más prevalentes, junto con VPH-31 en mujeres sin LEI. No se encontraron diferencias estadísticamente significativas de las cargas virales entre éstos dos grupos, aunque se observó un mayor carga viral en lesiones para algunos tipos virales. Una mayor frecuencia de lesiones se asoció a infecciones con carga baja de VPH-16 (ORa: 3.53; IC95%: 1.16 – 10.74), en comparación a mujeres con carga alta de VPH-16, (ORa: 2.63; IC95%: 1.09 – 6.36). En infecciones por VPH-31, la presencia de carga viral alta, se asoció con una menor frecuencia de lesiones (ORa: 0.34; IC95%: 0.15 – 0.78). Conclusiones: La prevalencia tipo-específica de VPH se corresponde con las reportadas a nivel mundial. La asociación entre la carga viral del VPH y la frecuencia de LEI es tipo específica y podría depender de la duración de la infección, altas cargas relacionadas con infecciones transitorias, y bajas cargas con persistentes. Este trabajo contribuye al entendimiento del efecto de la carga viral en la historia natural del CC; sin embargo, estudios prospectivos son necesarios para confirmar estos resultados.

Periodismo : el fast-food de la literatura, la historia con minúsculsa.

El artículo forma parte de un monográfico de la revista dedicado a la lectura y escritura

AQA A2 Unit 4 Chemistry : kinetics, equilibria and organic chemistry.

Guía de apoyo para alumnos de educación secundaria de segundo ciclo que sigan la especificación de AQA (Assessment and Qualifications Alliance) en el nivel A2 del área de química. Está dividida en tres secciones: una introducción con consejos y técnicas para la realización del examen; una guía de contenido con los principales conceptos y temas (cinética, equilibrio, ácidos y bases, nomenclatura e isomería en química orgánica, compuestos del grupo carbonilo, química aromática, aminas, aminoácidos, polímeros, análisis y síntesis orgánica y determinación de estructura); y una sección con preguntas de examen y respuestas comentadas por un examinador.