Searcharxiv⌕ Search

arXiv subjects

Jian Chen

Publications and source records attributed to Jian Chen.

At least 271 records · Page 15Linked to original sources
arXiv2021

$LnCu_3(OH)_6Cl_3 (Ln = Gd, Tb, Dy)$: Heavy Lanthanides on Spin-1/2 Kagome Magnets

The spin-1/2 kagome antiferromagnets are key prototype materials for studying frustrated magnetism. Three isostructural kagome antiferromagnets LnCu$_3$(OH)$_6$Cl$_3$ (Ln = Gd, Tb, Dy) have been successfully synthesized by the hydrothermal method. LnCu$_3$(OH)$_6$Cl$_3$ adopts space group $P\overline{3}m1$ and features the layered Cu-kagome lattice with lanthanide Ln$^{3+}$ cations sitting at the center of the hexagons. Although heavy lanthanides (Ln = Gd, Tb, Dy) in LnCu$_3$(OH)$_6$Cl$_3$ provide a large effective magnetic moment and ferromagnetic-like spin correlations compared to light-lanthanides (Nd, Sm, Eu) analogues, Cu-kagome holds an antiferromagnetically ordered state at around 17 K like YCu$_3$(OH)$_6$Cl$_3$.

cond-mat.str-el↗
arXiv2021

Dzyaloshinskii-Moriya anisotropy effect on field-induced magnon condensation in kagome antiferromagnet $α-Cu_3Mg(OH)_6Br_2$

We performed a comprehensive electron spin resonance, magnetization and heat capacity study on the field-induced magnetic phase transitions in the kagome antiferromagnet $α-Cu_3Mg(OH)_6Br_2$. With the successful preparation of single crystals, we mapped out the magnetic phase diagrams under the $c$-axis and $ab$-plane directional magnetic fields $B$. For $B\|c$, the three-dimensional (3D) magnon Bose-Einstein condensation (BEC) is evidenced by the power law scaling of the transition temperature, $T_c\propto (B_c-B)^{2/3}$. For $B\|ab$, the transition from the canted antiferromagetic (CAFM) state to the fully polarized (FP) state is a crossover rather than phase transition, and the characteristic temperature has a significant deviation from the 3D BEC scaling. The different behaviors of the field-induced magnetic transitions for $B\|c$ and $B\|ab$ could result from the Dzyaloshinkii-Moriya (DM) interaction with the DM vector along the $c$-axis, which preserves the $c$-axis directional spin rotation symmetry and breaks the spin rotation symmetry when $B\|ab$. The 3D magnon BEC scaling for $B\|c$ is immune to the off-stoichiometric disorder in our sample $α-Cu_{3.26}Mg_{0.74}(OH)_6Br_2$. Our findings have the potential to shed light on the investigations of the magnetic anisotropy and disorder effects on the field-induced magnon BEC in the quantum antiferromagnet.

cond-mat.str-el↗
arXiv2021

Photonic orbital angular momentum with controllable orientation

Vortices are whirling disturbances commonly found in nature ranging from tremendously small scales in Bose-Einstein condensates to cosmologically colossal scales in spiral galaxies. An optical vortex, generally associated with a spiral phase, can carry orbital angular momentum (OAM). The optical OAM can either be in the longitudinal direction if the spiral phase twists in the spatial domain or in the transverse direction if the phase rotates in the spatiotemporal domain. In this article, we demonstrate the intersection of spatiotemporal vortices and spatial vortices in a wave packet. As a result of this intersection, the wave packet hosts a tilted OAM that provides an additional degree of freedom to the applications that harness the OAM of photons.

physics.optics↗
arXiv2021

Visualization Resources: A Starting Point

Visualization, as a vibrant field for researchers, practitioners, and higher educational institutions, is growing and evolving very rapidly. Tremendous progress has been made since 1987, the year often cited as the beginning of data visualization as a distinct field. As such, the number of visualization resources and the demand for those resources are increasing at a very fast pace. We present a collection of open visualization resources for all those with an interest in interactive data visualization and visual analytics. Because the number of resources is so large, we focus on collections of resources, of which there are already very many ranging from literature collections to collections of practitioner resources. We develop a novel classification of visualization resource collections based on the resource type, e.g. literature-based, web-based, etc. The result is a helpful overview and details-on-demand of many useful resources. The collection offers a valuable jump-start for those seeking out data visualization resources from all backgrounds spanning from beginners such as students to teachers, practitioners, and researchers wishing to create their own advanced or novel visual designs.

cs.HC↗
arXiv2021

Content-Aware Convolutional Neural Networks

