Regular quantum graphs

We introduce the concept of regular quantum graphs and construct connected quantum graphs with discrete symmetries. The method is based on a decomposition of the quantum propagator in terms of permutation matrices which control the way incoming and outgoing channels at vertex scattering processes are connected. Symmetry properties of the quantum graph as well as its spectral statistics depend on the particular choice of permutation matrices, also called connectivity matrices, and can now be easily controlled. The method may find applications in the study of quantum random walks networks and may also prove to be useful in analysing universality in spectral statistics.Comment: 12 pages, 3 figure

Universal quantum computation with unlabeled qubits

We show that an n-th root of the Walsh-Hadamard transform (obtained from the Hadamard gate and a cyclic permutation of the qubits), together with two diagonal matrices, namely a local qubit-flip (for a fixed but arbitrary qubit) and a non-local phase-flip (for a fixed but arbitrary coefficient), can do universal quantum computation on n qubits. A quantum computation, making use of n qubits and based on these operations, is then a word of variable length, but whose letters are always taken from an alphabet of cardinality three. Therefore, in contrast with other universal sets, no choice of qubit lines is needed for the application of the operations described here. A quantum algorithm based on this set can be interpreted as a discrete diffusion of a quantum particle on a de Bruijn graph, corrected on-the-fly by auxiliary modifications of the phases associated to the arcs.Comment: 6 page

Mass Transfer Mechanisms during Dehydration of Vegetable Food: Traditional and Innovative Approaches

Lettera di accettazione in dat

Selecting Nodes and Buying Links to Maximize the Information Diffusion in a Network

The Independent Cascade Model (ICM) is a widely studied model that aims to capture the dynamics of the information diffusion in social networks and in general complex networks. In this model, we can distinguish between active nodes which spread the information and inactive ones. The process starts from a set of initially active nodes called seeds. Recursively, currently active nodes can activate their neighbours according to a probability distribution on the set of edges. After a certain number of these recursive cycles, a large number of nodes might become active. The process terminates when no further node gets activated. Starting from the work of Domingos and Richardson [Domingos et al. 2001], several studies have been conducted with the aim of shaping a given diffusion process so as to maximize the number of activated nodes at the end of the process. One of the most studied problems has been formalized by Kempe et al. and consists in finding a set of initial seeds that maximizes the expected number of active nodes under a budget constraint [Kempe et al. 2003]. In this paper we study a generalization of the problem of Kempe et al. in which we are allowed to spend part of the budget to create new edges incident to the seeds. That is, the budget can be spent to buy seeds or edges according to a cost function. The problem does not admin a PTAS, unless P=NP. We propose two approximation algorithms: the former one gives an approximation ratio that depends on the edge costs and increases when these costs are high; the latter algorithm gives a constant approximation guarantee which is greater than that of the first algorithm when the edge costs can be small

RNA binding properties of the US11 protein from four primate simplexviruses

<p>Abstract</p> <p>Background</p> <p>The protein encoded by the Us11 gene of herpes simplex viruses is a dsRNA binding protein which inhibits protein kinase R activity, thereby preventing the interferon-induced shut down of protein synthesis following viral infection. Us11 protein is not essential for infectivity <it>in vitro </it>and in mice in herpes simplex virus type 1 (HSV1), however this virus has a second, and apparently more important, inhibitor of PKR activity, the γ₁34.5 protein. Recently sequenced simian simplexviruses SA8, HVP2 and B virus do not have an ORF corresponding to the γ₁34.5 protein, yet they have similar, or greater, infectivity as HSV1 and HSV2.</p> <p>Methods</p> <p>We have expressed the US11 proteins of the simplexviruses HSV1, HSV2, HVP2 and B virus and measured their abilities to bind dsRNA, in order to investigate possible differences that could complement the absence of the γ₁34.5 protein. We employed a filter binding technique that allows binding of the Us11 protein under condition of excess dsRNA substrate and therefore a measurement of the true Kd value of Us11-dsRNA binding.</p> <p>Results and Conclusions</p> <p>The results show a Kd of binding in the range of 0.89 nM to 1.82 nM, with no significant difference among the four Us11 proteins.</p

