Catalog footprint

What is connected

38works
29topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

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.

Published work

38 published item(s)

preprint2026arXiv

DSIPA: Detecting LLM-Generated Texts via Sentiment-Invariant Patterns Divergence Analysis

The rapid advancement of large language models (LLMs) presents new security challenges, particularly in detecting machine-generated text used for misinformation, impersonation, and content forgery. Most existing detection approaches struggle with robustness against adversarial perturbation, paraphrasing attacks, and domain shifts, often requiring restrictive access to model parameters or large labeled datasets. To address this, we propose DSIPA, a novel training-free framework that detects LLM-generated content by quantifying sentiment distributional stability under controlled stylistic variation. It is based on the observation that LLMs typically exhibit more emotionally consistent outputs, while human-written texts display greater affective variation. Our framework operates in a zero-shot, black-box manner, leveraging two unsupervised metrics, sentiment distribution consistency and sentiment distribution preservation, to capture these intrinsic behavioral asymmetries without the need for parameter updates or probability access. Extensive experiments are conducted on state-of-the-art proprietary and open-source models, including GPT-5.2, Gemini-1.5-pro, Claude-3, and LLaMa-3.3. Evaluations on five domains, such as news articles, programming code, student essays, academic papers, and community comments, demonstrate that DSIPA improves F1 detection scores by up to 49.89% over baseline methods. The framework exhibits superior generalizability across domains and strong resilience to adversarial conditions, providing a robust and interpretable behavioral signal for secure content identification in the evolving LLM landscape.

preprint2022arXiv

3D-TSV: The 3D Trajectory-based Stress Visualizer

We present the 3D Trajectory-based Stress Visualizer (3D-TSV), a visual analysis tool for the exploration of the principal stress directions in 3D solids under load. 3D-TSV provides a modular and generic implementation of key algorithms required for a trajectory-based visual analysis of principal stress directions, including the automatic seeding of space-filling stress lines, their extraction using numerical schemes, their mapping to an effective renderable representation, and rendering options to convey structures with special mechanical properties. In the design of 3D-TSV, several perceptual challenges have been addressed when simultaneously visualizing three mutually orthogonal stress directions via lines. We present a novel algorithm for generating a space-filling and evenly spaced set of mutually orthogonal lines. The algorithm further considers the locations of lines to obtain a more regular appearance, and enables the extraction of a level-of-detail representation with adjustable sparseness of the trajectories along a certain stress direction. To convey ambiguities in the orientation of the principal stress directions, the user can select a combined visualization of two principal directions via oriented ribbons. Additional depth cues improve the perception of the spatial relationships between trajectories. 3D-TSV is accessible to end users via a C++- and OpenGL-based rendering frontend that is seamlessly connected to a MatLab-based extraction backend. The code (BSD license) of 3D-TSV as well as scripts to make ANSYS and ABAQUS simulation results accessible to the 3D-TSV backend are publicly available.

preprint2022arXiv

A Streamline-guided De-Homogenization Approach for Structural Design

We present a novel de-homogenization approach for efficient design of high-resolution load-bearing structures. The proposed approach builds upon a streamline-based parametrization of the design domain, using a set of space-filling and evenly-spaced streamlines in the two mutually orthogonal direction fields that are obtained from homogenization-based topology optimization. Streamlines in these fields are converted into a graph, which is then used to construct a quad-dominant mesh whose edges follow the direction fields. In addition, the edge width is adjusted according to the density and anisotropy of the optimized orthotropic cells. In a number of numerical examples, we demonstrate the mechanical performance and regular appearance of the resulting structural designs, and compare them with those from classic and contemporary approaches.

preprint2022arXiv

A Unified Meta-Learning Framework for Dynamic Transfer Learning

Transfer learning refers to the transfer of knowledge or information from a relevant source task to a target task. However, most existing works assume both tasks are sampled from a stationary task distribution, thereby leading to the sub-optimal performance for dynamic tasks drawn from a non-stationary task distribution in real scenarios. To bridge this gap, in this paper, we study a more realistic and challenging transfer learning setting with dynamic tasks, i.e., source and target tasks are continuously evolving over time. We theoretically show that the expected error on the dynamic target task can be tightly bounded in terms of source knowledge and consecutive distribution discrepancy across tasks. This result motivates us to propose a generic meta-learning framework L2E for modeling the knowledge transferability on dynamic tasks. It is centered around a task-guided meta-learning problem with a group of meta-pairs of tasks, based on which we are able to learn the prior model initialization for fast adaptation on the newest target task. L2E enjoys the following properties: (1) effective knowledge transferability across dynamic tasks; (2) fast adaptation to the new target task; (3) mitigation of catastrophic forgetting on historical target tasks; and (4) flexibility in incorporating any existing static transfer learning algorithms. Extensive experiments on various image data sets demonstrate the effectiveness of the proposed L2E framework.

preprint2022arXiv

Adaptive Transfer Learning for Plant Phenotyping

