arXiv subjects

Meng Zhang

Publications and source records attributed to Meng Zhang.

At least 217 records · Page 12Linked to original sources

arXiv2020

Energy recovery operation for continuous-wave X-ray free-electron lasers

A superconducting linear accelerator operating in continuous-wave mode could produce X-ray free electron lasers (XFEL) at megahertz repetition rate, with the capability that delivering wide spectral range coherent radiation to multi end stations. In this Letter, the energy recovery Linac (ERL) mode is proposed to flexibly control the electron beam energy for a continuous-wave superconducting Linac. Theoretical investigations and multi-dimensional numerical simulations are applied to the Linac case of Shanghai high-repetition-rate XFEL and extreme light facility. The results show that, with ERL operation in the last 25 cryo-modules, the strict requirements on RF power system could be significantly relaxed. And if one exhaust the RF power, the maximum electron beam energy can be enhanced from 8.74 GeV to 11.41GeV in ERL mode. The optimization of the ERL operation, the multi-energy electron beam transport and the XFEL performance improvements are presented.

physics.acc-ph↗

arXiv2020

Captioning Images Taken by People Who Are Blind

While an important problem in the vision community is to design algorithms that can automatically caption images, few publicly-available datasets for algorithm development directly address the interests of real users. Observing that people who are blind have relied on (human-based) image captioning services to learn about images they take for nearly a decade, we introduce the first image captioning dataset to represent this real use case. This new dataset, which we call VizWiz-Captions, consists of over 39,000 images originating from people who are blind that are each paired with five captions. We analyze this dataset to (1) characterize the typical captions, (2) characterize the diversity of content found in the images, and (3) compare its content to that found in eight popular vision datasets. We also analyze modern image captioning algorithms to identify what makes this new dataset challenging for the vision community. We publicly-share the dataset with captioning challenge instructions at https://vizwiz.org

cs.CV↗

arXiv2020

Rapid Determination of Antimicrobial Susceptibility by Stimulated Raman Scattering Imaging of D2O Metabolic Incorporation in a Single Bacterium

Rapid antimicrobial susceptibility testing (AST) is urgently needed for treating infections with correct antibiotics and slowing down the emergence of antibiotic-resistant bacteria. Here, we report a phenotypic platform that rapidly produces AST results by femtosecond stimulated Raman scattering imaging of deuterium oxide (D2O) metabolism. Metabolic incorporation of D2O into biomass in a single bacterium is probed in as short as 10 minutes after culture in 70% D2O medium, the fastest among current technologies. Single-cell metabolism inactivation concentration (SC-MIC) is obtained in less than 2.5 hours from colony to results. The SC-MIC results of 37 sets of samples, which include 8 major bacterial species and 14 different antibiotics often encountered in clinic, are validated by standard minimal inhibitory concentration blindly measured via broth microdilution. Towards clinical translation, SRS imaging of D2O metabolic incorporation and SC-MIC determination after 1-h antibiotics treatment and 30-minutes mixture of D2O and antibiotics incubation of bacteria in urine or whole blood is demonstrated.

physics.bio-ph↗

arXiv2020

Chemically peculiar A and F stars with enhanced s-process and iron-peak elements: stellar radiative acceleration at work

