Searcharxiv⌕ Search

arXiv subjects

Shanshan Li

Publications and source records attributed to Shanshan Li.

At least 55 records · Page 3Linked to original sources

An Attention-Fused Network for Semantic Segmentation of Very-High-Resolution Remote Sensing Imagery

Semantic segmentation is an essential part of deep learning. In recent years, with the development of remote sensing big data, semantic segmentation has been increasingly used in remote sensing. Deep convolutional neural networks (DCNNs) face the challenge of feature fusion: very-high-resolution remote sensing image multisource data fusion can increase the network's learnable information, which is conducive to correctly classifying target objects by DCNNs; simultaneously, the fusion of high-level abstract features and low-level spatial features can improve the classification accuracy at the border between target objects. In this paper, we propose a multipath encoder structure to extract features of multipath inputs, a multipath attention-fused block module to fuse multipath features, and a refinement attention-fused block module to fuse high-level abstract features and low-level spatial features. Furthermore, we propose a novel convolutional neural network architecture, named attention-fused network (AFNet). Based on our AFNet, we achieve state-of-the-art performance with an overall accuracy of 91.7% and a mean F1 score of 90.96% on the ISPRS Vaihingen 2D dataset and an overall accuracy of 92.1% and a mean F1 score of 93.44% on the ISPRS Potsdam 2D dataset.

cs.CV↗

ConfInLog: Leveraging Software Logs to Infer Configuration Constraints

Misconfigurations have become the dominant causes of software failures in recent years, drawing tremendous attention for their increasing prevalence and severity. Configuration constraints can preemptively avoid misconfiguration by defining the conditions that configuration options should satisfy. Documentation is the main source of configuration constraints, but it might be incomplete or inconsistent with the source code. In this regard, prior researches have focused on obtaining configuration constraints from software source code through static analysis. However, the difficulty in pointer analysis and context comprehension prevents them from collecting accurate and comprehensive constraints. In this paper, we observed that software logs often contain configuration constraints. We conducted an empirical study and summarized patterns of configuration-related log messages. Guided by the study, we designed and implemented ConfInLog, a static tool to infer configuration constraints from log messages. ConfInLog first selects configuration-related log messages from source code by using the summarized patterns, then infers constraints from log messages based on the summarized natural language patterns. To evaluate the effectiveness of ConfInLog, we applied our tool on seven popular open-source software systems. ConfInLog successfully inferred 22 to 163 constraints, in which 59.5% to 61.6% could not be inferred by the state-of-the-art work. Finally, we submitted 67 documentation patches regarding the constraints inferred by ConfInLog. The constraints in 29 patches have been confirmed by the developers, among which 10 patches have been accepted.

cs.SE↗

An Evolutionary Study of Configuration Design and Implementation in Cloud Systems

Many techniques were proposed for detecting software misconfigurations in cloud systems and for diagnosing unintended behavior caused by such misconfigurations. Detection and diagnosis are steps in the right direction: misconfigurations cause many costly failures and severe performance issues. But, we argue that continued focus on detection and diagnosis is symptomatic of a more serious problem: configuration design and implementation are not yet first-class software engineering endeavors in cloud systems. Little is known about how and why developers evolve configuration design and implementation, and the challenges that they face in doing so. This paper presents a source-code level study of the evolution of configuration design and implementation in cloud systems. Our goal is to understand the rationale and developer practices for revising initial configuration design/implementation decisions, especially in response to consequences of misconfigurations. To this end, we studied 1178 configuration-related commits from a 2.5 year version-control history of four large-scale, actively-maintained open-source cloud systems (HDFS, HBase, Spark, and Cassandra). We derive new insights into the software configuration engineering process. Our results motivate new techniques for proactively reducing misconfigurations by improving the configuration design and implementation process in cloud systems. We highlight a number of future research directions.

cs.SE↗

DepOwl: Detecting Dependency Bugs to Prevent Compatibility Failures

