arXiv subjects

Can Li

Publications and source records attributed to Can Li.

At least 91 records · Page 5Linked to original sources

arXiv2022

Topological Defects Induced High-Spin Quartet State in Truxene-Based Molecular Graphenoids

Topological defects in graphene materials introduce exotic properties which are absent in their defect-free counterparts with both fundamental importance and technological implications. Although individual topological defects have been widely studied, collective magnetic behaviors originating from well-organized multiple topological defects remain a great challenge. Here, we studied the collective magnetic properties originating from three pentagon topological defects in truxene-based molecular graphenoids by using scanning tunneling microscopy and non-contact atomic force microscopy. Unpaired $π$ electrons are introduced into the aromatic topology of truxene molecular graphenoids one by one by dissociating hydrogen atoms at the pentagon defects via atom manipulation. Scanning tunneling spectroscopy measurements together with density functional theory calculations suggest that the unpaired electrons are ferromagnetically coupled, forming a collective high-spin quartet state of S=3/2. Our work demonstrates that the collective spin ordering can be realized through engineering regular patterned topological defects in molecular graphenoids, providing a new platform for designer one-dimensional ferromagnetic spin chains and two-dimensional ferromagnetic networks.

cond-mat.mes-hall↗

arXiv2021

VSR: A Unified Framework for Document Layout Analysis combining Vision, Semantics and Relations

Document layout analysis is crucial for understanding document structures. On this task, vision and semantics of documents, and relations between layout components contribute to the understanding process. Though many works have been proposed to exploit the above information, they show unsatisfactory results. NLP-based methods model layout analysis as a sequence labeling task and show insufficient capabilities in layout modeling. CV-based methods model layout analysis as a detection or segmentation task, but bear limitations of inefficient modality fusion and lack of relation modeling between layout components. To address the above limitations, we propose a unified framework VSR for document layout analysis, combining vision, semantics and relations. VSR supports both NLP-based and CV-based methods. Specifically, we first introduce vision through document image and semantics through text embedding maps. Then, modality-specific visual and semantic features are extracted using a two-stream network, which are adaptively fused to make full use of complementary information. Finally, given component candidates, a relation module based on graph neural network is incorported to model relations between components and output final results. On three popular benchmarks, VSR outperforms previous models by large margins. Code will be released soon.

cs.CV↗

arXiv2021

Tree-based machine learning performed in-memory with memristive analog CAM

Tree-based machine learning techniques, such as Decision Trees and Random Forests, are top performers in several domains as they do well with limited training datasets and offer improved interpretability compared to Deep Neural Networks (DNN). However, while easier to train, they are difficult to optimize for fast inference without accuracy loss in von Neumann architectures due to non-uniform memory access patterns. Recently, we proposed a novel analog, or multi-bit, content addressable memory(CAM) for fast look-up table operations. Here, we propose a design utilizing this as a computational primitive for rapid tree-based inference. Large random forest models are mapped to arrays of analog CAMs coupled to traditional analog random access memory (RAM), and the unique features of the analog CAM enable compression and high performance. An optimized architecture is compared with previously proposed tree-based model accelerators, showing improvements in energy to decision by orders of magnitude for common image classification tasks. The results demonstrate the potential for non-volatile analog CAM hardware in accelerating large tree-based machine learning models.

cs.ET↗

arXiv2020

Compressive Shack-Hartmann Wavefront Sensor based on Deep Neural Networks

The Shack-Hartmann wavefront sensor is widely used to measure aberrations induced by atmospheric turbulence in adaptive optics systems. However if there exists strong atmospheric turbulence or the brightness of guide stars is low, the accuracy of wavefront measurements will be affected. In this paper, we propose a compressive Shack-Hartmann wavefront sensing method. Instead of reconstructing wavefronts with slope measurements of all sub-apertures, our method reconstructs wavefronts with slope measurements of sub-apertures which have spot images with high signal to noise ratio. Besides, we further propose to use a deep neural network to accelerate wavefront reconstruction speed. During the training stage of the deep neural network, we propose to add a drop-out layer to simulate the compressive sensing process, which could increase development speed of our method. After training, the compressive Shack-Hartmann wavefront sensing method can reconstruct wavefronts in high spatial resolution with slope measurements from only a small amount of sub-apertures. We integrate the straightforward compressive Shack-Hartmann wavefront sensing method with image deconvolution algorithm to develop a high-order image restoration method. We use images restored by the high-order image restoration method to test the performance of our the compressive Shack-Hartmann wavefront sensing method. The results show that our method can improve the accuracy of wavefront measurements and is suitable for real-time applications.

