Source author record

Rui Zhang

Rui Zhang appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

354works

53topics

4close collaborators

Actions

Connect this record

Open graph Browse works

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

preprint2026arXiv

6D Movable Antenna Enhanced Cell-free MIMO: Two-timescale Decentralized Beamforming and Antenna Movement Optimization

This paper investigates a six-dimensional movable antenna (6DMA)-aided cell-free multi-user multiple-input multiple-output (MIMO) communication system. In this system, each distributed access point (AP) can flexibly adjust its array orientation and antenna positions to adapt to spatial channel variations and enhance communication performance. However, frequent antenna movements and centralized beamforming based on global instantaneous channel state information (CSI) sharing among APs entail extremely high signal processing delay and system overhead, which is difficult to be practically implemented in high-mobility scenarios with short channel coherence time. To address these practical implementation challenges and improve scalability, a two-timescale decentralized optimization framework is proposed in this paper to jointly design the beamformer, antenna positions, and array orientations. In the short timescale, each AP updates its receive beamformer based on local instantaneous CSI and global statistical CSI. In the long timescale, the central processing unit optimizes the antenna positions and array orientations at all APs based on global statistical CSI to maximize the ergodic sum rate of all users. The resulting optimization problem is non-convex and involves highly coupled variables, thus posing significant challenges for obtaining efficient solutions. To address this problem, a constrained stochastic successive convex approximation algorithm is developed. Numerical results demonstrate that the proposed 6DMA-aided cell-free system with decentralized beamforming significantly outperforms other antenna movement schemes with less flexibility and even achieves a performance comparable to that of the centralized beamforming benchmark.

preprint2026arXiv

A Systematic Evaluation of Imbalance Handling Methods in Biomedical Binary Classification

Objective: The primary goal of this study was to systematically examine the impact of commonly used imbalance handling methods (IHMs) on predictive performance in biomedical binary classification, considering the interplay between model complexity and diverse data modalities. Material and Methods: We evaluated five representative IHMs: random undersampling (RUS), random oversampling (ROS), SMOTE, re-weighting (RW), and direct F1-score optimization (DMO), against a raw training (RAW) baseline. The evaluation encompassed three public biomedical datasets: MIMIC-III (tabular), ADE-Corpus-V2 (text), and MURA (image), spanning three common biomedical data modalities. To assess varying model complexity, we employed a range of architectures, from classical logistic regression and random forest to deep neural networks, including multilayer perceptron (MLP), BiLSTM, BERT, DenseNet, and DINOv2. Results: For simpler models such as logistic regression on tabular data, IHMs yielded no significant advantage over the RAW baseline, aligning with prior findings. However, clear benefits were observed for more complex models and unstructured data: (a) ROS and RW consistently enhanced the performance of powerful models; (b) direct F1-score optimization demonstrated utility primarily for unstructured text and image data; and (c) RUS and SMOTE consistently degraded performance and are therefore not recommended. Conclusion: The effectiveness of IHMs depends on both model complexity and data modality. Performance gains are most pronounced when leveraging appropriate IHMs, such as ROS, RW, and DMO, on high-complexity models.

preprint2026arXiv

AI Signal Processing Paradigm for Movable Antenna: From Spatial Position Optimization to Electromagnetic Reconfigurability

As 6G wireless communication systems evolve toward intelligence, high reconfigurability, and space-air-ground integration \cite{liu2025toward, liu2024near}, the limitations of traditional fixed antenna (TFA) have become increasingly prominent. As a remedy, spatially movable antenna (SMA) and electromagnetically reconfigurable antenna (ERA) have respectively emerged as key technologies to break through this bottleneck. SMA activates spatial degree of freedom (DoF) by dynamically adjusting antenna positions, ERA regulates radiation characteristics using tunable metamaterials, thereby introducing DoF in the electromagnetic domain. However, the ``spatial-electromagnetic dual reconfiguration" paradigm formed by their integration poses severe challenges of high-dimensional hybrid optimization to signal processing. To address this issue, we integrate the spatial optimization of SMA and the electromagnetic reconfiguration of ERA, propose a unified modeling framework termed movable and reconfigurable antenna (MARA) and investigate the channel modeling and spectral efficiency (SE) optimization for MARA. Besides, we systematically review artificial intelligence (AI)-based solutions, focusing on analyzing the advantages of AI over traditional algorithms in solving high-dimensional non-convex optimization problems. This paper fills the gap in existing literature regarding the lack of a comprehensive review on the AI-driven signal processing paradigm under spatial-electromagnetic dual reconfiguration and provides theoretical guidance for the design and optimization of 6G wireless systems with advanced MARA.

preprint2026arXiv

DreamSR: Towards Ultra-High-Resolution Image Super-Resolution via a Receptive-Field Enhanced Diffusion Transformer

Large-scale pre-trained diffusion models have been extensively adopted for real-world image Super-Resolution because of their powerful generative priors through textual guidance. However, when super-resolving high-resolution images with patch-wise inference strategy, most existing diffusion-based SR methods tend to suffer from over-generation, due to the misalignment between the global prompt from LR image and the incomplete semantic information of local patches during each inference step. On the other hand, most existing methods also failed to generate detailed texture in local patches due to the overemphasis on global generation capabilities in network designs and training strategies. To address this issue, we present DreamSR, a novel SR model that suppresses local over-generation and improves fine-detail synthesis, thereby achieving visually faithful results with ultra-high-quality details. Specifically, we propose a dual-branch MM-ControlNet, where the ControlNet generates local textual feature with patch-level prompts while the pre-trained DiT provides global textual feature with global prompts, thereby mitigating over-generation and ensuring semantic consistency across patches. We also design a comprehensive training strategy with stage-specific data processing pipelines and a Receptive-Field Enhancement strategy, enhancing the model's capability to capture patch information and effectively restore local textures. Extensive experiments demonstrate that DreamSR outperforms state-of-the-art methods, providing high-quality SR results. Code and model are available at https://github.com/jerrydong0219/DreamSR.

preprint2026arXiv

Elastic Attention Cores for Scalable Vision Transformers

Vision Transformers (ViTs) achieve strong data-driven scaling by leveraging all-to-all self-attention. However, this flexibility incurs a computational cost that scales quadratically with image resolution, limiting ViTs in high-resolution domains. Underlying this approach is the assumption that pairwise token interactions are necessary for learning rich visual-semantic representations. In this work, we challenge this assumption, demonstrating that effective visual representations can be learned without any direct patch-to-patch interaction. We propose VECA (Visual Elastic Core Attention), a vision transformer architecture that uses efficient linear-time core-periphery structured attention enabled by a small set of learned cores. In VECA, these cores act as a communication interface: patch tokens exchange information exclusively through the core tokens, which are initialized from scratch and propagated across layers. Because the $N$ image patches only directly interact with a resolution invariant set of $C$ learned "core" embeddings, this yields linear complexity $O(N)$ for predetermined $C$, which bypasses quadratic scaling. Compared to prior cross-attention architectures, VECA maintains and iteratively updates the full set of $N$ input tokens, avoiding a small $C$-way bottleneck. Combined with nested training along the core axis, our model can elastically trade off compute and accuracy during inference. Across classification and dense tasks, VECA achieves performance competitive with the latest vision foundation models while reducing computational cost. Our results establish elastic core-periphery attention as a scalable alternative building block for Vision Transformers.

preprint2026arXiv

Enhanced Distributed Variational Quantum Eigensolver for Large-Scale MaxCut Problem

MaxCut is a canonical NP-hard combinatorial optimization problem in graph theory with broad applications ranging from physics to bioinformatics. Although variational quantum algorithms offer promising new approaches that may eventually outperform classical schemes, they suffer from resource constraints and trainability issues such as barren plateaus, making large-scale instances intractable on noisy intermediate-scale quantum devices. In this paper, we propose an enhanced distributed variational quantum eigensolver for large-scale MaxCut problems, which extends our prior distributed variational quantum eigensolver framework by integrating a novel hybrid classical-quantum perturbation strategy, enhances optimization scalability and efficiency. Our algorithm solves weighted MaxCut instances with up to 1000 vertices using only 10 qubits, and numerical results indicate that it consistently outperforms the Goemans-Williamson algorithm. We further employ a warm-start initialization strategy, seeding the algorithm with high-quality solutions from the Goemans-Williamson algorithm, with results confirming that the optimal classical solution can be effectively further improved. The practical utility of the proposed algorithm is further validated through its application to haplotype phasing on genome sequencing data of the human ABCA1 gene, producing high-quality haplotypes that rival those obtained by the Goemans-Williamson algorithm with $10^6$ projections. These results establish the proposed algorithm as a scalable, NISQ-compatible framework for near-term quantum-enhanced large-scale combinatorial optimization.

preprint2026arXiv

Entanglement Detection with Variational Quantum Interference: Theory and Experiment

Entanglement detection is a fundamental task in quantum information science, serving as a cornerstone for quantum benchmarking and foundational studies. With an increasing qubit number that can be effectively controlled, there is a pressing need for a scalable and robust detection protocol which requires minimal resources while maintaining high detection capability. By integrating the Positive Partial Transposition criterion with variational quantum interference, we propose an entanglement detection protocol that requires moderate classical and quantum computation resources. We numerically show that this protocol achieves a high detection capability with shallow quantum circuits, surpassing some widely-used entanglement detection methods. The protocol also exhibits strong resilience to circuit noise, ensuring its applicability across different physical platforms. We further demonstrate the protocol experimentally on an eight-photon linear-optical platform, where it successfully detects the entanglement of a three-qubit mixed state that is inaccessible to conventional entanglement witnesses. By combining quantum interference with classical optimization, our protocol provides a scalable and resource-efficient route toward practical entanglement detection.

preprint2026arXiv

Geometry-Aware Neural Optimizer for Shape Optimization and Inversion

Geometry is central to PDE-governed systems, motivating shape optimization and inversion. Classical pipelines conduct costly forward simulation with geometry processing, requiring substantial expert effort. Neural surrogates accelerate forward analysis but do not close the loop because gradients from objectives to geometry are often unavailable. Existing differentiable methods either rely on restrictive parameterizations or unstable latent optimization driven by scalar objectives, limiting interpretability and part-wise control. To address these challenges, we propose Geometry-Aware Neural Optimizer (\textbf{\textsc{GANO}}), an end-to-end differentiable framework that unifies geometry representation, field-level prediction, and automated optimization/inversion in a single latent-space loop. \textsc{GANO} encodes shapes with an auto-decoder and stabilizes latent updates via a denoising mechanism, and a geometry-informed surrogate provides a reliable gradient pathway for geometry updates. Moreover, \textsc{GANO} supports part-wise control through null-space projection and uses remeshing-free projection to accelerate geometry processing. We further prove that denoising induces an implicit Jacobian regularization that reduces decoder sensitivity, yielding controlled deformations. Experiments on three benchmarks spanning 2D Helmholtz, 2D airfoil, and 3D vehicles show state-of-the-art accuracy and stable, controllable updates, achieving up to +55.9% lift-to-drag improvement for airfoils and ~7% drag reduction for vehicles.

preprint2026arXiv

Hardwired-Neurons Language Processing Units as General-Purpose Cognitive Substrates

The rapid advancement of Large Language Models (LLMs) has established language as a core general-purpose cognitive substrate, driving the demand for specialized Language Processing Units (LPUs) tailored for LLM inference. To overcome the growing energy consumption of LLM inference systems, this paper proposes a Hardwired-Neurons Language Processing Unit (HNLPU), which physically hardwires LLM weight parameters into the computational fabric, achieving several orders of magnitude computational efficiency improvement by extreme specialization. However, a significant challenge still lies in the scale of modern LLMs. A straightforward hardwiring of gpt-oss 120 B would require fabricating photomask sets valued at over 6 billion dollars, rendering this straightforward solution economically impractical. Addressing this challenge, we propose the novel Metal-Embedding methodology. Instead of embedding weights in a 2D grid of silicon device cells, Metal-Embedding embeds weight parameters into the 3D topology of metal wires. This brings two benefits: (1) a 15x increase in density, and (2) 60 out of 70 photomask layers are homogeneous across chips, including all EUV photomasks. In total, Metal-Embedding reduced the photomask cost by 112x, bringing the Non-Recurring Engineering (NRE) cost of HNLPU into an economically viable range. Experimental results show that HNLPU achieved 249,960 tokens/s (5,555x/85x that of GPU/WSE), 36 tokens/J (1,047x/283x that of GPU/WSE), 13,232 mm2 total die area, $59.46 M-123.5 M estimated NRE at 5 nm technology. Analysis shows that HNLPU achieved 41.7-80.4x improvement in cost-effectiveness and 357x reduction in carbon footprint compared to OpenAI-scale H100 clusters, under an annual weight updating assumption.

preprint2026arXiv

Movable Antenna for Integrating Near-field Channel Estimation and Localization

Movable antenna (MA) introduces a new degree of freedom for future wireless communication systems by enabling the adaptive adjustment of antenna positions. Its large-range movement renders wireless channels transmission into the near-field region, which brings new performance enhancement for integrated sensing and communication (ISAC). This paper proposes a novel multi-stage design framework for broadband near-field ISAC assisted by MA. The framework first divides the MA movement area into multiple subregions, and employs the Newtonized orthogonal matching pursuit algorithm (NOMP) to achieve high-precision angle estimation in each subregion. Subsequently, a method called near-field localization via subregion ray clustering (LSRC) is proposed for identifying the positions of scatterers. This method finds the coordinates of each scatterer by jointly processing the angle estimates across all subregions. Finally, according to the estimated locations of the scatterers, the near-field channel estimation (CE) is refined for improving communication performance. Simulation results demonstrate that the proposed scheme can significantly enhance MA sensing accuracy and CE, providing an efficient solution for MA-aided near-field ISAC.

preprint2026arXiv

muT2-NMR: Micro-Scale Correlation Relaxometry for in-situ High-Pressure Nuclear Magnetic Resonance

Over the last decade, frequency-domain in-situ high-pressure nuclear magnetic resonance (NMR) spectroscopy in diamond anvil cells (DACs) has been employed as a structural and electronic probe of condensed matter systems at pressures well into the megabar range. However, extensive spin interactions and sample heterogeneities under pressure often lead to significant spectral overlap, inhibiting independent observation of chemically similar spin sub-species in the same sample. In this work, we introduce a time-domain relaxometry framework specifically suited for DAC experiments, named muT2-NMR. Experimental flexibility and operational robustness are benchmarked on three hydrogen-rich molecular solids at pressures up to 72 GPa. We demonstrate that muT2-NMR can resolve individual molecular subunits in relaxation space, paving the way for novel high-pressure, high-resolution NMR applications in molecular solids.

preprint2026arXiv

Nexus : An Agentic Framework for Time Series Forecasting

Time series forecasting is not just numerical extrapolation, but often requires reasoning with unstructured contextual data such as news or events. While specialized Time Series Foundation Models (TSFMs) excel at forecasting based on numerical patterns, they remain unaware to real-world textual signals. Conversely, while LLMs are emerging as zero-shot forecasters, their performance remains uneven across domains and contextual grounding. To bridge this gap, we introduce Nexus, a multi-agent forecasting framework that decomposes prediction into specialized stages: isolating macro-level and micro-level temporal fluctuations, and integrating contextual information when available before synthesizing a final forecast. This decomposition enables Nexus to adapt from seasonal signals to volatile, event-driven information without relying on external statistical anchors or monolithic prompting. We show that current-generation LLMs possess substantially stronger intrinsic forecasting ability than previously recognized, depending critically on how numerical and contextual reasoning are organized. Evaluated on data strictly succeeding LLM knowledge cutoffs spanning Zillow real estate metrics and volatile stock market equities, Nexus consistently matches or outperforms state-of-the-art TSFMs and strong LLM baselines. Beyond numerical accuracy, Nexus produces high-quality reasoning traces that explicitly show the fundamental drivers behind each forecast. Our results establish that real-world forecasting is an agentic reasoning problem extending well beyond only sequence modeling.

preprint2026arXiv

PEMNet: Towards Autonomous and Enhanced Environment-Aware Mobile Networks

With 5G deployment and the evolution toward 6G, mobile networks must make decisions in highly dynamic environments under strict latency, energy, and spectrum constraints. Achieving this goal, however, depends on prior knowledge of spatial-temporal variations in wireless channels and traffic demands. This motivates a joint, site-specific representation of radio propagation and user demand that is queryable at low online overhead. In this work, we propose the perception embedding map (PEM), a localized framework that embeds fine-grained channel statistics together with grid-level spatial-temporal traffic patterns over a base station's coverage. PEM is built from standard-compliant measurements -- such as measurement report and scheduling/quality-of-service logs -- so it can be deployed and maintained at scale with low cost. Integrated into PEM, this joint knowledge supports enhanced environment-aware optimization across PHY, MAC, and network layers while substantially reducing training overhead and signaling. Compared with existing site-specific channel maps and digital-twin replicas, PEM distinctively emphasizes (i) joint channel-traffic embedding, which is essential for network optimization, and (ii) practical construction using standard measurements, enabling network autonomy while striking a favorable fidelity-cost balance.

preprint2026arXiv

PerFlow: Physics-Embedded Rectified Flow for Efficient Reconstruction and Uncertainty Quantification of Spatiotemporal Dynamics

Reconstructing PDE-governed fields from sparse and irregular measurements is challenging due to their ill-posed nature. Deterministic surrogates are trained on dense fields that struggle with limited measurements and uncertainty quantification. Generative models, by learning distributions over spatiotemporal fields, can better handle sparsity and uncertainty. However, existing generative approaches enforce data consistency and PDE constraints simultaneously via sampling-time gradient guidance, resulting in slow and unstable inference. To this end, we propose PerFlow, a Physics-embedded rectified Flow for efficient sparse reconstruction and uncertainty quantification of spatiotemporal dynamics. PerFlow decouples observation conditioning from physics enforcement, performing guidance-free conditioning by feeding observations into rectified-flow dynamics while embedding hard physics via a constraint-preserving projection (e.g., incompressibility or conservation). Theoretically, we establish invariance guarantees to ensure that trajectories remain on the physics-consistent manifold throughout sampling. Experiments on various PDE systems demonstrate competitive reconstruction accuracy with sound physics consistency, while enabling efficient conditional sampling (e.g., 50 steps) and up to 320x faster inference than 2000-step guided diffusion baselines.

preprint2026arXiv

SAMamba3D: adapting Segment Anything for generalizable 3D segmentation of multiphase pore-scale images

Reliable segmentation of multiphase pore-scale X-ray images of rocks is necessary to quantify fluid saturation, connectivity, and interfacial geometry. However, current 3D segmentation methods are typically dataset-specific, requiring retraining or extensive fine-tuning whenever rock type, fluid pattern, scanner, or acquisition conditions change. Foundation models such as the Segment Anything Model (SAM) provide strong 2D boundary priors, but they are not directly applicable to 3D data. We present SAMamba3D, a parameter-efficient framework that adapts a largely frozen SAM encoder to generalizable 3D pore-scale segmentation by coupling it with Mamba-based volumetric context modeling and progressive cross-scale feature interaction. For sandstone and carbonate datasets, with different fluids, wettability, and scanning conditions, SAMamba3D matches or outperforms current 3D baselines while reducing the need for case-specific retraining. The resulting segmented images preserve physically meaningful descriptors, including fluid saturation, connectivity, and interface morphology, enabling more reliable and rapid analysis of large 3D multiphase images.

preprint2026arXiv

Think-J: Learning to Think for Generative LLM-as-a-Judge

LLM-as-a-Judge refers to the automatic modeling of preferences for responses generated by Large Language Models (LLMs), which is of significant importance for both LLM evaluation and reward modeling. Although generative LLMs have made substantial progress in various tasks, their performance as LLM-Judge still falls short of expectations. In this work, we propose Think-J, which improves generative LLM-as-a-Judge by learning how to think. We first utilized a small amount of curated data to develop the model with initial judgment thinking capabilities. Subsequently, we optimize the judgment thinking traces based on reinforcement learning (RL). We propose two methods for judgment thinking optimization, based on offline and online RL, respectively. The offline method requires training a critic model to construct positive and negative examples for learning. The online method defines rule-based reward as feedback for optimization. Experimental results showed that our approach can significantly enhance the evaluation capability of generative LLM-Judge, surpassing both generative and classifier-based LLM-Judge without requiring extra human annotations.

preprint2026arXiv

To Use AI as Dice of Possibilities with Timing Computation

The dominant noun-based modeling paradigm has fundamentally constrained AI development, precluding any adequate representation of the future as an open temporal dimension. This paper introduces a verb-based paradigm, together with precise definitions of \emph{timing computation} and \emph{possibility}, that enables AI to function as an effective instrument for realizing the grammar of our thought. Applied to longitudinal EHR data from 3,276 breast cancer patients, the framework empirically demonstrates: (1) automatic discovery of clinically significant patient trajectories, and (2) counterfactual timing deduction. Both results are purely data-driven, require no prior domain knowledge, and, to our knowledge, represent the first such demonstrations in the machine learning literature.

preprint2026arXiv

Two-stage Multi-beam Training for Multiuser Millimeter-Wave Communications

In this letter, we study an efficient multi-beam training method for multiuser millimeter-wave communication systems. Unlike the conventional single-beam training method that relies on exhaustive search, multi-beam training design faces a key challenge in balancing the trade-off between beam training overhead and success beam-identification rate, exacerbated by severe inter-beam interference. To tackle this challenge, we propose a new two-stage multi-beam training method with two distinct multi-beam patterns to enable fast and accurate user angle identification. Specifically, in the first stage, the antenna array is divided into sparse subarrays to generate multiple beams (with high array gains), for identifying candidate user angles. In the second stage, the array is redivided into dense subarrays to generate flexibly steered wide beams, for which a cross-validation method is employed to effectively resolve the remaining angular ambiguity in the first stage. Last, numerical results demonstrate that the proposed method significantly improves the success beam-identification rate compared to existing multi-beam training methods, while retaining or even reducing the required beam training overhead.

preprint2026arXiv

VeriCache: Turning Lossy KV Cache into Lossless LLM Inference

The large size of the KV cache has become a major bottleneck for serving LLMs with increasing context lengths. In response, many KV cache compression methods, such as token dropping and quantization, have been proposed. However, almost all of these methods are inherently lossy-despite minimal accuracy degradation for short outputs, their outputs increasingly diverge from full-KV-cache outputs as more tokens are decoded, which leads to catastrophic failures in code generation and tool calling. We present VeriCache, the first inference framework that ensures the same output as full-KV-cache decoding but largely preserves the high decoding throughput of a range of KV cache compression algorithms. VeriCache uses the compressed KV cache to draft tokens, then verifies them against the full KV cache. While it may seem like just speculative decoding, VeriCache requires addressing a key system challenge to work-keeping the full KV cache out of GPU memory and minimizing the overhead of swapping it in for verification. The insight is two-fold: (1) compressed-KV decoding can be parallelized with full-KV swap, because one is HBM-bandwidth-bound and the other is PCIe/network-bound, and (2) the compressed KV cache often produces output similar to the full KV cache, allowing a long drafting horizon to amortize each full-KV swap. VeriCache applies to both long-context decoding and remote prefix caching, supports a broad family of token-dropping and quantization methods through a uniform compressor interface, and composes with traditional speculative decoding. Experimental results show that VeriCache achieves up to 4X higher throughput than full-KV inference while producing identical outputs.

preprint2026arXiv

When Relations Break: Analyzing Relation Hallucination in Vision-Language Model Under Rotation and Noise

Vision-language models (VLMs) achieve strong multimodal performance but remain prone to relation hallucination, which requires accurate reasoning over inter-object interactions. We study the impact of visual perturbations, specifically rotation and noise, and show that even mild distortions significantly degrade relational reasoning across models and datasets. We further evaluate prompt-based augmentation and preprocessing strategies (orientation correction and denoising), finding that while they offer partial improvements, they do not fully resolve hallucinations. Our results reveal a gap between perceptual robustness and relational understanding, highlighting the need for more robust, geometry-aware VLMs.

preprint2026arXiv

Why Do Reasoning Models Lose Coverage? The Role of Data and Forks in the Road

Recent progress in large language models has led to the emergence of reasoning models, which have shown strong performance on complex tasks through specialized fine-tuning procedures. While these methods reliably improve pass@1 accuracy, prior works have observed that they show a coverage shrinkage behavior, where pass@k degrades relative to the base model. In this paper, we investigate the reasoning shrinkage arise under SFT-based post-training. We hypothesize that this behavior is driven by properties of the fine-tuning data, specifically related to decision points or "forks in the road" scenarios where model faces indecipherable patterns with multiple valid reasoning paths. To test this hypothesis, we design controlled case studies that simulate such decision-point settings, spanning indecipherable nodes in graph branching, and reasoning modes. By tracking post-training dynamics in these settings, we find that the shrinkage phenomenon is tightly correlated with the prevalence of decision-point scenarios in the training data. We also demonstrate that this shrinkage behavior can be partially mitigated through targeted data synthesis design of decision-points, and a more systematic diversity-encouraging decoding mechanism. Our findings identify data-centric factors as a key driver of shrinkage in reasoning models and highlight diversity-aware designs as an effective lever for controlling it.

preprint2025arXiv

A Tutorial on MIMO-OFDM ISAC: From Far-Field to Near-Field

Integrated sensing and communication (ISAC) is one of the key usage scenarios for future sixth-generation (6G) mobile communication networks, where communication and sensing (C&S) services are simultaneously provided through shared wireless spectrum, signal processing modules, hardware, and network infrastructure. Such an integration is strengthened by the technology trends in 6G, such as denser network nodes, larger antenna arrays, wider bandwidths, higher frequency bands, and more efficient utilization of spectrum and hardware resources, which incentivize and empower enhanced sensing capabilities. As the dominant waveform used in contemporary communication systems, orthogonal frequency division multiplexing (OFDM) is still expected to be a very competitive technology for 6G, rendering it necessary to thoroughly investigate the potential and challenges of OFDM ISAC. Thus, this paper aims to provide a comprehensive tutorial overview of ISAC systems enabled by large-scale multi-input multi-output (MIMO) and OFDM technologies and to discuss their fundamental principles, advantages, and enabling signal processing methods. To this end, a unified MIMO-OFDM ISAC system model is first introduced, followed by four frameworks for estimating parameters across the spatial, delay, and Doppler domains, including parallel one-domain, sequential one-domain, joint two-domain, and joint three-domain parameter estimation. Next, sensing algorithms and performance analyses are presented in detail for far-field scenarios where uniform plane wave (UPW) propagation is valid, followed by their extensions to near-field scenarios where uniform spherical wave (USW) characteristics need to be considered. Finally, this paper points out open challenges and outlines promising avenues for future research on MIMO-OFDM ISAC.

preprint2025arXiv

Frequency-switching Array Enhanced Physical-Layer Security in Terahertz Bands: A Movable Antenna Perspective

In this paper, we propose a new frequency-switching array (FSA) to enhance the physical-layer security (PLS) in the presence of multiple eavesdroppers (Eves), where the carrier frequency can be flexibly switched and small frequency offsets can be imposed on each antenna at the secrecy transmitter (Alice).First, we analytically show that by flexibly controlling the carrier frequency parameters, FSAs can effectively form uniform/non-uniform sparse arrays, hence resembling existing mechanically controlled movable antennas (MAs) via the control of inter-antenna spacing and providing additional degree-of-freedom in the beam manipulation.Although the proposed FSA suffers from additional path-gain attenuation in the received signals, it can overcome several hardware and signal processing issues incurred by MAs, such as limited positioning accuracy, extra hardware and energy cost.Then, a secrecy-rate maximization problem is formulated under the constraints on the frequency control.To shed useful insights, we first consider a secrecy-guaranteed problem with a null-steering constraint for which maximum ratio transmission beamformer is considered at Alice and the frequency offsets are set as uniform frequency increment.Interestingly, it is shown that the proposed FSA can flexibly realize null-steering over Eve in both the angular domain and range domain, thereby achieving improved PLS performance.Then, for the general case, we propose an efficient algorithm to solve the formulated non-convex optimization problem by using the block coordinate descent and projected gradient ascent techniques. Finally, numerical results demonstrate that the proposed FSA achieves superior secrecy rate performance over conventional fixed-position array, while it only suffers a slight secrecy rate loss than the existing mechanically controlled MA.

preprint2025arXiv

Ultrahigh-Energy Gamma-ray Emission Associated with Black Hole-Jet Systems

Black holes (BH), one of the most intriguing objects in the universe, can manifest themselves through electromagnetic radiation initiated by the accretion flow. Some stellar-mass BHs drive relativistic jets when accreting matter from their companion stars, forming microquasars. Non-thermal emission from the radio to tera-electronvolt (TeV) gamma-ray band has been observed from microquasars, indicating the acceleration of relativistic particles. Here we report detection of four microquasars (SS 433, V4641 Sgr, GRS 1915+105, MAXI J1820+070) of spectrum extending to the ultrahigh-energy (UHE; photon energy $E>100$ TeV) band and one microquasar (Cygnus X-1) of spectrum approaching 100 TeV, using the Large High Altitude Air Shower Observatory (LHAASO). Notably, the total emission associated with SS 433 cannot be interpreted with a single leptonic component. In the UHE band, its emission is in spatial coincidence with a giant atomic cloud, which is consistent with a hadronic origin. An elongated source is discovered from V4641 Sgr with the spectrum continuing up to 800 TeV. The detection of UHE gamma rays demonstrates that accreting BHs and their environments can operate as extremely efficient accelerators of particles out of 1 peta-electronvolt (PeV), suggesting microquasars to be important contributors to Galactic cosmic rays especially around the `knee' region.

preprint2024arXiv

Roth-type Theorem for high-power system in Piatetski-Shapiro primes (II)

We consider the nonlinear system $c_1p_1^d +c_2p_2^d + \dots + c_s p_s^d = 0$ with $c_1, c_2,\dots, c_s\in\mathbb Z$ being nonzero and satisfying $c_1 +c_2 + \dots + c_s = 0$. We show that for $s\ge 2\lfloor \frac{d^2}2\rfloor+1$ and $c\in\left(1, 1+c(d,s)\right)$, if the system has only $K$-trivial solutions in subset $\mathcal{A}$ of Piatetski-Shapiro primes up to $x$ and corresponding to $c$, then $|\mathcal{A}| \ll \frac{x^{\frac1c}}{\log x} $$\left(\log \log \log \log x\right)^{\frac{2-s}{dc}+\varepsilon}$.

preprint2023arXiv

A Comprehensive Study on Optimizing Systems with Data Processing Units

New hardware, such as SmartNICs, has been released to offload network applications in data centers. Off-path SmartNICs, a type of multi-core SoC SmartNICs, have attracted the attention of many researchers. Unfortunatelly, they lack the fully exploration of off-path SmartNICs. In this paper, we use a BlueField SmartNIC as an example to conduct a systematical study on the advantages and disadvantages of off-path SmartNICs. We make a detailed performance characterization on an off-path SmartNIC including computing power and network communication overhead, and propose the following advices: 1) Directly utilize the specific accelerators on the SmartNIC to offload applications; 2) Offload latency-insensitive background processing to the SmartNIC to reduce the load on the host; 3) Regard the SmartNIC as a new endpoint in the network to expand the computing power and storage resources of the server host; 4) Avoid directly employing the design method for systems based on on-path SmartNICs. We apply these advices to several use cases and show the performance improvements.

preprint2023arXiv

Adaptive Depth Graph Attention Networks

As one of the most popular GNN architectures, the graph attention networks (GAT) is considered the most advanced learning architecture for graph representation and has been widely used in various graph mining tasks with impressive results. However, since GAT was proposed, none of the existing studies have provided systematic insight into the relationship between the performance of GAT and the number of layers, which is a critical issue in guiding model performance improvement. In this paper, we perform a systematic experimental evaluation and based on the experimental results, we find two important facts: (1) the main factor limiting the accuracy of the GAT model as the number of layers increases is the oversquashing phenomenon; (2) among the previous improvements applied to the GNN model, only the residual connection can significantly improve the GAT model performance. We combine these two important findings to provide a theoretical explanation that it is the residual connection that mitigates the loss of original feature information due to oversquashing and thus improves the deep GAT model performance. This provides empirical insights and guidelines for researchers to design the GAT variant model with appropriate depth and well performance. To demonstrate the effectiveness of our proposed guidelines, we propose a GAT variant model-ADGAT that adaptively selects the number of layers based on the sparsity of the graph, and experimentally demonstrate that the effectiveness of our model is significantly improved over the original GAT.

preprint2023arXiv

JEPOO: Highly Accurate Joint Estimation of Pitch, Onset and Offset for Music Information Retrieval

Melody extraction is a core task in music information retrieval, and the estimation of pitch, onset and offset are key sub-tasks in melody extraction. Existing methods have limited accuracy, and work for only one type of data, either single-pitch or multipitch. In this paper, we propose a highly accurate method for joint estimation of pitch, onset and offset, named JEPOO. We address the challenges of joint learning optimization and handling both single-pitch and multi-pitch data through novel model design and a new optimization technique named Pareto modulated loss with loss weight regularization. This is the first method that can accurately handle both single-pitch and multi-pitch music data, and even a mix of them. A comprehensive experimental study on a wide range of real datasets shows that JEPOO outperforms state-ofthe-art methods by up to 10.6%, 8.3% and 10.3% for the prediction of Pitch, Onset and Offset, respectively, and JEPOO is robust for various types of data and instruments. The ablation study shows the effectiveness of each component of JEPOO.

preprint2022arXiv

"Adversarial Examples" for Proof-of-Learning

In S&P '21, Jia et al. proposed a new concept/mechanism named proof-of-learning (PoL), which allows a prover to demonstrate ownership of a machine learning model by proving integrity of the training procedure. It guarantees that an adversary cannot construct a valid proof with less cost (in both computation and storage) than that made by the prover in generating the proof. A PoL proof includes a set of intermediate models recorded during training, together with the corresponding data points used to obtain each recorded model. Jia et al. claimed that an adversary merely knowing the final model and training dataset cannot efficiently find a set of intermediate models with correct data points. In this paper, however, we show that PoL is vulnerable to ``adversarial examples''! Specifically, in a similar way as optimizing an adversarial example, we could make an arbitrarily-chosen data point ``generate'' a given model, hence efficiently generating intermediate models with correct data points. We demonstrate, both theoretically and empirically, that we are able to generate a valid proof with significantly less cost than generating a proof by the prover.

preprint2022arXiv

A Benchmark and Comprehensive Survey on Knowledge Graph Entity Alignment via Representation Learning

In the last few years, the interest in knowledge bases has grown exponentially in both the research community and the industry due to their essential role in AI applications. Entity alignment is an important task for enriching knowledge bases. This paper provides a comprehensive tutorial-type survey on representative entity alignment techniques that use the new approach of representation learning. We present a framework for capturing the key characteristics of these techniques, propose two datasets to address the limitation of existing benchmark datasets, and conduct extensive experiments using the proposed datasets. The framework gives a clear picture of how the techniques work. The experiments yield important results about the empirical performance of the techniques and how various factors affect the performance. One important observation not stressed by previous work is that techniques making good use of attribute triples and relation predicates as features stand out as winners.

preprint2022arXiv

A sufficient and necessary condition of generalized polynomial Liénard systems with global centers

The aim of this paper is to give a sufficient and necessary condition of the generalized polynomial Liénard system with a global center (including linear typer and nilpotent type). Recently, Llibre and Valls [J. Differential Equations, 330 (2022), 66-80] gave a sufficient and necessary condition of the generalized polynomial Liénard system with a linear type global center. It is easy to see that our sufficient and necessary condition is more easy by comparison. In particular, we provide the explicit expressions of all the generalized polynomial Liénard differential systems of degree 5 having a global center at the origin and the explicit expression of a generalized polynomial Liénard differential system of indefinite degree having a global center at the origin.

preprint2022arXiv

A Survey on Channel Estimation and Practical Passive Beamforming Design for Intelligent Reflecting Surface Aided Wireless Communications

Intelligent reflecting surface (IRS) has emerged as a key enabling technology to realize smart and reconfigurable radio environment for wireless communications, by digitally controlling the signal reflection via a large number of passive reflecting elements in real-time. Different from conventional wireless communication techniques that only adapt to but have no or limited control over dynamic wireless channels, IRS provides a new and cost-effective means to combat the wireless channel impairments in a proactive manner. However, despite its great potential, IRS faces new and unique challenges in its efficient integration into wireless communication systems, especially its channel estimation and passive beamforming design under various practical hardware constraints. In this paper, we provide a comprehensive survey on the up-to-date research in IRS-aided wireless communications, with an emphasis on the promising solutions to tackle practical design issues. Furthermore, we discuss new and emerging IRS architectures and applications as well as their practical design problems to motivate future research.

preprint2022arXiv

A Survey on Gradient Inversion: Attacks, Defenses and Future Directions

Recent studies have shown that the training samples can be recovered from gradients, which are called Gradient Inversion (GradInv) attacks. However, there remains a lack of extensive surveys covering recent advances and thorough analysis of this issue. In this paper, we present a comprehensive survey on GradInv, aiming to summarize the cutting-edge research and broaden the horizons for different domains. Firstly, we propose a taxonomy of GradInv attacks by characterizing existing attacks into two paradigms: iteration- and recursion-based attacks. In particular, we dig out some critical ingredients from the iteration-based attacks, including data initialization, model training and gradient matching. Second, we summarize emerging defense strategies against GradInv attacks. We find these approaches focus on three perspectives covering data obscuration, model improvement and gradient protection. Finally, we discuss some promising directions and open problems for further research.

preprint2022arXiv

Achievable Rate Maximization for Underlay Spectrum Sharing MIMO System with Intelligent Reflecting Surface

In this letter, the achievable rate maximization problem is considered for intelligent reflecting surface (IRS) assisted multiple-input multiple-output (MIMO) systems in an underlay spectrum sharing scenario, subject to interference power constraints at the primary users. The formulated non-convex optimization problem is challenging to solve due to its non-convexity as well as coupling design variables in the constraints. Different from existing works that are mostly based on alternating optimization (AO), we propose a penalty dual decomposition based gradient projection (PDDGP) algorithm to solve this problem. We also provide a convergence proof and a complexity analysis for the proposed algorithm. We benchmark the proposed algorithm against two known solutions, namely a minimum mean-square error based AO algorithm and an inner approximation method with block coordinate descent. Specifically, the complexity of the proposed algorithm grows linearly with respect to the number of reflecting elements at the IRS, while that of the two benchmark methods grows with the third power of the number of IRS elements. Moreover, numerical results show that the proposed PDDGP algorithm yields considerably higher achievable rate than the benchmark solutions.

preprint2022arXiv

Active and Passive IRS Jointly Aided Communication: Deployment Design and Achievable Rate

In this letter, we study the wireless point-to-point communication from a transmitter (Tx) to a receiver (Rx), which is jointly aided by an active intelligent reflecting surface (AIRS) and a passive IRS (PIRS). We consider two practical transmission schemes by deploying the two IRSs in different orders, namely, Tx$\rightarrow$PIRS$\rightarrow$AIRS$\rightarrow$Rx (TPAR) and Tx$\rightarrow$AIRS$\rightarrow$PIRS$\rightarrow$Rx (TAPR). Assuming line-of-sight channels, we derive the achievable rates for the two schemes by optimizing the placement of the AIRS with the location of the PIRS fixed. Our analysis shows that when the number of PIRS elements and/or the AIRS amplification power is small, the AIRS should be deployed closer to the Rx in both schemes, and TAPR outperforms TPAR with their respective optimized AIRS/PIRS placement. Simulation results validate our analysis and show the considerable performance gain achieved by the jointly optimized AIRS/PIRS deployment over the baseline double-PIRS system under the same power and IRS element budgets.

preprint2022arXiv

Active-Passive IRS aided Wireless Communication: New Hybrid Architecture and Elements Allocation Optimization

Intelligent reflecting surface (IRS) has emerged as a promising technology to enhance the wireless communication network coverage and capacity by dynamically controlling the radio signal propagation environment. In contrast to the existing works that considered active or passive IRS only, we propose in this paper a new hybrid active-passive IRS architecture that consists of both active and passive reflecting elements, thus achieving their combined advantages flexibly. Under a practical channel setup with Rician fading where only the statistical channel state information (CSI) is available, we study the hybrid IRS design in a multi-user communication system. Specifically, we formulate an optimization problem to maximize the achievable ergodic capacity of the worst-case user by designing the hybrid IRS beamforming and active/passive elements allocation based on the statistical CSI, subject to various practical constraints on the active-element amplification factor and amplification power consumption, as well as the total active and passive elements deployment budget. To solve this challenging problem, we first approximate the ergodic capacity in a simpler form and then propose an efficient algorithm to solve the problem optimally. Moreover, we show that for the special case with all channels to be line-of-sight (LoS), only active elements need to be deployed when the total deployment budget is sufficiently small, while both active and passive elements should be deployed with a decreasing number ratio when the budget increases and exceeds a certain threshold. Finally, numerical results are presented which demonstrate the performance gains of the proposed hybrid IRS architecture and its optimal design over the conventional schemes with active/passive IRS only under various practical system setups.

preprint2022arXiv

Adversarial attacks and defenses in Speaker Recognition Systems: A survey

Speaker recognition has become very popular in many application scenarios, such as smart homes and smart assistants, due to ease of use for remote control and economic-friendly features. The rapid development of SRSs is inseparable from the advancement of machine learning, especially neural networks. However, previous work has shown that machine learning models are vulnerable to adversarial attacks in the image domain, which inspired researchers to explore adversarial attacks and defenses in Speaker Recognition Systems (SRS). Unfortunately, existing literature lacks a thorough review of this topic. In this paper, we fill this gap by performing a comprehensive survey on adversarial attacks and defenses in SRSs. We first introduce the basics of SRSs and concepts related to adversarial attacks. Then, we propose two sets of criteria to evaluate the performance of attack methods and defense methods in SRSs, respectively. After that, we provide taxonomies of existing attack methods and defense methods, and further review them by employing our proposed criteria. Finally, based on our review, we find some open issues and further specify a number of future directions to motivate the research of SRSs security.

preprint2022arXiv

AdvSmo: Black-box Adversarial Attack by Smoothing Linear Structure of Texture

Black-box attacks usually face two problems: poor transferability and the inability to evade the adversarial defense. To overcome these shortcomings, we create an original approach to generate adversarial examples by smoothing the linear structure of the texture in the benign image, called AdvSmo. We construct the adversarial examples without relying on any internal information to the target model and design the imperceptible-high attack success rate constraint to guide the Gabor filter to select appropriate angles and scales to smooth the linear texture from the input images to generate adversarial examples. Benefiting from the above design concept, AdvSmo will generate adversarial examples with strong transferability and solid evasiveness. Finally, compared to the four advanced black-box adversarial attack methods, for the eight target models, the results show that AdvSmo improves the average attack success rate by 9% on the CIFAR-10 and 16% on the Tiny-ImageNet dataset compared to the best of these attack methods.

preprint2022arXiv

An Interpretable Neuro-Symbolic Reasoning Framework for Task-Oriented Dialogue Generation

We study the interpretability issue of task-oriented dialogue systems in this paper. Previously, most neural-based task-oriented dialogue systems employ an implicit reasoning strategy that makes the model predictions uninterpretable to humans. To obtain a transparent reasoning process, we introduce neuro-symbolic to perform explicit reasoning that justifies model decisions by reasoning chains. Since deriving reasoning chains requires multi-hop reasoning for task-oriented dialogues, existing neuro-symbolic approaches would induce error propagation due to the one-phase design. To overcome this, we propose a two-phase approach that consists of a hypothesis generator and a reasoner. We first obtain multiple hypotheses, i.e., potential operations to perform the desired task, through the hypothesis generator. Each hypothesis is then verified by the reasoner, and the valid one is selected to conduct the final prediction. The whole system is trained by exploiting raw textual dialogues without using any reasoning chain annotations. Experimental studies on two public benchmark datasets demonstrate that the proposed approach not only achieves better results, but also introduces an interpretable decision process.

preprint2022arXiv

An Open Natural Language Processing Development Framework for EHR-based Clinical Research: A case demonstration using the National COVID Cohort Collaborative (N3C)

While we pay attention to the latest advances in clinical natural language processing (NLP), we can notice some resistance in the clinical and translational research community to adopt NLP models due to limited transparency, interpretability, and usability. In this study, we proposed an open natural language processing development framework. We evaluated it through the implementation of NLP algorithms for the National COVID Cohort Collaborative (N3C). Based on the interests in information extraction from COVID-19 related clinical notes, our work includes 1) an open data annotation process using COVID-19 signs and symptoms as the use case, 2) a community-driven ruleset composing platform, and 3) a synthetic text data generation workflow to generate texts for information extraction tasks without involving human subjects. The corpora were derived from texts from three different institutions (Mayo Clinic, University of Kentucky, University of Minnesota). The gold standard annotations were tested with a single institution's (Mayo) ruleset. This resulted in performances of 0.876, 0.706, and 0.694 in F-scores for Mayo, Minnesota, and Kentucky test datasets, respectively. The study as a consortium effort of the N3C NLP subgroup demonstrates the feasibility of creating a federated NLP algorithm development and benchmarking platform to enhance multi-institution clinical NLP study and adoption. Although we use COVID-19 as a use case in this effort, our framework is general enough to be applied to other domains of interest in clinical NLP.

preprint2022arXiv

AutoDES: AutoML Pipeline Generation of Classification with Dynamic Ensemble Strategy Selection

Automating machine learning has achieved remarkable technological developments in recent years, and building an automated machine learning pipeline is now an essential task. The model ensemble is the technique of combining multiple models to get a better and more robust model. However, existing automated machine learning tends to be simplistic in handling the model ensemble, where the ensemble strategy is fixed, such as stacked generalization. There have been many techniques on different ensemble methods, especially ensemble selection, and the fixed ensemble strategy limits the upper limit of the model's performance. In this article, we present a novel framework for automated machine learning. Our framework incorporates advances in dynamic ensemble selection, and to our best knowledge, our approach is the first in the field of AutoML to search and optimize ensemble strategies. In the comparison experiments, our method outperforms the state-of-the-art automated machine learning frameworks with the same CPU time in 42 classification datasets from the OpenML platform. Ablation experiments on our framework validate the effectiveness of our proposed method.

preprint2022arXiv

BARS: Towards Open Benchmarking for Recommender Systems

The past two decades have witnessed the rapid development of personalized recommendation techniques. Despite significant progress made in both research and practice of recommender systems, to date, there is a lack of a widely-recognized benchmarking standard in this field. Many existing studies perform model evaluations and comparisons in an ad-hoc manner, for example, by employing their own private data splits or using different experimental settings. Such conventions not only increase the difficulty in reproducing existing studies, but also lead to inconsistent experimental results among them. This largely limits the credibility and practical value of research results in this field. To tackle these issues, we present an initiative project (namely BARS) aiming for open benchmarking for recommender systems. In comparison to some earlier attempts towards this goal, we take a further step by setting up a standardized benchmarking pipeline for reproducible research, which integrates all the details about datasets, source code, hyper-parameter settings, running logs, and evaluation results. The benchmark is designed with comprehensiveness and sustainability in mind. It covers both matching and ranking tasks, and also enables researchers to easily follow and contribute to the research in this field. This project will not only reduce the redundant efforts of researchers to re-implement or re-run existing baselines, but also drive more solid and reproducible research on recommender systems. We would like to call upon everyone to use the BARS benchmark for future evaluation, and contribute to the project through the portal at: https://openbenchmark.github.io/BARS.

preprint2022arXiv

Bridge the Gap between Supervised and Unsupervised Learning for Fine-Grained Classification

Unsupervised learning technology has caught up with or even surpassed supervised learning technology in general object classification (GOC) and person re-identification (re-ID). However, it is found that the unsupervised learning of fine-grained visual classification (FGVC) is more challenging than GOC and person re-ID. In order to bridge the gap between unsupervised and supervised learning for FGVC, we investigate the essential factors (including feature extraction, clustering, and contrastive learning) for the performance gap between supervised and unsupervised FGVC. Furthermore, we propose a simple, effective, and practical method, termed as UFCL, to alleviate the gap. Three key issues are concerned and improved: First, we introduce a robust and powerful backbone, ResNet50-IBN, which has an ability of domain adaptation when we transfer ImageNet pre-trained models to FGVC tasks. Next, we propose to introduce HDBSCAN instead of DBSCAN to do clustering, which can generate better clusters for adjacent categories with fewer hyper-parameters. Finally, we propose a weighted feature agent and its updating mechanism to do contrastive learning by using the pseudo labels with inevitable noise, which can improve the optimization process of learning the parameters of the network. The effectiveness of our UFCL is verified on CUB-200-2011, Oxford-Flowers, Oxford-Pets, Stanford-Dogs, Stanford-Cars and FGVC-Aircraft datasets. Under the unsupervised FGVC setting, we achieve state-of-the-art results, and analyze the key factors and the important parameters to provide a practical guidance.

preprint2022arXiv

CancerBERT: a BERT model for Extracting Breast Cancer Phenotypes from Electronic Health Records

Accurate extraction of breast cancer patients' phenotypes is important for clinical decision support and clinical research. Current models do not take full advantage of cancer domain-specific corpus, whether pre-training Bidirectional Encoder Representations from Transformer model on cancer-specific corpus could improve the performances of extracting breast cancer phenotypes from texts data remains to be explored. The objective of this study is to develop and evaluate the CancerBERT model for extracting breast cancer phenotypes from clinical texts in electronic health records. This data used in the study included 21,291 breast cancer patients diagnosed from 2010 to 2020, patients' clinical notes and pathology reports were collected from the University of Minnesota Clinical Data Repository (UMN). Results: About 3 million clinical notes and pathology reports in electronic health records for 21,291 breast cancer patients were collected to train the CancerBERT model. 200 pathology reports and 50 clinical notes of breast cancer patients that contain 9,685 sentences and 221,356 tokens were manually annotated by two annotators. 20% of the annotated data was used as a test set. Our CancerBERT model achieved the best performance with macro F1 scores equal to 0.876 (95% CI, 0.896-0.902) for exact match and 0.904 (95% CI, 0.896-0.902) for the lenient match. The NER models we developed would facilitate the automated information extraction from clinical texts to further help clinical decision support. Conclusions and Relevance: In this study, we focused on the breast cancer-related concepts extraction from EHR data and obtained a comprehensive annotated dataset that contains 7 types of breast cancer-related concepts. The CancerBERT model with customized vocabulary could significantly improve the performance for extracting breast cancer phenotypes from clinical texts.

preprint2022arXiv

Code Comment Inconsistency Detection with BERT and Longformer

Comments, or natural language descriptions of source code, are standard practice among software developers. By communicating important aspects of the code such as functionality and usage, comments help with software project maintenance. However, when the code is modified without an accompanying correction to the comment, an inconsistency between the comment and code can arise, which opens up the possibility for developer confusion and bugs. In this paper, we propose two models based on BERT (Devlin et al., 2019) and Longformer (Beltagy et al., 2020) to detect such inconsistencies in a natural language inference (NLI) context. Through an evaluation on a previously established corpus of comment-method pairs both during and after code changes, we demonstrate that our models outperform multiple baselines and yield comparable results to the state-of-the-art models that exclude linguistic and lexical features. We further discuss ideas for future research in using pretrained language models for both inconsistency detection and automatic comment updating.

preprint2022arXiv

CONTaiNER: Few-Shot Named Entity Recognition via Contrastive Learning

Named Entity Recognition (NER) in Few-Shot setting is imperative for entity tagging in low resource domains. Existing approaches only learn class-specific semantic features and intermediate representations from source domains. This affects generalizability to unseen target domains, resulting in suboptimal performances. To this end, we present CONTaiNER, a novel contrastive learning technique that optimizes the inter-token distribution distance for Few-Shot NER. Instead of optimizing class-specific attributes, CONTaiNER optimizes a generalized objective of differentiating between token categories based on their Gaussian-distributed embeddings. This effectively alleviates overfitting issues originating from training domains. Our experiments in several traditional test domains (OntoNotes, CoNLL'03, WNUT '17, GUM) and a new large scale Few-Shot NER dataset (Few-NERD) demonstrate that on average, CONTaiNER outperforms previous methods by 3%-13% absolute F1 points while showing consistent performance trends, even in challenging scenarios where previous approaches could not achieve appreciable performance.

preprint2022arXiv

Contrastive Learning with Positive-Negative Frame Mask for Music Representation

Self-supervised learning, especially contrastive learning, has made an outstanding contribution to the development of many deep learning research fields. Recently, researchers in the acoustic signal processing field noticed its success and leveraged contrastive learning for better music representation. Typically, existing approaches maximize the similarity between two distorted audio segments sampled from the same music. In other words, they ensure a semantic agreement at the music level. However, those coarse-grained methods neglect some inessential or noisy elements at the frame level, which may be detrimental to the model to learn the effective representation of music. Towards this end, this paper proposes a novel Positive-nEgative frame mask for Music Representation based on the contrastive learning framework, abbreviated as PEMR. Concretely, PEMR incorporates a Positive-Negative Mask Generation module, which leverages transformer blocks to generate frame masks on the Log-Mel spectrogram. We can generate self-augmented negative and positive samples by masking important components or inessential components, respectively. We devise a novel contrastive learning objective to accommodate both self-augmented positives/negatives sampled from the same music. We conduct experiments on four public datasets. The experimental results of two music-related downstream tasks, music classification, and cover song identification, demonstrate the generalization ability and transferability of music representation learned by PEMR.

preprint2022arXiv

Deep Manifold Learning with Graph Mining

Admittedly, Graph Convolution Network (GCN) has achieved excellent results on graph datasets such as social networks, citation networks, etc. However, softmax used as the decision layer in these frameworks is generally optimized with thousands of iterations via gradient descent. Furthermore, due to ignoring the inner distribution of the graph nodes, the decision layer might lead to an unsatisfactory performance in semi-supervised learning with less label support. To address the referred issues, we propose a novel graph deep model with a non-gradient decision layer for graph mining. Firstly, manifold learning is unified with label local-structure preservation to capture the topological information of the nodes. Moreover, owing to the non-gradient property, closed-form solutions is achieved to be employed as the decision layer for GCN. Particularly, a joint optimization method is designed for this graph model, which extremely accelerates the convergence of the model. Finally, extensive experiments show that the proposed model has achieved state-of-the-art performance compared to the current models.

preprint2022arXiv

Deep Random Vortex Method for Simulation and Inference of Navier-Stokes Equations

Navier-Stokes equations are significant partial differential equations that describe the motion of fluids such as liquids and air. Due to the importance of Navier-Stokes equations, the development on efficient numerical schemes is important for both science and engineer. Recently, with the development of AI techniques, several approaches have been designed to integrate deep neural networks in simulating and inferring the fluid dynamics governed by incompressible Navier-Stokes equations, which can accelerate the simulation or inferring process in a mesh-free and differentiable way. In this paper, we point out that the capability of existing deep Navier-Stokes informed methods is limited to handle non-smooth or fractional equations, which are two critical situations in reality. To this end, we propose the \emph{Deep Random Vortex Method} (DRVM), which combines the neural network with a random vortex dynamics system equivalent to the Navier-Stokes equation. Specifically, the random vortex dynamics motivates a Monte Carlo based loss function for training the neural network, which avoids the calculation of derivatives through auto-differentiation. Therefore, DRVM not only can efficiently solve Navier-Stokes equations involving rough path, non-differentiable initial conditions and fractional operators, but also inherits the mesh-free and differentiable benefits of the deep-learning-based solver. We conduct experiments on the Cauchy problem, parametric solver learning, and the inverse problem of both 2-d and 3-d incompressible Navier-Stokes equations. The proposed method achieves accurate results for simulation and inference of Navier-Stokes equations. Especially for the cases that include singular initial conditions, DRVM significantly outperforms existing PINN method.

preprint2022arXiv

Detecting Arbitrary Order Beneficial Feature Interactions for Recommender Systems

Detecting beneficial feature interactions is essential in recommender systems, and existing approaches achieve this by examining all the possible feature interactions. However, the cost of examining all the possible higher-order feature interactions is prohibitive (exponentially growing with the order increasing). Hence existing approaches only detect limited order (e.g., combinations of up to four features) beneficial feature interactions, which may miss beneficial feature interactions with orders higher than the limitation. In this paper, we propose a hypergraph neural network based model named HIRS. HIRS is the first work that directly generates beneficial feature interactions of arbitrary orders and makes recommendation predictions accordingly. The number of generated feature interactions can be specified to be much smaller than the number of all the possible interactions and hence, our model admits a much lower running time. To achieve an effective algorithm, we exploit three properties of beneficial feature interactions, and propose deep-infomax-based methods to guide the interaction generation. Our experimental results show that HIRS outperforms state-of-the-art algorithms by up to 5% in terms of recommendation accuracy.

preprint2022arXiv

DYLE: Dynamic Latent Extraction for Abstractive Long-Input Summarization

Transformer-based models have achieved state-of-the-art performance on short-input summarization. However, they still struggle with summarizing longer text. In this paper, we present DYLE, a novel dynamic latent extraction approach for abstractive long-input summarization. DYLE jointly trains an extractor and a generator and treats the extracted text snippets as the latent variable, allowing dynamic snippet-level attention weights during decoding. To provide adequate supervision, we propose simple yet effective heuristics for oracle extraction as well as a consistency loss term, which encourages the extractor to approximate the averaged dynamic weights predicted by the generator. We evaluate our method on different long-document and long-dialogue summarization tasks: GovReport, QMSum, and arXiv. Experiment results show that DYLE outperforms all existing methods on GovReport and QMSum, with gains up to 6.1 ROUGE, while yielding strong results on arXiv. Further analysis shows that the proposed dynamic weights provide interpretability of our generation process.

preprint2022arXiv

Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver

The recognition of entanglement states is a notoriously difficult problem when no prior information is available. Here, we propose an efficient quantum adversarial bipartite entanglement detection scheme to address this issue. Our proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits, where a two-outcome measurement can be used to query a classical binary result about whether the input state is bipartite entangled or not. In principle, for an $N$-qubit quantum state, the runtime complexity of our proposal is $O(\text{poly}(N)T)$ with $T$ being the number of iterations. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states. Our work paves the way for using near-term quantum machines to tackle entanglement detection on multipartite entangled quantum systems.

preprint2022arXiv

Efficient Non-parametric Bayesian Hawkes Processes

In this paper, we develop an efficient nonparametric Bayesian estimation of the kernel function of Hawkes processes. The non-parametric Bayesian approach is important because it provides flexible Hawkes kernels and quantifies their uncertainty. Our method is based on the cluster representation of Hawkes processes. Utilizing the finite support assumption of the Hawkes process, we efficiently sample random branching structures and thus, we split the Hawkes process into clusters of Poisson processes. We derive two algorithms -- a block Gibbs sampler and a maximum a posteriori estimator based on expectation maximization -- and we show that our methods have a linear time complexity, both theoretically and empirically. On synthetic data, we show our methods to be able to infer flexible Hawkes triggering kernels. On two large-scale Twitter diffusion datasets, we show that our methods outperform the current state-of-the-art in goodness-of-fit and that the time complexity is linear in the size of the dataset. We also observe that on diffusions related to online videos, the learned kernels reflect the perceived longevity for different content types such as music or pets videos.

preprint2022arXiv

Empowering Base Stations with Co-Site Intelligent Reflecting Surfaces: User Association, Channel Estimation and Reflection Optimization

Intelligent reflecting surface (IRS) has emerged as a promising technique to enhance wireless communication performance cost effectively. The existing literature has mainly considered IRS being deployed near user terminals to improve their performance. However, this approach may incur a high cost if IRSs need to be densely deployed in the network to cater to random user locations. To avoid such high deployment cost, in this paper we consider a new IRS aided wireless network architecture, where IRSs are deployed in the vicinity of each base station (BS) to assist in its communications with distributed users regardless of their locations. Besides significantly enhancing IRSs' signal coverage, this scheme helps reduce the IRS associated channel estimation overhead as compared to conventional user-side IRSs, by exploiting the nearly static BS-IRS channels over short distance. For this scheme, we propose a new two stage transmission protocol to achieve IRS channel estimation and reflection optimization for uplink data transmission efficiently. In addition, we propose effective methods for solving the user IRS association problem based on long term channel knowledge and the selected user IRS BS cascaded channel estimation problem. Finally, all IRSs' passive reflections are jointly optimized with the BS's multi-antenna receive combining to maximize the minimum achievable rate among all users for data transmission. Numerical results show that the proposed co site IRS empowered BS scheme can achieve significant performance gains over the conventional BS without co site IRS and existing schemes for IRS channel estimation and reflection optimization, thus enabling an appealing low cost and high performance BS design for future wireless networks.

preprint2022arXiv

Environment-Aware Hybrid Beamforming by Leveraging Channel Knowledge Map

Hybrid analog/digital beamforming is a promising technique to realize millimeter wave (mmWave) massive multiple-input multiple-output (MIMO) systems cost-effectively. However, existing hybrid beamforming designs mainly rely on real-time channel training or beam sweeping to find the desired beams, which incurs prohibitive overhead due to a large number of antennas at both the transmitter and receiver with only limited radio frequency (RF) chains. To resolve this challenging issue, in this paper, we propose a new environment-aware hybrid beamforming technique that requires only light real-time training, by leveraging the useful tool of channel knowledge map (CKM) with the user's location information. CKM is a site-specific database, which offers location-specific channel-relevant information to facilitate or even obviate the acquisition of real-time channel state information (CSI). Two specific types of CKM are proposed in this paper for hybrid beamforming design in mmWave massive MIMO systems, namely channel angle map (CAM) and beam index map (BIM). It is shown that compared with existing environment-unaware schemes, the proposed environment-aware hybrid beamforming scheme based on CKM can drastically improve the effective communication rate, even under moderate user location errors, thanks to its great saving of the prohibitive real-time training overhead.

preprint2022arXiv

FedOCR: Communication-Efficient Federated Learning for Scene Text Recognition

While scene text recognition techniques have been widely used in commercial applications, data privacy has rarely been taken into account by this research community. Most existing algorithms have assumed a set of shared or centralized training data. However, in practice, data may be distributed on different local devices that can not be centralized to share due to the privacy restrictions. In this paper, we study how to make use of decentralized datasets for training a robust scene text recognizer while keeping them stay on local devices. To the best of our knowledge, we propose the first framework leveraging federated learning for scene text recognition, which is trained with decentralized datasets collaboratively. Hence we name it FedOCR. To make FedCOR fairly suitable to be deployed on end devices, we make two improvements including using lightweight models and hashing techniques. We argue that both are crucial for FedOCR in terms of the communication efficiency of federated learning. The simulations on decentralized datasets show that the proposed FedOCR achieves competitive results to the models that are trained with centralized data, with fewer communication costs and higher-level privacy-preserving.

preprint2022arXiv

Flavor Diagonal Nucleon Charges

This talk provides an update on the calculation of matrix elements of flavor diagonal axial, scalar and tensor quark bilinear operators between the nucleon ground state. The simulations are done using Wilson-clover fermions on a sea of eight 2+1+1-flavor HISQ ensembles generated by the MILC collaboration. We discuss the signal in the connected and disconnected contributions, calculation of the renormalization constants and mixing in the RI-sMOM scheme, and control over the simultaneous chiral-continuum-finite-volume fit used to extract the final charges.

preprint2022arXiv

FRIB: Low-poisoning Rate Invisible Backdoor Attack based on Feature Repair

During the generation of invisible backdoor attack poisoned data, the feature space transformation operation tends to cause the loss of some poisoned features and weakens the mapping relationship between source images with triggers and target labels, resulting in the need for a higher poisoning rate to achieve the corresponding backdoor attack success rate. To solve the above problems, we propose the idea of feature repair for the first time and introduce the blind watermark technique to repair the poisoned features lost during the generation of poisoned data. Under the premise of ensuring consistent labeling, we propose a low-poisoning rate invisible backdoor attack based on feature repair, named FRIB. Benefiting from the above design concept, the new method enhances the mapping relationship between the source images with triggers and the target labels, and increases the degree of misleading DNNs, thus achieving a high backdoor attack success rate with a very low poisoning rate. Ultimately, the detailed experimental results show that the goal of achieving a high success rate of backdoor attacks with a very low poisoning rate is achieved on all MNIST, CIFAR10, GTSRB, and ImageNet datasets.

preprint2022arXiv

Generalised Image Outpainting with U-Transformer

In this paper, we develop a novel transformer-based generative adversarial neural network called U-Transformer for generalised image outpainting problem. Different from most present image outpainting methods conducting horizontal extrapolation, our generalised image outpainting could extrapolate visual context all-side around a given image with plausible structure and details even for complicated scenery, building, and art images. Specifically, we design a generator as an encoder-to-decoder structure embedded with the popular Swin Transformer blocks. As such, our novel neural network can better cope with image long-range dependencies which are crucially important for generalised image outpainting. We propose additionally a U-shaped structure and multi-view Temporal Spatial Predictor (TSP) module to reinforce image self-reconstruction as well as unknown-part prediction smoothly and realistically. By adjusting the predicting step in the TSP module in the testing stage, we can generate arbitrary outpainting size given the input sub-image. We experimentally demonstrate that our proposed method could produce visually appealing results for generalized image outpainting against the state-of-the-art image outpainting approaches.

preprint2022arXiv

How to Deploy Intelligent Reflecting Surfaces in Wireless Network: BS-side, User-side, or Both Sides?

The performance of wireless communication systems is fundamentally constrained by the random and uncontrollable wireless channel. By leveraging the recent advance in digitally-controlled metasurface, intelligent reflecting surface (IRS) has emerged as a promising solution to enhance the wireless network performance by smartly reconfiguring the radio propagation environment. Despite the substantial research on IRS-aided communications, this article addresses the important issue of how to deploy IRSs in a wireless network to achieve its optimum performance. We first compare the two conventional strategies of deploying IRS at the side of base station or distributed users in terms of various communication performance metrics, and then propose a new hybrid IRS deployment strategy by combining their complementary advantages. Moreover, the main challenges in optimizing IRS deployment as well as their promising solutions are discussed. A case study is also presented to compare the performance of different IRS deployment strategies and draw useful insights for practical design.

preprint2022arXiv

Improving Transferability for Domain Adaptive Detection Transformers

DETR-style detectors stand out amongst in-domain scenarios, but their properties in domain shift settings are under-explored. This paper aims to build a simple but effective baseline with a DETR-style detector on domain shift settings based on two findings. For one, mitigating the domain shift on the backbone and the decoder output features excels in getting favorable results. For another, advanced domain alignment methods in both parts further enhance the performance. Thus, we propose the Object-Aware Alignment (OAA) module and the Optimal Transport based Alignment (OTA) module to achieve comprehensive domain alignment on the outputs of the backbone and the detector. The OAA module aligns the foreground regions identified by pseudo-labels in the backbone outputs, leading to domain-invariant based features. The OTA module utilizes sliced Wasserstein distance to maximize the retention of location information while minimizing the domain gap in the decoder outputs. We implement the findings and the alignment modules into our adaptation method, and it benchmarks the DETR-style detector on the domain shift settings. Experiments on various domain adaptive scenarios validate the effectiveness of our method.

preprint2022arXiv

Instantaneous indirect measurement principle in quantum mechanics

In quantum systems, the measurement of operators and the measurement of the quantum states of the system are very challenging tasks. In this Letter, we propose a method to obtain the average value of one operator in a certain state by measuring the instantaneous change of the average value of another operator with the assistance of a known reference state. We refer to this measurement method as the instantaneous indirect measurement method. By studying the application of this method to some typical models, we find that this measurement can be applied to the measurement of an arbitrary state of a quantum system. Furthermore, for the system to be measured, we find that such measurement neither significantly affects the wave function of the system nor causes wave function collapse of the system. Also, our study shows that when two independent systems are coupled, the information mapping between them is done instantaneously. Finally, we discuss applying this measurement method to the measurement of quantum Fisher information, which quantizes the limited accuracy of estimating a parameter from a quantum state.

preprint2022arXiv

Intelligent Reflecting Surface Aided Wireless Networks: From Single-Reflection to Multi-Reflection Design and Optimization

Intelligent reflecting surface (IRS) has emerged as a promising technique for wireless communication networks. By dynamically tuning the reflection amplitudes/phase shifts of a large number of passive elements, IRS enables flexible wireless channel control and configuration, and thereby enhances the wireless signal transmission rate and reliability significantly. Despite the vast literature on designing and optimizing assorted IRS-aided wireless systems, prior works have mainly focused on enhancing wireless links with single signal reflection only by one or multiple IRSs, which may be insufficient to boost the wireless link capacity under some harsh propagation conditions (e.g., indoor environment with dense blockages/obstructions). This issue can be tackled by employing two or more IRSs to assist each wireless link and jointly exploiting their single as well as multiple signal reflections over them. However, the resultant double-/multi-IRS aided wireless systems face more complex design issues as well as new practical challenges for implementation as compared to the conventional single-IRS counterpart, in terms of IRS reflection optimization, channel acquisition, as well as IRS deployment and association/selection. As such, a new paradigm for designing multi-IRS cooperative passive beamforming and joint active/passive beam routing arises which calls for innovative design approaches and optimization methods. In this paper, we give a tutorial overview of multi-IRS aided wireless networks, with an emphasis on addressing the new challenges due to multi-IRS signal reflection and routing. Moreover, we point out important directions worthy of research and investigation in the future.

preprint2022arXiv

Intelligent Reflecting Surface for MIMO VLC: Joint Design of Surface Configuration and Transceiver Signal Processing

With the capability of reconfiguring the wireless electromagnetic environment, intelligent reflecting surface (IRS) is a new paradigm for designing future wireless communication systems. In this paper, we consider optical IRS for improving the performance of visible light communication (VLC) under a multiple-input and multiple-output (MIMO) setting. Specifically, we focus on the downlink communication of an indoor MIMO VLC system and aim to minimize the mean square error (MSE) of demodulated signals at the receiver. To this end, the MIMO channel gain of the IRS-aided VLC is first derived under the point source assumption, based on which the MSE minimization problem is then formulated subject to the emission power constraints. Next, we propose an alternating optimization algorithm, which decomposes the original problem into three subproblems, to iteratively optimize the IRS configuration, the precoding and detection matrices for minimizing the MSE. Moreover, theoretical analysis on the performance of the proposed algorithm in high and low signal-to-noise rate (SNR) regimes is provided, revealing that the joint optimization process can be simplified in such special cases, and the algorithm's convergence property and computational complexity are also discussed. Finally, numerical results show that IRS-aided schemes significantly reduce the MSE as compared to their counterparts without IRS, and the proposed algorithm outperforms other baseline schemes.

preprint2022arXiv

Intelligent Reflecting Surface for Multi-Path Beam Routing with Active/Passive Beam Splitting and Combining

Intelligent reflecting surface (IRS) can be densely deployed in wireless networks to significantly enhance the communication channels. In this letter, we consider the downlink transmission from a multi-antenna base station (BS) to a single-antenna user, by exploiting the cooperative passive beamforming (CPB) and line-of-sight (LoS) path diversity gains of multi-IRS signal reflection. Unlike existing works where only one single multi-IRS reflection path from the BS to user is selected, we propose a new and more general multi-path beam routing scheme. Specifically, the BS sends the user's information signal via multiple orthogonal active beams (termed as active beam splitting), which point towards different IRSs. Then, these beamed signals are subsequently reflected by selected IRSs via their CPB in different paths, and finally coherently combined at the user's receiver (thus named {\it \textbf{passive beam combining}}). For this scheme, we formulate a new multi-path beam routing design problem to jointly optimize the number of IRS reflection paths, the selected IRSs for each of the reflection paths, the active/passive beamforming at the BS/each selected IRS, as well as the BS's power allocation over different active beams, so as to maximize the received signal power at the user. To solve this challenging problem, we first derive the optimal BS/IRS beamforming and BS power allocation for a given set of reflection paths. The clique-based approach in graph theory is then applied to solve the remaining multi-path selection problem efficiently. Simulation results show that our proposed multi-path beam routing scheme significantly outperforms its conventional single-path beam routing special case.

preprint2022arXiv

Intelligent Reflecting Surface-Aided LEO Satellite Communication: Cooperative Passive Beamforming and Distributed Channel Estimation

We consider in this paper a new intelligent reflecting surface (IRS)-aided LEO satellite communication system, by utilizing the controllable phase shifts of massive passive reflecting elements to achieve flexible beamforming, which copes with the time-varying channel between the high-mobility satellite (SAT) and ground node (GN) cost-effectively. In particular, we propose a new architecture for IRS-aided LEO satellite communication where IRSs are deployed at both sides of the SAT and GN, and study their cooperative passive beamforming (CPB) design over line-of-sight (LoS)-dominant single-reflection and double-reflection channels. Specifically, we jointly optimize the active transmit/receive beamforming at the SAT/GN as well as the CPB at two-sided IRSs to maximize the overall channel gain from the SAT to each GN. Interestingly, we show that under LoS channel conditions, the high-dimensional SAT-GN channel can be decomposed into the outer product of two low-dimensional vectors. By exploiting the decomposed SAT-GN channel, we decouple the original beamforming optimization problem into two simpler subproblems corresponding to the SAT and GN sides, respectively, which are both solved in closed-form. Furthermore, we propose an efficient transmission protocol to conduct channel estimation and beam tracking, which only requires independent processing of the SAT and GN in a distributed manner, thus substantially reducing the implementation complexity. Simulation results validate the performance advantages of the proposed IRS-aided LEO satellite communication system with two-sided cooperative IRSs, as compared to various baseline schemes such as the conventional reflect-array and one-sided IRS.

preprint2022arXiv

Intelligent Reflecting Surface-Aided Spectrum Sensing for Cognitive Radio

Spectrum sensing is a key enabling technique for cognitive radio (CR), which provides essential information on the spectrum availability. However, due to severe wireless channel fading and path loss, the primary user (PU) signals received at the CR or secondary user (SU) can be practically too weak for reliable detection. To tackle this issue, we consider in this letter a new intelligent reflecting surface (IRS)-aided spectrum sensing scheme for CR, by exploiting the large aperture and passive beamforming gains of IRS to boost the PU signal strength received at the SU to facilitate its spectrum sensing. Specifically, by dynamically changing the IRS reflection over time according to a given codebook, its reflected signal power varies substantially at the SU, which is utilized for opportunistic signal detection. Furthermore, we propose a weighted energy detection method by combining the received signal power values over different IRS reflections, which significantly improves the detection performance. Simulation results validate the performance gain of the proposed IRS-aided spectrum sensing scheme, as compared to different benchmark schemes.

preprint2022arXiv

Loop induced top quark FCNC through top quark and dark matter interactions

We present a comprehensive analysis of the loop induced top quark FCNC signals at the LHC within one class of the simplified model. The loop level FCNC interactions are well motivated to avoid the hierarchy of the top quark couplings from the new physics and standard model. Such a theory will posit a Majorana dark matter candidate and could be tested through dark matter relic density, direct detection experiments (the scattering between dark matter and heavy nuclei), and the collider signals at the LHC. We find that the spin-independent (SI) scattering between Majorana dark matter and nuclei will vanish at the leading order, while the next-to-leading order correction to the SI scattering becomes significance to constrain the parameter space of the model. A detailed comparison from direct detection experiments and LHC searches is also discussed and both of them are very important to full constrain the model.

preprint2022arXiv

Loss-tolerant all-photonic quantum repeater with generalized Shor code

The all-photonic quantum repeater (APQR) is a promising repeater scheme to realize long-distance quantum communication. For a practical APQR, an indispensable requirement is the robustness of the repeater graph state (RGS) against photon loss. We propose a new loss-tolerant scheme by applying the generalized Shor code to RGS, which can be experimentally demonstrated with current technology. Experimentally, we first prepare and verify the nine-qubit Shor code. Then, by applying the generalized Shor code to APQR and preparing a simplified encoded RGS with the structure of $1\times2$ based on the Shor code state, the effectiveness of our loss-tolerant scheme and the loss tolerance of the encoded RGS are respectively verified. Our results make an essential step toward a practical APQR and enrich the research of quantum error correction code.

preprint2022arXiv

Matrix Completion via Non-Convex Relaxation and Adaptive Correlation Learning

The existing matrix completion methods focus on optimizing the relaxation of rank function such as nuclear norm, Schatten-p norm, etc. They usually need many iterations to converge. Moreover, only the low-rank property of matrices is utilized in most existing models and several methods that incorporate other knowledge are quite time-consuming in practice. To address these issues, we propose a novel non-convex surrogate that can be optimized by closed-form solutions, such that it empirically converges within dozens of iterations. Besides, the optimization is parameter-free and the convergence is proved. Compared with the relaxation of rank, the surrogate is motivated by optimizing an upper-bound of rank. We theoretically validate that it is equivalent to the existing matrix completion models. Besides the low-rank assumption, we intend to exploit the column-wise correlation for matrix completion, and thus an adaptive correlation learning, which is scaling-invariant, is developed. More importantly, after incorporating the correlation learning, the model can be still solved by closed-form solutions such that it still converges fast. Experiments show the effectiveness of the non-convex surrogate and adaptive correlation learning.

preprint2022arXiv

MIA 2022 Shared Task: Evaluating Cross-lingual Open-Retrieval Question Answering for 16 Diverse Languages

We present the results of the Workshop on Multilingual Information Access (MIA) 2022 Shared Task, evaluating cross-lingual open-retrieval question answering (QA) systems in 16 typologically diverse languages. In this task, we adapted two large-scale cross-lingual open-retrieval QA datasets in 14 typologically diverse languages, and newly annotated open-retrieval QA data in 2 underrepresented languages: Tagalog and Tamil. Four teams submitted their systems. The best system leveraging iteratively mined diverse negative examples and larger pretrained models achieves 32.2 F1, outperforming our baseline by 4.5 points. The second best system uses entity-aware contextualized representations for document retrieval, and achieves significant improvements in Tamil (20.8 F1), whereas most of the other systems yield nearly zero scores.

preprint2022arXiv

MISS: Multi-Interest Self-Supervised Learning Framework for Click-Through Rate Prediction

CTR prediction is essential for modern recommender systems. Ranging from early factorization machines to deep learning based models in recent years, existing CTR methods focus on capturing useful feature interactions or mining important behavior patterns. Despite the effectiveness, we argue that these methods suffer from the risk of label sparsity (i.e., the user-item interactions are highly sparse with respect to the feature space), label noise (i.e., the collected user-item interactions are usually noisy), and the underuse of domain knowledge (i.e., the pairwise correlations between samples). To address these challenging problems, we propose a novel Multi-Interest Self-Supervised learning (MISS) framework which enhances the feature embeddings with interest-level self-supervision signals. With the help of two novel CNN-based multi-interest extractors,self-supervision signals are discovered with full considerations of different interest representations (point-wise and union-wise), interest dependencies (short-range and long-range), and interest correlations (inter-item and intra-item). Based on that, contrastive learning losses are further applied to the augmented views of interest representations, which effectively improves the feature representation learning. Furthermore, our proposed MISS framework can be used as an plug-in component with existing CTR prediction models and further boost their performances. Extensive experiments on three large-scale datasets show that MISS significantly outperforms the state-of-the-art models, by up to 13.55% in AUC, and also enjoys good compatibility with representative deep CTR models.

preprint2022arXiv

Modular Extremely Large-Scale Array Communication: Near-Field Modelling and Performance Analysis

This paper investigates wireless communications based on a new antenna array architecture, termed modular extremely large-scale array (XL-array), where an extremely large number of antenna elements are regularly arranged on a common platform in a modular manner. Each module consists of a flexible/moderate number of antenna elements, and different modules are separated with an inter-module spacing that is typically much larger than the inter-element spacing/signal wavelength for ease of deployment. By properly modelling the variations of signal phase, amplitude and projected aperture across different array modules/elements, we develop the new channel model and analyze the signal-to-noise ratio (SNR) performance of the modular XL-array based communications. Under the practical non-uniform spherical wave (NUSW) model, the closed-form expression of the maximum achievable SNR is derived in terms of key geometric parameters, including the total planar array size, module separation distances along each dimension, as well as the user's location in the three-dimensional (3D) space. Besides, the asymptotic SNR scaling laws are revealed as the number of modules along different dimensions goes to infinity. Moreover, we show that our developed near-field modelling and performance analysis include the existing ones for the collocated XL-array, the far-field uniform plane wave (UPW) model, as well as the one-dimensional (1D) modular extremely large-scale uniform linear array (XL-ULA) as special cases. Extensive simulation results are provided to validate our obtained results.

preprint2022arXiv

Multi-Level Interaction Reranking with User Behavior History

As the final stage of the multi-stage recommender system (MRS), reranking directly affects users' experience and satisfaction, thus playing a critical role in MRS. Despite the improvement achieved in the existing work, three issues are yet to be solved. First, users' historical behaviors contain rich preference information, such as users' long and short-term interests, but are not fully exploited in reranking. Previous work typically treats items in history equally important, neglecting the dynamic interaction between the history and candidate items. Second, existing reranking models focus on learning interactions at the item level while ignoring the fine-grained feature-level interactions. Lastly, estimating the reranking score on the ordered initial list before reranking may lead to the early scoring problem, thereby yielding suboptimal reranking performance. To address the above issues, we propose a framework named Multi-level Interaction Reranking (MIR). MIR combines low-level cross-item interaction and high-level set-to-list interaction, where we view the candidate items to be reranked as a set and the users' behavior history in chronological order as a list. We design a novel SLAttention structure for modeling the set-to-list interactions with personalized long-short term interests. Moreover, feature-level interactions are incorporated to capture the fine-grained influence among items. We design MIR in such a way that any permutation of the input items would not change the output ranking, and we theoretically prove it. Extensive experiments on three public and proprietary datasets show that MIR significantly outperforms the state-of-the-art models using various ranking and utility metrics.

preprint2022arXiv

MultiHiertt: Numerical Reasoning over Multi Hierarchical Tabular and Textual Data

Numerical reasoning over hybrid data containing both textual and tabular content (e.g., financial reports) has recently attracted much attention in the NLP community. However, existing question answering (QA) benchmarks over hybrid data only include a single flat table in each document and thus lack examples of multi-step numerical reasoning across multiple hierarchical tables. To facilitate data analytical progress, we construct a new large-scale benchmark, MultiHiertt, with QA pairs over Multi Hierarchical Tabular and Textual data. MultiHiertt is built from a wealth of financial reports and has the following unique characteristics: 1) each document contain multiple tables and longer unstructured texts; 2) most of tables contained are hierarchical; 3) the reasoning process required for each question is more complex and challenging than existing benchmarks; and 4) fine-grained annotations of reasoning processes and supporting facts are provided to reveal complex numerical reasoning. We further introduce a novel QA model termed MT2Net, which first applies facts retrieving to extract relevant supporting facts from both tables and text and then uses a reasoning module to perform symbolic reasoning over retrieved facts. We conduct comprehensive experiments on various baselines. The experimental results show that MultiHiertt presents a strong challenge for existing baselines whose results lag far behind the performance of human experts. The dataset and code are publicly available at https://github.com/psunlpgroup/MultiHiertt.

preprint2022arXiv

Near-Field Modelling and Performance Analysis of Modular Extremely Large-Scale Array Communications

This letter studies a new array architecture, termed as modular extremely large-scale array (XL-array), for which a large number of array elements are arranged in a modular manner. Each module consists of a moderate number of array elements and the modules are regularly arranged with the inter-module space typically much larger than signal wavelength to cater to the actual mounting structure. We study the mathematical modelling and conduct the performance analysis for modular XL-array communications, by considering the non-uniform spherical wave (NUSW) characteristic that is more suitable than the conventional uniform plane wave (UPW) assumption for physically large arrays. A closed-form expression is derived for the maximum signal-to-noise ratio (SNR) in terms of the geometries of the modular XL-array, including the total array size and module separation, as well as the user's location. The asymptotic SNR scaling law is revealed as the size of modular array goes to infinity. Furthermore, we show that the developed modelling and performance analysis include the existing results for collocated XL-array or far-field UPW assumption as special cases. Numerical results demonstrate the importance of near-field modelling for modular XL-array communications since it leads to significantly different results from the conventional far-field UPW modelling.

preprint2022arXiv

Nematic fluctuations in the non-superconducting iron pnictide BaFe$_{1.9-x}$Ni$_{0.1}$Cr$_{x}$As$_{2}$

The main driven force of the electronic nematic phase in iron-based superconductors is still under debate. Here, we report a comprehensive study on the nematic fluctuations in a non-superconducting iron pnictide system BaFe$_{1.9-x}$Ni$_{0.1}$Cr$_{x}$As$_{2}$ by electronic transport, angle-resolved photoemission spectroscopy (ARPES) and inelastic neutron scattering (INS) measurements. Previous neutron diffraction and transport measurements suggested that the collinear antiferromagnetism persists to $x=0.8$, with similar Néel temperature $T_N$ and structural transition temperature $T_s$ around 32 K, but the charge carriers change from electron type to hole type around $x=$ 0.5. In this study, we have found that the in-plane resistivity anisotropy also highly depends on the Cr dopings and the type of charge carriers. While ARPES measurements suggest possibly weak orbital anisotropy onset near $T_s$ for both $x=0.05$ and $x=0.5$ compounds, INS experiments reveal clearly different onset temperatures of low-energy spin excitation anisotropy, which is likely related to the energy scale of spin nematicity. These results suggest that the interplay between the local spins on Fe atoms and the itinerant electrons on Fermi surfaces is crucial to the nematic fluctuations of iron pnictides, where the orbital degree of freedom may behave differently from the spin degree of freedom, and the transport properties are intimately related to the spin dynamics.

preprint2022arXiv

Neural Program Synthesis with Query

Aiming to find a program satisfying the user intent given input-output examples, program synthesis has attracted increasing interest in the area of machine learning. Despite the promising performance of existing methods, most of their success comes from the privileged information of well-designed input-output examples. However, providing such input-output examples is unrealistic because it requires the users to have the ability to describe the underlying program with a few input-output examples under the training distribution. In this work, we propose a query-based framework that trains a query neural network to generate informative input-output examples automatically and interactively from a large query space. The quality of the query depends on the amount of the mutual information between the query and the corresponding program, which can guide the optimization of the query framework. To estimate the mutual information more accurately, we introduce the functional space (F-space) which models the relevance between the input-output examples and the programs in a differentiable way. We evaluate the effectiveness and generalization of the proposed query-based framework on the Karel task and the list processing task. Experimental results show that the query-based framework can generate informative input-output examples which achieve and even outperform well-designed input-output examples.

preprint2022arXiv

Neural Re-ranking in Multi-stage Recommender Systems: A Review

As the final stage of the multi-stage recommender system (MRS), re-ranking directly affects user experience and satisfaction by rearranging the input ranking lists, and thereby plays a critical role in MRS. With the advances in deep learning, neural re-ranking has become a trending topic and been widely applied in industrial applications. This review aims at integrating re-ranking algorithms into a broader picture, and paving ways for more comprehensive solutions for future research. For this purpose, we first present a taxonomy of current methods on neural re-ranking. Then we give a description of these methods along with the historic development according to their objectives. The network structure, personalization, and complexity are also discussed and compared. Next, we provide benchmarks of the major neural re-ranking models and quantitatively analyze their re-ranking performance. Finally, the review concludes with a discussion on future prospects of this field. A list of papers discussed in this review, the benchmark datasets, our re-ranking library LibRerank, and detailed parameter settings are publicly available at https://github.com/LibRerank-Community/LibRerank.

preprint2022arXiv

New criterions on nonexistence of periodic orbits of planar dynamical systems and their applications

Characterizing existence or not of periodic orbit is a classical problem and it has both theoretical importance and many real applications. Here, several new criterions on nonexistence of periodic orbits of the planar dynamical system $\dot x=y,~\dot y=-g(x)-f(x,y)y$ are obtained in this paper, and by examples showing that these criterions are applicable, but the known ones are invalid to them. Based on these criterions, we further characterize the local topological structures of its equilibrium, which also show that one of the classical results by A.F. Andreev [Amer. Math. Soc. Transl. 8 (1958), 183--207] on local topological classification of the degenerate equilibrium is incomplete. Finally, as another application of these results, we classify the global phase portraits of a planar differential system, which comes from the third question in the list of the 33 questions posed by A. Gasull and also from a mechanical oscillator under suitable restriction to its parameters.

preprint2022arXiv

On the Opportunity of Causal Learning in Recommendation Systems: Foundation, Estimation, Prediction and Challenges

Recently, recommender system (RS) based on causal inference has gained much attention in the industrial community, as well as the states of the art performance in many prediction and debiasing tasks. Nevertheless, a unified causal analysis framework has not been established yet. Many causal-based prediction and debiasing studies rarely discuss the causal interpretation of various biases and the rationality of the corresponding causal assumptions. In this paper, we first provide a formal causal analysis framework to survey and unify the existing causal-inspired recommendation methods, which can accommodate different scenarios in RS. Then we propose a new taxonomy and give formal causal definitions of various biases in RS from the perspective of violating the assumptions adopted in causal analysis. Finally, we formalize many debiasing and prediction tasks in RS, and summarize the statistical and machine learning-based causal estimation methods, expecting to provide new research opportunities and perspectives to the causal RS community.

preprint2022arXiv

Optimizing Age of Information in Wireless Uplink Networks with Partial Observations

We consider a wireless uplink network consisting of multiple end devices and an access point (AP). Each device monitors a physical process with stochastic arrival of status updates and sends these updates to the AP over a shared channel. The AP aims to schedule the transmissions of these devices to optimize the network-wide information freshness, quantified by the Age of Information (AoI) metric. Due to the stochastic arrival of the status updates at the devices, the AP only has partial observations of system times of the latest status updates at the devices when making scheduling decisions. We formulate such a decision-making problem as a belief Markov Decision Process (belief-MDP). The belief-MDP in its original form is difficult to solve as the dimension of its states can go to infinity and its belief space is uncountable. By leveraging the properties of the status update arrival (i.e., Bernoulli) processes, we manage to simplify the feasible states of the belief-MDP to two-dimensional vectors. Built on that, we devise a low-complexity scheduling policy. We derive upper bounds for the AoI performance of the low-complexity policy and analyze the performance guarantee by comparing its performance with a universal lower bound. Numerical results validate our analyses.

preprint2022arXiv

Outpainting by Queries

Image outpainting, which is well studied with Convolution Neural Network (CNN) based framework, has recently drawn more attention in computer vision. However, CNNs rely on inherent inductive biases to achieve effective sample learning, which may degrade the performance ceiling. In this paper, motivated by the flexible self-attention mechanism with minimal inductive biases in transformer architecture, we reframe the generalised image outpainting problem as a patch-wise sequence-to-sequence autoregression problem, enabling query-based image outpainting. Specifically, we propose a novel hybrid vision-transformer-based encoder-decoder framework, named \textbf{Query} \textbf{O}utpainting \textbf{TR}ansformer (\textbf{QueryOTR}), for extrapolating visual context all-side around a given image. Patch-wise mode's global modeling capacity allows us to extrapolate images from the attention mechanism's query standpoint. A novel Query Expansion Module (QEM) is designed to integrate information from the predicted queries based on the encoder's output, hence accelerating the convergence of the pure transformer even with a relatively small dataset. To further enhance connectivity between each patch, the proposed Patch Smoothing Module (PSM) re-allocates and averages the overlapped regions, thus providing seamless predicted images. We experimentally show that QueryOTR could generate visually appealing results smoothly and realistically against the state-of-the-art image outpainting approaches.

preprint2022arXiv

Performance Analysis of OMP in Super-Resolution

Given a spectrally sparse signal $\mathbf{y} = \sum_{i=1}^s x_i\mathbf{f}(τ_i) \in \mathbb{C}^{2n+1}$ consisting of $s$ complex sinusoids, we consider the super-resolution problem, which is about estimating frequency components $\{τ_i\}_{i=1}^s$ of $\mathbf y$. We consider the OMP-type algorithms for super-resolution, which is more efficient than other approaches based on Semi-Definite Programming. Our analysis shows that a two-stage algorithm with OMP initialization can recover frequency components under the separation condition $nΔ\gtrsim \text{dyn}(\mathbf{x})$ and the dependency on $\text{dyn}(\mathbf{x})$ is inevitable for the vanilla OMP algorithm. We further show that the Sliding-OMP algorithm, a variant of the OMP algorithm with an additional refinement step at each iteration, is provable to recover $\{τ_i\}_{i=1}^s$ under the separation condition $nΔ\geq c$. Moreover, our result can be extended to an incomplete measurement model with $O( s^2\log n)$ measurements.

preprint2022arXiv

Predicting Cancer Treatments Induced Cardiotoxicity of Breast Cancer Patients

Cardiotoxicity induced by the breast cancer treatments (i.e., chemotherapy, targeted therapy and radiation therapy) is a significant problem for breast cancer patients. The cardiotoxicity risk for breast cancer patients receiving different treatments remains unclear. We developed and evaluated risk predictive models for cardiotoxicity in breast cancer patients using EHR data. The AUC scores to predict the CHF, CAD, CM and MI are 0.846, 0.857, 0.858 and 0.804 respectively. After adjusting for baseline differences in cardiovascular health, patients who received chemotherapy or targeted therapy appeared to have higher risk of cardiotoxicity than patients who received radiation therapy. Due to differences in baseline cardiac health across the different breast cancer treatment groups, caution is recommended in interpreting the cardiotoxic effect of these treatments.

preprint2022arXiv

Quantum Support Vector Machine without Iteration

Quantum algorithms can enhance machine learning in different aspects. In 2014, Rebentrost $et~al.$ constructed a least squares quantum support vector machine (LS-QSVM), in which the Swap Test plays a crucial role in realizing the classification. However, as the output states of a previous test cannot be reused for a new test in the Swap Test, the quantum algorithm LS-QSVM has to be repeated in preparing qubits, manipulating operations, and carrying out the measurement. This paper proposes a QSVM based on the generalized quantum amplitude estimation (AE-QSVM) which gets rid of the constraint of repetitive processes and saves the quantum resources. At first, AE-QSVM is trained by using the quantum singular value decomposition. Then, a query sample is classified by using the generalized quantum amplitude estimation in which high accuracy can be achieved by adding auxiliary qubits instead of repeating the algorithm. The complexity of AE-QSVM is reduced to $O(κ^{3}\varepsilon^{-3}(log(mn)+1))$ with an accuracy $\varepsilon$, where $m$ is the number of training vectors, $n$ is the dimension of the feature space, and $κ$ is the condition number. Experiments demonstrate that AE-QSVM is advantageous in terms of training matrix, the number of iterations, space complexity, and time complexity.

preprint2022arXiv

ReLoop: A Self-Correction Continual Learning Loop for Recommender Systems

Deep learning-based recommendation has become a widely adopted technique in various online applications. Typically, a deployed model undergoes frequent re-training to capture users' dynamic behaviors from newly collected interaction logs. However, the current model training process only acquires users' feedbacks as labels, but fail to take into account the errors made in previous recommendations. Inspired by the intuition that humans usually reflect and learn from mistakes, in this paper, we attempt to build a self-correction learning loop (dubbed ReLoop) for recommender systems. In particular, a new customized loss is employed to encourage every new model version to reduce prediction errors over the previous model version during training. Our ReLoop learning framework enables a continual self-correction process in the long run and thus is expected to obtain better performance over existing training strategies. Both offline experiments and an online A/B test have been conducted to validate the effectiveness of ReLoop.

preprint2022arXiv

Self Supervised Lesion Recognition For Breast Ultrasound Diagnosis

Previous deep learning based Computer Aided Diagnosis (CAD) system treats multiple views of the same lesion as independent images. Since an ultrasound image only describes a partial 2D projection of a 3D lesion, such paradigm ignores the semantic relationship between different views of a lesion, which is inconsistent with the traditional diagnosis where sonographers analyze a lesion from at least two views. In this paper, we propose a multi-task framework that complements Benign/Malignant classification task with lesion recognition (LR) which helps leveraging relationship among multiple views of a single lesion to learn a complete representation of the lesion. To be specific, LR task employs contrastive learning to encourage representation that pulls multiple views of the same lesion and repels those of different lesions. The task therefore facilitates a representation that is not only invariant to the view change of the lesion, but also capturing fine-grained features to distinguish between different lesions. Experiments show that the proposed multi-task framework boosts the performance of Benign/Malignant classification as two sub-tasks complement each other and enhance the learned representation of ultrasound images.

preprint2022arXiv

SepLUT: Separable Image-adaptive Lookup Tables for Real-time Image Enhancement

Image-adaptive lookup tables (LUTs) have achieved great success in real-time image enhancement tasks due to their high efficiency for modeling color transforms. However, they embed the complete transform, including the color component-independent and the component-correlated parts, into only a single type of LUTs, either 1D or 3D, in a coupled manner. This scheme raises a dilemma of improving model expressiveness or efficiency due to two factors. On the one hand, the 1D LUTs provide high computational efficiency but lack the critical capability of color components interaction. On the other, the 3D LUTs present enhanced component-correlated transform capability but suffer from heavy memory footprint, high training difficulty, and limited cell utilization. Inspired by the conventional divide-and-conquer practice in the image signal processor, we present SepLUT (separable image-adaptive lookup table) to tackle the above limitations. Specifically, we separate a single color transform into a cascade of component-independent and component-correlated sub-transforms instantiated as 1D and 3D LUTs, respectively. In this way, the capabilities of two sub-transforms can facilitate each other, where the 3D LUT complements the ability to mix up color components, and the 1D LUT redistributes the input colors to increase the cell utilization of the 3D LUT and thus enable the use of a more lightweight 3D LUT. Experiments demonstrate that the proposed method presents enhanced performance on photo retouching benchmark datasets than the current state-of-the-art and achieves real-time processing on both GPUs and CPUs.

preprint2022arXiv

Simultaneous Transmit Diversity and Passive Beamforming with Large-Scale Intelligent Reflecting Surface: Far-Field or Near-Field?

Intelligent reflecting surface (IRS) has emerged as a cost-effective solution to enhance wireless communication performance via passive signal reflection. Existing works on IRS have mainly focused on investigating IRS's passive beamforming/reflection design to boost the communication rate for users assuming that their channel state information (CSI) is fully or partially known. However, how to exploit IRS to improve the wireless transmission reliability without any CSI, which is typical in high-mobility/delay-sensitive communication scenarios, remains largely open. In this paper, we study a new IRS-aided communication system with the IRS integrated to its aided access point (AP) to achieve both functions of transmit diversity and passive beamforming simultaneously. Specifically, we first show an interesting result that the IRS's passive beamforming gain in any direction is invariant to the common phase-shift applied to all of its reflecting elements. Accordingly, we design the common phase-shift of IRS elements to achieve transmit diversity at the AP side without the need of any CSI of the users. In addition, we propose a practical method for the users to estimate the CSI at the receiver side for information decoding. Meanwhile, we show that the conventional passive beamforming gain of IRS can be retained for the other users with their CSI known at the AP. Furthermore, we derive the asymptotic performance of both IRS-aided transmit diversity and passive beamforming in closed-form, by considering the large-scale IRS with an infinite number of elements. Numerical results validate our analysis and show the performance gains of the proposed IRS-aided simultaneous transmit diversity and passive beamforming scheme over other benchmark schemes.

preprint2022arXiv

Solving The Long-Tailed Problem via Intra- and Inter-Category Balance

Benchmark datasets for visual recognition assume that data is uniformly distributed, while real-world datasets obey long-tailed distribution. Current approaches handle the long-tailed problem to transform the long-tailed dataset to uniform distribution by re-sampling or re-weighting strategies. These approaches emphasize the tail classes but ignore the hard examples in head classes, which result in performance degradation. In this paper, we propose a novel gradient harmonized mechanism with category-wise adaptive precision to decouple the difficulty and sample size imbalance in the long-tailed problem, which are correspondingly solved via intra- and inter-category balance strategies. Specifically, intra-category balance focuses on the hard examples in each category to optimize the decision boundary, while inter-category balance aims to correct the shift of decision boundary by taking each category as a unit. Extensive experiments demonstrate that the proposed method consistently outperforms other approaches on all the datasets.

preprint2022arXiv

Spatial-temporal Conv-sequence Learning with Accident Encoding for Traffic Flow Prediction

In an intelligent transportation system, the key problem of traffic forecasting is how to extract periodic temporal dependencies and complex spatial correlations. Current state-of-the-art methods for predicting traffic flow are based on graph architectures and sequence learning models, but they do not fully exploit dynamic spatial-temporal information in the traffic system. Specifically, the temporal dependencies in the short-range are diluted by recurrent neural networks. Moreover, local spatial information is also ignored by existing sequence models, because their convolution operation uses global average pooling. Besides, accidents may occur during object transition, which will cause congestion in the real world and further decrease prediction accuracy. To overcome these challenges, we propose Spatial-Temporal Conv-sequence Learning (STCL), where a focused temporal block uses unidirectional convolution to capture short-term periodic temporal dependencies effectively, and a patial-temporal fusion module is responsible for extracting dependencies of interactions and decreasing the feature dimensions. Moreover, as the accidents features have an impact on local traffic congestion, we employ position encoding to detect anomalies in complex traffic situations. We have conducted a large number of experiments on real-world tasks and verified the effectiveness of our proposed method.

preprint2022arXiv

SSMI: How to Make Objects of Interest Disappear without Accessing Object Detectors?

Most black-box adversarial attack schemes for object detectors mainly face two shortcomings: requiring access to the target model and generating inefficient adversarial examples (failing to make objects disappear in large numbers). To overcome these shortcomings, we propose a black-box adversarial attack scheme based on semantic segmentation and model inversion (SSMI). We first locate the position of the target object using semantic segmentation techniques. Next, we design a neighborhood background pixel replacement to replace the target region pixels with background pixels to ensure that the pixel modifications are not easily detected by human vision. Finally, we reconstruct a machine-recognizable example and use the mask matrix to select pixels in the reconstructed example to modify the benign image to generate an adversarial example. Detailed experimental results show that SSMI can generate efficient adversarial examples to evade human-eye perception and make objects of interest disappear. And more importantly, SSMI outperforms existing same kinds of attacks. The maximum increase in new and disappearing labels is 16%, and the maximum decrease in mAP metrics for object detection is 36%.

preprint2022arXiv

Summ^N: A Multi-Stage Summarization Framework for Long Input Dialogues and Documents

Text summarization helps readers capture salient information from documents, news, interviews, and meetings. However, most state-of-the-art pretrained language models (LM) are unable to efficiently process long text for many summarization tasks. In this paper, we propose Summ$^N$, a simple, flexible, and effective multi-stage framework for input texts that are longer than the maximum context length of typical pretrained LMs. Summ$^N$ first splits the data samples and generates a coarse summary in multiple stages and then produces the final fine-grained summary based on it. Our framework can process input text of arbitrary length by adjusting the number of stages while keeping the LM input size fixed. Moreover, it can deal with both single-source documents and dialogues, and it can be used on top of different backbone abstractive summarization models. To the best of our knowledge, Summ$^N$ is the first multi-stage split-then-summarize framework for long input summarization. Our experiments demonstrate that Summ$^N$ outperforms previous state-of-the-art methods by improving ROUGE scores on three long meeting summarization datasets AMI, ICSI, and QMSum, two long TV series datasets from SummScreen, and a long document summarization dataset GovReport. Our data and code are available at https://github.com/psunlpgroup/Summ-N.

preprint2022arXiv

Target Sensing with Intelligent Reflecting Surface: Architecture and Performance

Intelligent reflecting surface (IRS) has emerged as a promising technology to reconfigure the radio propagation environment by dynamically controlling wireless signal's amplitude and/or phase via a large number of reflecting elements. In contrast to the vast literature on studying IRS's performance gains in wireless communications, we study in this paper a new application of IRS for sensing/localizing targets in wireless networks. Specifically, we propose a new self-sensing IRS architecture where the IRS controller is capable of transmitting probing signals that are not only directly reflected by the target (referred to as the direct echo link), but also consecutively reflected by the IRS and then the target (referred to as the IRS-reflected echo link). Moreover, dedicated sensors are installed at the IRS for receiving both the direct and IRS-reflected echo signals from the target, such that the IRS can sense the direction of its nearby target by applying a customized multiple signal classification (MUSIC) algorithm. However, since the angle estimation mean square error (MSE) by the MUSIC algorithm is intractable, we propose to optimize the IRS passive reflection for maximizing the average echo signals' total power at the IRS sensors and derive the resultant Cramer-Rao bound (CRB) of the angle estimation MSE. Last, numerical results are presented to show the effectiveness of the proposed new IRS sensing architecture and algorithm, as compared to other benchmark sensing systems/algorithms.

preprint2022arXiv

The extremal process of super-Brownian motion: a probabilistic approach via skeletons

Recently Ren et al. [Stoch. Proc. Appl., 137 (2021)] have proved that the extremal process of the super-Brownian motion converges in distribution in the limit of large times. Their techniques rely heavily on the study of the convergence of solutions to the Kolmogorov-Petrovsky-Piscounov equation along the lines of [M. Bramson, Mem. Amer. Math. Soc., 44 (1983)]. In this paper we take a different approach. Our approach is based on the skeleton decomposition of super-Brownian motion. The skeleton may be interpreted as immortal particles that determine the large time behaviour of the process. We exploit this fact and carry asymptotic properties from the skeleton over to the super-Brownian motion. Some new results concerning the probabilistic representations of the limiting process are obtained, which cannot be directly obtained through the results of [Y.-X. Ren et al., Stoch. Proc. Appl., 137 (2021)]. Apart from the results, our approach offers insights into the driving force behind the limiting process for super-Brownian motions.

preprint2022arXiv

Thermal radiative cooling of carbon cluster cations C$_N^+$, $N = 9, 11,12, 17-27$

The radiative cooling rates of C$_N^+$ clusters ($N = 9, 11, 12, 17-27$) have been measured in the ultrahigh vacuum of an electrostatic storage ring to values on the order of $10^4$ s$^{-1}$. The rates were measured as a competing channel to unimolecular decay, and the rate constants pertain to the excitation energies where these two channels compete. Such high values can only be explained as photon emission from thermally excited electronic states, a mechanism that has also been seen in polycyclic aromatic hydrocarbon cations. The high rates have a very strong stabilizing effect on the clusters and the underlying mechanism gives a high energy conversion efficiency, with the potential to reach high quantum efficiencies in the emission process. The competing decay of unimolecular fragmentation defines upper limits for photon energies that can be down-converted to lower energy photons. Including previously measured cluster sizes provides the limits for all clusters C$_N^+$, $N=8-27$, of values that vary from 10 to 14.5 eV, with a general increase with size. Clusters absorbing photons of energies below these limits cool down efficiently by emission of photons via electronic transitions and their fragmentation is strongly reduced, increasing their survival in HI regions.

preprint2022arXiv

Transformation between elastic dipoles, quadrupoles, octupoles and hexadecapoles driven by surfactant self-assembly in nematic emulsion

Emulsions comprising isotropic fluid drops within a nematic host are of interest for applications ranging from biodetection to smart windows, which rely on changes of molecular alignment structures around the drops in response to chemical, thermal, electric and other stimuli. We show that absorption or desorption of trace amounts of common surfactants can drive continuous transformations of elastic multipoles induced by the droplets within the uniformly aligned nematic host. Out-of-equilibrium dynamics of director structures emerge from a controlled self-assembly or desorption of different surfactants at the drop-nematic interfaces, with ensuing forward and reverse transformations between elastic dipoles, quadrupoles, octupoles and hexadecapoles. We characterize inter-transformations of droplet-induced surface and bulk defects, probe elastic pair interactions and discuss emergent prospects for fundamental science and applications of the reconfigurable nematic emulsions.

preprint2021arXiv

A General Machine Learning-based Approach for Inverse Design of One-dimensional Photonic Crystals Toward Targeted Visible Light Reflection Spectrum

Data-driven methods have increasingly been applied to the development of optical systems as inexpensive and effective inverse design approaches. Optical properties (e.g., band-gap properties) of photonic crystals (PCs) are closely associated with characteristics of their light reflection spectra. Finding optimal PC constructions (within a pre-specified parameter space) that generate reflection spectra closest to a targeted spectrum is thus an interesting and meaningful inverse design problem, although relevant studies are still limited. Here we report a generally effective machine learning-based inverse design approach for one-dimensional photonic crystals (1DPCs), focusing on visible light spectra which are of high practical relevance. For a given class of 1DPC system, a deep neural network (DNN) in a unified structure is first trained over data from sizeable forward calculations (from layer thicknesses to spectrum). An iterative optimization scheme is then developed based on a coherent integration of DNN backward predictions (from spectrum to layer thicknesses), forward calculations, and Monte Carlo moves. We employ this new approach to four representative 1DPC systems including periodic structures with two-, three-, and four-layer repeating units and a heterostructure. The approach successfully converges to solutions of optimal 1DPC constructions for various targeted spectra regardless of their exact achievability. As two demonstrating examples, inverse designs toward a specially constructed "rectangle-shaped" green-light or red-light reflection spectrum are presented and discussed in detail. Remarkably, the results show that the approach can efficiently find out optimal layer thicknesses even when they are far outside the range covered by the original training data of DNN.

preprint2021arXiv

An Overview of Signal Processing Techniques for RIS/IRS-aided Wireless Systems

In the past as well as present wireless communication systems, the wireless propagation environment is regarded as an uncontrollable black box that impairs the received signal quality, and its negative impacts are compensated for by relying on the design of various sophisticated transmission/reception schemes. However, the improvements through applying such schemes operating at two endpoints (i.e., transmitter and receiver) only are limited even after five generations of wireless systems. Reconfigurable intelligent surface (RIS) or intelligent reflecting surface (IRS) have emerged as a new and revolutionary technology that can configure the wireless environment in a favorable manner by properly tuning the phase shifts of a large number of quasi passive and low-cost reflecting elements, thus standing out as a promising candidate technology for the next-/sixth-generation (6G) wireless system. However, to reap the performance benefits promised by RIS/IRS, efficient signal processing techniques are crucial, for a variety of purposes such as channel estimation, transmission design, radio localization, and so on. In this paper, we provide a comprehensive overview of recent advances on RIS/IRS-aided wireless systems from the signal processing perspective. We also highlight promising research directions that are worthy of investigation in the future.

preprint2021arXiv

Cooperative Multi-Beam Routing for Multi-IRS Aided Massive MIMO

Intelligent reflecting surface (IRS) is envisioned to play a significant role in future wireless communication systems thanks to its powerful capability of enabling smart and reconfigurable radio environment. In this paper, we study the multi-IRS aided downlink communication in a massive multiple-input multiple-output (MIMO) system, where a multi-antenna BS simultaneously serves multiple remote single-antenna users with orthogonal beams reflected by multiple IRSs. By exploiting the line-of-sight (LoS) link between each pair of selected IRSs, a multi-hop cascaded LoS link can be established between the BS and each user via their cooperative beam routing. Under this setup, we optimize the selected IRSs and their beam routing path for each user, along with the BS/IRS active/passive beamforming such that the minimum received signal power among all users is maximized, subject to a new multi-beam routing path separation constraint for avoiding the inter-user/route interference. To tackle this problem, we first derive the optimal BS/IRS active/passive beamforming in closed-form for any given beam routes and show the beam routing optimization is NP-complete by recasting it as an equivalent graph-optimization problem. To solve this challenging problem, we then propose an efficient recursive algorithm to partially enumerate the feasible solutions, which effectively balances the performance-complexity trade-off by tuning its design parameter. Numerical results demonstrate that the proposed algorithm can achieve near-optimal performance with low enumeration complexity and also outperform other benchmark schemes.

preprint2021arXiv

Distributed quantum phase estimation with entangled photons

Distributed quantum metrology can enhance the sensitivity for sensing spatially distributed parameters beyond the classical limits. Here we demonstrate distributed quantum phase estimation with discrete variables to achieve Heisenberg limit phase measurements. Based on parallel entanglement in modes and particles, we demonstrate distributed quantum sensing for both individual phase shifts and an averaged phase shift, with an error reduction up to 1.4 dB and 2.7 dB below the shot-noise limit. Furthermore, we demonstrate a combined strategy with parallel mode entanglement and multiple passes of the phase shifter in each mode. In particular, our experiment uses six entangled photons with each photon passing the phase shifter up to six times, and achieves a total number of photon passes N=21 at an error reduction up to 4.7 dB below the shot-noise limit. Our research provides a faithful verification of the benefit of entanglement and coherence for distributed quantum sensing in general quantum networks.

preprint2021arXiv

Double-IRS Aided MIMO Communication under LoS Channels: Capacity Maximization and Scaling

Intelligent reflecting surface (IRS) is a promising technology to extend the wireless signal coverage and support the high performance communication. By intelligently adjusting the reflection coefficients of a large number of passive reflecting elements, the IRS can modify the wireless propagation environment in favour of signal transmission. Different from most of the prior works which did not consider any cooperation between IRSs, in this work we propose and study a cooperative double-IRS aided multiple-input multiple-output (MIMO) communication system under the line-of-sight (LoS) propagation channels. We investigate the capacity maximization problem by jointly optimizing the transmit covariance matrix and the passive beamforming matrices of the two cooperative IRSs. Although the above problem is non-convex and difficult to solve, we transform and simplify the original problem by exploiting a tractable characterization of the LoS channels. Then we develop a novel low-complexity algorithm whose complexity is independent of the number of IRS elements. Moreover, we analyze the capacity scaling orders of the double-IRS aided MIMO system with respect to an asymptotically large number of IRS elements or transmit power, which significantly outperform those of the conventional single-IRS aided MIMO system, thanks to the cooperative passive beamforming gain brought by the double-reflection link and the spatial multiplexing gain harvested from the two single-reflection links. Extensive numerical results are provided to show that by exploiting the LoS channel properties, our proposed algorithm can achieve a desirable performance with low computational time. Also, our capacity scaling analysis is validated, and the double-IRS system is shown to achieve a much higher rate than its single-IRS counterpart as long as the number of IRS elements or the transmit power is not small.

preprint2021arXiv

Drug Repurposing for COVID-19 via Knowledge Graph Completion

Objective: To discover candidate drugs to repurpose for COVID-19 using literature-derived knowledge and knowledge graph completion methods. Methods: We propose a novel, integrative, and neural network-based literature-based discovery (LBD) approach to identify drug candidates from both PubMed and COVID-19-focused research literature. Our approach relies on semantic triples extracted using SemRep (via SemMedDB). We identified an informative subset of semantic triples using filtering rules and an accuracy classifier developed on a BERT variant, and used this subset to construct a knowledge graph. Five SOTA, neural knowledge graph completion algorithms were used to predict drug repurposing candidates. The models were trained and assessed using a time slicing approach and the predicted drugs were compared with a list of drugs reported in the literature and evaluated in clinical trials. These models were complemented by a discovery pattern-based approach. Results: Accuracy classifier based on PubMedBERT achieved the best performance (F1= 0.854) in classifying semantic predications. Among five knowledge graph completion models, TransE outperformed others (MR = 0.923, Hits@1=0.417). Some known drugs linked to COVID-19 in the literature were identified, as well as some candidate drugs that have not yet been studied. Discovery patterns enabled generation of plausible hypotheses regarding the relationships between the candidate drugs and COVID-19. Among them, five highly ranked and novel drugs (paclitaxel, SB 203580, alpha 2-antiplasmin, pyrrolidine dithiocarbamate, and butylated hydroxytoluene) with their mechanistic explanations were further discussed. Conclusion: We show that an LBD approach can be feasible for discovering drug candidates for COVID-19, and for generating mechanistic explanations. Our approach can be generalized to other diseases as well as to other clinical questions.

preprint2021arXiv

Environment-Aware and Training-Free Beam Alignment for mmWave Massive MIMO via Channel Knowledge Map

Millimeter wave (mmWave) massive multiple-input multiple-output (MIMO) communication system is expected to achieve enormous transmission rate, provided that the transmit and receive beams are properly aligned with the MIMO channel. However, existing beam alignment techniques rely on either channel estimation or beam sweeping, which incur prohibitively high training overhead, especially for future wireless systems with further increased antenna dimensions and more stringent requirement on cost-effective hardware architectures. In this paper, we propose a new beam alignment technique, which is environment-aware and training-free, by utilizing the emerging concept of channel knowledge map (CKM), together with the user location information that is readily available in contemporary wireless systems. CKM is a site-specific database, tagged with the transmitter/receiver locations, which contains useful channel information to facilitate or even obviate real-time channel state information (CSI) acquistion. Two instances of CKM are proposed for beam alignment in mmWave massive MIMO systems, namely channel path map (CPM) and beam index map (BIM). It is shown that compared with existing training-based beam alignment schemes, the proposed CKM-enabled environment-aware beam alignment is able to drastically improve the effective communication rate, even with moderate user location errors, thanks to its significant saving of the prohibitive training overhead.

preprint2021arXiv

Extracting Lifestyle Factors for Alzheimer's Disease from Clinical Notes Using Deep Learning with Weak Supervision

Since no effective therapies exist for Alzheimer's disease (AD), prevention has become more critical through lifestyle factor changes and interventions. Analyzing electronic health records (EHR) of patients with AD can help us better understand lifestyle's effect on AD. However, lifestyle information is typically stored in clinical narratives. Thus, the objective of the study was to demonstrate the feasibility of natural language processing (NLP) models to classify lifestyle factors (e.g., physical activity and excessive diet) from clinical texts. We automatically generated labels for the training data by using a rule-based NLP algorithm. We conducted weak supervision for pre-trained Bidirectional Encoder Representations from Transformers (BERT) models on the weakly labeled training corpus. These models include the BERT base model, PubMedBERT(abstracts + full text), PubMedBERT(only abstracts), Unified Medical Language System (UMLS) BERT, Bio BERT, and Bio-clinical BERT. We performed two case studies: physical activity and excessive diet, in order to validate the effectiveness of BERT models in classifying lifestyle factors for AD. These models were compared on the developed Gold Standard Corpus (GSC) on the two case studies. The PubmedBERT(Abs) model achieved the best performance for physical activity, with its precision, recall, and F-1 scores of 0.96, 0.96, and 0.96, respectively. Regarding classifying excessive diet, the Bio BERT model showed the highest performance with perfect precision, recall, and F-1 scores. The proposed approach leveraging weak supervision could significantly increase the sample size, which is required for training the deep learning models. The study also demonstrates the effectiveness of BERT models for extracting lifestyle factors for Alzheimer's disease from clinical notes.

preprint2021arXiv

HexCNN: A Framework for Native Hexagonal Convolutional Neural Networks

Hexagonal CNN models have shown superior performance in applications such as IACT data analysis and aerial scene classification due to their better rotation symmetry and reduced anisotropy. In order to realize hexagonal processing, existing studies mainly use the ZeroOut method to imitate hexagonal processing, which causes substantial memory and computation overheads. We address this deficiency with a novel native hexagonal CNN framework named HexCNN. HexCNN takes hexagon-shaped input and performs forward and backward propagation on the original form of the input based on hexagon-shaped filters, hence avoiding computation and memory overheads caused by imitation. For applications with rectangle-shaped input but require hexagonal processing, HexCNN can be applied by padding the input into hexagon-shape as preprocessing. In this case, we show that the time and space efficiency of HexCNN still outperforms existing hexagonal CNN methods substantially. Experimental results show that compared with the state-of-the-art models, which imitate hexagonal processing but using rectangle-shaped filters, HexCNN reduces the training time by up to 42.2%. Meanwhile, HexCNN saves the memory space cost by up to 25% and 41.7% for loading the input and performing convolution, respectively.

preprint2021arXiv

INSQ: An Influential Neighbor Set Based Moving kNN Query Processing System

We revisit the moving k nearest neighbor (MkNN) query, which computes one's k nearest neighbor set and maintains it while at move. Existing MkNN algorithms are mostly safe region based, which lack efficiency due to either computing small safe regions with a high recomputation frequency or computing larger safe regions but with a high cost for each computation. In this demonstration, we showcase a system named INSQ that adopts a novel algorithm called the Influential Neighbor Set (INS) algorithm to process the MkNN query in both two-dimensional Euclidean space and road networks. This algorithm uses a small set of safe guarding objects instead of safe regions. As long as the the current k nearest neighbors are closer to the query object than the safe guarding objects are, the current k nearest neighbors stay valid and no recomputation is required. Meanwhile, the region defined by the safe guarding objects is the largest possible safe region. This means that the recomputation frequency is also minimized and hence, the INS algorithm achieves high overall query processing efficiency.

preprint2021arXiv

Mechanical Properties of Atomically Thin Tungsten Dichalcogenides: WS$_2$, WSe$_2$ and WTe$_2$

Two-dimensional (2D) tungsten disulfide (WS$_2$), tungsten diselenide (WSe$_2$), and tungsten ditelluride (WTe$_2$) draw increasing attention due to their attractive properties deriving from the heavy tungsten and chalcogenide atoms, but their mechanical properties are still mostly unknown. Here, we determine the intrinsic and air-aged mechanical properties of mono-, bi-, and trilayer (1-3L) WS$_2$, WSe$_2$ and WTe$_2$ using a complementary suite of experiments and theoretical calculations. High-quality 1L WS$_2$ has the highest Young's modulus (302.4+-24.1 GPa) and strength (47.0+-8.6 GPa) of the entire family, overpassing those of 1L WSe$_2$ (258.6+-38.3 and 38.0+-6.0 GPa, respectively) and WTe$_2$ (149.1+-9.4 and 6.4+-3.3 GPa, respectively). However, the elasticity and strength of WS$_2$ decrease most dramatically with increased thickness among the three materials. We interpret the phenomenon by the different tendencies for interlayer sliding in equilibrium state and under in-plane strain and out-of-plane compression conditions in the indentation process, revealed by finite element method (FEM) and density functional theory (DFT) calculations including van der Waals (vdW) interactions. We also demonstrate that the mechanical properties of the high-quality 1-3L WS$_2$ and WSe$_2$ are largely stable in the air for up to 20 weeks. Intriguingly, the 1-3L WSe$_2$ shows increased modulus and strength values with aging in the air. This is ascribed to oxygen doping, which reinforces the structure. The present study will facilitate the design and use of 2D tungsten dichalcogenides in applications, such as strain engineering and flexible field-effect transistors (FETs).

preprint2021arXiv

Online detection of cascading change-points

We propose an online detection procedure for cascading failures in the network from sequential data, which can be modeled as multiple correlated change-points happening during a short period. We consider a temporal diffusion network model to capture the temporal dynamic structure of multiple change-points and develop a sequential Shewhart procedure based on the generalized likelihood ratio statistics based on the diffusion network model assuming unknown post-change distribution parameters. We also tackle the computational complexity posed by the unknown propagation. Numerical experiments demonstrate the good performance for detecting cascade failures.

preprint2021arXiv

TEMImageNet Training Library and AtomSegNet Deep-Learning Models for High-Precision Atom Segmentation, Localization, Denoising, and Super-Resolution Processing of Atomic-Resolution Images

Atom segmentation and localization, noise reduction and deblurring of atomic-resolution scanning transmission electron microscopy (STEM) images with high precision and robustness is a challenging task. Although several conventional algorithms, such has thresholding, edge detection and clustering, can achieve reasonable performance in some predefined sceneries, they tend to fail when interferences from the background are strong and unpredictable. Particularly, for atomic-resolution STEM images, so far there is no well-established algorithm that is robust enough to segment or detect all atomic columns when there is large thickness variation in a recorded image. Herein, we report the development of a training library and a deep learning method that can perform robust and precise atom segmentation, localization, denoising, and super-resolution processing of experimental images. Despite using simulated images as training datasets, the deep-learning model can self-adapt to experimental STEM images and shows outstanding performance in atom detection and localization in challenging contrast conditions and the precision consistently outperforms the state-of-the-art two-dimensional Gaussian fit method. Taking a step further, we have deployed our deep-learning models to a desktop app with a graphical user interface and the app is free and open-source. We have also built a TEM ImageNet project website for easy browsing and downloading of the training data.

preprint2021arXiv

The evolution of network controllability in growing networks

The study of network structural controllability focuses on the minimum number of driver nodes needed to control a whole network. Despite intensive studies on this topic, most of them consider static networks only. It is well-known, however, that real networks are growing, with new nodes and links added to the system. Here, we analyze controllability of evolving networks and propose a general rule for the change of driver nodes. We further apply the rule to solve the problem of network augmentation subject to the controllability constraint. The findings fill a gap in our understanding of network controllability and shed light on controllability of real systems.

preprint2021arXiv

The Labeled Multiple Canonical Correlation Analysis for Information Fusion

The objective of multimodal information fusion is to mathematically analyze information carried in different sources and create a new representation which will be more effectively utilized in pattern recognition and other multimedia information processing tasks. In this paper, we introduce a new method for multimodal information fusion and representation based on the Labeled Multiple Canonical Correlation Analysis (LMCCA). By incorporating class label information of the training samples,the proposed LMCCA ensures that the fused features carry discriminative characteristics of the multimodal information representations, and are capable of providing superior recognition performance. We implement a prototype of LMCCA to demonstrate its effectiveness on handwritten digit recognition,face recognition and object recognition utilizing multiple features,bimodal human emotion recognition involving information from both audio and visual domains. The generic nature of LMCCA allows it to take as input features extracted by any means,including those by deep learning (DL) methods. Experimental results show that the proposed method enhanced the performance of both statistical machine learning (SML) methods, and methods based on DL.

preprint2021arXiv

Transforming Fading Channel from Fast to Slow: IRS-Assisted High-Mobility Communication

In this paper, we study a new intelligent refracting surface (IRS)-assisted high-mobility communication with the IRS deployed in a high-speed moving vehicle to assist its passenger's communication with a static base station (BS) on the roadside. The vehicle's high Doppler frequency results in a fast fading channel between the BS and the passenger/user, which renders channel estimation for the IRS with a large number of refracting elements a more challenging task as compared to the conventional case with low-mobility users only. In order to mitigate the Doppler effect and reap the full IRS passive beamforming gain with low training overhead, we propose a new and efficient transmission protocol to execute channel estimation and IRS refraction design for data transmission. Specifically, by exploiting the quasi-static channel between the IRS and user both moving at the same high speed, we first estimate the cascaded BS-IRS-user channel with the Doppler effect compensated. Then, we estimate the instantaneous BS-user fast fading channel (without IRS refraction) and tune the IRS refraction over time accordingly to align the cascaded channel with the BS-user direct channel, thus maximizing the IRS's passive beamforming gain as well as converting their combined channel from fast to slow fading. Simulation results show the effectiveness of the proposed channel estimation scheme and passive beamforming design as compared to various benchmark schemes.

preprint2021arXiv

UAV-Enabled Wireless Power Transfer: A Tutorial Overview

Unmanned aerial vehicle (UAV)-enabled wireless power transfer (WPT) has recently emerged as a promising technique to provide sustainable energy supply for widely distributed low-power ground devices (GDs) in large-scale wireless networks. Compared with the energy transmitters (ETs) in conventional WPT systems which are deployed at fixed locations, UAV-mounted aerial ETs can fly flexibly in the three-dimensional (3D) space to charge nearby GDs more efficiently. This paper provides a tutorial overview on UAV-enabled WPT and its appealing applications, in particular focusing on how to exploit UAVs' controllable mobility via their 3D trajectory design to maximize the amounts of energy transferred to all GDs in a wireless network with fairness. First, we consider the single-UAV-enabled WPT scenario with one UAV wirelessly charging multiple GDs at known locations. To solve the energy maximization problem in this case, we present a general trajectory design framework consisting of three innovative approaches to optimize the UAV trajectory, which are multi-location hovering, successive-hover-and-fly, and time-quantization-based optimization, respectively. Next, we consider the multi-UAV-enabled WPT scenario where multiple UAVs cooperatively charge many GDs in a large area. Building upon the single-UAV trajectory design, we propose two efficient schemes to jointly optimize multiple UAVs' trajectories, based on the principles of UAV swarming and GD clustering, respectively. Furthermore, we consider two important extensions of UAV-enabled WPT, namely UAV-enabled wireless powered communication networks (WPCN) and UAV-enabled wireless powered mobile edge computing (MEC).

preprint2021arXiv

Vector Measurements Using All Optical Scalar Atomic Magnetometers

Vector field measurement is demonstrated with an all-optical scalar atomic magnetometer using intrinsic parameters related to its scalar operation. The Bell-Bloom type atomic magnetometer measures the Larmor precession of cesium atoms through on-resonant absorption of a probe beam. While the AC component of the probe signal is used for the field magnitude measurement, the probe DC signal contains information about the polar angle, defined as the angle between the magnetic field and the probe beam. Additional polar angle information is obtained from the light-shift-induced magnetic field caused by the frequency modulation of the probe beam. With a measurement time of 100 milliseconds, better than 0.02 degree sensitivity has been achieved using a commercial miniaturized sensor at the optimal sensor orientation. The angle measurement accuracy is checked against an optical encoder over the entire polar angle range of 0 to 180 degrees. Better than 1 degree error is recorded over most set polar angles. Azimuthal angle measurement is also exhibited with two orthogonally oriented sensors.

preprint2020arXiv

A heterogeneous branch and multi-level classification network for person re-identification

Convolutional neural networks with multiple branches have recently been proved highly effective in person re-identification (re-ID). Researchers design multi-branch networks using part models, yet they always attribute the effectiveness to multiple parts. In addition, existing multi-branch networks always have isomorphic branches, which lack structural diversity. In order to improve this problem, we propose a novel Heterogeneous Branch and Multi-level Classification Network (HBMCN), which is designed based on the pre-trained ResNet-50 model. A new heterogeneous branch, SE-Res-Branch, is proposed based on the SE-Res module, which consists of the Squeeze-and-Excitation block and the residual block. Furthermore, a new multi-level classification joint objective function is proposed for the supervised learning of HBMCN, whereby multi-level features are extracted from multiple high-level layers and concatenated to represent a person. Based on three public person re-ID benchmarks (Market1501, DukeMTMC-reID and CUHK03), experimental results show that the proposed HBMCN reaches 94.4%, 85.7% and 73.8% in Rank-1, and 85.7%, 74.6% and 69.0% in mAP, achieving a state-of-the-art performance. Further analysis demonstrates that the specially designed heterogeneous branch performs better than an isomorphic branch, and multi-level classification provides more discriminative features compared to single-level classification. As a result, HBMCN provides substantial further improvements in person re-ID tasks.

preprint2020arXiv

A Low-Complexity Beamforming Design for Multiuser Wireless Energy Transfer

Wireless energy transfer (WET) is a green enabler of low-power Internet of Things (IoT). Therein, traditional optimization schemes relying on full channel state information (CSI) are often too costly to implement due to excessive energy consumption and high processing complexity. This letter proposes a simple, yet effective, energy beamforming scheme that allows a multi-antenna power beacon (PB) to fairly power a set of IoT devices by only relying on the first-order statistics of the channels. In addition to low complexity, the proposed scheme performs favorably as compared to benchmarking schemes and its performance improves as the number of PB's antennas increases. Finally, it is shown that further performance improvement can be achieved through proper angular rotations of the PB.

preprint2020arXiv

A New Observable for Measuring CP Property of Top-Higgs Interaction

We propose a new dihedral angle observable to measure the CP property of the interaction of top quark and Higgs boson in the $t\bar{t}H$ production at the 14~TeV LHC. We consider two decay modes of the Higgs boson, $H\to b\bar{b}$ and $H\to γγ$ and show that the dihedral angle distribution is able to distinguish the CP-even and the CP-odd hypothesis at 95\% confidence level with an integrated luminosity of $\sim 180~{\rm fb}^{-1}$.

preprint2020arXiv

A New Store-then-Amplify-and-Forward Protocol for UAV Mobile Relaying

In this letter, we consider the use of an unmanned aerial vehicle (UAV) as a mobile relay to assist the communication between two ground users without a direct link. We propose a novel store-then-amplify-and-forward (SAF) relaying protocol for the UAV to exploit its mobility jointly with the low-complexity AF relaying. Specifically, the received signal from the source is first stored in a buffer at the UAV, then amplified and forwarded to the destination when the UAV flies closer to the destination. With this new SAF protocol, we aim to maximize the throughput of the UAV-enabled relaying system by jointly optimizing the source/UAV transmit power and the UAV trajectory, as well as the time-slot pairing for each data packet received and forwarded by the UAV. As this problem is a non-convex mixed integer optimization problem that is difficult to solve, we propose an efficient algorithm for obtaining a suboptimal solution for it by applying the techniques of Hungary algorithm, alternating optimization and successive convex approximation. Numerical results show that the proposed mobile SAF relaying outperforms the conventional AF relaying without signal storing.

preprint2020arXiv

Adaptive Precision Training: Quantify Back Propagation in Neural Networks with Fixed-point Numbers

Adaptive Precision Training: Quantify Back Propagation in Neural Networks with Fixed-point Numbers. Recent emerged quantization technique has been applied to inference of deep neural networks for fast and efficient execution. However, directly applying quantization in training can cause significant accuracy loss, thus remaining an open challenge.

preprint2020arXiv

Anchor-Assisted Intelligent Reflecting Surface Channel Estimation for Multiuser Communications

Due to the passive nature of Intelligent Reflecting Surface (IRS), channel estimation is a fundamental challenge in IRS-aided wireless networks. Particularly, as the number of IRS reflecting elements and/or that of IRS-served users increase, the channel training overhead becomes excessively high. To tackle this challenge, we propose in this paper a new anchor-assisted two-phase channel estimation scheme, where two anchor nodes, namely A1 and A2, are deployed near the IRS for helping the base station (BS) to acquire the cascaded BS-IRS-user channels. Specifically, in the first phase, the partial channel state information (CSI), i.e., the element-wise channel gain square, of the BS-IRS link is obtained by estimating the BS-IRS-A1/A2 channels and the A1-IRS-A2 channel, separately. Then, in the second phase, by leveraging such partial knowledge of the BS-IRS channel that is common to all users, the individual cascaded BS-IRS-user channels are efficiently estimated. Simulation results demonstrate that the proposed anchor-assisted channel estimation scheme is able to achieve comparable mean-squared error (MSE) performance as compared to the conventional scheme, but with significantly reduced channel training time.

preprint2020arXiv

Beamforming Optimization for Wireless Network Aided by Intelligent Reflecting Surface with Discrete Phase Shifts

Intelligent reflecting surface (IRS) is a cost-effective solution for achieving high spectrum and energy efficiency in future wireless networks by leveraging massive low-cost passive elements that are able to reflect the signals with adjustable phase shifts. Prior works on IRS mainly consider continuous phase shifts at reflecting elements, which are practically difficult to implement due to the hardware limitation. In contrast, we study in this paper an IRS-aided wireless network, where an IRS with only a finite number of phase shifts at each element is deployed to assist in the communication from a multi-antenna access point (AP) to multiple single-antenna users. We aim to minimize the transmit power at the AP by jointly optimizing the continuous transmit precoding at the AP and the discrete reflect phase shifts at the IRS, subject to a given set of minimum signal-to-interference-plus-noise ratio (SINR) constraints at the user receivers. The considered problem is shown to be a mixed-integer non-linear program (MINLP) and thus is difficult to solve in general. To tackle this problem, we first study the single-user case with one user assisted by the IRS and propose both optimal and suboptimal algorithms for solving it. Besides, we analytically show that as compared to the ideal case with continuous phase shifts, the IRS with discrete phase shifts achieves the same squared power gain in terms of asymptotically large number of reflecting elements, while a constant proportional power loss is incurred that depends only on the number of phase-shift levels. The proposed designs for the single-user case are also extended to the general setup with multiple users among which some are aided by the IRS. Simulation results verify our performance analysis as well as the effectiveness of our proposed designs as compared to various benchmark schemes.

preprint2020arXiv

BrePartition: Optimized High-Dimensional kNN Search with Bregman Distances

Bregman distances (also known as Bregman divergences) are widely used in machine learning, speech recognition and signal processing, and kNN searches with Bregman distances have become increasingly important with the rapid advances of multimedia applications. Data in multimedia applications such as images and videos are commonly transformed into space of hundreds of dimensions. Such high-dimensional space has posed significant challenges for existing kNN search algorithms with Bregman distances, which could only handle data of medium dimensionality (typically less than 100). This paper addresses the urgent problem of high-dimensional kNN search with Bregman distances. We propose a novel partition-filter-refinement framework. Specifically, we propose an optimized dimensionality partitioning scheme to solve several non-trivial issues. First, an effective bound from each partitioned subspace to obtain exact kNN results is derived. Second, we conduct an in-depth analysis of the optimized number of partitions and devise an effective strategy for partitioning. Third, we design an efficient integrated index structure for all the subspaces together to accelerate the search processing. Moreover, we extend our exact solution to an approximate version by a trade-off between the accuracy and efficiency. Experimental results on four real-world datasets and two synthetic datasets show the clear advantage of our method in comparison to state-of-the-art algorithms.

preprint2020arXiv

Channel Estimation and Passive Beamforming for Intelligent Reflecting Surface: Discrete Phase Shift and Progressive Refinement

Prior studies on Intelligent Reflecting Surface (IRS) have mostly assumed perfect channel state information (CSI) available for designing the IRS passive beamforming as well as the continuously adjustable phase shift at each of its reflecting elements, which, however, have simplified two challenging issues for implementing IRS in practice, namely, its channel estimation and passive beamforming designs both under the constraint of discrete phase shifts. To address them, we consider in this paper an IRS-aided single-user communication system with discrete phase shifts and design the IRS training reflection matrix for channel estimation as well as the passive beamforming for data transmission, both subject to the constraint of discrete phase shifts. We show that the training reflection matrix design for discrete phase shifts greatly differs from that for continuous phase shifts, and thus the corresponding passive beamforming should be optimized by taking into account the correlated channel estimation error due to discrete phase shifts. Specifically, we consider a practical block-based transmission, where each block has a finite (insufficient) number of training symbols for channel estimation. A novel hierarchical training reflection design is proposed to progressively estimate IRS elements' channels over multiple blocks by exploiting IRS-elements grouping and partition. Based on the resolved IRS channels in each block, we further design the progressive passive beamforming at the IRS with discrete phase shifts to improve the achievable rate for data transmission over the blocks.

preprint2020arXiv

Cooperative Double-IRS Aided Communication: Beamforming Design and Power Scaling

Intelligent reflecting surface (IRS) is a promising technology to support high performance wireless communication. By adaptively configuring the reflection amplitude and/or phase of each passive reflecting element on it, the IRS can reshape the electromagnetic environment in favour of signal transmission. This letter advances the existing research by proposing and analyzing a double-IRS aided wireless communication system. Under the reasonable assumption that the reflection channel from IRS 1 to IRS 2 is of rank 1 (e.g., line-of-sight channel), we propose a joint passive beamforming design for the two IRSs. Based on this, we show that deploying two cooperative IRSs with in total K elements can yield a power gain of order O(K^4), which greatly outperforms the case of deploying one traditional IRS with a power gain of order O(K^2). Our simulation results validate that the performance of deploying two cooperative IRSs is significantly better than that of deploying one IRS given a sufficient total number of IRS elements. We also extend our line-of-sight channel model to show how different channel models affect the performance of the double-IRS aided wireless communication system.

preprint2020arXiv

Cooperative NOMA for Downlink Asymmetric Interference Cancellation

This letter advances the non-orthogonal multiple access (NOMA) technique for cellular downlink co-channel interference mitigation, via exploiting the (limited) cooperation among base stations (BSs). Specifically, we consider a simplified but practically relevant scenario of two co-channel cells with asymmetric interference, i.e., only the user in one cell receives the strong interference from the BS in the other cell. To mitigate such interference, we propose a new cooperative NOMA scheme, where the interfered user's serving BS sends a superposed signal comprising both the desired message and the co-channel user's message (shared by the interfering BS). The co-channel user's signal is aimed to add constructively with the interfering BS's signal at the interfered user's receiver so that the combined interference with enhanced power can be effectively decoded and cancelled. This thus leads to a new problem on how to optimally allocate the transmit power for the two superposed messages. We provide the closed-form solution to this problem and investigate the conditions under which the performance of the proposed scheme is superior over the existing schemes.

preprint2020arXiv

Counting Classical Nodes in Quantum Networks

Quantum networks illustrate the use of connected nodes of quantum systems as the backbone of distributed quantum information processing. When the network nodes are entangled in graph states, such a quantum platform is indispensable to almost all the existing distributed quantum tasks. Unfortunately, real networks unavoidably suffer from noise and technical restrictions, making nodes transit from quantum to classical at worst. Here, we introduce a figure of merit in terms of the number of classical nodes for quantum networks in arbitrary graph states. Such a network property is revealed by exploiting a novel Einstein-Podolsky-Rosen steerability. Experimentally, we demonstrate photonic quantum networks of $n_q$ quantum nodes and $n_c$ classical nodes with $n_q$ up to 6 and $n_c$ up to 18 using spontaneous parametric down-conversion entanglement sources. We show that the proposed method is faithful in quantifying the classical defects in prepared multiphoton quantum networks. Our results provide novel identification of generic quantum networks and nonclassical correlations in graph states.

preprint2020arXiv

Creation of 2000-atom Greenberger-Horne-Zeilinger states by entanglement amplification

We propose a novel entanglement-creation scheme in a multi-atom ensemble, named entanglement amplification, which converts unentangled states into entangled states and amplifies less-entangled ones to maximally-entangled Greenberger-Horne-Zeilinger (GHZ) states. The scheme starts with a multi-atom ensemble initialized in a coherent spin state. By shifting the energy of a particular Dicke state, we break the Hilbert space of the ensemble into two isolated subspaces to tear the coherent spin state into two components so that entanglement is introduced. After that, we utilize the isolated subspaces to further enhance the entanglement by coherently separating the two components. By single-particle Rabi drivings on atoms in a high-finesse optical cavity illuminated by a single-frequency light, 2000-atom GHZ states can be created with a fidelity above 80% in an experimentally achievable system, making resources of ensembles at Heisenberg limit practically available for quantum metrology.

preprint2020arXiv

Data User-Based Attribute-Based Encryption

Attribute-Based Encryption (ABE) has emerged as an information-centric public-key cryptographic system which allows a data owner to share data, according to access policy, with multiple data users based on the attributes they possess, without knowing their identities. In the original ABE schemes, a central authority administrates the system and issues secret keys to data users based on their attributes and both the owner and users need to trust a specific CA. However, in certain real-world applications, the data users would not trust anyone but themselves. For such situations, we introduce a new decentralization model of ABE, termed Data User-based ABE (DU-ABE), which is managed jointly by the data users. DU-ABE is the first decentralized ABE scheme that replaces the authorities with the data users without employing any other extra entities.

preprint2020arXiv

Differentiating Population Spatial Behavior using Representative Features of Geospatial Mobility (ReFGeM)

Understanding how humans use and consume space by comparing stratified groups, either through observation or controlled study, is key to designing better spaces, cities, and policies. GPS data traces provide detailed movement patterns of individuals but can be difficult to interpret due to the scale and scope of the data collected. For actionable insights, GPS traces are usually reduced to one or more features which express the spatial phenomenon of interest. However, it is not always clear which spatial features should be employed, and substantial effort can be invested into designing features which may or may not provide insight. In this paper we present an alternative approach: a standardized feature set with actionable interpretations that can be efficiently run against many datasets. We show that these features can distinguish between disparate human mobility patterns, although no single feature can distinguish them alone.

preprint2020arXiv

DWM: A Decomposable Winograd Method for Convolution Acceleration

Winograd's minimal filtering algorithm has been widely used in Convolutional Neural Networks (CNNs) to reduce the number of multiplications for faster processing. However, it is only effective on convolutions with kernel size as 3x3 and stride as 1, because it suffers from significantly increased FLOPs and numerical accuracy problem for kernel size larger than 3x3 and fails on convolution with stride larger than 1. In this paper, we propose a novel Decomposable Winograd Method (DWM), which breaks through the limitation of original Winograd's minimal filtering algorithm to a wide and general convolutions. DWM decomposes kernels with large size or large stride to several small kernels with stride as 1 for further applying Winograd method, so that DWM can reduce the number of multiplications while keeping the numerical accuracy. It enables the fast exploring of larger kernel size and larger stride value in CNNs for high performance and accuracy and even the potential for new CNNs. Comparing against the original Winograd, the proposed DWM is able to support all kinds of convolutions with a speedup of ~2, without affecting the numerical accuracy.

preprint2020arXiv

Enabling Panoramic Full-Angle Reflection via Aerial Intelligent Reflecting Surface

This paper proposes a new three dimensional (3D) networking architecture enabled by aerial intelligent reflecting surface (AIRS) to achieve panoramic signal reflection from the sky. Compared to the conventional terrestrial IRS, AIRS not only enjoys higher deployment flexibility, but also is able to achieve 360$^\circ$ panoramic full-angle reflection and requires fewer reflections in general due to its higher likelihood of having line of sight (LoS) links with the ground nodes. We focus on the problem to maximize the worst-case signal-to-noise ratio (SNR) in a given coverage area by jointly optimizing the transmit beamforming, AIRS placement and phase shifts. The formulated problem is non-convex and the optimization variables are coupled with each other in an intricate manner. To tackle this problem, we first consider the special case of single-location SNR maximization to gain useful insights, for which the optimal solution is obtained in closed-form. Then for the general case of area coverage, an efficient suboptimal solution is proposed by exploiting the similarity between phase shifts optimization for IRS and analog beamforming for the conventional phase array. Numerical results show that the proposed design can achieve significant performance gain than heuristic AIRS deployment schemes.

preprint2020arXiv

ESPRIT: Explaining Solutions to Physical Reasoning Tasks

Neural networks lack the ability to reason about qualitative physics and so cannot generalize to scenarios and tasks unseen during training. We propose ESPRIT, a framework for commonsense reasoning about qualitative physics in natural language that generates interpretable descriptions of physical events. We use a two-step approach of first identifying the pivotal physical events in an environment and then generating natural language descriptions of those events using a data-to-text approach. Our framework learns to generate explanations of how the physical simulation will causally evolve so that an agent or a human can easily reason about a solution using those interpretable descriptions. Human evaluations indicate that ESPRIT produces crucial fine-grained details and has high coverage of physical concepts compared to even human annotations. Dataset, code and documentation are available at https://github.com/salesforce/esprit.

preprint2020arXiv

Explainable Tensorized Neural Ordinary Differential Equations forArbitrary-step Time Series Prediction

We propose a continuous neural network architecture, termed Explainable Tensorized Neural Ordinary Differential Equations (ETN-ODE), for multi-step time series prediction at arbitrary time points. Unlike the existing approaches, which mainly handle univariate time series for multi-step prediction or multivariate time series for single-step prediction, ETN-ODE could model multivariate time series for arbitrary-step prediction. In addition, it enjoys a tandem attention, w.r.t. temporal attention and variable attention, being able to provide explainable insights into the data. Specifically, ETN-ODE combines an explainable Tensorized Gated Recurrent Unit (Tensorized GRU or TGRU) with Ordinary Differential Equations (ODE). The derivative of the latent states is parameterized with a neural network. This continuous-time ODE network enables a multi-step prediction at arbitrary time points. We quantitatively and qualitatively demonstrate the effectiveness and the interpretability of ETN-ODE on five different multi-step prediction tasks and one arbitrary-step prediction task. Extensive experiments show that ETN-ODE can lead to accurate predictions at arbitrary time points while attaining best performance against the baseline methods in standard multi-step time series prediction.

preprint2020arXiv

Fast Beam Training for IRS-Assisted Multiuser Communications

In this letter, we consider an intelligent reflecting surface (IRS)-assisted multiuser communication system, where an IRS is deployed to provide virtual line-of-sight (LoS) links between an access point (AP) and multiple users. We consider the practical codebook-based IRS passive beamforming and study efficient design for IRS reflect beam training, which is challenging due to the large number of IRS reflecting elements. In contrast to the conventional single-beam training, we propose a new multi-beam training method by dividing the IRS reflecting elements into multiple sub-arrays and designing their simultaneous multi-beam steering over time. By simply comparing the received signal power over time, each user can detect its optimal IRS beam direction with a high probability, even without searching over all possible beam directions as the single-beam training. Simulation results show that our proposed multi-beam training significantly reduces the training time of conventional single-beam training and yet achieves comparable IRS passive beamforming performance for data transmission.

preprint2020arXiv

Fast Channel Estimation for IRS-Assisted OFDM

In this letter, we study efficient channel estimation for an intelligent reflecting surface (IRS)-assisted orthogonal frequency division multiplexing (OFDM) system to achieve minimum training time. First, a fast channel estimation scheme with reduced OFDM symbol duration is proposed for arbitrary frequency-selective fading channels. Next, under the typical condition that the IRS-user channel is line-of-sight (LoS) dominant, another fast channel estimation scheme based on the novel concept of sampling-wise IRS reflection variation is proposed. Moreover, the pilot signal and IRS training reflection pattern are jointly optimized for both proposed schemes. Finally, the proposed schemes are compared in terms of training time and channel estimation performance via simulations, as well as against benchmark schemes.

preprint2020arXiv

Generative Image Inpainting with Submanifold Alignment

Image inpainting aims at restoring missing regions of corrupted images, which has many applications such as image restoration and object removal. However, current GAN-based generative inpainting models do not explicitly exploit the structural or textural consistency between restored contents and their surrounding contexts.To address this limitation, we propose to enforce the alignment (or closeness) between the local data submanifolds (or subspaces) around restored images and those around the original (uncorrupted) images during the learning process of GAN-based inpainting models. We exploit Local Intrinsic Dimensionality (LID) to measure, in deep feature space, the alignment between data submanifolds learned by a GAN model and those of the original data, from a perspective of both images (denoted as iLID) and local patches (denoted as pLID) of images. We then apply iLID and pLID as regularizations for GAN-based inpainting models to encourage two levels of submanifold alignment: 1) an image-level alignment for improving structural consistency, and 2) a patch-level alignment for improving textural details. Experimental results on four benchmark datasets show that our proposed model can generate more accurate results than state-of-the-art models.

preprint2020arXiv

Grafted network for person re-identification

Convolutional neural networks have shown outstanding effectiveness in person re-identification (re-ID). However, the models always have large number of parameters and much computation for mobile application. In order to relieve this problem, we propose a novel grafted network (GraftedNet), which is designed by grafting a high-accuracy rootstock and a light-weighted scion. The rootstock is based on the former parts of ResNet-50 to provide a strong baseline, while the scion is a new designed module, composed of the latter parts of SqueezeNet, to compress the parameters. To extract more discriminative feature representation, a joint multi-level and part-based feature is proposed. In addition, to train GraftedNet efficiently, we propose an accompanying learning method, by adding an accompanying branch to train the model in training and removing it in testing for saving parameters and computation. On three public person re-ID benchmarks (Market1501, DukeMTMC-reID and CUHK03), the effectiveness of GraftedNet are evaluated and its components are analyzed. Experimental results show that the proposed GraftedNet achieves 93.02%, 85.3% and 76.2% in Rank-1 and 81.6%, 74.7% and 71.6% in mAP, with only 4.6M parameters.

preprint2020arXiv

Holographic MIMO Surfaces for 6G Wireless Networks: Opportunities, Challenges, and Trends

Future wireless networks are expected to evolve towards an intelligent and software reconfigurable paradigm enabling ubiquitous communications between humans and mobile devices. They will be also capable of sensing, controlling, and optimizing the wireless environment to fulfill the visions of low-power, high-throughput, massively-connected, and low-latency communications. A key conceptual enabler that is recently gaining increasing popularity is the Holographic Multiple Input Multiple Output Surface (HMIMOS) that refers to a low-cost transformative wireless planar structure comprising of sub-wavelength metallic or dielectric scattering particles, which is capable of impacting electromagnetic waves according to desired objectives. In this article, we provide an overview of HMIMOS communications by introducing the available hardware architectures for reconfigurable such metasurfaces and their main characteristics, as well as highlighting the opportunities and key challenges in designing HMIMOS-enabled communications.

preprint2020arXiv

Hybrid Offline-Online Design for UAV-Enabled Data Harvesting in Probabilistic LoS Channel

This paper considers an unmanned aerial vehicle (UAV)-enabled wireless sensor network (WSN) in urban areas, where a UAV is deployed to collect data from distributed sensor nodes (SNs) within a given duration. To characterize the occasional building blockage between the UAV and SNs, we construct the probabilistic line-of-sight (LoS) channel model for a Manhattan-type city by using the combined simulation and data regression method, which is shown in the form of a generalized logistic function of the UAV-SN elevation angle. We assume that only the knowledge of SNs' locations and the probabilistic LoS channel model is known a priori, while the UAV can obtain the instantaneous LoS/Non-LoS channel state information (CSI) with the SNs in real time along its flight. Our objective is to maximize the minimum (average) data collection rate from all the SNs for the UAV. To this end, we formulate a new rate maximization problem by jointly optimizing the UAV three-dimensional (3D) trajectory and transmission scheduling of SNs. Although the optimal solution is intractable due to the lack of the complete UAV-SNs CSI, we propose in this paper a novel and general design method, called hybrid offline-online optimization, to obtain a suboptimal solution to it, by leveraging both the statistical and real-time CSI. Essentially, our proposed method decouples the joint design of UAV trajectory and communication scheduling into two phases: namely, an offline phase that determines the UAV path prior to its flight based on the probabilistic LoS channel model, followed by an online phase that adaptively adjusts the UAV flying speeds along the offline optimized path as well as communication scheduling based on the instantaneous UAV-SNs CSI and SNs' individual amounts of data received accumulatively.

preprint2020arXiv

Intelligent Reflecting Surface Aided Multicasting with Random Passive Beamforming

In this letter, we consider a multicast system where a single-antenna transmitter sends a common message to multiple single-antenna users, aided by an intelligent reflecting surface (IRS) equipped with $N$ passive reflecting elements. Prior works on IRS have mostly assumed the availability of channel state information (CSI) for designing its passive beamforming. However, the acquisition of CSI requires substantial training overhead that increases with $N$. In contrast, we propose in this letter a novel \emph{random passive beamforming} scheme, where the IRS performs independent random reflection for $Q\geq 1$ times in each channel coherence interval without the need of CSI acquisition. For the proposed scheme, we first derive a closed-form approximation of the outage probability, based on which the optimal $Q$ with best outage performance can be efficiently obtained. Then, for the purpose of comparison, we derive a lower bound of the outage probability with traditional CSI-based passive beamforming. Numerical results show that a small $Q$ is preferred in the high-outage regime (or with high rate target) and the optimal $Q$ becomes larger as the outage probability decreases (or as the rate target decreases). Moreover, the proposed scheme significantly outperforms the CSI-based passive beamforming scheme with training overhead taken into consideration when $N$ and/or the number of users are large, thus offering a promising CSI-free alternative to existing CSI-based schemes.

preprint2020arXiv

Intelligent Reflecting Surface Aided Multiple Access: Capacity Region and Deployment Strategy

Intelligent reflecting surface (IRS) is a new promising technology that is able to manipulate the wireless propagation channel via smart and controllable signal reflection. In this paper, we investigate the capacity region of a multiple access channel (MAC) with two users sending independent messages to an access point (AP), aided by $M$ IRS reflecting elements. We consider two practical IRS deployment strategies that lead to different user-AP effective channels, namely, the distributed deployment where the $M$ reflecting elements form two IRSs, each deployed in the vicinity of one user, versus the centralized deployment where all the $M$ reflecting elements are deployed in the vicinity of the AP. For the distributed deployment, we derive the capacity region in closed-form; while for the centralized deployment, we derive a capacity region outer bound and propose an efficient rate-profile based method to characterize an achievable rate region (or capacity region inner bound). Furthermore, we compare the capacity regions of the two cases and draw useful insights into the optimal deployment of IRS in practical systems.

preprint2020arXiv

Intelligent Reflecting Surface Aided Wireless Communications: A Tutorial

Intelligent reflecting surface (IRS) is an enabling technology to engineer the radio signal prorogation in wireless networks. By smartly tuning the signal reflection via a large number of low-cost passive reflecting elements, IRS is capable of dynamically altering wireless channels to enhance the communication performance. It is thus expected that the new IRS-aided hybrid wireless network comprising both active and passive components will be highly promising to achieve a sustainable capacity growth cost-effectively in the future. Despite its great potential, IRS faces new challenges to be efficiently integrated into wireless networks, such as reflection optimization, channel estimation, and deployment from communication design perspectives. In this paper, we provide a tutorial overview of IRS-aided wireless communication to address the above issues, and elaborate its reflection and channel models, hardware architecture and practical constraints, as well as various appealing applications in wireless networks. Moreover, we highlight important directions worthy of further investigation in future work.

preprint2020arXiv

Intelligent Reflecting Surface Assisted Multi-User OFDMA: Channel Estimation and Training Design

To achieve the full passive beamforming gains of intelligent reflecting surface (IRS), accurate channel state information (CSI) is indispensable but practically challenging to acquire, due to the excessive amount of channel parameters to be estimated which increases with the number of IRS reflecting elements as well as that of IRS-served users. To tackle this challenge, we propose in this paper two efficient channel estimation schemes for different channel setups in an IRS-assisted multi-user broadband communication system employing the orthogonal frequency division multiple access (OFDMA). The first channel estimation scheme, which estimates the CSI of all users in parallel simultaneously at the access point (AP), is applicable for arbitrary frequency-selective fading channels. In contrast, the second channel estimation scheme, which exploits a key property that all users share the same (common) IRS-AP channel to enhance the training efficiency and support more users, is proposed for the typical scenario with line-of-sight (LoS) dominant user-IRS channels. For the two proposed channel estimation schemes, we further optimize their corresponding training designs (including pilot tone allocations for all users and IRS time-varying reflection pattern) to minimize the channel estimation error. Moreover, we derive and compare the fundamental limits on the minimum training overhead and the maximum number of supportable users of these two schemes. Simulation results verify the effectiveness of the proposed channel estimation schemes and training designs, and show their significant performance improvement over various benchmark schemes.

preprint2020arXiv

Intelligent Reflecting Surface-Assisted Multiple Access with User Pairing: NOMA or OMA?

The integration of intelligent reflecting surface (IRS) to multiple access networks is a cost-effective solution for boosting spectrum/energy efficiency and enlarging network coverage/connections. However, due to the new capability of IRS in reconfiguring the wireless propagation channels, it is fundamentally unknown which multiple access scheme is superior in the IRS-assisted wireless network. In this letter, we pursue a theoretical performance comparison between non-orthogonal multiple access (NOMA) and orthogonal multiple access (OMA) in the IRS-assisted downlink communication, for which the transmit power minimization problems are formulated under the discrete unit-modulus reflection constraint on each IRS element. We analyze the minimum transmit powers required by different multiple access schemes and compare them numerically, which turn out to not fully comply with the stereotyped superiority of NOMA over OMA in conventional systems without IRS. Moreover, to avoid the exponential complexity of the brute-force search for the optimal discrete IRS phase shifts, we propose a low-complexity solution to achieve near-optimal performance.

preprint2020arXiv

Intelligent Reflecting Surface-Enhanced OFDM: Channel Estimation and Reflection Optimization

In the intelligent reflecting surface (IRS)-enhanced wireless communication system, channel state information (CSI) is of paramount importance for achieving the passive beamforming gain of IRS, which, however, is a practically challenging task due to its massive number of passive elements without transmitting/receiving capabilities. In this letter, we propose a practical transmission protocol to execute channel estimation and reflection optimization successively for an IRS-enhanced orthogonal frequency division multiplexing (OFDM) system. Under the unit-modulus constraint, a novel reflection pattern at the IRS is designed to aid the channel estimation at the access point (AP) based on the received pilot signals from the user, for which the channel estimation error is derived in closed-form. With the estimated CSI, the reflection coefficients are then optimized by a low-complexity algorithm based on the resolved strongest signal path in the time domain. Simulation results corroborate the effectiveness of the proposed channel estimation and reflection optimization methods.

preprint2020arXiv

Intelligent Reflecting Surface: Practical Phase Shift Model and Beamforming Optimization

Intelligent reflecting surface (IRS) that enables the control of the wireless propagation environment has been looked upon as a promising technology for boosting the spectrum and energy efficiency in future wireless communication systems. Prior works on IRS are mainly based on the ideal phase shift model assuming the full signal reflection by each of the elements regardless of its phase shift, which, however, is practically difficult to realize. In contrast, we propose in this paper a practical phase shift model that captures the phase-dependent amplitude variation in the element-wise reflection coefficient. Applying this new model to an IRS-aided wireless system, we formulate a problem to maximize its achievable rate by jointly optimizing the transmit beamforming and the IRS reflect beamforming. The formulated problem is non-convex and difficult to be optimally solved in general, for which we propose a low-complexity suboptimal solution based on the alternating optimization (AO) technique. Simulation results unveil a substantial performance gain achieved by the joint beamforming optimization based on the proposed phase shift model as compared to the conventional ideal model.

preprint2020arXiv

Intelligent Reflecting Surface: Practical Phase Shift Model and Beamforming Optimization

Intelligent reflecting surface (IRS) that enables the control of wireless propagation environment has recently emerged as a promising cost-effective technology for boosting the spectrum and energy efficiency in future wireless communication systems. Prior works on IRS are mainly based on the ideal phase shift model assuming the full signal reflection by each of the elements regardless of its phase shift, which, however, is practically difficult to realize. In contrast, we propose in this paper the practical phase shift model that captures the phase-dependent amplitude variation in the element-wise reflection coefficient. Based on the proposed model and considering an IRS-aided multiuser system with an IRS deployed to assist in the downlink communications from a multi-antenna access point (AP) to multiple single-antenna users, we formulate an optimization problem to minimize the total transmit power at the AP by jointly designing the AP transmit beamforming and the IRS reflect beamforming, subject to the users' individual signal-to-interference-plus-noise ratio (SINR) constraints. Iterative algorithms are proposed to find suboptimal solutions to this problem efficiently by utilizing the alternating optimization (AO) or penalty-based optimization technique. Moreover, we analyze the asymptotic performance loss of the IRS-aided system that employs practical phase shifters but assumes the ideal phase shift model for beamforming optimization, as the number of IRS elements goes to infinity. Simulation results unveil substantial performance gains achieved by the proposed beamforming optimization based on the practical phase shift model as compared to the conventional ideal model.

preprint2020arXiv

Joint Power Control and Passive Beamforming in IRS-Assisted Spectrum Sharing

In cognitive radio (CR) communication systems, achieving high secondary user (SU) rate in the presence of strong cross-link interference with the primary user (PU) is challenging. In this letter, we exploit the emerging intelligent reflecting surface (IRS) technology to tackle this problem. Specifically, we investigate an IRS-assisted CR communication system where an IRS is deployed to assist in the spectrum sharing between a PU link and an SU link. We aim to maximize the achievable SU rate subject to a given signal-to-interference-plus-noise ratio target for the PU link, by jointly optimizing the SU transmit power and IRS reflect beamforming. Since the formulated problem is difficult to solve due to its non-convexity and coupled variables, we propose an efficient algorithm based on alternating optimization and successive convex approximation techniques to solve it sub-optimally, along with some heuristic designs for lower complexity. Simulation results show that IRS is able to significantly improve the SU rate, even for the scenarios deemed most challenging in conventional CR systems without using IRS.

preprint2020arXiv

Learning Based Distributed Tracking

Inspired by the great success of machine learning in the past decade, people have been thinking about the possibility of improving the theoretical results by exploring data distribution. In this paper, we revisit a fundamental problem called Distributed Tracking (DT) under an assumption that the data follows a certain (known or unknown) distribution, and propose a number data-dependent algorithms with improved theoretical bounds. Informally, in the DT problem, there is a coordinator and k players, where the coordinator holds a threshold N and each player has a counter. At each time stamp, at most one counter can be increased by one. The job of the coordinator is to capture the exact moment when the sum of all these k counters reaches N. The goal is to minimise the communication cost. While our first type of algorithms assume the concrete data distribution is known in advance, our second type of algorithms can learn the distribution on the fly. Both of the algorithms achieve a communication cost bounded byO(k log log N) with high probability, improving the state-of-the-art data-independent bound O(k log N/k). We further propose a number of implementation optimisation heuristics to improve both efficiency and robustness of the algorithms. Finally, we conduct extensive experiments on three real datasets and four synthetic datasets. The experimental results show that the communication cost of our algorithms is as least as 20% of that of the state-of-the-art algorithms.

preprint2020arXiv

Machine-Learning Prediction for Quasi-PDF Matrix Elements

There have been rapid developments in the direct calculation in lattice QCD (LQCD) of the Bjorken-$x$ dependence of hadron structure through large-momentum effective theory (LaMET). LaMET overcomes the previous limitation of LQCD to moments (that is, integrals over Bjorken-$x$) of hadron structure, allowing LQCD to directly provide the kinematic regions where the experimental values are least known. LaMET requires large-momentum hadron states to minimize its systematics and allow us to reach small-$x$ reliably. This means that very fine lattice spacing to minimize lattice artifacts at order $(P_z a)^n$ will become crucial for next-generation LaMET-like structure calculations. Furthermore, such calculations require operators with long Wilson-link displacements (in finer lattice units), increasing the communication costs relative to that of the propagator inversion. In this work, we explore whether machine-learning (ML) algorithms can make correlator predictions to reduce the computational cost of these LQCD calculations. We consider two algorithms, gradient-boosting decision tree and linear models, applied to LaMET data, the matrix elements needed to determine the kaon and $η_s$ unpolarized parton distribution functions (PDFs), meson distribution amplitude (DA), and the nucleon gluon PDF. We find that both algorithms can reliably predict the target observables with different fit quality and systematic errors. The predictions from smaller displacement $z$ to larger ones work better than those for momentum $p$ due to the higher correlation among the data.

preprint2020arXiv

Map Generation from Large Scale Incomplete and Inaccurate Data Labels

Accurately and globally mapping human infrastructure is an important and challenging task with applications in routing, regulation compliance monitoring, and natural disaster response management etc.. In this paper we present progress in developing an algorithmic pipeline and distributed compute system that automates the process of map creation using high resolution aerial images. Unlike previous studies, most of which use datasets that are available only in a few cities across the world, we utilizes publicly available imagery and map data, both of which cover the contiguous United States (CONUS). We approach the technical challenge of inaccurate and incomplete training data adopting state-of-the-art convolutional neural network architectures such as the U-Net and the CycleGAN to incrementally generate maps with increasingly more accurate and more complete labels of man-made infrastructure such as roads and houses. Since scaling the mapping task to CONUS calls for parallelization, we then adopted an asynchronous distributed stochastic parallel gradient descent training scheme to distribute the computational workload onto a cluster of GPUs with nearly linear speed-up.

preprint2020arXiv

Mechanical Properties of Atomically Thin Boron Nitride and the Role of Interlayer Interactions

Atomically thin boron nitride (BN) nanosheets are important two-dimensional nanomaterials with many unique properties distinct from those of graphene, but the investigation of their mechanical properties still greatly lacks. Here we report that high-quality single-crystalline mono- and few-layer BN nanosheets are one of the strongest electrically insulating materials. More intriguingly, few-layer BN shows mechanical behaviors quite different from those of few-layer graphene under indentation. In striking contrast to graphene, whose strength decreases by more than 30% when the number of layers increases from 1 to 8, the mechanical strength of BN nanosheets is not sensitive to increasing thickness. We attribute this difference to the distinct interlayer interactions and hence sliding tendencies in these two materials under indentation. The significantly better mechanical integrity of BN nanosheets makes them a more attractive candidate than graphene for several applications, e.g. as mechanical reinforcements.

preprint2020arXiv

Multi-Antenna UAV Data Harvesting: Joint Trajectory and Communication Optimization

Unmanned aerial vehicle (UAV)-enabled communication is a promising technology to extend coverage and enhance throughput for traditional terrestrial wireless communication systems. In this paper, we consider a UAV-enabled wireless sensor network (WSN), where a multi-antenna UAV is dispatched to collect data from a group of sensor nodes (SNs). The objective is to maximize the minimum data collection rate from all SNs via jointly optimizing their transmission scheduling and power allocations as well as the trajectory of the UAV, subject to the practical constraints on the maximum transmit power of the SNs and the maximum speed of the UAV. The formulated optimization problem is challenging to solve as it involves non-convex constraints and discrete-value variables. To draw useful insight, we first consider the special case of the formulated problem by ignoring the UAV speed constraint and optimally solve it based on the Lagrange duality method. It is shown that for this relaxed problem, the UAV should hover above a finite number of optimal locations with different durations in general. Next, we address the general case of the formulated problem where the UAV speed constraint is considered and propose a traveling salesman problem (TSP)-based trajectory initialization, where the UAV sequentially visits the locations obtained in the relaxed problem with minimum flying time. Given this initial trajectory, we then find the corresponding transmission scheduling and power allocations of the SNs and further optimize the UAV trajectory by applying the block coordinate descent (BCD) and successive convex approximation (SCA) techniques. Finally, numerical results are provided to illustrate the spectrum and energy efficiency gains of the proposed scheme for multi-antenna UAV data harvesting, as compared to benchmark schemes.

preprint2020arXiv

Nanoscale magnetic resonance imaging of proteins in a single cell

Magnetic resonance imaging (MRI) is a non-invasive and label-free technique widely used in medical diagnosis and life science research, and its success has benefited greatly from continuing efforts on enhancing contrast and resolution. Here we reported nanoscale MRI in a single cell using an atomic-size quantum sensor. With nitrogen-vacancy center in diamond, the intracellular protein ferritin has been imaged with a spatial resolution of ~ 10 nanometers, and ferritin-containing organelles were co-localized by correlative MRI and electron microscopy. Comparing to the current micrometer resolution in current state-of-art conventional MRI, our approach represents a 100-fold enhancement, and paves the way for MRI of intracellular proteins.

preprint2020arXiv

Optimal l-one Rank One Matrix Decompositions

In this paper we consider the decomposition of positive semidefinite matrices as a sum of rank one matrices. We introduce and investigate the properties of various measures of optimality of such decompositions. For some classes of positive semidefinite matrices we give explicitly these optimal decompositions. These classes include diagonally dominant matrices and certain of their generalizations, $2\times 2$, and a class of $3\times 3$ matrices.

preprint2020arXiv

Pilot Decontamination for Massive MIMO Network with UAVs

This letter studies the pilot contamination (PC) problem for massive multiple-input multiple-output (MIMO) networks with coexisting terrestrial users and unmanned aerial vehicles (UAVs). Due to the strong line-of-sight (LoS) air-to-ground channels between UAVs and base stations (BSs), UAVs usually cause a more severe PC issue as compared to the traditional terrestrial users. To mitigate the PC caused by UAVs, we propose a low-complexity distributed scheme by exploiting the full-dimensional beamforming of massive MIMO BSs and the angle-dependent LoS channels between them and high-altitude UAVs. Numerical results show the effectiveness of the proposed pilot decontamination scheme and the significant signal-to-interference-plus-noise ratio (SINR) gains in both the uplink and downlink after pilot decontamination.

preprint2020arXiv

Portable Intrinsic Gradiometer for Ultra-Sensitive Detection of Magnetic Gradient in Unshielded Environment

We demonstrate a portable all-optical intrinsic scalar magnetic gradiometer composed of miniaturized cesium vapor cells and vertical-cavity surface-emitting lasers (VCSELs). Two cells, with an inner dimension of 5 mm x 5 mm x 5 mm and separated by a baseline of 5 cm, are driven by one VCSEL and the resulting Larmor precessions are probed by a second VCSEL through optical rotation. The off-resonant linearly polarized probe light interrogates two cells at the same time and the output of the intrinsic gradiometer is proportional to the magnetic field gradient measured over the given baseline. This intrinsic gradiometer scheme has the advantage of avoiding added noise from combining two scalar magnetometers. We achieve better than 18 fT/cm/rt-Hz sensitivity in the gradient measurement. Ultra-sensitive short-baseline magnetic gradiometers can potentially play an important role in many practical applications, such as nondestructive evaluation and unexploded ordnance (UXO) detection. Another application of the gradiometer is for magnetocardiography (MCG) in an unshielded environment. Real-time MCG signals can be extracted from the raw gradiometer readings. The demonstrated gradiometer greatly simplifies the MCG setup and may lead to ubiquitous MCG measurement in the future.

preprint2020arXiv

Rank one tensor completion problem

In this paper, we consider the rank-one tensor completion problem. We address the question of existence and uniqueness of the rank-one solution. In particular we show that the global uniqueness over the field of real numbers can be verified in a polynomial time. We give examples showing that there is an essential difference between the question of global uniqueness over the fields of real and complex numbers. Finally we briefly discuss the rank-one approximation problem for noisy observations.

preprint2020arXiv

ReADS: A Rectified Attentional Double Supervised Network for Scene Text Recognition

In recent years, scene text recognition is always regarded as a sequence-to-sequence problem. Connectionist Temporal Classification (CTC) and Attentional sequence recognition (Attn) are two very prevailing approaches to tackle this problem while they may fail in some scenarios respectively. CTC concentrates more on every individual character but is weak in text semantic dependency modeling. Attn based methods have better context semantic modeling ability while tends to overfit on limited training data. In this paper, we elaborately design a Rectified Attentional Double Supervised Network (ReADS) for general scene text recognition. To overcome the weakness of CTC and Attn, both of them are applied in our method but with different modules in two supervised branches which can make a complementary to each other. Moreover, effective spatial and channel attention mechanisms are introduced to eliminate background noise and extract valid foreground information. Finally, a simple rectified network is implemented to rectify irregular text. The ReADS can be trained end-to-end and only word-level annotations are required. Extensive experiments on various benchmarks verify the effectiveness of ReADS which achieves state-of-the-art performance.

preprint2020arXiv

Refined Nonlinear Rectenna Modeling and Optimal Waveform Design for Multi-User Multi-Antenna Wireless Power Transfer

In this paper, we study the optimal waveform design for wireless power transfer (WPT) from a multi-antenna energy transmitter (ET) to multiple single-antenna energy receivers (ERs) simultaneously in multi-path frequency-selective channels. First, we propose a refined nonlinear current-voltage model of the diode in the ER rectifier, and accordingly derive new expressions for the output direct current (DC) voltage and corresponding harvested power at the ER. Leveraging this new rectenna model, we first consider the single-ER case and study the multisine-based power waveform design based on the wireless channel to maximize the harvested power at the ER. We propose two efficient algorithms for finding high-quality suboptimal solutions to this non-convex optimization problem. Next, we extend our formulated waveform design problem to the general multi-ER case for maximizing the weighted sum of the harvested powers by all ERs, and propose an efficient difference-of-convex functions programming (DCP)-based algorithm for solving this problem. Finally, we demonstrate the superior performance of our proposed waveform designs based on the new rectenna model over existing schemes/models via simulations.

preprint2020arXiv

Relative Entropy Regularised TDLAS Tomography for Robust Temperature Imaging

Tunable Diode Laser Absorption Spectroscopy (TDLAS) tomography has been widely used for in situ combustion diagnostics, yielding images of both species concentration and temperature. The temperature image is generally obtained from the reconstructed absorbance distributions for two spectral transitions, i.e. two-line thermometry. However, the inherently ill-posed nature of tomographic data inversion leads to noise in each of the reconstructed absorbance distributions. These noise effects propagate into the absorbance ratio and generate artefacts in the retrieved temperature image. To address this problem, we have developed a novel algorithm, which we call Relative Entropy Tomographic RecOnstruction (RETRO), for TDLAS tomography. A relative entropy regularisation is introduced for high-fidelity temperature image retrieval from jointly reconstructed two-line absorbance distributions. We have carried out numerical simulations and proof-of-concept experiments to validate the proposed algorithm. Compared with the well-established Simultaneous Algebraic Reconstruction Technique (SART), the RETRO algorithm significantly improves the quality of the tomographic temperature images, exhibiting excellent robustness against TDLAS tomographic measurement noise. RETRO offers great potential for industrial field applications of TDLAS tomography, where it is common for measurements to be performed in very harsh environments.

preprint2020arXiv

RF-Rhythm: Secure and Usable Two-Factor RFID Authentication

Passive RFID technology is widely used in user authentication and access control. We propose RF-Rhythm, a secure and usable two-factor RFID authentication system with strong resilience to lost/stolen/cloned RFID cards. In RF-Rhythm, each legitimate user performs a sequence of taps on his/her RFID card according to a self-chosen secret melody. Such rhythmic taps can induce phase changes in the backscattered signals, which the RFID reader can detect to recover the user's tapping rhythm. In addition to verifying the RFID card's identification information as usual, the backend server compares the extracted tapping rhythm with what it acquires in the user enrollment phase. The user passes authentication checks if and only if both verifications succeed. We also propose a novel phase-hopping protocol in which the RFID reader emits Continuous Wave (CW) with random phases for extracting the user's secret tapping rhythm. Our protocol can prevent a capable adversary from extracting and then replaying a legitimate tapping rhythm from sniffed RFID signals. Comprehensive user experiments confirm the high security and usability of RF-Rhythm with false-positive and false-negative rates close to zero.

preprint2020arXiv

Sculpting stable structures in pure liquids

Pure liquids in thermodynamic equilibrium are structurally homogeneous. In liquid crystals, flow and light pulses are used to create reconfigurable domains with polar order. Moreover, through careful engineering of concerted microfluidic flows and localized opto-thermal fields, it is possible to achieve complete control over the nucleation, growth, and shape of such domains. Experiments, theory, and simulations indicate that the resulting structures can be stabilized indefinitely, provided the liquids are maintained in a controlled non-equilibrium state. The resulting sculpted liquids could find applications in microfluidic devices for selective encapsulation of solutes and particles into optically active compartments that interact with external stimuli.

preprint2020arXiv

Security of Distributed Machine Learning: A Game-Theoretic Approach to Design Secure DSVM

Distributed machine learning algorithms play a significant role in processing massive data sets over large networks. However, the increasing reliance on machine learning on information and communication technologies (ICTs) makes it inherently vulnerable to cyber threats. This work aims to develop secure distributed algorithms to protect the learning from data poisoning and network attacks. We establish a game-theoretic framework to capture the conflicting goals of a learner who uses distributed support vector machines (SVMs) and an attacker who is capable of modifying training data and labels. We develop a fully distributed and iterative algorithm to capture real-time reactions of the learner at each node to adversarial behaviors. The numerical results show that distributed SVM is prone to fail in different types of attacks, and their impact has a strong dependence on the network structure and attack capabilities.

preprint2020arXiv

Semi-Supervised Dialogue Policy Learning via Stochastic Reward Estimation

Dialogue policy optimization often obtains feedback until task completion in task-oriented dialogue systems. This is insufficient for training intermediate dialogue turns since supervision signals (or rewards) are only provided at the end of dialogues. To address this issue, reward learning has been introduced to learn from state-action pairs of an optimal policy to provide turn-by-turn rewards. This approach requires complete state-action annotations of human-to-human dialogues (i.e., expert demonstrations), which is labor intensive. To overcome this limitation, we propose a novel reward learning approach for semi-supervised policy learning. The proposed approach learns a dynamics model as the reward function which models dialogue progress (i.e., state-action sequences) based on expert demonstrations, either with or without annotations. The dynamics model computes rewards by predicting whether the dialogue progress is consistent with expert demonstrations. We further propose to learn action embeddings for a better generalization of the reward function. The proposed approach outperforms competitive policy learning baselines on MultiWOZ, a benchmark multi-domain dataset.

preprint2020arXiv

Short-Term and Long-Term Context Aggregation Network for Video Inpainting

Video inpainting aims to restore missing regions of a video and has many applications such as video editing and object removal. However, existing methods either suffer from inaccurate short-term context aggregation or rarely explore long-term frame information. In this work, we present a novel context aggregation network to effectively exploit both short-term and long-term frame information for video inpainting. In the encoding stage, we propose boundary-aware short-term context aggregation, which aligns and aggregates, from neighbor frames, local regions that are closely related to the boundary context of missing regions into the target frame. Furthermore, we propose dynamic long-term context aggregation to globally refine the feature map generated in the encoding stage using long-term frame features, which are dynamically updated throughout the inpainting process. Experiments show that it outperforms state-of-the-art methods with better inpainting results and fast inpainting speed.

preprint2020arXiv

Signal-Dependent Performance Analysis of Orthogonal Matching Pursuit for Exact Sparse Recovery

Exact recovery of $K$-sparse signals $x \in \mathbb{R}^{n}$ from linear measurements $y=Ax$, where $A\in \mathbb{R}^{m\times n}$ is a sensing matrix, arises from many applications. The orthogonal matching pursuit (OMP) algorithm is widely used for reconstructing $x$. A fundamental question in the performance analysis of OMP is the characterizations of the probability of exact recovery of $x$ for random matrix $A$ and the minimal $m$ to guarantee a target recovery performance. In many practical applications, in addition to sparsity, $x$ also has some additional properties. This paper shows that these properties can be used to refine the answer to the above question. In this paper, we first show that the prior information of the nonzero entries of $x$ can be used to provide an upper bound on $\|x\|_1^2/\|x\|_2^2$. Then, we use this upper bound to develop a lower bound on the probability of exact recovery of $x$ using OMP in $K$ iterations. Furthermore, we develop a lower bound on the number of measurements $m$ to guarantee that the exact recovery probability using $K$ iterations of OMP is no smaller than a given target probability. Finally, we show that when $K=O(\sqrt{\ln n})$, as both $n$ and $K$ go to infinity, for any $0<ζ\leq 1/\sqrtπ$, $m=2K\ln (n/ζ)$ measurements are sufficient to ensure that the probability of exact recovering any $K$-sparse $x$ is no lower than $1-ζ$ with $K$ iterations of OMP. For $K$-sparse $α$-strongly decaying signals and for $K$-sparse $x$ whose nonzero entries independently and identically follow the Gaussian distribution, the number of measurements sufficient for exact recovery with probability no lower than $1-ζ$ reduces further to $m=(\sqrt{K}+4\sqrt{\frac{α+1}{α-1}\ln(n/ζ)})^2$ and asymptotically $m\approx 1.9K\ln (n/ζ)$, respectively.

preprint2020arXiv

Simultaneous Navigation and Radio Mapping for Cellular-Connected UAV with Deep Reinforcement Learning

Cellular-connected unmanned aerial vehicle (UAV) is a promising technology to unlock the full potential of UAVs in the future. However, how to achieve ubiquitous three-dimensional (3D) communication coverage for the UAVs in the sky is a new challenge. In this paper, we tackle this challenge by a new coverage-aware navigation approach, which exploits the UAV's controllable mobility to design its navigation/trajectory to avoid the cellular BSs' coverage holes while accomplishing their missions. We formulate an UAV trajectory optimization problem to minimize the weighted sum of its mission completion time and expected communication outage duration, and propose a new solution approach based on the technique of deep reinforcement learning (DRL). To further improve the performance, we propose a new framework called simultaneous navigation and radio mapping (SNARM), where the UAV's signal measurement is used not only for training the deep Q network (DQN) directly, but also to create a radio map that is able to predict the outage probabilities at all locations in the area of interest. This thus enables the generation of simulated UAV trajectories and predicting their expected returns, which are then used to further train the DQN via Dyna technique, thus greatly improving the learning efficiency.

preprint2020arXiv

Spatial Throughput Characterization for Intelligent Reflecting Surface Aided Multiuser System

Intelligent Reflecting Surface (IRS) has been recently proposed as a promising solution to enhance the spectral and energy efficiency of future wireless networks by tuning a massive number of low-cost passive reflecting elements and thereby constructing favorable wireless propagation environment. Different from the prior works that focus on link-level performance optimization for IRS-aided wireless systems, this letter characterizes the spatial throughput of a single-cell multiuser system aided by multiple IRSs that are randomly deployed in the cell. It is shown by simulation that our analysis is valid and the IRS-aided system outperforms the full-duplex relay-aided counterpart system in terms of spatial throughput when the number of IRSs exceeds a certain value. Moreover, it is shown that different deploying strategies for IRSs/active relays should be adopted for their respective throughput maximization. Finally, it is revealed that given the total number of reflecting elements for IRSs, the system spatial throughput increases when fewer IRSs are deployed each with more reflecting elements, but at the cost of more spatially varying user rates.

preprint2020arXiv

Towards Reliable UAV Swarm Communication in D2D-Enhanced Cellular Network

In the existing cellular networks, it remains a challenging problem to communicate with and control an unmanned aerial vehicle (UAV) swarm with both high reliability and low latency. Due to the UAV swarm's high working altitude and strong ground-to-air channels, it is generally exposed to multiple ground base stations (GBSs), while the GBSs that are serving ground users (occupied GBSs) can generate strong interference to the UAV swarm. To tackle this issue, we propose a novel two-phase transmission protocol by exploiting cellular plus device-to-device (D2D) communication for the UAV swarm. In Phase I, one swarm head is chosen for ground-to-air channel estimation, and all the GBSs that are not serving ground users (available GBSs) transmit a common control message to the UAV swarm simultaneously, using the same cellular frequency band, to combat the strong interference from occupied GBSs. In Phase II, all the UAVs that have decoded the common control message in Phase I further relay it to the other UAVs in the swarm via D2D communication, by exploiting the less interfered D2D frequency band and the proximity among UAVs. In this paper, we aim to characterize the reliability performance of the above two-phase protocol, i.e., the expected percentage of UAVs in the swarm that can decode the common control message, which is a non-trivial problem due to the complex system setup and the intricate coupling between the two phases. Nevertheless, we manage to obtain an approximated expression of the reliability performance of interest, under reasonable assumptions and with the aid of the Pearson distributions. Numerical results validate the accuracy of our analytical results and show the effectiveness of our protocol over other benchmark protocols. We also study the effect of key system parameters on the reliability performance, to reveal useful insights on the practical system design.

preprint2020arXiv

UAV-Sensing-Assisted Cellular Interference Coordination: A Cognitive Radio Approach

Aerial-ground interference mitigation has been deemed as the main challenge in realizing cellular-connected unmanned aerial vehicle (UAV) communications. Due to the line-of-sight (LoS)-dominant air-ground channels, the UAV generates/suffers much stronger interference to/from cellular base stations (BSs) over a much larger region in its uplink/downlink communication, as compared to the terrestrial users. As a result, conventional inter-cell interference coordination (ICIC) techniques catered for terrestrial networks become ineffective in mitigating the more severe UAV-induced interference. To deal with this new challenge, this letter introduces a cognitive radio based solution by treating the UAV and terrestrial users as secondary and primary users in the network, respectively. In particular, the LoS channels with terrestrial BSs/users endow the UAV with a powerful spectrum sensing capability for detecting the terrestrial signals over a much larger region than its serving BS. By exploiting this unique feature, we propose a new UAV-sensing-assisted ICIC design for both the UAV downlink and uplink communications. Specifically, the UAV senses its received interference and the transmissions of terrestrial users in the downlink and uplink, respectively, over the resource blocks (RBs) available at its serving BS to assist its RB allocation to the UAV for avoiding the interference with co-channel terrestrial communications. Numerical results demonstrate that the proposed UAV-assisted ICIC outperforms the conventional terrestrial ICIC by engaging the neighboring BSs for cooperation only.

preprint2020arXiv

Uplink Cooperative Interference Cancellation for Cellular-Connected UAV: A Quantize-and-Forward Approach

Aerial-ground interference is the main obstacle to achieving high spectral efficiency in cellular networks with both traditional terrestrial users and new unmanned aerial vehicle (UAV) users. Due to their strong line-of-sight (LoS) channels with the ground, UAVs could cause/suffer severe interference to/from a large number of non-associated but co-channel base stations (BSs) in their uplink/downlink communications. In this letter, we propose a new cooperative interference cancellation (CIC) scheme for the UAV's uplink communication to mitigate its strong interference to co-channel BSs, which requires only local cooperation between each co-channel BS and its adjacent helping BSs. Specifically, the helping BSs without serving any users in the UAV's communication channel quantize and forward their received signals from the UAV to their aided co-channel BS, which then processes the quantized signals jointly with its own received signal to decode its served terrestrial user's message via canceling the UAV's signal by linear/nonlinear interference cancellation techniques (ICTs). We derive the achievable rates of the proposed CIC scheme with different ICTs as a function of the UAV's transmit power and rate, and thereby unveil the conditions under which the proposed CIC scheme outperforms the existing CIC scheme based on the decode-and-forward (DF) operation of the helping BSs.

preprint2020arXiv

Weighted Sum Power Maximization for Intelligent Reflecting Surface Aided SWIPT

The low efficiency of far-field wireless power transfer (WPT) limits the fundamental rate-energy (R-E) performance trade-off of the simultaneous wireless information and power transfer (SWIPT) system. To address this challenge, we propose in this letter a new SWIPT system aided by the emerging intelligent reflecting surface (IRS) technology. By leveraging massive low-cost passive elements that are able to reflect the signals with adjustable phase shifts, IRS achieve a high passive beamforming gain, which is appealing for drastically enhancing the WPT efficiency and thereby the R-E trade-off of SWIPT systems. We consider an IRS being deployed to assist a multi-antenna access point (AP) to serve multiple information decoding receivers (IDRs) and energy harvesting receivers (EHRs). We aim to maximize the weighted sum-power received by EHRs via jointly optimizing the transmit precoders at the AP and reflect phase shifts at the IRS, subject to the individual signal-to-interference-plus-noise ratio (SINR) constraints for IDRs. Since this problem is non-convex, we propose efficient algorithms to obtain suboptimal solutions for it. In particular, we prove that it is sufficient to send information signals only at the AP to serve both IDRs and EHRs regardless of their channel realizations. Moreover, simulation results show significant performance gains achieved by our proposed designs over benchmark schemes.

preprint2020arXiv

Wireless Communication via Double IRS: Channel Estimation and Passive Beamforming Designs

In this letter, we study efficient channel estimation and passive beamforming designs for a double-intelligent reflecting surface (IRS) aided single-user communication system, where a user communicates with an access point (AP) via the cascaded user-IRS 1-IRS 2-AP double-reflection link. First, a general channel estimation scheme is proposed for the system under any arbitrary inter-IRS channel, where all coefficients of the cascaded channel are estimated. Next, for the typical scenario with a line-of-sight (LoS)-dominant inter-IRS channel, we propose another customized scheme to estimate two signature vectors of the rank-one cascaded channel with significantly less channel training time than the first scheme. For the two proposed channel estimation schemes, we further optimize their corresponding cooperative passive beamforming for data transmission to maximize the achievable rate with the training overhead and channel estimation error taken into account. Numerical results show that deploying two cooperative IRSs with the proposed channel estimation and passive beamforming designs achieves significant rate enhancement as compared to the conventional case of single IRS deployment.

preprint2019arXiv

Doping Dependence of the Second Magnetization Peak, Critical Current Density and Pinning Mechanism in BaFe$_{2-x}$Ni$_x$As$_2$ Pnictide Superconductors

A series of high quality BaFe$_{2-x}$Ni$_x$As$_2$ pnictide superconductors were studied using magnetic relaxation and isothermal magnetic measurements in order to study the second magnetization peak (SMP) and critical current behaviour in Ni-doped 122 family. The temperature dependence of the magnetic relaxation rate suggests a pinning crossover, whereas, it's magnetic field dependence hints a vortex-lattice structural phase-transition. The activation energy ($U$) estimated using the magnetic relaxation data was analyzed in detail for slightly-underdoped, slightly-overdoped and an overdoped samples, using Maley's method and collective creep theory. Our results confirm that the SMP in these samples is due to the collective (elastic) to plastic creep crossover as has been observed for the other members of 122-family. In addition, we also investigated the doping dependence of the critical current density ($J_c$) and the vortex-pinning behaviour in these compounds. The observed $J_c$ is higher than the threshold limit (10$^5$ A/cm$^2$) considered for the technological potential and even greater than 1 MA/cm$^2$ for slightly underdoped Ni-content, x = 0.092 sample. The pinning characteristics were analyzed in terms of the models developed by Dew-Hughes and Griessen $et$ $al$, which suggest the dominant role of $δl$-type pinning.

preprint2019arXiv

Multiple agile Earth observation satellites, oversubscribed targets scheduling using complex networks theory

The Earth observation satellites (EOSs) scheduling is of great importance to achieve efficient observation missions. The agile EOSs (AEOS) with stronger attitude maneuvering capacity can greatly improve observation efficiency while increasing scheduling complexity. The multiple AEOSs, oversubscribed targets scheduling problem with multiple observations are addressed, and the potential observation missions are modeled as nodes in the complex networks. To solve the problem, an improved feedback structured heuristic is designed by defining the node and target importance factors. On the basis of a real world Chinese AEOS constellation, simulation experiments are conducted to validate the heuristic efficiency in comparison with a constructive algorithm and a structured genetic algorithm.

preprint2019arXiv

Photonic realization of quantum resetting

Contrary to the usual assumption of at least partial control of quantum dynamics, a surprising recent result proved that an arbitrary quantum state can be probabilistically reset to a state in the past by having it interact with probing systems in a consistent, but $uncontrolled$ way. We present a photonic implementation to achieve this resetting process, experimentally verifying that a state can be probabilistically reset to its past with a fidelity of $0.870\pm0.012$. We further demonstrate the preservation of an entangled state, which still violates a Bell inequality, after half of the entangled pair was reset. The ability to reset uncontrolled quantum states has implications in the foundations of quantum physics and applications in areas of quantum technology.

preprint2019arXiv

Variational Inference for Sparse Gaussian Process Modulated Hawkes Process

The Hawkes process (HP) has been widely applied to modeling self-exciting events including neuron spikes, earthquakes and tweets. To avoid designing parametric triggering kernel and to be able to quantify the prediction confidence, the non-parametric Bayesian HP has been proposed. However, the inference of such models suffers from unscalability or slow convergence. In this paper, we aim to solve both problems. Specifically, first, we propose a new non-parametric Bayesian HP in which the triggering kernel is modeled as a squared sparse Gaussian process. Then, we propose a novel variational inference schema for model optimization. We employ the branching structure of the HP so that maximization of evidence lower bound (ELBO) is tractable by the expectation-maximization algorithm. We propose a tighter ELBO which improves the fitting performance. Further, we accelerate the novel variational inference schema to linear time complexity by leveraging the stationarity of the triggering kernel. Different from prior acceleration methods, ours enjoys higher efficiency. Finally, we exploit synthetic data and two large social media datasets to evaluate our method. We show that our approach outperforms state-of-the-art non-parametric frequentist and Bayesian methods. We validate the efficiency of our accelerated variational inference schema and practical utility of our tighter ELBO for model selection. We observe that the tighter ELBO exceeds the common one in model selection.

preprint2018arXiv

Improving Text-to-SQL Evaluation Methodology

To be informative, an evaluation must measure how well systems generalize to realistic unseen data. We identify limitations of and propose improvements to current evaluations of text-to-SQL systems. First, we compare human-generated and automatically generated questions, characterizing properties of queries necessary for real-world applications. To facilitate evaluation on multiple datasets, we release standardized and improved versions of seven existing datasets and one new text-to-SQL dataset. Second, we show that the current division of data into training and test sets measures robustness to variations in the way questions are asked, but only partially tests how well systems generalize to new queries; therefore, we propose a complementary dataset split for evaluation of future work. Finally, we demonstrate how the common practice of anonymizing variables during evaluation removes an important challenge of the task. Our observations highlight key difficulties, and our methodology enables effective measurement of future development.

preprint2016arXiv

A General Design Framework for MIMO Wireless Energy Transfer with Limited Feedback

Multi-antenna or multiple-input multiple-output (MIMO) technique can significantly improve the efficiency of radio frequency (RF) signal enabled wireless energy transfer (WET). To fully exploit the energy beamforming gain at the energy transmitter (ET), the knowledge of channel state information (CSI) is essential, which, however, is difficult to be obtained in practice due to the hardware limitation of the energy receiver (ER). To overcome this difficulty, under a point-to-point MIMO WET setup, this paper proposes a general design framework for a new type of channel learning method based on the ER's energy measurement and feedback. Specifically, the ER measures and encodes the harvested energy levels over different training intervals into bits, and sends them to the ET via a feedback link of limited rate. Based on the energy-level feedback, the ET adjusts transmit beamforming in subsequent training intervals and obtains refined estimates of the MIMO channel by leveraging the technique of analytic center cutting plane method (ACCPM) in convex optimization. Under this general design framework, we further propose two specific feedback schemes termed energy quantization and energy comparison, where the feedback bits at each interval are generated at the ER by quantizing the measured energy level at the current interval and comparing it with those in the previous intervals, respectively. Numerical results are provided to compare the performance of the two feedback schemes. It is shown that energy quantization performs better when the number of feedback bits per interval is large, while energy comparison is more effective with small number of feedback bits.

preprint2016arXiv

Angle-of-Attack Modulation in Trajectory Tracking for a Reusable Launch Vehicle

This paper deals with the problem of angle-of-attack modulation with the aim of enhancing transient performance of entry guidance during bank reversals, while compensating adverse effects of fast time-varying transient disturbances. An extended single-input/single-output system is developed in the velocity domain by means of a dynamic extension technique, and explicitly captures the trajectory dynamics of angle-of-attack modulation. A normal form for this extended system is derived for the sake of employing a feedback linearization controller. Further, the control characteristics of angle-of-attack modulation is found to be a non-minimum phase behavior under two common conditions in a near- equilibrium glide flight. Therefore, the issue of angle-of-attack modulation is formulated as robust output stabilization of the non-minimum phase system. A disturbance observer-based feedback linearization technique is used to design a robustly dynamical output-feedback controller for angle-of-attack modulation, and an internal-state feedback controller for bank-angle modulation is used to stabilize the unstable internal dynamics. Numerical simulations are conducted to demonstrate that the performance of the proposed method of angle-of-attack modulation is enhanced compared to the existing shuttle method.

preprint2016arXiv

Artificial Noise Aided Secrecy Information and Power Transfer in OFDMA Systems

In this paper, we study simultaneous wireless information and power transfer (SWIPT) in orthogonal frequency division multiple access (OFDMA) systems with the coexistence of information receivers (IRs) and energy receivers (ERs). The IRs are served with best-effort secrecy data and the ERs harvest energy with minimum required harvested power. To enhance the physical layer security for IRs and yet satisfy energy harvesting requirements for ERs, we propose a new frequency domain artificial noise (AN) aided transmission strategy. With the new strategy, we study the optimal resource allocation for the weighted sum secrecy rate maximization for IRs by power and subcarrier allocation at the transmitter. The studied problem is shown to be a mixed integer programming problem and thus non-convex, while we propose an efficient algorithm for solving it based on the Lagrange duality method. To further reduce the computational complexity, we also propose a suboptimal algorithm of lower complexity. The simulation results illustrate the effectiveness of proposed algorithms as compared against other heuristic schemes.

preprint2016arXiv

Communications and Signals Design for Wireless Power Transmission

Radiative wireless power transfer (WPT) is a promising technology to provide cost-effective and real-time power supplies to wireless devices. Although radiative WPT shares many similar characteristics with the extensively studied wireless information transfer or communication, they also differ significantly in terms of design objectives, transmitter/receiver architectures and hardware constraints, etc. In this article, we first give an overview on the various WPT technologies, the historical development of the radiative WPT technology and the main challenges in designing contemporary radiative WPT systems. Then, we focus on discussing the new communication and signal processing techniques that can be applied to tackle these challenges. Topics discussed include energy harvester modeling, energy beamforming for WPT, channel acquisition, power region characterization in multi-user WPT, waveform design with linear and non-linear energy receiver model, safety and health issues of WPT, massive MIMO (multiple-input multiple-output) and millimeter wave (mmWave) enabled WPT, wireless charging control, and wireless power and communication systems co-design. We also point out directions that are promising for future research.

preprint2016arXiv

Constant Envelope Precoding for MIMO Systems

Constant envelope (CE) precoding is an appealing transmission technique, which enables highly efficient power amplification, and is realizable with a single radio frequency (RF) chain at the multi-antenna transmitter. In this paper, we study the transceiver design for a point-to-point multiple-input multiple-output (MIMO) system with CE precoding. Both single-stream transmission (i.e., beamforming) and multi-stream transmission (i.e., spatial multiplexing) are considered. For single-stream transmission, we optimize the receive beamforming vector to minimize the symbol error rate (SER) for any given channel realization and desired constellation at the combiner output. By reformulating the problem as an equivalent quadratically constrained quadratic program (QCQP), we propose an efficient semi-definite relaxation (SDR) based algorithm to find an approximate solution. Next, for multi-stream transmission, we propose a new scheme based on antenna grouping at the transmitter and minimum mean squared error (MMSE) or zero-forcing (ZF) based beamforming at the receiver. The transmit antenna grouping and receive beamforming vectors are then jointly designed to minimize the maximum SER over all data streams. Finally, the error-rate performance of single- versus multi-stream transmission is compared via simulations under different setups.

preprint2016arXiv

Constant Envelope Precoding with Adaptive Receiver Constellation in MISO Fading Channel

Constant envelope (CE) precoding is an appealing transmission technique which enables the realization of high power amplifier (PA) efficiency. For CE precoding in a single-user multiple-input single-output (MISO) channel, a desired constellation is feasible at the receiver if and only if it can be scaled to lie in an annulus, whose boundaries are characterized by the instantaneous channel realization. Therefore, if a fixed receiver constellation is used for CE precoding in a fading channel, where the annulus is time-varying, there is in general a non-zero probability of encountering a channel that makes CE precoding infeasible, thereby causing a high probability of error. To tackle this problem, this paper studies the adaptive receiver constellation design for CE precoding in a single-user MISO flat-fading channel with an arbitrary number of antennas at the transmitter. We first investigate the fixed-rate adaptive receiver constellation design to minimize the symbol error rate (SER). Specifically, an efficient algorithm is proposed to find the optimal amplitude-and-phase shift keying (APSK) constellation with two rings that is both feasible and of the maximum minimum Euclidean distance (MED), for any given constellation size and instantaneous channel realization. Numerical results show that by using the optimized fixed-rate adaptive receiver constellation, our proposed scheme achieves significantly improved SER performance over CE precoding with a fixed receiver constellation. Furthermore, based on the family of optimal fixed-rate adaptive two-ring APSK constellation sets, a variable-rate CE transmission scheme is proposed and numerically examined.

preprint2016arXiv

Controlling placement of nonspherical (boomerang) colloids in nematic cells with photopatterned director

Placing colloidal particles in predesigned sites represents a major challenge of the current state-of-the-art colloidal science. Nematic liquid crystals with spatially varying director patterns represent a promising approach to achieve a well-controlled placement of colloidal particles thanks to the elastic forces between the particles and the surrounding landscape of molecular orientation. Here we demonstrate how the spatially varying director field can be used to control placement of non-spherical particles of boomerang shape. The boomerang colloids create director distortions of a dipolar symmetry. When a boomerang particle is placed in a periodic splay-bend director pattern, it migrates towards the region of a maximum bend. The behavior is contrasted to that one of spherical particles with normal surface anchoring, which also produce dipolar director distortions, but prefer to compartmentalize into the regions with a maximum splay. The splay-bend periodic landscape thus allows one to spatially separate these two types of particles. By exploring overdamped dynamics of the colloids, we determine elastic driving forces responsible for the preferential placement. Control of colloidal locations through patterned molecular orientation can be explored for future applications in microfluidic, lab on a chip, sensing and sorting devices.

preprint2016arXiv

Cooperative Local Caching under Heterogeneous File Preferences

Local caching is an effective scheme for leveraging the memory of the mobile terminal (MT) and short range communications to save the bandwidth usage and reduce the download delay in the cellular communication system. Specifically, the MTs first cache in their local memories in off-peak hours and then exchange the requested files with each other in the vicinity during peak hours. However, prior works largely overlook MTs' heterogeneity in file preferences and their selfish behaviours. In this paper, we practically categorize the MTs into different interest groups according to the MTs' preferences. Each group of MTs aims to increase the probability of successful file discovery from the neighbouring MTs (from the same or different groups). Hence, we define the groups' utilities as the probability of successfully discovering the file in the neighbouring MTs, which should be maximized by deciding the caching strategies of different groups. By modelling MTs' mobilities as homogeneous Poisson point processes (HPPPs), we analytically characterize MTs' utilities in closed-form. We first consider the fully cooperative case where a centralizer helps all groups to make caching decisions. We formulate the problem as a weighted-sum utility maximization problem, through which the maximum utility trade-offs of different groups are characterized. Next, we study two benchmark cases under selfish caching, namely, partial and no cooperation, with and without inter-group file sharing, respectively. The optimal caching distributions for these two cases are derived. Finally, numerical examples are presented to compare the utilities under different cases and show the effectiveness of the fully cooperative local caching compared to the two benchmark cases.

preprint2016arXiv

Cost-Effective Millimeter Wave Communications with Lens Antenna Array

Millimeter wave (mmWave) communication is a promising technology for the fifth-generation (5G) wireless system. However, the large number of antennas used and the wide signal bandwidth in mmWave systems render the conventional multi-antenna techniques increasingly costly in terms of signal processing complexity, hardware implementation, and power consumption. In this article, we investigate cost-effective mmWave communications by first providing an overview of the main existing techniques that offer different trade-offs between performance and cost, and then focusing our discussion on a promising new technique based on the advanced lens antenna array. It is revealed that by exploiting the angle-dependent energy focusing property of lens arrays, together with the angular sparsity of the mmWave channels, mmWave lens-antenna system is able to achieve the capacity-optimal performance with very few radio-frequency (RF) chains and using the low-complexity single-carrier transmission, even for wide-band frequency-selective channels. Numerical results show that the lens-based system significantly outperforms the state-of-the-art designs for mmWave systems in both spectrum efficiency and energy efficiency.

preprint2016arXiv

Cruciform: Solving Crosswords with Natural Language Processing

Crossword puzzles are popular word games that require not only a large vocabulary, but also a broad knowledge of topics. Answering each clue is a natural language task on its own as many clues contain nuances, puns, or counter-intuitive word definitions. Additionally, it can be extremely difficult to ascertain definitive answers without the constraints of the crossword grid itself. This task is challenging for both humans and computers. We describe here a new crossword solving system, Cruciform. We employ a group of natural language components, each of which returns a list of candidate words with scores when given a clue. These lists are used in conjunction with the fill intersections in the puzzle grid to formulate a constraint satisfaction problem, in a manner similar to the one used in the Dr. Fill system. We describe the results of several of our experiments with the system.

preprint2016arXiv

Dependency Sensitive Convolutional Neural Networks for Modeling Sentences and Documents

The goal of sentence and document modeling is to accurately represent the meaning of sentences and documents for various Natural Language Processing tasks. In this work, we present Dependency Sensitive Convolutional Neural Networks (DSCNN) as a general-purpose classification system for both sentences and documents. DSCNN hierarchically builds textual representations by processing pretrained word embeddings via Long Short-Term Memory networks and subsequently extracting features with convolution operators. Compared with existing recursive neural models with tree structures, DSCNN does not rely on parsers and expensive phrase labeling, and thus is not restricted to sentence-level tasks. Moreover, unlike other CNN-based models that analyze sentences locally by sliding windows, our system captures both the dependency information within each sentence and relationships across sentences in the same document. Experiment results demonstrate that our approach is achieving state-of-the-art performance on several tasks, including sentiment analysis, question type classification, and subjectivity classification.

preprint2016arXiv

Distributed Charging Control in Broadband Wireless Power Transfer Networks

Wireless power transfer (WPT) technology provides a cost-effective solution to achieve sustainable energy supply in wireless networks, where WPT-enabled energy nodes (ENs) can charge wireless devices (WDs) remotely without interruption to the use. However, in a heterogeneous WPT network with distributed ENs and WDs, some WDs may quickly deplete their batteries due to the lack of timely wireless power supply by the ENs, thus resulting in short network operating lifetime. In this paper, we exploit frequency diversity in a broadband WPT network and study the distributed charging control by ENs to maximize network lifetime. In particular, we propose a practical voting-based distributed charging control framework where each WD simply estimates the broadband channel, casts its vote(s) for some strong sub-channel(s) and sends to the ENs along with its battery state information, based on which the ENs independently allocate their transmit power over the sub-channels without the need of centralized control. Under this framework, we aim to design lifetime-maximizing power allocation and efficient voting-based feedback methods. Towards this end, we first derive the general expression of the expected lifetime of a WPT network and draw the general design principles for lifetime-maximizing charging control. Based on the analysis, we then propose a distributed charging control protocol with voting-based feedback, where the power allocated to sub-channels at each EN is a function of the weighted sum vote received from all WDs. Besides, the number of votes cast by a WD and the weight of each vote are related to its current battery state. Simulation results show that the proposed distributed charging control protocol could significantly increase the network lifetime under stringent transmit power constraint in a broadband WPT network.

preprint2016arXiv

Electronic specific heat in BaFe$_{2-x}$Ni$_x$As$_2$

We have systematically studied the low-temperature specific heat of the BaFe$_{2-x}$Ni$_x$As$_2$ single crystals covering the whole superconducting dome. Using the nonsuperconducting heavily overdoped x = 0.3 sample as a reference for the phonon contribution to the specific heat, we find that the normal-state electronic specific heats in the superconducting samples may have a nonlinear temperature dependence, which challenges previous results in the electron-doped Ba-122 iron-based superconductors. A model based on the presence of ferromagnetic spin fluctuations may explain the data between x = 0.1 and x = 0.15, suggesting the important role of Fermi-surface topology in understanding the normal-state electronic states.

preprint2016arXiv

Energy-Efficient UAV Communication with Trajectory Optimization

Wireless communication with unmanned aerial vehicles (UAVs) is a promising technology for future communication systems. In this paper, we study energy-efficient UAV communication with a ground terminal via optimizing the UAV's trajectory, a new design paradigm that jointly considers both the communication throughput and the UAV's energy consumption. To this end, we first derive a theoretical model on the propulsion energy consumption of fixed-wing UAVs as a function of the UAV's flying speed, direction and acceleration, based on which the energy efficiency of UAV communication is defined. Then, for the case of unconstrained trajectory optimization, we show that both the rate-maximization and energy-minimization designs lead to vanishing energy efficiency and thus are energy-inefficient in general. Next, we introduce a practical circular UAV trajectory, under which the UAV's flight radius and speed are optimized to maximize the energy efficiency for communication. Furthermore, an efficient design is proposed for maximizing the UAV's energy efficiency with general constraints on its trajectory, including its initial/final locations and velocities, as well as maximum speed and acceleration. Numerical results show that the proposed designs achieve significantly higher energy efficiency for UAV communication as compared with other benchmark schemes.

preprint2016arXiv

Fundamental Rate Limits of Physical Layer Spoofing

This letter studies an emerging wireless communication intervention problem at the physical layer, where a legitimate spoofer aims to spoof a malicious link from Alice to Bob, by replacing Alice's transmitted source message with its target message at Bob side. From an information-theoretic perspective, we are interested in characterizing the maximum achievable spoofing rate of this new spoofing channel, which is equivalent to the maximum achievable rate of the target message at Bob, under the condition that Bob cannot decode the source message from Alice. We propose a novel combined spoofing approach, where the spoofer sends its own target message, combined with a processed version of the source message to cancel the source message at Bob. For both cases when Bob treats interference as noise (TIN) or applies successive interference cancelation (SIC), we obtain the maximum achievable spoofing rates by optimizing the power allocation between the target and source messages at the spoofer.

preprint2016arXiv

Green 5G Heterogeneous Networks through Dynamic Small-Cell Operation

Traditional macro-cell networks are experiencing an upsurge of data traffic, and small-cells are deployed to help offload the traffic from macro-cells. Given the massive deployment of small-cells in a macro-cell, the aggregate power consumption of small-cells (though being low individually) can be larger than that of the macro-cell. Compared to the macro-cell base station (MBS) whose power consumption increases significantly with its traffic load, the power consumption of a small-cell base station (SBS) is relatively flat and independent of its load. To reduce the total power consumption of the heterogeneous networks (HetNets), we dynamically change the operating states (on and off) of the SBSs, while keeping the MBS on to avoid any service failure outside active small-cells. First, we consider that the wireless users are uniformly distributed in the network, and propose an optimal location-based operation scheme by gradually turning off the SBSs closer to the MBS. We then extend the operation problem to a more general case where users are non-uniformly distributed in the network. Although this problem is NP-hard, we propose a joint location and user density based operation scheme to achieve near-optimum (with less than 1\% performance loss in our simulations) in polynomial time.

preprint2016arXiv

Green OFDMA Resource Allocation in Cache-Enabled CRAN

Cloud radio access network (CRAN), in which remote radio heads (RRHs) are deployed to serve users in a target area, and connected to a central processor (CP) via limited-capacity links termed the fronthaul, is a promising candidate for the next-generation wireless communication systems. Due to the content-centric nature of future wireless communications, it is desirable to cache popular contents beforehand at the RRHs, to reduce the burden on the fronthaul and achieve energy saving through cooperative transmission. This motivates our study in this paper on the energy efficient transmission in an orthogonal frequency division multiple access (OFDMA)-based CRAN with multiple RRHs and users, where the RRHs can prefetch popular contents. We consider a joint optimization of the user-SC assignment, RRH selection and transmit power allocation over all the SCs to minimize the total transmit power of the RRHs, subject to the RRHs' individual fronthaul capacity constraints and the users' minimum rate constraints, while taking into account the caching status at the RRHs. Although the problem is non-convex, we propose a Lagrange duality based solution, which can be efficiently computed with good accuracy. We compare the minimum transmit power required by the proposed algorithm with different caching strategies against the case without caching by simulations, which show the significant energy saving with caching.

preprint2016arXiv

Harnessing Self-Interference in Full-Duplex Relaying: An Analog Filter-and-Forward Approach

This paper studies a full-duplex filter-and-forward (FD-FF) relay system in frequency-selective channels. Conventionally, the loop-back signal at the FD relay is treated as harmful self-interference and needs to be significantly suppressed via both analog- and digital-domain cancellation. However, the performance of the conventional self-interference cancellation approach is fundamentally limited due to the quantization error induced by the analog-to-digital converter (ADC) with limited dynamic range. In this paper, we consider an analog filter-and-forward design to help avoid the quantization error, and surprisingly show that the maximum achievable rate of such an FD-FF relay system is in fact regardless of the loop-back channel at the FD relay. We characterize the maximum achievable rate of this channel by jointly optimizing the transmit power allocation over frequency at the source and the frequency response of the filter at the relay, subject to their individual power constraints. Although this problem is non-convex, we obtain its optimal solution by applying the Lagrange duality method. By simulations it is shown that the proposed joint source and relay optimization achieves rate gains over other heuristic designs, and is also advantageous over the conventional approach by cancelling the relay loop-back signal as self-interference, especially when the residual self-interference after cancellation is still significant.

preprint2016arXiv

How to Diagonalize a MIMO Channel with Arbitrary Transmit Covariance?

Multiple-input multiple-output (MIMO) or multi-antenna communication is a key technique to achieve high spectral efficiency in wireless systems. For the point-to-point MIMO channel, it is a well-known result that the channel singular value decomposition (SVD) based linear precoding and decoding achieves the channel capacity, which also diagonalizes the MIMO channel into parallel single-input single-output (SISO) sub-channels for independent encoding and decoding. However, in multi-user MIMO systems, the optimal transmit covariance of each MIMO link is generally not its channel SVD based as a result of the control and balance of the co-channel interference among users. Thus, it remains unknown whether the linear precoding/decoding strategy is still able to achieve the capacity of each MIMO link and yet diagonalize its MIMO channel, with a given set of optimal transmit covariance of all users. This letter solves this open problem by providing a closed-form capacity-achieving linear precoder/decoder design that diagonalizes a MIMO channel with arbitrary transmit covariance. Numerical examples are also provided to validate the proposed solution in various multi-user MIMO systems.

preprint2016arXiv

Mesoscale Structure of Chiral Nematic Shells

There is considerable interest in understanding and controlling topological defects in nematic liquid crystals (LCs). Confinement, in the form of droplets, has been particularly effective in that regard. Here, we employ the Landau-de Gennes method to explore the geometrical frustration of nematic order in shell geometries, and focus on chiral materials. By varying the chirality and thickness in uniform shells, we construct a phase diagram that includes tetravalent structures, bipolar structures (BS), bent structures and radial spherical structures (RSS). It is found that, in uniform shells, the BS-to-RSS structural transition, in response to both chirality and shell geometry, is accompanied by an abrupt change of defect positions, implying a potential use for chiral nematic shells as sensors. Moreover, we investigate thickness heterogeneity in shells and demonstrate that non-chiral and chiral nematic shells exhibit distinct equilibrium positions of their inner core that are governed by shell chirality c.

preprint2016arXiv

Multi-User Millimeter Wave MIMO with Full-Dimensional Lens Antenna Array

Millimeter wave (mmWave) communication by utilizing lens antenna arrays is a promising technique for realizing cost-effective 5G wireless systems with large MIMO (multiple-input multiple-output) but only limited radio frequency (RF) chains. This paper studies an uplink multi-user mmWave single-sided lens MIMO system, where only the base station (BS) is equipped with a full-dimensional (FD) lens antenna array with both elevation and azimuth angle resolution capabilities, and each mobile station (MS) employs the conventional uniform planar array (UPA) without the lens. By exploiting the angle-dependent energy focusing property of the lens antenna array at the BS as well as the multi-path sparsity of mmWave channels, we propose a low-complexity path division multiple access (PDMA) scheme, which enables virtually interference-free multi-user communications when the angle of arrivals (AoAs) of all MS multi-path signals are sufficiently separable at the BS. To this end, a new technique called path delay compensation is proposed at the BS to effectively transform the multi-user frequency-selective MIMO channels to parallel frequency-flat small-size MIMO channels for different MSs, for each of which the low-complexity single-carrier(SC) transmission is applied. For general scenarios with insufficient AoA separations, analog beamforming at the MSs and digital combining at the BS are jointly designed to maximize the achievable sum-rate of the MSs based on their effective MIMO channels resulting from path delay compensation. In addition, we propose a new and efficient channel estimation scheme tailored for PDMA, which requires negligible training overhead in practical mmWave systems and yet leads to comparable performance as that based on perfect channel state information (CSI).

preprint2016arXiv

Multiuser Wireless Power Transfer via Magnetic Resonant Coupling: Performance Analysis, Charging Control, and Power Region Characterization

Magnetic resonant coupling (MRC) is an efficient method for realizing the near-field wireless power transfer (WPT). Although the MRC enabled WPT (MRC-WPT) with a single pair of transmitter and receiver has been thoroughly studied in the literature, there is limited work on the general setup with multiple transmitters and/or receivers. In this paper, we consider a point-to-multipoint MRC-WPT system with one transmitter delivering wireless power to a set of distributed receivers. We aim to introduce new applications of signal processing and optimization techniques to the performance characterization and optimization in multiuser WPT via MRC. We first derive closed-form expressions for the power drawn from the energy source at the transmitter and that delivered to the load at each receiver. We identify a "near-far" fairness issue in multiuser power transmission due to receivers' distance-dependent mutual inductance with the transmitter. To tackle this issue, we propose a centralized charging control algorithm to jointly optimize the receivers' load resistance to minimize the total transmitter power drawn while meeting the given power requirement of each individual load. For ease of practical implementation, we also devise a distributed algorithm for the receivers to adjust their load resistance independently in an iterative manner. Last, we characterize the power region that constitutes all the achievable power-tuples of the loads via controlling their adjustable resistance. In particular, we compare the power regions without versus with the time sharing of users' power transmission, where it is shown that time sharing yields a larger power region in general. Extensive simulation results are provided to validate our analysis and corroborate our study on the multiuser MRC-WPT system.

preprint2016arXiv

Nematic Quantum Critical Fluctuations in BaFe$_{2-x}$Ni$_x$As$_2$

We have systematically studied the nematic fluctuations in the electron-doped iron-based superconductor BaFe$_{2-x}$Ni$_x$As$_2$ by measuring the in-plane resistance change under uniaxial pressure. While the nematic quantum critical point can be identified through the measurements along the (110) direction as studied previously, quantum and thermal critical fluctuations cannot be distinguished due to similar Curie-Weiss-like behaviors. Here we find that a sizable pressure-dependent resistivity along the (100) direction is present in all doping levels, which is against the simple picture of an Ising-type nematic model. The signal along the (100) direction becomes maximum at optimal doping, suggesting that it is associated with nematic quantum critical fluctuations. Our results indicate that thermal fluctuations from striped antiferromagnetic order dominate the underdoped regime along the (110) direction. We argue that either there is a strong coupling between the quantum critical fluctuations and the fermions, or more exotically, a higher symmetry may be present around optimal doping.

preprint2016arXiv

Placement Optimization of UAV-Mounted Mobile Base Stations

In terrestrial communication networks without fixed infrastructure, unmanned aerial vehicle (UAV)-mounted mobile base stations (MBSs) provide an efficient solution to achieve wireless connectivity. This letter aims to minimize the number of MBSs needed to provide wireless coverage for a group of distributed ground terminals (GTs), ensuring that each GT is within the communication range of at least one MBS. We propose a polynomial-time algorithm with successive MBS placement, where the MBSs are placed sequentially starting on the area perimeter of the uncovered GTs along a spiral path towards the center, until all GTs are covered. Each MBS is placed to cover as many uncovered GTs as possible, with higher priority given to the GTs on the boundary to reduce the occurrence of outlier GTs that each may require one dedicated MBS for its coverage. Numerical results show that the proposed algorithm performs favorably compared to other schemes in terms of the total number of required MBSs and/or time complexity.

preprint2016arXiv

Properties of Mesons in a Strong Magnetic Field

By extending the $Φ$-derivable approach in Nambu-Jona-Lasinio model to finite magnetic field we calculate the properties of pion, $σ$ and $ρ$ mesons in a magnetic field at finite temperature in not only the quark-antiquark bound state scheme but also the pion-pion scattering resonant state scenario. Our calculation results manifest that the masses of $π^{0}$ and $σ$ meson can be nearly degenerate at the pseudo-critical temperature which increases with increasing the magnetic field strength, and the $π^{\pm}$ mass ascends suddenly at almost the same critical temperature. While the $ρ$ mesons' masses decrease with the temperature but increase with the magnetic field strength. We also check the Gell-Mann-Oakes-Renner relation and find that the relation can be violated obviously with increasing the temperature, and the effect of the magnetic field becomes pronounced around the critical temperature. With different criteria, we analyze the effect of the magnetic field on the chiral phase transition and find that the pseudo-critical temperature of the chiral phase cross, $T_{c}^χ$, is always enhanced by the magnetic field. Moreover our calculations indicate that the $ρ$ mesons will get melted as the chiral symmetry has not yet been restored, but the $σ$ meson does not disassociate even at very high temperature. Particularly, it is the first to show that there does not exist vector meson condensate in the QCD vacuum in the pion-pion scattering scheme.

preprint2016arXiv

Reverse Nearest Neighbor Heat Maps: A Tool for Influence Exploration

We study the problem of constructing a reverse nearest neighbor (RNN) heat map by finding the RNN set of every point in a two-dimensional space. Based on the RNN set of a point, we obtain a quantitative influence (i.e., heat) for the point. The heat map provides a global view on the influence distribution in the space, and hence supports exploratory analyses in many applications such as marketing and resource management. To construct such a heat map, we first reduce it to a problem called Region Coloring (RC), which divides the space into disjoint regions within which all the points have the same RNN set. We then propose a novel algorithm named CREST that efficiently solves the RC problem by labeling each region with the heat value of its containing points. In CREST, we propose innovative techniques to avoid processing expensive RNN queries and greatly reduce the number of region labeling operations. We perform detailed analyses on the complexity of CREST and lower bounds of the RC problem, and prove that CREST is asymptotically optimal in the worst case. Extensive experiments with both real and synthetic data sets demonstrate that CREST outperforms alternative algorithms by several orders of magnitude.

preprint2016arXiv

Room-temperature steady-state entanglement in a four-mode optomechanical system

Stationary entanglement in a four-mode optomechanical system, especially under roomtemperature, is discussed. In this scheme, when the coupling strengths between the two target modes and the mechanical resonator are equal, the results cannot be explained by the Bogoliubov mode- based scheme. This is related to the idea of quantum-mechanics-free subspace, which plays an important role when the thermal noise of the mechanical modes is considered. Significantly prominent steady-state entanglement can be available under room-temperature.

preprint2016arXiv

Spin anisotropy due to spin-orbit coupling in optimally hole-doped Ba$_{0.67}$K$_{0.33}$Fe$_{2}$As$_{2}$

We use polarized inelastic neutron scattering to study the temperature and energy dependence of spin space anisotropies in the optimally hole-doped iron pnictide Ba$_{0.67}$K$_{0.33}$Fe$_{2}$As$_{2}$ ($T_{\rm c}=38$ K). In the superconducting state, while the high-energy part of the magnetic spectrum is nearly isotropic, the low-energy part displays a pronouced anisotropy, manifested by a $c$-axis polarized resonance. We also observe that the spin anisotropy in superconducting Ba$_{0.67}$K$_{0.33}$Fe$_{2}$As$_{2}$ extends to higher energies compared to electron-doped BaFe$_{2-x}TM_{x}$As$_{2}$ ($TM=$Co, Ni) and isovalent-doped BaFe$_{2}$As$_{1.4}$P$_{0.6}$, suggesting a connection between $T_{\rm c}$ and the energy scale of the spin anisotropy. In the normal state, the low-energy spin anisotropy for optimally hole- and electron-doped iron pnictides onset at temperatures similar to the temperatures at which the elastoresistance deviate from Curie-Weiss behavior, pointing to a possible connection between the two phenomena. Our results highlight the relevance of the spin-orbit coupling to the superconductivity of the iron pnictides.

preprint2016arXiv

Surveillance and Intervention of Infrastructure-Free Mobile Communications: A New Wireless Security Paradigm

Conventional wireless security assumes wireless communications are rightful and aims to protect them against malicious eavesdropping and jamming attacks. However, emerging infrastructure-free mobile communication networks are likely to be illegally used (e.g., by criminals or terrorists) but difficult to be monitored, thus imposing new challenges on the public security. To tackle this issue, this article presents a paradigm shift of wireless security to the surveillance and intervention of infrastructure-free suspicious and malicious wireless communications, by exploiting legitimate eavesdropping and jamming jointly. In particular, {\emph{proactive eavesdropping}} (via jamming) is proposed to intercept and decode information from suspicious communication links for the purpose of inferring their intentions and deciding further measures against them. {\emph{Cognitive jamming}} (via eavesdropping) is also proposed so as to disrupt, disable, and even spoof the targeted malicious wireless communications to achieve various intervention tasks.

preprint2016arXiv

The Rise of Social Botnets: Attacks and Countermeasures

Online social networks (OSNs) are increasingly threatened by social bots which are software-controlled OSN accounts that mimic human users with malicious intentions. A social botnet refers to a group of social bots under the control of a single botmaster, which collaborate to conduct malicious behavior while mimicking the interactions among normal OSN users to reduce their individual risk of being detected. We demonstrate the effectiveness and advantages of exploiting a social botnet for spam distribution and digital-influence manipulation through real experiments on Twitter and also trace-driven simulations. We also propose the corresponding countermeasures and evaluate their effectiveness. Our results can help understand the potentially detrimental effects of social botnets and help OSNs improve their bot(net) detection systems.

preprint2016arXiv

Throughput Maximization for Mobile Relaying Systems

This paper studies a novel mobile relaying technique, where relays of high mobility are employed to assist the communications from source to destination. By exploiting the predictable channel variations introduced by relay mobility, we study the throughput maximization problem in a mobile relaying system via dynamic rate and power allocations at the source and relay. An optimization problem is formulated for a finite time horizon, subject to an information-causality constraint, which results from the data buffering employed at the relay. It is found that the optimal power allocations across the different time slots follow a "stair-case" water filling (WF) structure, with non-increasing and non-decreasing water levels at the source and relay, respectively. For the special case where the relay moves unidirectionally from source to destination, the optimal power allocations reduce to the conventional WF with constant water levels. Numerical results show that with appropriate trajectory design, mobile relaying is able to achieve tremendous throughput gain over the conventional static relaying.

preprint2016arXiv

Throughput Maximization for Mobile Relaying Systems

Relaying is an effective technique to achieve reliable wireless connectivity in harsh communication environment. However, most of the existing relaying schemes are based on relays with fixed locations, or \emph{static relaying}. In this paper, we consider a novel \emph{mobile relaying} technique, where the relay nodes are assumed to be capable of moving at high speed. Compared to static relaying, mobile relaying offers a new degree of freedom for performance enhancement via careful relay trajectory design. We study the throughput maximization problem in mobile relaying systems by optimizing the source/relay transmit power along with the relay trajectory, subject to practical mobility constraints (on the relay speed and initial/final relay locations), as well as the \emph{information-causality constraint} at the relay owing to its decode-store-and-forward (DSF) strategy. It is shown that for fixed relay trajectory, the throughput-optimal source/relay power allocations over time follow a "staircase" water filling (WF) structure, with \emph{non-increasing} and \emph{non-decreasing} water levels at the source and relay, respectively. On the other hand, with given power allocations, the throughput can be further improved by optimizing the relay trajectory via successive convex optimization. An iterative algorithm is thus proposed to optimize the power allocations and relay trajectory alternately. Furthermore, for the special case with free initial and final relay locations, the jointly optimal power allocation and relay trajectory are derived. Numerical results show that by optimizing the trajectory of the relay and power allocations adaptive to its induced channel variation, mobile relaying is able to achieve significant throughput gains over the conventional static relaying.

preprint2016arXiv

Transmit Optimization for Symbol-Level Spoofing

With recent developments of wireless communication technologies, malicious users can use them to commit crimes or launch terror attacks, thus imposing new threats on the public security. To quickly respond to defend these attacks, authorized parities (e.g., the National Security Agency of the USA) need to intervene in the malicious communication links over the air. This paper investigates this emerging wireless communication intervention problem at the physical layer. Unlike prior studies using jamming to disrupt or disable the targeted wireless communications, we propose a new physical-layer spoofing approach to change their communicated information. Consider a fundamental three-node system over additive white Gaussian noise (AWGN) channels, in which an intermediary legitimate spoofer aims to spoof a malicious communication link from Alice to Bob, such that the received message at Bob is changed from Alice's originally sent message to the one desired by the spoofer. We propose a new symbol-level spoofing scheme, where the spoofer designs the spoofing signal via exploiting the symbol-level relationship between each original constellation point of Alice and the desirable one of the spoofer. In particular, the spoofer aims to minimize the average spoofing-symbol-error-rate (SSER), which is defined as the average probability that the symbols decoded by Bob fail to be changed or spoofed, by designing its spoofing signals over symbols subject to the average transmit power constraint. By considering two cases when Alice employs the widely-used binary phase-shift keying (BPSK) and quadrature phase-shift keying (QPSK) modulations, we obtain the respective optimal solutions to the two average SSER minimization problems. Numerical results show that the symbol-level spoofing scheme with optimized transmission achieves a much lower average SSER, as compared to other benchmark schemes.

preprint2016arXiv

Williams decomposition for superprocesses

We decompose the genealogy of a general superprocess with spatially dependent branching mechanism with respect to the last individual alive (Williams decomposition). This is a generalization of the main result of Delmas and Hénard [Electron. J. Probab.,18,1-43,2013] where only superprocesses with spatially dependent quadratic branching mechanism were considered. As an application of the Williams decomposition, we prove that, for some superprocesses, the normalized total mass will converge to a point mass at its extinction time. This generalizes a result of Tribe [Ann. Probab.,20,286-311,1992] in the sense that our branching mechanism is more general.

preprint2016arXiv

Wireless Communications with Unmanned Aerial Vehicles: Opportunities and Challenges

Wireless communication systems that include unmanned aerial vehicles (UAVs) promise to provide cost-effective wireless connectivity for devices without infrastructure coverage. Compared to terrestrial communications or those based on high-altitude platforms (HAPs), on-demand wireless systems with low-altitude UAVs are in general faster to deploy, more flexibly re-configured, and are likely to have better communication channels due to the presence of short-range line-of-sight (LoS) links. However, the utilization of highly mobile and energy-constrained UAVs for wireless communications also introduces many new challenges. In this article, we provide an overview of UAV-aided wireless communications, by introducing the basic networking architecture and main channel characteristics, highlighting the key design considerations as well as the new opportunities to be exploited.

preprint2016arXiv

Wireless Information Surveillance via Proactive Eavesdropping with Spoofing Relay

Wireless information surveillance, by which suspicious wireless communications are closely monitored by legitimate agencies, is an integral part of national security. To enhance the information surveillance capability, we propose in this paper a new proactive eavesdropping approach via a spoofing relay, where the legitimate monitor operates in a full-duplex manner with simultaneous eavesdropping and spoofing relaying to vary the source transmission rate in favor of the eavesdropping performance. To this end, a power splitting receiver is proposed, where the signal received at each antenna of the legitimate monitor is split into two parts for information eavesdropping and spoofing relaying, respectively. We formulate an optimization problem to maximize the achievable eavesdropping rate by jointly optimizing the power splitting ratios and relay beamforming matrix at the multi-antenna monitor. Depending on the suspicious and eavesdropping channel conditions, the optimal solution corresponds to three possible spoofing relay strategies, namely \emph{constructive relaying}, \emph{jamming}, and \emph{simultaneous jamming and destructive relaying}. Numerical results show that the proposed technique significantly improves the eavesdropping rate of the legitimate monitor as compared to the existing passive eavesdropping and jamming-based eavesdropping schemes.

preprint2016arXiv

Wireless Power Meets Energy Harvesting: A Joint Energy Allocation Approach in OFDM-based System

This paper investigates an orthogonal frequency division multiplexing (OFDM)-based wireless powered communication system, where one user harvests energy from an energy access point (EAP) to power its information transmission to a data access point (DAP). The channels from the EAP to the user, i.e., the wireless energy transfer (WET) link, and from the user to the DAP, i.e., the wireless information transfer (WIT) link, vary over both time slots and sub-channels (SCs) in general. To avoid interference at DAP, WET and WIT are scheduled over orthogonal SCs at any slot. Our objective is to maximize the achievable rate at the DAP by jointly optimizing the SC allocation over time and the power allocation over time and SCs for both WET and WIT links. Assuming availability of full channel state information (CSI), the structural results for the optimal SC/power allocation are obtained and an offline algorithm is proposed to solve the problem. Furthermore, we propose a low-complexity online algorithm when causal CSI is available.

preprint2015arXiv

A General Utility Optimization Framework for Energy Harvesting Based Wireless Communications

In recent years, wireless communication systems are expected to achieve more cost-efficient and sustainable operations by replacing conventional fixed power supplies such as batteries with energy harvesting (EH) devices, which could provide electric energy from renewable energy sources (e.g., solar and wind). Such EH power supplies, however, are random and instable in nature, and as a result impose new challenges on reliable communication design and have triggered substantial research interests in EH based wireless communications. Building upon existing works, in this article, we develop a general optimization framework to maximize the utility of EH wireless communication systems. Our framework encapsulates a variety of design problems, such as throughput maximization and outage probability minimization in single-user and multiuser setups, and provides useful guidelines to the practical design of general EH based communication systems with different assumptions over the knowledge of time-varying wireless channels and EH rates at the transmitters.

preprint2015arXiv

Active Eavesdropping via Spoofing Relay Attack

This paper studies a new active eavesdropping technique via the so-called spoofing relay attack, which could be launched by the eavesdropper to significantly enhance the information leakage rate from the source over conventional passive eaves-dropping. With this attack, the eavesdropper acts as a relay to spoof the source to vary transmission rate in favor of its eavesdropping performance by either enhancing or degrading the effective channel of the legitimate link. The maxi-mum information leakage rate achievable by the eavesdropper and the corresponding optimal operation at the spoofing relay are obtained. It is shown that such a spoofing relay attack could impose new challenges from a physical-layer security perspective since it leads to significantly higher information leakage rate than conventional passive eavesdropping.

preprint2015arXiv

Adaptively Directional Wireless Power Transfer for Large-scale Sensor Networks

Wireless power transfer (WPT) prolongs the lifetime of wireless sensor network by providing sustainable power supply to the distributed sensor nodes (SNs) via electromagnetic waves. To improve the energy transfer efficiency in a large WPT system, this paper proposes an adaptively directional WPT (AD-WPT) scheme, where the power beacons (PBs) adapt the energy beamforming strategy to SNs' locations by concentrating the transmit power on the nearby SNs within the efficient charging radius. With the aid of stochastic geometry, we derive the closed-form expressions of the distribution metrics of the aggregate received power at a typical SN and further approximate the complementary cumulative distribution function using Gamma distribution with second-order moment matching. To design the charging radius for the optimal AD-WPT operation, we exploit the tradeoff between the power intensity of the energy beams and the number of SNs to be charged. Depending on different SN task requirements, the optimal AD-WPT can maximize the average received power or the active probability of the SNs, respectively. It is shown that both the maximized average received power and the maximized sensor active probability increase with the increased deployment density and transmit power of the PBs, and decrease with the increased density of the SNs and the energy beamwidth. Finally, we show that the optimal AD-WPT can significantly improve the energy transfer efficiency compared with the traditional omnidirectional WPT.

preprint2015arXiv

Bit-Scalable Deep Hashing with Regularized Similarity Learning for Image Retrieval and Person Re-identification

Extracting informative image features and learning effective approximate hashing functions are two crucial steps in image retrieval . Conventional methods often study these two steps separately, e.g., learning hash functions from a predefined hand-crafted feature space. Meanwhile, the bit lengths of output hashing codes are preset in most previous methods, neglecting the significance level of different bits and restricting their practical flexibility. To address these issues, we propose a supervised learning framework to generate compact and bit-scalable hashing codes directly from raw images. We pose hashing learning as a problem of regularized similarity learning. Specifically, we organize the training images into a batch of triplet samples, each sample containing two images with the same label and one with a different label. With these triplet samples, we maximize the margin between matched pairs and mismatched pairs in the Hamming space. In addition, a regularization term is introduced to enforce the adjacency consistency, i.e., images of similar appearances should have similar codes. The deep convolutional neural network is utilized to train the model in an end-to-end fashion, where discriminative image features and hash functions are simultaneously optimized. Furthermore, each bit of our hashing codes is unequally weighted so that we can manipulate the code lengths by truncating the insignificant bits. Our framework outperforms state-of-the-arts on public benchmarks of similar image search and also achieves promising results in the application of person re-identification in surveillance. It is also shown that the generated bit-scalable hashing codes well preserve the discriminative powers with shorter code lengths.

preprint2015arXiv

Broadband black phosphorus optical modulator in visible to mid-infrared spectral range

Black phosphorous (BP), a two-dimensional (2D) material, has a direct bandgap, which fills up the bandgap lacuna left by graphene topological insulators and transition-metal dichalcogenides because of its dependence on the layers and applied strains. Theoretically, the direct and tunable band gap indicates the broadband applications in optoelectronics with high efficiencies in the spectral range from visible to mid-infrared. Here, a BP broadband optical modulator is experimentally constructed and the passively modulated lasers at 639 nm (red), 1.06 um (near-infrared) and 2.1 um (mid-infrared) are realized by using the BP optical modulator as the saturable absorber in bulk lasers. The obtained results provide a promising alternative for rare broadband optical modulators and broaden the application range of BP in photonics.

preprint2015arXiv

Capacity Region of MISO Broadcast Channel for Simultaneous Wireless Information and Power Transfer

This paper studies a multiple-input single-output (MISO) broadcast channel (BC) featuring simultaneous wireless information and power transfer (SWIPT), where a multi-antenna access point (AP) delivers both information and energy via radio signals to multiple single-antenna receivers simultaneously, and each receiver implements either information decoding (ID) or energy harvesting (EH). In particular, pseudo-random sequences that are {\it a priori} known and therefore can be cancelled at each ID receiver is used as the energy signals, and the information-theoretically optimal dirty paper coding (DPC) is employed for the information transmission. We characterize the capacity region for ID receivers under given energy requirements for EH receivers, by solving a sequence of weighted sum-rate (WSR) maximization (WSRMax) problems subject to a maximum sum-power constraint for the AP, and a set of minimum harvested power constraints for individual EH receivers. The problem corresponds to a new form of WSRMax problem in MISO-BC with combined maximum and minimum linear transmit covariance constraints (MaxLTCCs and MinLTCCs), which differs from the celebrated capacity region characterization problem for MISO-BC under a set of MaxLTCCs only and is challenging to solve. By extending the general BC-multiple access channel (MAC) duality, which is only applicable to WSRMax problems with MaxLTCCs, and applying the ellipsoid method, we propose an efficient algorithm to solve this problem globally optimally. Furthermore, we also propose two suboptimal algorithms with lower complexity by assuming that the information and energy signals are designed separately. Finally, numerical results are provided to validate our proposed algorithms.

preprint2015arXiv

Classicality and amplification in postselected weak measurement

Nearly thirty years ago the possibility of anomalous weak amplfication (AWA) was revealed by Aharonov, Albert and Vaidman [1]. Recently two papers presents two AWA schemes which are beyond the traditional proposal given by them [14, 15]. At the first glance the two papers seems very different. Ref. [14] discusses the thermal light cross-Kerr effect and finds only postselection can give the amplification effect without interference of the postselected meter states, and Ref. [15] shows that only weak interaction itself can give the amplification effect without postselection. Here the relationships between the two papers are pointed out and a generalized framework for AWA via postselecting a pair of orthogonal final states is shown.

preprint2015arXiv

Cognitive Wireless Powered Network: Spectrum Sharing Models and Throughput Maximization

The recent advance in radio-frequency (RF) wireless energy transfer (WET) has motivated the study of wireless powered communication network (WPCN), in which distributed wireless devices are powered via dedicated WET by the hybrid access-point (H-AP) in the downlink (DL) for uplink (UL) wireless information transmission (WIT). In this paper, by exploiting the cognitive radio (CR) technique, we study a new type of CR enabled secondary WPCN, called cognitive WPCN, under spectrum sharing with the primary wireless communication system. In particular, we consider a cognitive WPCN, consisting of one single H-AP with constant power supply and distributed users, shares the same spectrum for its DL WET and UL WIT with an existing primary communication link, where the WPCN's WET/WIT and the primary link's WIT may interfere with each other. Under this new setup, we propose two coexisting models for spectrum sharing of the two systems, namely underlay and overlay based cognitive WPCNs, depending on different types of knowledge on the primary user transmission available at the cognitive WPCN. For each model, we maximize the sum-throughput of the cognitive WPCN by optimizing its transmission under different constraints applied to protect the primary user transmission. Analysis and simulation results are provided to compare the sum-throughput of the cognitive WPCN versus the achievable rate of the primary user in two coexisting models. It is shown that the overlay based cognitive WPCN outperforms the underlay based counterpart, thanks to its fully cooperative WET/WIT design with the primary WIT, while it also requires higher complexity for implementation.

preprint2015arXiv

Cooperative Energy Trading in CoMP Systems Powered by Smart Grids

This paper studies the energy management in the coordinated multi-point (CoMP) systems powered by smart grids, where each base station (BS) with local renewable energy generation is allowed to implement the two-way energy trading with the grid. Due to the uneven renewable energy supply and communication energy demand over distributed BSs as well as the difference in the prices for their buying/selling energy from/to the gird, it is beneficial for the cooperative BSs to jointly manage their energy trading with the grid and energy consumption in CoMP based communication for reducing the total energy cost. Specifically, we consider the downlink transmission in one CoMP cluster by jointly optimizing the BSs' purchased/sold energy units from/to the grid and their cooperative transmit precoding, so as to minimize the total energy cost subject to the given quality of service (QoS) constraints for the users. First, we obtain the optimal solution to this problem by developing an algorithm based on techniques from convex optimization and the uplink-downlink duality. Next, we propose a sub-optimal solution of lower complexity than the optimal solution, where zero-forcing (ZF) based precoding is implemented at the BSs. Finally, through extensive simulations, we show the performance gain achieved by our proposed joint energy trading and communication cooperation schemes in terms of energy cost reduction, as compared to conventional schemes that separately design communication cooperation and energy trading.

preprint2015arXiv

Distributed Energy Beamforming with One-Bit Feedback

Energy beamforming (EB) is a key technique for achieving efficient radio-frequency (RF) transmission enabled wireless energy transfer (WET). By optimally designing the waveforms from multiple energy transmitters (ETs) over the wireless channels, they are constructively combined at the energy receiver (ER) to achieve an EB gain that scales with the number of ETs. However, the optimal design of transmit waveforms requires accurate channel state information (CSI) at the ETs, which is challenging to obtain in practical WET systems. In this paper, we propose a new channel training scheme to achieve optimal EB gain in a distributed WET system, where multiple separated ETs adjust their transmit phases to collaboratively send power to a single ER in an iterative manner, based on one-bit feedback from the ER per training interval which indicates the increase/decrease of the received power level from one particular ET over two preassigned transmit phases. The proposed EB algorithm can be efficiently implemented in practical WET systems even with a large number of distributed ETs, and is analytically shown to converge quickly to the optimal EB design as the number of feedback intervals per ET increases. Numerical results are provided to evaluate the performance of the proposed algorithm as compared to other distributed EB designs.

preprint2015arXiv

Doping evolution of antiferromagnetism and transport properties in the non-superconducting BaFe2-2xNixCrxAs2

We report elastic neutron scattering and transport measurements on the Ni and Cr equivalently doped iron pnictide BaFe$_{2-2x}$Ni$_{x}$Cr$_{x}$As$_{2}$. Compared with the electron-doped BaFe$_{2-x}$Ni$_{x}$As$_{2}$, the long-range antiferromagnetic (AF) order in BaFe$_{2-2x}$Ni$_{x}$Cr$_{x}$As$_{2}$ is gradually suppressed with vanishing ordered moment and Néel temperature near $x= 0.20$ without the appearance of superconductivity. A detailed analysis on the transport properties of BaFe$_{2-x}$Ni$_{x}$As and BaFe$_{2-2x}$Ni$_{x}$Cr$_{x}$As$_{2}$ suggests that the non-Fermi-liquid behavior associated with the linear resistivity as a function of temperature may not correspond to the disappearance of the static AF order. From the temperature dependence of the resistivity in overdoped compounds without static AF order, we find that the transport properties are actually affected by Cr impurity scattering, which may induce a metal-to-insulator crossover in highly doped BaFe$_{1.7-y}$Ni$_{0.3}$Cr$_{y}$As$_{2}$.

preprint2015arXiv

Electric Field and Humidity Trigger Contact Electrification

Here, we study the old problem of why identical insulators can charge one another on contact. We perform several experiments showing that, if driven by a preexisting electric field, charge is transferred between contacting insulators. This happens because the insulator surfaces adsorb small amounts of water from a humid atmosphere. We believe the electric field then separates positively from negatively charged ions prevailing within the water, which we believe to be hydronium and hydroxide ions, such that at the point of contact, positive ions of one insulator neutralize negative ions of the other one, charging both of them. This mechanism can explain for the first time the observation made four decades ago that wind-blown sand discharges in sparks if and only if a thunderstorm is nearby.

preprint2015arXiv

Electronic and magneto-optical properties of monolayer phosphorene quantum dots

We theoretically investigate the electronic and magneto-optical properties of rectangular, hexangular, and triangular monolayer phosphorene quantum dots (MPQDs) utilizing the tight-binding method. The electronic states, density of states, electronic density distribution, and Laudau levels as well as the optical absorption spectrum are calculated numerically. Our calculations show that: (1) edge states appear in the band gap in all kinds of MPQDs regardless of their shapes and edge configurations due to the anisotropic electron hopping in monolayer phosphorene (MLP). Electrons in any edge state appear only in the armchair direction of the dot boundary, which is distinct from that in graphene quantum dots; (2) the magnetic levels of MPQDs exhibit a Hofstadter-butterfly spectrum and approach the Landau levels of MLP as the magnetic field increases . A "flat band" appears in the magneto-energy spectrum which is totally different from that of MLP; (3) the electronic and optical properties can be tuned by the dot size, the types of boundary edges and the external magnetic field.

preprint2015arXiv

Electronic nematic correlations in the stress free tetragonal state of BaFe$_{2-x}$Ni$_{x}$As$_{2}$

We use transport and neutron scattering to study electronic, structural, and magnetic properties of the electron-doped BaFe$_{2-x}$Ni$_x$As$_2$ iron pnictides in the external stress free detwinned state. Using a specially designed in-situ mechanical detwinning device, we demonstrate that the in-plane resistivity anisotropy observed in the uniaxial strained tetragonal state of BaFe$_{2-x}$Ni$_x$As$_2$ below a temperature $T^\ast$, previously identified as a signature of the electronic nematic phase, is also present in the stress free tetragonal phase below $T^{\ast\ast}$ ($<T^\ast$). By carrying out neutron scattering measurements on BaFe$_2$As$_2$ and BaFe$_{1.97}$Ni$_{0.03}$As$_2$, we argue that the resistivity anisotropy in the stress free tetragonal state of iron pnictides arises from the magnetoelastic coupling associated with antiferromagnetic order. These results thus indicate that the local lattice distortion and nematic spin correlations are responsible for the resistivity anisotropy in the tetragonal state of iron pnictides.

preprint2015arXiv

Energy Group-Buying with Loading Sharing for Green Cellular Networks

In the emerging hybrid electricity market, mobile network operators (MNOs) of cellular networks can make day-ahead energy purchase commitments at low prices and real-time flexible energy purchase at high prices. To minimize electricity bills, it is essential for MNOs to jointly optimize the day-ahead and real-time energy purchase based on their time-varying wireless traffic load. In this paper, we consider two different MNOs coexisting in the same area, and exploit their collaboration in both energy purchase and wireless load sharing for energy cost saving. Specifically, we propose a new approach named energy group buying with load sharing, in which the two MNOs are aggregated as a single group to make the day-ahead and real-time energy purchase, and their base stations (BSs) share the wireless traffic to maximally turn lightly-loaded BSs into sleep mode. When the two MNOs belong to the same entity and aim to minimize their total energy cost, we use the two-stage stochastic programming to obtain the optimal day-ahead and real-time energy group buying jointly with wireless load sharing. When the two MNOs belong to different entities and are self-interested in minimizing their individual energy costs, we propose a novel repeated Nash bargaining scheme for them to negotiate and share their energy costs under energy group buying and load sharing. Our proposed repeated Nash bargaining scheme is shown to achieve Pareto-optimal and fair energy cost reductions for both MNOs.

preprint2015arXiv

Joint Power Control and Fronthaul Rate Allocation for Throughput Maximization in OFDMA-based Cloud Radio Access Network

The performance of cloud radio access network (C-RAN) is constrained by the limited fronthaul link capacity under future heavy data traffic. To tackle this problem, extensive efforts have been devoted to design efficient signal quantization/compression techniques in the fronthaul to maximize the network throughput. However, most of the previous results are based on information-theoretical quantization methods, which are hard to implement due to the extremely high complexity. In this paper, we consider using practical uniform scalar quantization in the uplink communication of an orthogonal frequency division multiple access (OFDMA) based C-RAN system, where the mobile users are assigned with orthogonal sub-carriers for multiple access. In particular, we consider joint wireless power control and fronthaul quantization design over the sub-carriers to maximize the system end-to-end throughput. Efficient algorithms are proposed to solve the joint optimization problem when either information-theoretical or practical fronthaul quantization method is applied. Interestingly, we find that the fronthaul capacity constraints have significant impact to the optimal wireless power control policy. As a result, the joint optimization shows significant performance gain compared with either optimizing wireless power control or fronthaul quantization alone. Besides, we also show that the proposed simple uniform quantization scheme performs very close to the throughput performance upper bound, and in fact overlaps with the upper bound when the fronthaul capacity is sufficiently large. Overall, our results would help reveal practically achievable throughput performance of C-RAN, and lead to more efficient deployment of C-RAN in the next-generation wireless communication systems.

preprint2015arXiv

Limit Theorems for Some Critical Superprocesses

In this paper we establish some conditional limit theorems for some critical superprocesses $X=\{X_t, t\ge 0\}$. First we identify the rate of non-extinction. Then we show that, for a large class of functions $f$, conditioned on non-extinction at time $t$, the limit, as $t\to\infty$, of $t^{-1}\langle f, X_t\rangle$ exists in distribution and we identify this limit. Finally, we also establish, under some conditions, a central limit theorem for $\langle f, X_t\rangle$ conditioned on non-extinction at time $t$.

preprint2015arXiv

Magnetic Beamforming for Wireless Power Transfer

Magnetic resonant coupling (MRC) is an efficient method for realizing the near-field wireless power transfer (WPT). The use of multiple transmitters (TXs) each with one coil can be applied to enhance the WPT performance by focusing the magnetic fields from all TX coils in a beam toward the receiver (RX) coil, termed as "magnetic beamforming". In this paper, we study the optimal magnetic beamforming for an MRC-WPT system with multiple TXs and a single RX. We formulate an optimization problem to jointly design the currents flowing through different TXs so as to minimize the total power drawn from their voltage sources, subject to the minimum power required by the RX load as well as the TXs' constraints on the peak voltage and current. For the special case of identical TX resistances and neglecting all TXs' constraints on the peak voltage and current, we show that the optimal current magnitude of each TX is proportional to the mutual inductance between its TX coil and the RX coil. In general, the problem is a non-convex quadratically constrained quadratic programming (QCQP) problem, which is reformulated as a semidefinite programming (SDP) problem. We show that its semidefinite relaxation (SDR) is tight. Numerical results show that magnetic beamforming significantly enhances the deliverable power as well as the WPT efficiency over the uncoordinated benchmark scheme of equal current allocation.

preprint2015arXiv

Millimeter Wave MIMO with Lens Antenna Array: A New Path Division Multiplexing Paradigm

Millimeter wave (mmWave) communication is a promising technology for 5G cellular systems. To compensate for the severe path loss in mmWave systems, large antenna arrays are generally used to achieve significant beamforming gains. However, due to the high hardware and power consumption cost associated with radio frequency (RF) chains, it is desirable to achieve the large-antenna gains, but with only limited number of RF chains for mmWave communications. To this end, we study in this paper a new lens antenna array enabled mmWave MIMO communication system. We first show that the array response of the proposed lens antenna array at the receiver/transmitter follows a "sinc" function, where the antenna with the peak response is determined by the angle of arrival (AoA)/departure (AoD) of the received/transmitted signal. By exploiting this unique property of lens antenna arrays along with the multi-path sparsity of mmWave channels, we propose a novel low-cost and capacity-achieving MIMO transmission scheme, termed \emph{orthogonal path division multiplexing (OPDM)}. For channels with insufficiently separated AoAs and/or AoDs, we also propose a simple \emph{path grouping} technique with group-based small-scale MIMO processing to mitigate the inter-path interference. Numerical results are provided to compare the performance of the proposed lens antenna arrays for mmWave MIMO system against that of conventional arrays, under different practical setups. It is shown that the proposed system achieves significant throughput gain as well as complexity and hardware cost reduction, both making it an appealing new paradigm for mmWave MIMO communications.

preprint2015arXiv

MOOCs Meet Measurement Theory: A Topic-Modelling Approach

This paper adapts topic models to the psychometric testing of MOOC students based on their online forum postings. Measurement theory from education and psychology provides statistical models for quantifying a person's attainment of intangible attributes such as attitudes, abilities or intelligence. Such models infer latent skill levels by relating them to individuals' observed responses on a series of items such as quiz questions. The set of items can be used to measure a latent skill if individuals' responses on them conform to a Guttman scale. Such well-scaled items differentiate between individuals and inferred levels span the entire range from most basic to the advanced. In practice, education researchers manually devise items (quiz questions) while optimising well-scaled conformance. Due to the costly nature and expert requirements of this process, psychometric testing has found limited use in everyday teaching. We aim to develop usable measurement models for highly-instrumented MOOC delivery platforms, by using participation in automatically-extracted online forum topics as items. The challenge is to formalise the Guttman scale educational constraint and incorporate it into topic models. To favour topics that automatically conform to a Guttman scale, we introduce a novel regularisation into non-negative matrix factorisation-based topic modelling. We demonstrate the suitability of our approach with both quantitative experiments on three Coursera MOOCs, and with a qualitative survey of topic interpretability on two MOOCs by domain expert interviews.

preprint2015arXiv

Multi-antenna Wireless Powered Communication with Co-channel Energy and Information Transfer

This letter studies a multi-antenna wireless powered communication (WPC) system with co-channel energy and information transfer, where a wireless device (WD), powered up by wireless energy transfer (WET) from an energy transmitter (ET), communicates to an information receiver (IR) over the same frequency band. We maximize the achievable data rate from the WD to the IR by jointly optimizing the energy beamforming at the ET and the information beamforming at the WD, subject to their individual transmit power constraints. We obtain the optimal solution to this problem in closed-form, where the optimal energy beamforming at the ET achieves a best energy/interference tradeoff between maximizing the energy transfer efficiency to the WD and minimizing the co-channel interference to the IR. Numerical results show that our proposed optimal co-channel design is superior to other reference schemes.

preprint2015arXiv

Multiuser Charging Control in Wireless Power Transfer via Magnetic Resonant Coupling

Magnetic resonant coupling (MRC) is a practically appealing method for realizing the near-field wireless power transfer (WPT). The MRC-WPT system with a single pair of transmitter and receiver has been extensively studied in the literature, while there is limited work on the general setup with multiple transmitters and/or receivers. In this paper, we consider a point-to-multipoint MRC-WPT system with one transmitter sending power wirelessly to a set of distributed receivers simultaneously. We derive the power delivered to the load of each receiver in closed-form expression, and reveal a "near-far" fairness issue in multiuser power transmission due to users' distance-dependent mutual inductances with the transmitter. We also show that by designing the receivers' load resistances, the near-far issue can be optimally solved. Specifically, we propose a centralized algorithm to jointly optimize the load resistances to minimize the power drawn from the energy source at the transmitter under given power requirements for the loads. We also devise a distributed algorithm for the receivers to adjust their load resistances iteratively, for ease of practical implementation.

preprint2015arXiv

Multiuser MIMO Wireless Energy Transfer With Coexisting Opportunistic Communication

This letter considers spectrum sharing between a primary multiuser multiple-input multiple-output (MIMO) wireless energy transfer (WET) system and a coexisting secondary point-to-point MIMO wireless information transmission (WIT) system, where WET generates interference to WIT and degrades its throughput performance. We show that due to the interference, the WIT system suffers from a loss of the degrees of freedom (DoF) proportional to the number of energy beams sent by the energy transmitter (ET), which, in general, needs to be larger than one in order to optimize the multiuser WET with user fairness consideration. To minimize the DoF loss in WIT, we further propose a new single-beam energy transmission scheme based on the principle of time sharing, where the ET transmits one of the optimal energy beams at each time. This new scheme achieves the same optimal performance for the WET system, and minimizes the impact of its interference to the WIT system.

preprint2015arXiv

Nematic crossover in BaFe$_2$As$_2$ under uniaxial stress

Raman scattering can detect spontaneous point-group symmetry breaking without resorting to single-domain samples. Here we use this technique to study $\mathrm{BaFe_2As_2}$, the parent compound of the "122" Fe-based superconductors. We show that an applied compression along the Fe-Fe direction, which is commonly used to produce untwinned orthorhombic samples, changes the structural phase transition at temperature $T_{\mathrm{s}}$ into a crossover that spans a considerable temperature range above $T_{\mathrm{s}}$. Even in crystals that are not subject to any applied force, a distribution of substantial residual stress remains, which may explain phenomena that are seemingly indicative of symmetry breaking above $T_{\mathrm{s}}$. Our results are consistent with an onset of spontaneous nematicity only below $T_{\mathrm{s}}$.

preprint2015arXiv

Nematic magnetoelastic effect contrasted between Ba(Fe$_{1-x}$Co$_{x}$)$_2$As$_2$ and FeSe

To elucidate the origin of nematic order in Fe-based superconductors, we report a Raman scattering study of lattice dynamics, which quantify the extent of $C_4$-symmetry breaking, in BaFe$_2$As$_2$ and FeSe. FeSe possesses a nematic ordering temperature $T_\mathrm{s}$ and orbital-related band-energy split below $T_\mathrm{s}$ that are similar to those in BaFe$_2$As$_2$, but unlike BaFe$_2$As$_2$ it has no long-range magnetic order. We find that the $E_g$ phonon-energy split in FeSe sets in only well below $T_\mathrm{s}$, and its saturated value is substantially smaller than that in BaFe$_2$As$_2$. Together with reported results for the Ba(Fe$_{1-x}$Co$_{x}$)$_2$As$_2$ family, the data suggest that magnetism exerts a major influence on the lattice.

preprint2015arXiv

Optimal Pricing and Load Sharing for Energy Saving in Communications Cooperation

In this paper, we propose a pricing mechanism for the uplink communication cooperation to save the energy of mobile terminals (MTs) in wireless cellular network. Under the uncertainties of the other MTs' channel and battery conditions, a source MT in low battery level or bad channel condition is allowed to select and pay another MT in proximity to help forward its data package to the base station (BS). We formulate the source MT's pricing and load sharing problem as an optimization problem to minimize its expected energy cost. When the source MT cannot split its data package for a certain multimedia application, we motivate the selected relay MT to forward the whole data package by obtaining the optimal pricing through a dichotomous search algorithm. When the source MT can split the data package, we jointly optimize the pricing and load sharing with the relay MT and propose an alternating optimization algorithm that achieves near-optimal solution. Extensive numerical results are provided to show that our proposed pricing mechanism can significantly decrease the source MT's expected energy cost, and load sharing is more cost-efficient when the size of the data package is large and the average number of helping MTs is small.

preprint2015arXiv

Optimized Training for Net Energy Maximization in Multi-Antenna Wireless Energy Transfer over Frequency-Selective Channel

This paper studies the training design problem for multiple-input single-output (MISO) wireless energy transfer (WET) systems in frequency-selective channels, where the frequency-diversity and energy-beamforming gains can be both reaped to maximize the transferred energy by efficiently learning the channel state information (CSI) at the energy transmitter (ET). By exploiting channel reciprocity, a new two-phase channel training scheme is proposed to achieve the diversity and beamforming gains, respectively. In the first phase, pilot signals are sent from the energy receiver (ER) over a selected subset of the available frequency sub-bands, through which the ET determines a certain number of "strongest" sub-bands with largest antenna sum-power gains and sends their indices to the ER. In the second phase, the selected sub-bands are further trained by the ER, so that the ET obtains a refined estimate of the corresponding MISO channels to implement energy beamforming for WET. A training design problem is formulated and optimally solved, which takes into account the channel training overhead by maximizing the net harvested energy at the ER, defined as the average harvested energy offset by that consumed in the two-phase training. Moreover, asymptotic analysis is obtained for systems with a large number of antennas or a large number of sub-bands to gain useful insights on the optimal training design. Finally, numerical results are provided to corroborate our analysis and show the effectiveness of the proposed scheme that optimally balances the diversity and beamforming gains achieved in MISO WET systems with limited-energy training.

preprint2015arXiv

Optimized Uplink Transmission in Multi-Antenna C-RAN with Spatial Compression and Forward

Massive MIMO and C-RAN are two promising techniques for implementing future wireless communication systems, where a large number of antennas are deployed either being co-located at the base station (BS) or totally distributed at separate sites called remote radio heads (RRHs). In this paper, we consider a general antenna deployment design for wireless networks, termed multi-antenna C-RAN, where a flexible number of antennas can be equipped at each RRH to more effectively balance the performance and fronthaul complexity trade-off beyond the conventional massive MIMO and single-antenna C-RAN. Under the uplink communication setup, we propose a new "spatial-compression-and-forward (SCF)" scheme, where each RRH first performs a linear spatial filtering to denoise and maximally compress its received signals from multiple users to a reduced number of dimensions, then conducts uniform scalar quantization over each of the resulting dimensions in parallel, and finally sends the total quantized bits to the baseband unit (BBU) via a finite-rate fronthaul link for joint information decoding. Under this scheme, we maximize the minimum signal-to-interference-plus-noise ratio (SINR) of all users at the BBU by a joint resource allocation over the wireless transmission and fronthaul links. Specifically, each RRH determines its own spatial filtering solution in a distributed manner to reduce the signalling overhead with the BBU, while the BBU jointly optimizes the users' transmit power, the RRHs' fronthaul bits allocation, and the BBU's receive beamforming with fixed spatial filters at individual RRHs. Through numerical results, it is shown that given a total number of antennas to be deployed, multi-antenna C-RAN with the proposed SCF and joint optimization significantly outperforms both massive MIMO and single-antenna C-RAN under practical fronthaul capacity constraints.

preprint2015arXiv

Placement Optimization of Energy and Information Access Points in Wireless Powered Communication Networks

The applications of wireless power transfer technology to wireless communications can help build a wireless powered communication network (WPCN) with more reliable and sustainable power supply compared to the conventional battery-powered network. However, due to the fundamental differences in wireless information and power transmissions, many important aspects of conventional battery-powered wireless communication networks need to be redesigned for efficient operations of WPCNs. In this paper, we study the placement optimization of energy and information access points in WPCNs, where the wireless devices (WDs) harvest the radio frequency energy transferred by dedicated energy nodes (ENs) in the downlink, and use the harvested energy to transmit data to information access points (APs) in the uplink. In particular, we are interested in minimizing the network deployment cost with minimum number of ENs and APs by optimizing their locations, while satisfying the energy harvesting and communication performance requirements of the WDs. Specifically, we first study the minimum-cost placement problem when the ENs and APs are separately located, where an alternating optimization method is proposed to jointly optimize the locations of ENs and APs. Then, we study the placement optimization when each pair of EN and AP are co-located and integrated as a hybrid access point, and propose an efficient algorithm to solve this problem. Simulation results show that the proposed methods can effectively reduce the network deployment cost and yet guarantee the given performance requirements, which is a key consideration in the future applications of WPCNs.

preprint2015arXiv

Proactive Eavesdropping via Jamming for Rate Maximization over Rayleigh Fading Channels

Instead of against eavesdropping, this letter proposes a new paradigm in wireless security by studying how a legitimate monitor (e.g., government agencies) efficiently eavesdrops a suspicious wireless communication link. The suspicious transmitter controls its communication rate over Rayleigh fading channels to maintain a target outage probability at the receiver, and the legitimate monitor can successfully eavesdrop only when its achievable rate is no smaller than the suspicious communication rate. We propose a proactive eavesdropping via jamming approach to maximize the average eavesdropping rate, where the legitimate monitor sends jamming signals with optimized power control to moderate the suspicious communication rate.

preprint2015arXiv

Secrecy Wireless Information and Power Transfer in Fading Wiretap Channel

Simultaneous wireless information and power transfer (SWIPT) has recently drawn significant interests for its dual use of radio signals to provide wireless data and energy access at the same time. However, a challenging secrecy communication issue arises as the messages sent to the information receivers (IRs) may be eavesdropped by the energy receivers (ERs), which are presumed to harvest energy only from the received signals. To tackle this problem, we propose in this paper an artificial noise (AN) aided transmission scheme to facilitate the secrecy information transmission to IRs and yet meet the energy harvesting requirement for ERs, under the assumption that the AN can be cancelled at IRs but not at ERs. Specifically, the proposed scheme splits the transmit power into two parts, to send the confidential message to the IR and an AN to interfere with the ER, respectively. Under a simplified three-node wiretap channel setup, the transmit power allocations and power splitting ratios over fading channels are jointly optimized to minimize the outage probability for delay-limited secrecy information transmission, or to maximize the average rate for no-delay-limited secrecy information transmission, subject to a combination of average and peak power constraints at the transmitter as well as an average energy harvesting constraint at the ER. Both the secrecy outage probability minimization and average rate maximization problems are shown to be non-convex, for each of which we propose the optimal solution based on the dual decomposition as well as suboptimal solution based on the alternating optimization. Furthermore, two benchmark schemes are introduced for comparison. Finally, the performances of proposed schemes are evaluated by simulations in terms of various trade-offs for wireless (secrecy) information versus energy transmissions.

preprint2015arXiv

Secrecy Wireless Information and Power Transfer in OFDMA Systems

In this paper, we consider simultaneous wireless information and power transfer (SWIPT) in orthogonal frequency division multiple access (OFDMA) systems with the coexistence of information receivers (IRs) and energy receivers (ERs). The IRs are served with best-effort secrecy data and the ERs harvest energy with minimum required harvested power. To enhance physical-layer security and yet satisfy energy harvesting requirements, we introduce a new frequency-domain artificial noise based approach. We study the optimal resource allocation for the weighted sum secrecy rate maximization via transmit power and subcarrier allocation. The considered problem is non-convex, while we propose an efficient algorithm for solving it based on Lagrange duality method. Simulation results illustrate the effectiveness of the proposed algorithm as compared against other heuristic schemes.

preprint2015arXiv

SecureFind: Secure and Privacy-Preserving Object Finding via Mobile Crowdsourcing

The plummeting cost of Bluetooth tags and the ubiquity of mobile devices are revolutionizing the traditional lost-and-found service. This paper presents SecureFind, a secure and privacy-preserving object-finding system via mobile crowdsourcing. In SecureFind, a unique Bluetooth tag is attached to every valuable object, and the owner of a lost object submits an object-finding request to many mobile users via the SecureFind service provider. Each mobile user involved searches his vicinity for the lost object on behalf of the object owner who can infer the location of his lost object based on the responses from mobile users. SecureFind is designed to ensure strong object security such that only the object owner can discover the location of his lost object as well as offering strong location privacy to mobile users involved. The high efficacy and efficiency of SecureFind are confirmed by extensive simulations.

preprint2015arXiv

Spatial Throughput Maximization of Wireless Powered Communication Networks

Wireless charging is a promising way to power wireless nodes' transmissions. This paper considers new dual-function access points (APs) which are able to support the energy/information transmission to/from wireless nodes. We focus on a large-scale wireless powered communication network (WPCN), and use stochastic geometry to analyze the wireless nodes' performance tradeoff between energy harvesting and information transmission. We study two cases with battery-free and battery-deployed wireless nodes. For both cases, we consider a harvest-then-transmit protocol by partitioning each time frame into a downlink (DL) phase for energy transfer, and an uplink (UL) phase for information transfer. By jointly optimizing frame partition between the two phases and the wireless nodes' transmit power, we maximize the wireless nodes' spatial throughput subject to a successful information transmission probability constraint. For the battery-free case, we show that the wireless nodes prefer to choose small transmit power to obtain large transmission opportunity. For the battery-deployed case, we first study an ideal infinite-capacity battery scenario for wireless nodes, and show that the optimal charging design is not unique, due to the sufficient energy stored in the battery. We then extend to the practical finite-capacity battery scenario. Although the exact performance is difficult to be obtained analytically, it is shown to be upper and lower bounded by those in the infinite-capacity battery scenario and the battery-free case, respectively. Finally, we provide numerical results to corroborate our study.

preprint2015arXiv

Strong law of large numbers for supercritical superprocesses under second moment condition

Suppose that $X=\{X_t, t\ge 0\}$ is a supercritical superprocess on a locally compact separable metric space $(E, m)$. Suppose that the spatial motion of $X$ is a Hunt process satisfying certain conditions and that the branching mechanism is of the form $$ ψ(x,λ)=-a(x)λ+b(x)λ^2+\int_{(0,+\infty)}(e^{-λy}-1+λy)n(x,dy), \quad x\in E, \quadλ> 0, $$ where $a\in \mathcal{B}_b(E)$, $b\in \mathcal{B}_b^+(E)$ and $n$ is a kernel from $E$ to $(0,\infty)$ satisfying $$ \sup_{x\in E}\int_0^\infty y^2 n(x,dy)<\infty. $$ Put $T_tf(x)=\mathbb{P}_{δ_x}< f,X_t>$. Let $λ_0>0$ be the largest eigenvalue of the generator $L$ of $T_t$, and $ϕ_0$ and $\hatϕ_0$ be the eigenfunctions of $L$ and $\hat{L}$ (the dural of $L$) respectively associated with $λ_0$. Under some conditions on the spatial motion and the $ϕ_0$-transformed semigroup of $T_t$, we prove that for a large class of suitable functions $f$, we have $$ \lim_{t\rightarrow\infty}e^{-λ_0 t}< f, X_t> = W_\infty\int_E\hatϕ_0(y)f(y)m(dy),\quad \mathbb{P}_μ{-a.s.}, $$ for any finite initial measure $μ$ on $E$ with compact support, where $W_\infty$ is the martingale limit defined by $W_\infty:=\lim_{t\to\infty}e^{-λ_0t}< ϕ_0, X_t>$. Moreover, the exceptional set in the above limit does not depend on the initial measure $μ$ and the function $f$.

preprint2015arXiv

Throughput Optimization for Massive MIMO Systems Powered by Wireless Energy Transfer

This paper studies a wireless-energy-transfer (WET) enabled massive multiple-input-multiple-output (MIMO) system (MM) consisting of a hybrid data-and-energy access point (H-AP) and multiple single-antenna users. In the WET-MM system, the H-AP is equipped with a large number $M$ of antennas and functions like a conventional AP in receiving data from users, but additionally supplies wireless power to the users. We consider frame-based transmissions. Each frame is divided into three phases: the uplink channel estimation (CE) phase, the downlink WET phase, as well as the uplink wireless information transmission (WIT) phase. Firstly, users use a fraction of the previously harvested energy to send pilots, while the H-AP estimates the uplink channels and obtains the downlink channels by exploiting channel reciprocity. Next, the H-AP utilizes the channel estimates just obtained to transfer wireless energy to all users in the downlink via energy beamforming. Finally, the users use a portion of the harvested energy to send data to the H-AP simultaneously in the uplink (reserving some harvested energy for sending pilots in the next frame). To optimize the throughput and ensure rate fairness, we consider the problem of maximizing the minimum rate among all users. In the large-$M$ regime, we obtain the asymptotically optimal solutions and some interesting insights for the optimal design of WET-MM system. We define a metric, namely, the massive MIMO degree-of-rate-gain (MM-DoRG), as the asymptotic UL rate normalized by $\log(M)$. We show that the proposed WET-MM system is optimal in terms of MM-DoRG, i.e., it achieves the same MM-DoRG as the case with ideal CE.

preprint2015arXiv

TrueTop: A Sybil-Resilient System for User Influence Measurement on Twitter

Influential users have great potential for accelerating information dissemination and acquisition on Twitter. How to measure the influence of Twitter users has attracted significant academic and industrial attention. Existing influential measurement techniques, however, are vulnerable to sybil users that are thriving on Twitter. Although sybil defenses for online social networks have been extensively investigated, they commonly assume unique mappings from human-established trust relationships to online social associations and thus do not apply to Twitter where users can freely follow each other. This paper presents TrueTop, the first sybil-resilient system to measure the influence of Twitter users. TrueTop is firmly rooted in two observations from real Twitter datasets. First, although non-sybil users may incautiously follow strangers, they tend to be more careful and selective in retweeting, replying to, and mentioning other Twitter users. Second, influential users usually get much more retweets, replies, and mentions than non-influential users. Detailed theoretical studies and synthetic simulations show that TrueTop can generate very accurate influence measurement results and also have strong resilience to sybil attacks.

preprint2015arXiv

Wireless Communications in the Era of Big Data

The rapidly growing wave of wireless data service is pushing against the boundary of our communication network's processing power. The pervasive and exponentially increasing data traffic present imminent challenges to all the aspects of the wireless system design, such as spectrum efficiency, computing capabilities and fronthaul/backhaul link capacity. In this article, we discuss the challenges and opportunities in the design of scalable wireless systems to embrace such a "bigdata" era. On one hand, we review the state-of-the-art networking architectures and signal processing techniques adaptable for managing the bigdata traffic in wireless networks. On the other hand, instead of viewing mobile bigdata as a unwanted burden, we introduce methods to capitalize from the vast data traffic, for building a bigdata-aware wireless network with better wireless service quality and new mobile applications. We highlight several promising future research directions for wireless communications in the mobile bigdata era.

preprint2015arXiv

Wireless Power Charging Control in Multiuser Broadband Networks

Recent advances in wireless power transfer (WPT) technology provide a cost-effective solution to charge wireless devices remotely without disruption to the use. In this paper, we propose an efficient wireless charging control method for exploiting the frequency diversity in multiuser broadband wireless networks, to reduce energy outage and keep the system operating in an efficient and sustainable state. In particular, we first analyze the impact of charging control method to the operating lifetime of a WPT-enabled broadband system. Based on the analysis, we then propose a multi-criteria charging control policy that optimizes the transmit power allocation over frequency by jointly considering the channel state information (CSI) and the battery state information (BSI) of wireless devices. For practical implementation, the proposed scheme is realized by a novel limited CSI estimation mechanism embedded with partial BSI, which significantly reduces the energy cost of CSI and BSI feedback. Simulation results show that the proposed method could significantly increase the network lifetime under stringent transmit power constraint. Reciprocally, it also consumes lower transmit power to achieve near-perpetual network operation than other single-criterion based charging control methods.

preprint2015arXiv

Wireless Powered Communication Networks: An Overview

Wireless powered communication network (WPCN) is a new networking paradigm where the battery of wireless communication devices can be remotely replenished by means of microwave wireless power transfer (WPT) technology. WPCN eliminates the need of frequent manual battery replacement/recharging, and thus significantly improves the performance over conventional battery-powered communication networks in many aspects, such as higher throughput, longer device lifetime, and lower network operating cost. However, the design and future application of WPCN is essentially challenged by the low WPT efficiency over long distance and the complex nature of joint wireless information and power transfer within the same network. In this article, we provide an overview of the key networking structures and performance enhancing techniques to build an efficient WPCN. Besides, we point out new and challenging future research directions for WPCN.

preprint2015arXiv

Wireless Powered Cooperative Jamming for Secrecy Multi-AF Relaying Networks

This paper studies secrecy transmission with the aid of a group of wireless energy harvesting (WEH)-enabled amplify-and-forward (AF) relays performing cooperative jamming (CJ) and relaying. The source node in the network does simultaneous wireless information and power transfer (SWIPT) with each relay employing a power splitting (PS) receiver in the first phase; each relay further divides its harvested power for forwarding the received signal and generating artificial noise (AN) for jamming the eavesdroppers in the second transmission phase. In the centralized case with global channel state information (CSI), we provide closed-form expressions for the optimal and/or suboptimal AF-relay beamforming vectors to maximize the achievable secrecy rate subject to individual power constraints of the relays, using the technique of semidefinite relaxation (SDR), which is proved to be tight. A fully distributed algorithm utilizing only local CSI at each relay is also proposed as a performance benchmark. Simulation results validate the effectiveness of the proposed multi-AF relaying with CJ over other suboptimal designs.

preprint2015arXiv

Your Actions Tell Where You Are: Uncovering Twitter Users in a Metropolitan Area

Twitter is an extremely popular social networking platform. Most Twitter users do not disclose their locations due to privacy concerns. Although inferring the location of an individual Twitter user has been extensively studied, it is still missing to effectively find the majority of the users in a specific geographical area without scanning the whole Twittersphere, and obtaining these users will result in both positive and negative significance. In this paper, we propose LocInfer, a novel and lightweight system to tackle this problem. LocInfer explores the fact that user communications in Twitter exhibit strong geographic locality, which we validate through large-scale datasets. Based on the experiments from four representative metropolitan areas in U.S., LocInfer can discover on average 86.6% of the users with 73.2% accuracy in each area by only checking a small set of candidate users. We also present a countermeasure to the users highly sensitive to location privacy and show its efficacy by simulations.

preprint2014arXiv

A Novel Mode Switching Scheme Utilizing Random Beamforming for Opportunistic Energy Harvesting

Since radio signals carry both energy and information at the same time, a unified study on simultaneous wireless information and power transfer (SWIPT) has recently drawn a significant attention for achieving wireless powered communication networks. In this paper, we study a multiple-input single-output (MISO) multicast SWIPT network with one multi-antenna transmitter sending common information to multiple single-antenna receivers simultaneously along with opportunistic wireless energy harvesting at each receiver. From the practical consideration, we assume that the channel state information (CSI) is only known at each respective receiver but is unavailable at the transmitter. We propose a novel receiver mode switching scheme for SWIPT based on a new application of the conventional random beamforming technique at the multi-antenna transmitter, which generates artificial channel fading to enable more efficient energy harvesting at each receiver when the received power exceeds a certain threshold. For the proposed scheme, we investigate the achievable information rate, harvested average power and/or power outage probability, as well as their various trade-offs in both AWGN and quasi-static fading channels. Compared to a reference scheme of periodic receiver mode switching without random transmit beamforming, the proposed scheme is shown to be able to achieve better rate-energy trade-offs when the harvested energy target is sufficiently large. Particularly, it is revealed that employing one single random beam for the proposed scheme is asymptotically optimal as the transmit power increases to infinity, and also performs the best with finite transmit power for the high harvested energy regime of most practical interests, thus leading to an appealing low-complexity implementation. Finally, we compare the rate-energy performances of the proposed scheme with different random beam designs.

preprint2014arXiv

Central Limit Theorems for Supercritical Branching Nonsymmetric Markov Processes

In this paper, we establish a spatial central limit theorem for a large class of supercritical branching, not necessarily symmetric, Markov processes with spatially dependent branching mechanisms satisfying a second moment condition. This central limit theorem generalizes and unifies all the central limit theorems obtained recently in \cite{RSZ2} for supercritical branching symmetric Markov processes. To prove our central limit theorem, we have to carefully develop the spectral theory of nonsymmetric strongly continuous semigroups which should be of independent interest.

preprint2014arXiv

Central Limit Theorems for Supercritical Superprocesses

In this paper, we establish a central limit theorem for a large class of general supercritical superprocesses with spatially dependent branching mechanisms satisfying a second moment condition. This central limit theorem generalizes and unifies all the central limit theorems obtained recently in Miłoś (2012, arXiv:1203:6661) and Ren, Song and Zhang (2013, to appear in Acta Appl. Math., DOI 10.1007/s10440-013-9837-0) for supercritical super Ornstein-Uhlenbeck processes. The advantage of this central limit theorem is that it allows us to characterize the limit Gaussian field. In the case of supercritical super Ornstein-Uhlenbeck processes with non-spatially dependent branching mechanisms, our central limit theorem reveals more independent structures of the limit Gaussian field.

preprint2014arXiv

Collaborative Wireless Energy and Information Transfer in Interference Channel

This paper studies the simultaneous wireless information and power transfer (SWIPT) in a multiuser wireless system, in which distributed transmitters send independent messages to their respective receivers, and at the same time cooperatively transmit wireless power to the receivers via energy beamforming. Accordingly, from the wireless information transmission (WIT) perspective, the system of interest can be modeled as the classic interference channel, while it also can be regarded as a distributed multiple-input multiple-output (MIMO) system for collaborative wireless energy transmission (WET). To enable both information decoding (ID) and energy harvesting (EH) in SWIPT, we adopt the low-complexity time switching operation at each receiver to switch between the ID and EH modes over scheduled time. Based on this hybrid model, we aim to characterize the achievable rate-energy (R-E) trade-offs in the multiuser SWIPT system under various transmitter-side collaboration schemes. Specifically, to facilitate the collaborative energy beamforming, we propose a new signal splitting scheme at the transmitters, where each transmit signal is generally composed of an information signal component and an energy signal component for WIT and WET, respectively. With this new scheme, first, we study the two-user SWIPT system and derive the optimal mode switching rule at the receivers and the corresponding transmit signal optimization to achieve various R-E trade-offs over the fading channel. We also compare the R-E performance of our proposed scheme with transmit energy beamforming and signal splitting against two existing schemes with partial or no cooperation of the transmitters, and show remarkable gains over these baseline schemes. Finally, the general case of SWIPT systems with more than two users is studied, for which we propose and compare two practical transmit collaboration schemes.

preprint2014arXiv

CoMP Meets Smart Grid: A New Communication and Energy Cooperation Paradigm

In this paper, we pursue a unified study on smart grid and coordinated multi-point (CoMP) enabled wireless communication by investigating a new joint communication and energy cooperation approach. We consider a practical CoMP system with clustered multiple-antenna base stations (BSs) cooperatively communicating with multiple single-antenna mobile terminals (MTs), where each BS is equipped with local renewable energy generators to supply power and also a smart meter to enable two-way energy flow with the grid. We propose a new energy cooperation paradigm, where a group of BSs dynamically share their renewable energy for more efficient operation via locally injecting/drawing power to/from an aggregator with a zero effective sum-energy exchanged. Under this new energy cooperation model, we consider the downlink transmission in one CoMP cluster with cooperative zero-forcing (ZF) based precoding at the BSs. We maximize the weighted sum-rate for all MTs by jointly optimizing the transmit power allocations at cooperative BSs and their exchanged energy amounts subject to a new type of power constraints featuring energy cooperation among BSs with practical loss ratios. Our new setup with BSs' energy cooperation generalizes the conventional CoMP transmit optimization under BSs' sum-power or individual-power constraints. Finally, we validate our results by simulations under various practical setups, and show that the proposed joint communication and energy cooperation scheme substantially improves the downlink throughput of CoMP systems powered by smart grid and renewable energy, as compared to other suboptimal designs without communication and/or energy cooperation.

preprint2014arXiv

Cost-Aware Green Cellular Networks with Energy and Communication Cooperation

Energy cost of cellular networks is ever-increasing to match the surge of wireless data traffic, and the saving of this cost is important to reduce the operational expenditure (OPEX) of wireless operators in future. The recent advancements of renewable energy integration and two-way energy flow in smart grid provide potential new solutions to save the cost. However, they also impose challenges, especially on how to use the stochastically and spatially distributed renewable energy harvested at cellular base stations (BSs) to reliably supply time- and space-varying wireless traffic over cellular networks. To overcome these challenges, in this article we present three approaches, namely, {\emph{energy cooperation, communication cooperation, and joint energy and communication cooperation}}, in which different BSs bidirectionally trade or share energy via the aggregator in smart grid, and/or share wireless resources and shift loads with each other to reduce the total energy cost.

preprint2014arXiv

Downlink and Uplink Energy Minimization Through User Association and Beamforming in Cloud RAN

The cloud radio access network (C-RAN) concept, in which densely deployed access points (APs) are empowered by cloud computing to cooperatively support mobile users (MUs), to improve mobile data rates, has been recently proposed. However, the high density of active ("on") APs results in severe interference and also inefficient energy consumption. Moreover, the growing popularity of highly interactive applications with stringent uplink (UL) requirements, e.g. network gaming and real-time broadcasting by wireless users, means that the UL transmission is becoming more crucial and requires special attention. Therefore in this paper, we propose a joint downlink (DL) and UL MU-AP association and beamforming design to coordinate interference in the C-RAN for energy minimization, a problem which is shown to be NP hard. Due to the new consideration of UL transmission, it is shown that the two state-of-the-art approaches for finding computationally efficient solutions of joint MU-AP association and beamforming considering only the DL, i.e., group-sparse optimization and relaxed-integer programming, cannot be modified in a straightforward way to solve our problem. Leveraging on the celebrated UL-DL duality result, we show that by establishing a virtual DL transmission for the original UL transmission, the joint DL and UL optimization problem can be converted to an equivalent DL problem in C-RAN with two inter-related subproblems for the original and virtual DL transmissions, respectively. Based on this transformation, two efficient algorithms for joint DL and UL MU-AP association and beamforming design are proposed, whose performances are evaluated and compared with other benchmarking schemes through extensive simulations.

preprint2014arXiv

Electromagnetic Lens-focusing Antenna Enabled Massive MIMO: Performance Improvement and Cost Reduction

Massive multiple-input multiple-output (MIMO) techniques have been recently advanced to tremendously improve the performance of wireless communication networks. However, the use of very large antenna arrays at the base stations (BSs) brings new issues, such as the significantly increased hardware and signal processing costs. In order to reap the enormous gain of massive MIMO and yet reduce its cost to an affordable level, this paper proposes a novel system design by integrating an electromagnetic (EM) lens with the large antenna array, termed the EM-lens enabled MIMO. The EM lens has the capability of focusing the power of an incident wave to a small area of the antenna array, while the location of the focal area varies with the angle of arrival (AoA) of the wave. Therefore, in practical scenarios where the arriving signals from geographically separated users have different AoAs, the EM-lens enabled system provides two new benefits, namely energy focusing and spatial interference rejection. By taking into account the effects of imperfect channel estimation via pilot-assisted training, in this paper we analytically show that the average received signal-to-noise ratio (SNR) in both the single-user and multiuser uplink transmissions can be strictly improved by the EM-lens enabled system. Furthermore, we demonstrate that the proposed design makes it possible to considerably reduce the hardware and signal processing costs with only slight degradations in performance. To this end, two complexity/cost reduction schemes are proposed, which are small-MIMO processing with parallel receiver filtering applied over subgroups of antennas to reduce the computational complexity, and channel covariance based antenna selection to reduce the required number of radio frequency (RF) chains. Numerical results are provided to corroborate our analysis.

preprint2014arXiv

Energy Beamforming with One-Bit Feedback

Wireless energy transfer (WET) has attracted significant attention recently for providing energy supplies wirelessly to electrical devices without the need of wires or cables. Among different types of WET techniques, the radio frequency (RF) signal enabled far-field WET is most practically appealing to power energy constrained wireless networks in a broadcast manner. To overcome the significant path loss over wireless channels, multi-antenna or multiple-input multiple-output (MIMO) techniques have been proposed to enhance the transmission efficiency and distance for RF-based WET. However, in order to reap the large energy beamforming gain in MIMO WET, acquiring the channel state information (CSI) at the energy transmitter (ET) is an essential task. This task is particularly challenging for WET systems, since existing channel training and feedback methods used for communication receivers may not be implementable at the energy receiver (ER) due to its hardware limitation. To tackle this problem, in this paper we consider a multiuser MIMO system for WET, where a multiple-antenna ET broadcasts wireless energy to a group of multiple-antenna ERs concurrently via transmit energy beamforming. By taking into account the practical energy harvesting circuits at the ER, we propose a new channel learning method that requires only one feedback bit from each ER to the ET per feedback interval. The feedback bit indicates the increase or decrease of the harvested energy by each ER between the present and previous intervals, which can be measured without changing the existing hardware at the ER. Based on such feedback information, the ET adjusts transmit beamforming in different training intervals and at the same time obtains improved estimates of the MIMO channels to ERs by applying a new approach termed analytic center cutting plane method (ACCPM).

preprint2014arXiv

Full-Duplex Wireless-Powered Relay with Self-Energy Recycling

This letter studies a wireless-powered amplify-and-forward relaying system, where an energy-constrained relay node assists the information transmission from the source to the destination using the energy harvested from the source. We propose a novel two-phase protocol for efficient energy transfer and information relaying, in which the relay operates in full-duplex mode with simultaneous energy harvesting and information transmission. Compared with the existing protocols, the proposed design possesses two main advantages: i) it ensures uninterrupted information transmission since no time switching or power splitting is needed at the relay for energy harvesting; ii) it enables the so-called self-energy recycling, i.e., part of the energy (loop energy) that is used for information transmission by the relay can be harvested and reused in addition to the dedicated energy sent by the source. Under the multiple-input single-output (MISO) channel setup, the optimal power allocation and beamforming design at the relay are derived. Numerical results show a significant throughput gain achieved by our proposed design over the existing time switching-based relay protocol.

preprint2014arXiv

Functional central limit theorems for supercritical superprocesses

In this paper, we establish some functional central limit theorems for a large class of general supercritical superprocesses with spatially dependent branching mechanisms satisfying a second moment condition. In the particular case when the state $E$ is a finite set and the underline motion is an irreducible Markov chain on $E$, our results are superprocess analogs of the functional central limit theorems of \cite{Janson} for supercritical multitype branching processes. The results of this paper are refinements of the central limit theorems in \cite{RSZ3}.

preprint2014arXiv

Improper Signaling for Symbol Error Rate Minimization in K-User Interference Channel

The rate maximization for the $K$-user interference channels (ICs) has been investigated extensively in the literature. However, the dual problem of minimizing the error probability with given signal modulations and/or data rates of the users is less exploited. In this paper, by utilizing the additional degrees of freedom attained from the improper signaling (versus the conventional proper signaling), we optimize the precoding matrices for the $K$-user single-input single-output (SISO) ICs to achieve minimal pair-wise error probability (PEP) and symbol error rate (SER) with two proposed algorithms, respectively. Compared to conventional proper signaling as well as other state-of-the-art improper signaling designs, our proposed improper signaling schemes achieve notable SER improvement in SISO-ICs under both additive white Gaussian noise (AWGN) channel and cellular system setups. Our study provides another viewpoint for optimizing transmissions in ICs and further justifies the practical benefit of improper signaling in interference-limited communication systems.

preprint2014arXiv

Joint Energy and Spectrum Cooperation for Cellular Communication Systems

Powered by renewable energy sources, cellular communication systems usually have different wireless traffic loads and available resources over time. To match their traffics, it is beneficial for two neighboring systems to cooperate in resource sharing when one is excessive in one resource (e.g., spectrum), while the other is sufficient in another (e.g., energy). In this paper, we propose a joint energy and spectrum cooperation scheme between different cellular systems to reduce their operational costs. When the two systems are fully cooperative in nature (e.g., belonging to the same entity), we formulate the cooperation problem as a convex optimization problem to minimize their weighted sum cost and obtain the optimal solution in closed form. We also study another partially cooperative scenario where the two systems have their own interests. We show that the two systems seek for partial cooperation as long as they find inter-system complementarity between the energy and spectrum resources. Under the partial cooperation conditions, we propose a distributed algorithm for the two systems to gradually and simultaneously reduce their costs from the non-cooperative benchmark to the Pareto optimum. This distributed algorithm also has proportional fair cost reduction by reducing each system's cost proportionally over iterations. Finally, we provide numerical results to validate the convergence of the distributed algorithm to the Pareto optimality and compare the centralized and distributed cost reduction approaches for fully and partially cooperative scenarios.

preprint2014arXiv

Joint Transmitter and Receiver Energy Minimization in Multiuser OFDM Systems

In this paper, we formulate and solve a weighted-sum transmitter and receiver energy minimization (WSTREMin) problem in the downlink of an orthogonal frequency division multiplexing (OFDM) based multiuser wireless system. The proposed approach offers the flexibility of assigning different levels of importance to base station (BS) and mobile terminal (MT) power consumption, corresponding to the BS being connected to the grid and the MT relying on batteries. To obtain insights into the characteristics of the problem, we first consider two extreme cases separately, i.e., weighted-sum receiver-side energy minimization (WSREMin) for MTs and transmitter-side energy minimization (TEMin) for the BS. It is shown that Dynamic TDMA (D-TDMA), where MTs are scheduled for single-user OFDM transmissions over orthogonal time slots, is the optimal transmission strategy for WSREMin at MTs, while OFDMA is optimal for TEMin at the BS. As a hybrid of the two extreme cases, we further propose a new multiple access scheme, i.e., Time-Slotted OFDMA (TS-OFDMA) scheme, in which MTs are grouped into orthogonal time slots with OFDMA applied to users assigned within the same slot. TS-OFDMA can be shown to include both D-TDMA and OFDMA as special cases. Numerical results confirm that the proposed schemes enable a flexible range of energy consumption tradeoffs between the BS and MTs.

preprint2014arXiv

Marginalizable conditional model for clustered ordinal data

We introduce a flexible parametric mixed effects model for correlated binary data, with parameters that can be directly interpreted as marginal odds ratios. This leads to a robust estimation equation with an optimal weighting matrix being the inverse of a genuine model-based covariance matrix. Flexible correlation structures can be imposed by correlated random effects, and correlation parameters can be estimated by solving a composite likelihood score function. Marginal parameters are consistently estimated even when the conditional parametric model is misspecified, and the robust estimation procedure has low estimation efficiency loss compared to the maximum likelihood estimation under a correct model specification. Simulations, analyses of the Madras longitudinal schizophrenia study and British social attributes panel survey were carried out to demonstrate our method.

preprint2014arXiv

Measurements of the superconducting fluctuations in optimally-doped BaFe$_{2-x}$Ni$_x$As$_2$ under high magnetic fields: Probing the 3D anisotropic Ginzburg-Landau approach

The superconducting fluctuations well inside the normal state of Fe-based superconductors were experimentally studied through the in-plane paraconductivity in several high-quality optimally-doped BaFe$_{2-x}$Ni$_x$As$_2$ crystals. These measurements were performed in magnetic fields with amplitudes up to 14 T, and different orientations relative to the crystals c axis (0, 53 and 90 degrees). The results allowed a stringent check of the applicability of a recently proposed Ginzburg-Landau approach for the fluctuation electrical conductivity of 3D anisotropic materials in presence of finite applied magnetic fields.

preprint2014arXiv

Multi-Antenna Wireless Powered Communication with Energy Beamforming

The newly emerging wireless powered communication networks (WPCNs) have recently drawn significant attention, where radio signals are used to power wireless terminals for information transmission. In this paper, we study a WPCN where one multi-antenna access point (AP) coordinates energy transfer and information transfer to/from a set of single-antenna users. A harvest-then-transmit protocol is assumed where the AP first broadcasts wireless power to all users via energy beamforming in the downlink (DL), and then the users send their independent information to the AP simultaneously in the uplink (UL) using their harvested energy. To optimize the users' throughput and yet guarantee their rate fairness, we maximize the minimum throughput among all users by a joint design of the DL-UL time allocation, the DL energy beamforming, and the UL transmit power allocation plus receive beamforming. We solve this non-convex problem optimally by two steps. First, we fix the DL-UL time allocation and obtain the optimal DL energy beamforming, UL power allocation and receive beamforming to maximize the minimum signal-to-interference-plus-noise ratio (SINR) of all users. This problem is shown to be in general non-convex; however, we convert it equivalently to a spectral radius minimization problem, which can be solved efficiently by applying the alternating optimization based on the non-negative matrix theory. Then, the optimal time allocation is found by a one-dimension search to maximize the minimum rate of all users. Furthermore, two suboptimal designs of lower complexity are proposed, and their throughput performance is compared against that of the optimal solution.

preprint2014arXiv

Multiple Hybrid Phase Transition: Bootstrap Percolation on Complex Networks with Communities

Bootstrap percolation is a well-known model to study the spreading of rumors, new products or innovations on social networks. The empirical studies show that community structure is ubiquitous among various social networks. Thus, studying the bootstrap percolation on the complex networks with communities can bring us new and important insights of the spreading dynamics on social networks. It attracts a lot of scientists' attentions recently. In this letter, we study the bootstrap percolation on Erdős-Rényi networks with communities and observed second order, hybrid (both second and first order) and multiple hybrid phase transitions, which is rare in natural system. Moreover, we have analytically solved this system and obtained the phase diagram, which is further justified well by the corresponding simulations.

preprint2014arXiv

Multiuser MISO Beamforming for Simultaneous Wireless Information and Power Transfer

Simultaneous wireless information and power transfer (SWIPT) is anticipated to have abundant applications in future machine or sensor based wireless networks by providing wireless data and energy access at the same time. In this paper, we study a multiuser multiple-input single-output (MISO) broadcast SWIPT system, where a multi-antenna access point (AP) sends information and energy simultaneously via spatial multiplexing to multiple single-antenna receivers each of which implements information decoding (ID) or energy harvesting (EH). Since EH receivers in practice operate with considerably higher received power than ID receivers, we propose a receiver location based transmission scheduling, where receivers that are close to the AP are scheduled for EH while those more distant from the AP for ID. We aim to maximize the weighted sum-power transferred to all EH receivers subject to a given set of minimum signal-to-interference-and-noise ratio (SINR) constraints at different ID receivers. In particular, we consider two types of ID receivers (referred to as Type I and Type II, respectively) without or with the capability of cancelling the interference from (a priori known) energy signals. For each type of ID receivers, we formulate the joint information and energy transmit beamforming design as a non-convex quadratically constrained quadratic program (QCQP). First, we obtain the globally optimal solutions for our formulated QCQPs by applying an optimization technique so-called semidefinite relaxation (SDR). It is shown via SDR that no dedicated energy beam is needed for Type I ID receivers to achieve the optimal solution; while for Type II ID receivers, employing no more than one energy beam is optimal. Next, we establish a new form of the celebrated uplink-downlink duality to develop alternative algorithms to obtain the same optimal solutions as SDR.

preprint2014arXiv

Nematic spin correlations in the tetragonal state of uniaxial strained BaFe2-xNixAs2

Understanding the microscopic origins of electronic phases in high-transition temperature (high-Tc) superconductors is important for elucidating the mechanism of superconductivity. In the paramagnetic tetragonal phase of BaFe2-xTxAs2 (where T is Co or Ni) iron pnictides, an in-plane resistivity anisotropy has been observed. Here we use inelastic neutron scattering to show that low-energy spin excitations in these materials change from four-fold symmetric to two-fold symmetric at temperatures corresponding to the onset of the in-plane resistivity anisotropy. Because resistivity and spin excitation anisotropies both vanish near optimal superconductivity, we conclude that they are likely intimately connected.

preprint2014arXiv

On Spatial Capacity of Wireless Ad Hoc Networks with Threshold Based Scheduling

This paper studies spatial capacity in a stochastic wireless ad hoc network, where multi-stage probing and data transmission are sequentially performed. We propose a novel signal-to-interference-ratio (SIR) threshold based scheduling scheme, where by starting with the first probing, each transmitter iteratively decides to further probe or stay idle, depending on whether the estimated SIR in the proceeding probing is larger or smaller than a predefined threshold. Although one can assume that the transmitters are initially deployed according to a homogeneous Poisson point process (PPP), the SIR based scheduling makes the PPP no longer applicable to model the locations of retained transmitters in the subsequent probing and data transmission phases, due to the interference induced coupling in their decisions. We first focus on single-stage probing and find that when the SIR threshold is set sufficiently small to assure an acceptable interference level in the network, the proposed scheme can greatly outperform the non-scheduling reference scheme in terms of spatial capacity. We clearly characterize the spatial capacity and obtain exact/approximate closed-form expressions, by proposing a new approximate approach to deal with the correlated SIR distributions over non-Poisson point processes. Then we successfully extend to multi-stage probing by properly designing the multiple SIR thresholds to assure gradual improvement of the spatial capacity. Furthermore, we analyze the impact of multi-stage probing overhead and present a probing-capacity tradeoff in scheduling design. Finally, extensive numerical results are presented to demonstrate the performance of the proposed scheduling as compared to existing schemes.

preprint2014arXiv

Optimal Resource Allocation in Full-Duplex Wireless-Powered Communication Network

This paper studies optimal resource allocation in the wireless-powered communication network (WPCN), where one hybrid access-point (H-AP) operating in full-duplex (FD) broadcasts wireless energy to a set of distributed users in the downlink (DL) and at the same time receives independent information from the users via time-division-multiple-access (TDMA) in the uplink (UL). We design an efficient protocol to support simultaneous wireless energy transfer (WET) in the DL and wireless information transmission (WIT) in the UL for the proposed FD-WPCN. We jointly optimize the time allocations to the H-AP for DL WET and different users for UL WIT as well as the transmit power allocations over time at the H-AP to maximize the users' weighted sum-rate of UL information transmission with harvested energy. We consider both the cases with perfect and imperfect self-interference cancellation (SIC) at the H-AP, for which we obtain optimal and suboptimal time and power allocation solutions, respectively. Furthermore, we consider the half-duplex (HD) WPCN as a baseline scheme and derive its optimal resource allocation solution. Simulation results show that the FD-WPCN outperforms HD-WPCN when effective SIC can be implemented and more stringent peak power constraint is applied at the H-AP.

preprint2014arXiv

Optimized Training Design for Multi-Antenna Wireless Energy Transfer in Frequency-Selective Channel

This paper studies the optimal training design for a multiple-input single-output (MISO) wireless energy transfer (WET) system in frequency-selective channels, where the frequency-diversity and energy-beamforming gains can be both achieved by properly learning the channel state information (CSI) at the energy transmitter (ET). By exploiting channel reciprocity, a two-phase channel training scheme is proposed to achieve the diversity and beamforming gains, respectively. In the first phase, pilot signals are sent from the energy receiver (ER) over a selected subset of the available frequency sub-bands, through which the sub-band that exhibits the largest sum-power over all the antennas at the ET is determined and its index is sent back to the ER. In the second phase, the selected sub-band is further trained for the ET to estimate the multi-antenna channel and implement energy beamforming. We propose to maximize the net energy harvested at the ER, which is the total harvested energy offset by that used for the two-phase channel training. The optimal training design, including the number of sub-bands trained and the energy allocated for each of the two phases, is derived.

preprint2014arXiv

Optimized Training Design for Wireless Energy Transfer

Radio-frequency (RF) enabled wireless energy transfer (WET), as a promising solution to provide cost-effective and reliable power supplies for energy-constrained wireless networks, has drawn growing interests recently. To overcome the significant propagation loss over distance, employing multi-antennas at the energy transmitter (ET) to more efficiently direct wireless energy to desired energy receivers (ERs), termed \emph{energy beamforming}, is an essential technique for enabling WET. However, the achievable gain of energy beamforming crucially depends on the available channel state information (CSI) at the ET, which needs to be acquired practically. In this paper, we study the design of an efficient channel acquisition method for a point-to-point multiple-input multiple-output (MIMO) WET system by exploiting the channel reciprocity, i.e., the ET estimates the CSI via dedicated reverse-link training from the ER. Considering the limited energy availability at the ER, the training strategy should be carefully designed so that the channel can be estimated with sufficient accuracy, and yet without consuming excessive energy at the ER. To this end, we propose to maximize the \emph{net} harvested energy at the ER, which is the average harvested energy offset by that used for channel training. An optimization problem is formulated for the training design over MIMO Rician fading channels, including the subset of ER antennas to be trained, as well as the training time and power allocated. Closed-form solutions are obtained for some special scenarios, based on which useful insights are drawn on when training should be employed to improve the net transferred energy in MIMO WET systems.

preprint2014arXiv

Recent Advances in Joint Wireless Energy and Information Transfer

In this paper, we provide an overview of the recent advances in microwave-enabled wireless energy transfer (WET) technologies and their applications in wireless communications. Specifically, we divide our discussions into three parts. First, we introduce the state-of-the-art WET technologies and the signal processing techniques to maximize the energy transfer efficiency. Then, we discuss an interesting paradigm named simultaneous wireless information and power transfer (SWIPT), where energy and information are jointly transmitted using the same radio waveform. At last, we review the recent progress in wireless powered communication networks (WPCN), where wireless devices communicate using the power harvested by means of WET. Extensions and future directions are also discussed in each of these areas.

preprint2014arXiv

Short-range cluster spin glass near optimal superconductivity in BaFe$_{2-x}$Ni$_{x}$As$_{2}$

High-temperature superconductivity in iron pnictides occurs when electrons are doped into their antiferromagnetic (AF) parent compounds. In addition to inducing superconductivity, electron-doping also changes the static commensurate AF order in the undoped parent compounds into short-range incommensurate AF order near optimal superconductivity. Here we use neutron scattering to demonstrate that the incommensurate AF order in BaFe$_{2-x}$Ni$_{x}$As$_{2}$ is not a spin-density-wave arising from the itinerant electrons in nested Fermi surfaces, but consistent with a cluster spin glass in the matrix of the superconducting phase. Therefore, optimal superconductivity in iron pnictides coexists and competes with a mesoscopically separated cluster spin glass phase, much different from the homogeneous coexisting AF and superconducting phases in the underdoped regime.

preprint2014arXiv

Spatial Throughput Characterization in Cognitive Radio Networks with Threshold-Based Opportunistic Spectrum Access

This paper studies the opportunistic spectrum access (OSA) of the secondary users in a large-scale overlay cognitive radio (CR) network. Two threshold-based OSA schemes, namely the primary receiver assisted (PRA) protocol and the primary transmitter assisted (PTA) protocol, are investigated. Under the PRA/PTA protocol, a secondary transmitter (ST) is allowed to access the spectrum only when the maximum signal power of the received beacons/pilots sent from the active primary receivers/transmitters (PRs/PTs) is lower than a certain threshold. To measure the resulting transmission opportunity for the secondary users by the proposed OSA protocols, the concept of spatial opportunity, which is defined as the probability that an arbitrary location in the primary network is detected as a spatial spectrum hole, is introduced and then evaluated by applying tools from stochastic geometry. Based on spatial opportunity, the coverage (non-outage transmission) performance in the overlay CR network is analyzed. With the obtained results of spatial opportunity and coverage probability, we finally characterize the spatial throughput, which is defined as the average spatial density of successful transmissions in the primary/secondary network, under the PRA and PTA protocols, respectively.

preprint2014arXiv

The effect of Cr impurity to superconductivity in electron-doped BaFe2-xNixAs2

We use transport and magnetization measurements to study the effect of Cr-doping to the phase diagram of the electron-doped superconducting BaFe2-xNixAs2 iron pnictides. In principle, adding Cr to electron-doped BaFe2-xNixAs2 should be equivalent to the effect of hole-doping. However, we find that Cr doping suppresses superconductivity via impurity effect, while not affecting the normal state resistivity above 100 K. We establish the phase diagram of Cr-doped BaFe2-x-yNixCryAs2 iron pnictides, and demonstrate that Cr-doping near optimal superconductivity restore the long-range antiferromagnetic order suppressed by superconductivity.

preprint2014arXiv

Throughput Maximization in Wireless Powered Communication Networks

This paper studies the newly emerging wireless powered communication network (WPCN) in which one hybrid access point (H-AP) with constant power supply coordinates the wireless energy/information transmissions to/from distributed users that do not have energy sources. A "harvest-then-transmit" protocol is proposed where all users first harvest the wireless energy broadcast by the H-AP in the downlink (DL) and then send their independent information to the H-AP in the uplink (UL) by time-division-multiple-access (TDMA). First, we study the sum-throughput maximization of all users by jointly optimizing the time allocation for the DL wireless power transfer versus the users' UL information transmissions given a total time constraint based on the users' DL and UL channels as well as their average harvested energy values. By applying convex optimization techniques, we obtain the closed-form expressions for the optimal time allocations to maximize the sum-throughput. Our solution reveals "doubly near-far" phenomenon due to both the DL and UL distance-dependent signal attenuation, where a far user from the H-AP, which receives less wireless energy than a nearer user in the DL, has to transmit with more power in the UL for reliable information transmission. Consequently, the maximum sum-throughput is achieved by allocating substantially more time to the near users than the far users, thus resulting in unfair rate allocation among different users. To overcome this problem, we furthermore propose a new performance metric so-called common-throughput with the additional constraint that all users should be allocated with an equal rate regardless of their distances to the H-AP. We present an efficient algorithm to solve the common-throughput maximization problem. Simulation results demonstrate the effectiveness of the common-throughput approach for solving the new doubly near-far problem in WPCNs.

preprint2014arXiv

TouchIn: Sightless Two-factor Authentication on Multi-touch Mobile Devices

Mobile authentication is indispensable for preventing unauthorized access to multi-touch mobile devices. Existing mobile authentication techniques are often cumbersome to use and also vulnerable to shoulder-surfing and smudge attacks. This paper focuses on designing, implementing, and evaluating TouchIn, a two-factor authentication system on multi-touch mobile devices. TouchIn works by letting a user draw on the touchscreen with one or multiple fingers to unlock his mobile device, and the user is authenticated based on the geometric properties of his drawn curves as well as his behavioral and physiological characteristics. TouchIn allows the user to draw on arbitrary regions on the touchscreen without looking at it. This nice sightless feature makes TouchIn very easy to use and also robust to shoulder-surfing and smudge attacks. Comprehensive experiments on Android devices confirm the high security and usability of TouchIn.

preprint2014arXiv

User Cooperation in Wireless Powered Communication Networks

This paper studies user cooperation in the emerging wireless powered communication network (WPCN) for throughput optimization. For the purpose of exposition, we consider a two-user WPCN, in which one hybrid access point (H-AP) broadcasts wireless energy to two distributed users in the downlink (DL) and the users transmit their independent information using their individually harvested energy to the H-AP in the uplink (UL) through time-division-multiple-access (TDMA). We propose user cooperation in the WPCN where the user which is nearer to the H-AP and has a better channel for DL energy harvesting and UL information transmission uses part of its allocated UL time and DL harvested energy to help to relay the far user's information to the H-AP, in order to achieve more balanced throughput optimization. We maximize the weighted sum-rate (WSR) of the two users by jointly optimizing the time and power allocations in the network for both wireless energy transfer in the DL and wireless information transmission and relaying in the UL. Simulation results show that the proposed user cooperation scheme can effectively improve the achievable throughput in the WPCN with desired user fairness.

preprint2014arXiv

Wireless Information and Power Transfer in Multiuser OFDM Systems

In this paper, we study the optimal design for simultaneous wireless information and power transfer (SWIPT) in downlink multiuser orthogonal frequency division multiplexing (OFDM) systems. For information transmission, we consider two types of multiple access schemes, namely, time division multiple access (TDMA) and orthogonal frequency division multiple access (OFDMA). At the receiver side, due to the practical limitation that circuits for harvesting energy from radio signals are not yet able to decode the carried information directly, each user applies either time switching (TS) or power splitting (PS) to coordinate the energy harvesting (EH) and information decoding (ID) processes. For the TDMA-based information transmission, we employ TS at the receivers; for the OFDMA-based information transmission, we employ PS at the receivers. Under the above two scenarios, we address the problem of maximizing the weighted sum-rate over all users by varying the time/frequency power allocation and either TS or PS ratio, subject to a minimum harvested energy constraint on each user as well as a peak and/or total transmission power constraint. For the TS scheme, by an appropriate variable transformation the problem is reformulated as a convex problem, for which the optimal power allocation and TS ratio are obtained by the Lagrange duality method. For the PS scheme, we propose an iterative algorithm to optimize the power allocation, subcarrier (SC) allocation and the PS ratio for each user. The performances of the two schemes are compared numerically as well as analytically for the special case of single-user setup. It is revealed that the peak power constraint imposed on each OFDM SC as well as the number of users in the system play a key role in the rate-energy performance comparison by the two proposed schemes.

preprint2014arXiv

Wireless Powered Communication: Opportunities and Challenges

The performance of wireless communication is fundamentally constrained by the limited battery life of wireless devices, whose operations are frequently disrupted due to the need of manual battery replacement/recharging. The recent advance in radio frequency (RF) enabled wireless energy transfer (WET) technology provides an attractive solution named wireless powered communication (WPC), where the wireless devices are powered by dedicated wireless power transmitters to provide continuous and stable microwave energy over the air. As a key enabling technology for truly perpetual communications, WPC opens up the potential to build a network with larger throughput, higher robustness, and increased flexibility compared to its battery-powered counterpart. However, the combination of wireless energy and information transmissions also raises many new research problems and implementation issues to be addressed. In this article, we provide an overview of state-of-the-art RF-enabled WET technologies and their applications to wireless communications, with highlights on the key design challenges, solutions, and opportunities ahead.

preprint2013arXiv

Avoided quantum criticality and magnetoelastic coupling in BaFe$_{2-x}$Ni$_{x}$As$_{2}$

We study the structural and magnetic orders in electron-doped BaFe2-xNixAs2 by high-resolution synchrotron X-ray and neutron scatterings. Upon Ni-doping x, the nearly simultaneous tetragonal-to-orthorhombic structural T_s and antiferromagnetic (T_N) phase transitions in BaFe2As2 are gradually suppressed and separated, resulting in T_s>T_N with increasing x as was previously observed. However, the temperature separation between T_s and T_N decreases with increasing x for x> 0.065$, tending towards a quantum bi-critical point near optimal superconductivity at x=0.1. The zero-temperature transition is preempted by the formation of a secondary incommensurate magnetic phase in the region 0.088< x < 0.104, resulting in a finite value of T_N \approx T_c+10$ K above the superconducting dome around $x\approx 0.1$. Our results imply an avoided quantum critical point, which is expected to strongly influence the properties of both the normal and superconducting states.

preprint2013arXiv

Central Limit Theorems for Super-OU Processes

In this paper we study supercritical super-OU processes with general branching mechanisms satisfying a second moment condition. We establish central limit theorems for the super-OU processes. In the small and crtical branching rate cases, our central limit theorems sharpen the corresponding results in the recent preprint of Milos in that the limit normal random variables in our central limit theorems are non-degenerate. Our central limit theorems in the large branching rate case are completely new. The main tool of the paper is the so called "backbone decomposition" of superprocesses.

preprint2013arXiv

Effect of Receive Spatial Diversity on the Degrees of Freedom Region in Multi-Cell Random Beamforming

The random beamforming (RBF) scheme, jointly applied with multi-user diversity based scheduling, is able to achieve virtually interference-free downlink transmissions with only partial channel state information (CSI) available at the transmitter. However, the impact of receive spatial diversity on the rate performance of RBF is not fully characterized yet even in a single-cell setup. In this paper, we study a multi-cell multiple-input multiple-output (MIMO) broadcast system with RBF applied at each base station (BS) and either the minimum-mean-square-error (MMSE), matched filter (MF), or antenna selection (AS) based spatial receiver employed at each mobile terminal. We investigate the effect of different spatial diversity receivers on the achievable sum-rate of multi-cell RBF systems subject to both the intra- and inter-cell interferences. We first derive closed-form expressions for the distributions of the receiver signal-to-interference-plus-noise ratio (SINR) with different spatial diversity techniques, based on which we compare their rate performances at finite signal-to-noise ratios (SNRs). We then investigate the asymptotically high-SNR regime and for a tractable analysis assume that the number of users in each cell scales in a certain order with the per-cell SNR as SNR goes to infinity. Under this setup, we characterize the degrees of freedom (DoF) region for multi-cell RBF systems with different types of spatial receivers, which consists of all the achievable DoF tuples for the individual sum-rate of all the cells. The DoF region analysis provides a succinct characterization of the interplays among the receive spatial diversity, multiuser diversity, spatial multiplexing gain, inter-/intra-cell interferences, and BSs' collaborative transmission.

preprint2013arXiv

Electromagnetic Lens-focusing Antenna Enabled Massive MIMO

Massive multiple-input multiple-output (MIMO) techniques have been recently advanced to tremendously improve the performance of wireless networks. However, the use of very large antenna arrays brings new issues, such as the significantly increased hardware cost and signal processing cost and complexity. In order to reap the enormous gain of massive MIMO and yet reduce its cost to an affordable level, this paper proposes a novel system design by integrating an electromagnetic (EM) lens with the large antenna array, termed \emph{electromagnetic lens antenna} (ELA). An ELA has the capability of focusing the power of any incident plane wave passing through the EM lens to a small subset of the antenna array, while the location of focal area is dependent on the angle of arrival (AoA) of the wave. As compared to conventional antenna arrays without the EM lens, the proposed system can substantially reduce the number of required radio frequency (RF) chains at the receiver and hence, the implementation costs. In this paper, we investigate the proposed system under a simplified single-user uplink transmission setup, by characterizing the power distribution of the ELA as well as the resulting channel model. Furthermore, by assuming antenna selection used at the receiver, we show the throughput gains of the proposed system over conventional antenna arrays given the same number of selected antennas.

preprint2013arXiv

Electron doping evolution of the magnetic excitations in BaFe2-xNixAs2

We use inelastic neutron scattering (INS) spectroscopy to study the magnetic excitations spectra throughout the Brioullion zone in electron-doped iron pnictide superconductors BaFe$_{2-x}$Ni$_{x}$As$_{2}$ with $x=0.096,0.15,0.18$. While the $x=0.096$ sample is near optimal superconductivity with $T_c=20$ K and has coexisting static incommensurate magnetic order, the $x=0.15,0.18$ samples are electron-overdoped with reduced $T_c$ of 14 K and 8 K, respectively, and have no static antiferromagnetic (AF) order. In previous INS work on undoped ($x=0$) and electron optimally doped ($x=0.1$) samples, the effect of electron-doping was found to modify spin waves in the parent compound BaFe$_2$As$_2$ below $\sim$100 meV and induce a neutron spin resonance at the commensurate AF ordering wave vector that couples with superconductivity. While the new data collected on the $x=0.096$ sample confirms the overall features of the earlier work, our careful temperature dependent study of the resonance reveals that the resonance suddenly changes its $Q$-width below $T_c$ similar to that of the optimally hole-doped iron pnictides Ba$_{0.67}$K$_{0.33}$Fe$_2$As$_2$. In addition, we establish the dispersion of the resonance and find it to change from commensurate to transversely incommensurate with increasing energy. Upon further electron-doping to overdoped iron pnictides with $x=0.15$ and 0.18, the resonance becomes weaker and transversely incommensurate at all energies, while spin excitations above $\sim$100 meV are still not much affected. Our absolute spin excitation intensity measurements throughout the Brillouin zone for $x=0.096,0.15,0.18$ confirm the notion that the low-energy spin excitation coupling with itinerant electron is important for superconductivity in these materials, even though the high-energy spin excitations are weakly doping dependent.

preprint2013arXiv

Energy Cooperation in Cellular Networks with Renewable Powered Base Stations

In this paper, we propose a model for energy cooperation between cellular base stations (BSs) with individual hybrid power supplies (including both the conventional grid and renewable energy sources), limited energy storages, and connected by resistive power lines for energy sharing. When the renewable energy profile and energy demand profile at all BSs are deterministic or known ahead of time, we show that the optimal energy cooperation policy for the BSs can be found by solving a linear program. We show the benefits of energy cooperation in this regime. When the renewable energy and demand profiles are stochastic and only causally known at the BSs, we propose an online energy cooperation algorithm and show the optimality properties of this algorithm under certain conditions. Furthermore, the energy-saving performances of the developed offline and online algorithms are compared by simulations, and the effect of the availability of energy state information (ESI) on the performance gains of the BSs' energy cooperation is investigated. Finally, we propose a hybrid algorithm that can incorporate offline information about the energy profiles, but operates in an online manner.

preprint2013arXiv

Joint Transmit Beamforming and Receive Power Splitting for MISO SWIPT Systems

This paper studies a multi-user multiple-input single-output (MISO) downlink system for simultaneous wireless information and power transfer (SWIPT), in which a set of single-antenna mobile stations (MSs) receive information and energy simultaneously via power splitting (PS) from the signal sent by a multi-antenna base station (BS). We aim to minimize the total transmission power at BS by jointly designing transmit beamforming vectors and receive PS ratios for all MSs under their given signal-to-interference-plus-noise ratio (SINR) constraints for information decoding and harvested power constraints for energy harvesting. First, we derive the sufficient and necessary condition for the feasibility of our formulated problem. Next, we solve this non-convex problem by applying the technique of semidefinite relaxation (SDR). We prove that SDR is indeed tight for our problem and thus achieves its global optimum. Finally, we propose two suboptimal solutions of lower complexity than the optimal solution based on the principle of separating the optimization of transmit beamforming and receive PS, where the zero-forcing (ZF) and the SINR-optimal based transmit beamforming schemes are applied, respectively.

preprint2013arXiv

Longitudinal spin excitations and magnetic anisotropy in antiferromagnetically ordered BaFe2As2

We report on a spin-polarized inelastic neutron scattering study of spin waves in the antiferromagnetically ordered state of BaFe2As2. Three distinct excitation components are identified, with spins fluctuating along the c-axis, perpendicular to the ordering direction in the ab-plane, and parallel to the ordering direction. While the first two "transverse" components can be described by a linear spin-wave theory with magnetic anisotropy and inter-layer coupling, the third "longitudinal" component is generically incompatible with the local moment picture. It points towards a contribution of itinerant electrons to the magnetism already in the parent compound of this family of Fe-based superconductors.

preprint2013arXiv

MIMO Broadcasting for Simultaneous Wireless Information and Power Transfer

Wireless power transfer (WPT) is a promising new solution to provide convenient and perpetual energy supplies to wireless networks. In practice, WPT is implementable by various technologies such as inductive coupling, magnetic resonate coupling, and electromagnetic (EM) radiation, for short-/mid-/long-range applications, respectively. In this paper, we consider the EM or radio signal enabled WPT in particular. Since radio signals can carry energy as well as information at the same time, a unified study on simultaneous wireless information and power transfer (SWIPT) is pursued. Specifically, this paper studies a multiple-input multiple-output (MIMO) wireless broadcast system consisting of three nodes, where one receiver harvests energy and another receiver decodes information separately from the signals sent by a common transmitter, and all the transmitter and receivers may be equipped with multiple antennas. Two scenarios are examined, in which the information receiver and energy receiver are separated and see different MIMO channels from the transmitter, or co-located and see the identical MIMO channel from the transmitter. For the case of separated receivers, we derive the optimal transmission strategy to achieve different tradeoffs for maximal information rate versus energy transfer, which are characterized by the boundary of a so-called rate-energy (R-E) region. For the case of co-located receivers, we show an outer bound for the achievable R-E region due to the potential limitation that practical energy harvesting receivers are not yet able to decode information directly. Under this constraint, we investigate two practical designs for the co-located receiver case, namely time switching and power splitting, and characterize their achievable R-E regions in comparison to the outer bound.

preprint2013arXiv

Multi-Cell Random Beamforming: Achievable Rate and Degrees of Freedom Region

Random beamforming (RBF) is a practically favourable transmission scheme for multiuser multi-antenna downlink systems since it requires only partial channel state information (CSI) at the transmitter. Under the conventional single-cell setup, RBF is known to achieve the optimal sum-capacity scaling law as the number of users goes to infinity, thanks to the multiuser diversity enabled transmission scheduling that virtually eliminates the intra-cell interference. In this paper, we extend the study of RBF to a more practical multi-cell downlink system with single-antenna receivers subject to the additional inter-cell interference (ICI). First, we consider the case of finite signal-to-noise ratio (SNR) at each receiver. We derive a closed-form expression of the achievable sum-rate with the multi-cell RBF, based upon which we show an asymptotic sum-rate scaling law as the number of users goes to infinity. Next, we consider the high-SNR regime and for tractable analysis assume that the number of users in each cell scales in a certain order with the per-cell SNR. Under this setup, we characterize the achievable degrees of freedom (DoF) for the single-cell case with RBF. Then we extend the analysis to the multi-cell RBF case by characterizing the DoF region. It is shown that the DoF region characterization provides useful guideline on how to design a cooperative multi-cell RBF system to achieve optimal throughput tradeoffs among different cells. Furthermore, our results reveal that the multi-cell RBF scheme achieves the "interference-free DoF" region upper bound for the multi-cell system, provided that the per-cell number of users has a sufficiently large scaling order with the SNR. Our result thus confirms the optimality of multi-cell RBF in this regime even without the complete CSI at the transmitter, as compared to other full-CSI requiring transmission schemes such as interference alignment.

preprint2013arXiv

On Design of Opportunistic Spectrum Access in the Presence of Reactive Primary Users

Opportunistic spectrum access (OSA) is a key technique enabling the secondary users (SUs) in a cognitive radio (CR) network to transmit over the "spectrum holes" unoccupied by the primary users (PUs). In this paper, we focus on the OSA design in the presence of reactive PUs, where PU's access probability in a given channel is related to SU's past access decisions. We model the channel occupancy of the reactive PU as a 4-state discrete-time Markov chain. We formulate the optimal OSA design for SU throughput maximization as a constrained finite-horizon partially observable Markov decision process (POMDP) problem. We solve this problem by first considering the conventional short-term conditional collision probability (SCCP) constraint. We then adopt a long-term PU throughput (LPUT) constraint to effectively protect the reactive PU transmission. We derive the structure of the optimal OSA policy under the LPUT constraint and propose a suboptimal policy with lower complexity. Numerical results are provided to validate the proposed studies, which reveal some interesting new tradeoffs between SU throughput maximization and PU transmission protection in a practical interaction scenario.

preprint2013arXiv

Opportunistic Wireless Energy Harvesting in Cognitive Radio Networks

Wireless networks can be self-sustaining by harvesting energy from ambient radio-frequency (RF) signals. Recently, researchers have made progress on designing efficient circuits and devices for RF energy harvesting suitable for low-power wireless applications. Motivated by this and building upon the classic cognitive radio (CR) network model, this paper proposes a novel method for wireless networks coexisting where low-power mobiles in a secondary network, called secondary transmitters (STs), harvest ambient RF energy from transmissions by nearby active transmitters in a primary network, called primary transmitters (PTs), while opportunistically accessing the spectrum licensed to the primary network. We consider a stochastic-geometry model in which PTs and STs are distributed as independent homogeneous Poisson point processes (HPPPs) and communicate with their intended receivers at fixed distances. Each PT is associated with a guard zone to protect its intended receiver from ST's interference, and at the same time delivers RF energy to STs located in its harvesting zone. Based on the proposed model, we analyze the transmission probability of STs and the resulting spatial throughput of the secondary network. The optimal transmission power and density of STs are derived for maximizing the secondary network throughput under the given outage-probability constraints in the two coexisting networks, which reveal key insights to the optimal network design. Finally, we show that our analytical result can be generally applied to a non-CR setup, where distributed wireless power chargers are deployed to power coexisting wireless transmitters in a sensor network.

preprint2013arXiv

Optimal Power Allocation for Outage Minimization in Fading Channels with Energy Harvesting Constraints

This paper studies the optimal power allocation for outage minimization in point-to-point fading channels with the energy-harvesting constraints and channel distribution information (CDI) at the transmitter. Both the cases with non-causal and causal energy state information (ESI) are considered, which correspond to the energy harvesting rates being known and unknown prior to the transmissions, respectively. For the non-causal ESI case, the average outage probability minimization problem over a finite horizon is shown to be non-convex for a large class of practical fading channels. However, the globally optimal "offline" power allocation is obtained by a forward search algorithm with at most $N$ one-dimensional searches, and the optimal power profile is shown to be non-decreasing over time and have an interesting "save-then-transmit" structure. In particular, for the special case of N=1, our result revisits the classic outage capacity for fading channels with uniform power allocation. Moreover, for the case with causal ESI, we propose both the optimal and suboptimal "online" power allocation algorithms, by applying the technique of dynamic programming and exploring the structure of optimal offline solutions, respectively.

preprint2013arXiv

Optimal Power and Range Adaptation for Green Broadcasting

Improving energy efficiency is key to network providers maintaining profit levels and an acceptable carbon footprint in the face of rapidly increasing data traffic in cellular networks in the coming years. The energy-saving concept studied in this paper is the adaptation of a base station's (BS's) transmit power levels and coverage area according to channel conditions and traffic load. The traffic load in cellular networks exhibits significant fluctuations in both space and time, which can be exploited, through cell range adaptation, for energy saving. In this paper, we design short- and long-term BS power control (STPC and LTPC respectively) policies for the OFDMA-based downlink of a single-cell system, where bandwidth is dynamically and equally shared among a random number of mobile users (MUs). STPC is a function of all MUs' channel gains that maintains the required user-level quality of service (QoS), while LTPC (including BS on-off control) is a function of traffic density that minimizes the long-term energy consumption at the BS under a minimum throughput constraint. We first develop a power scaling law that relates the (short-term) average transmit power at BS with the given cell range and MU density. Based on this result, we derive the optimal (long-term) transmit adaptation policy by considering a joint range adaptation and LTPC problem. By identifying the fact that energy saving at BS essentially comes from two major energy saving mechanisms (ESMs), i.e. range adaptation and BS on-off power control, we propose low-complexity suboptimal schemes with various combinations of the two ESMs to investigate their impacts on system energy consumption. It is shown that when the network throughput is low, BS on-off power control is the most effective ESM, while when the network throughput is higher, range adaptation becomes more effective.

preprint2013arXiv

Optimal Save-Then-Transmit Protocol for Energy Harvesting Wireless Transmitters

In this paper, the design of a wireless communication device relying exclusively on energy harvesting is considered. Due to the inability of rechargeable energy sources to charge and discharge at the same time, a constraint we term the energy half-duplex constraint, two rechargeable energy storage devices (ESDs) are assumed so that at any given time, there is always one ESD being recharged. The energy harvesting rate is assumed to be a random variable that is constant over the time interval of interest. A save-then-transmit (ST) protocol is introduced, in which a fraction of time ρ (dubbed the save-ratio) is devoted exclusively to energy harvesting, with the remaining fraction 1 - ρ used for data transmission. The ratio of the energy obtainable from an ESD to the energy harvested is termed the energy storage efficiency, η. We address the practical case of the secondary ESD being a battery with η < 1, and the main ESD being a super-capacitor with η = 1. The optimal save-ratio that minimizes outage probability is derived, from which some useful design guidelines are drawn. In addition, we compare the outage performance of random power supply to that of constant power supply over the Rayleigh fading channel. The diversity order with random power is shown to be the same as that of constant power, but the performance gap can be large. Furthermore, we extend the proposed ST protocol to wireless networks with multiple transmitters. It is shown that the system-level outage performance is critically dependent on the relationship between the number of transmitters and the optimal save-ratio for single-channel outage minimization. Numerical results are provided to validate our proposed study.

preprint2013arXiv

Optimized Transmission with Improper Gaussian Signaling in the K-User MISO Interference Channel

This paper studies the achievable rate region of the K-user Gaussian multiple-input single-output interference channel (MISO-IC) with the interference treated as noise, when improper or circularly asymmetric complex Gaussian signaling is applied. The transmit optimization with improper Gaussian signaling involves not only the signal covariance matrix as in the conventional proper or circularly symmetric Gaussian signaling, but also the signal pseudo-covariance matrix, which is conventionally set to zero in proper Gaussian signaling. By exploiting the separable rate expression with improper Gaussian signaling, we propose a separate transmit covariance and pseudo-covariance optimization algorithm, which is guaranteed to improve the users' achievable rates over the conventional proper Gaussian signaling. In particular, for the pseudo-covariance optimization, we establish the optimality of rank-1 pseudo-covariance matrices, given the optimal rank-1 transmit covariance matrices for achieving the Pareto boundary of the rate region. Based on this result, we are able to greatly reduce the number of variables in the pseudo-covariance optimization problem and thereby develop an efficient solution by applying the celebrated semidefinite relaxation (SDR) technique. Finally, we extend the result to the Gaussian MISO broadcast channel (MISO-BC) with improper Gaussian signaling or so-called widely linear transmit precoding.

preprint2013arXiv

Percolation of Interdependent Networks with Inter-similarity

Real data show that interdependent networks usually involve inter-similarity. Intersimilarity means that a pair of interdependent nodes have neighbors in both networks that are also interdependent (Parshani et al \cite{PAR10B}). For example, the coupled world wide port network and the global airport network are intersimilar since many pairs of linked nodes (neighboring cities), by direct flights and direct shipping lines exist in both networks. Nodes in both networks in the same city are regarded as interdependent. If two neighboring nodes in one network depend on neighboring nodes in the another we call these links common links. The fraction of common links in the system is a measure of intersimilarity. Previous simulation results suggest that intersimilarity has considerable effect on reducing the cascading failures, however, a theoretical understanding on this effect on the cascading process is currently missing. Here, we map the cascading process with inter-similarity to a percolation of networks composed of components of common links and non common links. This transforms the percolation of inter-similar system to a regular percolation on a series of subnetworks, which can be solved analytically. We apply our analysis to the case where the network of common links is an Erdős-Rényi (ER) network with the average degree $K$, and the two networks of non-common links are also ER networks. We show for a fully coupled pair of ER networks, that for any $K\geq0$, although the cascade is reduced with increasing $K$, the phase transition is still discontinuous. Our analysis can be generalized to any kind of interdependent random networks system.

preprint2013arXiv

Secrecy Wireless Information and Power Transfer with MISO Beamforming

The dual use of radio signals for simultaneous wireless information and power transfer (SWIPT) has recently drawn significant attention. To meet the practical requirement that energy receivers (ERs) operate with much higher received power than information receivers (IRs), ERs need to be deployed closer to the transmitter than IRs. However, due to the broadcast nature of wireless channels, one critical issue is that the messages sent to IRs cannot be eavesdropped by ERs, which possess better channels from the transmitter. In this paper, we address this new secrecy communication problem in a multiuser multiple-input single-output (MISO) SWIPT system where a multi-antenna transmitter sends information and energy simultaneously to one IR and multiple ERs, each with a single antenna. By optimizing transmit beamforming vectors and their power allocation, we maximize the weighted sum-energy transferred to ERs subject to a secrecy rate constraint for the information sent to the IR. We solve this non-convex problem optimally by reformulating it into a two-stage problem. First, we fix the signal-to-interference-plus-noise ratio (SINR) at the IR and obtain the optimal beamforming solution by applying the technique of semidefinite relaxation (SDR). Then the original problem is solved by a one-dimension search over the optimal SINR value for the IR. Furthermore, two suboptimal low-complexity beamforming schemes are proposed, and their achievable (secrecy) rate-energy (R-E) regions are compared against that by the optimal scheme.

preprint2013arXiv

Spin excitation anisotropy as a probe of orbital ordering in the paramagnetic tetragonal phase of superconducting BaFe1.904Ni0.096As2

We use polarized neutron scattering to demonstrate that in-plane spin excitations in electron doped superconducting BaFe1.904Ni0.096As2 (Tc=19.8 K) change from isotropic to anisotropic in the tetragonal phase well above the antiferromagnetic (AF) ordering and tetragonal-to-orthorhombic lattice distortion temperatures (Tn=Ts=33 K) without an uniaxial pressure. While the anisotropic spin excitations are not sensitive to the AF order and tetragonal-to-orthorhombic lattice distortion, superconductivity induces further anisotropy for spin excitations along the [1,1,0] and [1,-1,0] directions. These results indicate that the spin excitation anisotropy is a probe of the electronic anisotropy or orbital ordering in the tetragonal phase of iron pnictides.

preprint2013arXiv

Throughput Optimal Policies for Energy Harvesting Wireless Transmitters with Non-Ideal Circuit Power

Characterizing the fundamental tradeoffs for maximizing energy efficiency (EE) versus spectrum efficiency (SE) is a key problem in wireless communication. In this paper, we address this problem for a point-to-point additive white Gaussian noise (AWGN) channel with the transmitter powered solely via energy harvesting from the environment. In addition, we assume a practical on-off transmitter model with non-ideal circuit power, i.e., when the transmitter is on, its consumed power is the sum of the transmit power and a constant circuit power. Under this setup, we study the optimal transmit power allocation to maximize the average throughput over a finite horizon, subject to the time-varying energy constraint and the non-ideal circuit power consumption. First, we consider the off-line optimization under the assumption that the energy arrival time and amount are a priori known at the transmitter. Although this problem is non-convex due to the non-ideal circuit power, we show an efficient optimal solution that in general corresponds to a two-phase transmission: the first phase with an EE-maximizing on-off power allocation, and the second phase with a SE-maximizing power allocation that is non-decreasing over time, thus revealing an interesting result that both the EE and SE optimizations are unified in an energy harvesting communication system. We then extend the optimal off-line algorithm to the case with multiple parallel AWGN channels, based on the principle of nested optimization. Finally, inspired by the off-line optimal solution, we propose a new online algorithm under the practical setup with only the past and present energy state information (ESI) known at the transmitter.

preprint2013arXiv

Transmit Optimization with Improper Gaussian Signaling for Interference Channels

This paper studies the achievable rates of Gaussian interference channels with additive white Gaussian noise (AWGN), when improper or circularly asymmetric complex Gaussian signaling is applied. For the Gaussian multiple-input multiple-output interference channel (MIMO-IC) with the interference treated as Gaussian noise, we show that the user's achievable rate can be expressed as a summation of the rate achievable by the conventional proper or circularly symmetric complex Gaussian signaling in terms of the users' transmit covariance matrices, and an additional term, which is a function of both the users' transmit covariance and pseudo-covariance matrices. The additional degrees of freedom in the pseudo-covariance matrix, which is conventionally set to be zero for the case of proper Gaussian signaling, provide an opportunity to further improve the achievable rates of Gaussian MIMO-ICs by employing improper Gaussian signaling. To this end, this paper proposes widely linear precoding, which efficiently maps proper information-bearing signals to improper transmitted signals at each transmitter for any given pair of transmit covariance and pseudo-covariance matrices. In particular, for the case of two-user Gaussian single-input single-output interference channel (SISO-IC), we propose a joint covariance and pseudo-covariance optimization algorithm with improper Gaussian signaling to achieve the Pareto-optimal rates. By utilizing the separable structure of the achievable rate expression, an alternative algorithm with separate covariance and pseudo-covariance optimization is also proposed, which guarantees the rate improvement over conventional proper Gaussian signaling.

preprint2013arXiv

Velocity slip on curved surfaces

The Navier boundary condition for velocity slip on flat surfaces, when expressed in tensor form, is readily extended to surfaces of any shape. We test this assertion using molecular dynamics simulations of flow in channels with flat and curved walls and for rotating cylinders and spheres, all for a wide range of solid-liquid interaction strengths. We find that the slip length as conventionally measured at a flat wall in Couette flow is the same as that for all other cases with curved and rotating boundaries, provided the atomic interactions are the same and boundary shape is properly taken into account. These results support the idea that the slip length is a material property, transferable between different flow configurations.

preprint2013arXiv

Wireless Information and Power Transfer: A Dynamic Power Splitting Approach

Scavenging energy from ambient radio signals, namely wireless energy harvesting (WEH), has recently drawn significant attention. In this paper, we consider a point-to-point wireless link over the flat-fading channel, where the receiver replenishes energy via WEH from the signals sent by the transmitter. We consider a SISO (single-input single-output) system where the single-antenna receiver cannot decode information and harvest energy independently from the same signal received. Under this practical constraint, we propose a dynamic power splitting (DPS) scheme, where the received signal is split into two streams with adjustable power levels for information decoding and energy harvesting separately based on the instantaneous channel condition that is assumed to be known at the receiver. We derive the optimal power splitting rule at the receiver to achieve various trade-offs between the maximum ergodic capacity for information transfer and the maximum average harvested energy for power transfer. Moreover, for the case when the channel state information is also known at the transmitter, we investigate the joint optimization of transmitter power control and receiver power splitting. Finally, we extend the result for DPS to the SIMO (single-input multiple-output) system and investigate a low-complexity power splitting scheme termed antenna switching.

preprint2013arXiv

Wireless Information and Power Transfer: Architecture Design and Rate-Energy Tradeoff

Simultaneous information and power transfer over the wireless channels potentially offers great convenience to mobile users. Yet practical receiver designs impose technical constraints on its hardware realization, as practical circuits for harvesting energy from radio signals are not yet able to decode the carried information directly. To make theoretical progress, we propose a general receiver operation, namely, dynamic power splitting (DPS), which splits the received signal with adjustable power ratio for energy harvesting and information decoding, separately. Three special cases of DPS, namely, time switching (TS), static power splitting (SPS) and on-off power splitting (OPS) are investigated. The TS and SPS schemes can be treated as special cases of OPS. Moreover, we propose two types of practical receiver architectures, namely, separated versus integrated information and energy receivers. The integrated receiver integrates the front-end components of the separated receiver, thus achieving a smaller form factor. The rate-energy tradeoff for the two architectures are characterized by a so-called rate-energy (R-E) region. The optimal transmission strategy is derived to achieve different rate-energy tradeoffs. With receiver circuit power consumption taken into account, it is shown that the OPS scheme is optimal for both receivers. For the ideal case when the receiver circuit does not consume power, the SPS scheme is optimal for both receivers. In addition, we study the performance for the two types of receivers under a realistic system setup that employs practical modulation. Our results provide useful insights to the optimal practical receiver design for simultaneous wireless information and power transfer (SWIPT).

preprint2012arXiv

Achieving Global Optimality for Weighted Sum-Rate Maximization in the K-User Gaussian Interference Channel with Multiple Antennas

Characterizing the global maximum of weighted sum-rate (WSR) for the K-user Gaussian interference channel (GIC), with the interference treated as Gaussian noise, is a key problem in wireless communication. However, due to the users' mutual interference, this problem is in general non-convex and thus cannot be solved directly by conventional convex optimization techniques. In this paper, by jointly utilizing the monotonic optimization and rate profile techniques, we develop a new framework to obtain the globally optimal power control and/or beamforming solutions to the WSR maximization problems for the GICs with single-antenna transmitters and single-antenna receivers (SISO), single-antenna transmitters and multi-antenna receivers (SIMO), or multi-antenna transmitters and single-antenna receivers (MISO). Different from prior work, this paper proposes to maximize the WSR in the achievable rate region of the GIC directly by exploiting the facts that the achievable rate region is a "normal" set and the users' WSR is a "strictly increasing" function over the rate region. Consequently, the WSR maximization is shown to be in the form of monotonic optimization over a normal set and thus can be solved globally optimally by the existing outer polyblock approximation algorithm. However, an essential step in the algorithm hinges on how to efficiently characterize the intersection point on the Pareto boundary of the achievable rate region with any prescribed "rate profile" vector. This paper shows that such a problem can be transformed into a sequence of signal-to-interference-plus-noise ratio (SINR) feasibility problems, which can be solved efficiently by existing techniques. Numerical results validate that the proposed algorithms can achieve the global WSR maximum for the SISO, SIMO or MISO GIC.

preprint2012arXiv

Boosting Moving Object Indexing through Velocity Partitioning

There have been intense research interests in moving object indexing in the past decade. However, existing work did not exploit the important property of skewed velocity distributions. In many real world scenarios, objects travel predominantly along only a few directions. Examples include vehicles on road networks, flights, people walking on the streets, etc. The search space for a query is heavily dependent on the velocity distribution of the objects grouped in the nodes of an index tree. Motivated by this observation, we propose the velocity partitioning (VP) technique, which exploits the skew in velocity distribution to speed up query processing using moving object indexes. The VP technique first identifies the "dominant velocity axes (DVAs)" using a combination of principal components analysis (PCA) and k-means clustering. Then, a moving object index (e.g., a TPR-tree) is created based on each DVA, using the DVA as an axis of the underlying coordinate system. An object is maintained in the index whose DVA is closest to the object's current moving direction. Thus, all the objects in an index are moving in a near 1-dimensional space instead of a 2-dimensional space. As a result, the expansion of the search space with time is greatly reduced, from a quadratic function of the maximum speed (of the objects in the search range) to a near linear function of the maximum speed. The VP technique can be applied to a wide range of moving object index structures. We have implemented the VP technique on two representative ones, the TPR*-tree and the Bx-tree. Extensive experiments validate that the VP technique consistently improves the performance of those index structures.

preprint2012arXiv

Cognitive Energy Harvesting and Transmission from a Network Perspective

Wireless networks can be self-sustaining by harvesting energy from radio-frequency (RF) signals. Building on classic cognitive radio networks, we propose a novel method for network coexisting where mobiles from a secondary network, called secondary transmitters (STs), either harvest energy from transmissions by nearby transmitters from a primary network, called primary transmitters (PTs), or transmit information if PTs are sufficiently far away; STs store harvested energy in rechargeable batteries with finite capacity and use all available energy for subsequent transmission when batteries are fully charged. In this model, each PT is centered at a guard zone and a harvesting zone that are disks with given radiuses; a ST harvests energy if it lies in some harvesting zone, transmits fixed-power signals if it is outside all guard zones or else idles. Based on this model, the spatial throughput of the secondary network is maximized using a stochastic-geometry model where PTs and STs are modeled as independent homogeneous Poisson point processes (HPPPs), under the outage constraints for coexisting networks and obtained in a simple closed-form. It is observed from the result that the maximum secondary throughput decreases linearly with the growing PT density, and the optimal ST density is inversely proportional to the derived transmission probability for STs.

preprint2012arXiv

Cooperative Precoding with Limited Feedback for MIMO Interference Channels

Multi-antenna precoding effectively mitigates the interference in wireless networks. However, the resultant performance gains can be significantly compromised in practice if the precoder design fails to account for the inaccuracy in the channel state information (CSI) feedback. This paper addresses this issue by considering finite-rate CSI feedback from receivers to their interfering transmitters in the two-user multiple-input-multiple-output (MIMO) interference channel, called cooperative feedback, and proposing a systematic method for designing transceivers comprising linear precoders and equalizers. Specifically, each precoder/equalizer is decomposed into inner and outer components for nulling the cross-link interference and achieving array gain, respectively. The inner precoders/equalizers are further optimized to suppress the residual interference resulting from finite-rate cooperative feedback. Further- more, the residual interference is regulated by additional scalar cooperative feedback signals that are designed to control transmission power using different criteria including fixed interference margin and maximum sum throughput. Finally, the required number of cooperative precoder feedback bits is derived for limiting the throughput loss due to precoder quantization.

preprint2012arXiv

Exploiting Network Cooperation in Green Wireless Communication

There is a growing interest in energy efficient or so-called "green" wireless communication to reduce the energy consumption in cellular networks. Since today's wireless terminals are typically equipped with multiple network access interfaces such as Bluetooth, Wi-Fi, and cellular networks, this paper investigates user terminals cooperating with each other in transmitting their data packets to the base station (BS), by exploiting the multiple network access interfaces, called inter-network cooperation. We also examine the conventional schemes without user cooperation and with intra-network cooperation for comparison. Given target outage probability and data rate requirements, we analyze the energy consumption of conventional schemes as compared to the proposed inter-network cooperation by taking into account both physical-layer channel impairments (including path loss, fading, and thermal noise) and upper-layer protocol overheads. It is shown that distances between different network entities (i.e., user terminals and BS) have a significant influence on the energy efficiency of proposed inter-network cooperation scheme. Specifically, when the cooperating users are close to BS or the users are far away from each other, the inter-network cooperation may consume more energy than conventional schemes without user cooperation or with intra-network cooperation. However, as the cooperating users move away from BS and the inter-user distance is not too large, the inter-network cooperation significantly reduces the energy consumption over conventional schemes.

preprint2012arXiv

Growth of Large Domain Epitaxial Graphene on the C-Face of SiC

Growth of epitaxial graphene on the C-face of SiC has been investigated. Using a confinement controlled sublimation (CCS) method, we have achieved well controlled growth and been able to observe propagation of uniform monolayer graphene. Surface patterns uncover two important aspects of the growth, i.e. carbon diffusion and stoichiometric requirement. Moreover, a new "stepdown" growth mode has been discovered. Via this mode, monolayer graphene domains can have an area of hundreds of square micrometers, while, most importantly, step bunching is avoided and the initial uniformly stepped SiC surface is preserved. The stepdown growth provides a possible route towards uniform epitaxial graphene in wafer size without compromising the initial flat surface morphology of SiC.

preprint2012arXiv

Improving Achievable Rate for the Two-User SISO Interference Channel with Improper Gaussian Signaling

This paper studies the achievable rate region of the two-user single-input-single-output (SISO) Gaussian interference channel, when the improper Gaussian signaling is applied. Under the assumption that the interference is treated as additive Gaussian noise, we show that the user's achievable rate can be expressed as a summation of the rate achievable by the conventional proper Gaussian signaling, which depends on the users' input covariances only, and an additional term, which is a function of both the users' covariances and pseudo-covariances. The additional degree of freedom given by the pseudo-covariance, which is conventionally set to be zero for the case of proper Gaussian signaling, provides an opportunity to improve the achievable rate by employing the improper Gaussian signaling. Since finding the optimal solution for the joint covariance and pseudo-covariance optimization is difficult, we propose a sub-optimal but efficient algorithm by separately optimizing these two sets of parameters. Numerical results show that the proposed algorithm provides a close-to-optimal performance as compared to the exhaustive search method, and significantly outperforms the optimal proper Gaussian signaling and other existing improper Gaussian signaling schemes.

preprint2012arXiv

Nanodrop impact on solid surfaces

The impact of nanometer sized drops on solid surfaces is studied using molecular dynamics simulations. Equilibrated floating drops consisting of short chains of Lennard-Jones liquids with adjustable volatility are directed normally onto an atomistic solid surface where they are observed to bounce, stick, splash or disintegrate, depending on the initial velocity and the nature of the materials involved. Drops impacting at low velocity bounce from non-wetting surfaces but stick and subsequently spread slowly on wetting surfaces. Higher velocity impacts produce an prompt splash followed by disintegration of the drop, while at still higher velocity drops disintegrate immediately. The disintegration can be understood as either a loss of coherence of the liquid or as the result of a local temperature exceeding the liquid-vapor coexistence value. In contrast to macroscopic drops, the presence of vapor outside the drop does not effect the behavior in any significant way. Nonetheless, the transition between the splashing and bouncing/sticking regimes occur at Reynolds and Weber numbers similar to those found for larger drops.

preprint2012arXiv

Optimal Energy Allocation for Wireless Communications with Energy Harvesting Constraints

We consider the use of energy harvesters, in place of conventional batteries with fixed energy storage, for point-to-point wireless communications. In addition to the challenge of transmitting in a channel with time selective fading, energy harvesters provide a perpetual but unreliable energy source. In this paper, we consider the problem of energy allocation over a finite horizon, taking into account channel conditions and energy sources that are time varying, so as to maximize the throughput. Two types of side information (SI) on the channel conditions and harvested energy are assumed to be available: causal SI (of the past and present slots) or full SI (of the past, present and future slots). We obtain structural results for the optimal energy allocation, via the use of dynamic programming and convex optimization techniques. In particular, if unlimited energy can be stored in the battery with harvested energy and the full SI is available, we prove the optimality of a water-filling energy allocation solution where the so-called water levels follow a staircase function.

preprint2012arXiv

Paramagnetic spin excitations in insulating Rb$_{0.8}$Fe$_{1.6}$Se$_2$

We use neutron scattering to study temperature dependent spin excitations in insulating antiferromagnetic (AF) Rb$_{0.8}$Fe$_{1.6}$Se$_2$. In the low-temperature AF state, spin waves can be accurately described by a local moment Heisenberg Hamiltonian. On warming to around the Neel temperature of T_N=500$ K, low-energy (E<30meV) paramagnetic spin excitations form Lorentzian-like quasielastic peaks centered at the AF wave vectors associated with spin waves, while high-energy (E>50meV) spin excitations become heavily damped. Upon further warming to above the structural distortion temperature of T_s=524K, the entire paramagnetic excitations become overdamped. These results suggest that AF Rb$_{0.8}$Fe$_{1.6}$Se$_2$ is not a copper-oxide-like Mott insulator, and has less electron correlations compared with metallic iron pnictides and iron chalcogenides.

preprint2012arXiv

Throughput Maximization for the Gaussian Relay Channel with Energy Harvesting Constraints

This paper considers the use of energy harvesters, instead of conventional time-invariant energy sources, in wireless cooperative communication. For the purpose of exposition, we study the classic three-node Gaussian relay channel with decode-and-forward (DF) relaying, in which the source and relay nodes transmit with power drawn from energy-harvesting (EH) sources. Assuming a deterministic EH model under which the energy arrival time and the harvested amount are known prior to transmission, the throughput maximization problem over a finite horizon of $N$ transmission blocks is investigated. In particular, two types of data traffic with different delay constraints are considered: delay-constrained (DC) traffic (for which only one-block decoding delay is allowed at the destination) and no-delay-constrained (NDC) traffic (for which arbitrary decoding delay up to $N$ blocks is allowed). For the DC case, we show that the joint source and relay power allocation over time is necessary to achieve the maximum throughput, and propose an efficient algorithm to compute the optimal power profiles. For the NDC case, although the throughput maximization problem is non-convex, we prove the optimality of a separation principle for the source and relay power allocation problems, based upon which a two-stage power allocation algorithm is developed to obtain the optimal source and relay power profiles separately. Furthermore, we compare the DC and NDC cases, and obtain the sufficient and necessary conditions under which the NDC case performs strictly better than the DC case. It is shown that NDC transmission is able to exploit a new form of diversity arising from the independent source and relay energy availability over time in cooperative communication, termed "energy diversity", even with time-invariant channels.

preprint2012arXiv

Wireless Information Transfer with Opportunistic Energy Harvesting

Energy harvesting is a promising solution to prolong the operation of energy-constrained wireless networks. In particular, scavenging energy from ambient radio signals, namely wireless energy harvesting (WEH), has recently drawn significant attention. In this paper, we consider a point-to-point wireless link over the narrowband flat-fading channel subject to time-varying co-channel interference. It is assumed that the receiver has no fixed power supplies and thus needs to replenish energy opportunistically via WEH from the unintended interference and/or the intended signal sent by the transmitter. We further assume a single-antenna receiver that can only decode information or harvest energy at any time due to the practical circuit limitation. Therefore, it is important to investigate when the receiver should switch between the two modes of information decoding (ID) and energy harvesting (EH), based on the instantaneous channel and interference condition. In this paper, we derive the optimal mode switching rule at the receiver to achieve various trade-offs between wireless information transfer and energy harvesting. Specifically, we determine the minimum transmission outage probability for delay-limited information transfer and the maximum ergodic capacity for no-delay-limited information transfer versus the maximum average energy harvested at the receiver, which are characterized by the boundary of so-called "outage-energy" region and "rate-energy" region, respectively. Moreover, for the case when the channel state information (CSI) is known at the transmitter, we investigate the joint optimization of transmit power control, information and energy transfer scheduling, and the receiver's mode switching. Our results provide useful guidelines for the efficient design of emerging wireless communication systems powered by opportunistic WEH.

preprint2011arXiv

A MovingObject Index for Efficient Query Processing with Peer-Wise Location Privacy

With the growing use of location-based services, location privacy attracts increasing attention from users, industry, and the research community. While considerable effort has been devoted to inventing techniques that prevent service providers from knowing a user's exact location, relatively little attention has been paid to enabling so-called peer-wise privacy--the protection of a user's location from unauthorized peer users. This paper identifies an important efficiency problem in existing peer-privacy approaches that simply apply a filtering step to identify users that are located in a query range, but that do not want to disclose their location to the querying peer. To solve this problem, we propose a novel, privacy-policy enabled index called the PEB-tree that seamlessly integrates location proximity and policy compatibility. We propose efficient algorithms that use the PEB-tree for processing privacy-aware range and kNN queries. Extensive experiments suggest that the PEB-tree enables efficient query processing.

preprint2011arXiv

Controllable ultra-broadband slow light in a warm Rubidium vapor

We study ultra-broadband slow light in a warm Rubidium vapor cell. By working between the D1 and D2 transitions, we find a several-nm window centered at 788.4 nm in which the group index is highly uniform and the absorption is small (<1%). We demonstrate that we can control the group delay by varying the temperature of the cell, and observe a tunable fractional delay of 18 for pulses as short as 250 fs (6.9 nm bandwidth) with a fractional broadening of only 0.65 and a power leakage of 55%. We find that a simple theoretical model is in excellent agreement with the experimental results. Using this model, we discuss the impact of the pulse's spectral characteristics on the distortion it incurs during propagation through the vapor.

preprint2011arXiv

Cooperative Interference Control for Spectrum Sharing in OFDMA Cellular Systems

This paper studies cooperative schemes for the inter-cell interference control in orthogonal-frequency-divisionmultiple- access (OFDMA) cellular systems. The downlink transmission in a simplified two-cell system is examined, where both cells simultaneously access the same frequency band using OFDMA. The joint power and subcarrier allocation over the two cells is investigated for maximizing their sum throughput with both centralized and decentralized implementations. Particularly, the decentralized allocation is achieved via a new cooperative interference control approach, whereby the two cells independently implement resource allocation to maximize individual throughput in an iterative manner, subject to a set of mutual interference power constraints. Simulation results show that the proposed decentralized resource allocation schemes achieve the system throughput close to that by the centralized scheme, and provide substantial throughput gains over existing schemes.

preprint2011arXiv

Exploiting Interference Alignment in Multi-Cell Cooperative OFDMA Resource Allocation

This paper studies interference alignment (IA) based multi-cell cooperative resource allocation for the downlink OFDMA with universal frequency reuse. Unlike the traditional scheme that treats subcarriers as separate dimensions for resource allocation, the IA technique is utilized to enable frequency-domain precoding over parallel subcarriers. In this paper, the joint optimization of frequency-domain precoding via IA, subcarrier user selection and power allocation is investigated for a cooperative three-cell OFDMA system to maximize the downlink throughput. Numerical results for a simplified symmetric channel setup reveal that the IA-based scheme achieves notable throughput gains over the traditional scheme only when the inter-cell interference link has a comparable strength as the direct link, and the receiver SNR is sufficiently large. Motivated by this observation, a practical hybrid scheme is proposed for cellular systems with heterogenous channel conditions, where the total spectrum is divided into two subbands, over which the IAbased scheme and the traditional scheme are applied for resource allocation to users located in the cell-intersection region and cellnon- intersection region, respectively. It is shown that this hybrid resource allocation scheme flexibly exploits the downlink IA gains for OFDMA-based cellular systems.

preprint2011arXiv

Price-Based Resource Allocation for Spectrum-Sharing Femtocell Networks: A Stackelberg Game Approach

This paper investigates the price-based resource allocation strategies for the uplink transmission of a spectrum-sharing femtocell network, in which a central macrocell is underlaid with distributed femtocells, all operating over the same frequency band as the macrocell. Assuming that the macrocell base station (MBS) protects itself by pricing the interference from the femtocell users, a Stackelberg game is formulated to study the joint utility maximization of the macrocell and the femtocells subject to a maximum tolerable interference power constraint at the MBS. Especially, two practical femtocell channel models: sparsely deployed scenario for rural areas and densely deployed scenario for urban areas, are investigated. For each scenario, two pricing schemes: uniform pricing and non-uniform pricing, are proposed. Then, the Stackelberg equilibriums for these proposed games are studied, and an effective distributed interference price bargaining algorithm with guaranteed convergence is proposed for the uniform-pricing case. Finally, numerical examples are presented to verify the proposed studies. It is shown that the proposed algorithms are effective in resource allocation and macrocell protection requiring minimal network overhead for spectrum-sharing-based two-tier femtocell networks.

preprint2011arXiv

Privacy Preserving Moving KNN Queries

We present a novel approach that protects trajectory privacy of users who access location-based services through a moving k nearest neighbor (MkNN) query. An MkNN query continuously returns the k nearest data objects for a moving user (query point). Simply updating a user's imprecise location such as a region instead of the exact position to a location-based service provider (LSP) cannot ensure privacy of the user for an MkNN query: continuous disclosure of regions enables the LSP to follow a user's trajectory. We identify the problem of trajectory privacy that arises from the overlap of consecutive regions while requesting an MkNN query and provide the first solution to this problem. Our approach allows a user to specify the confidence level that represents a bound of how much more the user may need to travel than the actual kth nearest data object. By hiding a user's required confidence level and the required number of nearest data objects from an LSP, we develop a technique to prevent the LSP from tracking the user's trajectory for MkNN queries. We propose an efficient algorithm for the LSP to find k nearest data objects for a region with a user's specified confidence level, which is an essential component to evaluate an MkNN query in a privacy preserving manner; this algorithm is at least two times faster than the state-of-the-art algorithm. Extensive experimental studies validate the effectiveness of our trajectory privacy protection technique and the efficiency of our algorithm.

preprint2011arXiv

Probabilistic Voronoi Diagrams for Probabilistic Moving Nearest Neighbor Queries

A large spectrum of applications such as location based services and environmental monitoring demand efficient query processing on uncertain databases. In this paper, we propose the probabilistic Voronoi diagram (PVD) for processing moving nearest neighbor queries on uncertain data, namely the probabilistic moving nearest neighbor (PMNN) queries. A PMNN query finds the most probable nearest neighbor of a moving query point continuously. To process PMNN queries efficiently, we provide two techniques: a pre-computation approach and an incremental approach. In the pre-computation approach, we develop an algorithm to efficiently evaluate PMNN queries based on the pre-computed PVD for the entire data set. In the incremental approach, we propose an incremental probabilistic safe region based technique that does not require to pre-compute the whole PVD to answer the PMNN query. In this incremental approach, we exploit the knowledge for a known region to compute the lower bound of the probability of an object being the nearest neighbor. Experimental results show that our approaches significantly outperform a sampling based approach by orders of magnitude in terms of I/O, query processing time, and communication overheads.

preprint2011arXiv

Throughput and Delay Scaling in Supportive Two-Tier Networks

Consider a wireless network that has two tiers with different priorities: a primary tier vs. a secondary tier, which is an emerging network scenario with the advancement of cognitive radio technologies. The primary tier consists of randomly distributed legacy nodes of density $n$, which have an absolute priority to access the spectrum. The secondary tier consists of randomly distributed cognitive nodes of density $m=n^β$ with $β\geq 2$, which can only access the spectrum opportunistically to limit the interference to the primary tier. Based on the assumption that the secondary tier is allowed to route the packets for the primary tier, we investigate the throughput and delay scaling laws of the two tiers in the following two scenarios: i) the primary and secondary nodes are all static; ii) the primary nodes are static while the secondary nodes are mobile. With the proposed protocols for the two tiers, we show that the primary tier can achieve a per-node throughput scaling of $λ_p(n)=Θ(1/\log n)$ in the above two scenarios. In the associated delay analysis for the first scenario, we show that the primary tier can achieve a delay scaling of $D_p(n)=Θ(\sqrt{n^β\log n}λ_p(n))$ with $λ_p(n)=O(1/\log n)$. In the second scenario, with two mobility models considered for the secondary nodes: an i.i.d. mobility model and a random walk model, we show that the primary tier can achieve delay scaling laws of $Θ(1)$ and $Θ(1/S)$, respectively, where $S$ is the random walk step size. The throughput and delay scaling laws for the secondary tier are also established, which are the same as those for a stand-alone network.

preprint2010arXiv

Cooperative Feedback for MIMO Interference Channels

Multi-antenna precoding effectively mitigates the interference in wireless networks. However, the precoding efficiency can be significantly degraded by the overhead due to the required feedback of channel state information (CSI). This paper addresses such an issue by proposing a systematic method of designing precoders for the two-user multiple-input-multiple-output (MIMO) interference channels based on finite-rate CSI feedback from receivers to their interferers, called cooperative feedback. Specifically, each precoder is decomposed into inner and outer precoders for nulling interference and improving the data link array gain, respectively. The inner precoders are further designed to suppress residual interference resulting from finite-rate cooperative feedback. To regulate residual interference due to precoder quantization, additional scalar cooperative feedback signals are designed to control transmitters' power using different criteria including applying interference margins, maximizing sum throughput, and minimizing outage probability. Simulation shows that such additional feedback effectively alleviates performance degradation due to quantized precoder feedback.

preprint2010arXiv

Cooperative Feedback for Multi-Antenna Cognitive Radio Networks

Cognitive beamforming (CB) is a multi-antenna technique for efficient spectrum sharing between primary users (PUs) and secondary users (SUs) in a cognitive radio network. Specifically, a multi-antenna SU transmitter applies CB to suppress the interference to the PU receivers as well as enhance the corresponding SU-link performance. In this paper, for a multiple-input-single-output (MISO) SU channel coexisting with a single-input-single-output (SISO) PU channel, we propose a new and practical paradigm for designing CB based on the finite-rate cooperative feedback from the PU receiver to the SU transmitter. Specifically, the PU receiver communicates to the SU transmitter the quantized SU-to-PU channel direction information (CDI) for computing the SU transmit beamformer, and the interference power control (IPC) signal that regulates the SU transmission power according to the tolerable interference margin at the PU receiver. Two CB algorithms based on cooperative feedback are proposed: one restricts the SU transmit beamformer to be orthogonal to the quantized SU-to-PU channel direction and the other relaxes such a constraint. In addition, cooperative feedforward of the SU CDI from the SU transmitter to the PU receiver is exploited to allow more efficient cooperative feedback. The outage probabilities of the SU link for different CB and cooperative feedback/feedforward algorithms are analyzed, from which the optimal bit-allocation tradeoff between the CDI and IPC feedback is characterized.

preprint2010arXiv

Cooperative Interference Management with MISO Beamforming

This correspondence studies the downlink transmission in a multi-cell system, where multiple base stations (BSs) each with multiple antennas cooperatively design their respective transmit beamforming vectors to optimize the overall system performance. For simplicity, it is assumed that all mobile stations (MSs) are equipped with a single antenna each, and there is one active MS in each cell at one time. Accordingly, the system of interests can be modeled by a multiple-input single-output (MISO) interference channel (IC), termed as MISO-IC, with interference treated as noise. We propose a new method to characterize different rate-tuples for active MSs on the Pareto boundary of the achievable rate region for the MISO-IC, by exploring the relationship between the MISO-IC and the cognitive radio (CR) MISO channel. We show that each Pareto-boundary rate-tuple of the MISO-IC can be achieved in a decentralized manner when each of the BSs attains its own channel capacity subject to a certain set of interference-power constraints (also known as interference-temperature constraints in the CR system) at the other MS receivers. Furthermore, we show that this result leads to a new decentralized algorithm for implementing the multi-cell cooperative downlink beamforming.

preprint2010arXiv

Cooperative Multi-Cell Block Diagonalization with Per-Base-Station Power Constraints

Block diagonalization (BD) is a practical linear precoding technique that eliminates the inter-user interference in downlink multiuser multiple-input multiple-output (MIMO) systems. In this paper, we apply BD to the downlink transmission in a cooperative multi-cell MIMO system, where the signals from different base stations (BSs) to all the mobile stations (MSs) are jointly designed with the perfect knowledge of the downlink channels and transmit messages. Specifically, we study the optimal BD precoder design to maximize the weighted sum-rate of all the MSs subject to a set of per-BS power constraints. This design problem is formulated in an auxiliary MIMO broadcast channel (BC) with a set of transmit power constraints corresponding to those for individual BSs in the multi-cell system. By applying convex optimization techniques, this paper develops an efficient algorithm to solve this problem, and derives the closed-form expression for the optimal BD precoding matrix. It is revealed that the optimal BD precoding vectors for each MS in the per-BS power constraint case are in general non-orthogonal, which differs from the conventional orthogonal BD precoder design for the MIMO-BC under one single sum-power constraint. Moreover, for the special case of single-antenna BSs and MSs, the proposed solution reduces to the optimal zero-forcing beamforming (ZF-BF) precoder design for the weighted sum-rate maximization in the multiple-input single-output (MISO) BC with per-antenna power constraints. Suboptimal and low-complexity BD/ZF-BF precoding schemes are also presented, and their achievable rates are compared against those with the optimal schemes.

preprint2010arXiv

Dynamic Resource Allocation in Cognitive Radio Networks: A Convex Optimization Perspective

This article provides an overview of the state-of-art results on communication resource allocation over space, time, and frequency for emerging cognitive radio (CR) wireless networks. Focusing on the interference-power/interference-temperature (IT) constraint approach for CRs to protect primary radio transmissions, many new and challenging problems regarding the design of CR systems are formulated, and some of the corresponding solutions are shown to be obtainable by restructuring some classic results known for traditional (non-CR) wireless networks. It is demonstrated that convex optimization plays an essential role in solving these problems, in a both rigorous and efficient way. Promising research directions on interference management for CR and other related multiuser communication systems are discussed.

preprint2010arXiv

On Active Learning and Supervised Transmission of Spectrum Sharing Based Cognitive Radios by Exploiting Hidden Primary Radio Feedback

This paper studies the wireless spectrum sharing between a pair of distributed primary radio (PR) and cognitive radio (CR) links. Assuming that the PR link adapts its transmit power and/or rate upon receiving an interference signal from the CR and such transmit adaptations are observable by the CR, this results in a new form of feedback from the PR to CR, refereed to as hidden PR feedback, whereby the CR learns the PR's strategy for transmit adaptations without the need of a dedicated feedback channel from the PR. In this paper, we exploit the hidden PR feedback to design new learning and transmission schemes for spectrum sharing based CRs, namely active learning and supervised transmission. For active learning, the CR initiatively sends a probing signal to interfere with the PR, and from the observed PR transmit adaptations the CR estimates the channel gain from its transmitter to the PR receiver, which is essential for the CR to control its interference to the PR during the subsequent data transmission. This paper proposes a new transmission protocol for the CR to implement the active learning and the solutions to deal with various practical issues for implementation, such as time synchronization, rate estimation granularity, power measurement noise, and channel variation. Furthermore, with the acquired knowledge from active learning, the CR designs a supervised data transmission by effectively controlling the interference powers both to and from the PR, so as to achieve the optimum performance tradeoffs for the PR and CR links. Numerical results are provided to evaluate the effectiveness of the proposed schemes for CRs under different system setups.

preprint2010arXiv

On Design of Collaborative Beamforming for Two-Way Relay Networks

We consider a two-way relay network, where two source nodes, S1 and S2, exchange information through a cluster of relay nodes. The relay nodes receive the sum signal from S1 and S2 in the first time slot. In the second time slot, each relay node multiplies its received signal by a complex coefficient and retransmits the signal to the two source nodes, which leads to a collaborative two-way beamforming system. By applying the principle of analog network coding, each receiver at S1 and S2 cancels the "self-interference" in the received signal from the relay cluster and decodes the message. This paper studies the 2-dimensional achievable rate region for such a two-way relay network with collaborative beamforming. With different assumptions of channel reciprocity between the source-relay and relay-source channels, the achievable rate region is characterized under two setups. First, with reciprocal channels, we investigate the achievable rate regions when the relay cluster is subject to a sum-power constraint or individual-power constraints. We show that the optimal beamforming vectors obtained from solving the weighted sum inverse-SNR minimization (WSISMin) problems are sufficient to characterize the corresponding achievable rate region. Furthermore, we derive the closed form solutions for those optimal beamforming vectors and consequently propose the partially distributed algorithms to implement the optimal beamforming, where each relay node only needs the local channel information and one global parameter. Second, with the non-reciprocal channels, the achievable rate regions are also characterized for both the sum-power constraint case and the individual-power constraint case. Although no closed-form solutions are available under this setup, we present efficient numerical algorithms.

preprint2010arXiv

On Design of Distributed Beamforming for Two-Way Relay Networks

We consider a two-way relay network, where two source nodes, S1 and S2, exchange information through a cluster of relay nodes. The relay nodes receive the sum signal from S1 and S2 in the first time slot. In the second time slot, each relay node multiplies its received signal by a complex coefficient and retransmits the signal to the two source nodes, which leads to a distributed two-way beamforming system. By applying the principle of analog network coding, each receiver at S1 and S2 cancels the ``self-interference'' in the received signal from the relay cluster and decodes the message. This paper studies the 2-dimensional achievable rate region for such a two-way relay network with distributed beamforming. With different assumptions of channel reciprocity between the source-relay and relay-source channels, the achievable rate region is characterized under two setups. First, with reciprocal channels, we investigate the achievable rate regions when the relay cluster is subject to a sum-power constraint or individual-power constraints. We show that the optimal beamforming vectors obtained from solving the weighted sum inverse-SNR minimization (WSISMin) problems are sufficient to characterize the corresponding achievable rate region. Furthermore, we derive the closed form solutions for those optimal beamforming vectors and consequently propose the partially distributed algorithms to implement the optimal beamforming, where each relay node only needs the local channel information and one global parameter. Second, with the non-reciprocal channels, the achievable rate regions are also characterized for both the sum-power constraint case and the individual-power constraint case. Although no closed-form solutions are available under this setup, we present efficient algorithms to compute the optimal beamforming vectors, which are attained by solving SDP problems after semi-definite relaxation.

preprint2010arXiv

Optimal Distributed Beamforming for MISO Interference Channels

We consider the problem of quantifying the Pareto optimal boundary in the achievable rate region over multiple-input single-output (MISO) interference channels, where the problem boils down to solving a sequence of convex feasibility problems after certain transformations. The feasibility problem is solved by two new distributed optimal beamforming algorithms, where the first one is to parallelize the computation based on the method of alternating projections, and the second one is to localize the computation based on the method of cyclic projections. Convergence proofs are established for both algorithms.

preprint2010arXiv

Slow light with a swept-frequency source

We introduce a new concept for stimulated-Brillouin-scattering-based slow light in optical fibers that is applicable for broadly-tunable frequency-swept sources. It allows slow light to be achieved, in principle, over the entire transparency window of the optical fiber. We demonstrate a slow light delay of 10 ns at 1550 nm using a 10-m-long photonic crystal fiber with a source sweep rate of 0.4 MHz/ns and a pump power of 200 mW. We also show that there exists a maximal delay obtainable by this method, which is set by the SBS threshold, independent of sweep rate. For our fiber with optimum length, this maximum delay is ~38 ns, obtained for a pump power of 760 mW.

preprint2009arXiv

Boolean Chaos

We observe deterministic chaos in a simple network of electronic logic gates that are not regulated by a clocking signal. The resulting power spectrum is ultra-wide-band, extending from dc to beyond 2 GHz. The observed behavior is reproduced qualitatively using an autonomously updating Boolean model with signal propagation times that depend on the recent history of the gates and filtering of pulses of short duration, whose presence is confirmed experimentally. Electronic Boolean chaos may find application as an ultra-wide-band source of radio waves

preprint2009arXiv

On Ergodic Sum Capacity of Fading Cognitive Multiple-Access and Broadcast Channels

This paper studies the information-theoretic limits of a secondary or cognitive radio (CR) network under spectrum sharing with an existing primary radio network. In particular, the fading cognitive multiple-access channel (C-MAC) is first studied, where multiple secondary users transmit to the secondary base station (BS) under both individual transmit-power constraints and a set of interference-power constraints each applied at one of the primary receivers. This paper considers the long-term (LT) or the short-term (ST) transmit-power constraint over the fading states at each secondary transmitter, combined with the LT or ST interference-power constraint at each primary receiver. In each case, the optimal power allocation scheme is derived for the secondary users to achieve the ergodic sum capacity of the fading C-MAC, as well as the conditions for the optimality of the dynamic time-division-multiple-access (D-TDMA) scheme in the secondary network. The fading cognitive broadcast channel (C-BC) that models the downlink transmission in the secondary network is then studied under the LT/ST transmit-power constraint at the secondary BS jointly with the LT/ST interference-power constraint at each of the primary receivers. It is shown that D-TDMA is indeed optimal for achieving the ergodic sum capacity of the fading C-BC for all combinations of transmit-power and interference-power constraints.

preprint2009arXiv

On the Origin of Chaos in Autonomous Boolean Networks

We undertake a systematic study of the dynamics of Boolean networks to determine the origin of chaos observed in recent experiments. Networks with nodes consisting of ideal logic gates are known to display either steady states, periodic behavior, or an ultraviolet catastrophe where the number of logic-transition events circulating in the network per unit time grows as a power-law. In an experiment, non-ideal behavior of the logic gates prevents the ultraviolet catastrophe and may lead to deterministic chaos. We identify certain non-ideal features of real logic gates that enable chaos in experimental networks. We find that short-pulse rejection and the asymmetry between the logic states tends to engender periodic behavior, at least for the simplest networks. On the other hand, we find that a memory effect termed "degradation" can generate chaos. Our results strongly suggest that deterministic chaos can be expected in a large class of experimental Boolean-like networks. Such devices may find application in a variety of technologies requiring fast complex waveforms or flat power spectra, and can be used as a test-bed for fundamental studies of real-world Boolean-like networks.

preprint2009arXiv

Outage Capacity and Optimal Transmission for Dying Channels

In wireless networks, communication links may be subject to random fatal impacts: for example, sensor networks under sudden power losses or cognitive radio networks with unpredictable primary user spectrum occupancy. Under such circumstances, it is critical to quantify how fast and reliably the information can be collected over attacked links. For a single point-to-point channel subject to a random attack, named as a \emph{dying channel}, we model it as a block-fading (BF) channel with a finite and random delay constraint. First, we define the outage capacity as the performance measure, followed by studying the optimal coding length $K$ such that the outage probability is minimized when uniform power allocation is assumed. For a given rate target and a coding length $K$, we then minimize the outage probability over the power allocation vector $\mv{P}_{K}$, and show that this optimization problem can be cast into a convex optimization problem under some conditions. The optimal solutions for several special cases are discussed. Furthermore, we extend the single point-to-point dying channel result to the parallel multi-channel case where each sub-channel is a dying channel, and investigate the corresponding asymptotic behavior of the overall outage probability with two different attack models: the independent-attack case and the $m$-dependent-attack case. It can be shown that the overall outage probability diminishes to zero for both cases as the number of sub-channels increases if the \emph{rate per unit cost} is less than a certain threshold. The outage exponents are also studied to reveal how fast the outage probability improves over the number of sub-channels.

preprint2008arXiv

A model of HIV budding and self-assembly, role of cell membrane

Budding from the plasma membrane of the host cell is an indispensable step in the life cycle of the Human Immunodeficiency Virus (HIV), which belongs to a large family of enveloped RNA viruses, retroviruses. Unlike regular enveloped viruses, retrovirus budding happens {\em concurrently} with the self-assembly of retrovirus protein subunits (Gags) into spherical virus capsids on the cell membrane. Led by this unique budding and assembly mechanism, we study the free energy profile of retrovirus budding, taking into account of the Gag-Gag attraction energy and the membrane elastic energy. We find that if the Gag-Gag attraction is strong, budding always proceeds to completion. During early stage of budding, the zenith angle of partial budded capsids, $α$, increases with time as $α\propto t^{1/3}$. However, when Gag-Gag attraction is weak, a metastable state of partial budding appears. The zenith angle of these partially spherical capsids is given by $α_0\simeq(τ^2/κσ)^{1/4}$ in a linear approximation, where $κ$ and $σ$ are the bending modulus and the surface tension of the membrane, and $τ$ is a line tension of the capsid proportional to the strength of Gag-Gag attraction. Numerically, we find $α_0<0.3π$ without any approximations. Using experimental parameters, we show that HIV budding and assembly always proceed to completion in normal biological conditions. On the other hand, by changing Gag-Gag interaction strength or membrane rigidity, it is relatively easy to tune it back and forth between complete budding and partial budding. Our model agrees reasonably well with experiments observing partial budding of retroviruses including HIV.

preprint2008arXiv

Optimal Power Allocation for Fading Channels in Cognitive Radio Networks: Ergodic Capacity and Outage Capacity

A cognitive radio network (CRN) is formed by either allowing the secondary users (SUs) in a secondary communication network (SCN) to opportunistically operate in the frequency bands originally allocated to a primary communication network (PCN) or by allowing SCN to coexist with the primary users (PUs) in PCN as long as the interference caused by SCN to each PU is properly regulated. In this paper, we consider the latter case, known as spectrum sharing, and study the optimal power allocation strategies to achieve the ergodic capacity and the outage capacity of the SU fading channel under different types of power constraints and fading channel models. In particular, besides the interference power constraint at PU, the transmit power constraint of SU is also considered. Since the transmit power and the interference power can be limited either by a peak or an average constraint, various combinations of power constraints are studied. It is shown that there is a capacity gain for SU under the average over the peak transmit/interference power constraint. It is also shown that fading for the channel between SU transmitter and PU receiver is usually a beneficial factor for enhancing the SU channel capacities.

preprint2007arXiv

Electrostatic theory of viral self-assembly: a toy model

Viruses self-assemble from identical capsid proteins and their genome consisting, for example, of a long single stranded (ss) RNA. For a big class of T = 3 viruses capsid proteins have long positive N-terminal tails. We explore the role played by the Coulomb interaction between the brush of positive N-terminal tails rooted at the inner surface of the capsid and the negative ss RNA molecule. We show that viruses are most stable when the total contour length of ss RNA is close to the total length of the tails. For such a structure the absolute value of the total RNA charge is approximately twice larger than the charge of the capsid. This conclusion agrees with structural data.

Institution

Affiliation not imported yet

This author record came from a source that does not expose affiliation metadata. Once the author claims the profile or we enrich the record from another provider, this section will link to the concrete institution.

Source provenance

Where this author record came from

arxivconfidence 95%

external id: arxiv:2507.01624:author:7:rui-zhang

Imported May 21, 2026Synced May 21, 2026

arxivconfidence 95%

external id: arxiv:2410.08988:author:287:rui-zhang

Imported May 21, 2026Synced May 21, 2026

arxivconfidence 95%

external id: arxiv:2504.19091:author:12:rui-zhang

Imported May 21, 2026Synced May 21, 2026

arxivconfidence 95%

external id: arxiv:2605.04474:author:6:rui-zhang