Plant phenotyping (Guo et al. 2021; Pieruschka et al. 2019) focuses on studying the diverse traits of plants related to the plants' growth. To be more specific, by accurately measuring the plant's anatomical, ontogenetical, physiological and biochemical properties, it allows identifying the crucial factors of plants' growth in different environments. One commonly used approach is to predict the plant's traits using hyperspectral reflectance (Yendrek et al. 2017; Wang et al. 2021). However, the data distributions of the hyperspectral reflectance data in plant phenotyping might vary in different environments for different plants. That is, it would be computationally expansive to learn the machine learning models separately for one plant in different environments. To solve this problem, we focus on studying the knowledge transferability of modern machine learning models in plant phenotyping. More specifically, this work aims to answer the following questions. (1) How is the performance of conventional machine learning models, e.g., partial least squares regression (PLSR), Gaussian process regression (GPR) and multi-layer perceptron (MLP), affected by the number of annotated samples for plant phenotyping? (2) Whether could the neural network based transfer learning models improve the performance of plant phenotyping? (3) Could the neural network based transfer learning be improved by using infinite-width hidden layers for plant phenotyping?

preprint2022arXiv

Cost-effective Network Disintegration through Targeted Enumeration

Finding an optimal subset of nodes or links to disintegrate harmful networks is a fundamental problem in network science, with potential applications to anti-terrorism, epidemic control, and many other fields of study. The challenge of the network disintegration problem is to balance the effectiveness and efficiency of strategies. In this paper, we propose a cost-effective targeted enumeration method for network disintegration. The proposed approach includes two stages: searching for candidate objects and identifying an optimal solution. In the first stage, we use rank aggregation to generate a comprehensive ranking of node importance, upon which we identify a small-scale candidate set of nodes to remove. In the second stage, we use an enumeration method to find an optimal combination among the candidate nodes. Extensive experimental results on synthetic and real-world networks demonstrate that the proposed method achieves a satisfying trade-off between effectiveness and efficiency. The introduced two-stage targeted enumeration framework can also be applied to other computationally intractable combinational optimization problems, from team assembly via portfolio investment to drug design.

preprint2022arXiv

LiDAR-Inertial 3D SLAM with Plane Constraint for Multi-story Building

The ubiquitous planes and structural consistency are the most apparent features of indoor multi-story Buildings compared with outdoor environments. In this paper, we propose a tightly coupled LiDAR-Inertial 3D SLAM framework with plane features for the multi-story building. The framework we proposed is mainly composed of three parts: tightly coupled LiDAR-Inertial odometry, extraction of representative planes of the structure, and factor graph optimization. By building a local map and inertial measurement unit (IMU) pre-integration, we get LiDAR scan-to-local-map matching and IMU measurements, respectively. Minimize the joint cost function to obtain the LiDAR-Inertial odometry information. Once a new keyframe is added to the graph, all the planes of this keyframe that can represent structural features are extracted to find the constraint between different poses and stories. A keyframe-based factor graph is conducted with the constraint of planes, and LiDAR-Inertial odometry for keyframe poses refinement. The experimental results show that our algorithm has outstanding performance in accuracy compared with the state-of-the-art algorithms.

preprint2022arXiv

OpenFish: Biomimetic Design of a Soft Robotic Fish for High Speed Locomotion

We present OpenFish: an open source soft robotic fish which is optimized for speed and efficiency. The soft robotic fish uses a combination of an active and passive tail segment to accurately mimic the thunniform swimming mode. Through the implementation of a novel propulsion system that is capable of achieving higher oscillation frequencies with a more sinusoidal waveform, the open source soft robotic fish achieves a top speed of $0.85~\mathrm{m/s}$. Hereby, it outperforms the previously reported fastest soft robotic fish by $27\%$. Besides the propulsion system, the optimization of the fish morphology played a crucial role in achieving this speed. In this work, a detailed description of the design, construction and customization of the soft robotic fish is presented. Hereby, we hope this open source design will accelerate future research and developments in soft robotic fish.

preprint2022arXiv

Towards Two-view 6D Object Pose Estimation: A Comparative Study on Fusion Strategy

Current RGB-based 6D object pose estimation methods have achieved noticeable performance on datasets and real world applications. However, predicting 6D pose from single 2D image features is susceptible to disturbance from changing of environment and textureless or resemblant object surfaces. Hence, RGB-based methods generally achieve less competitive results than RGBD-based methods, which deploy both image features and 3D structure features. To narrow down this performance gap, this paper proposes a framework for 6D object pose estimation that learns implicit 3D information from 2 RGB images. Combining the learned 3D information and 2D image features, we establish more stable correspondence between the scene and the object models. To seek for the methods best utilizing 3D information from RGB inputs, we conduct an investigation on three different approaches, including Early- Fusion, Mid-Fusion, and Late-Fusion. We ascertain the Mid- Fusion approach is the best approach to restore the most precise 3D keypoints useful for object pose estimation. The experiments show that our method outperforms state-of-the-art RGB-based methods, and achieves comparable results with RGBD-based methods.

preprint2021arXiv

A Universal Model for Cross Modality Mapping by Relational Reasoning