astro-ph.IM↗

arXiv2020

Designer spin order in diradical nanographenes

The magnetic properties of carbon materials are at present the focus of an intense research effort in physics, chemistry and materials science due to their potential applications in spintronics and quantum computations. Although the presence of spins in open-shell nanographenes has been recently confirmed, the ability to control magnetic coupling sign has remained elusive, but the most desirable. Here, we demonstrate an effective approach of engineering magnetic ground states in atomically precise open-shell bipartite/nonbipartite nanographenes using combined scanning probe techniques and mean-field Hubbard model calculations. The magnetic coupling sign between two spins has been controlled via breaking bipartite lattice symmetry of nanographenes. In addition, the exchange-interaction strength between two spins has been widely tuned by finely tailoring their spin density overlap, realizing a large exchange-interaction strength of 42 meV. Our demonstrated method provides ample opportunities for designer above-room-temperature magnetic phases and functionalities in graphene nanomaterials.

cond-mat.mes-hall↗

arXiv2020

Adaptive Graph Convolutional Recurrent Network for Traffic Forecasting

Modeling complex spatial and temporal correlations in the correlated time series data is indispensable for understanding the traffic dynamics and predicting the future status of an evolving traffic system. Recent works focus on designing complicated graph neural network architectures to capture shared patterns with the help of pre-defined graphs. In this paper, we argue that learning node-specific patterns is essential for traffic forecasting while the pre-defined graph is avoidable. To this end, we propose two adaptive modules for enhancing Graph Convolutional Network (GCN) with new capabilities: 1) a Node Adaptive Parameter Learning (NAPL) module to capture node-specific patterns; 2) a Data Adaptive Graph Generation (DAGG) module to infer the inter-dependencies among different traffic series automatically. We further propose an Adaptive Graph Convolutional Recurrent Network (AGCRN) to capture fine-grained spatial and temporal correlations in traffic series automatically based on the two modules and recurrent networks. Our experiments on two real-world traffic datasets show AGCRN outperforms state-of-the-art by a significant margin without pre-defined graphs about spatial connections.

cs.LG↗

arXiv2020

Knowledge Adaption for Demand Prediction based on Multi-task Memory Neural Network

Accurate demand forecasting of different public transport modes(e.g., buses and light rails) is essential for public service operation.However, the development level of various modes often varies sig-nificantly, which makes it hard to predict the demand of the modeswith insufficient knowledge and sparse station distribution (i.e.,station-sparse mode). Intuitively, different public transit modes mayexhibit shared demand patterns temporally and spatially in a city.As such, we propose to enhance the demand prediction of station-sparse modes with the data from station-intensive mode and designaMemory-Augmented Multi-taskRecurrent Network (MATURE)to derive the transferable demand patterns from each mode andboost the prediction of station-sparse modes through adaptingthe relevant patterns from the station-intensive mode. Specifically,MATUREcomprises three components: 1) a memory-augmentedrecurrent network for strengthening the ability to capture the long-short term information and storing temporal knowledge of eachtransit mode; 2) a knowledge adaption module to adapt the rele-vant knowledge from a station-intensive source to station-sparsesources; 3) a multi-task learning framework to incorporate all theinformation and forecast the demand of multiple modes jointly.The experimental results on a real-world dataset covering four pub-lic transport modes demonstrate that our model can promote thedemand forecasting performance for the station-sparse modes.

cs.AI↗

arXiv2020

Abrupt declines in tropospheric nitrogen dioxide over China after the outbreak of COVID-19

