arXiv subjects

Zhen Chen

Publications and source records attributed to Zhen Chen.

At least 217 records · Page 12Linked to original sources

arXiv2020

Experimentally Accessible Quantum Phase Transition in a non-Hermitian Tavis-Cummings Model Engineered with Two Drive Fields

We study the quantum phase transition (QPT) in a non-Hermitian Tavis-Cummings (TC) model of experimentally accessible parameters, which is engineered with two drive fields applied to an ensemble of two-level systems (TLSs) and a cavity, respectively. When the two drive fields satisfy a given parameter-matching condition, the coupled cavity-TLS ensemble system can be described by an effective standard TC Hamiltonian in the rotating frame. In this ideal Hermitian case, the engineered TC model can exhibit the super-radiant QPT with spin conservation at an experimentally accessible critical coupling strength, but the QPT is, however, spoiled by the decoherence. We find that in this non-Hermitian case, the QPT can be recovered by introducing a gain in the cavity to balance the loss of the TLS ensemble. Also, the spin-conservation law is found to be violated due to the decoherence of the system. Our study offers an experimentally realizable approach to implementing QPT in the non-Hermitian TC model.

quant-ph↗

arXiv2020

GCSA Codes with Noise Alignment for Secure Coded Multi-Party Batch Matrix Multiplication

A secure multi-party batch matrix multiplication problem (SMBMM) is considered, where the goal is to allow a master to efficiently compute the pairwise products of two batches of massive matrices, by distributing the computation across S servers. Any X colluding servers gain no information about the input, and the master gains no additional information about the input beyond the product. A solution called Generalized Cross Subspace Alignment codes with Noise Alignment (GCSA-NA) is proposed in this work, based on cross-subspace alignment codes. The state of art solution to SMBMM is a coding scheme called polynomial sharing (PS) that was proposed by Nodehi and Maddah-Ali. GCSA-NA outperforms PS codes in several key aspects - more efficient and secure inter-server communication, lower latency, flexible inter-server network topology, efficient batch processing, and tolerance to stragglers. The idea of noise alignment can also be combined with N-source Cross Subspace Alignment (N-CSA) codes and fast matrix multiplication algorithms like Strassen's construction. Moreover, noise alignment can be applied to symmetric secure private information retrieval to achieve the asymptotic capacity.

cs.IT↗

arXiv2020

Socially-Aware Conference Participant Recommendation with Personality Traits

As a result of the importance of academic collaboration at smart conferences, various researchers have utilized recommender systems to generate effective recommendations for participants. Recent research has shown that the personality traits of users can be used as innovative entities for effective recommendations. Nevertheless, subjective perceptions involving the personality of participants at smart conferences are quite rare and haven't gained much attention. Inspired by the personality and social characteristics of users, we present an algorithm called Socially and Personality Aware Recommendation of Participants (SPARP). Our recommendation methodology hybridizes the computations of similar interpersonal relationships and personality traits among participants. SPARP models the personality and social characteristic profiles of participants at a smart conference. By combining the above recommendation entities, SPARP then recommends participants to each other for effective collaborations. We evaluate SPARP using a relevant dataset. Experimental results confirm that SPARP is reliable and outperforms other state-of-the-art methods.

cs.SI↗

arXiv2020

Overcoming information reduced data and experimentally uncertain parameters in ptychography with regularized optimization

The overdetermination of the mathematical problem underlying ptychography is reduced by a host of experimentally more desirable settings. Furthermore, reconstruction of the sample-induced phase shift is typically limited by uncertainty in the experimental parameters and finite sample thicknesses. Presented is a conjugate gradient descent algorithm, regularized optimization for ptychography (ROP), that recovers the partially known experimental parameters along with the phase shift, improves resolution by incorporating the multislice formalism to treat finite sample thicknesses, and includes regularization in the optimization process, thus achieving reliable results from noisy data with severely reduced and underdetermined information.

eess.SP↗

arXiv2020

Photon-Dressed Bloch-Siegert Shift in an Ultrastrongly Coupled Circuit Quantum Electrodynamical System

A cavity quantum electrodynamical (QED) system beyond the strong-coupling regime is expected to exhibit intriguing quantum phenomena. Here we report a direct measurement of the photon-dressed qubit transition frequencies up to four photons by harnessing the same type of state transitions in an ultrastrongly coupled circuit-QED system realized by inductively coupling a superconducting flux qubit to a coplanar-waveguide resonator. This demonstrates a convincing observation of the photon-dressed Bloch-Siegert shift in the ultrastrongly coupled quantum system. Moreover, our results show that the photon-dressed Bloch-Siegert shift becomes more pronounced as the photon number increases, which is a characteristic of the quantum Rabi model.

