arXiv subjects

Yiming Liu

Publications and source records attributed to Yiming Liu.

At least 109 records · Page 6Linked to original sources

arXiv2022

Probing Top-quark Operators with Precision Electroweak Measurements

In the Standard Model Effective Field Theory (SMEFT), operators involving the top quark are generally difficult to probe, and can generate sizable loop contributions to the electroweak precision observables, measured by past and future lepton colliders. Could the high precision of the electroweak measurements compensate the loop suppression and provide competitive reaches on these operators? Would the inclusion of these contributions introduce too many additional parameters for a meaningful global electroweak analysis to be done? In this paper, we perform a detailed phenomenological study to address these two important questions. Focusing on eight dimension-6 operators that generate anomalous couplings between the electroweak gauge bosons and the third-generation quarks, we calculate their one loop contributions to the $e^+e^- \to f\bar{f}$ processes both on and off the Z-pole and the $e^-e^+ \to WW$ process. A global analysis is performed with these eight operators and the ones that contribute to the above processes at tree level, using the measurements at LEP, SLC and several low energy experiments. We find that, while the current electroweak precision measurements are sensitive to the one-loop effects of the top-quark operators, it is difficult to separate them from the operators that contribute at the tree level, making a global analysis rather challenging. Under more assumptions, competitive reaches could be obtained in a global fit. Another important finding of our study is that the two operators that generate dipole interactions of the bottom quark have significant impacts in the Z-pole measurements and should not be omitted. We also discuss the implication of the recently reported W-boson mass measurement at CDF to our results. Finally, we estimate the reaches of future lepton colliders in probing the top-quark operators with precision electroweak measurements.

hep-ph↗

arXiv2022

Energy-efficient Caching and Task offloading for Timely Status Updates in UAV-assisted VANETs

Intelligent edge network is maturing to enable smart and efficient transportation systems. In this letter, we consider unmanned aerial vehicle (UAV)-assisted vehicular networks where UAVs provide caching and computing services in complement with base station (BS). One major challenge is that vehicles need to obtain timely situational awareness via orchestration of ubiquitous caching and computing resources. Note that cached data for vehicles' perception tasks contains time-varying context information, thus freshness of cached data should be considered in conjunction with task execution to guarantee timeliness of obtained status updates. To this end, we propose a two-stage performance metric to quantify the impact of cache refreshing and computation offloading decisions on the age of status updates. We formulate an energy minimization problem by jointly considering cache refreshing, computation offloading and aging of status updates. To facilitate online decision making, we propose a deep deterministic policy gradient(DDPG)-based solution procedure and incorporate differentiated experience replay mechanism to accelerate convergence. Simulation results show that the performance of proposed solution is competitive in terms of energy consumption for obtaining fresh status updates.

cs.NI↗

arXiv2022

Robust PCA Unrolling Network for Super-resolution Vessel Extraction in X-ray Coronary Angiography

Although robust PCA has been increasingly adopted to extract vessels from X-ray coronary angiography (XCA) images, challenging problems such as inefficient vessel-sparsity modelling, noisy and dynamic background artefacts, and high computational cost still remain unsolved. Therefore, we propose a novel robust PCA unrolling network with sparse feature selection for super-resolution XCA vessel imaging. Being embedded within a patch-wise spatiotemporal super-resolution framework that is built upon a pooling layer and a convolutional long short-term memory network, the proposed network can not only gradually prune complex vessel-like artefacts and noisy backgrounds in XCA during network training but also iteratively learn and select the high-level spatiotemporal semantic information of moving contrast agents flowing in the XCA-imaged vessels. The experimental results show that the proposed method significantly outperforms state-of-the-art methods, especially in the imaging of the vessel network and its distal vessels, by restoring the intensity and geometry profiles of heterogeneous vessels against complex and dynamic backgrounds.

eess.IV↗

arXiv2022

FORCE: A Framework of Rule-Based Conversational Recommender System