We present $\gtrsim 15,000$ metal-rich (${\rm [Fe/H]}>-0.2$dex) A and F stars whose surface abundances deviate strongly from Solar abundance ratios and cannot plausibly reflect their birth material composition. These stars are identified by their high [Ba/Fe] abundance ratios (${\rm [Ba/Fe]}>1.0$dex) in the LAMOST DR5 spectra analyzed by Xiang et al. (2019). They are almost exclusively main sequence and subgiant stars with $T_{\rm eff}\gtrsim6300$K. Their distribution in the Kiel diagram ($T_{\rm eff}$--$\log g$) traces a sharp border at low temperatures along a roughly fixed-mass trajectory (around $1.4M_\odot)$ that corresponds to an upper limit in convective envelope mass fraction of around $10^{-4}$. Most of these stars exhibit distinctly enhanced abundances of iron-peak elements (Cr, Mn, Fe, Ni) but depleted abundances of Mg and Ca. Rotational velocity measurements from GALAH DR2 show that the majority of these stars rotate slower than typical stars in an equivalent temperature range. These characteristics suggest that they are related to the so-called Am/Fm stars. Their abundance patterns are qualitatively consistent with the predictions of stellar evolution models that incorporate radiative acceleration, suggesting they are a consequence of stellar internal evolution particularly involving the competition between gravitational settling and radiative acceleration. These peculiar stars constitute 40% of the whole population of stars with mass above 1.5$M_\odot$, affirming that "peculiar" photospheric abundances due to stellar evolution effects are a ubiquitous phenomenon for these intermediate-mass stars. This large sample of Ba-enhanced chemically peculiar A/F stars with individual element abundances provides the statistics to test more stringently the mechanisms that alter the surface abundances in stars with radiative envelopes.

astro-ph.SR↗

arXiv2020

A Catalog of RV Variable Star Candidates from LAMOST

RV variable stars are important in astrophysics. The Large Sky Area Multi-Object Fiber Spectroscopic Telescope (LAMOST) spectroscopic survey has provided ~ 6.5 million stellar spectra in its Data Release 4 (DR4). During the survey, ~ 4.7 million unique sources were targeted and ~ 1 million stars observed repeatedly. The probabilities of stars being RV variables are estimated by comparing the observed radial velocity variations with the simulated ones. We build a catalog of 80,702 RV variable candidates with probability greater than 0.60 by analyzing the duplicate-observed multi-epoch sources covered by the LAMOST DR4. Simulations and cross-identifications show that the purity of the catalog is higher than 80%. The catalog consists of 77% binary systems and 7% pulsating stars as well as 16% pollution by single stars. 3,138 RV variables are classified through cross-identifications with published results in literatures. By using the 3,138 sources common to both LAMOST and a collection of published RV variable catalogs we are able to analyze LAMOST's RV variable detection rate. The efficiency of the method adopted in this work relies not only on the sampling frequency of observations but also periods and amplitudes of RV variables. With the progress of LAMOST, Gaia and other surveys, more and more RV variables would will be confirmed and classified. This catalog is valuable for other large-scale surveys, especially for RV variable searches. The catalog will be released according to the LAMOST Data Policy via http://dr4.lamost.org.

astro-ph.SR↗

arXiv2020

Learning to Detect Unacceptable Machine Translations for Downstream Tasks

The field of machine translation has progressed tremendously in recent years. Even though the translation quality has improved significantly, current systems are still unable to produce uniformly acceptable machine translations for the variety of possible use cases. In this work, we put machine translation in a cross-lingual pipeline and introduce downstream tasks to define task-specific acceptability of machine translations. This allows us to leverage parallel data to automatically generate acceptability annotations on a large scale, which in turn help to learn acceptability detectors for the downstream tasks. We conduct experiments to demonstrate the effectiveness of our framework for a range of downstream tasks and translation models.

cs.CL↗

arXiv2020

Joint Bilateral Learning for Real-time Universal Photorealistic Style Transfer

Photorealistic style transfer is the task of transferring the artistic style of an image onto a content target, producing a result that is plausibly taken with a camera. Recent approaches, based on deep neural networks, produce impressive results but are either too slow to run at practical resolutions, or still contain objectionable artifacts. We propose a new end-to-end model for photorealistic style transfer that is both fast and inherently generates photorealistic results. The core of our approach is a feed-forward neural network that learns local edge-aware affine transforms that automatically obey the photorealism constraint. When trained on a diverse set of images and a variety of styles, our model can robustly apply style transfer to an arbitrary pair of input images. Compared to the state of the art, our method produces visually superior results and is three orders of magnitude faster, enabling real-time performance at 4K on a mobile phone. We validate our method with ablation and user studies.

cs.CV↗

arXiv2020

