Searcharxiv⌕ Search

arXiv subjects

Jia Shi

Publications and source records attributed to Jia Shi.

At least 37 records · Page 2Linked to original sources
arXiv2023

The regularity of the solutions to the Muskat equation: the degenerate regularity near the turnover points

In this paper, we prove that if a solution to the Muskat problem with different densities and the same viscosity is sufficiently smooth, the solution is analytic in a region that degenerates at the turnover points, provided some additional conditions are satisfied. This paper studies the analyticity of the solution near turnover points, complementing the result in $[$Jia Shi. Regularity of solutions to the Muskat equation, Arch Rational Mech Anal 247, 36 (2023)$]$.

math.AP↗
arXiv2023

Thickness dependence of superconductivity in FeSe films

The films of FeSe on substrates have attracted attention because of their unusually high-temperature (Tc) superconducting properties whose origins continue to be debated. To disentangle the competing effects of the substrate and interlayer and intralayer processes, we present here results of density functional theory (DFT)-based analysis of the electronic structure of unsupported FeSe films consisting of 1 to 5 layers (1L-5L). Furthermore, by solving the Bardeen-Schrieffer-Cooper (BCS) equation with spin-wave exchange attraction derived from the Hubbard model, we find the superconducting critical temperature Tc for 1L-5L and bulk FeSe systems in reasonable agreement with experimental data. Our results point to the importance of correlation effects in superconducting properties of single- and multi-layer FeSe films, independently of the role of substrate.

cond-mat.supr-con↗
arXiv2023

Dark exciton energy splitting in monolayer WSe2: insights from time-dependent density-functional theory

We present here a formalism based on time-dependent density-functional theory (TDDFT) to describe characteristics of both intra- and inter-valley excitons in semiconductors, the latter of which had remained a challenge. Through the usage of an appropriate exchange-correlation kernel (nanoquanta), we trace the energy difference between the intra- and inter-valley dark excitons in monolayer (1L) WSe2 to the domination of the exchange part in the exchange-correlation energies of these states. Furthermore, our calculated transition contribution maps establish the momentum resolved weights of the electron-hole excitations in both bright and dark excitons thereby providing a comprehensive understanding of excitonic properties of 1L WSe2. We find that the states consist of hybridized excitations around the corresponding valleys which leads to brightening of the dark excitons, i.e., significantly decreasing their lifetime which is reflected in the PL spectrum. Using many-body perturbation theory, we calculate the phonon contribution to the energy bandgap and the linewidths of the excited electrons, holes and (bright) exciton to find that as the temperature increases the bandgap significantly decreases, while the linewidths increase. Our work paves for describing the ultrafast charge dynamics of transition metal dichalcogenide within an ab initio framework.

cond-mat.mtrl-sci↗
arXiv2022

Secure Transmission for IRS-Assisted MIMO MmWave Systems

In this paper, we investigate the secure beamforming design in an intelligent reflection surface (IRS) assisted millimeter wave (mmWave) system, where the hybrid beamforming (HB) and the passive beamforming (PB) are employed by the transmitter and the IRS, respectively. To maximize the secrecy capacity, the joint optimization of HB and PB is formulated as a nonconvex problem with constant-modulus constraints. To efficiently solve such a challenging problem, the original problem is decomposed into a PB subproblem and an HB subproblem, then these two subproblems are sequentially solved by proposed algorithms. Simulation results demonstrate the superior performance of proposed approach in comparison with the state-of-the-art works.

eess.SP↗
arXiv2022

Regularity of solutions to the Muskat equation

In this paper, we show that if a solution to the Muskat problem in the case of different densities and the same viscosity is sufficiently smooth, then it must be analytic except at the points where a turnover of the fluids happens.

math.AP↗
arXiv2022

Reconstruct from BEV: A 3D Lane Detection Approach based on Geometry Structure Prior