The conversational recommender systems (CRSs) have received extensive attention in recent years. However, most of the existing works focus on various deep learning models, which are largely limited by the requirement of large-scale human-annotated datasets. Such methods are not able to deal with the cold-start scenarios in industrial products. To alleviate the problem, we propose FORCE, a Framework Of Rule-based Conversational Recommender system that helps developers to quickly build CRS bots by simple configuration. We conduct experiments on two datasets in different languages and domains to verify its effectiveness and usability.

cs.IR↗

arXiv2022

Active Phase-Encode Selection for Slice-Specific Fast MR Scanning Using a Transformer-Based Deep Reinforcement Learning Framework

Purpose: Long scan time in phase encoding for forming complete K-space matrices is a critical drawback of MRI, making patients uncomfortable and wasting important time for diagnosing emergent diseases. This paper aims to reducing the scan time by actively and sequentially selecting partial phases in a short time so that a slice can be accurately reconstructed from the resultant slice-specific incomplete K-space matrix. Methods: A transformer based deep reinforcement learning framework is proposed for actively determining a sequence of partial phases according to reconstruction-quality based Q-value (a function of reward), where the reward is the improvement degree of reconstructed image quality. The Q-value is efficiently predicted from binary phase-indicator vectors, incomplete K-space matrices and their corresponding undersampled images with a light-weight transformer so that the sequential information of phases and global relationship in images can be used. The inverse Fourier transform is employed for efficiently computing the undersampled images and hence gaining the rewards of selecting phases. Results: Experimental results on the fastMRI dataset with original K-space data accessible demonstrate the efficiency and accuracy superiorities of proposed method. Compared with the state-of-the-art reinforcement learning based method proposed by Pineda et al., the proposed method is roughly 150 times faster and achieves significant improvement in reconstruction accuracy. Conclusions: We have proposed a light-weight transformer based deep reinforcement learning framework for generating high-quality slice-specific trajectory consisting of a small number of phases. The proposed method, called TITLE (Transformer Involved Trajectory LEarning), has remarkable superiority in phase-encode selection efficiency and image reconstruction accuracy.

cs.CV↗

arXiv2022

The role of haptic communication in dyadic collaborative object manipulation tasks

Intuitive and efficient physical human-robot collaboration relies on the mutual observability of the human and the robot, i.e. the two entities being able to interpret each other's intentions and actions. This is remedied by a myriad of methods involving human sensing or intention decoding, as well as human-robot turn-taking and sequential task planning. However, the physical interaction establishes a rich channel of communication through forces, torques and haptics in general, which is often overlooked in industrial implementations of human-robot interaction. In this work, we investigate the role of haptics in human collaborative physical tasks, to identify how to integrate physical communication in human-robot teams. We present a task to balance a ball at a target position on a board either bimanually by one participant, or dyadically by two participants, with and without haptic information. The task requires that the two sides coordinate with each other, in real-time, to balance the ball at the target. We found that with training the completion time and number of velocity peaks of the ball decreased, and that participants gradually became consistent in their braking strategy. Moreover we found that the presence of haptic information improved the performance (decreased completion time) and led to an increase in overall cooperative movements. Overall, our results show that humans can better coordinate with one another when haptic feedback is available. These results also highlight the likely importance of haptic communication in human-robot physical interaction, both as a tool to infer human intentions and to make the robot behaviour interpretable to humans.

cs.RO↗

arXiv2021

Induced transparency: interference or polarization?

The polarization of optical fields is a crucial degree of freedom in the all-optical analogue of electromagnetically induced transparency (EIT). However, the physical origins of EIT and polarization induced phenomena have not been well distinguished, which can lead to confusion in associated applications such as slow light and optical/quantum storage. Here we study the polarization effects in various optical EIT systems. We find that a polarization mismatch between whispering gallery modes in two indirectly coupled resonators can induce a narrow transparency window in the transmission spectrum resembling the EIT lineshape. However, such polarization induced transparency (PIT) is distinct from EIT: it originates from strong polarization rotation effects and shows unidirectional feature. The coexistence of PIT and EIT provides new routes for the manipulation of light flow in optical resonator systems.

