Catalog footprint

What is connected

40works
37topics
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

40 published item(s)

preprint2026arXiv

TacoMAS: Test-Time Co-Evolution of Topology and Capability in LLM-based Multi-Agent Systems

Multi-agent systems (MAS) have emerged as a promising paradigm for solving complex tasks. Recent work has explored self-evolving MAS that automatically optimize agent capabilities or communication topologies. However, existing methods either learn a topology that remains fixed at inference time or adapt only the topology or capability during inference. We empirically and theoretically show that effective test-time evolution requires jointly adapting both axes, but on different time scales: capabilities should update rapidly to handle emerging subtasks, while the topology should evolve more slowly to preserve coordination stability. We then introduce TacoMAS, a test-time co-evolution framework for dynamic MAS. TacoMAS formulates MAS inference as a task of online graph adaptation, where nodes represent agents with role-specific capabilities and edges define their communication topology. During inference, a fast capability loop updates agent expertise using trajectory-level feedback, while a slow meta-LLM-driven topology loop performs agents' birth-death operations on MAS, including edge edit, agent addition, and agent removal. We further show that this fast-slow design drives MAS evolution toward a task-conditioned stable equilibrium. Experiments on four benchmarks demonstrate that TacoMAS outperforms nearly 20 multi-agent baselines, achieving an average improvement of 13.3% over the strongest baseline. The codes are released at https://github.com/chenxu2-gif/TacoMAS-MultiAgent.

preprint2026arXiv

The Attention Market: Interpreting Online Fair Re-ranking as Manifold Optimization under Walrasian Equilibrium

Fair re-ranking aims to promote long-tail items and enhance diversity within groups in information retrieval. While previous research on online fairness-aware re-ranking has shown promising outcomes, our comprehensive evaluation of online fair re-ranking methods over 20 settings reveals significant performance disparities among existing methods. To uncover the root causes of these inconsistencies, we reformulate fair re-ranking within an attentional market framework governed by a Walrasian Equilibrium, where the fairness is treated as a taxation cost. This market-based formulation is then coupled with manifold optimization, demonstrating that seeking this equilibrium is equivalent to performing gradient descent on a specific ranking manifold constructed by the market. Different re-ranking settings induce distinct manifold geometries, and these intrinsic geometric differences dictate the gradient landscapes and optimization trajectories. We propose ManifoldRank, an efficient online fair re-ranking algorithm. ManifoldRank adjusts gradients to align with the ranking manifold, considering various contextual settings. On the supply side, it incorporates a gradient adjustment based on different fairness requirements, accounting for associated costs. On the demand side, it empirically predicts an additional gradient adjustment term derived from the ranking scores. By integrating these two gradient adjustments, ManifoldRank effectively balances fairness and accuracy. Experimental results across multiple datasets confirm ManifoldRank's effectiveness.

preprint2022arXiv

A Class-wise Non-salient Region Generalized Framework for Video Semantic Segmentation

Video semantic segmentation (VSS) is beneficial for dealing with dynamic scenes due to the continuous property of the real-world environment. On the one hand, some methods alleviate the predicted inconsistent problem between continuous frames. On the other hand, other methods employ the previous frame as the prior information to assist in segmenting the current frame. Although the previous methods achieve superior performances on the independent and identically distributed (i.i.d) data, they can not generalize well on other unseen domains. Thus, we explore a new task, the video generalizable semantic segmentation (VGSS) task that considers both continuous frames and domain generalization. In this paper, we propose a class-wise non-salient region generalized (CNSG) framework for the VGSS task. Concretely, we first define the class-wise non-salient feature, which describes features of the class-wise non-salient region that carry more generalizable information. Then, we propose a class-wise non-salient feature reasoning strategy to select and enhance the most generalized channels adaptively. Finally, we propose an inter-frame non-salient centroid alignment loss to alleviate the predicted inconsistent problem in the VGSS task. We also extend our video-based framework to the image-based generalizable semantic segmentation (IGSS) task. Experiments demonstrate that our CNSG framework yields significant improvement in the VGSS and IGSS tasks.

preprint2022arXiv

Conformal prediction set for time-series

When building either prediction intervals for regression (with real-valued response) or prediction sets for classification (with categorical responses), uncertainty quantification is essential to studying complex machine learning methods. In this paper, we develop Ensemble Regularized Adaptive Prediction Set (ERAPS) to construct prediction sets for time-series (with categorical responses), based on the prior work of [Xu and Xie, 2021]. In particular, we allow unknown dependencies to exist within features and responses that arrive in sequence. Method-wise, ERAPS is a distribution-free and ensemble-based framework that is applicable for arbitrary classifiers. Theoretically, we bound the coverage gap without assuming data exchangeability and show asymptotic set convergence. Empirically, we demonstrate valid marginal and conditional coverage by ERAPS, which also tends to yield smaller prediction sets than competing methods.