quant-ph↗

arXiv2020

Operando Control of Skyrmion Density in a Lorentz Transmission Electron Microscope with Current Pulses

Magnetic skyrmions hold promise for spintronic devices. To explore the dynamical properties of skyrmions in devices, a nanoscale method to image spin textures in response to a stimulus is essential. Here, we apply a technique for operando electrical current pulsing of chiral magnetic devices in a Lorentz transmission electron microscope. In ferromagnetic multilayers with interfacial Dzyaloshinskii-Moriya interaction (DMI), we study the creation and annihilation of skyrmions localized by point-like pinning sites due to defects. Using a combination of experimental and micromagnetic techniques, we establish a thermal contribution for the creation and annihilation of skyrmions in our study. Our work reveals a mechanism for controlling skyrmion density, which enables an examination of skyrmion magnetic field stability as a function of density. We find that high-density skyrmion states are more stable than low-density states or isolated skyrmions resisting annihilation over a magnetic field range that increases monotonically with density.

cond-mat.mes-hall↗

arXiv2020

Data-driven learning of non-autonomous systems

We present a numerical framework for recovering unknown non-autonomous dynamical systems with time-dependent inputs. To circumvent the difficulty presented by the non-autonomous nature of the system, our method transforms the solution state into piecewise integration of the system over a discrete set of time instances. The time-dependent inputs are then locally parameterized by using a proper model, for example, polynomial regression, in the pieces determined by the time instances. This transforms the original system into a piecewise parametric system that is locally time invariant. We then design a deep neural network structure to learn the local models. Once the network model is constructed, it can be iteratively used over time to conduct global system prediction. We provide theoretical analysis of our algorithm and present a number of numerical examples to demonstrate the effectiveness of the method.

eess.SP↗

arXiv2020

Deep learning of parameterized equations with applications to uncertainty quantification

We propose a numerical method for discovering unknown parameterized dynamical systems by using observational data of the state variables. Our method is built upon and extends the recent work of discovering unknown dynamical systems, in particular those using deep neural network (DNN). We propose a DNN structure, largely based upon the residual network (ResNet), to not only learn the unknown form of the governing equation but also take into account the random effect embedded in the system, which is generated by the random parameters. Once the DNN model is successfully constructed, it is able to produce system prediction over longer term and for arbitrary parameter values. For uncertainty quantification, it allows us to conduct uncertainty analysis by evaluating solution statistics over the parameter space.

math.NA↗

arXiv2020

Methods to Recover Unknown Processes in Partial Differential Equations Using Data

We study the problem of identifying unknown processes embedded in time-dependent partial differential equation (PDE) using observational data, with an application to advection-diffusion type PDE. We first conduct theoretical analysis and derive conditions to ensure the solvability of the problem. We then present a set of numerical approaches, including Galerkin type algorithm and collocation type algorithm. Analysis of the algorithms are presented, along with their implementation detail. The Galerkin algorithm is more suitable for practical situations, particularly those with noisy data, as it avoids using derivative/gradient data. Various numerical examples are then presented to demonstrate the performance and properties of the numerical methods.

math.NA↗

arXiv2020

Structural Heterogeneity, Ductility, and Glass Forming Ability of Zr-Based Metallic Glasses

We show the correlation between nanoscale structural heterogeneity and mechanical property and glass forming ability of Zr-based metallic glasses (MGs). Detailed parameters of medium range ordering (MRO) that constitutes the structural heterogeneity, including the type, size, and volume fraction of MRO domains determined using 4-dimensional scanning transmission electron microscopy, directly correlate with the ductility and glass forming ability of Zr-Cu-Co-Al MGs. Mesoscale deformation simulation incorporating the experimentally determined MRO confirms that the diverse types and sizes of MRO can significantly influence the MGs' mechanical behavior.

cond-mat.mtrl-sci↗

arXiv2020

On generalized residue network for deep learning of unknown dynamical systems

We present a general numerical approach for learning unknown dynamical systems using deep neural networks (DNNs). Our method is built upon recent studies that identified the residue network (ResNet) as an effective neural network structure. In this paper, we present a generalized ResNet framework and broadly define residue as the discrepancy between observation data and prediction made by another model, which can be an existing coarse model or reduced-order model. In this case, the generalized ResNet serves as a model correction to the existing model and recovers the unresolved dynamics. When an existing coarse model is not available, we present numerical strategies for fast creation of coarse models, to be used in conjunction with the generalized ResNet. These coarse models are constructed using the same data set and thus do not require additional resources. The generalized ResNet is capable of learning the underlying unknown equations and producing predictions with accuracy higher than the standard ResNet structure. This is demonstrated via several numerical examples, including long-term prediction of a chaotic system.