QoS-Based Source and Relay Secure Optimization Design with Presence of Channel Uncertainty

In this letter, we study relay-aided networks with presence of single eavesdropper. We provide joint beamforming design of the source and relay that can minimize the overall power consumption while satisfying our predefined quality-of-service (QoS) requirements. Additionally, we investigate the case that the channel between relay and eavesdropper suffers from channel uncertainty. Finally, simulation results are provided to verify the effectiveness of our algorithm.

eess.SP↗

arXiv2020

Robust Beamforming Design for Sum Secrecy Rate Optimization in MU-MISO Networks

This paper studies the beamforming design problem of a multi-user downlink network, assuming imperfect channel state information known to the base station. In this scenario, the base station is equipped with multiple antennas, and each user is wiretapped by a specific eavesdropper where each user or eavesdropper is equipped with one antenna. It is supposed that the base station employs transmit beamforming with a given requirement on sum transmitting power. The objective is to maximize the sum secrecy rate of the network. Due to the uncertainty of the channel, it is difficult to calculate the exact sum secrecy rate of the system. Thus, the maximum of lower bound of sum secrecy rate is considered. The optimization of the lower bound of sum secrecy rate still makes the considered beamforming design problem difficult to handle. To solve this problem, a beamforming design scheme is proposed to transform the original problem into a convex approximation problem, by employing semidefinite relaxation and first-order approximation technique based on Taylor expansion. Besides, with the advantage of low complexity, a zero-forcing based beamforming method is presented in the case that base station is able to nullify the eavesdroppers' rate. When the base station doesn't have the ability, user selection algorithm would be in use. Numerical results show that the former strategy achieves better performance than the latter one, which is mainly due to the ability of optimizing beamforming direction, and both outperform the signal-to-leakage-and-noise ratio based algorithm.

eess.SP↗

arXiv2020

Leakage-Based Robust Beamforming for Multi-Antenna Broadcast System with Per-Antenna Power Constraints and Quantized CDI

In this paper, we investigate the robust beamforming schemes for a multi-user multiple-input-single-output (MU-MISO) system with per-antenna power constraints and quantized channel direction information (CDI) feedback. Our design objective is to maximize the expectation of the weighted sum-rate performance by means of controlling the interference leakage and properly allocating the power among user equipments (UEs).First, we prove the optimality of the non-robust zero-forcing (ZF) beamforming scheme in the sense of generating the minimum amount of average inter-UE interference under quantized CDI. Then we derive closed-form expressions of the cumulative density function (CDF) of the interference leakage power for the non-robust ZF beamforming scheme, based on which we adjust the leakage thresholds and propose two robust beamforming schemes under per-antenna power constraints with an iterative process to update the per-UE power allocations using the geometric programming (GP). Simulation results show the superiority of the proposed robust beamforming schemes compared with the existing schemes in terms of the average weighted sum-rate performance.

eess.SP↗

arXiv2020

Multi-objective Optimal Reactive Power Dispatch of Power Systems by Combining Classification Based Multi-objective Evolutionary Algorithm and Integrated Decision Making

For the purpose of addressing the multi-objective optimal reactive power dispatch (MORPD) problem, a two-step approach is proposed in this paper. First of all, to ensure the economy and security of the power system, the MORPD model aiming to minimize active power loss and voltage deviation is formulated. And then the two-step approach integrating decision-making into optimization is proposed to solve the model. Specifically speaking, the first step aims to seek the Pareto optimal solutions (POSs) with good distribution by using a multi-objective optimization (MOO) algorithm named classification and Pareto domination based multi-objective evolutionary algorithm (CPSMOEA). Furthermore, the reference Pareto-optimal front is generated to validate the Pareto front obtained using CPSMOEA; in the second step, integrated decision-making by combining fuzzy c-means algorithm (FCM) with grey relation projection method (GRP) aims to extract the best compromise solutions which reflect the preferences of decision-makers from the POSs. Based on the test results on the IEEE 30-bus and IEEE 118-bus test systems, it is demonstrated that the proposed approach not only manages to address the MORPD issue but also outperforms other commonly-used MOO algorithms including multi-objective particle swarm optimization (MOPSO), preference-inspired coevolutionary algorithm (PICEAg) and the third evolution step of generalized differential evolution (GDE3).