physics.optics↗

arXiv2021

Asymptotic Achievability of the Cramér-Rao Lower Bound of Channel Estimation for Reconfigurable Intelligent Surface Aided Communication Systems

To achieve the joint active and passive beamforming gains in the reconfigurable intelligent surface assisted millimeter wave system, the reflected cascade channel needs to be accurately estimated. Many strategies have been proposed in the literature to solve this issue. However, whether the Cramér-Rao lower bound (CRLB) of such estimation is achievable still remains uncertain. To fill this gap, we first convert the channel estimation problem into a sparse signal recovery problem by utilizing the properties of discrete Fourier transform matrix and Kronecker product. Then, a joint typicality based estimator is utilized to carry out the signal recovery task. We show that, through both mathematical proofs and numerical simulations, the solution proposed in this letter can in fact asymptotically achieve the CRLB.

cs.IT↗

arXiv2021

Outage Probability of Intelligent Reflecting Surfaces Assisted Full Duplex Two-way Communications

In this letter, we study the outage probability of intelligent reflecting surface (IRS) assisted full duplex two-way communication systems, which characterizes the performance of overcoming the transmitted data loss caused by long deep fades. To this end, we first derive the probability distribution of the cascaded end-to-end equivalent channel with an arbitrarily given IRS beamformer. Our analysis shows that deriving such probability distribution in the considered case is more challenging than the case with the phase-matched IRS beamformer. Then, with the derived probability distribution of the equivalent channel, we obtain the closed-form expression of the outage probability performance. It theoretically shows that the reflecting element number has a conspicuous effect on the improvement of the system reliability. Extensive numerical results verify the correctness of the derived results and confirm the superiority of the considered IRS assisted two-way communication system comparing to the one-way counterpart.

cs.IT↗

arXiv2021

Diverse response of surface ozone to COVID-19 lockdown in China

Ozone (O$_{3}$) is a key oxidant and pollutant in the lower atmosphere. Significant increases in surface O$_{3}$ have been reported in many cities during the COVID-19 lockdown. Here we conduct comprehensive observation and modeling analyses of surface O$_{3}$ across China for periods before and during the lockdown. We find that daytime O$_{3}$ decreased in the subtropical south, in contrast to increases in most other regions. Meteorological changes and emission reductions both contributed to the O$_{3}$ changes, with a larger impact from the former especially in central China. The plunge in nitrogen oxide (NO$_{x}$) emission contributed to O$_{3}$ increases in populated regions, whereas the reduction in volatile organic compounds (VOC) contributed to O$_{3}$ decreases across the country. Due to a decreasing level of NO$_{x}$ saturation from north to south, the emission reduction in NO$_{x}$ (46%) and VOC (32%) contributed to net O$_{3}$ increases in north China; the opposite effects of NO$_{x}$ decrease (49%) and VOC decrease (24%) balanced out in central China, whereas the comparable decreases (45-55%) in these two precursors contributed to net O$_{3}$ declines in south China. Our study highlights the complex dependence of O$_{3}$ on its precursors and the importance of meteorology in the short-term O$_{3}$ variability.

physics.ao-ph↗

arXiv2021

Spectral Machine Learning for Pancreatic Mass Imaging Classification