With the aim of matching a pair of instances from two different modalities, cross modality mapping has attracted growing attention in the computer vision community. Existing methods usually formulate the mapping function as the similarity measure between the pair of instance features, which are embedded to a common space. However, we observe that the relationships among the instances within a single modality (intra relations) and those between the pair of heterogeneous instances (inter relations) are insufficiently explored in previous approaches. Motivated by this, we redefine the mapping function with relational reasoning via graph modeling, and further propose a GCN-based Relational Reasoning Network (RR-Net) in which inter and intra relations are efficiently computed to universally resolve the cross modality mapping problem. Concretely, we first construct two kinds of graph, i.e., Intra Graph and Inter Graph, to respectively model intra relations and inter relations. Then RR-Net updates all the node features and edge features in an iterative manner for learning intra and inter relations simultaneously. Last, RR-Net outputs the probabilities over the edges which link a pair of heterogeneous instances to estimate the mapping results. Extensive experiments on three example tasks, i.e., image classification, social recommendation and sound recognition, clearly demonstrate the superiority and universality of our proposed model.

preprint2021arXiv

Cache Placement Optimization in Mobile Edge Computing Networks with Unaware Environment -- An Extended Multi-armed Bandit Approach

Caching high-frequency reuse contents at the edge servers in the mobile edge computing (MEC) network omits the part of backhaul transmission and further releases the pressure of data traffic. However, how to efficiently decide the caching contents for edge servers is still an open problem, which refers to the cache capacity of edge servers, the popularity of each content, and the wireless channel quality during transmission. In this paper, we discuss the influence of unknown user density and popularity of content on the cache placement solution at the edge server. Specifically, towards the implementation of the cache placement solution in the practical network, there are two problems needing to be solved. First, the estimation of unknown users' preference needs a huge amount of records of users' previous requests. Second, the overlapping serving regions among edge servers cause the wrong estimation of users' preference, which hinders the individual decision of caching placement. To address the first issue, we propose a learning-based solution to adaptively optimize the cache placement policy. We develop the extended multi-armed bandit (Extended MAB), which combines the generalized global bandit (GGB) and Standard Multi-armed bandit (MAB). For the second problem, a multi-agent Extended MAB-based solution is presented to avoid the mis-estimation of parameters and achieve the decentralized cache placement policy. The proposed solution determines the primary time slot and secondary time slot for each edge server. The proposed strategies are proven to achieve the bounded regret according to the mathematical analysis. Extensive simulations verify the optimality of the proposed strategies when comparing with baselines.

preprint2021arXiv

Diophantine analysis of the expansions of a fixed point under continuum many bases

In this paper, we study the Diophantine properties of the orbits of a fixed point in its expansions under continuum many bases. More precisely, let $T_β$ be the beta-transformation with base $β>1$, $\{x_{n}\}_{n\geq 1}$ be a sequence of real numbers in $[0,1]$ and $φ\colon \mathbb{N}\rightarrow (0,1]$ be a positive function. With a detailed analysis on the distribution of {\em full cylinders} in the base space $\{β>1\}$, it is shown that for any given $x\in(0,1]$, for almost all or almost no bases $β>1$, the orbit of $x$ under $T_β$ can $φ$-well approximate the sequence $\{x_{n}\}_{n\geq 1}$ according to the divergence or convergence of the series $\sum φ(n)$. This strengthens Schmeling's result significantly and complete all known results in this aspect. Moreover, the idea presented here can also be used to determine the Lebesgue measure of the set \begin{equation*} \{x\in [0,1]\colon|T^{n}_βx-L(x)|<φ(n) \text{ for infinitely many } n\in\mathbb{N}\}, \end{equation*} for a fixed base $β>1$, where $L\colon [0,1]\rightarrow[0,1]$ is a Lipschitz function.

preprint2021arXiv

Mahler's question for intrinsic Diophantine approximation on triadic Cantor set: the divergence theory

In this paper, we consider the intrinsic Diophantine approximation on the triadic Cantor set $\mathcal{K}$, i.e. approximating the points in $\mathcal{K}$ by rational numbers inside $\mathcal{K}$, a question posed by K. Mahler. By using another height function of a rational number in $\mathcal{K}$, i.e. the denominator obtained from its periodic 3-adic expansion, a complete metric theory for this variant intrinsic Diophantine approximation is presented which yields the divergence theory of Mahler's original question.

preprint2021arXiv

QoS-Driven Resource Optimization for Intelligent Fog Radio Access Network: A Dynamic Power Allocation Perspective

The fog radio access network (Fog-RAN) has been considered a promising wireless access architecture to help shorten the communication delay and relieve the large data delivery burden over the backhaul links. However, limited by conventional inflexible communication design, Fog-RAN cannot be used in some complex communication scenarios. In this study, we focus on investigating a more intelligent Fog-RAN to assist the communication in a high-speed railway environment. Due to the train's continuously moving, the communication should be designed intelligently to adapt to channel variation. Specifically, we dynamically optimize the power allocation in the remote radio heads (RRHs) to minimize the total network power cost considering multiple quality-of-service (QoS) requirements and channel variation. The impact of caching on the power allocation is considered. The dynamic power optimization is analyzed to obtain a closed-form solution in certain cases. The inherent tradeoff among the total network cost, delay and delivery content size is further discussed. To evaluate the performance of the proposed dynamic power allocation, we present an invariant power allocation counterpart as a performance comparison benchmark. The result of our simulation reveals that dynamic power allocation can significantly outperform the invariant power allocation scheme, especially with a random caching strategy or limited caching resources at the RRHs.

