arXiv subjects

Xin Wang

Publications and source records attributed to Xin Wang.

At least 1,495 records · Page 83Linked to original sources

arXiv2020

Cooling-Aware Resource Allocation and Load Management for Mobile Edge Computing Systems

Driven by explosive computation demands of Internet of Things (IoT), mobile edge computing (MEC) provides a promising technique to enhance the computation capability for mobile users. In this paper, we propose a joint resource allocation and load management mechanism in an MEC system with wireless power transfer (WPT), by jointly optimizing the transmit power for WPT, the local/edge computing load, the offloading time, and the frequencies of the central processing units (CPUs) at the access point (AP) and the users. To achieve an energy-efficient and sustainable WPT-MEC system, we minimize the total energy consumption of the AP, while meeting computation latency requirements. Cooling energy which is non-negligible, is taken into account in minimizing the energy consumption of the MEC system. By rigorously orchestrating the state-of-the-art optimization techniques, we design an iterative algorithm and obtain the optimal solution in a semi-closed form. Based on the solution, interesting properties and insights are summarized. Extensive numerical tests show that the proposed algorithm can save up to 90.4% the energy of existing benchmarks.

eess.SP↗

arXiv2020

VATEX: A Large-Scale, High-Quality Multilingual Dataset for Video-and-Language Research

We present a new large-scale multilingual video description dataset, VATEX, which contains over 41,250 videos and 825,000 captions in both English and Chinese. Among the captions, there are over 206,000 English-Chinese parallel translation pairs. Compared to the widely-used MSR-VTT dataset, VATEX is multilingual, larger, linguistically complex, and more diverse in terms of both video and natural language descriptions. We also introduce two tasks for video-and-language research based on VATEX: (1) Multilingual Video Captioning, aimed at describing a video in various languages with a compact unified captioning model, and (2) Video-guided Machine Translation, to translate a source language description into the target language using the video information as additional spatiotemporal context. Extensive experiments on the VATEX dataset show that, first, the unified multilingual model can not only produce both English and Chinese descriptions for a video more efficiently, but also offer improved performance over the monolingual models. Furthermore, we demonstrate that the spatiotemporal video context can be effectively utilized to align source and target languages and thus assist machine translation. In the end, we discuss the potentials of using VATEX for other video-and-language research.

cs.CV↗

arXiv2020

Nearly nondestructive thermometry of labeled cold atoms and application to isotropic laser cooling

We have designed and implemented a straightforward method to deterministically measure the temperature of the selected segment of a cold atom ensemble, and we have also developed an upgrade in the form of nondestructive thermometry. The essence is to monitor the thermal expansion of the targeted cold atoms after labeling them through manipulating the internal states, and the nondestructive property relies upon the nearly lossless detection via driving a cycling transition. For cold atoms subject to isotropic laser cooling, this method has the unique capability of addressing only the atoms on the optical detection axis within the enclosure, which is exactly the part we care about in major applications such as atomic clock or quantum sensing. Furthermore, our results confirm the sub-Doppler cooling features in isotropic laser cooling, and we have investigated the relevant cooling properties. Meanwhile, we have applied the recently developed optical configuration with the cooling laser injection in the form of hollow beams, which helps to enhance the cooling performance and accumulate more cold atoms in the central regions.

physics.atom-ph↗

arXiv2020

Ferroelastic-switching-driven colossal shear strain and piezoelectricity in a hybrid ferroelectric

Materials that can produce large controllable strains are widely used in shape memory devices, actuators and sensors. Great efforts have been made to improve the strain outputs of various material systems. Among them, ferroelastic transitions underpin giant reversible strains in electrically-driven ferro/piezoelectrics and thermally- or magneticallydriven shape memory alloys. However, large-strain ferroelastic switching in conventional ferroelectrics is very challenging while magnetic and thermal controls are not desirable for applications. Here, we demonstrate an unprecedentedly large shear strain up to 21.5 % in a hybrid ferroelectric, C6H5N(CH3)3CdCl3. The strain response is about two orders of magnitude higher than those of top-performing conventional ferroelectric polymers and oxides. It is achieved via inorganic bond switching and facilitated by the structural confinement of the large organic moieties, which prevents the undesired 180-degree polarization switching. Furthermore, Br substitution can effectively soften the bonds and result in giant shear piezoelectric coefficient (d35 ~ 4800 pm/V) in Br-rich end of the solid solution, C6H5N(CH3)3CdBr3xCl3(1-x). The superior electromechanical properties of the compounds promise their potential in lightweight and high energy density devices, and the strategy described here should inspire the development of next-generation piezoelectrics and electroactive materials based on hybrid ferroelectrics.

cond-mat.mtrl-sci↗

arXiv2020

Cross-Channel Intragroup Sparsity Neural Network