We present a novel spectral machine learning (SML) method in screening for pancreatic mass using CT imaging. Our algorithm is trained with approximately 30,000 images from 250 patients (50 patients with normal pancreas and 200 patients with abnormal pancreas findings) based on public data sources. A test accuracy of 94.6 percents was achieved in the out-of-sample diagnosis classification based on a total of approximately 15,000 images from 113 patients, whereby 26 out of 32 patients with normal pancreas and all 81 patients with abnormal pancreas findings were correctly diagnosed. SML is able to automatically choose fundamental images (on average 5 or 9 images for each patient) in the diagnosis classification and achieve the above mentioned accuracy. The computational time is 75 seconds for diagnosing 113 patients in a laptop with standard CPU running environment. Factors that influenced high performance of a well-designed integration of spectral learning and machine learning included: 1) use of eigenvectors corresponding to several of the largest eigenvalues of sample covariance matrix (spike eigenvectors) to choose input attributes in classification training, taking into account only the fundamental information of the raw images with less noise; 2) removal of irrelevant pixels based on mean-level spectral test to lower the challenges of memory capacity and enhance computational efficiency while maintaining superior classification accuracy; 3) adoption of state-of-the-art machine learning classification, gradient boosting and random forest. Our methodology showcases practical utility and improved accuracy of image diagnosis in pancreatic mass screening in the era of AI.

cs.CV↗

arXiv2021

Deep Deterministic Policy Gradient for Relay Selection and Power Allocation in Cooperative Communication Network

Perfect channel state information (CSI) is usually required when considering relay selection and power allocation in cooperative communication. However, it is difficult to get an accurate CSI in practical situations. In this letter, we study the outage probability minimizing problem based on optimizing relay selection and transmission power. We propose a prioritized experience replay aided deep deterministic policy gradient learning framework, which can find an optimal solution by dealing with continuous action space, without any prior knowledge of CSI. Simulation results reveal that our approach outperforms reinforcement learning based methods in existing literatures, and improves the communication success rate by about 4%.

cs.IT↗

arXiv2021

Integrating Pre-trained Model into Rule-based Dialogue Management

Rule-based dialogue management is still the most popular solution for industrial task-oriented dialogue systems for their interpretablility. However, it is hard for developers to maintain the dialogue logic when the scenarios get more and more complex. On the other hand, data-driven dialogue systems, usually with end-to-end structures, are popular in academic research and easier to deal with complex conversations, but such methods require plenty of training data and the behaviors are less interpretable. In this paper, we propose a method to leverages the strength of both rule-based and data-driven dialogue managers (DM). We firstly introduce the DM of Carina Dialog System (CDS, an advanced industrial dialogue system built by Microsoft). Then we propose the "model-trigger" design to make the DM trainable thus scalable to scenario changes. Furthermore, we integrate pre-trained models and empower the DM with few-shot capability. The experimental results demonstrate the effectiveness and strong few-shot capability of our method.

cs.CL↗

arXiv2021

Metaknowledge Extraction Based on Multi-Modal Documents

The triple-based knowledge in large-scale knowledge bases is most likely lacking in structural logic and problematic of conducting knowledge hierarchy. In this paper, we introduce the concept of metaknowledge to knowledge engineering research for the purpose of structural knowledge construction. Therefore, the Metaknowledge Extraction Framework and Document Structure Tree model are presented to extract and organize metaknowledge elements (titles, authors, abstracts, sections, paragraphs, etc.), so that it is feasible to extract the structural knowledge from multi-modal documents. Experiment results have proved the effectiveness of metaknowledge elements extraction by our framework. Meanwhile, detailed examples are given to demonstrate what exactly metaknowledge is and how to generate it. At the end of this paper, we propose and analyze the task flow of metaknowledge applications and the associations between knowledge and metaknowledge.

cs.CV↗

arXiv2021

Blockchain-empowered Data-driven Networks: A Survey and Outlook

The paths leading to future networks are pointing towards a data-driven paradigm to better cater to the explosive growth of mobile services as well as the increasing heterogeneity of mobile devices, many of which generate and consume large volumes and variety of data. These paths are also hampered by significant challenges in terms of security, privacy, services provisioning, and network management. Blockchain, which is a technology for building distributed ledgers that provide an immutable log of transactions recorded in a distributed network, has become prominent recently as the underlying technology of cryptocurrencies and is revolutionizing data storage and processing in computer network systems. For future data-driven networks (DDNs), blockchain is considered as a promising solution to enable the secure storage, sharing, and analytics of data, privacy protection for users, robust, trustworthy network control, and decentralized routing and resource managements. However, many important challenges and open issues remain to be addressed before blockchain can be deployed widely to enable future DDNs. In this article, we present a survey on the existing research works on the application of blockchain technologies in computer networks, and identify challenges and potential solutions in the applications of blockchains in future DDNs. We identify application scenarios in which future blockchain-empowered DDNs could improve the efficiency and security, and generally the effectiveness of network services.

