Search

By working out the Bethe sum rule, a boundary condition that takes the form of a linear equality is derived for the fine structure observed in ionization edges present in electron energy-loss spectra. This condition is subsequently used as a constraint in the estimation process of the elemental abundances, demonstrating starkly improved precision and accuracy and reduced sensitivity to the number of model parameters. Furthermore, the fine structure is reliably extracted from the spectra in an automated way, thus providing critical information on the sample's electronic properties that is hard or impossible to obtain otherwise. Since this approach allows dispensing with the need for user-provided input, a potential source of bias is prevented., Comment: 15 pages, 9 figures

The rich information of electron energy-loss spectroscopy (EELS) comes from the complex inelastic scattering process whereby fast electrons transfer energy and momentum to atoms, exciting bound electrons from their ground states to higher unoccupied states. To quantify EELS, the common practice is to compare the cross-sections integrated within an energy window or fit the observed spectrum with theoretical differential cross-sections calculated from a generalized oscillator strength (GOS) database with experimental parameters. The previous Hartree-Fock-based and DFT-based GOS are calculated from Schr\"odinger's solution of atomic orbitals, which does not include the full relativistic effects. Here, we attempt to go beyond the limitations of the Schr\"odinger solution in the GOS tabulation by including the full relativistic effects using the Dirac equation within the local density approximation, which is particularly important for core-shell electrons of heavy elements with strong spin-orbit coupling. This has been done for all elements in the periodic table (up to Z = 118) for all possible excitation edges using modern computing capabilities and parallelization algorithms. The relativistic effects of fast incoming electrons were included to calculate cross-sections that are specific to the acceleration voltage. We make these tabulated GOS available under an open-source license to the benefit of both academic users as well as allowing integration into commercial solutions., Comment: 52 pages, 8 figures

In the 6G era, real-time radio resource monitoring and management are urged to support diverse wireless-empowered applications. This calls for fast and accurate estimation on the distribution of the radio resources, which is usually represented by the spatial signal power strength over the geographical environment, known as a radio map. In this paper, we present a cooperative radio map estimation (CRME) approach enabled by the generative adversarial network (GAN), called as GAN-CRME, which features fast and accurate radio map estimation without the transmitters' information. The radio map is inferred by exploiting the interaction between distributed received signal strength (RSS) measurements at mobile users and the geographical map using a deep neural network estimator, resulting in low data-acquisition cost and computational complexity. Moreover, a GAN-based learning algorithm is proposed to boost the inference capability of the deep neural network estimator by exploiting the power of generative AI. Simulation results showcase that the proposed GAN-CRME is even capable of coarse error-correction when the geographical map information is inaccurate.

The impressive expressive power of deep neural networks (DNNs) underlies their widespread applicability. However, while the theoretical capacity of deep architectures is high, the practical expressive power achieved through successful training often falls short. Building on the insights gained from Neural ODEs, which explore the depth of DNNs as a continuous variable, in this work, we generalize the traditional fully connected DNN through the concept of continuous width. In the Generalized Deep Neural Network (GDNN), the traditional notion of neurons in each layer is replaced by a continuous state function. Using the finite rank parameterization of the weight integral kernel, we establish that GDNN can be obtained by employing the Integral Activation Transform (IAT) as activation layers within the traditional DNN framework. The IAT maps the input vector to a function space using some basis functions, followed by nonlinear activation in the function space, and then extracts information through the integration with another collection of basis functions. A specific variant, IAT-ReLU, featuring the ReLU nonlinearity, serves as a smooth generalization of the scalar ReLU activation. Notably, IAT-ReLU exhibits a continuous activation pattern when continuous basis functions are employed, making it smooth and enhancing the trainability of the DNN. Our numerical experiments demonstrate that IAT-ReLU outperforms regular ReLU in terms of trainability and better smoothness., Comment: 26 pages, 6 figures

