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.

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.

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

Hints for a fast precessing relativistic radio jet in LS I + 61° 303

Here we discuss two consecutive MERLIN observations of the X-ray binary LS I +61° 303 . The first observation shows a double-sided jet extending up to about 200 AU on both sides of a central source. The jet shows a bent S-shaped structure similar to the one displayed by the well-known precessing jet of SS 433 . The precession suggested in the first MERLIN image becomes evident in the second one, showing a one-sided bent jet significantly rotated with respect to the jet of the day before. We conclude that the derived precession of the relativistic (beta=0.6) jet explains puzzling previous VLBI results. Moreover, the fact that the precession is fast could be the explanation of the never understood short term (days) variability of the associated gamma-ray source 2CG 135+01 / 3EG J0241+6103