cs.NI↗

arXiv2021

Hierarchical Reinforcement Learning for Relay Selection and Power Optimization in Two-Hop Cooperative Relay Network

Cooperative communication is an effective approach to improve spectrum utilization. In order to reduce outage probability of communication system, most studies propose various schemes for relay selection and power allocation, which are based on the assumption of channel state information (CSI). However, it is difficult to get an accurate CSI in practice. In this paper, we study the outage probability minimizing problem subjected to a total transmission power constraint in a two-hop cooperative relay network. We use reinforcement learning (RL) methods to learn strategies for relay selection and power allocation, which do not need any prior knowledge of CSI but simply rely on the interaction with communication environment. It is noted that conventional RL methods, including most deep reinforcement learning (DRL) methods, cannot perform well when the search space is too large. Therefore, we first propose a DRL framework with an outage-based reward function, which is then used as a baseline. Then, we further propose a hierarchical reinforcement learning (HRL) framework and training algorithm. A key difference from other RL-based methods in existing literatures is that, our proposed HRL approach decomposes relay selection and power allocation into two hierarchical optimization objectives, which are trained in different levels. With the simplification of search space, the HRL approach can solve the problem of sparse reward, while the conventional RL method fails. Simulation results reveal that compared with traditional DRL method, the HRL training algorithm can reach convergence 30 training iterations earlier and reduce the outage probability by 5% in two-hop relay network with the same outage threshold.

eess.SY↗

arXiv2021

Positivity in electron-positron scattering: testing the axiomatic quantum field theory principles and probing the existence of UV states

We consider the positivity bounds on dimension-8 four-electron operators and study two related phenomenological aspects at future lepton colliders. First, if positivity is violated, probing such violations will revolutionize our understanding of the fundamental pillars of quantum field theory and the $S$-matrix theory. We observe that positivity violation at scales of 1--10 TeV can potentially be probed at future lepton colliders even if one assumes that dimension-6 operators are also present. Second, the positive nature of the dimension-8 parameter space often allows us to either directly infer the existence of UV-scale particles together with their quantum numbers or exclude them up to certain scales in a model-independent way. In particular, dimension-8 positivity plays an important role in the test of the Standard Model. If no deviations from the Standard Model are observed, it allows for simultaneous exclusion limits on all kinds of potential UV-complete models. Unlike the dimension-6 case, these limits apply regardless of the UV model setup and cannot be removed by possible cancellations among various UV contributions. This thus consists of a novel and universal test to confirm the Standard Model. We demonstrate with realistic examples how all the previously mentioned possibilities, including the test of positivity violation, can be achieved. Hence, we provide an important motivation for studying dimension-8 operators more comprehensively.

hep-ph↗

arXiv2020

Deep Reinforcement Learning Based Dynamic Route Planning for Minimizing Travel Time

Route planning is important in transportation. Existing works focus on finding the shortest path solution or using metrics such as safety and energy consumption to determine the planning. It is noted that most of these studies rely on prior knowledge of road network, which may be not available in certain situations. In this paper, we design a route planning algorithm based on deep reinforcement learning (DRL) for pedestrians. We use travel time consumption as the metric, and plan the route by predicting pedestrian flow in the road network. We put an agent, which is an intelligent robot, on a virtual map. Different from previous studies, our approach assumes that the agent does not need any prior information about road network, but simply relies on the interaction with the environment. We propose a dynamically adjustable route planning (DARP) algorithm, where the agent learns strategies through a dueling deep Q network to avoid congested roads. Simulation results show that the DARP algorithm saves 52% of the time under congestion condition when compared with traditional shortest path planning algorithms.

cs.LG↗