preprint2021arXiv

REDE: End-to-end Object 6D Pose Robust Estimation Using Differentiable Outliers Elimination

Object 6D pose estimation is a fundamental task in many applications. Conventional methods solve the task by detecting and matching the keypoints, then estimating the pose. Recent efforts bringing deep learning into the problem mainly overcome the vulnerability of conventional methods to environmental variation due to the hand-crafted feature design. However, these methods cannot achieve end-to-end learning and good interpretability at the same time. In this paper, we propose REDE, a novel end-to-end object pose estimator using RGB-D data, which utilizes network for keypoint regression, and a differentiable geometric pose estimator for pose error back-propagation. Besides, to achieve better robustness when outlier keypoint prediction occurs, we further propose a differentiable outliers elimination method that regresses the candidate result and the confidence simultaneously. Via confidence weighted aggregation of multiple candidates, we can reduce the effect from the outliers in the final estimation. Finally, following the conventional method, we apply a learnable refinement process to further improve the estimation. The experimental results on three benchmark datasets show that REDE slightly outperforms the state-of-the-art approaches and is more robust to object occlusion.

preprint2021arXiv

Stress Topology Analysis for Porous Infill Optimization

The optimization of porous infill structures via local volume constraints has become a popular approach in topology optimization. In some design settings, however, the iterative optimization process converges only slowly, or not at all even after several hundreds or thousands of iterations. This leads to regions in which a distinct binary design is difficult to achieve. Interpreting intermediate density values by applying a threshold results in large solid or void regions, leading to sub-optimal structures. We find that this convergence issue relates to the topology of the stress tensor field that is simulated when applying the same external forces on the solid design domain. In particular, low convergence is observed in regions around so-called trisector degenerate points. Based on this observation, we propose an automatic initialization process that prescribes the topological skeleton of the stress field into the material field as solid simulation elements. These elements guide the material deposition around the degenerate points, but can also be remodelled or removed during the optimization. We demonstrate significantly improved convergence rates in a number of use cases with complex stress topologies. The improved convergence is demonstrated for infill optimization under homogeneous as well as spatially varying local volume constraints.

preprint2020arXiv

A framework for adaptive width control of dense contour-parallel toolpaths in fused deposition modeling

3D printing techniques such as Fused Deposition Modeling (FDM) have enabled the fabrication of complex geometry quickly and cheaply. High stiffness parts are produced by filling the 2D polygons of consecutive layers with contour-parallel extrusion toolpaths. Uniform width toolpaths consisting of inward offsets from the outline polygons produce over- and underfill regions in the center of the shape, which are especially detrimental to the mechanical performance of thin parts. In order to fill shapes with arbitrary diameter densely the toolpaths require adaptive width. Existing approaches for generating toolpaths with adaptive width result in a large variation in widths, which for some hardware systems is difficult to realize accurately. In this paper we present a framework which supports multiple schemes to generate toolpaths with adaptive width, by employing a function to decide the number of beads and their widths. Furthermore, we propose a novel scheme which reduces extreme bead widths, while limiting the number of altered toolpaths. We statistically validate the effectiveness of our framework and this novel scheme on a data set of representative 3D models, and physically validate it by developing a technique, called back pressure compensation, for off-the-shelf FDM systems to effectively realize adaptive width.

preprint2020arXiv

A PXI-based Multi-channel Data Acquisition System for Fast Transient Pulses

In this paper, we design a PXI-based, multi-channel data-acquisition system (DAS) mainly applicable to recording one-shot fast transient pulses in nuclear physics experiments. The system consists of one NI PXIe-1085 chassis, containing a controller card and at most 16 data-acquisition (DAQ) cards. Every single DAQ card has a sampling rate of 1GS/s and a 12bit vertical resolution with the PXI interface and SFP+ transceiver for data transmission. When the system is put into operation near the pulsed radiation source, the SFP+ optical fiber channel enables a timely data transmission to a remote server. All of these cards in the chassis can be synchronized using PXI timing and triggering resources. Additionally, a simple DAS software is developed to display the pulsed signals captured and communicate with the host PC for remote control and data upload. After careful calibration, preliminary tests show that every DAQ channel achieves an analog bandwidth higher than 200MHz and an ENOB of more than 9 bits at a 1GS/s sampling rate. Owing to such high speed and resolution, the system may facilitate improvements in extracting maximum information from transient signals. Furthermore, with great scalability and high-speed data transmission, the system can be used for other nuclear physics experiments.

preprint2020arXiv

Adaptive Distributed Laser Charging for Efficient Wireless Power Transfer

Distributed laser charging (DLC) is a wireless power transfer technology for mobile electronics. Similar to traditional wireless charging systems, the DLC system can only provide constant power to charge a battery. However, Li-ion battery needs dynamic input current and voltage, thus power, in order to optimize battery charging performance. Therefore, neither power transmission efficiency nor battery charging performance can be optimized by the DLC system. We at first propose an adaptive DLC (ADLC) system to optimize wireless power transfer efficiency and battery charging performance. Then, we analyze ADLC's power conversion to depict the adaptation mechanism. Finally, we evaluate the ADLC's power conversion performance by simulation, which illustrates its efficiency improvement by saving at least 60.4% of energy, comparing with the fixed-power charging system.