China's policy interventions to reduce the spread of the coronavirus disease 2019 have environmental and economic impacts. Tropospheric nitrogen dioxide indicates economic activities, as nitrogen dioxide is primarily emitted from fossil fuel consumption. Satellite measurements show a 48% drop in tropospheric nitrogen dioxide vertical column densities from the 20 days averaged before the 2020 Lunar New Year to the 20 days averaged after. This is 20% larger than that from recent years. We relate to this reduction to two of the government's actions: the announcement of the first report in each province and the date of a province's lockdown. Both actions are associated with nearly the same magnitude of reductions. Our analysis offers insights into the unintended environmental and economic consequences through reduced economic activities.

physics.ao-ph↗

arXiv2020

Analog content addressable memories with memristors

A content-addressable-memory compares an input search word against all rows of stored words in an array in a highly parallel manner. While supplying a very powerful functionality for many applications in pattern matching and search, it suffers from large area, cost and power consumption, limiting its use. Past improvements have been realized by using memristors to replace the static-random-access-memory cell in conventional designs, but employ similar schemes based only on binary or ternary states for storage and search. We propose a new analog content-addressable-memory concept and circuit to overcome these limitations by utilizing the analog conductance tunability of memristors. Our analog content-addressable-memory stores data within the programmable conductance and can take as input either analog or digital search values. Experimental demonstrations, scaled simulations and analysis show that our analog content-addressable-memory can reduce area and power consumption, which enables the acceleration of existing applications, but also new computing application areas.

cs.ET↗

arXiv2019

Harnessing Intrinsic Noise in Memristor Hopfield Neural Networks for Combinatorial Optimization

We describe a hybrid analog-digital computing approach to solve important combinatorial optimization problems that leverages memristors (two-terminal nonvolatile memories). While previous memristor accelerators have had to minimize analog noise effects, we show that our optimization solver harnesses such noise as a computing resource. Here we describe a memristor-Hopfield Neural Network (mem-HNN) with massively parallel operations performed in a dense crossbar array. We provide experimental demonstrations solving NP-hard max-cut problems directly in analog crossbar arrays, and supplement this with experimentally-grounded simulations to explore scalability with problem size, providing the success probabilities, time and energy to solution, and interactions with intrinsic analog noise. Compared to fully digital approaches, and present-day quantum and optical accelerators, we forecast the mem-HNN to have over four orders of magnitude higher solution throughput per power consumption. This suggests substantially improved performance and scalability compared to current quantum annealing approaches, while operating at room temperature and taking advantage of existing CMOS technology augmented with emerging analog non-volatile memristors.

cs.ET↗

arXiv2018

Time-resolved quantum spin transport through an Aharonov-Casher ring

After obtaining an exact analytical time-varying solution for the Aharonov-Casher conducting ring embedded in a textured static/dynamic electric field, we investigate the spin-resolved quantum transport in the structure. It is shown that the interference patterns are governed by not only the Aharonov-Casher geometry phase but also the instantaneous phase difference of spin precession through different traveling paths. This dynamic phase is determined by the strength of applied electric field and can have substantial effects on the charge/spin conductances, especially in the weak field regime as the period of spin precession comparable to that of the orbital motion. Our studies suggest that a low-frequency normal electric field with moderate strength possesses more degrees of freedom for manipulating the spin interference of incident electrons.

cond-mat.mes-hall↗

arXiv2018

Long short-term memory networks in memristor crossbars

Recent breakthroughs in recurrent deep neural networks with long short-term memory (LSTM) units has led to major advances in artificial intelligence. State-of-the-art LSTM models with significantly increased complexity and a large number of parameters, however, have a bottleneck in computing power resulting from limited memory capacity and data communication bandwidth. Here we demonstrate experimentally that LSTM can be implemented with a memristor crossbar, which has a small circuit footprint to store a large number of parameters and in-memory computing capability that circumvents the 'von Neumann bottleneck'. We illustrate the capability of our system by solving real-world problems in regression and classification, which shows that memristor LSTM is a promising low-power and low-latency hardware platform for edge inference.

cs.ET↗

arXiv2018

Memristor Crossbars with 4.5 Terabits-per-Inch-Square Density and Two Nanometer Dimension

