arXiv subjects

Shan Zhang

Publications and source records attributed to Shan Zhang.

At least 73 records · Page 4Linked to original sources

arXiv2022

Non-unital tracially approximated ${\rm C^*}$-algebras

In this paper, we introduce a class of non-unital tracial approximation ${\rm C^*}$-algebras. Consider the class of ${\rm C^*}$-algebras which are tracially $\mathcal{Z}$-absorbing (in the sense of Amint, Golestani, Jamali, Phillips's simple tracially $\mathcal{Z}$-absorbing or Castillejos, Li, Szabvo's tracial $\mathcal{Z}$-stability). Then $A$ is tracially $\mathcal{Z}$-absorbing for any simple ${\rm C^*}$-algebra $A$ in the corresponding class of non-unital tracial approximation ${\rm C^*}$-algebras.

math.OA↗

arXiv2022

Observation of three superconducting transitions in the pressurized CDW-bearing compound TaTe2

Transition metal dichalcogenides host a wide variety of lattice and electronic structures, as well as corresponding exotic physical properties, especially under certain tuning conditions. Here, we are the first to report the observation of pressure-induced three superconducting transitions in TaTe2, a charge density wave (CDW) - bearing layered transition-metal dichalcogenide that is metallic but not superconducting at ambient pressure. We find that its CDW state can be easily suppressed upon increasing pressure up to ~ 1 GPa. A superconducting state then emerges from the suppressed CDW state and persists to the pressure about 7 GPa. Unexpectedly, another superconducting state appears at ~ 11 GPa within the same monoclinic (M) structure of its ambient-pressure one. Upon further compression to 21 GPa, a third superconducting state with higher Tc appears from a high-pressure (HP) phase. Our experimental results suggest that the pressure-induced three superconducting transitions in TaTe2 are respectively driven by the suppression of the CDW state, the change of the angle in the M phase and the transition of M-to-HP phase. These results demonstrate not only the versatile nature of this correlated electron system, but also the first experimental example that shows the pressure-induced evolution from a CDW state to three superconducting states driven by different mechanisms.

cond-mat.supr-con↗

arXiv2022

CATrans: Context and Affinity Transformer for Few-Shot Segmentation

Few-shot segmentation (FSS) aims to segment novel categories given scarce annotated support images. The crux of FSS is how to aggregate dense correlations between support and query images for query segmentation while being robust to the large variations in appearance and context. To this end, previous Transformer-based methods explore global consensus either on context similarity or affinity map between support-query pairs. In this work, we effectively integrate the context and affinity information via the proposed novel Context and Affinity Transformer (CATrans) in a hierarchical architecture. Specifically, the Relation-guided Context Transformer (RCT) propagates context information from support to query images conditioned on more informative support features. Based on the observation that a huge feature distinction between support and query pairs brings barriers for context knowledge transfer, the Relation-guided Affinity Transformer (RAT) measures attention-aware affinity as auxiliary information for FSS, in which the self-affinity is responsible for more reliable cross-affinity. We conduct experiments to demonstrate the effectiveness of the proposed model, outperforming the state-of-the-art methods.

cs.CV↗

arXiv2022

Distributed Estimation in Large Scale Wireless Sensor Networks via a Two Step Group-based Approach

We consider the problem of collaborative distributed estimation in a large scale sensor network with statistically dependent sensor observations. In collaborative setup, the aim is to maximize the overall estimation performance by modeling the underlying statistical dependence and efficiently utilizing the deployed sensors. To achieve greater sensor transmission and estimation efficiency, we propose a two step group-based collaborative distributed estimation scheme, where in the first step, sensors form dependence driven groups such that sensors in the same group are highly dependent, while sensors from different groups are independent, and perform a copula-based maximum a posteriori probability (MAP) estimation via intragroup collaboration. In the second step, the estimates generated in the first step are shared via inter-group collaboration to reach an average consensus. A merge based K-medoid dependence driven grouping algorithm is proposed. Moreover, we further propose a group-based sensor selection scheme using mutual information prior to the estimation. The aim is to select sensors with maximum relevance and minimum redundancy regarding the parameter of interest under certain pre-specified energy constraint. Also, the proposed group-based sensor selection scheme is shown to be equivalent to the global/non-group based selection scheme with high probability, but computationally more efficient. Numerical experiments are conducted to demonstrate the effectiveness of our approach.

eess.SP↗

arXiv2022

Large Andreev bound state zero bias peaks in a weakly dissipative environment