In this paper, we propose an advanced approach in targeting the problem of monocular 3D lane detection by leveraging geometry structure underneath the process of 2D to 3D lane reconstruction. Inspired by previous methods, we first analyze the geometry heuristic between the 3D lane and its 2D representation on the ground and propose to impose explicit supervision based on the structure prior, which makes it achievable to build inter-lane and intra-lane relationships to facilitate the reconstruction of 3D lanes from local to global. Second, to reduce the structure loss in 2D lane representation, we directly extract BEV lane information from front view images, which tremendously eases the confusion of distant lane features in previous methods. Furthermore, we propose a novel task-specific data augmentation method by synthesizing new training data for both segmentation and reconstruction tasks in our pipeline, to counter the imbalanced data distribution of camera pose and ground slope to improve generalization on unseen data. Our work marks the first attempt to employ the geometry prior information into DNN-based 3D lane detection and makes it achievable for detecting lanes in an extra-long distance, doubling the original detection range. The proposed method can be smoothly adopted by other frameworks without extra costs. Experimental results show that our work outperforms state-of-the-art approaches by 3.8% F-Score on Apollo 3D synthetic dataset at real-time speed of 82 FPS without introducing extra parameters.

cs.CV↗
arXiv2022

Multi-level Domain Adaptation for Lane Detection

We focus on bridging domain discrepancy in lane detection among different scenarios to greatly reduce extra annotation and re-training costs for autonomous driving. Critical factors hinder the performance improvement of cross-domain lane detection that conventional methods only focus on pixel-wise loss while ignoring shape and position priors of lanes. To address the issue, we propose the Multi-level Domain Adaptation (MLDA) framework, a new perspective to handle cross-domain lane detection at three complementary semantic levels of pixel, instance and category. Specifically, at pixel level, we propose to apply cross-class confidence constraints in self-training to tackle the imbalanced confidence distribution of lane and background. At instance level, we go beyond pixels to treat segmented lanes as instances and facilitate discriminative features in target domain with triplet learning, which effectively rebuilds the semantic context of lanes and contributes to alleviating the feature confusion. At category level, we propose an adaptive inter-domain embedding module to utilize the position prior of lanes during adaptation. In two challenging datasets, ie TuSimple and CULane, our approach improves lane detection performance by a large margin with gains of 8.8% on accuracy and 7.4% on F1-score respectively, compared with state-of-the-art domain adaptation algorithms.

cs.CV↗
arXiv2022

Optimal Probabilistic Constellation Shaping for Covert Communications

In this paper, we investigate the optimal probabilistic constellation shaping design for covert communication systems from a practical view. Different from conventional covert communications with equiprobable constellations modulation, we propose nonequiprobable constellations modulation schemes to further enhance the covert rate. Specifically, we derive covert rate expressions for practical discrete constellation inputs for the first time. Then, we study the covert rate maximization problem by jointly optimizing the constellation distribution and power allocation. In particular, an approximate gradient descent method is proposed for obtaining the optimal probabilistic constellation shaping. To strike a balance between the computational complexity and the transmission performance, we further develop a framework that maximizes a lower bound on the achievable rate where the optimal probabilistic constellation shaping problem can be solved efficiently using the Frank-Wolfe method. Extensive numerical results show that the optimized probabilistic constellation shaping strategies provide significant gains in the achievable covert rate over the state-of-the-art schemes.

cs.IT↗
arXiv2022

Physically-Based Editing of Indoor Scene Lighting from a Single Image

We present a method to edit complex indoor lighting from a single image with its predicted depth and light source segmentation masks. This is an extremely challenging problem that requires modeling complex light transport, and disentangling HDR lighting from material and geometry with only a partial LDR observation of the scene. We tackle this problem using two novel components: 1) a holistic scene reconstruction method that estimates scene reflectance and parametric 3D lighting, and 2) a neural rendering framework that re-renders the scene from our predictions. We use physically-based indoor light representations that allow for intuitive editing, and infer both visible and invisible light sources. Our neural rendering framework combines physically-based direct illumination and shadow rendering with deep networks to approximate global illumination. It can capture challenging lighting effects, such as soft shadows, directional lighting, specular materials, and interreflections. Previous single image inverse rendering methods usually entangle scene lighting and geometry and only support applications like object insertion. Instead, by combining parametric 3D lighting estimation with neural scene rendering, we demonstrate the first automatic method to achieve full scene relighting, including light source insertion, removal, and replacement, from a single image. All source code and data will be publicly released.