This paper tackles the intricate task of jointly estimating state and parameters in data assimilation for stochastic dynamical systems that are affected by noise and observed only partially. While the concept of ``optimal filtering'' serves as the customary approach to estimate the state of the target dynamical system, traditional methods such as Kalman filters and particle filters encounter significant challenges when dealing with high-dimensional and nonlinear problems. When we also consider the scenario where the model parameters are unknown, the problem transforms into a joint state-parameter estimation endeavor. Presently, the leading-edge technique known as the Augmented Ensemble Kalman Filter (AugEnKF) addresses this issue by treating unknown parameters as additional state variables and employing the Ensemble Kalman Filter to estimate the augmented state-parameter vector. Despite its considerable progress, AugEnKF does exhibit certain limitations in terms of accuracy and stability. To address these challenges, we introduce an innovative approach, referred to as the United Filter. This method amalgamates a remarkably stable and efficient ensemble score filter (EnSF) for state estimation with a precise direct filter dedicated to online parameter estimation. Utilizing the EnSF's generative capabilities grounded in diffusion models, the United Filter iteratively fine-tunes both state and parameter estimates within a single temporal data assimilation step. Thanks to the robustness of the EnSF, the proposed method offers a promising solution for enhancing our comprehension and modeling of dynamical systems, as demonstrated by results from numerical experiments.

Semantic communication is widely touted as a key technology for propelling the sixth-generation (6G) wireless networks. However, providing effective semantic representation is quite challenging in practice. To address this issue, this article takes a crack at exploiting semantic knowledge base (KB) to usher in a new era of generative semantic communication. Via semantic KB, source messages can be characterized in low-dimensional subspaces without compromising their desired meanings, thus significantly enhancing the communication efficiency. The fundamental principle of semantic KB is first introduced, and a generative semantic communication architecture is developed by presenting three sub-KBs, namely source, task, and channel KBs. Then, the detailed construction approaches for each sub-KB are described, followed by their utilization in terms of semantic coding and transmission. A case study is also provided to showcase the superiority of generative semantic communication over conventional syntactic communication and classical semantic communication. In a nutshell, this article establishes a scientific foundation for the exciting uncharted frontier of generative semantic communication., Comment: This paper has been accepted by IEEE Wireless Communications and is scheduled for publication

We present a supervised learning framework of training generative models for density estimation. Generative models, including generative adversarial networks, normalizing flows, variational auto-encoders, are usually considered as unsupervised learning models, because labeled data are usually unavailable for training. Despite the success of the generative models, there are several issues with the unsupervised training, e.g., requirement of reversible architectures, vanishing gradients, and training instability. To enable supervised learning in generative models, we utilize the score-based diffusion model to generate labeled data. Unlike existing diffusion models that train neural networks to learn the score function, we develop a training-free score estimation method. This approach uses mini-batch-based Monte Carlo estimators to directly approximate the score function at any spatial-temporal location in solving an ordinary differential equation (ODE), corresponding to the reverse-time stochastic differential equation (SDE). This approach can offer both high accuracy and substantial time savings in neural network training. Once the labeled data are generated, we can train a simple fully connected neural network to learn the generative model in the supervised manner. Compared with existing normalizing flow models, our method does not require to use reversible neural networks and avoids the computation of the Jacobian matrix. Compared with existing diffusion models, our method does not need to solve the reverse-time SDE to generate new samples. As a result, the sampling efficiency is significantly improved. We demonstrate the performance of our method by applying it to a set of 2D datasets as well as real data from the UCI repository.

We propose an ensemble score filter (EnSF) for solving high-dimensional nonlinear filtering problems with superior accuracy. A major drawback of existing filtering methods, e.g., particle filters or ensemble Kalman filters, is the low accuracy in handling high-dimensional and highly nonlinear problems. EnSF attacks this challenge by exploiting the score-based diffusion model, defined in a pseudo-temporal domain, to characterizing the evolution of the filtering density. EnSF stores the information of the recursively updated filtering density function in the score function, instead of storing the information in a set of finite Monte Carlo samples (used in particle filters and ensemble Kalman filters). Unlike existing diffusion models that train neural networks to approximate the score function, we develop a training-free score estimation that uses a mini-batch-based Monte Carlo estimator to directly approximate the score function at any pseudo-spatial-temporal location, which provides sufficient accuracy in solving high-dimensional nonlinear problems as well as saves a tremendous amount of time spent on training neural networks. High-dimensional Lorenz-96 systems are used to demonstrate the performance of our method. EnSF provides surprising performance, compared with the state-of-the-art Local Ensemble Transform Kalman Filter method, in reliably and efficiently tracking extremely high-dimensional Lorenz systems (up to 1,000,000 dimensions) with highly nonlinear observation processes., Comment: arXiv admin note: text overlap with arXiv:2306.09282

