Spin-orbit mode transfer via a classical analog of quantum teleportation

We translate the quantum teleportation protocol into a sequence of coherent operations involving three degrees of freedom of a classical laser beam. The protocol, which we demonstrate experimentally, transfers the polarisation state of the input beam to the transverse mode of the output beam. The role of quantum entanglement is played by a non-separable mode describing the path and transverse degrees of freedom. Our protocol illustrates the possibility of new optical applications based on this intriguing classical analogue of quantum entanglement.Comment: 5 pages, 7 figure

The triglyceride lowering effect of fish oils is affected by fish consumption

We investigated the efficacy of fish oils in Portuguese patients with hypertriglyceridaemia and mixed hyperlipidaemia, and the influence of fish consumption on the triglyceride lowering capacity of fish oils. Forty patients participated in this double-blind study, consisting of a 4-week dietary or wash-out baseline period after which patients were randomly assigned to receive either 12 fish oil capsules (3.6 g/day of omega 3) or similar 12 soya oil capsules per day for a period of 2 months. There were no statistically significant changes of total, HDL or LDL-cholesterol, and triglycerides. Nevertheless, triglycerides increased 19.9% with soya oil and decreased 27.8% with fish oils. Also, there was an inverse relationship (rho = -0.352) between fish consumption and fish oils effect on triglycerides, and the triglyceride lowering with fish oils increased (from 27.8% to 44.4%), reaching borderline significance, if we excluded patients consuming one or more meals with fish per day. Glucose increased 11% (P = 0.0047) with fish oils. These findings suggest that the triglyceride lowering effect of fish oils is affected by fish consumption, and confirm that fish oils increase blood glucose levels in diabetics and non-diabetics

Queueing networks: solutions and applications

During the pasttwo decades queueing network models have proven to be a versatile tool for computer system and computer communication system performance evaluation. This chapter provides a survey of th field with a particular emphasis on applications. We start with a brief historical retrospective which also servesto introduce the majr issues and application areas. Formal results for product form queuenig networks are reviewed with particular emphasis on the implications for computer systems modeling. Computation algorithms, sensitivity analysis and optimization techniques are among the topics covered. Many of the important applicationsof queueing networks are not amenableto exact analysis and an (often confusing) array of approximation methods have been developed over the years. A taxonomy of approximation methods is given and used as the basis for for surveing the major approximation methods that have been studied. The application of queueing network to a number of areas is surveyed, including computer system cpacity planning, packet switching networks, parallel processing, database systems and availability modeling.Durante as últimas duas décadas modelos de redes de filas provaram ser uma ferramenta versátil para avaliação de desempenho de sistemas de computação e sistemas de comunicação. Este capítulo faz um apanhado geral da área, com ênfase em aplicações. Começamos com uma breve retrospectiva histórica que serve também para introduzir os pontos mais importantes e as áreas de aplicação. Resultados formais para redes de filas em forma de produto são revisados com ênfase na modelagem de sistemas de computação. Algoritmos de computação, análise de sensibilidade e técnicas de otimização estão entre os tópicos revistos. Muitas dentre importantes aplicações de redes de filas não são tratáveis por análise exata e uma série (frequentemente confusa) de métodos de aproximação tem sido desenvolvida. Uma taxonomia de métodos de aproximação é dada e usada como base para revisão dos mais importantes métodos de aproximação propostos. Uma revisão das aplicações de redes de filas em um número de áreas é feita, incluindo planejamento de capacidade de sistemas de computação, redes de comunicação por chaveamento de pacotes, processamento paralelo, sistemas de bancos de dados e modelagem de confiabilidade

A note on the computational cost of the linearizer algorithm for queueing networks

Linearizer is one of the best known approximation algorithms for obtaining numeric solutions for product form queueing networks. In the original exposition of Linarizer, the computational cost was started to be O(MK³) for a model with M queues and K job classes. We show in this note that with som stright forward algebraic manipulation Linearizer can be modified to require only O (MK²) computational cost.Linearizer é um dos mais conhecidos algoritmos de aproximação para se obter soluções numéricas para redes de filas em solução em forma de produto. Na explanação original de Linearizer, o custo computacional foi mostrado ser de O(MK³) para um modelo com M filas e K classes de jobs. Nesta nota mostramos que, com algumas manipulações algébricas simples, Linearizer pode ser modificado de tal maneira que o custo computacional seja reduzido para O(MK²)

Chandrasekhar's Dynamical Friction and non-extensive statistics

The motion of a point like object of mass $M$ passing through the background potential of massive collisionless particles ($m << M$) suffers a steady deceleration named dynamical friction. In his classical work, Chandrasekhar assumed a Maxwellian velocity distribution in the halo and neglected the self gravity of the wake induced by the gravitational focusing of the mass $M$. In this paper, by relaxing the validity of the Maxwellian distribution due to the presence of long range forces, we derive an analytical formula for the dynamical friction in the context of the $q$-nonextensive kinetic theory. In the extensive limiting case ($q = 1$), the classical Gaussian Chandrasekhar result is recovered. As an application, the dynamical friction timescale for Globular Clusters spiraling to the galactic center is explicitly obtained. Our results suggest that the problem concerning the large timescale as derived by numerical $N$-body simulations or semi-analytical models can be understood as a departure from the standard extensive Maxwellian regime as measured by the Tsallis nonextensive $q$-parameter.Comment: 16pp 5 figs, revised and extended version of arXiv:1202.1873 . Accepted for publication by JCA