cs.LG↗

arXiv2020

Complementary Network with Adaptive Receptive Fields for Melanoma Segmentation

Automatic melanoma segmentation in dermoscopic images is essential in computer-aided diagnosis of skin cancer. Existing methods may suffer from the hole and shrink problems with limited segmentation performance. To tackle these issues, we propose a novel complementary network with adaptive receptive filed learning. Instead of regarding the segmentation task independently, we introduce a foreground network to detect melanoma lesions and a background network to mask non-melanoma regions. Moreover, we propose adaptive atrous convolution (AAC) and knowledge aggregation module (KAM) to fill holes and alleviate the shrink problems. AAC explicitly controls the receptive field at multiple scales and KAM convolves shallow feature maps by dilated convolutions with adaptive receptive fields, which are adjusted according to deep feature maps. In addition, a novel mutual loss is proposed to utilize the dependency between the foreground and background networks, thereby enabling the reciprocally influence within these two networks. Consequently, this mutual training strategy enables the semi-supervised learning and improve the boundary-sensitivity. Training with Skin Imaging Collaboration (ISIC) 2018 skin lesion segmentation dataset, our method achieves a dice co-efficient of 86.4% and shows better performance compared with state-of-the-art melanoma segmentation methods.

cs.CV↗

arXiv2019

A dynamic ordering policy for a stochastic inventory problem with cash constraints

This paper investigates a stochastic inventory management problem in which a cash-constrained small retailer periodically purchases a product from suppliers and sells it to a market while facing non-stationary demands. In each period, the retailer's available cash restricts the maximum quantity that can be ordered. There exists a fixed ordering cost for the retailer when purchasing. We partially characterize the optimal ordering policy by showing it has an $\bf s-C$ structure: for each period, when initial inventory is above the $\bf$s threshold, no product should be ordered no matter how much initial cash it has; when initial inventory is not large enough to be a $\bf s$ threshold, it is also better to not order when initial cash is below the threshold $C$. The values of $C$ may be state-dependent and related to each period's initial inventory. A heuristic policy $(s, C(x), S)$ is proposed: when initial inventory $x$ is less than $s$ and initial cash is greater than $C(x)$, order a quantity that brings inventory as close to $S$ as possible; otherwise, do not order. We first determine the values of the controlling parameters $s$, $C(x)$ and $S$ based on the results of stochastic dynamic programming and test their performance via an extensive computational study. The results show that the $(s, C(x), S)$ policy performs well with a maximum optimality gap of less than 1\% and an average gap of approximately 0.01\%. We then develop a simple and time-efficient heuristic method for computing policy $(s, C(x), S)$ by solving a mixed-integer linear programming problem and approximate newsvendor models: the average gap for this heuristic is approximately 2\% on our test bed.

math.OC↗

arXiv2019

Fundamental Limits of the Dew-Harvesting Technology

Dew-harvesting technology radiatively cools a condenser below the dewpoint to achieve condensation of the water vapor from the atmosphere. Due to its passive nature, this technology has attracted a broad interest, in particular in the context of the worldwide drinking-water scarcity. However, the fundamental limit of its performance has not yet been clarified. Moreover, the existing applications have been limited to humid areas. Here, we point out the upper bound of the performance of this technology by carefully considering the spectral directional atmospheric transmittance in a wide range of parameters such as the ambient temperature, the relative humidity, and the convection coefficient. Moreover, we highlight the potential of a condenser consisting of a selective emitter, which is capable of condensing water vapor under significantly more arid conditions as compared with the use of a blackbody emitter. For example, a near-ideal emitter could achieve a dew-harvesting mass flux of 13 gram per square metre per hour even at ambient temperature of 20 degrees Celsius with relative humidity of 40%, whereas the black emitter cannot operate. We provide a numerical design of such a selective emitter, consisting of six layers, optimized for dew-harvesting purposes.

physics.app-ph↗

arXiv2019

Measurements of differential and angle-integrated cross sections for the $^{10}$B($n, α$)$^{7}$Li reaction in the neutron energy range from 1.0 eV to 2.5 MeV

