arXiv subjects

Jian Shi

Publications and source records attributed to Jian Shi.

At least 55 records · Page 3Linked to original sources

arXiv2024

A Survey of Resilient Coordination for Cyber-Physical Systems Against Malicious Attacks

Cyber-physical systems (CPSs) facilitate the integration of physical entities and cyber infrastructures through the utilization of pervasive computational resources and communication units, leading to improved efficiency, automation, and practical viability in both academia and industry. Due to its openness and distributed characteristics, a critical issue prevalent in CPSs is to guarantee resilience in presence of malicious attacks. This paper conducts a comprehensive survey of recent advances on resilient coordination for CPSs. Different from existing survey papers, we focus on the node injection attack and propose a novel taxonomy according to the multi-layered framework of CPS. Furthermore, miscellaneous resilient coordination problems are discussed in this survey. Specifically, some preliminaries and the fundamental problem settings are given at the beginning. Subsequently, based on a multi-layered framework of CPSs, promising results of resilient consensus are classified and reviewed from three perspectives: physical structure, communication mechanism, and network topology. Next, two typical application scenarios, i.e., multi-robot systems and smart grids are exemplified to extend resilient consensus to other coordination tasks. Particularly, we examine resilient containment and resilient distributed optimization problems, both of which demonstrate the applicability of resilient coordination approaches. Finally, potential avenues are highlighted for future research.

eess.SY↗

arXiv2024

Challenges and Opportunities in Searching for Rashba-Dresselhaus Materials for Efficient Spin-Charge Interconversion at Room Temperature

Spintronic logic devices require efficient spin-charge interconversion: converting charge current to spin current and spin current to charge current. In spin-orbit materials that are regarded as the most promising candidate for spintronic logic devices, one mechanism that is responsible for spin-charge interconversion is Edelstein and inverse Edelstein effects based on spin-momentum locking in materials with Rashba-type spin-orbit coupling. Over last decade, there has been rapid progresses for increasing interconversion efficiencies due to the Edelstein effect in a few Rashba-Dresselhaus materials and topological insulators, making Rashba spin-momentum locking a promising technological solution for spin-orbit logic devices. However, despite the rapid progress that leads to high spin-charge interconversion efficiency at cryogenic temperatures, the room-temperature efficiency needed for technological applications is still low. This paper presents our understanding on the challenges and opportunities in searching for Rashba-Dresselhaus materials for efficient spin-charge interconversion at room temperature by focusing on materials properties such as Rashba coefficients, momentum relaxation times, spin-momentum locking relations and electrical conductivities.

cond-mat.mtrl-sci↗

arXiv2024

Emulating Complex Synapses Using Interlinked Proton Conductors

In terms of energy efficiency and computational speed, neuromorphic electronics based on non-volatile memory devices is expected to be one of most promising hardware candidates for future artificial intelligence (AI). However, catastrophic forgetting, networks rapidly overwriting previously learned weights when learning new tasks, remains as a pivotal hurdle in either digital or analog AI chips for unleashing the true power of brain-like computing. To address catastrophic forgetting in the context of online memory storage, a complex synapse model (the Benna-Fusi model) has been proposed recently[1], whose synaptic weight and internal variables evolve following a diffusion dynamics. In this work, by designing a proton transistor with a series of charge-diffusion-controlled storage components, we have experimentally realized the Benna-Fusi artificial complex synapse. The memory consolidation from coupled storage components is revealed by both numerical simulations and experimental observations. Different memory timescales for the complex synapse are engineered by the diffusion length of charge carriers, the capacity and number of coupled storage components. The advantage of the demonstrated complex synapse in both memory capacity and memory consolidation is revealed by neural network simulations of face familiarity detection. Our experimental realization of the complex synapse suggests a promising approach to enhance memory capacity and to enable continual learning.

cs.NE↗

arXiv2023

VoxelKP: A Voxel-based Network Architecture for Human Keypoint Estimation in LiDAR Data

