1,023 research outputs found

    Comparative Raman Studies of Sr2RuO4, Sr3Ru2O7 and Sr4Ru3O10

    Full text link
    The polarized Raman spectra of layered ruthenates of the Srn+1RunO3n+1 (n=1,2,3) Ruddlesden-Popper series were measured between 10 and 300 K. The phonon spectra of Sr3Ru2O7 and Sr4Ru3O10 confirmed earlier reports for correlated rotations of neighboring RuO6 octahedra within double or triple perovskite blocks. The observed Raman lines of Ag or B1g symmetry were assigned to particular atomic vibrations by considering the Raman modes in simplified structures with only one double or triple RuO6 layer per unit cell and by comparison to the predictions of lattice dynamical calculations for the real Pban and Pbam structures. Along with discrete phonon lines, a continuum scattering, presumably of electronic origin, is present in the zz, xx and xy, but not in the x'y' and zx spectra. Its interference with phonons results in Fano shape for some of the lines in the xx and xy spectra. The temperature dependencies of phonon parameters of Sr3Ru2O7 exhibit no anomaly between 10 and 300 K where no magnetic transition occurs. In contrast, two B1g lines in the spectra of Sr4Ru3O10, corresponding to oxygen vibrations modulating the Ru-O-Ru bond angle, show noticeable hardening with ferromagnetic ordering at 105 K, thus indicating strong spin-phonon interaction.Comment: 9 pages, 12 figure

    Models and Algorithms for Graph Watermarking

    Full text link
    We introduce models and algorithmic foundations for graph watermarking. Our frameworks include security definitions and proofs, as well as characterizations when graph watermarking is algorithmically feasible, in spite of the fact that the general problem is NP-complete by simple reductions from the subgraph isomorphism or graph edit distance problems. In the digital watermarking of many types of files, an implicit step in the recovery of a watermark is the mapping of individual pieces of data, such as image pixels or movie frames, from one object to another. In graphs, this step corresponds to approximately matching vertices of one graph to another based on graph invariants such as vertex degree. Our approach is based on characterizing the feasibility of graph watermarking in terms of keygen, marking, and identification functions defined over graph families with known distributions. We demonstrate the strength of this approach with exemplary watermarking schemes for two random graph models, the classic Erd\H{o}s-R\'{e}nyi model and a random power-law graph model, both of which are used to model real-world networks

    Flow graphs: interweaving dynamics and structure

    Get PDF
    The behavior of complex systems is determined not only by the topological organization of their interconnections but also by the dynamical processes taking place among their constituents. A faithful modeling of the dynamics is essential because different dynamical processes may be affected very differently by network topology. A full characterization of such systems thus requires a formalization that encompasses both aspects simultaneously, rather than relying only on the topological adjacency matrix. To achieve this, we introduce the concept of flow graphs, namely weighted networks where dynamical flows are embedded into the link weights. Flow graphs provide an integrated representation of the structure and dynamics of the system, which can then be analyzed with standard tools from network theory. Conversely, a structural network feature of our choice can also be used as the basis for the construction of a flow graph that will then encompass a dynamics biased by such a feature. We illustrate the ideas by focusing on the mathematical properties of generic linear processes on complex networks that can be represented as biased random walks and also explore their dual consensus dynamics.Comment: 4 pages, 1 figur

    Conceptualizing gratitude and appreciation as a unitary personality trait

    Get PDF
    Gratitude and appreciation are currently measured using three self-report instruments, the GQ6 (1 scale), the Appreciation Scale (8 scales), and the GRAT (3 scales). Two studies were conducted to test how these three instruments are interrelated, whether they exist under the same higher order factor or factors, and whether gratitude and appreciation is a single or multi-factorial construct. In Study 1 (N = 206) all 12 scales were subjected to an exploratory factor analysis. Both parallel analysis and the minimum average partial method indicated a clear one-factor solution. In Study 2 (N = 389) multigroup confirmatory factor analysis supported the one-factor structure, demonstrated the invariance of this structure across gender, and ruled out the confounding effect of socially desirable responding. We conclude gratitude and appreciation are a single-factor personality trait. We suggest integration of gratitude and appreciation literatures and provide a clearer conceptualization of gratitude

    An efficient and principled method for detecting communities in networks

    Full text link
    A fundamental problem in the analysis of network data is the detection of network communities, groups of densely interconnected nodes, which may be overlapping or disjoint. Here we describe a method for finding overlapping communities based on a principled statistical approach using generative network models. We show how the method can be implemented using a fast, closed-form expectation-maximization algorithm that allows us to analyze networks of millions of nodes in reasonable running times. We test the method both on real-world networks and on synthetic benchmarks and find that it gives results competitive with previous methods. We also show that the same approach can be used to extract nonoverlapping community divisions via a relaxation method, and demonstrate that the algorithm is competitively fast and accurate for the nonoverlapping problem.Comment: 14 pages, 5 figures, 1 tabl

    Mesoscopic structure and social aspects of human mobility

    Get PDF
    The individual movements of large numbers of people are important in many contexts, from urban planning to disease spreading. Datasets that capture human mobility are now available and many interesting features have been discovered, including the ultra-slow spatial growth of individual mobility. However, the detailed substructures and spatiotemporal flows of mobility - the sets and sequences of visited locations - have not been well studied. We show that individual mobility is dominated by small groups of frequently visited, dynamically close locations, forming primary "habitats" capturing typical daily activity, along with subsidiary habitats representing additional travel. These habitats do not correspond to typical contexts such as home or work. The temporal evolution of mobility within habitats, which constitutes most motion, is universal across habitats and exhibits scaling patterns both distinct from all previous observations and unpredicted by current models. The delay to enter subsidiary habitats is a primary factor in the spatiotemporal growth of human travel. Interestingly, habitats correlate with non-mobility dynamics such as communication activity, implying that habitats may influence processes such as information spreading and revealing new connections between human mobility and social networks.Comment: 7 pages, 5 figures (main text); 11 pages, 9 figures, 1 table (supporting information

    Safety and pharmacokinetics of multiple dose myo-inositol in preterm infants

    Get PDF
    BACKGROUND: Preterm infants with respiratory distress syndrome (RDS) given inositol had reduced bronchopulmonary dysplasia (BPD), death and severe retinopathy of prematurity (ROP). We assessed the safety and pharmacokinetics of daily inositol to select a dose providing serum levels previously associated with benefit, and to learn if accumulation occurred when administered throughout the normal period of retinal vascularization. METHODS: Infants ≤ 29 wk GA (n = 122, 14 centers) were randomized and treated with placebo or inositol at 10, 40, or 80 mg/kg/d. Intravenous administration converted to enteral when feedings were established, and continued to the first of 10 wk, 34 wk postmenstrual age (PMA) or discharge. Serum collection employed a sparse sampling population pharmacokinetics design. Inositol urine losses and feeding intakes were measured. Safety was prospectively monitored. RESULTS: At 80 mg/kg/d mean serum levels reached 140 mg/l, similar to Hallman's findings. Levels declined after 2 wk, converging in all groups by 6 wk. Analyses showed a mean volume of distribution 0.657 l/kg, clearance 0.058 l/kg/h, and half-life 7.90 h. Adverse events and comorbidities were fewer in the inositol groups, but not significantly so. CONCLUSION: Multiple dose inositol at 80 mg/kg/d was not associated with increased adverse events, achieves previously effective serum levels, and is appropriate for investigation in a phase III trial
    corecore