preprint2020arXiv

Continuous Transfer Learning with Label-informed Distribution Alignment

Transfer learning has been successfully applied across many high-impact applications. However, most existing work focuses on the static transfer learning setting, and very little is devoted to modeling the time evolving target domain, such as the online reviews for movies. To bridge this gap, in this paper, we study a novel continuous transfer learning setting with a time evolving target domain. One major challenge associated with continuous transfer learning is the potential occurrence of negative transfer as the target domain evolves over time. To address this challenge, we propose a novel label-informed C-divergence between the source and target domains in order to measure the shift of data distributions as well as to identify potential negative transfer. We then derive the error bound for the target domain using the empirical estimate of our proposed C-divergence. Furthermore, we propose a generic adversarial Variational Auto-encoder framework named TransLATE by minimizing the classification error and C-divergence of the target domain between consecutive time stamps in a latent feature space. In addition, we define a transfer signature for characterizing the negative transfer based on C-divergence, which indicates that larger C-divergence implies a higher probability of negative transfer in real scenarios. Extensive experiments on synthetic and real data sets demonstrate the effectiveness of our TransLATE framework.

preprint2020arXiv

Leveraging AI and Intelligent Reflecting Surface for Energy-Efficient Communication in 6G IoT

The ever-increasing data traffic, various delay-sensitive services, and the massive deployment of energy-limited Internet of Things (IoT) devices have brought huge challenges to the current communication networks, motivating academia and industry to move to the sixth-generation (6G) network. With the powerful capability of data transmission and processing, 6G is considered as an enabler for IoT communication with low latency and energy cost. In this paper, we propose an artificial intelligence (AI) and intelligent reflecting surface (IRS) empowered energy-efficiency communication system for 6G IoT. First, we design a smart and efficient communication architecture including the IRS-aided data transmission and the AI-driven network resource management mechanisms. Second, an energy efficiency-maximizing model under given transmission latency for 6G IoT system is formulated, which jointly optimizes the settings of all communication participants, i.e. IoT transmission power, IRS-reflection phase shift, and BS detection matrix. Third, a deep reinforcement learning (DRL) empowered network resource control and allocation scheme is proposed to solve the formulated optimization model. Based on the network and channel status, the DRL-enabled scheme facilities the energy-efficiency and low-latency communication. Finally, experimental results verified the effectiveness of our proposed communication system for 6G IoT.

preprint2020arXiv

Progressive DARTS: Bridging the Optimization Gap for NAS in the Wild