We present \textit{VoxelKP}, a novel fully sparse network architecture tailored for human keypoint estimation in LiDAR data. The key challenge is that objects are distributed sparsely in 3D space, while human keypoint detection requires detailed local information wherever humans are present. We propose four novel ideas in this paper. First, we propose sparse selective kernels to capture multi-scale context. Second, we introduce sparse box-attention to focus on learning spatial correlations between keypoints within each human instance. Third, we incorporate a spatial encoding to leverage absolute 3D coordinates when projecting 3D voxels to a 2D grid encoding a bird's eye view. Finally, we propose hybrid feature learning to combine the processing of per-voxel features with sparse convolution. We evaluate our method on the Waymo dataset and achieve an improvement of $27\%$ on the MPJPE metric compared to the state-of-the-art, \textit{HUM3DIL}, trained on the same data, and $12\%$ against the state-of-the-art, \textit{GC-KPL}, pretrained on a $25\times$ larger dataset. To the best of our knowledge, \textit{VoxelKP} is the first single-staged, fully sparse network that is specifically designed for addressing the challenging task of 3D keypoint estimation from LiDAR data, achieving state-of-the-art performances. Our code is available at \url{https://github.com/shijianjian/VoxelKP}.

cs.CV↗

arXiv2023

Is A 15-minute City within Reach in the United States? An Investigation of Activity-Based Mobility Flows in the 12 Most Populous US Cities

Enhanced efforts in the transportation sector should be implemented to mitigate the adverse effects of CO2 emissions resulting from zoning-based planning paradigms. The innovative concept of the 15-minute city, with a focus on proximity-based planning, holds promise in minimizing unnecessary travel and advancing the progress toward achieving carbon neutrality. However, an important research question that remains insufficiently explored is: to what extent is a 15-minute city concept within reach for US cities? This paper establishes a comprehensive framework to evaluate the 15-minute city concept using SafeGraph Point of Interest (POI) check-in data in the 12 most populous US cities. The results reveal that residents are more likely to rely on cars due to the fact that most of their essential activities are located beyond convenient walking, cycling, and public transit distances. However, there is significant potential for the implementation of the 15-minute city concept, as most residents' current activities can be accommodated within a 15-minute radius by the aforementioned low-emission modes of transportation. Our findings can offer policymakers insight into how far US cities are away from the 15-minute city and the potential CO2 emission reduction they can expect if the concept is successfully implemented.

econ.GN↗

arXiv2023

A Spectral Approach for the Dynamic Bradley-Terry Model

The dynamic ranking, due to its increasing importance in many applications, is becoming crucial, especially with the collection of voluminous time-dependent data. One such application is sports statistics, where dynamic ranking aids in forecasting the performance of competitive teams, drawing on historical and current data. Despite its usefulness, predicting and inferring rankings pose challenges in environments necessitating time-dependent modeling. This paper introduces a spectral ranker called Kernel Rank Centrality, designed to rank items based on pairwise comparisons over time. The ranker operates via kernel smoothing in the Bradley-Terry model, utilizing a Markov chain model. Unlike the maximum likelihood approach, the spectral ranker is nonparametric, demands fewer model assumptions and computations, and allows for real-time ranking. We establish the asymptotic distribution of the ranker by applying an innovative group inverse technique, resulting in a uniform and precise entrywise expansion. This result allows us to devise a new inferential method for predictive inference, previously unavailable in existing approaches. Our numerical examples showcase the ranker's utility in predictive accuracy and constructing an uncertainty measure for prediction, leveraging data from the National Basketball Association (NBA). The results underscore our method's potential compared to the gold standard in sports, the Arpad Elo rating system.

stat.ME↗

arXiv2023

AGAD: Adversarial Generative Anomaly Detection