We study Andreev bound states in hybrid InAs-Al nanowire devices. The energy of these states can be tuned to zero by gate voltage or magnetic field, revealing large zero bias peaks (ZBPs) near 2e^2/h in tunneling conductance. Probing these large ZBPs using a weakly dissipative lead reveals non-Fermi liquid temperature (T) dependence due to environmental Coulomb blockade (ECB), an interaction effect from the lead acting on the nanowire junction. By increasing T, these large ZBPs either show a height increase or a transition from split peaks to a ZBP, both deviate significantly from non-dissipative devices where a Fermi-liquid T dependence is revealed. Our result demonstrates the competing effect between ECB and thermal broadening on Andreev bound states.

cond-mat.mes-hall↗

arXiv2022

Change Detection from Synthetic Aperture Radar Images via Graph-Based Knowledge Supplement Network

Synthetic aperture radar (SAR) image change detection is a vital yet challenging task in the field of remote sensing image analysis. Most previous works adopt a self-supervised method which uses pseudo-labeled samples to guide subsequent training and testing. However, deep networks commonly require many high-quality samples for parameter optimization. The noise in pseudo-labels inevitably affects the final change detection performance. To solve the problem, we propose a Graph-based Knowledge Supplement Network (GKSNet). To be more specific, we extract discriminative information from the existing labeled dataset as additional knowledge, to suppress the adverse effects of noisy samples to some extent. Afterwards, we design a graph transfer module to distill contextual information attentively from the labeled dataset to the target dataset, which bridges feature correlation between datasets. To validate the proposed method, we conducted extensive experiments on four SAR datasets, which demonstrated the superiority of the proposed GKSNet as compared to several state-of-the-art baselines. Our codes are available at https://github.com/summitgao/SAR_CD_GKSNet.

cs.CV↗

arXiv2022

Visual Behaviors and Mobile Information Acquisition

It is common for people to engage in information acquisition tasks while on the move. To understand how users' visual behaviors influence microlearning, a form of mobile information acquisition, we conducted a shadowing study with 8 participants and identified three common visual behaviors: 'glance', 'inspect', and 'drift'. We found that 'drift' best supports mobile information acquisition. We also identified four user-related factors that can influence the utilization of mobile information acquisition opportunities: situational awareness, switching costs, ongoing cognitive processes, and awareness of opportunities. We further examined how these user-related factors interplay with device-related factors through a technology probe with 20 participants using mobile phones and optical head-mounted displays (OHMDs). Results indicate that different device platforms significantly influence how mobile information acquisition opportunities are used: OHMDs can better support mobile information acquisition when visual attention is fragmented. OHMDs facilitate shorter visual switch-times between the task and surroundings, which reduces the mental barrier of task transition. Mobile phones, on the other hand, provide a more focused experience in more stable surroundings. Based on these findings, we discuss trade-offs and design implications for supporting information acquisition tasks on the move.

cs.HC↗

arXiv2021

Room-temperature on-chip generation of heralded single photons with switchable orbital angular momentum

In quantum optics, orbital angular momentum (OAM) is very promising to achieve high-dimensional quantum states due to the nature of infinite and discrete eigenvalue, which is quantized by the topological charge of l. Here, a heralded single-photon source with switchable OAM modes is proposed and demonstrated on silicon chip. At room-temperature, the heralded single photons with 11 OAM modes (l=2~6, -6~-1) have been successfully generated and switched through thermo-optical effect. We believe that such an integrated quantum source with multiple OAM modes and operating at room-temperature would provide a practical platform for high-dimensional quantum information processing. Moreover, our proposed architecture can also be extended to other material systems to further improve the performance of OAM quantum source.

quant-ph↗

arXiv2021

Suppressing Andreev bound state zero bias peaks using a strongly dissipative lead

Hybrid semiconductor-superconductor nanowires are predicted to host Majorana zero modes, manifested as zero-bias peaks (ZBPs) in tunneling conductance. ZBPs alone, however, are not sufficient evidence due to the ubiquitous presence of Andreev bound states in the same system. Here, we implement a strongly resistive normal lead in our InAs-Al nanowire devices and show that most of the expected ZBPs, corresponding to zero-energy Andreev bound states, can be suppressed, a phenomenon known as environmental Coulomb blockade. Our result is the first experimental demonstration of this dissipative interaction effect on Andreev bound states and can serve as a possible filter to narrow down ZBP phase diagram in future Majorana searches.

cond-mat.mes-hall↗

arXiv2020

In Situ Epitaxy of Pure Phase Ultra-Thin InAs-Al Nanowires for Quantum Devices