Complete genome sequence of cercopithecine herpesvirus 2 (SA8) and comparison with other simplexviruses

AbstractWe have obtained the complete sequence of the herpesvirus simian agent 8 (SA8; cercopithecine herpesvirus 2) a baboon simplexvirus closely related to the monkey B virus and herpes simplex virus types 1 and 2. The genome of SA8 is 150,715 bp long, with an overall G/C content of 76%, the highest among the simplexviruses sequenced so far. The sequencing has confirmed that the genomic arrangement of SA8 is similar to that of other simplexviruses: unique long and unique short regions bordered by two sets of inverted repeats. All genes identified in SA8 are homologous and collinear with those of the monkey B virus, including the lack of the RL1 open reading frame, a gene responsible for neurovirulence in human herpes simplex viruses. This latter finding supports the hypothesis that a different pathogenetic mechanism may have developed in human simplexviruses, after their divergence from monkey simplexviruses

Multi-core job submission and grid resource scheduling for ATLAS AthenaMP

AthenaMP is the multi-core implementation of the ATLAS software framework and allows the efficient sharing of memory pages between multiple threads of execution. This has now been validated for production and delivers a significant reduction on the overall application memory footprint with negligible CPU overhead. Before AthenaMP can be routinely run on the LHC Computing Grid it must be determined how the computing resources available to ATLAS can best exploit the notable improvements delivered by switching to this multi-process model. A study into the effectiveness and scalability of AthenaMP in a production environment will be presented. Best practices for configuring the main LRMS implementations currently used by grid sites will be identified in the context of multi-core scheduling optimisation

Matrix permanent and quantum entanglement of permutation invariant states

We point out that a geometric measure of quantum entanglement is related to the matrix permanent when restricted to permutation invariant states. This connection allows us to interpret the permanent as an angle between vectors. By employing a recently introduced permanent inequality by Carlen, Loss and Lieb, we can prove explicit formulas of the geometric measure for permutation invariant basis states in a simple way.Comment: 10 page

Bases ecofisiológicas de la determinación del rendimiento y la calidad de grano en maíces pisingallo

El cultivo de maíz pisingallo (Zea mays L. var. everta) es una alternativa conveniente en la diversificación de la producción de granos en Argentina, sin embargo las bases ecofisiológicas de la determinación del rendimiento y la calidad han sido fundamentadas sobre maíces de tipo dentado, mientras que en maíces pisingallo se desconocen. El objetivo de esta tesis es entender cómo los maíces pisingallos determinan sus componentes del rendimiento, el nivel de proteína en grano y su volumen de expansión (principal criterio de calidad comercial)por medio de un marco conceptual basado en el crecimiento y partición de biomasa del cultivo en torno a floración y durante el llenado efectivo de los granos. Durante 2007 y 2008 se llevaron a cabo tres experimentos a campo en donde la tasa de crecimiento por planta fue alterada por medio de tratamientos de densidad de siembra y de raleo de plantas y defoliaciones (en torno a floración y durante el llenado efectivo)en 4 genotipos dentados y 8 pisingallos. Ambos tipos de maíz tuvieron en común una fuerte asociación de su rendimiento con la capacidad potencial de rendimiento establecida en torno a floración (R2 igual a 0,93, p menor a 0,001), pero difirieron en la determinación del peso de grano. El peso de grano potencial en maíces pisingallos siempre fue menor ante una misma disponibilidad de asimilados por grano en torno a floración (p menor a 0,05), mientras que el peso final de grano se redujo menos que el de los dentados ante una misma disminución en la disponibilidad de asimilados durante el llenado (p menor a 0,05). La concentración y contenido de proteínas del grano, y su volumen de expansión, estuvieron asociados principalmente a la tasa de crecimiento por planta por grano durante el llenado efectivo, y en menor medida con dicha tasa en torno a floración. Los resultados de esta tesis resaltan la importancia de las condiciones de crecimiento en torno a floración para la determinación del rendimiento dentro de un conjunto diverso de germoplasma de maíz (dentado y pisingallo)y demuestran, por primera vez, que el volumen de expansión de grano de maíz pisingallo puede ser predicho a partir del crecimiento del cultivo