59,850 research outputs found

    Superalgebra and Conservative Quantities in N=1 Self-dual Supergravity

    Full text link
    The N=1 self-dual supergravity has SL(2,C) and the left-handed and right -handed local supersymmetries. These symmetries result in SU(2) charges as the angular-momentum and the supercharges. The model possesses also the invariance under the general translation transforms and this invariance leads to the energy-momentum. All the definitions are generally covariant . As the SU(2) charges and the energy-momentum we obtained previously constituting the 3-Poincare algebra in the Ashtekar's complex gravity, the SU(2) charges, the supercharges and the energy-momentum here also restore the super-Poincare algebra, and this serves to support the reasonableness of their interpretations.Comment: 18 pages, Latex, no figure

    Solid superheating observed in two-dimensional strongly-coupled dusty plasma

    Full text link
    It is demonstrated experimentally that strongly-coupled plasma exhibits solid superheating. A 2D suspension of microspheres in dusty plasma, initially self-organized in a solid lattice, was heated and then cooled rapidly by turning laser heating on and off. Particles were tracked using video microscopy, allowing atomistic-scale observation during melting and solidification. During rapid heating, the suspension remained in a solid structure at temperatures above the melting point, demonstrating solid superheating. Hysteresis diagrams did not indicate liquid supercooling in this 2D system.Comment: 9 pages text, 3 figures, in press Physical Review Letters 200

    Robust photoregulation of GABA(A) receptors by allosteric modulation with a propofol analogue.

    Get PDF
    Photochemical switches represent a powerful method for improving pharmacological therapies and controlling cellular physiology. Here we report the photoregulation of GABA(A) receptors (GABA(A)Rs) by a derivative of propofol (2,6-diisopropylphenol), a GABA(A)R allosteric modulator, which we have modified to contain photoisomerizable azobenzene. Using α(1)β(2)γ(2) GABA(A)Rs expressed in Xenopus laevis oocytes and native GABA(A)Rs of isolated retinal ganglion cells, we show that the trans-azobenzene isomer of the new compound (trans-MPC088), generated by visible light (wavelengths ~440 nm), potentiates the γ-aminobutyric acid-elicited response and, at higher concentrations, directly activates the receptors. cis-MPC088, generated from trans-MPC088 by ultraviolet light (~365 nm), produces little, if any, receptor potentiation/activation. In cerebellar slices, MPC088 co-applied with γ-aminobutyric acid affords bidirectional photomodulation of Purkinje cell membrane current and spike-firing rate. The findings demonstrate photocontrol of GABA(A)Rs by an allosteric ligand, and open new avenues for fundamental and clinically oriented research on GABA(A)Rs, a major class of neurotransmitter receptors in the central nervous system

    Heuristic algorithms for the min-max edge 2-coloring problem

    Full text link
    In multi-channel Wireless Mesh Networks (WMN), each node is able to use multiple non-overlapping frequency channels. Raniwala et al. (MC2R 2004, INFOCOM 2005) propose and study several such architectures in which a computer can have multiple network interface cards. These architectures are modeled as a graph problem named \emph{maximum edge qq-coloring} and studied in several papers by Feng et. al (TAMC 2007), Adamaszek and Popa (ISAAC 2010, JDA 2016). Later on Larjomaa and Popa (IWOCA 2014, JGAA 2015) define and study an alternative variant, named the \emph{min-max edge qq-coloring}. The above mentioned graph problems, namely the maximum edge qq-coloring and the min-max edge qq-coloring are studied mainly from the theoretical perspective. In this paper, we study the min-max edge 2-coloring problem from a practical perspective. More precisely, we introduce, implement and test four heuristic approximation algorithms for the min-max edge 22-coloring problem. These algorithms are based on a \emph{Breadth First Search} (BFS)-based heuristic and on \emph{local search} methods like basic \emph{hill climbing}, \emph{simulated annealing} and \emph{tabu search} techniques, respectively. Although several algorithms for particular graph classes were proposed by Larjomaa and Popa (e.g., trees, planar graphs, cliques, bi-cliques, hypergraphs), we design the first algorithms for general graphs. We study and compare the running data for all algorithms on Unit Disk Graphs, as well as some graphs from the DIMACS vertex coloring benchmark dataset.Comment: This is a post-peer-review, pre-copyedit version of an article published in International Computing and Combinatorics Conference (COCOON'18). The final authenticated version is available online at: http://www.doi.org/10.1007/978-3-319-94776-1_5

    Magnetoelectric properties of magnetite thin films

    Get PDF
    Resistivity, DC Hall effect and transverse magnetoresistance measurements were made on polycrystalline thin films of magnetite (Fe3O4) from 104K to room temperature. The Verwey transition is observed at TV=123K, about 4K higher than reported for bulk magnetite. The ordinary and extraordinary Hall coefficients are negative over the entire temperature range, consistent with negatively charged carriers. The extraordinary Hall coefficient exhibits a rho 1/3 dependence on the resistivity above TV and a rho 2/3 dependence below TV. The magnetoresistance is negative at all temperatures and for all magnetic field strengths. The planar Hall effect signal was below the sensitivity of the present experiment

    Retrospective Higher-Order Markov Processes for User Trails

    Full text link
    Users form information trails as they browse the web, checkin with a geolocation, rate items, or consume media. A common problem is to predict what a user might do next for the purposes of guidance, recommendation, or prefetching. First-order and higher-order Markov chains have been widely used methods to study such sequences of data. First-order Markov chains are easy to estimate, but lack accuracy when history matters. Higher-order Markov chains, in contrast, have too many parameters and suffer from overfitting the training data. Fitting these parameters with regularization and smoothing only offers mild improvements. In this paper we propose the retrospective higher-order Markov process (RHOMP) as a low-parameter model for such sequences. This model is a special case of a higher-order Markov chain where the transitions depend retrospectively on a single history state instead of an arbitrary combination of history states. There are two immediate computational advantages: the number of parameters is linear in the order of the Markov chain and the model can be fit to large state spaces. Furthermore, by providing a specific structure to the higher-order chain, RHOMPs improve the model accuracy by efficiently utilizing history states without risks of overfitting the data. We demonstrate how to estimate a RHOMP from data and we demonstrate the effectiveness of our method on various real application datasets spanning geolocation data, review sequences, and business locations. The RHOMP model uniformly outperforms higher-order Markov chains, Kneser-Ney regularization, and tensor factorizations in terms of prediction accuracy
    • …
    corecore