preprint2022arXiv

COSPLAY: Concept Set Guided Personalized Dialogue Generation Across Both Party Personas

Maintaining a consistent persona is essential for building a human-like conversational model. However, the lack of attention to the partner makes the model more egocentric: they tend to show their persona by all means such as twisting the topic stiffly, pulling the conversation to their own interests regardless, and rambling their persona with little curiosity to the partner. In this work, we propose COSPLAY(COncept Set guided PersonaLized dialogue generation Across both partY personas) that considers both parties as a "team": expressing self-persona while keeping curiosity toward the partner, leading responses around mutual personas, and finding the common ground. Specifically, we first represent self-persona, partner persona and mutual dialogue all in the concept sets. Then, we propose the Concept Set framework with a suite of knowledge-enhanced operations to process them such as set algebras, set expansion, and set distance. Based on these operations as medium, we train the model by utilizing 1) concepts of both party personas, 2) concept relationship between them, and 3) their relationship to the future dialogue. Extensive experiments on a large public dataset, Persona-Chat, demonstrate that our model outperforms state-of-the-art baselines for generating less egocentric, more human-like, and higher quality responses in both automatic and human evaluations.

preprint2022arXiv

Learnable Irrelevant Modality Dropout for Multimodal Action Recognition on Modality-Specific Annotated Videos

With the assumption that a video dataset is multimodality annotated in which auditory and visual modalities both are labeled or class-relevant, current multimodal methods apply modality fusion or cross-modality attention. However, effectively leveraging the audio modality in vision-specific annotated videos for action recognition is of particular challenge. To tackle this challenge, we propose a novel audio-visual framework that effectively leverages the audio modality in any solely vision-specific annotated dataset. We adopt the language models (e.g., BERT) to build a semantic audio-video label dictionary (SAVLD) that maps each video label to its most K-relevant audio labels in which SAVLD serves as a bridge between audio and video datasets. Then, SAVLD along with a pretrained audio multi-label model are used to estimate the audio-visual modality relevance during the training phase. Accordingly, a novel learnable irrelevant modality dropout (IMD) is proposed to completely drop out the irrelevant audio modality and fuse only the relevant modalities. Moreover, we present a new two-stream video Transformer for efficiently modeling the visual modalities. Results on several vision-specific annotated datasets including Kinetics400 and UCF-101 validated our framework as it outperforms most relevant action recognition methods.

preprint2022arXiv

Preventing the Spread of Online Harms: Physics of Contagion across Multi-Platform Social Media and Metaverses