Anomaly detection suffered from the lack of anomalies due to the diversity of abnormalities and the difficulties of obtaining large-scale anomaly data. Semi-supervised anomaly detection methods are often used to solely leverage normal data to detect abnormalities that deviated from the learnt normality distributions. Meanwhile, given the fact that limited anomaly data can be obtained with a minor cost in practice, some researches also investigated anomaly detection methods under supervised scenarios with limited anomaly data. In order to address the lack of abnormal data for robust anomaly detection, we propose Adversarial Generative Anomaly Detection (AGAD), a self-contrast-based anomaly detection paradigm that learns to detect anomalies by generating \textit{contextual adversarial information} from the massive normal examples. Essentially, our method generates pseudo-anomaly data for both supervised and semi-supervised anomaly detection scenarios. Extensive experiments are carried out on multiple benchmark datasets and real-world datasets, the results show significant improvement in both supervised and semi-supervised scenarios. Importantly, our approach is data-efficient that can boost up the detection accuracy with no more than 5% anomalous training data.

cs.CV↗

arXiv2022

Simulating the Power Electronics-Dominated Grid using Schwarz-Schur Complement based Hybrid Domain Decomposition Algorithm

This paper proposes a novel two-stage hybrid domain decomposition algorithm to speed up the dynamic simulations and the analysis of power systems that can be computationally demanding due to the high penetration of renewables. On the first level of the decomposition, a Schwarz-based strategy is used to decouple the original problem into various subsystems through boundary variable relaxation, while on the second level, each decoupled subsystem is further decomposed into subdomains that are solved independently using the Schur-complement approach. Convergence is checked in both stages to ensure that the parallelized implementation of the subsystems can produce identical results to the original problem. The proposed approach is tested on an IEEE 9 bus system in which one synchronous generator is replaced with a solar PV farm through a grid-forming inverter (GFM) with an admittance control method to evaluate its effectiveness and applicability for large-scale and very-large-scale implementations. Since conventional dual-loop GFMs are not stable when connecting to a stronger grid with a small grid inductance, a virtual inductance method is adopted to increase the equivalent inductance connecting the grid to enhance stability.

eess.SY↗

arXiv2022

Identifying Operation Equilibrium in Integrated Electricity, Natural Gas, and Carbon-Emission Markets

The decarbonization of the power sector plays a pivotal role in economy-wide decarbonization to set the world on track to limit warming to 1.5°C by 2050. Carbon emission markets can play a significant role in this transition by putting a price on carbon and giving electricity producers an incentive to reduce their emissions. In this paper, we study the operational equilibrium of an integrated regional/jurisdictional energy system that comprises an electricity market, a natural gas market, and a carbon emission market. We first propose the novel role of a regional carbon market operator (CMO). Different than the conventional cap-and-trade carbon trading mechanism, the proposed CMO manages carbon allowance trading in a centralized jurisdictional carbon emission market. We then develop the formulation to identify the operational equilibrium of the electricity, natural gas, and carbon emission markets based on their interactions. The proposed equilibrium can be obtained by solving the Karush-Kuhn-Tucker (KKT) conditions of all three operational models simultaneously. Simulation results demonstrate that the proposed approach is more flexible, consistent, and effective in mitigating carbon emissions compared with the cap-and-trade mechanism.

eess.SY↗

arXiv2022

Deep Decarbonization of Multi-Energy Systems: A Carbon-Oriented Framework with Cross Disciplinary Technologies

The retirement of unabated coal power plants, the plummeting cost of renewable energy technologies, along with more aggressive public policies and regulatory reforms, are occurring at an unprecedented speed to decarbonize the power and energy systems towards the 2030 and 2050 climate goals. This article aims to establish a carbon-oriented framework to examine the role carbon emission is playing within a power grid that is rapidly transitioning to an integrated multi-energy system. We divide the carbon flows in the multi-energy systems into three stages: carbon allowances initialization/allocation, exchanging/pricing, and circulation. Then, we discuss how cross-disciplinary technologies, such as game theory, optimization, and machine learning can facilitate the modeling and analysis of the proposed framework.

eess.SY↗

arXiv2022

Semantic decomposition Network with Contrastive and Structural Constraints for Dental Plaque Segmentation