Convolutional Neural Networks (CNNs) have achieved great success due to the powerful feature learning ability of convolution layers. Specifically, the standard convolution traverses the input images/features using a sliding window scheme to extract features. However, not all the windows contribute equally to the prediction results of CNNs. In practice, the convolutional operation on some of the windows (e.g., smooth windows that contain very similar pixels) can be very redundant and may introduce noises into the computation. Such redundancy may not only deteriorate the performance but also incur the unnecessary computational cost. Thus, it is important to reduce the computational redundancy of convolution to improve the performance. To this end, we propose a Content-aware Convolution (CAC) that automatically detects the smooth windows and applies a 1x1 convolutional kernel to replace the original large kernel. In this sense, we are able to effectively avoid the redundant computation on similar pixels. By replacing the standard convolution in CNNs with our CAC, the resultant models yield significantly better performance and lower computational cost than the baseline models with the standard convolution. More critically, we are able to dynamically allocate suitable computation resources according to the data smoothness of different images, making it possible for content-aware computation. Extensive experiments on various computer vision tasks demonstrate the superiority of our method over existing methods.

cs.CV↗
arXiv2021

Bivariate Separable-Dimension Glyphs can Improve Visual Analysis of Holistic Features

We introduce the cause of the inefficiency of bivariate glyphs by defining the corresponding error. To recommend efficient and perceptually accurate bivariate-glyph design, we present an empirical study of five bivariate glyphs based on three psychophysics principles: integral-separable dimensions, visual hierarchy, and pre-attentive pop out, to choose one integral pair ($length_y-length_x$), three separable pairs ($length-color$, $length-texture$, $length_y-length_y$), and one redundant pair ($length_y-color/length_x$). Twenty participants performed four tasks requiring: reading numerical values, estimating ratio, comparing two points, and looking for extreme values among a subset of points belonging to the same sub-group. The most surprising result was that $length-texture$ was among the most effective methods, suggesting that local spatial frequency features can lead to global pattern detection that facilitate visual search in complex 3D structure. Our results also reveal the following: $length-color$ bivariate glyphs led to the most accurate answers and the least task execution time, while $length_y-length_x$ (integral) dimensions were among the worst and is not recommended; it achieved high performance only when pop-up color was added.

cs.GR↗
arXiv2021

Document Domain Randomization for Deep Learning Document Layout Extraction

We present document domain randomization (DDR), the first successful transfer of convolutional neural networks (CNNs) trained only on graphically rendered pseudo-paper pages to real-world document segmentation. DDR renders pseudo-document pages by modeling randomized textual and non-textual contents of interest, with user-defined layout and font styles to support joint learning of fine-grained classes. We demonstrate competitive results using our DDR approach to extract nine document classes from the benchmark CS-150 and papers published in two domains, namely annual meetings of Association for Computational Linguistics (ACL) and IEEE Visualization (VIS). We compare DDR to conditions of style mismatch, fewer or more noisy samples that are more easily obtained in the real world. We show that high-fidelity semantic information is not necessary to label semantic classes but style mismatch between train and test can lower model accuracy. Using smaller training samples had a slightly detrimental effect. Finally, network models still achieved high test accuracy when correct labels are diluted towards confusing labels; this behavior hold across several classes.

cs.CV↗
arXiv2021

StackRec: Efficient Training of Very Deep Sequential Recommender Models by Iterative Stacking

Deep learning has brought great progress for the sequential recommendation (SR) tasks. With advanced network architectures, sequential recommender models can be stacked with many hidden layers, e.g., up to 100 layers on real-world recommendation datasets. Training such a deep network is difficult because it can be computationally very expensive and takes much longer time, especially in situations where there are tens of billions of user-item interactions. To deal with such a challenge, we present StackRec, a simple, yet very effective and efficient training framework for deep SR models by iterative layer stacking. Specifically, we first offer an important insight that hidden layers/blocks in a well-trained deep SR model have very similar distributions. Enlightened by this, we propose the stacking operation on the pre-trained layers/blocks to transfer knowledge from a shallower model to a deep model, then we perform iterative stacking so as to yield a much deeper but easier-to-train SR model. We validate the performance of StackRec by instantiating it with four state-of-the-art SR models in three practical scenarios with real-world datasets. Extensive experiments show that StackRec achieves not only comparable performance, but also substantial acceleration in training time, compared to SR models that are trained from scratch. Codes are available at https://github.com/wangjiachun0426/StackRec.

cs.IR↗
arXiv2021

De-Pois: An Attack-Agnostic Defense against Data Poisoning Attacks