cs.CV↗
arXiv2022

The CLEAR Benchmark: Continual LEArning on Real-World Imagery

Continual learning (CL) is widely regarded as crucial challenge for lifelong AI. However, existing CL benchmarks, e.g. Permuted-MNIST and Split-CIFAR, make use of artificial temporal variation and do not align with or generalize to the real-world. In this paper, we introduce CLEAR, the first continual image classification benchmark dataset with a natural temporal evolution of visual concepts in the real world that spans a decade (2004-2014). We build CLEAR from existing large-scale image collections (YFCC100M) through a novel and scalable low-cost approach to visio-linguistic dataset curation. Our pipeline makes use of pretrained vision-language models (e.g. CLIP) to interactively build labeled datasets, which are further validated with crowd-sourcing to remove errors and even inappropriate images (hidden in original YFCC100M). The major strength of CLEAR over prior CL benchmarks is the smooth temporal evolution of visual concepts with real-world imagery, including both high-quality labeled data along with abundant unlabeled samples per time period for continual semi-supervised learning. We find that a simple unsupervised pre-training step can already boost state-of-the-art CL algorithms that only utilize fully-supervised data. Our analysis also reveals that mainstream CL evaluation protocols that train and test on iid data artificially inflate performance of CL system. To address this, we propose novel "streaming" protocols for CL that always test on the (near) future. Interestingly, streaming protocols (a) can simplify dataset curation since today's testset can be repurposed for tomorrow's trainset and (b) can produce more generalizable models with more accurate estimates of performance since all labeled data from each time-period is used for both training and testing (unlike classic iid train-test splits).

cs.CV↗
arXiv2021

Existence of non-trivial non-concentrated compactly supported stationary solutions of the 2D Euler equation with finite energy

In this paper, we prove the existence of locally non-radial solutions to the stationary 2D Euler equations with compact support but non-concentrated around one or several points. Our solutions are of patch type, have analytic boundary, finite energy and sign-changing vorticity and are new to the best of our knowledge. The proof relies on a new observation that finite energy, stationary solutions with simply-connected vorticity have compactly supported velocity, and an application of the Nash-Moser iteration procedure.

math.AP↗
arXiv2021

OpenRooms: An End-to-End Open Framework for Photorealistic Indoor Scene Datasets

We propose a novel framework for creating large-scale photorealistic datasets of indoor scenes, with ground truth geometry, material, lighting and semantics. Our goal is to make the dataset creation process widely accessible, transforming scans into photorealistic datasets with high-quality ground truth for appearance, layout, semantic labels, high quality spatially-varying BRDF and complex lighting, including direct, indirect and visibility components. This enables important applications in inverse rendering, scene understanding and robotics. We show that deep networks trained on the proposed dataset achieve competitive performance for shape, material and lighting estimation on real images, enabling photorealistic augmented reality applications, such as object insertion and material editing. We also show our semantic labels may be used for segmentation and multi-task learning. Finally, we demonstrate that our framework may also be integrated with physics engines, to create virtual robotics environments with unique ground truth such as friction coefficients and correspondence to real scenes. The dataset and all the tools to create such datasets will be made publicly available.

cs.CV↗
arXiv2021

A non-perturbative approach to computing seismic normal modes in rotating planets

A Continuous Galerkin method-based approach is presented to compute the seismic normal modes of rotating planets. Special care is taken to separate out the essential spectrum in the presence of a fluid outer core using a polynomial filtering eigensolver. The relevant elastic-gravitational system of equations, including the Coriolis force, is subjected to a mixed finite-element method, while self-gravitation is accounted for with the fast multipole method. Our discretization utilizes fully unstructured tetrahedral meshes for both solid and fluid regions. The relevant eigenvalue problem is solved by a combination of several highly parallel and computationally efficient methods. We validate our three-dimensional results in the non-rotating case using analytical results for constant elastic balls, as well as numerical results for an isotropic Earth model from standard ``radial" algorithms. We also validate the computations in the rotating case, but only in the slowly-rotating regime where perturbation theory applies, because no other independent algorithms are available in the general case. The algorithm and code are used to compute the point spectra of eigenfrequencies in several Earth and Mars models studying the effects of heterogeneity on a large range of scales.

