arXiv subjects

Yu Zhu

Publications and source records attributed to Yu Zhu.

At least 145 records · Page 8Linked to original sources

arXiv2020

A short-range metastable defect in the double layer ice

Although the phase of water has extensively investigated whether there exists a defect distorting only locally the structure still under debate. Here we report a localized 5775 defect phase presented in the double layer ice on the Au (111) surface, which is a metastable structure with 5- and 7-membered rings compared with a perfect hexagonal one. Without altering the total number of the hydrogen bonds of the ice, the defect only introduces 0.08 Å molecular displacement and 3.27% interaction energy change outside the defected area. Such defect also exists without Au support but causes a larger lattice relaxation or smaller interaction energy change. The excessively high barrier as well as the low quantum tunneling and thermodynamic probabilities hinder the formation of the defect by post-grown isomerization from the perfect to the defected structure. This finding indicates that the defected ice is stable, and the defect can be formed during the ice growth stage.

cond-mat.mtrl-sci↗

arXiv2020

Unidirectional Oriented Water Wire in Short Nanotube

The orientation of water molecules is the key factor for the fast transport of water in small nanotubes. It has been accepted that the bidirectional water burst in short nanotubes can be transformed into unidirectional transport when the orientation of water molecules is maintained in long nanotubes under the external field. In this work, based on molecular dynamics simulations and first-principles calculations, we showed without external field, it only needs 21 water molecules to maintain the unidirectional single file water intrinsically in carbon nanotube at seconds. Detailed analysis indicates that the surprising result comes from the step by step process for the flip of water chain, which is different with the perceived concerted mechanism. Considering the thickness of cell membrane (normally 5-10 nm) is larger than the length threshold of the unidirectional water wire, this study suggests it may not need the external field to maintain the unidirectional flow in the water channel at the macroscopic timescale.

physics.comp-ph↗

arXiv2020

Channel Estimation for Intelligent Reflecting Surface-Assisted Millimeter Wave MIMO Systems

Intelligent reflecting surfaces (IRSs) are regarded as promising enablers for future millimeter wave (mmWave) wireless communication, due to their ability to create favorable line-of-sight (LoS) propagation environments. In this paper, we investigate channel estimation in downlink IRS-assisted mmWave multiple-input multiple-output (MIMO) systems. By leveraging the sparsity of mmWave channels, we formulate the channel estimation problem as a fixed-rank constrained non-convex optimization problem. To tackle the non-convexity, an efficient algorithm is proposed by capitalizing on alternating minimization and manifold optimization (MO), which yields a locally optimal solution. Simulation results show that the proposed MO-based estimation (MO-EST) algorithm significantly outperforms two benchmark schemes and demonstrate the robustness of the MO-EST algorithm with respect to imperfect knowledge of the sparsity level of the channels in practical implementations.

cs.IT↗

arXiv2020

Network Inference from Consensus Dynamics with Unknown Parameters

We explore the problem of inferring the graph Laplacian of a weighted, undirected network from snapshots of a single or multiple discrete-time consensus dynamics, subject to parameter uncertainty, taking place on the network. Specifically, we consider three problems in which we assume different levels of knowledge about the diffusion rates, observation times, and the input signal power of the dynamics. To solve these underdetermined problems, we propose a set of algorithms that leverage the spectral properties of the observed data and tools from convex optimization. Furthermore, we provide theoretical performance guarantees associated with these algorithms. We complement our theoretical work with numerical experiments, that demonstrate how our proposed methods outperform current state-of-the-art algorithms and showcase their effectiveness in recovering both synthetic and real-world networks.

cs.SI↗

arXiv2019

High yield production of ultrathin fibroid semiconducting nanowire of Ta$_2$Pd$_3$Se$_8$

Immediately after the demonstration of the high-quality electronic properties in various two dimensional (2D) van der Waals (vdW) crystals fabricated with mechanical exfoliation, many methods have been reported to explore and control large scale fabrications. Comparing with recent advancements in fabricating 2D atomic layered crystals, large scale production of one dimensional (1D) nanowires with thickness approaching molecular or atomic level still remains stagnant. Here, we demonstrate the high yield production of a 1D vdW material, semiconducting Ta2Pd3Se8 nanowires, by means of liquid-phase exfoliation. The thinnest nanowire we have readily achieved is around 1 nm, corresponding to a bundle of one or two molecular ribbons. Transmission electron microscopy and transport measurements reveal the as-fabricated Ta2Pd3Se8 nanowires exhibit unexpected high crystallinity and chemical stability. Our low frequency Raman spectroscopy reveals clear evidence of the existing of weak inter-ribbon bindings. The fabricated nanowire transistors exhibit high switching performance and promising applications for photodetectors.