Machine learning techniques have been widely applied to various applications. However, they are potentially vulnerable to data poisoning attacks, where sophisticated attackers can disrupt the learning procedure by injecting a fraction of malicious samples into the training dataset. Existing defense techniques against poisoning attacks are largely attack-specific: they are designed for one specific type of attacks but do not work for other types, mainly due to the distinct principles they follow. Yet few general defense strategies have been developed. In this paper, we propose De-Pois, an attack-agnostic defense against poisoning attacks. The key idea of De-Pois is to train a mimic model the purpose of which is to imitate the behavior of the target model trained by clean samples. We take advantage of Generative Adversarial Networks (GANs) to facilitate informative training data augmentation as well as the mimic model construction. By comparing the prediction differences between the mimic model and the target model, De-Pois is thus able to distinguish the poisoned samples from clean ones, without explicit knowledge of any ML algorithms or types of poisoning attacks. We implement four types of poisoning attacks and evaluate De-Pois with five typical defense methods on different realistic datasets. The results demonstrate that De-Pois is effective and efficient for detecting poisoned data against all the four types of poisoning attacks, with both the accuracy and F1-score over 0.9 on average.

cs.CR↗
arXiv2021

Securing NOMA Networks by Exploiting Intelligent Reflecting Surface

This paper investigates the security enhancement of an intelligent reflecting surface (IRS) assisted non-orthogonal multiple access (NOMA) network, where a distributed IRS enabled NOMA transmission framework is proposed to serve users securely in the presence of a passive eavesdropper. Considering that eavesdropper's instantaneous channel state information (CSI) is challenging to acquire in practice, we utilize secrecy outage probability (SOP) as the security metric. A problem of maximizing the minimum secrecy rate among users, subject to the successive interference cancellation (SIC) decoding constraints and SOP constraints, by jointly optimizing transmit beamforming at the BS and phase shifts of IRSs, is formulated. For special case with a single-antenna BS, we derive the exact closed-form SOP expressions and propose a novel ring-penalty based successive convex approximation (SCA) algorithm to design power allocation and phase shifts jointly. While for the more general and challenging case with a multi-antenna BS, we adopt the Bernstein-type inequality to approximate the SOP constraints by a deterministic convex form. To proceed, an efficient alternating optimization (AO) algorithm is developed to solve the considered problem. Numerical results validate the advantages of the proposed algorithms over the baseline schemes. Particularly, two interesting phenomena on distributed IRS deployment are revealed: 1) the secrecy rate peak is achieved only when distributed IRSs share the reflecting elements equally; and 2) the distributed IRS deployment does not always outperform the centralized IRS deployment, due to the tradeoff between the number of IRSs and the reflecting elements equipped at each IRS.

cs.IT↗
arXiv2021

An optics-free computational spectrometer using a broadband and tunable dynamic detector

Optical spectrometers are the central instruments for exploring the interaction between light and matter. The current pursuit of the field is to design a spectrometer without the need for wavelength multiplexing optics to effectively reduce the complexity and physical size of the hardware. Based on computational spectroscopic results and combining a broadband-responsive dynamic detector, we successfully demonstrate an optics-free single-detector spectrometer that maps the tunable quantum efficiency of a superconducting nanowire into an ill-conditioned matrix to build a solvable inverse mathematical equation. Such a spectrometer can realize a broadband spectral responsivity ranging from 660 to 1900 nm. The spectral resolution at the telecom is 6 nm, exceeding the energy resolving capacity of existing infrared single-photon detectors. Meanwhile, benefiting from the optics-free setup, precise time-of-flight measurements can be simultaneously achieved. We have demonstrated a spectral LiDAR with 8 spectral channels. This work provides a concise method for building multifunctional spectrometers and paves the way for applying superconducting nanowire detectors in spectroscopy.

physics.optics↗
arXiv2021

Spin-orbit coupling within tightly focused circularly polarized spatiotemporal vortex wavepacket

Spin-orbital coupling and interaction as intrinsic light fields characteristics have been extensively studied. Previous studies involve the spin angular momentum (SAM) carried by circular polarization and orbital angular momentum (OAM) associated with a spiral phase wavefront within the beam cross section, where both the SAM and OAM are in parallel with the propagation direction. In this work, we study a new type of spin-orbital coupling between the longitudinal SAM and the transverse OAM carried by a spatiotemporal optical vortex (STOV) wavepacket under tight focusing condition. Intricate spatiotemporal phase singularity structures are formed when a circularly polarized STOV wavepacket is tightly focused by a high numerical aperture objective lens. For the transversely polarized components, phase singularity orientation can be significantly tilted away from the transverse direction towards the optical axis due to the coupling between longitudinal SAM and transverse OAM. The connection between the amount of rotation and the temporal width of the wavepacket is revealed. More interestingly, spatiotemporal phase singularity structure with a continuous evolution from longitudinal to transverse orientation through the wavepacket is observed for the longitudinally polarized component. These exotic spin-orbit coupling phenomena are expected to render new effects and functions when they are exploited in light matter interactions.

physics.optics↗
arXiv2021

Learning Defense Transformers for Counterattacking Adversarial Examples