physics.comp-ph↗
arXiv2021

The computation of seismic normal modes with rotation as a quadratic eigenvalue problem

A new approach is presented to compute the seismic normal modes of a fully heterogeneous, rotating planet. Special care is taken to separate out the essential spectrum in the presence of a fluid outer core. The relevant elastic-gravitational system of equations, including the Coriolis force, is subjected to a mixed finite-element method, while self-gravitation is accounted for with the fast multipole method (FMM). To solve the resulting quadratic eigenvalue problem (QEP), the approach utilizes extended Lanczos vectors forming a subspace computed from a non-rotating planet -- with the shape of boundaries of a rotating planet and accounting for the centrifugal potential -- to reduce the dimension of the original problem significantly. The subspace is guaranteed to be contained in the space of functions to which the seismic normal modes belong. The reduced system can further be solved with a standard eigensolver. The computational accuracy is illustrated using all the modes with relative small meshes and also tested against standard perturbation calculations relative to a standard Earth model. The algorithm and code are used to compute the point spectra of eigenfrequencies in several Mars models studying the effects of heterogeneity on a large range of scales.

physics.comp-ph↗
arXiv2021

Covert Beamforming Design for Intelligent Reflecting Surface Assisted IoT Networks

In this paper, we consider covert beamforming design for intelligent reflecting surface (IRS) assisted Internet of Things (IoT) networks, where Alice utilizes IRS to covertly transmit a message to Bob without being recognized by Willie. We investigate the joint beamformer design of Alice and IRS to maximize the covert rate of Bob when the knowledge about Willie's channel state information (WCSI) is perfect and imperfect at Alice, respectively. For the former case, we develop a covert beamformer under the perfect covert constraint by applying semidefinite relaxation. For the later case, the optimal decision threshold of Willie is derived, and we analyze the false alarm and the missed detection probabilities. Furthermore, we utilize the property of Kullback-Leibler divergence to develop the robust beamformer based on a relaxation, S-Lemma and alternate iteration approach. Finally, the numerical experiments evaluate the performance of the proposed covert beamformer design and robust beamformer design.

cs.IT↗
arXiv2021

A note on stability of Eliasson-Kuksin's KAM tori for the nonlinear Schrödinger equation

Eliasson and Kuksin developed a KAM approach to study the persistence of the invariant tori for nonlinear Schrödinger equation on $\mathbb{T}^{d}$. In this note, we improve Eliasson and Kuksin's KAM theorem by using Kolmogorov's iterative scheme and obtain a local normal form for the transformed Hamiltonian. As a consequence, we are able to derive the time $δ^{-1}$ stability of the obtained KAM tori.

math.AP↗
arXiv2021

Multi-Task Representation Learning with Multi-View Graph Convolutional Networks

Link prediction and node classification are two important downstream tasks of network representation learning. Existing methods have achieved acceptable results but they perform these two tasks separately, which requires a lot of duplication of work and ignores the correlations between tasks. Besides, conventional models suffer from the identical treatment of information of multiple views, thus they fail to learn robust representation for downstream tasks. To this end, we tackle link prediction and node classification problems simultaneously via multi-task multi-view learning in this paper. We first explain the feasibility and advantages of multi-task multi-view learning for these two tasks. Then we propose a novel model named as MT-MVGCN to perform link prediction and node classification tasks simultaneously. More specifically, we design a multi-view graph convolutional network to extract abundant information of multiple views in a network, which is shared by different tasks. We further apply two attention mechanisms: view attention mechanism and task attention mechanism to make views and tasks adjust the view fusion process. Moreover, view reconstruction can be introduced as an auxiliary task to boost the performance of the proposed model. Experiments on real-world network datasets demonstrate that our model is efficient yet effective, and outperforms advanced baselines in these two tasks.

cs.SI↗