We introduce a score-based generative sampling method for solving the nonlinear filtering problem with robust accuracy. A major drawback of existing nonlinear filtering methods, e.g., particle filters, is the low stability. To overcome this issue, we adopt the diffusion model framework to solve the nonlinear filtering problem. In stead of storing the information of the filtering density in finite number of Monte Carlo samples, in the score-based filter we store the information of the filtering density in the score model. Then, via the reverse-time diffusion sampler, we can generate unlimited samples to characterize the filtering density. Moreover, with the powerful expressive capabilities of deep neural networks, it has been demonstrated that a well trained score in diffusion model can produce samples from complex target distributions in very high dimensional spaces. Extensive numerical experiments show that our score-based filter could potentially address the curse of dimensionality in very high dimensional problems.

Online controlled experiments have emerged as industry gold standard for assessing new web features. As new web algorithms proliferate, experimentation platform faces an increasing demand on the velocity of online experiments, which encourages adaptive traffic testing methods to speed up identifying best variant by efficiently allocating traffic. This paper proposed four Bayesian batch bandit algorithms (NB-TS, WB-TS, NB-TTTS, WB-TTTS) for eBay's experimentation platform, using summary batch statistics of a goal metric without incurring new engineering technical debts. The novel WB-TTTS, in particular, demonstrates as an efficient, trustworthy and robust alternative to fixed horizon A/B testing. Another novel contribution is to bring trustworthiness of best arm identification algorithms into evaluation criterion and highlight the existence of severe false positive inflation with equivalent best arms. To gain the trust of experimenters, experimentation platform must consider both efficiency and trustworthiness; However, to the best of authors' knowledge, trustworthiness as an important topic is rarely discussed. This paper shows that Bayesian bandits without neutral posterior reshaping, particularly naive Thompson sampling (NB-TS), are untrustworthy because they can always identify an arm as the best from equivalent best arms. To restore trustworthiness, a novel finding uncovers connections between convergence distribution of posterior optimal probabilities of equivalent best arms and neutral posterior reshaping, which controls false positives. Lastly, this paper presents lessons learned from eBay's experience, as well as thorough evaluations. We hope this work is useful to other industrial practitioners and inspires academic researchers interested in the trustworthiness of adaptive traffic experimentation.

Twin boundaries have been exploited to stabilize ultrafine grains and improve the mechanical properties of nanomaterials. The production of twin boundaries and nanotwins is however prohibitively challenging in carbide ceramics. Using scanning transmission electron microscopes as a unique platform for atomic-scale structure engineering, we demonstrate that twin platelets could be produced in carbides by engineering antisite defects. Antisite defects at metal sites in various layered ternary carbides are collectively and controllably generated and the metal elements are homogenized by electron irradiation, which transforms the twin-like lamellae into nanotwin platelets. Accompanying the chemical homogenization, {\alpha}-Ti3AlC2 transforms to unconventional \b{eta}-Ti3AlC2. The chemical homogeneity and the width of the twin platelets can be tuned by the dose and energy of bombarding electrons. Chemically homogenized nanotwins can boost the hardness by ~45%. Our results provide a new way to produce ultrathin (<5 nm) nanotwin platelets in scientifically and technologically important carbide materials and showcase the feasibility of defect engineering by an angstrom-sized electron probe., Comment: 48 pages, 23 figures

Transfer learning for partial differential equations (PDEs) is to develop a pre-trained neural network that can be used to solve a wide class of PDEs. Existing transfer learning approaches require much information of the target PDEs such as its formulation and/or data of its solution for pre-training. In this work, we propose to construct transferable neural feature spaces from purely function approximation perspectives without using PDE information. The construction of the feature space involves re-parameterization of the hidden neurons and uses auxiliary functions to tune the resulting feature space. Theoretical analysis shows the high quality of the produced feature space, i.e., uniformly distributed neurons. Extensive numerical experiments verify the outstanding performance of our method, including significantly improved transferability, e.g., using the same feature space for various PDEs with different domains and boundary conditions, and the superior accuracy, e.g., several orders of magnitude smaller mean squared error than the state of the art methods.