math.OC↗

arXiv2019

PSDNet and DPDNet: Efficient channel expansion, Depthwise-Pointwise-Depthwise Inverted Bottleneck Block

In many real-time applications, the deployment of deep neural networks is constrained by high computational cost and efficient lightweight neural networks are widely concerned. In this paper, we propose that depthwise convolution (DWC) is used to expand the number of channels in a bottleneck block, which is more efficient than 1 x 1 convolution. The proposed Pointwise-Standard-Depthwise network (PSDNet) based on channel expansion with DWC has fewer number of parameters, less computational cost and higher accuracy than corresponding ResNet on CIFAR datasets. To design more efficient lightweight concolutional neural netwok, Depthwise-Pointwise-Depthwise inverted bottleneck block (DPD block) is proposed and DPDNet is designed by stacking DPD block. Meanwhile, the number of parameters of DPDNet is only about 60% of that of MobileNetV2 for networks with the same number of layers, but can achieve approximated accuracy. Additionally, two hyperparameters of DPDNet can make the trade-off between accuracy and computational cost, which makes DPDNet suitable for diverse tasks. Furthermore, we find the networks with more DWC layers outperform the networks with more 1x1 convolution layers, which indicates that extracting spatial information is more important than combining channel information.

cs.CV↗

arXiv2019

Learning to Predict Explainable Plots for Neural Story Generation

Story generation is an important natural language processing task that aims to generate coherent stories automatically. While the use of neural networks has proven effective in improving story generation, how to learn to generate an explainable high-level plot still remains a major challenge. In this work, we propose a latent variable model for neural story generation. The model treats an outline, which is a natural language sentence explainable to humans, as a latent variable to represent a high-level plot that bridges the input and output. We adopt an external summarization model to guide the latent variable model to learn how to generate outlines from training data. Experiments show that our approach achieves significant improvements over state-of-the-art methods in both automatic and human evaluations.

cs.CL↗

arXiv2019

Deep-seismic-prior-based reconstruction of seismic data using convolutional neural networks

Reconstruction of seismic data with missing traces is a long-standing issue in seismic data processing. In recent years, rank reduction operations are being commonly utilized to overcome this problem, which require the rank of seismic data to be a prior. However, the rank of field data is unknown; usually it requires much time to manually adjust the rank and just obtain an approximated rank. Methods based on deep learning require very large datasets for training; however acquiring large datasets is difficult owing to physical or financial constraints in practice. Therefore, in this work, we developed a novel method based on unsupervised learning using the intrinsic properties of a convolutional neural network known as U-net, without training datasets. Only one undersampled seismic data was needed, and the deep seismic prior of input data could be exploited by the network itself, thus making the reconstruction convenient. Furthermore, this method can handle both irregular and regular seismic data. Synthetic and field data were tested to assess the performance of the proposed algorithm (DSPRecon algorithm); the advantages of using our method were evaluated by comparing it with the singular spectrum analysis (SSA) method for irregular data reconstruction and de-aliased Cadzow method for regular data reconstruction. Experimental results showed that our method provided better reconstruction performance than the SSA or Cadzow methods. The recovered signal-to-noise ratios (SNRs) were 32.68 dB and 19.11 dB for the DSPRecon and SSA algorithms, respectively. Those for the DSPRecon and Cadzow methods were 35.91 dB and 15.32 dB, respectively.

cs.LG↗

arXiv2019

Seismic data interpolation based on U-net with texture loss