Segmenting dental plaque from images of medical reagent staining provides valuable information for diagnosis and the determination of follow-up treatment plan. However, accurate dental plaque segmentation is a challenging task that requires identifying teeth and dental plaque subjected to semantic-blur regions (i.e., confused boundaries in border regions between teeth and dental plaque) and complex variations of instance shapes, which are not fully addressed by existing methods. Therefore, we propose a semantic decomposition network (SDNet) that introduces two single-task branches to separately address the segmentation of teeth and dental plaque and designs additional constraints to learn category-specific features for each branch, thus facilitating the semantic decomposition and improving the performance of dental plaque segmentation. Specifically, SDNet learns two separate segmentation branches for teeth and dental plaque in a divide-and-conquer manner to decouple the entangled relation between them. Each branch that specifies a category tends to yield accurate segmentation. To help these two branches better focus on category-specific features, two constraint modules are further proposed: 1) contrastive constraint module (CCM) to learn discriminative feature representations by maximizing the distance between different category representations, so as to reduce the negative impact of semantic-blur regions on feature extraction; 2) structural constraint module (SCM) to provide complete structural information for dental plaque of various shapes by the supervision of an boundary-aware geometric constraint. Besides, we construct a large-scale open-source Stained Dental Plaque Segmentation dataset (SDPSeg), which provides high-quality annotations for teeth and dental plaque. Experimental results on SDPSeg datasets show SDNet achieves state-of-the-art performance.

cs.CV↗

arXiv2022

DeepCatra: Learning Flow- and Graph-based Behaviors for Android Malware Detection

As Android malware is growing and evolving, deep learning has been introduced into malware detection, resulting in great effectiveness. Recent work is considering hybrid models and multi-view learning. However, they use only simple features, limiting the accuracy of these approaches in practice. In this paper, we propose DeepCatra, a multi-view learning approach for Android malware detection, whose model consists of a bidirectional LSTM (BiLSTM) and a graph neural network (GNN) as subnets. The two subnets rely on features extracted from statically computed call traces leading to critical APIs derived from public vulnerabilities. For each Android app, DeepCatra first constructs its call graph and computes call traces reaching critical APIs. Then, temporal opcode features used by the BiLSTM subnet are extracted from the call traces, while flow graph features used by the GNN subnet are constructed from all the call traces and inter-component communications. We evaluate the effectiveness of DeepCatra by comparing it with several state-of-the-art detection approaches. Experimental results on over 18,000 real-world apps and prevalent malware show that DeepCatra achieves considerable improvement, e.g., 2.7% to 14.6% on F1-measure, which demonstrates the feasibility of DeepCatra in practice.

cs.CR↗

arXiv2022

Filtering electrons by mode coupling in finite semiconductor superlattices

Electron transmission through semiconductor superlattices is studied with transfer matrix method and resonance theory. The formation of electron band-pass transmission is ascribed to the coupling of different modes in those semiconductor superlattices with the symmetric unit cell. Upon Fabry-Pérot resonance condition, Bloch modes and two other resonant modes are identified to be related to the nature of the superlattice and its unit cell, respectively. The bands related to the unit cell and the superlattice overlap spontaneously in the tunneling region due to the shared wells, and the coupling of perfectly resonances results in the band-pass tunneling. Our findings provide a promising way to study electronic systems with more complicated superlattices or even optical systems with photonic crystals.

cond-mat.mes-hall↗

arXiv2022

TorMentor: Deterministic dynamic-path, data augmentations with fractals

We propose the use of fractals as a means of efficient data augmentation. Specifically, we employ plasma fractals for adapting global image augmentation transformations into continuous local transforms. We formulate the diamond square algorithm as a cascade of simple convolution operations allowing efficient computation of plasma fractals on the GPU. We present the TorMentor image augmentation framework that is totally modular and deterministic across images and point-clouds. All image augmentation operations can be combined through pipelining and random branching to form flow networks of arbitrary width and depth. We demonstrate the efficiency of the proposed approach with experiments on document image segmentation (binarization) with the DIBCO datasets. The proposed approach demonstrates superior performance to traditional image augmentation techniques. Finally, we use extended synthetic binary text images in a self-supervision regiment and outperform the same model when trained with limited data and simple extensions.

cs.CV↗

arXiv2022

Upsampling Autoencoder for Self-Supervised Point Cloud Learning