Applications depend on libraries to avoid reinventing the wheel. Libraries may have incompatible changes during evolving. As a result, applications will suffer from compatibility failures. There has been much research on addressing detecting incompatible changes in libraries, or helping applications co-evolve with the libraries. The existing solution helps the latest application version work well against the latest library version as an afterthought. However, end users have already been suffering from the failures and have to wait for new versions. In this paper, we propose DepOwl, a practical tool helping users prevent compatibility failures. The key idea is to avoid using incompatible versions from the very beginning. We evaluated DepOwl on 38 known compatibility failures from StackOverflow, and DepOwl can prevent 32 of them. We also evaluated DepOwl using the software repository shipped with Ubuntu-19.10. DepOwl detected 77 unknown dependency bugs, which may lead to compatibility failures.

cs.SE↗

GWOPS: A VO-technology Driven Tool to Search for the Electromagnetic Counterpart of Gravitational Wave Event

The search and follow-up observation of electromagnetic (EM) counterparts of gravitational waves (GW) is a current hot topic of GW cosmology. Due to the limitation of the accuracy of the GW observation facility at this stage, we can only get a rough sky-localization region for the GW event, and the typical area of the region is between 200 and 1500 square degrees. Since GW events occur in or near galaxies, limiting the observation target to galaxies can significantly speedup searching for EM counterparts. Therefore, how to efficiently select host galaxy candidates in such a large GW localization region, how to arrange the observation sequence, and how to efficiently identify the GW source from observational data are the problems that need to be solved. International Virtual Observatory Alliance has developed a series of technical standards for data retrieval, interoperability and visualization. Based on the application of VO technologies, we construct the GW follow-up Observation Planning System (GWOPS). It consists of three parts: a pipeline to select host candidates of GW and sort their priorities for follow-up observation, an identification module to find the transient from follow-up observation data, and a visualization module to display GW-related data. GWOPS can rapidly respond to GW events. With GWOPS, the operations such as follow-up observation planning, data storage, data visualization, and transient identification can be efficiently coordinated, which will promote the success searching rate for GWs EM counterparts.

astro-ph.IM↗

Towards an Astronomical Science Platform: Experiences and Lessons Learned from Chinese Virtual Observatory

In the era of big data astronomy, next generation telescopes and large sky surveys produce data sets at the TB or even PB level. Due to their large data volumes, these astronomical data sets are extremely difficult to transfer and analyze using personal computers or small clusters. In order to offer better access to data, data centers now generally provide online science platforms that enable analysis close to the data. The Chinese Virtual Observatory (China-VO) is one of the member projects in the International Virtual Observatory Alliance and it is dedicated to providing a research and education environment where globally distributed astronomy archives are simple to find, access, and interoperate. In this study, we summarize highlights of the work conducted at the China-VO, as well the experiences and lessons learned during the full life-cycle management of astronomical data. Finally, We discuss the challenges and future trends for astronomical science platforms.

astro-ph.IM↗

IVOA HiPS Implementation in the Framework of WorldWide Telescope

The WorldWide Telescope(WWT) is a scientific visualization platform which can browse deep space images, star catalogs, and planetary remote sensing data from different observation facilities in a three-dimensional virtual scene. First launched and then open-sourced by Microsoft Research, the WWT is now managed by the American Astronomical Society (AAS). Hierarchical Progressive Survey (HiPS) is an astronomical data release scheme proposed by Centre de Données astronomiques de Strasbourg (CDS) and has been accepted as a recommendation by International Virtual Observatory Alliance (IVOA). The HiPS solution has been adopted widely by many astronomical institutions for data release. Since WWT selected Hierarchical Triangular Mesh (HTM) as the standard for data visualization in the early stage of development, data released by HiPS cannot be visualized in WWT, which significantly limits the application of WWT. This paper introduces the implementation method for HiPS dataset visualization in WWT, and introduces HiPS data projection, mesh rendering, and data index implementation in WWT. Taking Chang'E-2 lunar probe data as an example, this paper introduces how to convert planetary remote sensing data into a HiPS dataset and integrate it into WWT. This paper also compares the efficiency and memory consumption of WWT loading its native data and HiPS data, and illustrates the application of HiPS in scientific data visualization and science education in WWT.