Semantic communication is an increasingly popular framework for wireless image transmission due to its high communication efficiency. With the aid of the joint-source-and-channel (JSC) encoder implemented by neural network, semantic communication directly maps original images into symbol sequences containing semantic information. Compared with the traditional separate source and channel coding design used in bitlevel communication systems, semantic communication systems are known to be more efficient and accurate especially in the low signal-to-the-noise ratio (SNR) regime. This thus prompts an critical while yet to be tackled issue of security in semantic communication: it makes the eavesdropper more easier to crack the semantic information as it can be decoded even in a quite noisy channel. In this letter, we develop a semantic communication framework that accounts for both semantic meaning decoding efficiency and its risk of privacy leakage. To achieve this, targeting wireless image transmission, we on the one hand propose an JSC autoencoder featuring residual for efficient semantic meaning extraction and transmission, and on the other hand, propose a data-driven scheme that balances the efficiency-privacy tradeoff. Extensive experimental results are provided to show the effectiveness and robustness of the proposed scheme., Comment: Submitted to IEEE WCL for possible publication

Advanced materials often consist of multiple elements which are arranged in a complicated structure. Quantitative scanning transmission electron microscopy is useful to determine the composition and thickness of nanostructures at the atomic scale. However, significant difficulties remain to quantify mixed columns by comparing the resulting atomic resolution images and spectroscopy data with multislice simulations where dynamic scattering needs to be taken into account. The combination of the computationally intensive nature of these simulations and the enormous amount of possible mixed column configurations for a given composition indeed severely hamper the quantification process. To overcome these challenges, we here report the development of an incoherent non-linear method for the fast prediction of ADF-EDX scattering cross-sections of mixed columns under channelling conditions. We first explain the origin of the ADF and EDX incoherence from scattering physics suggesting a linear dependence between those two signals in the case of a high-angle ADF detector. Taking EDX as a perfect incoherent reference mode, we quantitatively examine the ADF longitudinal incoherence under different microscope conditions using multislice simulations. Based on incoherent imaging, the atomic lensing model previously developed for ADF is now expanded to EDX, which yields ADF-EDX scattering cross-section predictions in good agreement with multislice simulations for mixed columns in a core-shell nanoparticle and a high entropy alloy. The fast and accurate prediction of ADF-EDX scattering cross-sections opens up new opportunities to explore the wide range of ordering possibilities of heterogeneous materials with multiple elements.

In online experimentation, appropriate metrics (e.g., purchase) provide strong evidence to support hypotheses and enhance the decision-making process. However, incomplete metrics are frequently occurred in the online experimentation, making the available data to be much fewer than the planned online experiments (e.g., A/B testing). In this work, we introduce the concept of dropout buyers and categorize users with incomplete metric values into two groups: visitors and dropout buyers. For the analysis of incomplete metrics, we propose a clustering-based imputation method using $k$-nearest neighbors. Our proposed imputation method considers both the experiment-specific features and users' activities along their shopping paths, allowing different imputation values for different users. To facilitate efficient imputation of large-scale data sets in online experimentation, the proposed method uses a combination of stratification and clustering. The performance of the proposed method is compared to several conventional methods in both simulation studies and a real online experiment at eBay.

To recommend relevant merchandises for seasonal retail events, we rely on item retrieval from marketplace inventory. With feedback to expand query scope, we discuss keyword expansion candidate selection using word embedding similarity, and an enhanced tf-idf formula for expanded words in search ranking., Comment: The work is oral presented on the SIGIR Symposium on IR in Practice (SIRIP) 2018

eBay's experimentation platform runs hundreds of A/B tests on any given day. The platform integrates with the tracking infrastructure and customer experience servers, provides the sampling service for experiments, and has the responsibility to monitor the progress of each A/B test. There are many challenges especially when it is required to ensure experiment quality at the large scale. We discuss two automated test quality monitoring processes and methodologies, namely randomization validation using population stability index (PSI) and sample ratio mismatch (a.k.a. sample delta) detection using sequential analysis. The automated processes assist the experimentation platform to run high quality and trustworthy tests not only effectively on a large scale, but also efficiently by minimizing false positive monitoring alarms to experimenters.