In computer-aided design (CAD) community, the point cloud data is pervasively applied in reverse engineering, where the point cloud analysis plays an important role. While a large number of supervised learning methods have been proposed to handle the unordered point clouds and demonstrated their remarkable success, their performance and applicability are limited to the costly data annotation. In this work, we propose a novel self-supervised pretraining model for point cloud learning without human annotations, which relies solely on upsampling operation to perform feature learning of point cloud in an effective manner. The key premise of our approach is that upsampling operation encourages the network to capture both high-level semantic information and low-level geometric information of the point cloud, thus the downstream tasks such as classification and segmentation will benefit from the pre-trained model. Specifically, our method first conducts the random subsampling from the input point cloud at a low proportion e.g., 12.5%. Then, we feed them into an encoder-decoder architecture, where an encoder is devised to operate only on the subsampled points, along with a upsampling decoder is adopted to reconstruct the original point cloud based on the learned features. Finally, we design a novel joint loss function which enforces the upsampled points to be similar with the original point cloud and uniformly distributed on the underlying shape surface. By adopting the pre-trained encoder weights as initialisation of models for downstream tasks, we find that our UAE outperforms previous state-of-the-art methods in shape classification, part segmentation and point cloud upsampling tasks. Code will be made publicly available upon acceptance.

cs.CV↗

arXiv2021

Parameterization of nearshore wave breaker index

The performances of phase-averaged parametric nearshore wave transformation models depend significantly on a reliable estimate of the wave breaker index r (the breaker height-to-depth ratio), a free model parameter that essentially controls the amount of breaking energy dissipation. While the previous studies have suggested separate relationships between r and the offshore wave steepness (s0) or the normalized local water depth (kh), the parameterization of r still requires further investigation considering a wider variety of conditions and a sounder physical basis. In this study, we use the field datasets of wave height and the inverse modelling approach to reveal a composite dependence of r on both s0 and kh. Specifically, the results show a positive dependence of r on kh for larger s0, and a negative dependence of r on kh for smaller s0. Based on such composite relationships, a new r formula is proposed, and its performance is verified against the available datasets of wave height in three coasts and 14 laboratory tests. Implementation of this new formula in a parametric wave model leads to the error reduction of wave height prediction by 10~24% (mean = 19%) relative to seven widely used models in literatures. In particular, a remarkably higher model accuracy is obtained under wave conditions with small offshore wave steepness, which is important for studying onshore sediment transport and beach recovery. Two counteractive physical mechanisms for wave nonlinearity effects, namely the breaking intensification mechanism and the breaking resistance mechanism, are suggested to explain the opposite r-kh relationships within different ranges of s0.

physics.ao-ph↗

arXiv2020

Differentiable Data Augmentation with Kornia

In this paper we present a review of the Kornia differentiable data augmentation (DDA) module for both for spatial (2D) and volumetric (3D) tensors. This module leverages differentiable computer vision solutions from Kornia, with an aim of integrating data augmentation (DA) pipelines and strategies to existing PyTorch components (e.g. autograd for differentiability, optim for optimization). In addition, we provide a benchmark comparing different DA frameworks and a short review for a number of approaches that make use of Kornia DDA.

cs.CV↗

arXiv2020

ReCoDe: A Data Reduction and Compression Description for High Throughput Time-Resolved Electron Microscopy

Fast, direct electron detectors have significantly improved the spatio-temporal resolution of electron microscopy movies. Preserving both spatial and temporal resolution in extended observations, however, requires storing prohibitively large amounts of data. Here, we describe an efficient and flexible data reduction and compression scheme (ReCoDe) that retains both spatial and temporal resolution by preserving individual electron events. Running ReCoDe on a workstation we demonstrate on-the-fly reduction and compression of raw data streaming off a detector at 3 GB/s, for hours of uninterrupted data collection. The output was 100-fold smaller than the raw data and saved directly onto network-attached storage drives over a 10 GbE connection. We discuss calibration techniques that support electron detection and counting (e.g. estimate electron backscattering rates, false positive rates, and data compressibility), and novel data analysis methods enabled by ReCoDe (e.g. recalibration of data post acquisition, and accurate estimation of coincidence loss).

physics.ins-det↗