We present a minimal yet empirically-grounded theory for the spread of online harms (e.g. misinformation, hate) across current multi-platform social media and future Metaverses. New physics emerges from the interplay between the intrinsic heterogeneity among online communities and platforms, their clustering dynamics generated through user-created links and sudden moderator shutdowns, and the contagion process. The theory provides an online `R-nought' criterion to prevent system-wide spreading; it predicts re-entrant spreading phases; it establishes the level of digital vaccination required for online herd immunity; and it can be applied at multiple scales.

preprint2022arXiv

SMLE: An R Package for Joint Feature Screening in Ultrahigh-dimensional GLMs

The sparsity-restricted maximum likelihood estimator (SMLE) has received considerable attention for feature screening in ultrahigh-dimensional regression. SMLE is a computationally convenient method that naturally incorporates the joint effects among features in the screening process. We develop a publicly available R package SMLE, which provides a user-friendly environment to carry out SMLE in generalized linear models. In particular, the package includes functions to conduct SMLE-screening and post-screening selection using SMLE with popular selection criteria such as AIC and (extended) BIC. The package gives users the flexibility in controlling a series of screening parameters and accommodates both numerical and categorical feature input. The usage of the package is illustrated on extensive numerical examples, where the promising performance of SMLE is well observed.

preprint2022arXiv

Solar Radiation Ramping Events Modeling Using Spatio-temporal Point Processes

Modeling and predicting solar events, particularly the solar ramping event, is critical for improving situational awareness for solar power generation systems. It has been acknowledged that weather conditions such as temperature, humidity, and cloud density can significantly impact the emergence and position of solar ramping events. As a result, modeling these events with complex spatio-temporal correlations is highly challenging. To tackle the question, we adopt a novel spatio-temporal categorical point process model, which intuitively and effectively addresses correlation and interaction among ramping events. We demonstrate the interpretability and predictive power of our model on extensive real-data experiments.

preprint2021arXiv

Electrostatic Discovery Atomic Force Microscopy

While offering unprecedented resolution of atomic and electronic structure, Scanning Probe Microscopy techniques have found greater challenges in providing reliable electrostatic characterization at the same scale. In this work, we introduce Electrostatic Discovery Atomic Force Microscopy, a machine learning based method which provides immediate quantitative maps of the electrostatic potential directly from Atomic Force Microscopy images with functionalized tips. We apply this to characterize the electrostatic properties of a variety of molecular systems and compare directly to reference simulations, demonstrating good agreement. This approach opens the door to reliable atomic scale electrostatic maps on any system with minimal computational overhead.

preprint2021arXiv

Estimating Adsorption Isotherm Parameters in Chromatography via a Virtual Injection Promoting Feed-forward Neural Network

The means to obtain the adsorption isotherms is a fundamental open problem in competitive chromatography. A modern technique of estimating adsorption isotherms is to solve an inverse problem so that the simulated batch separation coincides with actual experimental results. However, this identification process is usually ill-posed in the sense that the small noise in the measured response can lead to a large fluctuation in the estimated quantity of adsorption isotherms. The conventional mathematical method of solving this problem is the variational regularization, which is formulated as a non-convex minimization problem with a regularized objective functional. However, in this method, the choice of regularization parameter and the design of a convergent solution algorithm are quite difficult in practice. Moreover, due to the restricted number of injection profiles in experiments, the types of measured data are extremely limited, which may lead to a biased estimation. In order to overcome these difficulties, in this paper, we develop a new inversion method -- the Virtual Injection Promoting Feed-forward Neural Network (VIP-FNN). In this approach, the training data contain various types of artificial injections and synthetic noisy measurement at outlet, generated by a conventional physics model -- a time-dependent convection-diffusion system. Numerical experiments with both artificial and real data from laboratory experiments show that the proposed VIP-FNN is an efficient and robust algorithm.

preprint2021arXiv

HAVANA: Hierarchical and Variation-Normalized Autoencoder for Person Re-identification

Person Re-Identification (Re-ID) is of great importance to the many video surveillance systems. Learning discriminative features for Re-ID remains a challenge due to the large variations in the image space, e.g., continuously changing human poses, illuminations and point of views. In this paper, we propose HAVANA, a novel extensible, light-weight HierArchical and VAriation-Normalized Autoencoder that learns features robust to intra-class variations. In contrast to existing generative approaches that prune the variations with heavy extra supervised signals, HAVANA suppresses the intra-class variations with a Variation-Normalized Autoencoder trained with no additional supervision. We also introduce a novel Jensen-Shannon triplet loss for contrastive distribution learning in Re-ID. In addition, we present Hierarchical Variation Distiller, a hierarchical VAE to factorize the latent representation and explicitly model the variations. To the best of our knowledge, HAVANA is the first VAE-based framework for person ReID.

preprint2020arXiv

Deposition of particle pollution in turbulent forced-air cooling

Rotating fans are the prevalent forced cooling method for heat generating equipment and buildings. As the concentration of atmospheric pollutants has increased, the accumulation of microscale and nanoscale particles on surfaces due to advection-diffusion has led to adverse mechanical, chemical and electrical effects that increase cooling demands and reduce the reliability of electronic equipment. Here, we uncover the mechanisms leading to enhanced deposition of particle matter (PM$_{10}$ and PM$_{2.5}$) on surfaces due to turbulent axial fan flows operating at Reynolds numbers, $Re \sim 10^5$. Qualitative observations of long-term particle deposition from the field were combined with \textit{in situ} particle image velocimetry on a telecommunications base station, revealing the dominant role of impingement velocity and angle. Near-wall momentum transport for $10 < y^+ < 50$ were explored using a quadrant analysis to uncover the contributions of turbulent events that promote particle deposition through turbulent diffusion and eddy impaction. By decomposing these events, the local transport behaviour of fine particles from the bulk flow to the surface has been categorised. The transition from deposition to clean surfaces was accompanied by a decrease in shear velocity, turbulent stresses, and particle sweep motions with lower flux in the wall-normal direction. Finally, using these insights, selective filtering of coarse particles was found to promote the conditions that enhance the deposition of fine particle matter.

preprint2020arXiv

Metasurface integrated Vertical Cavity Surface Emitting Lasers for programmable directional lasing emissions

Vertical cavity surface emitting lasers (VCSELs) have made indispensable contributions to the development of modern optoelectronic technologies. However, arbitrary beam shaping of VCSELs within a compact system still remains inaccessible till now. The emerging ultra-thin flat optical structures, namely metasurfaces, offer a powerful technique to manipulate electromagnetic fields with subwavelength spatial resolution. Here, we show that the monolithic integration of dielectric metasurfaces with VCSELs enables remarkable arbitrary control of the laser beam profiles, including self-collimation, Bessel and Vortex lasers, with high efficiency. Such wafer-level integration of metasurface through VCSELs-compatible technology simplifies the assembling process and preserves the high performance of the VCSELs. We envision that our approach can be implemented in various wide-field applications, such as optical fibre communications, laser printing, smartphones, optical sensing, face recognition, directional displays and ultra-compact light detection and ranging (LiDAR).

preprint2020arXiv

Multiplicative Noise Removal: Nonlocal Low-Rank Model and Its Proximal Alternating Reweighted Minimization Algorithm

The goal of this paper is to develop a novel numerical method for efficient multiplicative noise removal. The nonlocal self-similarity of natural images implies that the matrices formed by their nonlocal similar patches are low-rank. By exploiting this low-rank prior with application to multiplicative noise removal, we propose a nonlocal low-rank model for this task and develop a proximal alternating reweighted minimization (PARM) algorithm to solve the optimization problem resulting from the model. Specifically, we utilize a generalized nonconvex surrogate of the rank function to regularize the patch matrices and develop a new nonlocal low-rank model, which is a nonconvex nonsmooth optimization problem having a patchwise data fidelity and a generalized nonlocal low-rank regularization term. To solve this optimization problem, we propose the PARM algorithm, which has a proximal alternating scheme with a reweighted approximation of its subproblem. A theoretical analysis of the proposed PARM algorithm is conducted to guarantee its global convergence to a critical point. Numerical experiments demonstrate that the proposed method for multiplicative noise removal significantly outperforms existing methods such as the benchmark SAR-BM3D method in terms of the visual quality of the denoised images, and the PSNR (the peak-signal-to-noise ratio) and SSIM (the structural similarity index measure) values.

preprint2020arXiv

Non-Markovian recovery makes complex networks more resilient against large-scale failures

Non-Markovian spontaneous recovery processes with a time delay (memory) are ubiquitous in the real world. How does the non-Markovian characteristic affect failure propagation in complex networks? We consider failures due to internal causes at the nodal level and external failures due to an adverse environment, and develop a pair approximation analysis taking into account the two-node correlation. In general, a high failure stationary state can arise, corresponding to large-scale failures that can significantly compromise the functioning of the network. We uncover a striking phenomenon: memory associated with nodal recovery can counter-intuitively make the network more resilient against large-scale failures. In natural systems, the intrinsic non-Markovian characteristic of nodal recovery may thus be one reason for their resilience. In engineering design, incorporating certain non-Markovian features into the network may be beneficial to equipping it with a strong resilient capability to resist catastrophic failures.

preprint2020arXiv

Privileged Features Distillation at Taobao Recommendations

Features play an important role in the prediction tasks of e-commerce recommendations. To guarantee the consistency of off-line training and on-line serving, we usually utilize the same features that are both available. However, the consistency in turn neglects some discriminative features. For example, when estimating the conversion rate (CVR), i.e., the probability that a user would purchase the item if she clicked it, features like dwell time on the item detailed page are informative. However, CVR prediction should be conducted for on-line ranking before the click happens. Thus we cannot get such post-event features during serving. We define the features that are discriminative but only available during training as the privileged features. Inspired by the distillation techniques which bridge the gap between training and inference, in this work, we propose privileged features distillation (PFD). We train two models, i.e., a student model that is the same as the original one and a teacher model that additionally utilizes the privileged features. Knowledge distilled from the more accurate teacher is transferred to the student to improve its accuracy. During serving, only the student part is extracted and it relies on no privileged features. We conduct experiments on two fundamental prediction tasks at Taobao recommendations, i.e., click-through rate (CTR) at coarse-grained ranking and CVR at fine-grained ranking. By distilling the interacted features that are prohibited during serving for CTR and the post-event features for CVR, we achieve significant improvements over their strong baselines. During the on-line A/B tests, the click metric is improved by +5.0% in the CTR task. And the conversion metric is improved by +2.3% in the CVR task. Besides, by addressing several issues of training PFD, we obtain comparable training speed as the baselines without any distillation.

preprint2019arXiv

PR Product: A Substitute for Inner Product in Neural Networks

In this paper, we analyze the inner product of weight vector w and data vector x in neural networks from the perspective of vector orthogonal decomposition and prove that the direction gradient of w decreases with the angle between them close to 0 or π. We propose the Projection and Rejection Product (PR Product) to make the direction gradient of w independent of the angle and consistently larger than the one in standard inner product while keeping the forward propagation identical. As a reliable substitute for standard inner product, the PR Product can be applied into many existing deep learning modules, so we develop the PR Product version of fully connected layer, convolutional layer and LSTM layer. In static image classification, the experiments on CIFAR10 and CIFAR100 datasets demonstrate that the PR Product can robustly enhance the ability of various state-of-the-art classification networks. On the task of image captioning, even without any bells and whistles, our PR Product version of captioning model can compete or outperform the state-of-the-art models on MS COCO dataset. Code has been made available at:https://github.com/wzn0828/PR_Product.

preprint2016arXiv

A Unified Convex Surrogate for the Schatten-$p$ Norm

The Schatten-$p$ norm ($0<p<1$) has been widely used to replace the nuclear norm for better approximating the rank function. However, existing methods are either 1) not scalable for large scale problems due to relying on singular value decomposition (SVD) in every iteration, or 2) specific to some $p$ values, e.g., $1/2$, and $2/3$. In this paper, we show that for any $p$, $p_1$, and $p_2 >0$ satisfying $1/p=1/p_1+1/p_2$, there is an equivalence between the Schatten-$p$ norm of one matrix and the Schatten-$p_1$ and the Schatten-$p_2$ norms of its two factor matrices. We further extend the equivalence to multiple factor matrices and show that all the factor norms can be convex and smooth for any $p>0$. In contrast, the original Schatten-$p$ norm for $0<p<1$ is non-convex and non-smooth. As an example we conduct experiments on matrix completion. To utilize the convexity of the factor matrix norms, we adopt the accelerated proximal alternating linearized minimization algorithm and establish its sequence convergence. Experiments on both synthetic and real datasets exhibit its superior performance over the state-of-the-art methods. Its speed is also highly competitive.

preprint2016arXiv

Adaptive cyclically dominating game on co-evolving networks: Numerical and analytic results

A co-evolving and adaptive Rock (R)-Paper (P)-Scissors (S) game (ARPS) in which an agent uses one of three cyclically dominating strategies is proposed and studied numerically and analytically. An agent takes adaptive actions to achieve a neighborhood to his advantage by rewiring a dissatisfying link with a probability $p$ or switching strategy with a probability $1-p$. Numerical results revealed two phases in the steady state. An active phase for $p<p_{\text{cri}}$ has one connected network of agents using different strategies who are continually interacting and taking adaptive actions. A frozen phase for $p>p_{\text{cri}}$ has three separate clusters of agents using only R, P, and S, respectively with terminated adaptive actions. A mean-field theory of link densities in co-evolving network is formulated in a general way that can be readily modified to other co-evolving network problems of multiple strategies. The analytic results agree with simulation results on ARPS well. We point out the different probabilities of winning, losing, and drawing a game among the agents as the origin of the small discrepancy between analytic and simulation results. As a result of the adaptive actions, agents of higher degrees are often those being taken advantage of. Agents with a smaller (larger) degree than the mean degree have a higher (smaller) probability of winning than losing. The results are useful in future attempts on formulating more accurate theories.

preprint2016arXiv

Multilinear fractional integral operators on non-homogeneous metric measure spaces

Let $(X,d,μ)$ be a non-homogeneous metric measure space satisfying both the geometrically doubling and the upper doubling measure conditions. In this paper, the boundedness of multilinear fractional integral operator in this setting is proved. Via a sharp maximal operator, the boundedness of commutators generated by multilinear fractional integral operator with $RBMO(μ)$ function on non-homogeneous metric measure spaces in Lebesgue spaces is obtained.

preprint2015arXiv

Anomalous Contagion and Renormalization in Dynamical Networks with Nodal Mobility

The common real-world feature of individuals migrating through a network -- either in real space or online -- significantly complicates understanding of network processes. Here we show that even though a network may appear static on average, underlying nodal mobility can dramatically distort outbreak profiles. Highly nonlinear dynamical regimes emerge in which increasing mobility either amplifies or suppresses outbreak severity. Predicted profiles mimic recent outbreaks of real-space contagion (social unrest) and online contagion (pro-ISIS support). We show that this nodal mobility can be renormalized in a precise way for a particular class of dynamical networks.

preprint2015arXiv

Characterization studies of Silicon Photomultipliers and crystals matrices for a novel time of flight PET detector

This paper describes the characterization of crystal matrices and silicon photomultiplier arrays for a novel Positron Emission Tomography (PET) detector, namely the external plate of the EndoTOFPET-US system. The EndoTOFPET-US collaboration aims to integrate Time-Of-Flight PET with ultrasound endoscopy in a novel multimodal device, capable to support the development of new biomarkers for prostate and pancreatic tumors. The detector consists in two parts: a PET head mounted on an ultrasound probe and an external PET plate. The challenging goal of 1 mm spatial resolution for the PET image requires a detector with small crystal size, and therefore high channel density: 4096 LYSO crystals individually readout by Silicon Photomultipliers (SiPM) make up the external plate. The quality and properties of these components must be assessed before the assembly. The dark count rate, gain, breakdown voltage and correlated noise of the SiPMs are measured, while the LYSO crystals are evaluated in terms of light yield and energy resolution. In order to effectively reduce the noise in the PET image, high time resolution for the gamma detection is mandatory. The Coincidence Time Resolution (CTR) of all the SiPMs assembled with crystals is measured, and results show a value close to the demanding goal of 200 ps FWHM. The light output is evaluated for every channel for a preliminary detector calibration, showing an average of about 1800 pixels fired on the SiPM for a 511 keV interaction. Finally, the average energy resolution at 511 keV is about 13 %, enough for effective Compton rejection.

preprint2015arXiv

Local well-posedness of strong solutions to density-dependent liquid crystal system

In this paper, we study the Cauchy problem to the density-dependent liquid crystal system in $\mathbb R^3$. We establish the local existence and uniqueness of strong solutions to this system. In order to overcome the difficulties caused by the high order coupling terms, a biharmonic regularization of the system, as an auxiliary system, is introduced, and we make full use of the intrinsic cancellation properties between the high order coupling terms.

preprint2015arXiv

On the Feasibility of Distributed Kernel Regression for Big Data

In modern scientific research, massive datasets with huge numbers of observations are frequently encountered. To facilitate the computational process, a divide-and-conquer scheme is often used for the analysis of big data. In such a strategy, a full dataset is first split into several manageable segments; the final output is then averaged from the individual outputs of the segments. Despite its popularity in practice, it remains largely unknown that whether such a distributive strategy provides valid theoretical inferences to the original data. In this paper, we address this fundamental issue for the distributed kernel regression (DKR), where the algorithmic feasibility is measured by the generalization performance of the resulting estimator. To justify DKR, a uniform convergence rate is needed for bounding the generalization error over the individual outputs, which brings new and challenging issues in the big data setup. Under mild conditions, we show that, with a proper number of segments, DKR leads to an estimator that is generalization consistent to the unknown regression function. The obtained results justify the method of DKR and shed light on the feasibility of using other distributed algorithms for processing big data. The promising preference of the method is supported by both simulation and real data examples.

preprint2015arXiv

Relaxed Majorization-Minimization for Non-smooth and Non-convex Optimization

We propose a new majorization-minimization (MM) method for non-smooth and non-convex programs, which is general enough to include the existing MM methods. Besides the local majorization condition, we only require that the difference between the directional derivatives of the objective function and its surrogate function vanishes when the number of iterations approaches infinity, which is a very weak condition. So our method can use a surrogate function that directly approximates the non-smooth objective function. In comparison, all the existing MM methods construct the surrogate function by approximating the smooth component of the objective function. We apply our relaxed MM methods to the robust matrix factorization (RMF) problem with different regularizations, where our locally majorant algorithm shows advantages over the state-of-the-art approaches for RMF. This is the first algorithm for RMF ensuring, without extra assumptions, that any limit point of the iterates is a stationary point.

preprint2015arXiv

Toward Practical Differential Privacy in Smart Grid with Capacity-Limited Rechargeable Batteries

The technology of differential privacy, adding a noise drawn from the Laplace distribution, successfully overcomes a difficulty of keeping both the privacy of individual data and the utility of the statistical result simultaneously. Therefore, it is prevalent to use a rechargeable battery as the noise for achieving differential privacy in the application of smart grid. Unfortunately, to the best of our knowledge, we observe that the existing privacy protection mechanisms cannot satisfy differential privacy, when considering physical restrictions of the battery in practice. In this paper, we first classify two types of challenges caused by two physical restrictions, the maximum charging/discharging rate and the capacity of battery. We then propose a stateless privacy protection scheme by exploring a boundary-changeable distribution for noise, and prove this scheme satisfies differential privacy, with regard to the first type of challenge. We further explain the difficulty to achieve differential privacy under the second type of challenge, and formalize the definition of a relaxed differential privacy. Finally, we present a stateful privacy protection scheme that satisfies the relaxed differential privacy. Experimental analysis shows that the maximum privacy leakage of our privacy protection schemes at each time point stably outperforms that of the existing work.

preprint2014arXiv

Conceptual Design Of An Ideal Variable Coupler For Superconducting Radiofrequency 1.3GHz Cavities

Inspired by the development of over-moded RF component as an undulator, we explored another over-moded structure that could serve the variable coupling for SRF purpose. This application is to fulfill variation of S11 from 0 to -20db with CW power of 7 KW. The static heat loss in the coupler is trivial from calculation. An advantage of this coupler is that the thermal isolation between the 2K and 300K section is considerable by vacuum separation. Within this coupler, only a single propagation mode is allowed at each section, and thus, the fact that no energy is converted to high order mode bring almost full match without loss. The analytical and numerical calculation for a two window variable coupler is designed and optimized. A RF power variation is illustrated in the scattering matrix and coupling to cavity is also discussed.

preprint2014arXiv

Contribution to mid-field Q slope in Niobium SRF cavities from linear RF loss mechanism due to topographic surface structures

Topographic structure on Superconductivity Radio Frequency (SRF) surfaces can contribute additional cavity RF losses describable in terms of surface RF reflectivity and absorption indices of wave scattering theory. At isotropic homogeneous extent, Power Spectrum Density (PSD) of roughness is introduced and quantifies the random surface topographic structure. PSD obtained from different surface treatments of niobium, such Buffered Chemical Polishing (BCP), Electropolishing (EP), Nano-Mechanical Polishing (NMP) and Barrel Centrifugal Polishing (CBP) are compared. A perturbation model is utilized to calculate the additional rough surface RF losses based on PSD statistical analysis. This model will not consider that superconductor becomes normal conducting at fields higher than transition field. One can calculate the RF power dissipation ratio between rough surface and ideal smooth surface within this field range from linear loss mechanisms.

preprint2014arXiv

Energy-Efficient Resource Allocation for Device-to-Device Underlay Communication

Device-to-device (D2D) communication underlaying cellular networks is expected to bring significant benefits for utilizing resources, improving user throughput and extending battery life of user equipments. However, the allocation of radio and power resources to D2D communication needs elaborate coordination, as D2D communication can cause interference to cellular communication. In this paper, we study joint channel and power allocation to improve the energy efficiency of user equipments. To solve the problem efficiently, we introduce an iterative combinatorial auction algorithm, where the D2D users are considered as bidders that compete for channel resources, and the cellular network is treated as the auctioneer. We also analyze important properties of D2D underlay communication, and present numerical simulations to verify the proposed algorithm.

preprint2014arXiv

Influence of X-ray Irradiation on the Properties of the Hamamatsu Silicon Photomultiplier S10362-11-050C

We have investigated the effects of X-ray irradiation to doses of 0, 200 Gy, 20 kGy, 2 MGy, and 20 MGy on the Hamamatsu silicon-photomultiplier (SiPM) S10362-11-050C. The SiPMs were irradiated without applied bias voltage. From current-voltage, capacitance/conductance-voltage, -frequency, pulse-shape, and pulse-area measurements, the SiPM characteristics below and above breakdown voltage were determined. Significant changes of some SiPM parameters are observed. Up to a dose of 20 kGy the performance of the SiPMs is hardly affected by X-ray radiation damage. For doses of 2 and 20 MGy the SiPMs operate with hardly any change in gain, but with a significant increase in dark-count rate and cross-talk probability.

preprint2013arXiv

Resource Management for Device-to-Device Underlay Communication

Device-to-Device (D2D) communication is a technology component for LTE-A. The existing researches allow D2D as an underlay to the cellular network to increase the spectral efficiency. In this book, D2D communication underlaying cellular networks is studied. Some physical-layer techniques and cross-layer optimization methods on resource management and interference avoidance are proposed and discussed. WINNER II channel models is applied to be the signal and interference model and simulation results show that the performance of D2D link is closely related to the distance between D2D transmitter and receiver and that between interference source and the receiver. Besides, by power control, D2D SINR degrades, which will naturally contribute to low interference to cellular communication. A simple mode selection method of D2D communication is introduced. Based on path-loss (PL) mode selection criterion, D2D gives better performance than traditional cellular system. When D2D pair is farther away from the BS, a better results can be obtained. Game theory, which offers a wide variety of analytical tools to study the complex interactions of players and predict their choices, can be used for power and radio resource management in D2D communication. A reverse iterative combinatorial auction is formulated as a mechanism to allocate the spectrum resources for D2D communications with multiple user pairs sharing the same channel. In addition, a game theoretic approach is developed to implement joint scheduling, power control and channel allocation for D2D communication. Finally, joint power and spectrum resource allocation method is studied under consideration of battery lifetime, which is an important application of D2D communication on increasing user's energy efficiency. The simulation results show that all these methods have beneficial effects on improving the system performance.

preprint2013arXiv

The study of tuning system for BEPC II

Tuning system plays a very important role when superconducting cavity works. It cooperates with other control loops, to adjust the frequency of cavity with high precision, reduce the reflection power, guarantee the stability of beam and ensure the safety of superconducting cavity. This paper focuses mainly on the tuning system working principle, the working state and problems that BEPC (Beijing Electron Positron Collider) II has encountered during operation.

preprint2012arXiv

Efficiency Resource Allocation for Device-to-Device Underlay Communication Systems: A Reverse Iterative Combinatorial Auction Based Approach

Peer-to-peer communication has been recently considered as a popular issue for local area services. An innovative resource allocation scheme is proposed to improve the performance of mobile peer-to-peer, i.e., device-to-device (D2D), communications as an underlay in the downlink (DL) cellular networks. To optimize the system sum rate over the resource sharing of both D2D and cellular modes, we introduce a reverse iterative combinatorial auction as the allocation mechanism. In the auction, all the spectrum resources are considered as a set of resource units, which as bidders compete to obtain business while the packages of the D2D pairs are auctioned off as goods in each auction round. We first formulate the valuation of each resource unit, as a basis of the proposed auction. And then a detailed non-monotonic descending price auction algorithm is explained depending on the utility function that accounts for the channel gain from D2D and the costs for the system. Further, we prove that the proposed auction-based scheme is cheat-proof, and converges in a finite number of iteration rounds. We explain non-monotonicity in the price update process and show lower complexity compared to a traditional combinatorial allocation. The simulation results demonstrate that the algorithm efficiently leads to a good performance on the system sum rate.

preprint2012arXiv

Phase-Space analysis of Teleparallel Dark Energy

We perform a detailed dynamical analysis of the teleparallel dark energy scenario, which is based on the teleparallel equivalent of General Relativity, in which one adds a canonical scalar field, allowing also for a nonminimal coupling with gravity. We find that the universe can result in the quintessence-like, dark-energy-dominated solution, or to the stiff dark-energy late-time attractor, similarly to standard quintessence. However, teleparallel dark energy possesses an additional late-time solution, in which dark energy behaves like a cosmological constant, independently of the specific values of the model parameters. Finally, during the evolution the dark energy equation-of-state parameter can be either above or below -1, offering a good description for its observed dynamical behavior and its stabilization close to the cosmological-constant value.

preprint2009arXiv

Human group formation in online guilds and offline gangs driven by common team dynamic

Quantifying human group dynamics represents a unique challenge. Unlike animals and other biological systems, humans form groups in both real (offline) and virtual (online) spaces -- from potentially dangerous street gangs populated mostly by disaffected male youths, through to the massive global guilds in online role-playing games for which membership currently exceeds tens of millions of people from all possible backgrounds, age-groups and genders. We have compiled and analyzed data for these two seemingly unrelated offline and online human activities, and have uncovered an unexpected quantitative link between them. Although their overall dynamics differ visibly, we find that a common team-based model can accurately reproduce the quantitative features of each simply by adjusting the average tolerance level and attribute range for each population. By contrast, we find no evidence to support a version of the model based on like-seeking-like (i.e. kinship or `homophily').

preprint2003arXiv

Rapid Adiabatic Passage from an Atomic to a Molecular Condensate

We examine collective magnetoassociation of a Bose-Einstein condensate (BEC), focusing on rapid adiabatic passage from atoms to molecules induced by a sweep of the magnetic field across a wide (>~ 10 G) Feshbach resonance in 85Rb. This problem raises an interest because strong magnetoassociation is expected to favor the creation of molecular-dissociated atom pairs over the formation of molecular BEC [Javanainen and Mackie, Phys. Rev. Lett. 88, 090403 (2002)]. Nevertheless, the conversion to atom pairs is found to depend on the direction of the sweep, so that a system initially above threshold (open dissociation channel) may in fact give near-complete conversion to molecules.