physics.app-ph↗

arXiv2019

Estimating Network Processes via Blind Identification of Multiple Graph Filters

This paper studies the problem of jointly estimating multiple network processes driven by a common unknown input, thus effectively generalizing the classical blind multi-channel identification problem to graphs. More precisely, we model network processes as graph filters and consider the observation of multiple graph signals corresponding to outputs of different filters defined on a common graph and driven by the same input. Assuming that the underlying graph is known and the input is unknown, our goal is to recover the specifications of the network processes, namely the coefficients of the graph filters, only relying on the observation of the outputs. Being generated by the same input, these outputs are intimately related and we leverage this relationship for our estimation purposes. Two settings are considered, one where the orders of the filters are known and another one where they are not known. For the former setting, we present a least-squares approach and provide conditions for recovery. For the latter scenario, we propose a sparse recovery algorithm with theoretical performance guarantees. Numerical experiments illustrate the effectiveness of the proposed algorithms, the influence of different parameter settings on the estimation performance, and the validity of our theoretical claims.

eess.SP↗

arXiv2019

SESF-Fuse: An Unsupervised Deep Model for Multi-Focus Image Fusion

In this work, we propose a novel unsupervised deep learning model to address multi-focus image fusion problem. First, we train an encoder-decoder network in unsupervised manner to acquire deep feature of input images. And then we utilize these features and spatial frequency to measure activity level and decision map. Finally, we apply some consistency verification methods to adjust the decision map and draw out fused result. The key point behind of proposed method is that only the objects within the depth-of-field (DOF) have sharp appearance in the photograph while other objects are likely to be blurred. In contrast to previous works, our method analyzes sharp appearance in deep feature instead of original image. Experimental results demonstrate that the proposed method achieves the state-of-art fusion performance compared to existing 16 fusion methods in objective and subjective assessment.

cs.CV↗

arXiv2019

Query-based Interactive Recommendation by Meta-Path and Adapted Attention-GRU