astro-ph.IM↗

DCLab: A Web-based System for Digital Logic Experiment Teaching

This Research-to-Practice Work in Progress paper presents DCLab, a web-based system for conducting digital logic experiments online, to improve both the effectiveness and the efficiency of digital logic experiment teaching. DCLab covers all experimental contents required by traditional digital logic experiment classes. It allows the students to draw circuit diagrams or to write VHDL code to design their own circuits, and it provides complete simulation functions. DCLab records the progress of each student and makes it convenient for a student to review the history of his practice. Furthermore, for the instructors, they are able to post homework assignments on DCLab, and the system will automatically add homework projects to the students' home pages. Statistics about how the students perform on the homework will be displayed to the instructors, which may help them develop more effective courses. We have tested DCLab among students in the digital logic course, and the results have confirmed its validity.

cs.CY↗

Complexity Bounds on Quantum Search Algorithms in finite-dimensional Networks

We establish a lower bound concerning the computational complexity of Grover's algorithms on fractal networks. This bound provides general predictions for the quantum advantage gained for searching unstructured lists. It yields a fundamental criterion, derived from quantum transport properties, for the improvement a quantum search algorithm achieves over the corresponding classical search in a network based solely on its spectral dimension, $d_{s}$. Our analysis employs recent advances in the interpretation of the venerable real-space renormalization group (RG) as applied to quantum walks. It clarifies the competition between Grover's abstract algorithm, i.e., a rotation in Hilbert space, and quantum transport in an actual geometry. The latter is characterized in terms of the quantum walk dimension $d_{w}^{Q}$ and the spatial (fractal) dimension $d_{f}$ that is summarized simply by the spectral dimension of the network. The analysis simultaneously determines the optimal time for a quantum measurement and the probability for successfully pin-pointing a marked element in the network. The RG further encompasses an optimization scheme devised by Tulsi that allows to tune this probability to certainty, leaving quantum transport as the only limiting process. It considers entire families of problems to be studied, thereby establishing large universality classes for quantum search, which we verify with extensive simulations. The methods we develop could point the way towards systematic studies of universality classes in computational complexity to enable modification and control of search behavior.

cond-mat.stat-mech↗

Type-II Dirac photons at the metasurfaces

Topological characteristics of energy bands, such as Dirac/Weyl nodes, have attracted substantial interest in condensed matter systems as well as in classical wave systems. Among these energy bands, the type-II Dirac point is a nodal degeneracy with tilted conical dispersion, leading to a peculiar crossing dispersion in the constant energy plane. Such nodal points have recently been found in electronic materials. The analogous topological feature in photonic systems remains a theoretical curiosity, with experimental realization expected to be challenging. Here, we experimentally realize the type-II Dirac point using a planar metasurface architecture, where the band degeneracy point is protected by the underlying mirror symmetry of the metasurface. Gapless edge modes are found and measured at the boundary between the different domains of the symmetry-broken metasurface. Our work shows that metasurfaces are simple and practical platforms for realizing electromagnetic type-II Dirac points, and their planar structure is a distinct advantage that facilitates applications in two-dimensional topological photonics.

physics.app-ph↗

A hybrid architecture for astronomical computing

With many large science equipment constructing and putting into use, astronomy has stepped into the big data era. The new method and infrastructure of big data processing has become a new requirement of many astronomers. Cloud computing, Map/Reduce, Hadoop, Spark, etc. many new technology has sprung up in recent years. Comparing to the high performance computing(HPC), Data is the center of these new technology. So, a new computing architecture infrastructure is necessary, which can be shared by both HPC and big data processing. Based on Astronomy Cloud project of Chinese Virtual Observatory (China-VO), we have made much efforts to optimize the designation of the hybrid computing platform. which include the hardware architecture, cluster management, Job and Resource scheduling.