With the rapid development of neural architecture search (NAS), researchers found powerful network architectures for a wide range of vision tasks. However, it remains unclear if the searched architecture can transfer across different types of tasks as manually designed ones did. This paper puts forward this problem, referred to as NAS in the wild, which explores the possibility of finding the optimal architecture in a proxy dataset and then deploying it to mostly unseen scenarios. We instantiate this setting using a currently popular algorithm named differentiable architecture search (DARTS), which often suffers unsatisfying performance while being transferred across different tasks. We argue that the accuracy drop originates from the formulation that uses a super-network for search but a sub-network for re-training. The different properties of these stages have resulted in a significant optimization gap, and consequently, the architectural parameters "over-fit" the super-network. To alleviate the gap, we present a progressive method that gradually increases the network depth during the search stage, which leads to the Progressive DARTS (P-DARTS) algorithm. With a reduced search cost (7 hours on a single GPU), P-DARTS achieves improved performance on both the proxy dataset (CIFAR10) and a few target problems (ImageNet classification, COCO detection and three ReID benchmarks). Our code is available at \url{https://github.com/chenxin061/pdarts}.

preprint2020arXiv

Structure Learning for Cyclic Linear Causal Models

We consider the problem of structure learning for linear causal models based on observational data. We treat models given by possibly cyclic mixed graphs, which allow for feedback loops and effects of latent confounders. Generalizing related work on bow-free acyclic graphs, we assume that the underlying graph is simple. This entails that any two observed variables can be related through at most one direct causal effect and that (confounding-induced) correlation between error terms in structural equations occurs only in absence of direct causal effects. We show that, despite new subtleties in the cyclic case, the considered simple cyclic models are of expected dimension and that a previously considered criterion for distributional equivalence of bow-free acyclic graphs has an analogue in the cyclic case. Our result on model dimension justifies in particular score-based methods for structure learning of linear Gaussian mixed graph models, which we implement via greedy search.

preprint2016arXiv

Load Coupling Power Optimization in Cloud Radio Access Networks

Recently, Cloud-based Radio Access Network (C-RAN) has been proposed as a potential solution to reduce energy cost in cellular networks. C-RAN centralizes the baseband processing capabilities of Base Stations (BSs) in a cloud computing platform in the form of BaseBand Unit (BBU) pool. In C-RAN, power consumed by the traditional BS system is distributed as wireless transmission power of the Remote Radio Heads (RRHs) and baseband processing power of the BBU pool. Different from previous work where wireless transmission power and baseband processing power are optimized individually and independently, this paper focuses on joint optimization of allocation for these two kinds of power and attempts to minimize the total power consumption subject to Quality of Service (QoS) requirements from users in terms of data rates. First, we exploit the load coupling model to express the coupling relations among power, load and user data rates. Based on the load coupling mode, we formulate the joint power optimization problem in C-RAN over both wireless transmission power and baseband processing power. Second, we prove that operating at full load may not be optimal in minimizing the total power consumption in C-RAN. Finally, we propose an efficient iterative algorithm to solve the target problem. Simulations have been performed to validate our theoretical and algorithmic work. The results show that the proposed algorithm outperforms existing schemes (without joint power optimization) in terms of power consumption.

preprint2016arXiv

Perceptual uniform descriptor and Ranking on manifold: A bridge between image representation and ranking for image retrieval

Incompatibility of image descriptor and ranking is always neglected in image retrieval. In this paper, manifold learning and Gestalt psychology theory are involved to solve the incompatibility problem. A new holistic descriptor called Perceptual Uniform Descriptor (PUD) based on Gestalt psychology is proposed, which combines color and gradient direction to imitate the human visual uniformity. PUD features in the same class images distributes on one manifold in most cases because PUD improves the visual uniformity of the traditional descriptors. Thus, we use manifold ranking and PUD to realize image retrieval. Experiments were carried out on five benchmark data sets, and the proposed method can greatly improve the accuracy of image retrieval. Our experimental results in the Ukbench and Corel-1K datasets demonstrated that N-S score reached to 3.58 (HSV 3.4) and mAP to 81.77% (ODBTC 77.9%) respectively by utilizing PUD which has only 280 dimension. The results are higher than other holistic image descriptors (even some local ones) and state-of-the-arts retrieval methods.

preprint2016arXiv

Three Tiers Neighborhood Graph and Multi-graph Fusion Ranking for Multi-feature Image Retrieval: A Manifold Aspect

Single feature is inefficient to describe content of an image, which is a shortcoming in traditional image retrieval task. We know that one image can be described by different features. Multi-feature fusion ranking can be utilized to improve the ranking list of query. In this paper, we first analyze graph structure and multi-feature fusion re-ranking from manifold aspect. Then, Three Tiers Neighborhood Graph (TTNG) is constructed to re-rank the original ranking list by single feature and to enhance precision of single feature. Furthermore, we propose Multi-graph Fusion Ranking (MFR) for multi-feature ranking, which considers the correlation of all images in multiple neighborhood graphs. Evaluations are conducted on UK-bench, Corel-1K, Corel-10K and Cifar-10 benchmark datasets. The experimental results show that our TTNG and MFR outperform than other state-of-the-art methods. For example, we achieve competitive results N-S score 3.91 and precision 65.00% on UK-bench and Corel-10K datasets respectively.

preprint2014arXiv

Distributed Interference-Aware Energy-Efficient Resource Allocation for Device-to-Device Communications Underlaying Cellular Networks

The introduction of device-to-device (D2D) into cellular networks poses many new challenges in the resource allocation design due to the co-channel interference caused by spectrum reuse and limited battery life of user equipments (UEs). In this paper, we propose a distributed interference-aware energy-efficient resource allocation algorithm to maximize each UE's energy efficiency (EE) subject to its specific quality of service (QoS) and maximum transmission power constraints. We model the resource allocation problem as a noncooperative game, in which each player is self-interested and wants to maximize its own EE. The formulated EE maximization problem is a non-convex problem and is transformed into a convex optimization problem by exploiting the properties of the nonlinear fractional programming. An iterative optimization algorithm is proposed and verified through computer simulations.

preprint2014arXiv

Energy Efficiency and Spectral Efficiency Tradeoff in Device-to-Device (D2D) Communications

In this letter, we investigate the tradeoff between energy efficiency (EE) and spectral efficiency (SE) in device-to-device (D2D) communications underlaying cellular networks with uplink channel reuse. The resource allocation problem is modeled as a noncooperative game, in which each user equipment (UE) is self-interested and wants to maximize its own EE. Given the SE requirement and maximum transmission power constraints, a distributed energy-efficient resource allocation algorithm is proposed by exploiting the properties of the nonlinear fractional programming. The relationships between the EE and SE tradeoff of the proposed algorithm and system parameters are analyzed and verified through computer simulations.

preprint2013arXiv

Diophantine approximation of the orbit of 1 in the dynamical system of bete expansions

We consider the distribution of the orbits of the number 1 under the $β$-transformations $T_β$ as $β$ varies. Mainly, the size of the set of $β>1$ for which a given point can be well approximated by the orbit of 1 is measured by its Hausdorff dimension. That is, the dimension of the following set $$ E\big({\ell_n}_{n\ge 1}, x_0\big)=\Big{β>1: |T^n_β1-x_0|<β^{-\ell_n}, {for infinitely many} n\in \N\Big} $$ is determined, where $x_0$ is a given point in $[0,1]$ and ${\ell_n}_{n\ge 1}$ is a sequence of integers tending to infinity as $n\to \infty$. For the proof of this result, the notion of the recurrence time of a word in symbolic space is introduced to characterize the lengths and the distribution of cylinders (the set of $β$ with a common prefix in the expansion of 1) in the parameter space ${β\in \R: β>1}$.

preprint2013arXiv

Range-Renewal Structure in Continued Fractions

Let $ω=[a_1, a_2, \cdots]$ be the infinite expansion of continued fraction for an irrational number $ω\in (0,1)$; let $R_n (ω)$ (resp. $R_{n, \, k} (ω)$, $R_{n, \, k+} (ω)$) be the number of distinct partial quotients each of which appears at least once (resp. exactly $k$ times, at least $k$ times) in the sequence $a_1, \cdots, a_n$. In this paper it is proved that for Lebesgue almost all $ω\in (0,1)$ and all $k \geq 1$, $$ \displaystyle \lim_{n \to \infty} \frac{R_n (ω)}{\sqrt{n}}=\sqrt{\fracπ{\log 2}}, \quad \lim_{n \to \infty} \frac{R_{n, \, k} (ω)}{R_n (ω)}=\frac{C_{2 k}^k}{(2k-1) \cdot 4^k}, \quad \lim_{n \to \infty} \frac{R_{n, \, k} (ω)}{R_{n, \, k+} (ω)}=\frac{1}{2k}. $$ The Hausdorff dimensions of certain level sets about $R_n$ are discussed.

preprint2012arXiv

Neutrino Oscillations, Entanglement and Coherence: A Quantum Field Theory Study In Real Time

The dynamics of neutrino mixing and oscillations are studied directly in finite real time in a model that effectively describes charged current weak interactions. Finite time corrections to the S-matrix result for the appearance and disappearance probabilities are obtained. It is observed that these effects may be of the same order of the S-matrix result in long-baseline appearance experiments. We argue that fundamentally, the S-matrix is ill-suited to describe long-baseline events due to the fact that the neutrino is produced in an entangled state with the charged lepton, which can be disentangled by the measurement of the charged lepton near the production site. The appearance and disappearance far-detection process is described from the time evolution of this disentangled "collapsed" state, allowing us to establish the conditions under which factorization of detection rates emerges in long-baseline experiments. We also study the time evolution of the reduced density matrix and show explicitly how oscillations are manifest in the off-diagonal terms, i.e., coherences, as a result of a finite time analysis. Lastly, we study a model for the "GSI anomaly" obtaining the time evolution of the population of parent and daughter particles directly in real time. We confirm that the decay rate of parent and growth rate of daughters do NOT feature oscillatory behavior from interference of mass eigenstates.

preprint2012arXiv

On the fast Khintchine spectrum in continued fractions

For $x\in [0,1)$, let $x=[a_1(x), a_2(x),...]$ be its continued fraction expansion with partial quotients ${a_n(x), n\ge 1}$. Let $ψ: \mathbb{N} \rightarrow \mathbb{N}$ be a function with $ψ(n)/n\to \infty$ as $n\to \infty$. In this note, the fast Khintchine spectrum, i.e., the Hausdorff dimension of the set $$ E(ψ):=\Big{x\in [0,1): \lim_{n\to\infty}\frac{1}{ψ(n)}\sum_{j=1}^n\log a_j(x)=1\Big} $$ is completely determined without any extra condition on $ψ$.

preprint2011arXiv

Context-Capture Multi-Valued Decision Fusion With Fault Tolerant Capability For Wireless Sensor Networks

Wireless sensor networks (WSNs) are usually utilized to perform decision fusion of event detection. Current decision fusion schemes are based on binary valued decision and do not consider bursty contextcapture. However, bursty context and multi-valued data are important characteristics of WSNs. One on hand, the local decisions from sensors usually have bursty and contextual characteristics. Fusion center must capture the bursty context information from the sensors. On the other hand, in practice, many applications need to process multi-valued data, such as temperature and reflection level used for lightening prediction. To address these challenges, the Markov modulated Poisson process (MMPP) and multi-valued logic are introduced into WSNs to perform context-capture multi-valued decision fusion. The overall decision fusion is decomposed into two parts. The first part is the context-capture model for WSNs using superposition MMPP. Through this procedure, the fusion center has a higher probability to get useful local decisions from sensors. The second one is focused on multi-valued decision fusion. Fault detection can also be performed based on MVL. Once the fusion center detects the faulty nodes, all their local decisions are removed from the computation of the likelihood ratios. Finally, we evaluate the capability of context-capture and fault tolerant. The result supports the usefulness of our scheme.

preprint2010arXiv

Dynamics of disentanglement, density matrix and coherence in neutrino oscillations

In charged current weak interaction processes, neutrinos are produced in an entangled state with the charged lepton. This correlated state is disentangled by the measurement of the charged lepton in a detector at the production site. We study the dynamical aspects of disentanglement, propagation and detection, in particular the conditions under which the disentangled state is a coherent superposition of mass eigenstates. The appearance and disappearance far-detection processes are described from the time evolution of this disentangled "collapsed" state. The familiar quantum mechanical interpretation and factorization of the detection rate emerges when the quantum state is disentangled on time scales \emph{much shorter} than the inverse oscillation frequency, in which case the final detection rate factorizes in terms of the usual quantum mechanical transition probability provided the final density of states is insensitive to the neutrino energy difference. We suggest \emph{possible} corrections for short-baseline experiments. If the charged lepton is unobserved, neutrino oscillations and coherence are described in terms of a reduced density matrix obtained by tracing out an un-observed charged lepton. The diagonal elements in the mass basis describe the production of mass eigenstates whereas the off diagonal ones provide a measure of coherence. It is shown that coherences are of the same order of the diagonal terms on time scales up to the inverse oscillation frequency, beyond which the coherences oscillate as a result of the interference between mass eigenstates.

preprint2010arXiv

Is the GSI anomaly due to neutrino oscillations? - A real time perspective -

We study a model for the "GSI anomaly" in which we obtain the time evolution of the population of parent and daughter particles directly in real time, considering explicitly the quantum entanglement between the daughter particle and neutrino mass eigenstates in the two-body decay. We confirm that the decay rate of the parent particle and the growth rate of the daughter particle do \emph{not} feature a time modulation from interference of neutrino mass eigenstates. The lack of interference is a consequence of the orthogonality of the mass eigenstates. This result also follows from the density matrix obtained by tracing out the unobserved neutrino states. We confirm this result by providing a complementary explanation based on Cutkosky rules applied to the Feynman diagram that describes the self-energy of the parent particle.

preprint2010arXiv

Robustness of Random Graphs Based on Natural Connectivity

Recently, it has been proposed that the natural connectivity can be used to efficiently characterise the robustness of complex networks. Natural connectivity quantifies the redundancy of alternative routes in a network by evaluating the weighted number of closed walks of all lengths and can be regarded as the average eigenvalue obtained from the graph spectrum. In this article, we explore the natural connectivity of random graphs both analytically and numerically and show that it increases linearly with the average degree. By comparing with regular ring lattices and random regular graphs, we show that random graphs are more robust than random regular graphs; however, the relationship between random graphs and regular ring lattices depends on the average degree and graph size. We derive the critical graph size as a function of the average degree, which can be predicted by our analytical results. When the graph size is less than the critical value, random graphs are more robust than regular ring lattices, whereas regular ring lattices are more robust than random graphs when the graph size is greater than the critical value.

preprint2010arXiv

Small scale aspects of warm dark matter : power spectra and acoustic oscillations

We provide a semi-analytic study of the small scale aspects of the power spectra of warm dark matter (WDM) candidates that decoupled while relativistic with arbitrary distribution functions. These are characterized by two widely different scales $k_{eq} \sim 0.01\,(\mathrm{Mpc})^{-1}$ and $k_{fs}= \sqrt{3}\,k_{eq}/2\,< V^2_{eq} >^{1/2} $ with $< V^2_{eq} >^{1/2} \ll 1 $ the velocity dispersion at matter radiation equality. Density perturbations evolve through three stages: radiation domination when the particle is relativistic and non-relativistic and matter domination. An early ISW effect during the first stage leads to an enhancement of density perturbations and a plateau in the transfer function for $k \lesssim k_{fs}$. An effective fluid description emerges at small scales which includes the effects of free streaming in initial conditions and inhomogeneities. The transfer function features \emph{WDM-acoustic oscillations} at scales $k \gtrsim 2 \,k_{fs}$. We study the power spectra for two models of sterile neutrinos with $m \sim \,\mathrm{keV}$ produced non-resonantly, at the QCD and EW scales respectively. The latter case yields acoustic oscillations on mass scales $\sim 10^{8}\,M_{\odot}$. Our results reveal a \emph{quasi-degeneracy} between the mass, distribution function and decoupling temperature suggesting caveats on the constraints on the mass of a sterile neutrino from current WDM N-body simulations and Lyman-$α$ forest data. A simple analytic interpolation of the power spectra between large and small scales and its numerical implementation is given.

preprint2009arXiv

Sterile neutrinos produced near the EW scale I: mixing angles, MSW resonances and production rates

We study the production of sterile neutrinos in the region $T\sim M_W$ in an extension beyond the standard model with the see-saw mass matrix originating in Yukawa couplings to Higgs-like scalars with masses and vev's of the order of the electroweak scale. Sterile neutrinos are produced by the decay of scalars and standard model vector bosons. We obtain the index of refraction, dispersion relations, mixing angles in the medium and production rates including those for right-handed sterile neutrinos, from the standard model and beyond the standard model self-energies. For $1 \lesssim M_W/T \lesssim 3$ we find narrow MSW resonances with $k \lesssim T$ for both left and right handed neutrinos even in absence of a lepton asymmetry in the (active) neutrino sector, as well as very low energy ($k/T \ll |ξ|$) narrow MSW resonances in the presence of a lepton asymmetry consistent with the bounds from WMAP and BBN. For small vacuum mixing angle, consistent with observational bounds, the absorptive part of the self-energies lead to a strong damping regime very near the resonances resulting in the \emph{exact} degeneracy of the propagating modes with a concomitant breakdown of adiabaticity. We argue that cosmological expansion sweeps through the resonances, \emph{resonant and non-resonant} sterile neutrino production results in a highly \emph{non-thermal} distribution function enhanced at small momentum $k < T$, with potentially important consequences for their free streaming length and transfer function at small scales.