Modern deep neural networks rely on overparameterization to achieve state-of-the-art generalization. But overparameterized models are computationally expensive. Network pruning is often employed to obtain less demanding models for deployment. Fine-grained pruning removes individual weights in parameter tensors and can achieve a high model compression ratio with little accuracy degradation. However, it introduces irregularity into the computing dataflow and often does not yield improved model inference efficiency in practice. Coarse-grained model pruning, while realizing satisfactory inference speedup through removal of network weights in groups, e.g. an entire filter, often lead to significant accuracy degradation. This work introduces the cross-channel intragroup (CCI) sparsity structure, which can prevent the inference inefficiency of fine-grained pruning while maintaining outstanding model performance. We then present a novel training algorithm designed to perform well under the constraint imposed by the CCI-Sparsity. Through a series of comparative experiments we show that our proposed CCI-Sparsity structure and the corresponding pruning algorithm outperform prior art in inference efficiency by a substantial margin given suited hardware acceleration in the future.

cs.LG↗

arXiv2020

Scattering medium: randomly packed pinhole cameras

When light travels through scattering media, speckles (spatially random distribution of fluctuated intensities) are formed due to the interference of light travelling along different optical paths, preventing the perception of structure, absolute location and dimension of a target within or on the other side of the medium. Currently, the prevailing techniques such as wavefront shaping, optical phase conjugation, scattering matrix measurement, and speckle autocorrelation imaging can only picture the target structure in the absence of prior information. Here we show that a scattering medium can be conceptualized as an assembly of randomly packed pinhole cameras, and the corresponding speckle pattern is a superposition of randomly shifted pinhole images. This provides a new perspective to bridge target, scattering medium, and speckle pattern, allowing one to localize and profile a target quantitatively from speckle patterns perceived from the other side of the scattering medium, which is impossible with all existing methods. The method also allows us to interpret some phenomena of diffusive light that are otherwise challenging to understand. For example, why the morphological appearance of speckle patterns changes with the target, why information is difficult to be extracted from thick scattering media, and what determines the capability of seeing through scattering media. In summary, the concept, whilst in its infancy, opens a new door to unveiling scattering media and information extraction from scattering media in real time.

physics.optics↗

arXiv2020

Cosmological constraints from the redshift dependence of the Alcock-Paczynski effect: Possibility of estimateing the non-linear systematics using fast simulations

The tomographic AP method is so far the best method in separating the Alcock-Paczynski (AP) signal from the redshift space distortion (RSD) effects and deriving powerful constraints on cosmological parameters using the $\lesssim40h^{-1}\ \rm Mpc$ clustering region. To guarantee that the method can be easily applied to the future large scale structure (LSS) surveys, we study the possibility of estimating the systematics of the method using fast simulation method. The major contribution of the systematics comes from the non-zero redshift evolution of the RSD effects, which is quantified by $\hatξ_{Δs}(μ,z)$ in our analysis, and estimated using the BigMultidark exact N-body simulation and approximate COLA simulation samples. We find about 5\%/10\% evolution when comparing the $\hatξ_{Δs}(μ,z)$ measured as $z=0.5$/$z=1$ to the measurements at $z=0$. We checked the inaccuracy in the 2pCFs computed using COLA, and find it 5-10 times smaller than the intrinsic systematics of the tomographic AP method, indicating that using COLA to estimate the systematics is good enough. Finally, we test the effect of halo bias, and find $\lesssim$1.5\% change in $\hatξ_{Δs}$ when varying the halo mass within the range of $2\times 10^{12}$ to $10^{14}$ $M_{\odot}$. We will perform more studies to achieve an accurate and efficient estimation of the systematics in redshift range of $z=0-1.5$.

astro-ph.CO↗

arXiv2020

Eigen-GNN: A Graph Structure Preserving Plug-in for GNNs

Graph Neural Networks (GNNs) are emerging machine learning models on graphs. Although sufficiently deep GNNs are shown theoretically capable of fully preserving graph structures, most existing GNN models in practice are shallow and essentially feature-centric. We show empirically and analytically that the existing shallow GNNs cannot preserve graph structures well. To overcome this fundamental challenge, we propose Eigen-GNN, a simple yet effective and general plug-in module to boost GNNs ability in preserving graph structures. Specifically, we integrate the eigenspace of graph structures with GNNs by treating GNNs as a type of dimensionality reduction and expanding the initial dimensionality reduction bases. Without needing to increase depths, Eigen-GNN possesses more flexibilities in handling both feature-driven and structure-driven tasks since the initial bases contain both node features and graph structures. We present extensive experimental results to demonstrate the effectiveness of Eigen-GNN for tasks including node classification, link prediction, and graph isomorphism tests.

cs.LG↗

arXiv2020