Memristor is a promising building block for the next generation nonvolatile random access memory and bio-inspired computing systems. Organizing memristors into high density crossbar arrays, although challenging, is critical to meet the ever-growing high capacity and low energy demands of these applications especially in the big data era. Here, we construct memristor crossbars with a single-layer density up to 4.5 terabits per inch square, an order of magnitude denser than the state- of-the-art 64-layer triple level cell NAND flash technology. The memristors in the crossbars are 2 $\times$ 2 nm$^2$ in size, capable of switching with tens of nano ampere electric current. The densely packed memristor crossbars of extremely small working devices provides a power-efficient solution for high density information storage and processing.

cond-mat.mes-hall↗

arXiv2017

The effect of hydroxyl on dye-sensitized solar cells assembled with TiO2 nanorods

TiO2 nanorods have been prepared on ITO substrates by dc reactive magnetron sputtering technique. The hydroxyl groups have been introduced on the nanorods surface. The structure and the optical properties of these nanorods have been studied. The dye-sensitized solar cells (DSSCs) have been assembled using these TiO2 nanorods as photoelectrode. And the effect of the hydroxyl groups on the properties of the photoelectric conversion of the DSSCs has been studied.

physics.app-ph↗

arXiv2017

Local discontinuous Galerkin methods for the time tempered fractional diffusion equation

In this article, we consider discrete schemes for a fractional diffusion equation involving a tempered fractional derivative in time. We present a semi-discrete scheme by using the local discontinuous Galerkin (LDG) discretization in the spatial variables. We prove that the semi-discrete scheme is unconditionally stable in $L^2$ norm and convergence with optimal convergence rate $\mathcal{O}(h^{k+1})$. We develop a class of fully discrete LDG schemes by combining the weighted and shifted Lubich difference operators with respect to the time variable, and establish the error estimates. Finally, numerical experiments are presented to verify the theoretical results.

math.NA↗

arXiv2015

On the stability of exact ABCs for the reaction-subdiffusion equation on unbounded domain

In this note we propose the exact artificial boundary conditions formula to the fractional reaction-subdiffusion equation on an unbounded domain. With the application of Laplace transformation, the exact artificial boundary conditions (ABCs) are derived to reformulate the original problem on the unbounded domain to an initial-boundary-value problem on the bounded computational domain. By the Kreiss theory, we prove that the reduced initial-boundary value problem is stability. Based on the properties of tempered fractional calculus, we obtain that the reduced initial-boundary value problem is long-time stability.

math.AP↗

arXiv2015

Well-posedness and numerical algorithm for the tempered fractional ordinary differential equations

Trapped dynamics widely appears in nature, e.g., the motion of particles in viscous cytoplasm. The famous continuous time random walk (CTRW) model with power law waiting time distribution ({\em having diverging first moment}) describes this phenomenon. Because of the finite lifetime of biological particles, sometimes it is necessary to temper the power law measure such that the waiting time measure has convergent first moment. Then the time operator of the Fokker-Planck equation corresponding to the CTRW model with tempered waiting time measure is the so-called tempered fractional derivative. This paper focus on discussing the properties of the time tempered fractional derivative, and studying the well-posedness and the Jacobi-predictor-corrector algorithm for the tempered fractional ordinary differential equation. By adjusting the parameter of the proposed algorithm, any desired convergence order can be obtained and the computational cost linearly increases with time. And the effectiveness of the algorithm is numerically confirmed.

math.CA↗

arXiv2014

High order schemes for the tempered fractional diffusion equations

Lévy flight models whose jumps have infinite moments are mathematically used to describe the superdiffusion in complex systems. Exponentially tempering the Levy measure of Lévy flights leads to the tempered stable Lévy processes which combine both the $α$-stable and Gaussian trends; and the very large jumps are unlikely and all their moments exist. The probability density functions of the tempered stable Lévy processes solve the tempered fractional diffusion equation. This paper focuses on designing the high order difference schemes for the tempered fractional diffusion equation on bounded domain. The high order difference approximations, called the tempered and weighted and shifted Grünwald difference (tempered-WSGD) operators, in space are obtained by using the properties of the tempered fractional calculus and weighting and shifting their first order Grünwald type difference approximations. And the Crank-Nicolson discretization is used in the time direction. The stability and convergence of the presented numerical schemes are established; and the numerical experiments are performed to confirm the theoretical results and testify the effectiveness of the schemes.

physics.comp-ph↗