Hybrid semiconductor-superconductor InAs-Al nanowires with uniform and defect-free crystal interfaces are one of the most promising candidates used in the quest for Majorana zero modes (MZMs). However, InAs nanowires often exhibit a high density of randomly distributed twin defects and stacking faults, which result in an uncontrolled and non-uniform InAs-Al interface. Furthermore, this type of disorder can create potential inhomogeneity in the wire, destroy the topological gap, and form trivial sub-gap states mimicking MZM in transport experiments. Further study shows that reducing the InAs nanowire diameter from growth can significantly suppress the formation of these defects and stacking faults. Here, we demonstrate the in situ growth of ultra-thin InAs nanowires with epitaxial Al film by molecular-beam epitaxy. Our InAs diameter (~ 30 nm) is only one-third of the diameters (~ 100 nm) commonly used in literatures. The ultra-thin InAs nanowires are pure phase crystals for various different growth directions, suggesting a low level of disorder. Transmission electron microscopy confirms an atomically sharp and uniform interface between the Al shell and the InAs wire. Quantum transport study on these devices resolves a hard induced superconducting gap and $2e^-$ periodic Coulomb blockade at zero magnetic field, a necessary step for future MZM experiments. A large zero bias conductance peak with a peak height reaching 80% of $2e^2/h$ is observed.

cond-mat.mtrl-sci↗

arXiv2020

Low-Latency and Fresh Content Provision in Information-Centric Vehicular Networks

In this paper, the content service provision of information-centric vehicular networks (ICVNs) is investigated from the aspect of mobile edge caching, considering the dynamic driving-related context information. To provide up-to-date information with low latency, two schemes are designed for cache update and content delivery at the roadside units (RSUs). The roadside unit centric (RSUC) scheme decouples cache update and content delivery through bandwidth splitting, where the cached content items are updated regularly in a round-robin manner. The request adaptive (ReA) scheme updates the cached content items upon user requests with certain probabilities. The performance of both proposed schemes are analyzed, whereby the average age of information (AoI) and service latency are derived in closed forms. Surprisingly, the AoI-latency trade-off does not always exist, and frequent cache update can degrade both performances. Thus, the RSUC and ReA schemes are further optimized to balance the AoI and latency. Extensive simulations are conducted on SUMO and OMNeT++ simulators, and the results show that the proposed schemes can reduce service latency by up to 80\% while guaranteeing content freshness in heavily loaded ICVNs.

cs.NI↗

arXiv2020

Soft mode parameter as an indicator for the activation energy spectra in metallic glass

The activation energy (E_A) spectra of potential energy landscape (PEL) provides a convenient perspective for interpreting complex phenomena in amorphous materials; however, the link between the E_A spectra and other physical properties in metallic glasses is still mysterious. By systematically probing the E_A spectra for numerous metallic glass samples with distinct local geometric ordering, which correspond to broad processing histories, it is found that the shear modulus of the samples are strongly correlated with the arithmetic mean of the E_A spectra rather than with the local geometrical ordering. Furthermore, we studied the correlation of the obtained E_A spectra and various well-established physical parameters. The outcome of our research clearly demonstrates that the soft mode parameter Ψ and the E_A spectrum are correlated; therefore, it could be a good indicator of metallic glass properties and sheds important light on the structure-property relationship in metallic glass through the medium of PEL.

cond-mat.mtrl-sci↗

arXiv2020

AoI-Delay Tradeoff in Mobile Edge Caching with Freshness-Aware Content Refreshing

Mobile edge caching can effectively reduce service delay but may introduce information staleness, calling for timely content refreshing. However, content refreshing consumes additional transmission resources and may degrade the delay performance of mobile systems. In this work, we propose a freshness-aware refreshing scheme to balance the service delay and content freshness measured by Age of Information (AoI). Specifically, the cached content items will be refreshed to the up-to-date version upon user requests if the AoI exceeds a certain threshold (named as refreshing window). The average AoI and service delay are derived in closed forms approximately, which reveals an AoI-delay tradeoff relationship with respect to the refreshing window. In addition, the refreshing window is optimized to minimize the average delay while meeting the AoI requirements, and the results indicate to set a smaller refreshing window for the popular content items. Extensive simulations are conducted on the OMNeT++ platform to validate the analytical results. The results indicate that the proposed scheme can restrain frequent refreshing as the request arrival rate increases, whereby the average delay can be reduced by around 80% while maintaining the AoI below one second in heavily-loaded scenarios.

cs.NI↗

arXiv2020

Cooperative Service Caching and Workload Scheduling in Mobile Edge Computing

