14,335 research outputs found

    Biochemical and immunochemical analysis of the arrangement of connexin43 in rat heart gap junction membranes

    Get PDF
    A 43 × 10^3 M_r protein (designated connexin43 or Cx43) is a major constituent of heart gap junctions. The understanding of its arrangement in junctional membranes has been extended by means of site-directed antibodies raised against synthetic peptides of Cx43. These represent part of the first extracellular loop (EL-46), the cytoplasmic loop (CL-100), the second extracellular loop (EL-186) and carboxy-terminal sequences (CT-237 and CT-360). All of the antibodies raised reacted with their respective peptides and the Cx43 protein on Western blots. By immunoelectron microscopy two of the antibodies (CL-100 and CT-360) were shown to label the cytoplasmic surface of isolated gap junction membranes. Immunofluorescent labeling at locations of neonatal cardiac myocyte-myocyte apposition required an alkali/urea treatment when the EL-46 and EL-186 antibodies were used. Immunoblot analysis of endoproteinase Lys-C-digested gap junctions revealed that the Cx43 protein passed through the lipid bilayer four times. Alkaline phosphatase digestion of isolated junctions was used to show that the CT-360 antibody recognized many phosphorylated forms of Cx43. Our results unequivocally confirm models of the organization of Cx43 that were based on a more limited set of data and a priori considerations of the sequence

    An extended abstract: A heuristic repair method for constraint-satisfaction and scheduling problems

    Get PDF
    The work described in this paper was inspired by a surprisingly effective neural network developed for scheduling astronomical observations on the Hubble Space Telescope. Our heuristic constraint satisfaction problem (CSP) method was distilled from an analysis of the network. In the process of carrying out the analysis, we discovered that the effectiveness of the network has little to do with its connectionist implementation. Furthermore, the ideas employed in the network can be implemented very efficiently within a symbolic CSP framework. The symbolic implementation is extremely simple. It also has the advantage that several different search strategies can be employed, although we have found that hill-climbing methods are particularly well-suited for the applications that we have investigated. We begin the paper with a brief review of the neural network. Following this, we describe our symbolic method for heuristic repair

    An Explanation of the Very Low Radio Flux of Young Planet-mass Companions

    Full text link
    We report Atacama Large Millimeter/submillimeter Array (ALMA) 1.3 mm continuum upper limits for 5 planetary-mass companions DH Tau B, CT Cha B, GSC 6214-210 B, 1RXS 1609 B, and GQ Lup B. Our survey, together with other ALMA studies, have yielded null results for disks around young planet-mass companions and placed stringent dust mass upper limits, typically less than 0.1 M_earth, when assuming dust continuum is optically thin. Such low-mass gas/dust content can lead to a disk lifetime estimate (from accretion rates) much shorter than the age of the system. To alleviate this timescale discrepancy, we suggest that disks around wide companions might be very compact and optically thick, in order to sustain a few Myr of accretion yet have very weak (sub)millimeter flux so as to still be elusive to ALMA. Our order-of-magnitude estimate shows that compact optically-thick disks might be smaller than 1000 R_jup and only emit ~micro-Jy of flux in the (sub)millimeter, but their average temperature can be higher than that of circumstellar disks. The high disk temperature could impede satellite formation, but it also suggests that mid- to far-infrared might be more favorable than radio wavelengths to characterize disk properties. Finally, the compact disk size might imply that dynamical encounters between the companion and the star, or any other scatterers in the system, play a role in the formation of planetary-mass companions.Comment: Accepted for publication in A

    The min-conflicts heuristic: Experimental and theoretical results

    Get PDF
    This paper describes a simple heuristic method for solving large-scale constraint satisfaction and scheduling problems. Given an initial assignment for the variables in a problem, the method operates by searching through the space of possible repairs. The search is guided by an ordering heuristic, the min-conflicts heuristic, that attempts to minimize the number of constraint violations after each step. We demonstrate empirically that the method performs orders of magnitude better than traditional backtracking techniques on certain standard problems. For example, the one million queens problem can be solved rapidly using our approach. We also describe practical scheduling applications where the method has been successfully applied. A theoretical analysis is presented to explain why the method works so well on certain types of problems and to predict when it is likely to be most effective

    Weighted-density approximation for general nonuniform fluid mixtures

    Get PDF
    In order to construct a general density-functional theory for nonuniform fluid mixtures, we propose an extension to multicomponent systems of the weighted-density approximation (WDA) of Curtin and Ashcroft [Phys. Rev. A 32, 2909 (1985)]. This extension corrects a deficiency in a similar extension proposed earlier by Denton and Ashcroft [Phys. Rev. A 42, 7312 (1990)], in that that functional cannot be applied to the multi-component nonuniform fluid systems with spatially varying composition, such as solid-fluid interfaces. As a test of the accuracy of our new functional, we apply it to the calculation of the freezing phase diagram of a binary hard-sphere fluid, and compare the results to simulation and the Denton-Ashcroft extension.Comment: 4 pages, 4 figures, to appear in Phys. Rev. E as Brief Repor
    corecore