Missing traces in acquired seismic data is a common occurrence during the collection of seismic data. Deep neural network (DNN) has shown considerable promise in restoring incomplete seismic data. However, several DNN-based approaches ignore the specific characteristics of seismic data itself, and only focus on reducing the difference between the recovered and the original signals. In this study, a novel Seismic U-net InterpolaTor (SUIT) is proposed to preserve the seismic texture information while reconstructing the missing traces. Aside from minimizing the reconstruction error, SUIT enhances the texture consistency between the recovery and the original completely seismic data, by designing a pre-trained U-Net to extract the texture information. The experiments show that our method outperforms the classic state-of-art methods in terms of robustness.

physics.geo-ph↗

arXiv2019

Wireless Power Transfer with Information Asymmetry: A Public Goods Perspective

Wireless power transfer (WPT) technology enables a cost-effective and sustainable energy supply in wireless networks. However, the broadcast nature of wireless signals makes them non-excludable public goods, which leads to potential free-riders among energy receivers. In this study, we formulate the wireless power provision problem as a public goods provision problem, aiming to maximize the social welfare of a system of an energy transmitter (ET) and all the energy users (EUs), while considering their private information and self-interested behaviors. We propose a two-phase all-or-none scheme involving a low-complexity Power And Taxation (PAT) mechanism, which ensures voluntary participation, truthfulness, budget balance, and social optimality at every Nash equilibrium (NE). We propose a distributed PAT (D-PAT) algorithm to reach an NE, and prove its convergence by connecting the structure of NEs and that of the optimal solution to a related optimization problem. We further extend the analysis to a multi-channel system, which brings a further challenge due to the non-strict concavity of the agents' payoffs. We propose a Multi-Channel PAT (M-PAT) mechanism and a distributed M-PAT (D-MPAT) algorithm to address the challenge. Simulation results show that our design is most beneficial when there are more EUs with more homogeneous channel gains.

cs.NI↗

arXiv2019

Efficient Network Sharing with Asymmetric Constraint Information

Network sharing has become a key feature of various enablers of the next generation network, such as network function virtualization and fog computing architectures. Network utility maximization (NUM) is a general framework for achieving fair, efficient, and cost-effective sharing of constrained network resources. When agents have asymmetric and private information, however, a fundamental economic challenge is how to solve the NUM Problem considering the self-interests of strategic agents. Many previous related works have proposed economic mechanisms that can cope with agents' private utilities. However, the network sharing paradigm introduces the issue of information asymmetries regarding constraints. The related literature largely neglected such an issue; limited closely related studies provided solutions only applicable to specific application scenarios. To tackle these issues, we propose the Decomposable NUM (DeNUM) Mechanism and the Dynamic DeNUM (DyDeNUM) Mechanism, the first mechanisms in the literature for solving NUM Problems considering private utility and constraint information. The key idea of both mechanisms is to decentralize the decision process to agents, who will make resource allocation decisions without the need of revealing private information to others. Under a monitorable influence assumption, the DeNUM Mechanism yields the network-utility maximizing solution at an equilibrium, and achieves other desirable economic properties (such as individual rationality and budget balance). We further establish the connection between the equilibrium structure and the primal-dual solution to a related optimization problem, based on which we prove the convergence of the DeNUM Algorithm to an equilibrium. When the agents' influences are not monitorable, we propose the DyDeNUM Mechanism that yields the network-utility maximizing solution at the cost of the balanced budget.

cs.NI↗

arXiv2019

A Survey of Data Fusion in Smart City Applications

The advancement of various research sectors such as Internet of Things (IoT), Machine Learning, Data Mining, Big Data, and Communication Technology has shed some light in transforming an urban city integrating the aforementioned techniques to a commonly known term - Smart City. With the emergence of smart city, plethora of data sources have been made available for wide variety of applications. The common technique for handling multiple data sources is data fusion, where it improves data output quality or extracts knowledge from the raw data. In order to cater evergrowing highly complicated applications, studies in smart city have to utilize data from various sources and evaluate their performance based on multiple aspects. To this end, we introduce a multi-perspectives classification of the data fusion to evaluate the smart city applications. Moreover, we applied the proposed multi-perspectives classification to evaluate selected applications in each domain of the smart city. We conclude the paper by discussing potential future direction and challenges of data fusion integration.

eess.SP↗