cs.DC↗

A Conception of Engineering Design for Remote Unattended Operation Public Observatory

Public observatory project is playing more and more important role in science popularization education and scientific research, and many amateur astronomers also have began to build their own observatories in remote areas. As a result of the limitation of technical condition and construction funds for amateur astronomers, their system often breaks down, and then a stable remote unattended operation system becomes very critical. Hardware connection and control is the basic and core part in observatory design. Here we propose a conception of engineering hardware design for public observatory operation as a bridge between observatory equipment and observation software. It can not only satisfy multiple observation mode requirement, but also save cost.

astro-ph.IM↗

IAU WG, Data-driven Astronomy Education and Public Outreach,current status and working plans

IAU Inter-Commission B2-C1-C2 WG Data-driven Astronomy Education and Public Outreach (DAEPO) was launched officially in April 2017. With the development of many mega-science astronomical projects, for example CTA, DESI, EUCLID, FAST, GAIA, JWST, LAMOST, LSST, SDSS, SKA, and large scale simulations, astronomy has become a Big Data science. Astronomical data is not only necessary resource for scientific research, but also very valuable resource for education and public outreach (EPO), especially in the era of Internet and Cloud Computing. IAU WG Data-driven Astronomy Education and Public Outreach is hosted at the IAU Division B (Facilities, Technologies and Data Science) Commission B2 (Data and Documentation), and organized jointly with Commission C1 (Astronomy Education and Development), Commission C2 (Communicating Astronomy with the Public), Office of Astronomy for Development (OAD), Office for Astronomy Outreach (OAO) and several other non IAU communities, including IVOA Education Interest Group, American Astronomical Society Worldwide Telescope Advisory Board, Zooniverse project and International Planetarium Society. The working group has the major objectives to: Act as a forum to discuss the value of astronomy data in EPO, the advantages and benefits of data driven EPO, and the challenges facing to data driven EPO; Provide guidelines, curriculum, data resources, tools, and e-infrastructure for data driven EPO; Provide best practices of data driven EPO. In the paper, backgrounds, current status and working plans in the future are introduced. More information about the WG is available at: http://daepo.china-vo.org/

astro-ph.IM↗

Analysis of Coined Quantum Walks with Renormalization

We introduce a new framework to analyze quantum algorithms with the renormalization group (RG). To this end, we present a detailed analysis of the real-space RG for discrete-time quantum walks on fractal networks and show how deep insights into the analytic structure as well as generic results about the long-time behavior can be extracted. The RG-flow for such a walk on a dual Sierpinski gasket and a Migdal-Kadanoff hierarchical network is obtained explicitly from elementary algebraic manipulations, after transforming the unitary evolution equation into Laplace space. Unlike for classical random walks, we find that the long-time asymptotics for the quantum walk requires consideration of a diverging number of Laplace-poles, which we demonstrate exactly for the closed form solution available for the walk on a 1d-loop. In particular, we calculate the probability of the walk to overlap with its starting position, which oscillates with a period that scales as $N^{d_{w}^{Q}/d_{f}}$ with system size $N$. While the largest Jacobian eigenvalue $λ_{1}$ of the RG-flow merely reproduces the fractal dimension, $d_{f}=\log_{2}λ_{1}$, the asymptotic analysis shows that the second Jacobian eigenvalue $λ_{2}$ becomes essential to determine the dimension of the quantum walk via $d_{w}^{Q}=\log_{2}\sqrt{λ_{1}λ_{2}}$. We trace this fact to delicate cancellations caused by unitarity. We obtain identical relations for other networks, although the details of the RG-analysis may exhibit surprisingly distinct features. Thus, our conclusions -- which trivially reproduce those for regular lattices with translational invariance with $d_{f}=d$ and $d_{w}^{Q}=1$ -- appear to be quite general and likely apply to networks beyond those studied here.