In recent years, the exponential increase in the demand of wireless data transmission rises the urgency for accurate spectrum sensing approaches to improve spectrum efficiency. The unreliability of conventional spectrum sensing methods by using measurements from a single secondary user (SU) has motivated research on cooperative spectrum sensing (CSS). In this work, we propose a vertical federated learning (VFL) framework to exploit the distributed features across multiple SUs without compromising data privacy. However, the repetitive training process in VFL faces the issue of high communication latency. To accelerate the training process, we propose a truncated vertical federated learning (T-VFL) algorithm, where the training latency is highly reduced by integrating the standard VFL algorithm with a channel-aware user scheduling policy. The convergence performance of T-VFL is provided via mathematical analysis and justified by simulation results. Moreover, to guarantee the convergence performance of the T-VFL algorithm, we conclude three design rules on the neural architectures used under the VFL framework, whose effectiveness is proved through simulations.

Federated edge learning (FEEL) is envisioned as a promising paradigm to achieve privacy-preserving distributed learning. However, it consumes excessive learning time due to the existence of straggler devices. In this paper, a novel topology-optimized federated edge learning (TOFEL) scheme is proposed to tackle the heterogeneity issue in federated learning and to improve the communication-and-computation efficiency. Specifically, a problem of jointly optimizing the aggregation topology and computing speed is formulated to minimize the weighted summation of energy consumption and latency. To solve the mixed-integer nonlinear problem, we propose a novel solution method of penalty-based successive convex approximation, which converges to a stationary point of the primal problem under mild conditions. To facilitate real-time decision making, an imitation-learning based method is developed, where deep neural networks (DNNs) are trained offline to mimic the penalty-based method, and the trained imitation DNNs are deployed at the edge devices for online inference. Thereby, an efficient imitate-learning based approach is seamlessly integrated into the TOFEL framework. Simulation results demonstrate that the proposed TOFEL scheme accelerates the federated learning process, and achieves a higher energy efficiency. Moreover, we apply the scheme to 3D object detection with multi-vehicle point cloud datasets in the CARLA simulator. The results confirm the superior learning performance of the TOFEL scheme over conventional designs with the same resource and deadline constraints., Comment: 15 pages, accepted by IEEE IoTJ for publication

In this paper, we introduce an adaptive kernel method for solving the optimal filtering problem. The computational framework that we adopt is the Bayesian filter, in which we recursively generate an optimal estimate for the state of a target stochastic dynamical system based on partial noisy observational data. The mathematical model that we use to formulate the propagation of the state dynamics is the Fokker-Planck equation, and we introduce an operator decomposition method to efficiently solve the Fokker-Planck equation. An adaptive kernel method is introduced to adaptively construct Gaussian kernels to approximate the probability distribution of the target state. Bayesian inference is applied to incorporate the observational data into the state model simulation. Numerical experiments have been carried out to validate the performance of our kernel method.

In 1940s, Claude Shannon developed the information theory focusing on quantifying the maximum data rate that can be supported by a communication channel. Guided by this, the main theme of wireless system design up until 5G was the data rate maximization. In his theory, the semantic aspect and meaning of messages were treated as largely irrelevant to communication. The classic theory started to reveal its limitations in the modern era of machine intelligence, consisting of the synergy between IoT and AI. By broadening the scope of the classic framework, in this article we present a view of semantic communication (SemCom) and conveying meaning through the communication systems. We address three communication modalities, human-to-human (H2H), human-to-machine (H2M), and machine-to-machine (M2M) communications. The latter two, the main theme of the article, represent the paradigm shift in communication and computing. H2M SemCom refers to semantic techniques for conveying meanings understandable by both humans and machines so that they can interact. M2M SemCom refers to effectiveness techniques for efficiently connecting machines such that they can effectively execute a specific computation task in a wireless network. The first part of the article introduces SemCom principles including encoding, system architecture, and layer-coupling and end-to-end design approaches. The second part focuses on specific techniques for application areas of H2M (human and AI symbiosis, recommendation, etc.) and M2M SemCom (distributed learning, split inference, etc.) Finally, we discuss the knowledge graphs approach for designing SemCom systems. We believe that this comprehensive introduction will provide a useful guide into the emerging area of SemCom that is expected to play an important role in 6G featuring connected intelligence and integrated sensing, computing, communication, and control., Comment: This is an invited paper for Journal of Communications and Information Networks