Deep neural networks (DNNs) are vulnerable to adversarial examples with small perturbations. Adversarial defense thus has been an important means which improves the robustness of DNNs by defending against adversarial examples. Existing defense methods focus on some specific types of adversarial examples and may fail to defend well in real-world applications. In practice, we may face many types of attacks where the exact type of adversarial examples in real-world applications can be even unknown. In this paper, motivated by that adversarial examples are more likely to appear near the classification boundary, we study adversarial examples from a new perspective that whether we can defend against adversarial examples by pulling them back to the original clean distribution. We theoretically and empirically verify the existence of defense affine transformations that restore adversarial examples. Relying on this, we learn a defense transformer to counterattack the adversarial examples by parameterizing the affine transformations and exploiting the boundary information of DNNs. Extensive experiments on both toy and real-world datasets demonstrate the effectiveness and generalization of our defense transformer.

cs.LG↗
arXiv2021

Pareto-Frontier-aware Neural Architecture Generation for Diverse Budgets

Designing feasible and effective architectures under diverse computation budgets incurred by different applications/devices is essential for deploying deep models in practice. Existing methods often perform an independent architecture search for each target budget, which is very inefficient yet unnecessary. Moreover, the repeated independent search manner would inevitably ignore the common knowledge among different search processes and hamper the search performance. To address these issues, we seek to train a general architecture generator that automatically produces effective architectures for an arbitrary budget merely via model inference. To this end, we propose a Pareto-Frontier-aware Neural Architecture Generator (NAG) which takes an arbitrary budget as input and produces the Pareto optimal architecture for the target budget. We train NAG by learning the Pareto frontier (i.e., the set of Pareto optimal architectures) over model performance and computational cost (e.g., latency). Extensive experiments on three platforms (i.e., mobile, CPU, and GPU) show the superiority of the proposed method over existing NAS methods.

cs.LG↗
arXiv2021

Calibration of manganin pressure gauge for diamond-anvil cells

Pressure calibration for most diamond-anvil cell (DAC) experiments is mainly based on the ruby scale, which is key to implement this powerful tool for high-pressure study. However, the ruby scale can often hardly be used for programmably-controlled DAC devices, especially the piezoelectric-driving cells, where a continuous pressure calibration is required. In this work, we present an effective pressure gauge for DACs made of manganin metal, based on the four-probe resistivity measurements. Pressure dependence of its resistivity is well established and shows excellent linear relations in the 0 - 30 GPa pressure range with a slope of 23.4 (9) GPa for the first-cycle compression, in contrast to that of multiple-cycle compression and decompression having a nearly identical slope of 33.7 (4) GPa likely due to the strain effect. In addition, such-established manganin scale can be used for continuously monitoring the cell pressure of piezoelectric-driving DACs, and the reliability of this method is also verified by the fixed-point method with a Bi pressure standard. Realization of continuous pressure calibration for programmably-controlled DACs would offer many opportunities for study of dynamics, kinetics, and critical behaviors of pressure-induced phase transitions.

physics.app-ph↗
arXiv2021

Towards Accurate and Compact Architectures via Neural Architecture Transformer

Designing effective architectures is one of the key factors behind the success of deep neural networks. Existing deep architectures are either manually designed or automatically searched by some Neural Architecture Search (NAS) methods. However, even a well-designed/searched architecture may still contain many nonsignificant or redundant modules/operations. Thus, it is necessary to optimize the operations inside an architecture to improve the performance without introducing extra computational cost. To this end, we have proposed a Neural Architecture Transformer (NAT) method which casts the optimization problem into a Markov Decision Process (MDP) and seeks to replace the redundant operations with more efficient operations, such as skip or null connection. Note that NAT only considers a small number of possible transitions and thus comes with a limited search/transition space. As a result, such a small search space may hamper the performance of architecture optimization. To address this issue, we propose a Neural Architecture Transformer++ (NAT++) method which further enlarges the set of candidate transitions to improve the performance of architecture optimization. Specifically, we present a two-level transition rule to obtain valid transitions, i.e., allowing operations to have more efficient types (e.g., convolution->separable convolution) or smaller kernel sizes (e.g., 5x5->3x3). Note that different operations may have different valid transitions. We further propose a Binary-Masked Softmax (BMSoftmax) layer to omit the possible invalid transitions. Extensive experiments on several benchmark datasets show that the transformed architecture significantly outperforms both its original counterpart and the architectures optimized by existing methods.

cs.CV↗
arXiv2021

$L^2$ extension of $\bar\partial$-closed forms on weakly pseudoconvex Kähler manifolds

Combining V. Koziarz's observation about the regularity of some modified section related to the initial extension with J. McNeal--D. Varolin's regularity argument, we generalize two theorems of McNeal--Varolin for the $L^2$ extension of $\bar\partial$-closed high-degree forms on a Stein manifold to the weakly pseudoconvex Kähler case under mixed positivity conditions.

math.CV↗