Modeling of Rakugo Speech and Its Limitations: Toward Speech Synthesis That Entertains Audiences

We have been investigating rakugo speech synthesis as a challenging example of speech synthesis that entertains audiences. Rakugo is a traditional Japanese form of verbal entertainment similar to a combination of one-person stand-up comedy and comic storytelling and is popular even today. In rakugo, a performer plays multiple characters, and conversations or dialogues between the characters make the story progress. To investigate how close the quality of synthesized rakugo speech can approach that of professionals' speech, we modeled rakugo speech using Tacotron 2, a state-of-the-art speech synthesis system that can produce speech that sounds as natural as human speech albeit under limited conditions, and an enhanced version of it with self-attention to better consider long-term dependencies. We also used global style tokens and manually labeled context features to enrich speaking styles. Through a listening test, we measured not only naturalness but also distinguishability of characters, understandability of the content, and the degree of entertainment. Although we found that the speech synthesis models could not yet reach the professional level, the results of the listening test provided interesting insights: 1) we should not focus only on the naturalness of synthesized speech but also the distinguishability of characters and the understandability of the content to further entertain audiences; 2) the fundamental frequency (fo) expressions of synthesized speech are poorer than those of human speech, and more entertaining speech should have richer fo expression. Although there is room for improvement, we believe this is an important stepping stone toward achieving entertaining speech synthesis at the professional level.

eess.AS↗

arXiv2020

More Practical and Adaptive Algorithms for Online Quantum State Learning

Online quantum state learning is a recently proposed problem by Aaronson et al. (2018), where the learner sequentially predicts $n$-qubit quantum states based on given measurements on states and noisy outcomes. In the previous work, the algorithms are worst-case optimal in general but fail in achieving tighter bounds in certain simpler or more practical cases. In this paper, we develop algorithms to advance the online learning of quantum states. First, we show that Regularized Follow-the-Leader (RFTL) method with Tallis-2 entropy can achieve an $O(\sqrt{MT})$ total loss with perfect hindsight on the first $T$ measurements with maximum rank $M$. This regret bound depends only on the maximum rank $M$ of measurements rather than the number of qubits, which takes advantage of low-rank measurements. Second, we propose a parameter-free algorithm based on a classical adjusting learning rate schedule that can achieve a regret depending on the loss of best states in hindsight, which takes advantage of low noisy outcomes. Besides these more adaptive bounds, we also show that our RFTL with Tallis-2 entropy algorithm can be implemented efficiently on near-term quantum computing devices, which is not achievable in previous works.

quant-ph↗

arXiv2020

Entangling Nuclear Spins by Dissipation in a Solid-state System

Entanglement is a fascinating feature of quantum mechanics and a key ingredient in most quantum information processing tasks. Yet the generation of entanglement is usually hampered by undesired dissipation owing to the inevitable coupling of a system with its environment. Here, we report an experiment on how to entangle two $^{13}$C nuclear spins via engineered dissipation in a nitrogen-vacancy system. We utilize the electron spin as an ancilla, and combine unitary processes together with optical pumping of the ancilla to implement the engineered dissipation and deterministically produce an entangled state of the two nuclear spins, independent of their initial states. Our experiment demonstrates the power of engineered dissipation as a tool for generation of multi-qubit entanglement in solid-state systems.

quant-ph↗

arXiv2020

On Lattice Packings and Coverings of Asymmetric Limited-Magnitude Balls

We construct integer error-correcting codes and covering codes for the limited-magnitude error channel with more than one error. The codes are lattices that pack or cover the space with the appropriate error ball. Some of the constructions attain an asymptotic packing/covering density that is constant. The results are obtained via various methods, including the use of codes in the Hamming metric, modular $B_t$-sequences, $2$-fold Sidon sets, and sets avoiding arithmetic progression.

cs.IT↗

arXiv2020

Design Choices for X-vector Based Speaker Anonymization

The recently proposed x-vector based anonymization scheme converts any input voice into that of a random pseudo-speaker. In this paper, we present a flexible pseudo-speaker selection technique as a baseline for the first VoicePrivacy Challenge. We explore several design choices for the distance metric between speakers, the region of x-vector space where the pseudo-speaker is picked, and gender selection. To assess the strength of anonymization achieved, we consider attackers using an x-vector based speaker verification system who may use original or anonymized speech for enrollment, depending on their knowledge of the anonymization scheme. The Equal Error Rate (EER) achieved by the attackers and the decoding Word Error Rate (WER) over anonymized data are reported as the measures of privacy and utility. Experiments are performed using datasets derived from LibriSpeech to find the optimal combination of design choices in terms of privacy and utility.

eess.AS↗

arXiv2020

Reverberation Modeling for Source-Filter-based Neural Vocoder