quant-ph↗

Evaluation of Spectral Zeta-Functions with the Renormalization Group

We evaluate spectral zeta-functions of certain network Laplacians that can be treated exactly with the renormalization group. As specific examples we consider a class of Hanoi networks and those hierarchical networks obtained by the Migdal-Kadanoff bond moving scheme from regular lattices. As possible applications of these results we mention quantum search algorithms as well as synchronization, which we discuss in more detail.

math-ph↗

Renormalization of the Unitary Evolution Equation for Coined Quantum Walks

We consider discrete-time evolution equations in which the stochastic operator of a classical random walk is replaced by a unitary operator. Such a problem has gained much attention as a framework for coined quantum walks that are essential for attaining the Grover limit for quantum search algorithms in physically realizable, low-dimensional geometries. In particular, we analyze the exact real-space renormalization group (RG) procedure recently introduced to study the scaling of quantum walks on fractal networks. While this procedure, when implemented numerically, was able to provide some deep insights into the relation between classical and quantum walks, its analytic basis has remained obscure. Our discussion here is laying the groundwork for a rigorous implementation of the RG for this important class of transport and algorithmic problems, although some instances remain unresolved. Specifically, we find that the RG fixed-point analysis of the classical walk, which typically focuses on the dominant Jacobian eigenvalue $λ_{1}$, with walk dimension $d_{w}^{RW}=\log_{2}λ_{1}$, needs to be extended to include the subdominant eigenvalue $λ_{2}$, such that the dimension of the quantum walk obtains $d_{w}^{QW}=\log_{2}\sqrt{λ_{1}λ_{2}}$. With that extension, we obtain analytically previously conjectured results for $d_{w}^{QW}$ of Grover walks on all but one of the fractal networks that have been considered.

quant-ph↗

Parametric Solution of a Small-Large Black Hole Coexistence Curve

We consider the first-order phase transition of a charged anti-de Sitter black hole, and find that the equation of state with the conditions of the two coexisting phases, leads to the two coupled equations about the thermodynamic volumes of small black hole and large black hole. By solving the equations, it is found that each reduced volume is only a function of the parameter $ω$ . All properties of the coexistence curve can be studied from the two volume functions. In particular, each thermodynamic quantity is described by a piecewise analytic function. The demarcation point is located at $ω_{d}=12(2\sqrt{3}-3)$. The thermodynamic function but not its derivative, is continuous at the point. This property is completely different from that of the ven der Waals fluid. Moreover, the thermodynamic behaviors as $ω\rightarrow0$ are discussed. From which one can easily obtain some critical exponents and amplitudes for small-large black hole phase transitions.

gr-qc↗

AstroCloud: A Distributed Cloud Computing and Application Platform for Astronomy

Virtual Observatory (VO) is a data-intensively online astronomical research and education environment, which takes advantages of advanced information technologies to achieve seamless and global access to astronomical information. AstroCloud is a cyber-infrastructure for astronomy research initiated by Chinese Virtual Observatory (China-VO) project, and also a kind of physical distributed platform which integrates lots of tasks such as telescope access proposal management, data archiving, data quality control, data release and open access, cloud based data processing and analysis. It consists of five application channels, i.e. observation, data, tools, cloud and public and is acting as a full lifecycle management system and gateway for astronomical data and telescopes. Physically, the platform is hosted in six cities currently, i.e. Beijing, Nanjing, Shanghai, Kunming, Lijiang and Urumqi, and serving more than 17 thousand users. Achievements from international Virtual Observatories and Cloud Computing are adopted heavily. In the paper, backgrounds of the project, architecture, Cloud Computing environment, key features of the system, current status and future plans are introduced.

astro-ph.IM↗