Experimental Resonance Enhanced Multiphoton Ionization (REMPI) studies of small molecules

Resonance enhanced multiphoton ionization (REMPI) utilizes tunable dye lasers to ionize an atom or molecule by first preparing an excited state by multiphoton absorption and then ionizing that state before it can decay. This process is highly selective with respect to both the initial and resonant intermediate states of the target, and it can be extremely sensitive. In addition, the products of the REMPI process can be detected as needed by analyzing the resulting electrons, ions, fluorescence, or by additional REMPI. This points to a number of exciting opportunities for both basic and applied science. On the applied side, REMPI has great potential as an ultrasensitive, highly selective detector for trace, reactive, or transient species. On the basic side, REMPI affords an unprecedented means of exploring excited state physics and chemistry at the quantum-state-specific level. An overview of current studies of excited molecular states is given to illustrate the principles and prospects of REMPI

Spectral analysis of Gene co-expression network of Zebrafish

We analyze the gene expression data of Zebrafish under the combined framework of complex networks and random matrix theory. The nearest neighbor spacing distribution of the corresponding matrix spectra follows random matrix predictions of Gaussian orthogonal statistics. Based on the eigenvector analysis we can divide the spectra into two parts, first part for which the eigenvector localization properties match with the random matrix theory predictions, and the second part for which they show deviation from the theory and hence are useful to understand the system dependent properties. Spectra with the localized eigenvectors can be characterized into three groups based on the eigenvalues. We explore the position of localized nodes from these different categories. Using an overlap measure, we find that the top contributing nodes in the different groups carry distinguished structural features. Furthermore, the top contributing nodes of the different localized eigenvectors corresponding to the lower eigenvalue regime form different densely connected structure well separated from each other. Preliminary biological interpretation of the genes, associated with the top contributing nodes in the localized eigenvectors, suggests that the genes corresponding to same vector share common features.Comment: 6 pages, four figures (accepted in EPL

Scientific Potential and Design Considerations for an Undulator Beam Line on Aladdin Storage Ring

The unique features of undulator radiation, i.e., high photon flux and brightness, partial coherence, small beam divergence, spectral tunability, etc., mandate that undulators be included in the future plans for Aladdin. This will make it possible to perform the next generation of experiments in photon-stimulated spectroscopies. A team of scientists (see Appendix) has now been assembled to build an insertion device (ID) and the associated beam line at Aladdin. In considering the specifications for the ID, it was assumed that the ID beamline will be an SRC user facility. Consequently, design parameters were chosen with the intent of maximizing experimental flexibility consistent with a conservative design approach. A tunable {open_quotes}clamshell{close_quotes} undulator device was Chosen with a first harmonic tunable from 35 to 110 eV to operate on a 1 GeV storage ring. Higher harmonics will be utilized for experiments needing higher photon energies

Connections between Classical and Parametric Network Entropies

This paper explores relationships between classical and parametric measures of graph (or network) complexity. Classical measures are based on vertex decompositions induced by equivalence relations. Parametric measures, on the other hand, are constructed by using information functions to assign probabilities to the vertices. The inequalities established in this paper relating classical and parametric measures lay a foundation for systematic classification of entropy-based measures of graph complexity

Constraints and entropy in a model of network evolution

Barab´asi-Albert’s ‘Scale Free’ model is the starting point for much of the accepted theory of the evolution of real world communication networks. Careful comparison of the theory with a wide range of real world networks, however, indicates that the model is in some cases, only a rough approximation to the dynamical evolution of real networks. In particular, the exponent γ of the power law distribution of degree is predicted by the model to be exactly 3, whereas in a number of real world networks it has values between 1.2 and 2.9. In addition, the degree distributions of real networks exhibit cut offs at high node degree, which indicates the existence of maximal node degrees for these networks. In this paper we propose a simple extension to the ‘Scale Free’ model, which offers better agreement with the experimental data. This improvement is satisfying, but the model still does not explain why the attachment probabilities should favor high degree nodes, or indeed how constraints arrive in non-physical networks. Using recent advances in the analysis of the entropy of graphs at the node level we propose a first principles derivation for the ‘Scale Free’ and ‘constraints’ model from thermodynamic principles, and demonstrate that both preferential attachment and constraints could arise as a natural consequence of the second law of thermodynamics

Persistent topology for natural data analysis - A survey

Natural data offer a hard challenge to data analysis. One set of tools is being developed by several teams to face this difficult task: Persistent topology. After a brief introduction to this theory, some applications to the analysis and classification of cells, lesions, music pieces, gait, oil and gas reservoirs, cyclones, galaxies, bones, brain connections, languages, handwritten and gestured letters are shown

A peroxisome proliferator-activated receptor-δ agonist provides neuroprotection in the 1-methyl-4-phenyl-1,2,3,6-tetrahydropyridine model of Parkinson's disease

Copyright © 2013 IBRO. Published by Elsevier Ltd. All rights reserved.Peer reviewedPublisher PD

An Examination of Not-For-Profit Stakeholder Networks for Relationship Management: A Small-Scale Analysis on Social Media

Using a small-scale descriptive network analysis approach, this study highlights the importance of stakeholder networks for identifying valuable stakeholders and the management of existing stakeholders in the context of mental health not-for-profit services. We extract network data from the social media brand pages of three health service organizations from the U.S., U.K., and Australia, to visually map networks of 579 social media brand pages (represented by nodes), connected by 5,600 edges. This network data is analyzed using a collection of popular graph analysis techniques to assess the differences in the way each of the service organizations manage stakeholder networks. We also compare node meta-information against basic topology measures to emphasize the importance of effectively managing relationships with stakeholders who have large external audiences. Implications and future research directions are also discussed

Dedalo: looking for clusters explanations in a labyrinth of Linked Data

We present Dedalo, a framework which is able to exploit Linked Data to generate explanations for clusters. In general, any result of a Knowledge Discovery process, including clusters, is interpreted by human experts who use their background knowledge to explain them. However, for someone without such expert knowledge, those results may be difficult to understand. Obtaining a complete and satisfactory explanation becomes a laborious and time-consuming process, involving expertise in possibly different domains. Having said so, not only does the Web of Data contain vast amounts of such background knowledge, but it also natively connects those domains. While the efforts put in the interpretation process can be reduced with the support of Linked Data, how to automatically access the right piece of knowledge in such a big space remains an issue. Dedalo is a framework that dynamically traverses Linked Data to find commonalities that form explanations for items of a cluster. We have developed different strategies (or heuristics) to guide this traversal, reducing the time to get the best explanation. In our experiments, we compare those strategies and demonstrate that Dedalo finds relevant and sophisticated Linked Data explanations from different areas

Sharp bounds and normalization of Wiener-type indices

10.1371/journal.pone.0078448PLoS ONE811-POLN