This paper presents a reverberation module for source-filter-based neural vocoders that improves the performance of reverberant effect modeling. This module uses the output waveform of neural vocoders as an input and produces a reverberant waveform by convolving the input with a room impulse response (RIR). We propose two approaches to parameterizing and estimating the RIR. The first approach assumes a global time-invariant (GTI) RIR and directly learns the values of the RIR on a training dataset. The second approach assumes an utterance-level time-variant (UTV) RIR, which is invariant within one utterance but varies across utterances, and uses another neural network to predict the RIR values. We add the proposed reverberation module to the phase spectrum predictor (PSP) of a HiNet vocoder and jointly train the model. Experimental results demonstrate that the proposed module was helpful for modeling the reverberation effect and improving the perceived quality of generated reverberant speech. The UTV-RIR was shown to be more robust than the GTI-RIR to unknown reverberation conditions and achieved a perceptually better reverberation effect.

cs.SD↗

arXiv2020

Self-Supervised Deep Visual Odometry with Online Adaptation

Self-supervised VO methods have shown great success in jointly estimating camera pose and depth from videos. However, like most data-driven methods, existing VO networks suffer from a notable decrease in performance when confronted with scenes different from the training data, which makes them unsuitable for practical applications. In this paper, we propose an online meta-learning algorithm to enable VO networks to continuously adapt to new environments in a self-supervised manner. The proposed method utilizes convolutional long short-term memory (convLSTM) to aggregate rich spatial-temporal information in the past. The network is able to memorize and learn from its past experience for better estimation and fast adaptation to the current frame. When running VO in the open world, in order to deal with the changing environment, we propose an online feature alignment method by aligning feature distributions at different time. Our VO network is able to seamlessly adapt to different environments. Extensive experiments on unseen outdoor scenes, virtual to real world and outdoor to indoor environments demonstrate that our method consistently outperforms state-of-the-art self-supervised VO baselines considerably.

cs.CV↗

arXiv2020

Post-Heat Treatment Design of High-Strength Low-Alloy Steels Processed by Laser Powder Bed Fusion

In this study, a post-heat treatment design for additively manufactured copper-bearing high-strength low-alloy (HSLA)-100 steel is performed by understanding the process-structure-property relationships. Hot isostatic pressing (HIP) is designed to reduce the porosity from 3% to less than 1% for the HSLA-100 steel processed by laser powder bed fusion (LPBF). Quenching dilatometry is employed to design the HIP parameters with the optimized cooling rate for the maximum amount of martensite transformed after HIP. Afterward, a post-heat treatment step with cyclic re-austenitization is introduced for an effective grain refinement to compensate the coarsened microstructure after HIP. Finally, tempering is optimized through microstructure characterization and microhardness. A two-fold increase in the yield strength of the HSLA with tailored microstructure during post-heat treatment is achieved in comparison with the as-built HSLA.

cond-mat.mtrl-sci↗

arXiv2020

Community detection based on first passage probabilities

Community detection is of fundamental significance for understanding the topology characters and the spreading dynamics on complex networks. While random walk is widely used and is proven effective in many community detection algorithms, there still exists two major defects: (i) the maximal length of random walk is too large to distinguish the clustering information if using the average step of all possible random walks; (ii) the useful community information at all other step lengths are missed if using a pre-assigned maximal length. In this paper, we propose a novel community detection method based on the first passage probabilities (FPPM), equipped with a new similarity measure that incorporates the complete structural information within the maximal step length. Here the diameter of the network is chosen as an appropriate boundary of random walks which is adaptive to different networks. Then we use the hierarchical clustering to group the vertices into communities and further select the best division through the corresponding modularity values. Finally, a post-processing strategy is designed to integrate the unreasonable small communities, which significantly improves the accuracy of community division. Surprisingly, the numerical simulations show that FPPM performs best compared to several classic algorithms on both synthetic benchmarks and real-world networks, which reveals the universality and effectiveness of our method.

physics.soc-ph↗

arXiv2020

An Efficient Index Method for the Optimal Route Query over Multi-Cost Networks

Smart city has been consider the wave of the future and the route recommendation in networks is a fundamental problem in it. Most existing approaches for the shortest route problem consider that there is only one kind of cost in networks. However, there always are several kinds of cost in networks and users prefer to select an optimal route under the global consideration of these kinds of cost. In this paper, we study the problem of finding the optimal route in the multi-cost networks. We prove this problem is NP-hard and the existing index techniques cannot be used to this problem. We propose a novel partition-based index with contour skyline techniques to find the optimal route. We propose a vertex-filtering algorithm to facilitate the query processing. We conduct extensive experiments on six real-life networks and the experimental results show that our method has an improvement in efficiency by an order of magnitude compared to the previous heuristic algorithms.

cs.DB↗