Searcharxiv⌕ Search

arXiv subjects

Shanshan Li

Publications and source records attributed to Shanshan Li.

66 records · Page 4Linked to original sources

The Griffiths Phase on Hierarchical Modular Networks with Small-world Edges

The Griffiths phase has been proposed to induce a stretched critical regime that facilitates self-organizing of brain networks for optimal function. This phase stems from the intrinsic structural heterogeneity of brain networks, such as the hierarchical modular structure. In this work, we extend this concept to modified hierarchical networks with small-world connections based on Hanoi networks. Through extensive simulations, we identify the role of an exponential distribution of the inter-moduli connectivity probability across hierarchies determining the emergence of the Griffiths phase. Numerical results and the complementary spectral analysis on the relevant networks can be helpful for a deeper understanding of the essential structural characteristics of finite dimensional networks to support the Griffiths phase.

cond-mat.dis-nn↗

Continuous Time Quantum Walks in finite Dimensions

We consider the quantum search problem with a continuous time quantum walk for networks of finite spectral dimension d_{s} of the network Laplacian. For general networks of fractal (integer or non-integer) dimension d_{f}, for which in general d_{f}\not=d_{s}, it suggests that d_{s} is the scaling exponent that determines the computational complexity of the search. Our results are consistent with those of Childs and Goldstone [Phys. Rev. A 70 (2004), 022314] for lattices of integer dimension, where d=d_{f}=d_{s}. For general fractals, we find that the Grover limit of quantum search can be obtained whenever d_{s}>4. This complements the recent discussion of mean-field (i.e., d_{s}\to\infty) networks by Chakraborty et al. [Phys. Rev. Lett. 116 (2016), 100501] showing that for all those networks spatial search by quantum walk is optimal.

quant-ph↗

Update of the China-VO AstroCloud

As the cyber-infrastructure for Astronomical research from Chinese Virtual Observatory (China-VO) project, AstroCloud has been archived solid progresses during the last one year. Proposal management system and data access system are re-designed. Several new sub-systems are developed, including China-VO PaperData, AstroCloud Statics and Public channel. More data sets and application environments are integrated into the platform. LAMOST DR1, the largest astronomical spectrum archive was released to the public using the platform. The latest progresses will be introduced.

astro-ph.IM↗

The LAMOST Data Archive and Data Release

The Large sky Area Multi-Object Fiber Spectroscopic Telescope (LAMOST) is the largest optical telescope in China. In last four years, the LAMOST telescope has published four editions data (pilot data release, data release 1, data release 2 and data release 3). To archive and release these data (raw data, catalog, spectrum etc), we have set up a data cycle management system, including the transfer of data, archiving, backup. And through the evolution of four software versions, mature established data release system.

astro-ph.IM↗

Real-Space Renormalization Group for Spectral Properties of Hierarchical Networks

We derive the determinant of the Laplacian for the Hanoi networks and use it to determine their number of spanning trees (or graph complexity) asymptotically. While spanning trees generally proliferate with increasing average degree, the results show that modifications within the basic patterns of design of these hierarchical networks can lead to significant variations in their complexity. To this end, we develop renormalization group methods to obtain recursion equations from which many spectral properties can be obtained. This provides the basis for future applications to explore the physics of several dynamic processes.

cond-mat.stat-mech↗

On the Shoulders of Giants: Incremental Influence Maximization in Evolving Social Networks

Identifying the most influential individuals can provide invaluable help in developing and deploying effective viral marketing strategies. Previous studies mainly focus on designing efficient algorithms or heuristics to find top-K influential nodes on a given static social network. While, as a matter of fact, real-world social networks keep evolving over time and a recalculation upon the changed network inevitably leads to a long running time, significantly affecting the efficiency. In this paper, we observe from real-world traces that the evolution of social network follows the preferential attachment rule and the influential nodes are mainly selected from high-degree nodes. Such observations shed light on the design of IncInf, an incremental approach that can efficiently locate the top-K influential individuals in evolving social networks based on previous information instead of calculation from scratch. In particular, IncInf quantitatively analyzes the influence spread changes of nodes by localizing the impact of topology evolution to only local regions, and a pruning strategy is further proposed to effectively narrow the search space into nodes experiencing major increases or with high degrees. We carried out extensive experiments on real-world dynamic social networks including Facebook, NetHEPT, and Flickr. Experimental results demonstrate that, compared with the state-of-the-art static heuristic, IncInf achieves as much as 21X speedup in execution time while maintaining matching performance in terms of influence spread.

cs.SI↗