Mobile edge computing is beneficial to reduce service response time and core network traffic by pushing cloud functionalities to network edge. Equipped with storage and computation capacities, edge nodes can cache services of resource-intensive and delay-sensitive mobile applications and process the corresponding computation tasks without outsourcing to central clouds. However, the heterogeneity of edge resource capacities and inconsistence of edge storage and computation capacities make it difficult to jointly fully utilize the storage and computation capacities when there is no cooperation among edge nodes. To address this issue, we consider cooperation among edge nodes and investigate cooperative service caching and workload scheduling in mobile edge computing. This problem can be formulated as a mixed integer nonlinear programming problem, which has non-polynomial computation complexity. To overcome the challenges of subproblem coupling, computation-communication tradeoff, and edge node heterogeneity, we develop an iterative algorithm called ICE. This algorithm is designed based on Gibbs sampling, which has provably near-optimal results, and the idea of water filling, which has polynomial computation complexity. Simulations are conducted and the results demonstrate that our algorithm can jointly reduce the service response time and the outsourcing traffic compared with the benchmark algorithms.

cs.NI↗

arXiv2020

The Design of Dynamic Probabilistic Caching with Time-Varying Content Popularity

In this paper, we design dynamic probabilistic caching for the scenario when the instantaneous content popularity may vary with time while it is possible to predict the average content popularity over a time window. Based on the average content popularity, optimal content caching probabilities can be found, e.g., from solving optimization problems, and existing results in the literature can implement the optimal caching probabilities via static content placement. The objective of this work is to design dynamic probabilistic caching that: i) converge (in distribution) to the optimal content caching probabilities under time-invariant content popularity, and ii) adapt to the time-varying instantaneous content popularity under time-varying content popularity. Achieving the above objective requires a novel design of dynamic content replacement because static caching cannot adapt to varying content popularity while classic dynamic replacement policies, such as LRU, cannot converge to target caching probabilities (as they do not exploit any content popularity information). We model the design of dynamic probabilistic replacement policy as the problem of finding the state transition probability matrix of a Markov chain and propose a method to generate and refine the transition probability matrix. Extensive numerical results are provided to validate the effectiveness of the proposed design.

cs.NI↗

arXiv2019

Hierarchical Soft Slicing to Meet Multi-Dimensional QoS Demand in Cache-Enabled Vehicular Networks

Vehicular networks are expected to support diverse content applications with multi-dimensional quality of service (QoS) requirements, which cannot be realized by the conventional one-fit-all network management method. In this paper, a service-oriented hierarchical soft slicing framework is proposed for the cache-enabled vehicular networks, where each slice supports one service and the resources are logically isolated but opportunistically reused to exploit the multiplexing gain. The performance of the proposed framework is studied in an analytical way considering two typical on-road content services, i.e., the time-critical driving related context information service (CIS) and the bandwidth-consuming infotainment service (IS). Two network slices are constructed to support the CIS and IS, respectively, where the resource is opportunistic reused at both intra- and inter-slice levels. Specifically, the throughput of the IS slice, the content freshness (i.e., age of information) and delay performances of the CIS slice are analyzed theoretically, whereby the multiplexing gain of soft slicing is obtained. Extensive simulations are conducted on the OMNeT++ and MATLAB platforms to validate the analytical results. Numerical results show that the proposed soft slicing method can enhance the IS throughput by 30% while guaranteeing the same level of CIS content freshness and service delay.

cs.NI↗

arXiv2019

Fusion of Deep Neural Networks for Activity Recognition: A Regular Vine Copula Based Approach

In this paper, we propose regular vine copula based fusion of multiple deep neural network classifiers for the problem of multi-sensor based human activity recognition. We take the cross-modal dependence into account by employing regular vine copulas that are extremely flexible and powerful graphical models to characterize complex dependence among multiple modalities. Multiple deep neural networks are used to extract high-level features from multi-sensing modalities, with each deep neural network processing the data collected from a single sensor. The extracted high-level features are then combined using a regular vine copula model. Numerical experiments are conducted to demonstrate the effectiveness of our approach.

eess.SP↗

arXiv2019

Distributed Sequential Hypothesis Testing with Dependent Sensor Observations

In this paper, we consider the problem of distributed sequential detection using wireless sensor networks (WSNs) in the presence of imperfect communication channels between the sensors and the fusion center (FC). We assume that sensor observations are spatially dependent. We propose a copula-based distributed sequential detection scheme that characterizes the spatial dependence. Specifically, each local sensor collects observations regarding the phenomenon of interest and forwards the information obtained to the FC over noisy channels. The FC fuses the received messages using a copula-based sequential test. Moreover, we show the asymptotic optimality of the proposed copula-based sequential test. Numerical experiments are conducted to demonstrate the effectiveness of our approach.

eess.SP↗