Recently, interactive recommender systems are becoming increasingly popular. The insight is that, with the interaction between users and the system, (1) users can actively intervene the recommendation results rather than passively receive them, and (2) the system learns more about users so as to provide better recommendation. We focus on the single-round interaction, i.e. the system asks the user a question (Step 1), and exploits his feedback to generate better recommendation (Step 2). A novel query-based interactive recommender system is proposed in this paper, where \textbf{personalized questions are accurately generated from millions of automatically constructed questions} in Step 1, and \textbf{the recommendation is ensured to be closely-related to users' feedback} in Step 2. We achieve this by transforming Step 1 into a query recommendation task and Step 2 into a retrieval task. The former task is our key challenge. We firstly propose a model based on Meta-Path to efficiently retrieve hundreds of query candidates from the large query pool. Then an adapted Attention-GRU model is developed to effectively rank these candidates for recommendation. Offline and online experiments on Taobao, a large-scale e-commerce platform in China, verify the effectiveness of our interactive system. The system has already gone into production in the homepage of Taobao App since Nov. 11, 2018 (see https://v.qq.com/x/page/s0833tkp1uo.html on how it works online). Our code and dataset are public in https://github.com/zyody/QueryQR.

cs.IR↗

arXiv2019

Beamforming Design for Large-Scale Antenna Arrays Using Deep Learning

Beamforming (BF) design for large-scale antenna arrays with limited radio frequency chains and the phase-shifter-based analog BF architecture, has been recognized as a key issue in millimeter wave communication systems. It becomes more challenging with imperfect channel state information (CSI). In this letter, we propose a deep learning based BF design approach and develop a BF neural network (BFNN) which can be trained to learn how to optimize the beamformer for maximizing the spectral efficiency with hardware limitation and imperfect CSI. Simulation results show that the proposed BFNN achieves significant performance improvement and strong robustness to imperfect CSI over the conventional BF algorithms.

cs.IT↗

arXiv2019

Exact-K Recommendation via Maximal Clique Optimization

This paper targets to a novel but practical recommendation problem named exact-K recommendation. It is different from traditional top-K recommendation, as it focuses more on (constrained) combinatorial optimization which will optimize to recommend a whole set of K items called card, rather than ranking optimization which assumes that "better" items should be put into top positions. Thus we take the first step to give a formal problem definition, and innovatively reduce it to Maximum Clique Optimization based on graph. To tackle this specific combinatorial optimization problem which is NP-hard, we propose Graph Attention Networks (GAttN) with a Multi-head Self-attention encoder and a decoder with attention mechanism. It can end-to-end learn the joint distribution of the K items and generate an optimal card rather than rank individual items by prediction scores. Then we propose Reinforcement Learning from Demonstrations (RLfD) which combines the advantages in behavior cloning and reinforcement learning, making it sufficient- and-efficient to train the model. Extensive experiments on three datasets demonstrate the effectiveness of our proposed GAttN with RLfD method, it outperforms several strong baselines with a relative improvement of 7.7% and 4.7% on average in Precision and Hit Ratio respectively, and achieves state-of-the-art (SOTA) performance for the exact-K recommendation problem.

cs.IR↗

arXiv2019

Deep Session Interest Network for Click-Through Rate Prediction

Click-Through Rate (CTR) prediction plays an important role in many industrial applications, such as online advertising and recommender systems. How to capture users' dynamic and evolving interests from their behavior sequences remains a continuous research topic in the CTR prediction. However, most existing studies overlook the intrinsic structure of the sequences: the sequences are composed of sessions, where sessions are user behaviors separated by their occurring time. We observe that user behaviors are highly homogeneous in each session, and heterogeneous cross sessions. Based on this observation, we propose a novel CTR model named Deep Session Interest Network (DSIN) that leverages users' multiple historical sessions in their behavior sequences. We first use self-attention mechanism with bias encoding to extract users' interests in each session. Then we apply Bi-LSTM to model how users' interests evolve and interact among sessions. Finally, we employ the local activation unit to adaptively learn the influences of various session interests on the target item. Experiments are conducted on both advertising and production recommender datasets and DSIN outperforms other state-of-the-art models on both datasets.

cs.IR↗

arXiv2019

Deep Cascade Multi-task Learning for Slot Filling in Online Shopping Assistant

Slot filling is a critical task in natural language understanding (NLU) for dialog systems. State-of-the-art approaches treat it as a sequence labeling problem and adopt such models as BiLSTM-CRF. While these models work relatively well on standard benchmark datasets, they face challenges in the context of E-commerce where the slot labels are more informative and carry richer expressions. In this work, inspired by the unique structure of E-commerce knowledge base, we propose a novel multi-task model with cascade and residual connections, which jointly learns segment tagging, named entity tagging and slot filling. Experiments show the effectiveness of the proposed cascade and residual structures. Our model has a 14.6% advantage in F1 score over the strong baseline methods on a new Chinese E-commerce shopping assistant dataset, while achieving competitive accuracies on a standard dataset. Furthermore, online test deployed on such dominant E-commerce platform shows 130% improvement on accuracy of understanding user utterances. Our model has already gone into production in the E-commerce platform.

cs.CL↗

arXiv2019

Hybrid MMSE Beamforming for Multiuser Millimeter Wave Communication Systems

This letter investigates the hybrid analog and digital beamforming (HBF) design for multiuser millimeter wave (mmWave) communication systems based on the minimum mean square error (MMSE) criterion. Using the alternating minimization method, the hybrid precoder of the base station (BS) and the hybrid combiners of the users are alternatively optimized. It is shown that both the optimized digital precoder of the BS and the digital combiners of the users have closed-form expressions, and their corresponding analog ones can be efficiently obtained via generalized eigen-decomposition. Simulation results show that the proposed MMSE HBF scheme has fast convergence and performs close to the fully digital beamforming.

cs.IT↗

arXiv2019

Hybrid beamforming for single carrier mmWave MIMO systems

Hybrid analog and digital beamforming (HBF) has been recognized as an attractive technique offering a tradeoff between hardware implementation limitation and system performance for future broadband millimeter wave (mmWave) communications. In contrast to most current works focusing on the HBF design for orthogonal frequency division multiplexing based mmWave systems, this paper investigates the HBF design for single carrier (SC) systems due to the advantage of low peak-to-average power ratio in transmissions. By applying the alternating minimization method, we propose an efficient HBF scheme based on the minimum mean square error criterion. Simulation results show that the proposed scheme outperforms the conventional HBF scheme for SC systems.

eess.SP↗

arXiv2019

Hybrid Beamforming for Millimeter Wave Systems Using the MMSE Criterion

Hybrid analog and digital beamforming (HBF) has recently emerged as an attractive technique for millimeter-wave (mmWave) communication systems. It well balances the demand for sufficient beamforming gains to overcome the propagation loss and the desire to reduce the hardware cost and power consumption. In this paper, the mean square error (MSE) is chosen as the performance metric to characterize the transmission reliability. Using the minimum sum-MSE criterion, we investigate the HBF design for broadband mmWave transmissions. To overcome the difficulty of solving the multi-variable design problem, the alternating minimization method is adopted to optimize the hybrid transmit and receive beamformers alternatively. Specifically, a manifold optimization based HBF algorithm is firstly proposed, which directly handles the constant modulus constraint of the analog component. Its convergence is then proved. To reduce the computational complexity, we then propose a low-complexity general eigenvalue decomposition based HBF algorithm in the narrowband scenario and three algorithms via the eigenvalue decomposition and orthogonal matching pursuit methods in the broadband scenario. A particular innovation in our proposed alternating minimization algorithms is a carefully designed initialization method, which leads to faster convergence. {Furthermore, we extend the sum-MSE based design to that with weighted sum-MSE, which is then connected to the spectral efficiency based design.} Simulation results show that the proposed HBF algorithms achieve significant performance improvement over existing ones, and perform close to full-digital beamforming.

cs.IT↗

arXiv2018

Electronic quantum effect on hydrogen bond geometry in water dimer

During compression of a water dimer calculated with high-precision first-principles methods, the trends of H-bond and O-H bond lengths show quantum effect of the electronic structure. We found that the H-bond length keeps decreasing, while the O-H bond length increases up to the stable point and decreases beyond it when the water dimer is further compressed. The remarkable properties are different from those observed in most previous researches which can be understood and extrapolated through classical simulation. The observations can be explained by the decrease in orbital overlap and change in the exchange repulsion interaction between water monomers. The dominant interaction between water monomers changes from electrostatic interaction to exchange repulsion at the turning point of the O-H bond length when the O...O distance is decreased. These findings highlight the quantum effect on the hydrogen bond in extreme conditions and play an important role in the recognition of the hydrogen bond structure and mechanism.

physics.chem-ph↗

arXiv2018

A Brand-level Ranking System with the Customized Attention-GRU Model

In e-commerce websites like Taobao, brand is playing a more important role in influencing users' decision of click/purchase, partly because users are now attaching more importance to the quality of products and brand is an indicator of quality. However, existing ranking systems are not specifically designed to satisfy this kind of demand. Some design tricks may partially alleviate this problem, but still cannot provide satisfactory results or may create additional interaction cost. In this paper, we design the first brand-level ranking system to address this problem. The key challenge of this system is how to sufficiently exploit users' rich behavior in e-commerce websites to rank the brands. In our solution, we firstly conduct the feature engineering specifically tailored for the personalized brand ranking problem and then rank the brands by an adapted Attention-GRU model containing three important modifications. Note that our proposed modifications can also apply to many other machine learning models on various tasks. We conduct a series of experiments to evaluate the effectiveness of our proposed ranking model and test the response to the brand-level ranking system from real users on a large-scale e-commerce platform, i.e. Taobao.

cs.IR↗

arXiv2018

Addressing the Item Cold-start Problem by Attribute-driven Active Learning

In recommender systems, cold-start issues are situations where no previous events, e.g. ratings, are known for certain users or items. In this paper, we focus on the item cold-start problem. Both content information (e.g. item attributes) and initial user ratings are valuable for seizing users' preferences on a new item. However, previous methods for the item cold-start problem either 1) incorporate content information into collaborative filtering to perform hybrid recommendation, or 2) actively select users to rate the new item without considering content information and then do collaborative filtering. In this paper, we propose a novel recommendation scheme for the item cold-start problem by leverage both active learning and items' attribute information. Specifically, we design useful user selection criteria based on items' attributes and users' rating history, and combine the criteria in an optimization framework for selecting users. By exploiting the feedback ratings, users' previous ratings and items' attributes, we then generate accurate rating predictions for the other unselected users. Experimental results on two real-world datasets show the superiority of our proposed method over traditional methods.

cs.IR↗