Terahertz nonlinear conduction and absorption saturation in silicon waveguides

We employ a silicon dielectric waveguide to confine and concentrate terahertz pulses, and observe that the absorption saturates under strong terahertz fields. By comparing the response between lightly-doped and intrinsic silicon waveguides, we confirm the role of hot carriers in this saturable absorption. We introduce a nonlinear dynamical model of Drude conductivity that, when incorporated into a wave propagation equation, accurately reproduces the observations and elucidates the physical mechanisms underlying this nonlinear effect. The results are numerically confirmed by Monte Carlo simulations of the Boltzmann transport equation, coupled with split-step nonlinear wave propagation.

cond-mat.mtrl-sci↗

AstroCloud, a Cyber-Infrastructure for Astronomy Research: Architecture

AstroCloud is a cyber-Infrastructure for Astronomy Research initiated by Chinese Virtual Observatory (China-VO) under funding support from NDRC (National Development and Reform commission) and CAS (Chinese Academy of Sciences). The ultimate goal of this project is to provide a comprehensive end-to-end astronomy research environment where several independent systems seamlessly collaborate to support the full lifecycle of the modern observational astronomy based on big data, from proposal submission, to data archiving, data release, and to in-situ data analysis and processing. In this paper, the architecture and key designs of the AstroCloud platform are introduced, including data access middleware, access control and security framework, extendible proposal workflow, and system integration mechanism.

astro-ph.IM↗

AstroCloud, a Cyber-Infrastructure for Astronomy Research: Data Archiving and Quality Control

AstroCloud is a cyber-Infrastructure for Astronomy Research initiated by Chinese Virtual Observatory (China-VO) under funding support from NDRC (National Development and Reform commission) and CAS (Chinese Academy of Sciences){\url{http://astrocloud.china-vo.org}}\citep{O8-5_Cui_adassxxiv}. To archive the astronomical data in China, we present the implementation of the astronomical data archiving system (ADAS). Data archiving and quality control are the infrastructure for the AstroCloud. Throughout the data of the entire life cycle, data archiving system standardized data, transferring data, logging observational data, archiving ambient data, And storing these data and metadata in database. Quality control covers the whole process and all aspects of data archiving.

astro-ph.IM↗

AstroCloud, a Cyber-Infrastructure for Astronomy Research: Data Access and Interoperability

Data access and interoperability module connects the observation proposals, data, virtual machines and software. According to the unique identifier of PI (principal investigator), an email address or an internal ID, data can be collected by PI's proposals, or by the search interfaces, e.g. conesearch. Files associated with the searched results could be easily transported to cloud storages, including the storage with virtual machines, or several commercial platforms like Dropbox. Benefitted from the standards of IVOA (International Observatories Alliance), VOTable formatted searching result could be sent to kinds of VO software. Latter endeavor will try to integrate more data and connect archives and some other astronomical resources.

astro-ph.IM↗

Sensitive Room-Temperature Terahertz Detection via Photothermoelectric Effect in Graphene

Terahertz (THz) radiation has uses from security to medicine; however, sensitive room-temperature detection of THz is notoriously difficult. The hot-electron photothermoelectric effect in graphene is a promising detection mechanism: photoexcited carriers rapidly thermalize due to strong electron-electron interactions, but lose energy to the lattice more slowly. The electron temperature gradient drives electron diffusion, and asymmetry due to local gating or dissimilar contact metals produces a net current via the thermoelectric effect. Here we demonstrate a graphene thermoelectric THz photodetector with sensitivity exceeding 10 V/W (700 V/W) at room temperature and noise equivalent power less than 1100 pW/Hz^1/2 (20 pW/Hz^1/2), referenced to the incident (absorbed) power. This implies a performance which is competitive with the best room-temperature THz detectors for an optimally coupled device, while time-resolved measurements indicate that our graphene detector is eight to nine orders of magnitude faster than those. A simple model of the response, including contact asymmetries (resistance, work function and Fermi-energy pinning) reproduces the qualitative features of the data, and indicates that orders-of-magnitude sensitivity improvements are possible.

cond-mat.mes-hall↗

A Generalization of Fueter's Theorem in Dunkl-Clifford Analysis

In this paper we first offer an alternative approach to extend the original Fueter's Theorem in Dunkl-Clifford analysis to a version of the higher order case. Then this result is used to prove a generlized version of Fueter's Theorem with an extra homogeneous Dunkl-monogenic polynomial $P_n(x_0,\underline{x})$ in $\R_1^d$ instead of the classical factor $P_n(\underline{x})$ in $\R^d$.

math.CV↗