Recently years, the attempts on distilling mobile data into useful knowledge has been led to the deployment of machine learning algorithms at the network edge. Principal component analysis (PCA) is a classic technique for extracting the linear structure of a dataset, which is useful for feature extraction and data compression. In this work, we propose the deployment of distributed PCA over a multi-access channel based on the algorithm of stochastic gradient descent to learn the dominant feature space of a distributed dataset at multiple devices. Over-the-air aggregation is adopted to reduce the multi-access latency, giving the name over-the-air PCA. The novelty of this design lies in exploiting channel noise to accelerate the descent in the region around each saddle point encountered by gradient descent, thereby increasing the convergence speed of over-the-air PCA. The idea is materialized by proposing a power-control scheme which detects the type of descent region and controlling the level of channel noise accordingly. The scheme is proved to achieve a faster convergence rate than in the case without power control., Comment: 16 pages,9 figures, accepted by IEEE TWC for publication

Multi-point vehicular positioning is one essential operation for autonomous vehicles. However, the state-of-the-art positioning technologies, relying on reflected signals from a target (i.e., RADAR and LIDAR), cannot work without line-of-sight. Besides, it takes significant time for environment scanning and object recognition with potential detection inaccuracy, especially in complex urban situations. Some recent fatal accidents involving autonomous vehicles further expose such limitations. In this paper, we aim at overcoming these limitations by proposing a novel relative positioning approach, called Cooperative Multi-point Positioning (COMPOP). The COMPOP establishes cooperation between a target vehicle (TV) and a sensing vehicle (SV) if a LoS path exists, where a TV explicitly lets an SV to know the TV's existence by transmitting positioning waveforms. This cooperation makes it possible to remove the time-consuming scanning and target recognizing processes, facilitating real-time positioning. One prerequisite for the cooperation is a clock synchronization between a pair of TV and SV. To this end, we use a phase-differential-of-arrival based approach to remove the TV-SV clock difference from the received signal. With clock difference correction, the TV's position can be obtained via peak detection over a 3D power spectrum constructed by a Fourier transform (FT) based algorithm. The COMPOP also incorporates nearby vehicles, without knowing their locations, into the above cooperation for the case without a LoS path. The effectiveness of the COMPOP is verified by several simulations concerning practical channel parameters., Comment: 34 pages, 13 figures

At eBay, there are thousands of product health metrics for different domain teams to monitor. We built a two-phase alerting system to notify users with actionable alerts based on anomaly detection and alert retrieval. In the first phase, we developed an efficient anomaly detection algorithm, called Moving Metric Detector (MMD), to identify potential alerts among metrics with distribution agnostic criteria. In the second alert retrieval phase, we built additional logic with feedbacks to select valid actionable alerts with point-wise ranking model and business rules. Compared with other trend and seasonality decomposition methods, our decomposer is faster and better to detect anomalies in unsupervised cases. Our two-phase approach dramatically improves alert precision and avoids alert spamming in eBay production., Comment: The work is oral presented on the AAAI-20 Workshop on Cloud Intelligence, 2020

In the near future, Internet-of-Things (IoT) is expected to connect billions of devices (e.g., smartphones and sensors), which generate massive real-time data at the network edge. Intelligence can be distilled from the data to support next-generation AI-powered applications, which is called edge machine learning. One challenge faced by edge learning is the communication bottleneck, which is caused by the transmission of high-dimensional data from many edge devices to edge servers for learning. Traditional wireless techniques focusing only on efficient radio access are ineffective in tackling the challenge. Solutions should be based on a new approach that seamlessly integrates communication and computation. This has led to the emergence of a new cross-disciplinary paradigm called communication efficient edge learning. The main theme in the area is to design new communication techniques and protocols for efficient implementation of different distributed learning frameworks (i.e., federated learning) in wireless networks. This article provides an overview of the emerging area by introducing new design principles, discussing promising research opportunities, and providing design examples based on recent work., Comment: This is an English translation of the invited paper for Journal on Communications