Differential and angle-integrated cross sections for the $^{10}$B($n, α$)$^{7}$Li, $^{10}$B($n, α$$_{0}$)$^{7}$Li and $^{10}$B($n, α$$_{1}$)$^{7}$Li$^{*}$ reactions have been measured at CSNS Back-n white neutron source. Two enriched (90%) $^{10}$B samples 5.0 cm in diameter and ~85.0 $μ$g/cm$^{2}$ in thickness each with an aluminum backing were prepared, and back-to-back mounted at the sample holder. The charged particles were detected using the silicon-detector array of the Light-charged Particle Detector Array (LPDA) system. The neutron energy E$_{n}$ was determined by TOF (time-of-flight) method, and the valid $α$ events were extracted from the E$_{n}$-Amplitude two-dimensional spectrum. With 15 silicon detectors, the differential cross sections of $α$-particles were measured from 19.2° to 160.8°. Fitted with the Legendre polynomial series, the ($n, α$) cross sections were obtained through integration. The absolute cross sections were normalized using the standard cross sections of the $^{10}$B($n, α$)$^{7}$Li reaction in the 0.3 - 0.5 MeV neutron energy region. The measurement neutron energy range for the $^{10}$B($n, α$)$^{7}$Li reaction is 1.0 eV $\le$ En < 2.5 MeV (67 energy points), and for the $^{10}$B($n, α$$_{0}$)$^{7}$Li and $^{10}$B($n, α$$_{1}$)$^{7}$Li$^{*}$ reactions is 1.0 eV $\le$ En < 1.0 MeV (59 energy points). The present results have been analyzed by the resonance reaction mechanism and the level structure of the $^{11}$B compound system, and compared with existing measurements and evaluations.

nucl-ex↗

arXiv2019

Unusual Formation of Point Defect Complexes in the Ultra-wide Band Gap Semiconductor beta-Ga2O3

Understanding the unique properties of ultra-wide band gap semiconductors requires detailed information about the exact nature of point defects and their role in determining the properties. Here, we report the first direct microscopic observation of an unusual formation of point defect complexes within the atomic scale structure of beta-Ga2O3 using high resolution scanning transmission electron microscopy (STEM). Each complex involves one cation interstitial atom paired with two cation vacancies. These divacancy - interstitial complexes correlate directly with structures obtained by density functional theory, which predicts them to be compensating acceptors in beta-Ga2O3. This prediction is confirmed by a comparison between STEM data and deep level optical spectroscopy results, which reveals that these complexes correspond to a deep trap within the band gap, and that the development of the complexes is facilitated by Sn doping through the increase in vacancy concentration. These findings provide new insight on this emerging material's unique response to the incorporation of impurities that can critically influence their properties.

cond-mat.mtrl-sci↗

arXiv2019

The Capacity of $T$-Private Information Retrieval with Private Side Information

We consider the problem of $T$-Private Information Retrieval with private side information (TPIR-PSI). In this problem, $N$ replicated databases store $K$ independent messages, and a user, equipped with a local cache that holds $M$ messages as side information, wishes to retrieve one of the other $K-M$ messages. The desired message index and the side information must remain jointly private even if any $T$ of the $N$ databases collude. We show that the capacity of TPIR-PSI is $\left(1+\frac{T}{N}+\cdots+\left(\frac{T}{N}\right)^{K-M-1}\right)^{-1}$. As a special case obtained by setting $T=1$, this result settles the capacity of PIR-PSI, an open problem previously noted by Kadhe et al. We also consider the problem of symmetric-TPIR with private side information (STPIR-PSI), where the answers from all $N$ databases reveal no information about any other message besides the desired message. We show that the capacity of STPIR-PSI is $1-\frac{T}{N}$ if the databases have access to common randomness (not available to the user) that is independent of the messages, in an amount that is at least $\frac{T}{N-T}$ bits per desired message bit. Otherwise, the capacity of STPIR-PSI is zero.

cs.IT↗

arXiv2019

Half-Space Power Diagrams and Discrete Surface Offsets

We present an efficient, trivially parallelizable algorithm to compute offset surfaces of shapes discretized using a dexel data structure. Our algorithm is based on a two-stage sweeping procedure that is simple to implement and efficient, entirely avoiding volumetric distance field computations typical of existing methods. Our construction is based on properties of half-space power diagrams, where each seed is only visible by a half-space, which were never used before for the computation of surface offsets. The primary application of our method is interactive modeling for digital fabrication. Our technique enables a user to interactively process high-resolution models. It is also useful in a plethora of other geometry processing tasks requiring fast, approximate offsets, such as topology optimization, collision detection, and skeleton extraction. We present experimental timings, comparisons with previous approaches, and provide a reference implementation in the supplemental material.

cs.GR↗