In this paper, we solve the arms exponential exploding issue in multivariate Multi-Armed Bandit (Multivariate-MAB) problem when the arm dimension hierarchy is considered. We propose a framework called path planning (TS-PP) which utilizes decision graph/trees to model arm reward success rate with m-way dimension interaction, and adopts Thompson sampling (TS) for heuristic search of arm selection. Naturally, it is quite straightforward to combat the curse of dimensionality using a serial processes that operates sequentially by focusing on one dimension per each process. For our best acknowledge, we are the first to solve Multivariate-MAB problem using graph path planning strategy and deploying alike Monte-Carlo tree search ideas. Our proposed method utilizing tree models has advantages comparing with traditional models such as general linear regression. Simulation studies validate our claim by achieving faster convergence speed, better efficient optimal arm allocation and lower cumulative regret., Comment: Multi-Armed Bandit, Monte Carlo Tree Search, Decision Tree, Path Planning

Multi-point detection of the full-scale environment is an important issue in autonomous driving. The state-of-the-art positioning technologies (such as RADAR and LIDAR) are incapable of real-time detection without line-of-sight. To address this issue, this paper presents a novel multi-point vehicular positioning technology via \emph{millimeter-wave} (mmWave) transmission that exploits multi-path reflection from a \emph{target vehicle} (TV) to a \emph{sensing vehicle} (SV), which enables the SV to fast capture both the shape and location information of the TV in \emph{non-line-of-sight} (NLoS) under the assistance of multi-path reflections. A \emph{phase-difference-of-arrival} (PDoA) based hyperbolic positioning algorithm is designed to achieve the synchronization between the TV and SV. The \emph{stepped-frequency-continuous-wave} (SFCW) is utilized as signals for multi-point detection of the TVs. Transceiver separation enables our approach to work in NLoS conditions and achieve much lower latency compared with conventional positioning techniques., Comment: 9 pages, 6 figures, conference version

In this paper, the uplink adaptation for massive multiple-input-multiple-output (MIMO) networks without the knowledge of user density is considered. Specifically, a novel cooperative uplink transmission and detection scheme is first proposed for massive MIMO networks, where each uplink frame is divided into a number of data blocks with independent coding schemes and the following blocks are decoded based on previously detected data blocks in both service and neighboring cells. The asymptotic signal-to-interference-plus-noise ratio (SINR) of the proposed scheme is then derived, and the distribution of interference power considering the randomness of the users' locations is proved to be Gaussian. By tracking the mean and variance of interference power, an online robust rate adaptation algorithm ensuring a target packet outage probability is proposed for the scenario where the interfering channel and the user density are unknown., Comment: 9 pages, 5 figures, extended conference version

The performance of downlink massive multiple-input-multiple-output networks with co-channel device-to-device communications is investigated in this paper. Specifically, we consider a cellular network with sufficient number of antennas at the base station and typical hexagonal cell coverage, where the cell users and device-to-device transmitters are randomly and uniformly distributed. To obtain the analytical expressions of system-level performance, the asymptotic signal-to-interference ratios for both downlink and device-to-device links are first obtained, which depend on the pathloss and small-scale fading of the interference channels. Since these information may not be available at the service base station or device-to-device transmitters, there exists a chance of packet outage. Therefore, we continue to derive the closed-form approximation of the average goodput, which measures the average number of information bits successfully delivered to the receiver. Hence, the system design trade-off between downlink and co-channel device-to-device communications can be investigated analytically. Moreover, the performance region in which the co-channel device-to-device communications could lead to better overall spectral efficiency can be obtained. Finally, it is shown by simulations that the analytical results matches the actual performance very well., Comment: 6 pages, 4 figures, conference paper accepted by Globecom 2017

The Al-Ag system is thought to be a well-understood model system used to study diffusional phase transformations in alloys. Here we report the existence of a new precipitate phase, zeta, in this classical system using scanning transmission electron microscopy (STEM). The zeta phase has a modulated structure composed of alternating bilayers enriched in Al or Ag. Our in situ annealing experiments reveal that the zeta phase is an intermediate precipitate phase between GP zones epsilon and gamma prime. First-principles calculations show that z is a local energy minimum state formed during Ag clustering in Al. The layered structure of zeta is analogous to the well-known Ag segregation at the precipitate-matrix interfaces when Ag is micro- alloyed in various aluminium alloys., Comment: This is the preprint before paper submission. Please refer to Acta Materialia for the final version of the paper, supplementary materials and movies. Link: http://www.sciencedirect.com/science/article/pii/S1359645417303555