Catalog footprint

What is connected

52works
24topics
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

52 published item(s)

preprint2026arXiv

Single-Sample Black-Box Membership Inference Attack against Vision-Language Models via Cross-modal Semantic Alignment

Vision-Language Models (VLMs) have achieved remarkable success, yet their reliance on massive datasets and unintended memorization of training data raise significant data security risk. Membership Inference Attacks (MIAs) aim to assess these risks by determining whether a data sample was included in a model's training set. However, existing MIA methods against VLMs face critical bottlenecks: gray-box method relies on internal logits that are typically restricted in real-world Application Programming Interfaces (APIs), while black-box method depends on large-scale statistical distributions, which struggle in single-sample scenarios. To this end, we investigate MIAs from the perspective of cross-modal semantic alignment, and observe that member images exhibit significantly stronger image-caption alignment due to training memorization, whereas generated captions for non-members may deviate from the original visual content. Leveraging this insight, we propose a novel MIA framework designed for strict black-box and single-sample setting that quantifies such alignment within a joint embedding space, thereby bypassing these unrealistic assumptions. We conducted extensive experiments on three open-source and two closed-source VLMs. On the VL-MIA/Flicker dataset, our method achieves an AUC of 0.821 against LLaVA-1.5, significantly outperforming existing baselines. Furthermore, it remains robust under diverse image perturbations, highlighting its practicality.

preprint2025arXiv

Beyond Degradation Redundancy: Contrastive Prompt Learning for All-in-One Image Restoration

All-in-One Image Restoration (AiOIR), which addresses diverse degradation types with a unified model, presents significant challenges in designing task-aware prompts that effectively guide restoration across multiple degradation scenarios. While adaptive prompt learning enables end-to-end optimization, it often yields overlapping or redundant task representations. Conversely, explicit prompts derived from pretrained classifiers enhance discriminability but discard critical visual information needed for reconstruction. To address these limitations, we introduce Contrastive Prompt Learning (CPL), a framework that aims to improve prompt-task alignment through two complementary components: a Sparse Prompt Module (SPM) that efficiently captures degradation-aware representations while reducing redundancy, and a Contrastive Prompt Regularization (CPR) that explicitly strengthens task boundaries by incorporating negative prompt samples across different degradation types. Unlike previous approaches that focus primarily on degradation classification, CPL directly optimizes the interaction between prompts and the restoration model. Extensive experiments across five benchmarks show that CPL consistently boosts the performance of strong AiOIR baselines across diverse scenarios. Our approach achieves state-of-the-art average performance on these benchmarks, providing a general and robust solution for AiOIR. The code is available at https://github.com/Aitical/CPLIR

preprint2022arXiv

Converse: A Tree-Based Modular Task-Oriented Dialogue System

Creating a system that can have meaningful conversations with humans to help accomplish tasks is one of the ultimate goals of Artificial Intelligence (AI). It has defined the meaning of AI since the beginning. A lot has been accomplished in this area recently, with voice assistant products entering our daily lives and chat bot systems becoming commonplace in customer service. At first glance there seems to be no shortage of options for dialogue systems. However, the frequently deployed dialogue systems today seem to all struggle with a critical weakness - they are hard to build and harder to maintain. At the core of the struggle is the need to script every single turn of interactions between the bot and the human user. This makes the dialogue systems more difficult to maintain as the tasks become more complex and more tasks are added to the system. In this paper, we propose Converse, a flexible tree-based modular task-oriented dialogue system. Converse uses an and-or tree structure to represent tasks and offers powerful multi-task dialogue management. Converse supports task dependency and task switching, which are unique features compared to other open-source dialogue frameworks. At the same time, Converse aims to make the bot building process easy and simple, for both professional and non-professional software developers. The code is available at https://github.com/salesforce/Converse.

preprint2022arXiv

Effectively Using Long and Short Sessions for Multi-Session-based Recommendations

It is not accurate to make recommendations only based one single current session. Therefore, multi-session-based recommendation(MSBR) is a solution for the problem. Compared with the previous MSBR models, we have made three improvements in this paper. First, the previous work choose to use all the history sessions of the user and/or of his similar users. When the user's current interest changes greatly from the past, most of these sessions can only have negative impacts. Therefore, we select a large number of randomly chosen sessions from the dataset as candidate sessions to avoid over depending on history data. Then we only choose to use the most similar sessions to get the most useful information while reduce the noise caused by dissimilar sessions. Second, in real-world datasets, short sessions account for a large proportion. The RNN often used in previous work is not suitable to process short sessions, because RNN only focuses on the sequential relationship, which we find is not the only relationship between items in short sessions. So, we designed a more suitable method named GAFE based on attention to process short sessions. Third, Although there are few long sessions, they can not be ignored. Not like previous models, which simply process long sessions in the same way as short sessions, we propose LSIS, which can split the interest of long sessions, to make better use of long sessions. Finally, to help recommendations, we also have considered users' long-term interests captured by a multi-layer GRU. Considering the four points above, we built the model ENIREC. Experiments on two real-world datasets show that the comprehensive performance of ENIREC is better than other existing models.

preprint2022arXiv

Fractal dimension of potential singular points set in the Navier-Stokes equations under supercritical regularity

The main objective of this paper is to answer the questions posed by Robinson and Sadowski [21, p. 505, Comm. Math. Phys., 2010]{[RS3]} for the Navier-Stokes equations. Firstly, we prove that the upper box dimension of the potential singular points set $\mathcal{S}$ of suitable weak solution $u$ belonging in $ L^{q}(0,T;L^{p}(\mathbb{R}^{3}))$ for $1\leq\frac{2}{q}+\frac{ 3}{p}\leq\frac32$ with $2\leq q<\infty$ and $2<p<\infty$ is at most $\max\{p,q\}(\frac{2}{q}+\frac{ 3}{p}-1)$ in this system. Secondly, it is shown that $1-2 s$ dimension Hausdorff measure of potential singular points set of suitable weak solutions satisfying $ u\in L^{2}(0,T;\dot{H}^{s+1}(\mathbb{R}^{3}))$ for $0\leq s\leq\frac12$ is zero, whose proof relies on Caffarelli-Silvestre's extension. Inspired by Baker-Wang's recent work [1], this further allows us to discuss the Hausdorff dimension of potential singular points set of suitable weak solutions if the gradient of the velocity under some supercritical regularity.

preprint2022arXiv

GLaMa: Joint Spatial and Frequency Loss for General Image Inpainting

The purpose of image inpainting is to recover scratches and damaged areas using context information from remaining parts. In recent years, thanks to the resurgence of convolutional neural networks (CNNs), image inpainting task has made great breakthroughs. However, most of the work consider insufficient types of mask, and their performance will drop dramatically when encountering unseen masks. To combat these challenges, we propose a simple yet general method to solve this problem based on the LaMa image inpainting framework, dubbed GLaMa. Our proposed GLaMa can better capture different types of missing information by using more types of masks. By incorporating more degraded images in the training phase, we can expect to enhance the robustness of the model with respect to various masks. In order to yield more reasonable results, we further introduce a frequency-based loss in addition to the traditional spatial reconstruction loss and adversarial loss. In particular, we introduce an effective reconstruction loss both in the spatial and frequency domain to reduce the chessboard effect and ripples in the reconstructed image. Extensive experiments demonstrate that our method can boost the performance over the original LaMa method for each type of mask on FFHQ, ImageNet, Places2 and WikiArt dataset. The proposed GLaMa was ranked first in terms of PSNR, LPIPS and SSIM in the NTIRE 2022 Image Inpainting Challenge Track 1 Unsupervised.

preprint2022arXiv

Partial regularity of suitable weak solutions of the model arising in amorphous molecular beam epitaxy

In this paper, we are concerned with the precise relationship between the Hausdorff dimension of possible singular point set $\mathcal{S}$ of suitable weak solutions and the parameter $α$ in the nonlinear term in the following parabolic equation $$h_t+h_{xxxx}+\partial_{xx}|h_x|^α=f.$$ It is shown that when $5/3\leqα<7/3$, the $\frac{3α-5}{α-1}$-dimensional parabolic Hausdorff measure of $\mathcal{S}$ is zero, which generalizes the recent corresponding work of Ozánski and Robinson in [31,SIAM J. Math. Anal. 51: 228--255, 2019] for $α=2$ and $f=0$. The same result is valid for a 3D modified Navier-Stokes system.

preprint2022arXiv

Robust topology optimization of structures under uncertain propagation of imprecise stochastic-based uncertain field

This study introduces a novel computational framework for Robust Topology Optimization (RTO) considering imprecise random field parameters. Unlike the worst-case approach, the present method provides upper and lower bounds for the mean and standard deviation of compliance as well as the optimized topological layouts of a structure for various scenarios. In the proposed approach, the imprecise random field variables are determined utilizing parameterized p-boxes with different confidence intervals. The Karhunen-Loève (K-L) expansion is extended to provide a spectral description of the imprecise random field. The linear superposition method in conjunction with a linear combination of orthogonal functions is employed to obtain explicit mathematical expressions for the first and second order statistical moments of the structural compliance. Then, an interval sensitivity analysis is carried out, applying the Orthogonal Similarity Transformation (OST) method with the boundaries of each of the intermediate variable searched efficiently at every iteration using a Combinatorial Approach (CA). Finally, the validity, accuracy, and applicability of the work are rigorously checked by comparing the outputs of the proposed approach with those obtained using the particle swarm optimization (PSO) and Quasi-Monte-Carlo Simulation (QMCS) methods. Three different numerical examples with imprecise random field loads are presented to show the effectiveness and feasibility of the study.

preprint2021arXiv

Electronic transport descriptors for the rapid screening of thermoelectric materials

The discovery of novel materials for thermoelectric energy conversion has potential to be accelerated by data-driven screening combined with high-throughput calculations. One way to increase the efficacy of successfully choosing a candidate material is through its evaluation using transport descriptors. Using a data-driven screening, we selected 12 potential candidates in the trigonal ABX2 family, followed by charge transport property simulations from first principles. The results suggest that carrier scattering processes in these materials are dominated by ionised impurities and polar optical phonons, contrary to the oft-assumed acoustic-phonon-dominated scattering. Combined with calculations of thermal conductivity based on three-phonon scattering, we predict p-type AgBiS2 and TlBiTe2 as potential high-performance thermoelectrics in the intermediate temperature range for low grade waste heat harvesting, with a predicted zT above 1 at 500 K. Using these data, we further derive ground-state transport descriptors for the carrier mobility and the thermoelectric power factor. In addition to low carrier mass, high dielectric constant was found to be an important factor towards high carrier mobility. A quadratic correlation between dielectric constant and transport performance was established and further validated with literature. Looking ahead, dielectric constant can potentially be exploited as an independent tuning knob for improving the thermoelectric performance.

preprint2021arXiv

HI mapping of the Leo Triplet: Morphologies and kinematics of tails and bridges

A fully-sampled and hitherto highest resolution and sensitivity observation of neutral hydrogen (HI) in the Leo Triplet (NGC 3628, M 65/NGC 3623, and M 66/NGC 3627) reveals six HI structures beyond the three galaxies. We present detailed results of the morphologies and kinematics of these structures, which can be used for future simulations. In particular, we detect a two-arm structure in the plume of NGC 3628 for the first time, which can be explained by a tidal interaction model. The optical counterpart of the plume is mainly associated with the southern arm. The connecting part (base) of the plume (directed eastwards) with NGC 3628 is located at the blueshifted (western) side of NGC 3628. Two bases appear to be associated with the two arms of the plume. A clump with reversed velocity gradient (relative to the velocity gradient of M 66) and a newly detected tail, i.e. M 66SE, is found in the southeast of M 66. We suspect that M 66SE represents gas from NGC 3628 which was captured by M 66 in the recent interaction between the two galaxies. Meanwhile gas is falling toward M 66, resulting in features already previously observed in the southeastern part of M 66, e.g. large line widths and double peaks. An upside-down `Y'-shaped HI gas component (M 65S) is detected in the south of M 65 which suggests that M 65 may also have been involved in the interaction. We strongly encourage modern hydrodynamical simulations of this interacting group of galaxies to reveal the origin of the gaseous debris surrounding all three galaxies.

preprint2020arXiv

Ab initio dipolar electron-phonon interactions in two-dimensional materials

We develop an ab initio formalism for dipolar electron-phonon interactions (EPI) in two-dimensional (2D) materials. Unlike purely longitudinal Fröhlich model, we show that the out-of-plane dipoles also contribute to the long-wavelength non-analytical behavior of EPI. And the 2D dipolar EPI plays an important role not only in the typical polar material MoS$_2$, but also in graphane and fluorinated graphene. By incorporating this formalism into Wannier-Fourier interpolation, we enable accurate EPI calculations for 2D materials and subsequent intrinsic carrier mobility prediction. The results show that Fröhlich model is inadequate for 2D materials and correct long-wavelength interaction must be included for the reliable prediction.

preprint2020arXiv

Extended HNCO, SiO, and HC$_{3}$N emission in 43 southern star-forming regions

We have selected 43 southern massive star-forming regions to study the spatial distribution of HNCO 4$_{04}$-3$_{03}$, SiO 2-1 and HC$_{3}$N 10-9 line emission and to investigate their spatial association with the dust emission. The morphology of HNCO 4$_{04}$-3$_{03}$ and HC$_{3}$N 10-9 agrees well with the dust emission. HC$_{3}$N 10-9 tends to originate from more compact regions than HNCO 4$_{04}$-3$_{03}$ and SiO 2-1. We divided our sources into three groups: those in the Central Molecular Zone (CMZ), those associated with bubbles (Bubble), and the remaining sources, which are termed 'normal star forming regions' (NMSFR). These three groups, subdivided into three different categories with respect to line widths, integrated intensities, and column densities, hint at the presence of different physical and chemical processes. We find that the dust temperature $T_{\rm d}$, and the abundance ratios of $N_{\rm HNCO}/N_{\rm SiO}$ and $N_{\rm HNCO}/N_{\rm HC3N}$ show a decreasing trend towards the central dense regions of CMZ sources, while $N_{\rm HC3N}/N_{\rm SiO}$ moves into the opposite direction. Moreover, a better agreement is found between $T_{\rm d}$ and $N_{\rm HC3N}/N_{\rm SiO}$ in Bubble and NMSFR category sources. Both outflow and inflow activities have been found in eight of the sixteen bubble and NMSFR sources. The low outflow detection rate indicates that in these sources the SiO 2-1 line wing emission is either below our sensitivity limit or that the bulk of the SiO emission may be produced by the expansion of an H{\sc\,ii} region or supernova remnant, which has pushed molecular gas away forming a shock and yielding SiO.

preprint2020arXiv

Load Balanced Dynamic Resource Allocation for MTC Relay

A Load Balancing Relay Algorithm (LBRA) was proposed to solve the unfair spectrum resource allocation in the traditional mobile MTC relay. In order to obtain reasonable use of spectrum resources, and a balanced MTC devices (MTCDs) distribution, spectrum resources are dynamically allocated by MTCDs regrouped on the MTCD to MTC gateway link. Moreover, the system outage probability and transmission capacity are derived when using LBRA. The numerical results show that the proposed algorithm has better performance in transmission capacity and outage probability than the traditional method. LBRA had an increase in transmission capacity of about 0.7dB, and an improvement in outage probability of about 0.8dB with a high MTCD density.

preprint2020arXiv

Modeling, Analysis, and Optimization of Grant-Free NOMA in Massive MTC via Stochastic Geometry

Massive machine-type communications (mMTC) is a crucial scenario to support booming Internet of Things (IoTs) applications. In mMTC, although a large number of devices are registered to an access point (AP), very few of them are active with uplink short packet transmission at the same time, which requires novel design of protocols and receivers to enable efficient data transmission and accurate multi-user detection (MUD). Aiming at this problem, grant-free non-orthogonal multiple access (GF-NOMA) protocol is proposed. In GF-NOMA, active devices can directly transmit their preambles and data symbols altogether within one time frame, without grant from the AP. Compressive sensing (CS)-based receivers are adopted for non-orthogonal preambles (NOP)-based MUD, and successive interference cancellation is exploited to decode the superimposed data signals. In this paper, we model, analyze, and optimize the CS-based GF-MONA mMTC system via stochastic geometry (SG), from an aspect of network deployment. Based on the SG network model, we first analyze the success probability as well as the channel estimation error of the CS-based MUD in the preamble phase and then analyze the average aggregate data rate in the data phase. As IoT applications highly demands low energy consumption, low infrastructure cost, and flexible deployment, we optimize the energy efficiency and AP coverage efficiency of GF-NOMA via numerical methods. The validity of our analysis is verified via Monte Carlo simulations. Simulation results also show that CS-based GF-NOMA with NOP yields better MUD and data rate performances than contention-based GF-NOMA with orthogonal preambles and CS-based grant-free orthogonal multiple access.

preprint2020arXiv

NH$_{3}$ (1,1) hyperfine intensity anomalies in the Orion A molecular cloud

In LTE, the two inner satellite lines (ISLs) and the two outer satellite lines (OSLs) of the NH$_{3}$ (1,1) transition are each predicted to have equal intensities. However, hyperfine intensity anomalies (HIAs) are observed to be omnipresent in star formation regions, which is still not fully understood. In addressing this issue, we find that the computation method of the HIA by the ratio of the peak intensities may have defects, especially when being used to process the spectra with low velocity dispersions. Therefore we define the integrated HIAs of the ISLs (HIA$_{\rm IS}$) and OSLs (HIA$_{\rm OS}$) by the ratio of their redshifted to blueshifted integrated intensities and develop a procedure to calculate them. Based on this procedure, we present a systematic study of the integrated HIAs in the northern part of the Orion A MC. We find that integrated HIA$_{\rm IS}$ and HIA$_{\rm OS}$ are commonly present in the Orion A MC and no clear distinction is found at different locations of the MC. The medians of the integrated HIA$_{\rm IS}$ and HIA$_{\rm OS}$ are 0.921$\pm$0.003 and 1.422$\pm$0.009, respectively, which is consistent with the HIA core model and inconsistent with the CE model. Selecting those 170 positions where both integrated HIAs deviate by more than 3-$σ$ from unity, most (166) are characterized by HIA$_{\rm IS}$<1 and HIA$_{\rm OS}$>1, which suggests that the HIA core model plays a more significant role than the CE model. The remaining four positions are consistent with the CE model. We compare the integrated HIAs with the para-NH$_{3}$ column density ($N$(para-NH$_{3}$)), kinetic temperature ($T_{\rm K}$), total velocity dispersion ($σ_{\rm v}$), non-thermal velocity dispersion ($σ_{\rm NT}$), and the total opacity of the NH$_{3}$ (1,1) line ($τ_{0}$). Their correlations can not be fully explained by neither the HIA core nor the CE model.

preprint2020arXiv

Scalable Bid Landscape Forecasting in Real-time Bidding

In programmatic advertising, ad slots are usually sold using second-price (SP) auctions in real-time. The highest bidding advertiser wins but pays only the second-highest bid (known as the winning price). In SP, for a single item, the dominant strategy of each bidder is to bid the true value from the bidder's perspective. However, in a practical setting, with budget constraints, bidding the true value is a sub-optimal strategy. Hence, to devise an optimal bidding strategy, it is of utmost importance to learn the winning price distribution accurately. Moreover, a demand-side platform (DSP), which bids on behalf of advertisers, observes the winning price if it wins the auction. For losing auctions, DSPs can only treat its bidding price as the lower bound for the unknown winning price. In literature, typically censored regression is used to model such partially observed data. A common assumption in censored regression is that the winning price is drawn from a fixed variance (homoscedastic) uni-modal distribution (most often Gaussian). However, in reality, these assumptions are often violated. We relax these assumptions and propose a heteroscedastic fully parametric censored regression approach, as well as a mixture density censored network. Our approach not only generalizes censored regression but also provides flexibility to model arbitrarily distributed real-world data. Experimental evaluation on the publicly available dataset for winning price estimation demonstrates the effectiveness of our method. Furthermore, we evaluate our algorithm on one of the largest demand-side platforms and significant improvement has been achieved in comparison with the baseline solutions.

preprint2020arXiv

Structured Policy Iteration for Linear Quadratic Regulator

Linear quadratic regulator (LQR) is one of the most popular frameworks to tackle continuous Markov decision process tasks. With its fundamental theory and tractable optimal policy, LQR has been revisited and analyzed in recent years, in terms of reinforcement learning scenarios such as the model-free or model-based setting. In this paper, we introduce the \textit{Structured Policy Iteration} (S-PI) for LQR, a method capable of deriving a structured linear policy. Such a structured policy with (block) sparsity or low-rank can have significant advantages over the standard LQR policy: more interpretable, memory-efficient, and well-suited for the distributed setting. In order to derive such a policy, we first cast a regularized LQR problem when the model is known. Then, our Structured Policy Iteration (S-PI) algorithm, which takes a policy evaluation step and a policy improvement step in an iterative manner, can solve this regularized LQR efficiently. We further extend the S-PI algorithm to the model-free setting where a smoothing procedure is adopted to estimate the gradient. In both the known-model and model-free setting, we prove convergence analysis under the proper choice of parameters. Finally, the experiments demonstrate the advantages of S-PI in terms of balancing the LQR performance and level of structure by varying the weight parameter.

preprint2020arXiv

Studies of the distinct regions due to CO selective dissociation in the Aquila molecular cloud

Aims. We investigate the role of selective dissociation in the process of star formation by comparing the physical parameters of protostellar-prestellar cores and the distinct regions with the CO isotope distributions in photodissociation regions. We seek to understand whether there is a better connection between the evolutionary age of star forming regions and the effect of selective dissociation Methods. Wide-field observations of the $\rm ^{12}CO$, $\rm ^{13}CO$, and $\rm C^{18}O$ ( J = 1 - 0) emission lines are used to study the ongoing star formation activity in the Aquila molecular region, and the 70 $μ$m and 250 $μ$m data are used to describe the heating of the surrounding material and as an indicator of the evolutionary age of the core. Results. The protostellar-prestellar cores are found at locations with the highest $\rm C^{18}O$ column densities and their increasing evolutionary age would relate to an increasing 70$μ$m/250$μ$m emission ratio at their location. An evolutionary age of the cores may also follow from the $\rm ^{13}CO$ versus $\rm C^{18}O$ abundance ratio, which decreases with increasing $\rm C^{18}O$ column densities. The original mass has been estimated for nine representative star formation regions and the original mass of the region correlated well with the integrated 70 $μ$m flux density. Similarly, the $ X_{\rm ^{13}CO}$/$X_{\rm C^{18}O}$ implying the dissociation rate for these regions correlates with the 70$μ$m/250$μ$m flux density ratio and reflects the evolutionary age of the star formation activity.

preprint2016arXiv

A New Method for Computing $φ$-functions and Their Condition Numbers of Large Sparse Matrices

We propose a new method for computing the $φ$-functions of large sparse matrices with low rank or fast decaying singular values. The key is to reduce the computation of $φ_{\ell}$-functions of a large matrix to $φ_{\ell+1}$-functions of some $r$-by-$r$ matrices, where $r$ is the numerical rank of the large matrix in question. Some error analysis on the new method is given. Furthermore, we propose two novel strategies for estimating 2-norm condition numbers of the $φ$-functions. Numerical experiments illustrate the numerical behavior of the new algorithms and show the effectiveness of our theoretical results.

preprint2016arXiv

Estimating the Distance Between Macro Base Station and Users in Heterogeneous Networks

In underlay heterogeneous networks (HetNets), the distance between a macro base station (MBS) and a macro user (MU) is crucial for a small-cell based station (SBS) to control the interference to the MU and achieve the coexistence. To obtain the distance between the MBS and the MU, the SBS needs a backhaul link from the macro system, such that the macro system is able to transmit the information of the distance to the SBS through the backhaul link. However, there may not exist any backhaul link from the macro system to the SBS in practical situations. Thus, it is challenging for the SBS to obtain the distance. To deal with this issue, we propose a median based (MB) estimator for the SBS to obtain the distance between the MBS and the MU without any backhaul link. Numerical results show that the estimation error of the MB estimator can be as small as $4\%$.

preprint2016arXiv

Learning-Based Coexistence in Two-Tier Heterogeneous Networks with Cognitive Small Cells

We study the coexistence problem in a two-tier heterogeneous network (HetNet) with cognitive small cells. In particular, we consider an underlay HetNet, where the cognitive small base station (C-SBS) is allowed to use the frequency bands of the macro cell with an access probability (AP) as long as the C-SBS satisfies a preset interference probability (IP) constraint at macro users (MUs). To enhance the AP (or transmission opportunity) of the C-SBS, we propose a learning-based algorithm for the C-SBS and exploit the distance information between the macro base station (MBS) and MUs. Generally, the signal from the MBS to a specific MU contains the distance information between the MBS to the MU. We enable the C-SBS to analyze the MBS signal on a target frequency band, and learn the distance information between the MBS and the corresponding MU. With the learnt distance information, we calculate the upper bound of the probability that the C-SBS may interfere with the MU, and design an AP with a closed-form expression under the IP constraint. Numerical results indicate that the proposed algorithm outperforms the existing methods up to $60\%$ AP (or transmission opportunity).

preprint2016arXiv

On the convergence of harmonic Ritz vectors and harmonic Ritz values

We are interested in computing a simple eigenpair $(λ,{\bf x})$ of a large non-Hermitian matrix $A$, by a general harmonic Rayleigh-Ritz projection method. Given a search subspace $\mathcal{K}$ and a target point $τ$, we focus on the convergence of the harmonic Ritz vector $\widetilde{\bf x}$ and harmonic Ritz value $\widetildeλ$. In [{Z. Jia}, {\em The convergence of harmonic Ritz values, harmonic Ritz vectors, and refined harmonic Ritz vectors}, Math. Comput., 74 (2004), pp. 1441--1456.], Jia showed that for the convergence of harmonic Ritz vector and harmonic Ritz value, it is essential to assume certain Rayleigh quotient matrix being {\it uniformly nonsingular} as $\angle({\bf x},\mathcal{K})\rightarrow 0$. However, this assumption can not be guaranteed theoretically for a general matrix $A$, and the Rayleigh quotient matrix can be singular or near singular even if $τ$ is not close to $λ$. In this paper, we abolish this constraint and derive new bounds for the convergence of harmonic Rayleigh-Ritz projection methods. We show that as the distance between ${\bf x}$ and $\mathcal{K}$ tends to zero and $τ$ is satisfied with the so-called {\it uniform separation condition}, the harmonic Ritz value converges, and the harmonic Ritz vector converges as $\frac{1}{λ-τ}$ is well separated from other Ritz values of $(A-τI)^{-1}$ in the orthogonal complement of $(A-τI)\widetilde{\bf x}$ with respect to $(A-τI)\mathcal{K}$.

preprint2016arXiv

Primary Channel Gain Estimation for Spectrum Sharing in Cognitive Radio Networks

In cognitive radio networks, the channel gain between primary transceivers, namely, primary channel gain, is crucial for a cognitive transmitter (CT) to control the transmit power and achieve spectrum sharing. Conventionally, the primary channel gain is estimated in the primary system and thus unavailable at the CT. To deal with this issue, two estimators are proposed by enabling the CT to sense primary signals. In particular, by adopting the maximum likelihood (ML) criterion to analyze the received primary signals, a ML estimator is first developed. After demonstrating the high computational complexity of the ML estimator, a median based (MB) estimator with proved low complexity is then proposed. Furthermore, the estimation accuracy of the MB estimation is theoretically characterized. By comparing the ML estimator and the MB estimator from the aspects of the computational complexity as well as the estimation accuracy, both advantages and disadvantages of two estimators are revealed. Numerical results show that the estimation errors of the ML estimator and the MB estimator can be as small as $0.6$ dB and $0.7$ dB, respectively.

preprint2016arXiv

Properties of massive star-forming clumps with infall motions

In this work, we aim to characterise high-mass clumps with infall motions. We selected 327 clumps from the Millimetre Astronomy Legacy Team 90-GHz (MALT90) survey, and identified 100 infall candidates. Combined with the results of He et al. (2015), we obtained a sample of 732 high-mass clumps, including 231 massive infall candidates and 501 clumps where infall is not detected. Objects in our sample were classified as pre-stellar, proto-stellar, HII or photo-dissociation region (PDR). The detection rates of the infall candidates in the pre-stellar, proto-stellar, HII and PDR stages are 41.2%, 36.6%, 30.6% and 12.7%, respectively. The infall candidates have a higher H$_{2}$ column density and volume density compared with the clumps where infall is not detected at every stage. For the infall candidates, the median values of the infall rates at the pre-stellar, proto-stellar, HII and PDR stages are 2.6$\times$10$^{-3}$, 7.0$\times$10$^{-3}$, 6.5$\times$10$^{-3}$ and 5.5$\times$10$^{-3}$ M$_\odot$ yr$^{-1}$, respectively. These values indicate that infall candidates at later evolutionary stages are still accumulating material efficiently. It is interesting to find that both infall candidates and clumps where infall is not detected show a clear trend of increasing mass from the pre-stellar to proto-stellar, and to the HII stages. The power indices of the clump mass function (ClMF) are 2.04$\pm$0.16 and 2.17$\pm$0.31 for the infall candidates and clumps where infall is not detected, respectively, which agree well with the power index of the stellar initial mass function (2.35) and the cold Planck cores (2.0).

preprint2015arXiv

Efficient Scheduling and Power Allocation for D2D-assisted Wireless Caching Networks

We study an one-hop device-to-device (D2D) assisted wireless caching network, where popular files are randomly and independently cached in the memory of end-users. Each user may obtain the requested files from its own memory without any transmission, or from a helper through an one-hop D2D transmission, or from the base station (BS). We formulate a joint D2D link scheduling and power allocation problem to maximize the system throughput. However, the problem is non-convex and obtaining an optimal solution is computationally hard. Alternatively, we decompose the problem into a D2D link scheduling problem and an optimal power allocation problem. To solve the two subproblems, we first develop a D2D link scheduling algorithm to select the largest number of D2D links satisfying both the signal to interference plus noise ratio (SINR) and the transmit power constraints. Then, we develop an optimal power allocation algorithm to maximize the minimum transmission rate of the scheduled D2D links. Numerical results indicate that both the number of the scheduled D2D links and the system throughput can be improved simultaneously with the Zipf-distribution caching scheme, the proposed D2D link scheduling algorithm, and the proposed optimal power allocation algorithm compared with the state of arts.

preprint2015arXiv

Energy Efficient Resource Allocation for Control Data Separation Architecture based H-CRAN with Heterogeneous Fronthaul

Control data separation architecture (CDSA) is a more efficient architecture to overcome the overhead issue than the conventional cellular networks, especially for the huge bursty traffic like Internet of Things, and over-the-top (OTT) content service. In this paper, we study the optimization issue of network energy efficiency of the CDSA-based heterogeneous cloud radio access networks (H-CRAN) networks, which has heterogeneous fronthaul between control base station (CBS) and data base stations (DBSs). We first present a modified power consumption model for the CDSA-based H-CRAN, and then formulate the optimization problem with constraint of overall capacity of wireless fronthaul. We work out the resource assignment and power allocation by the convex relaxation approach Using fractional programming method and Lagrangian dual decomposition method, we derive the close-form optimal solution and verify it by comprehensive system-level simulation. The simulation results show that our proposed algorithm has 8% EE gain compared to the static algorithm, and the CDSA-based H-CRAN networks can achieve up to 16% EE gain compared to the conventional network even under strict fronthaul capacity limit.

preprint2015arXiv

Inexact Krylov Subspace Algorithms for Large Matrix Exponential Eigenproblem from Dimensionality Reduction

Matrix exponential discriminant analysis (EDA) is a generalized discriminant analysis method based on matrix exponential. It can essentially overcome the intrinsic difficulty of small sample size problem that exists in the classical linear discriminant analysis (LDA). However, for data with high dimension, one has to solve a large matrix exponential eigenproblem in this method, and the time complexity is dominated by the computation of exponential of large matrices. In this paper, we propose two inexact Krylov subspace algorithms for solving the large matrix exponential eigenproblem effectively. The contribution of this work is threefold. First, we consider how to compute matrix exponential-vector products efficiently, which is the key step in the Krylov subspace method. Second, we compare the discriminant analysis criterion of EDA and that of LDA from a theoretical point of view. Third, we establish a relationship between the accuracy of the approximate eigenvectors and the distance to nearest neighbour classifier, and show why the matrix exponential eigenproblem can be solved approximately in practice. Numerical experiments on some real-world databases show superiority of our new algorithms over many state-of-the-art algorithms for face recognition.

preprint2015arXiv

Inexact Shift-and-Invert Arnoldi for Toeplitz Matrix Exponential

We revisit the shift-and-invert Arnoldi method proposed in [S. Lee, H. Pang, and H. Sun. {\it Shift-invert Arnoldi approximation to the Toeplitz matrix exponential}, SIAM J. Sci. Comput., 32: 774--792, 2010] for numerical approximation to the product of Toeplitz matrix exponential with a vector. In this approach, one has to solve two large scale Toeplitz linear systems in advance. However, if the desired accuracy is high, the cost will be prohibitive. Therefore, it is interesting to investigate how to solve the Toeplitz systems inexactly in this method. The contribution of this paper is in three regards. First, we give a new stability analysis on the Gohberg-Semencul formula (GSF) and define the GSF condition number of a Toeplitz matrix. It is shown that, when the size of the Toeplitz matrix is large, our result is sharper than the one given in [M. Gutknecht and M. Hochbruck. {\it The stability of inversion formulas for Toeplitz matrices}, Linear Algebra Appl., 223/224: 307--324, 1995]. Second, we establish a relation between the error of Toeplitz systems and the residual of Toeplitz matrix exponential. We show that if the GSF condition number of the Toeplitz matrix is medium sized, then the Toeplitz systems can be solved in a low accuracy. Third, based on this relationship, we present a practical stopping criterion for relaxing the accuracy of the Toeplitz systems, and propose an inexact shift-and-invert Arnoldi algorithm for the Toeplitz matrix exponential problem. Numerical experiments illustrate the numerical behavior of the new algorithm, and show the effectiveness of our theoretical results.

preprint2015arXiv

Infall Motions in Massive Star-Forming Regions: Results from Years 1 & 2 of the MALT90 Survey

Massive star-forming regions with observed infall motions are good sites for studying the birth of massive stars. In this paper, 405 compact sources have been extracted from the APEX Telescope Large Area Survey of the Galaxy (ATLASGAL) compact sources that also have been observed in the Millimetre Astronomy Legacy Team 90 GHz (MALT90) survey during Years 1 and 2. These observations are complemented with Spitzer GLIMPSE/MIPSGAL mid-IR survey data to help classify the elected star-forming clumps into three evolutionary stages: pre-stellar, proto-stellar and UCHII regions. The results suggest that 0.05 g cm$^{-2}$ is a reliable empirical lower bound for the clump surface densities required for massive-star formation to occur. The optically thick HCO$^{+}$(1-0) and HNC(1-0) lines, as well as the optically thin N$_{2}$H$^{+}$(1-0) line were used to search for infall motions toward these sources. By analyzing the asymmetries of the optically thick HCO$^{+}$(1-0) and HNC(1-0) lines and the mapping observations of HCO$^{+}$(1-0), a total of 131 reliable infall candidates have been identified. The HCO$^{+}$(1-0) line shows the highest occurrence of obvious asymmetric features, suggesting that it may be a better infall motion tracer than other lines such as HNC(1-0). The detection rates of infall candidates toward pre-stellar, proto-stellar and UCHII clumps are 0.3452, 0.3861 and 0.2152, respectively. The relatively high detection rate of infall candidates toward UCHII clumps indicates that many UCHII regions are still accreting matter. The peak column densities and masses of the infall candidates, in general, display a increasing trend with progressing evolutionary stages. However, the rough estimates of the mass infall rate show no obvious variation with evolutionary stage.

preprint2015arXiv

Joint Channel-and-Data Estimation for Large-MIMO Systems with Low-Precision ADCs

The use of low precision (e.g., 1-3 bits) analog-to-digital convenors (ADCs) in very large multiple-input multiple-output (MIMO) systems is a technique to reduce cost and power consumption. In this context, nevertheless, it has been shown that the training duration is required to be {\em very large} just to obtain an acceptable channel state information (CSI) at the receiver. A possible solution to the quantized MIMO systems is joint channel-and-data (JCD) estimation. This paper first develops an analytical framework for studying the quantized MIMO system using JCD estimation. In particular, we use the Bayes-optimal inference for the JCD estimation and realize this estimator utilizing a recent technique based on approximate message passing. Large-system analysis based on the replica method is then adopted to derive the asymptotic performances of the JCD estimator. Results from simulations confirm our theoretical findings and reveal that the JCD estimator can provide a significant gain over conventional pilot-only schemes in the quantized MIMO system.

preprint2015arXiv

On the correction equation of the Jacobi-Davidson method

The Jacobi-Davidson method is one of the most popular approaches for iteratively computing a few eigenvalues and their associated eigenvectors of a large matrix. The key of this method is to expand the search subspace via solving the Jacobi-Davidson correction equation, whose coefficient matrix is singular. It is believed long by scholars that the Jacobi-Davidson correction equation is a consistent linear system. In this work, we point out that the correction equation may have a unique solution or have no solution at all, and we derive a computable necessary and sufficient condition for cheaply judging the existence and uniqueness of solution of the correction equation. Furthermore, we consider the difficulty of stagnation that bothers the Jacobi-Davidson method, and verify that if the Jacobi-Davidson method stagnates, then the corresponding Ritz value is a defective eigenvalue of the projection matrix. We provide a computable necessary and sufficient condition for expanding the search subspace successfully. The properties of the Jacobi-Davidson method with preconditioning and some alternative Jacobi-Davidson correction equations are also discussed.

preprint2015arXiv

Partial regularity of suitable weak solutions to the multi-dimensional generalized magnetohydrodynamics equations

In this paper, we are concerned with the partial regularity of the suitable weak solutions to the fractional MHD equations in $\mathbb{R}^{n}$ for $n=2,\,3$. In comparison with the work of the 3D fractional Navier-Stokes equations obtained by Tang and Yu in [24, Commun. Math. Phys. 334: 1455--1482, 2015], our results include their endpoint case $α=3/4$ and the external force belongs to more general parabolic Morrey space. Moreover, we prove some interior regularity criteria just via the scaled mixed norm of the velocity for the suitable weak solutions to the fractional MHD equations.

preprint2015arXiv

Phase diagram and superconductivity of polonium hydrides under high pressure

High pressure structures, phase diagram and superconductivity of polonium hydrides have been systematically investigated through the first-principles calculations based on the density functional theory. With the increasing pressure, several stoichiometries (PoH, $\textrm{PoH}_\textrm{2}$, $\textrm{PoH}_4$ and $\textrm{PoH}_6$) are predicted to stabilize in the excess hydrogen environment. All of the reported hydrides, exception of PoH, exhibit intriguing structural character with the appearing $\textrm{H}_2$ units. Moreover, our electronic band structure and the projected density of states (PDOS) demonstrate that these energetically stable phases are metallic. The application of the Allen-Dynes modified McMillan equation with the calculated electron-phonon coupling parameter reveals that $\textrm{PoH}_4$ is a superconductor with a critical temperature $T_c$ of 41.2-47.2 K at 300 GPa.

preprint2014arXiv

A framework of the harmonic Arnoldi method for evaluating $φ$-functions with applications to exponential integrators

In recent years, a great deal of attention has been focused on numerically solving exponential integrators. The important ingredient to the implementation of exponential integrators is the efficient and accurate evaluation of the so called $φ$-functions on a given vector. The Krylov subspace method is an important technique for this problem. For this type of method, however, restarts become essential for the sake of storage requirements or due to the growing computational complexity of evaluating the matrix function on a Hessenberg matrix of growing size. Another problem in computing $φ$-functions is the lack of a clear residual notion. The contribution of this work is threefold. First, we introduce a framework of the harmonic Arnoldi method for $φ$-functions, which is based on the residual and the oblique projection technique. Second, we establish the relationship between the harmonic Arnoldi approximation and the classical Arnoldi approximation, and compare the harmonic Arnoldi method with the Arnoldi method from a theoretical point of view. Third, we apply the thick-restarting strategy to the harmonic Arnoldi method, and propose a thick-restated harmonic Arnoldi algorithm for evaluating $φ$-functions. An advantage of the new algorithm is that we can compute several $φ$-functions simultaneously in the same search subspace. We show the merit of augmenting approximate eigenvectors in the search subspace, and give insight into the relationship between the error and the residual of $φ$-functions. Numerical experiments show the superiority of our new algorithm over many state-of-the-art algorithms for the computation of $φ$-functions.

preprint2014arXiv

A theoretical contribution to the fast implementation of null linear discriminant analysis method using random matrix multiplication with scatter matrices

The null linear discriminant analysis method is a competitive approach for dimensionality reduction. The implementation of this method, however, is computationally expensive. Recently, a fast implementation of null linear discriminant analysis method using random matrix multiplication with scatter matrices was proposed. However, if the random matrix is chosen arbitrarily, the orientation matrix may be rank deficient, and some useful discriminant information will be lost. In this paper, we investigate how to choose the random matrix properly, such that the two criteria of the null LDA method are satisfied theoretically. We give a necessary and sufficient condition to guarantee full column rank of the orientation matrix. Moreover, the geometric characterization of the condition is also described.

preprint2014arXiv

Anisotropic regularity conditions for the suitable weak solutions to the 3d Navier-Stokes equations

We are concerned with the problem,originated from Seregin [18,19,20], what are minimal sufficiently conditions for the regularity of suitable weak solutions to the 3d Naiver-Stokes equations. We prove some interior regularity criteria, in terms of either one component of the velocity with sufficiently small local scaled norm and the rest part with bounded local scaled norm, or horizontal part of the vorticity with sufficiently small local scaled norm and the vertical part with bounded local scaled norm. It is also shown that only the smallness on the local scaled $L^{2}$ norm of horizontal gradient without any other condition on the vertical gradient can still ensure the regularity of suitable weak solutions. All these conclusions improve pervious results on the local scaled norm type regularity conditions.

preprint2014arXiv

EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimization

Recently, there have been growing interests in solving consensus optimization problems in a multi-agent network. In this paper, we develop a decentralized algorithm for the consensus optimization problem $$\min\limits_{x\in\mathbb{R}^p}~\bar{f}(x)=\frac{1}{n}\sum\limits_{i=1}^n f_i(x),$$ which is defined over a connected network of $n$ agents, where each function $f_i$ is held privately by agent $i$ and encodes the agent's data and objective. All the agents shall collaboratively find the minimizer while each agent can only communicate with its neighbors. Such a computation scheme avoids a data fusion center or long-distance communication and offers better load balance to the network. This paper proposes a novel decentralized EXact firsT-ordeR Algorithm (abbreviated as EXTRA) to solve the consensus optimization problem. "exact" means that it can converge to the exact solution. EXTRA can use a fixed large step size, {which is independent of the network size}, and has synchronized iterations. The local variable of every agent $i$ converges uniformly and consensually to an exact minimizer of $\bar{f}$. In contrast, the well-known decentralized gradient descent (DGD) method must use diminishing step sizes in order to converge to an exact minimizer. EXTRA and DGD have the same choice of mixing matrices and similar per-iteration complexity. EXTRA, however, uses the gradients of last two iterates, unlike DGD which uses just that of last iterate. EXTRA has the best known convergence rates among the existing first-order decentralized algorithms. Specifically, if $f_i$'s are convex and have Lipschitz continuous gradients, EXTRA has an ergodic convergence rate $O(\frac{1}{k})$ in terms of the first-order optimality residual. If $\bar{f}$ is also restricted strongly convex, EXTRA converges to an optimal solution at a linear rate $O(C^{-k})$ for some constant $C>1$.

preprint2014arXiv

Filament L1482 in the California molecular cloud

Aims. The process of gravitational fragmentation in the L1482 molecular filament of the California molecular cloud is studied by combining several complementary observations and physical estimates. We investigate the kinematic and dynamical states of this molecular filament and physical properties of several dozens of dense molecular clumps embedded therein. Methods. We present and compare molecular line emission observations of the J=2--1 and J=3--2 transitions of 12CO in this molecular complex, using the KOSMA 3-meter telescope. These observations are complemented with archival data observations and analyses of the 13CO J=1--0 emission obtained at the Purple Mountain Observatory 13.7-meter radio telescope at Delingha Station in QingHai Province of west China, as well as infrared emission maps from the Herschel Space Telescope online archive, obtained with the SPIRE and PACS cameras. Comparison of these complementary datasets allow for a comprehensive multi-wavelength analysis of the L1482 molecular filament. Results. We have identified 23 clumps along the molecular filament L1482 in the California molecular cloud. All these molecular clumps show supersonic non-thermal gas motions. While surprisingly similar in mass and size to the much better known Orion molecular cloud, the formation rate of high-mass stars appears to be suppressed in the California molecular cloud relative to that in the Orion molecular cloud based on the mass-radius threshold derived from the static Bonnor Ebert sphere. Our analysis suggests that these molecular filaments are thermally supercritical and molecular clumps may form by gravitational fragmentation along the filament. Instead of being static, these molecular clumps are most likely in processes of dynamic evolution.

preprint2014arXiv

H2CO and H110α observations towards NH3 sources

We observed the H2CO(110-111) absorption lines and H110α radio recombination lines (RRL) toward 180 NH3 sources using the Nanshan 25-m radio telescope. In our observation, 138 sources were found to have H2CO lines and 36 have H110α RRLs. Among the 138 detected H2CO sources, 38 sources were first detected. The detection rates of H2CO have a better correlation with extinction than with background continuum radiation. Line center velocities of H2CO and NH3 agree well. The line width ratios of H2CO and NH3 are generally larger than 1 and are similar to that of 13CO. The correlation between column densities of H2CO and extinction is better than that between NH3 and extinction. These line width relation and column density relation indicate H2CO is distributed on a larger scale than that of NH3, being similar to the regions of 13CO. The abundance ratios between NH3 and H2CO were found to be different in local clouds and other clouds.

preprint2014arXiv

Nanoscale study of reactive transport in catalyst layer of proton exchange membrane fuel cells with precious and non-precious catalysts using lattice Boltzmann method

High-resolution porous structures of catalyst layer (CL) with multicomponent in proton exchange membrane fuel cells are reconstructed using a reconstruction method called quartet structure generation set. Characterization analyses of nanoscale structures are implemented including pore size distribution, specific area and phase connectivity. Pore-scale simulation methods based on the lattice Boltzmann method are developed and used to predict the macroscopic transport properties including effective diffusivity and proton conductivity. Nonuniform distributions of ionomer in CL generates more tortuous pathway for reactant transport and greatly reduces the effective diffusivity. Tortuosity of CL is much higher than conventional Bruggeman equation adopted. Knudsen diffusion plays a significant role in oxygen diffusion and significantly reduces the effective diffusivity. Reactive transport inside the CL is also investigated. Although the reactive surface area of non-precious metal catalyst (NPMC) CL is much higher than that of Pt CL, the oxygen reaction rate is quite lower in NPMC CL compared with that in Pt CL, due to much lower reaction rate. Micropores (a few nanometers) in NPMC CL although can increase reactive sites, contribute little to enhance the mass transport. Mesopores (few tens of nanometers) or macropores are required to increase the mass transport rate.

preprint2014arXiv

On the Linear Convergence of the ADMM in Decentralized Consensus Optimization

In decentralized consensus optimization, a connected network of agents collaboratively minimize the sum of their local objective functions over a common decision variable, where their information exchange is restricted between the neighbors. To this end, one can first obtain a problem reformulation and then apply the alternating direction method of multipliers (ADMM). The method applies iterative computation at the individual agents and information exchange between the neighbors. This approach has been observed to converge quickly and deemed powerful. This paper establishes its linear convergence rate for decentralized consensus optimization problem with strongly convex local objective functions. The theoretical convergence rate is explicitly given in terms of the network topology, the properties of local objective functions, and the algorithm parameter. This result is not only a performance guarantee but also a guideline toward accelerating the ADMM convergence.

preprint2014arXiv

Preconditioning the Restarted and Shifted Block FOM Algorithm for Matrix Exponential Computation

The approximation of $e^{tA}B$ where $A$ is a large sparse matrix and $B$ a rectangular matrix is the key ingredient in many scientific and engineering computations. A powerful tool to manage the matrix exponential function is to resort to a suitable rational approximation such as the Carath$\acute{\rm e}$odory-Fej$\acute{\rm e}$r approximation, whose core reduces to solve shifted linear systems with multiple right-hand sides. The restarted and shifted block FOM algorithm is a commonly used technique for this problem. However, determining good preconditioners for shifted systems that preserve the original structure is a difficult task. In this paper, we propose a new preconditioner for the restarted and shifted block FOM algorithm. The key is that the absolute values of the poles of the Carath$\acute{\rm e}$odory-Fej$\acute{\rm e}$r approximation are medium sized and can be much smaller than the norm of the matrix in question. The advantages of the proposed strategy are that we can precondition all the shifted linear systems simultaneously, and preserve the original structure of the shifted linear systems after restarting. Theoretical results are provided to show the rationality of our preconditioning strategy. Applications of the new approach to Toeplitz matrix exponential problem are also discussed. Numerical experiments illustrate the superiority of the new algorithm over many state-of-the-art algorithms for matrix exponential.

preprint2013arXiv

A detailed study of the high-mass clump interacting with the bubble N10

We performed a detailed study of the high-mass clump interacting with bubble N10 based on the spectral lines $^{12}CO(3-2)$, $HCO^+(4-3)$, $N_2H^+(4-3)$ and $CH_3OH(7(0,7)-6(0,6))$ and continuum emission data at 450 $μ$m and 850 $μ$m released on CADC and Spitzer data. Blue-shifted optically thick line $^{12}CO (3-2)$ seems to indicate that the outer envelope of the high-mass clump is still falling toward the center. Detection of $CH_3OH(7(0,7)-6(0,6))$ suggests that a hot core has formed around YSO N10-7. And position-velocity diagram of $N_2H^+ (4-3)$ indicates the cold dense core of the clump has not been destroyed by the star formation activities. The mass of N10-7 is about 27.44 $M_\odot$. The ratio $HCO^+(4-3)/N_2H^+ (4-3)$ in the outer part of the clump is larger than that in the inner part of it. The reason may be that the CO abundance relative to $N_2H^+ (4-3)$ increased in the outer part of the high-mass clump, more $N_2H^+ (4-3)$ were converted into $HCO^+(4-3)$.

preprint2013arXiv

The relation of H2CO, 12CO, and 13CO in molecular clouds

Aims. We seek to understand how the 4.8 GHz formaldehyde absorption line is distributed in the MON R2, S156, DR17/L906, and M17/M18 regions. More specifically, we look for the relationship among the H2CO, 12CO, and 13CO spectral lines. Methods. The four regions of MON R2 (60'x90'), S156 (5'0x70'), DR17/L906 (40'x60'), and M17 /M18 (70'x80')were observed for H2CO (beam 10'), H110a recombination (beam 10'), 6 cm continuum (beam 10'), 12CO (beam 1'), and 13CO (beam 1'). We compared the H2CO,12CO,13CO, and continuum distributions, and also the spectra line parameters of H2CO,12CO, and 13CO. Column densities of H2CO,13CO, and H2 were also estimated. Results. We found out that the H2CO distribution is similar to the 12CO and the 13CO distributions on a large scale. The correlation between the 13 CO and the H2CO distributions is better than between the 12CO and H2CO distributions. The H2CO and the 13CO tracers systematically provide consistent views of the dense regions. T heir maps have similar shapes, sizes, peak positions, and molecular spectra and present similar centr al velocities and line widths. Such good agreement indicates that the H2CO and the 13CO arise from similar regions.

preprint2013arXiv

Utility-maximization Resource Allocation for Device-to-Device Communication Underlaying Cellular Networks

Device-to-device(D2D) underlaying communication brings great benefits to the cellular networks from the improvement of coverage and spectral efficiency at the expense of complicated transceiver design. With frequency spectrum sharing mode, the D2D user generates interference to the existing cellular networks either in downlink or uplink. Thus the resource allocation for D2D pairs should be designed properly in order to reduce possible interference, in particular for uplink. In this paper, we introduce a novel bandwidth allocation scheme to maximize the utilities of both D2D users and cellular users. Since the allocation problem is strongly NP-hard, we apply a relaxation to the association indicators. We propose a low-complexity distributed algorithm and prove the convergence in a static environment. The numerical result shows that the proposed scheme can significant improve the performance in terms of utilities.The performance of D2D communications depends on D2D user locations, the number of D2D users and QoS(Quality of Service) parameters.

preprint2012arXiv

22GHz water maser survey of Xinjiang Astronomical Observatory

Water masers are good tracers of high-mass star-forming regions. Water maser VLBI observations provide a good probe to study high-mass star formation and the galactic structure. We plan to make a blind survey toward the northern Galactic plane in future years using 25m radio telescope of Xinjiang Astronomical Observatory. We will select some water maser sources discovered in the survey and make high resolution observations and study the gas kinematics close to the high-mass protostar.

preprint2011arXiv

Exploring morphological correlations among H2CO, 12CO, MSX and continuum mappings

There are relatively few H2CO mappings of large-area giant molecular cloud (GMCs). H2CO absorption lines are good tracers for low-temperature molecular clouds towards star formation regions. Thus, the aim of the study was to identify H2CO distributions in ambient molecular clouds. We investigated morphologic relations among 6-cm continuum brightness temperature (CBT) data and H2CO (111-110; Nanshan 25-m radio telescope), 12CO (1--0; 1.2-m CfA telescope) and midcourse space experiment (MSX) data, and considered the impact of background components on foreground clouds. We report simultaneous 6-cm H2CO absorption lines and H110αradio recombination line observations and give several large-area mappings at 4.8 GHz toward W49 (50'\times50'), W3 (70'\times90'), DR21/W75 (60'\times90') and NGC2024/NGC2023 (50'\times100') GMCs. By superimposing H2CO and 12CO contours onto the MSX color map, we can compare correlations. The resolution for H2CO, 12CO and MSX data was about 10', 8' and 18.3", respectively. Comparison of H2CO and 12CO contours, 8.28-μm MSX colorscale and CBT data revealed great morphological correlation in the large area, although there are some discrepancies between 12CO and H2CO peaks in small areas. The NGC2024/NGC2023 GMC is a large area of HII regions with a high CBT, but a H2CO cloud to the north is possible against the cosmic microwave background. A statistical diagram shows that 85.21% of H2CO absorption lines are distributed in the intensity range from -1.0 to 0 Jy and the ΔV range from 1.206 to 5 km/s.

preprint2010arXiv

High-resolution angle-resolved photoemission spectroscopy study of the electronic structure of EuFe2As2

We report the high-resolution angle-resolved photoemission spectroscopy studies of electronic structure of EuFe2As2. The paramagnetic state data are found to be consistent with density-functional calculations. In the antiferromagnetic ordering state of Fe, our results show that the band splitting, folding, and hybridization evolve with temperature, which cannot be explained by a simple folding picture. Detailed measurements reveal that a tiny electron Fermi pocket and a tiny hole pocket are formed near (pi,pi) in the (0,0)-(pi,pi) direction, which qualitatively agree with the results of quantum oscillations, considering kz variation of Fermi surface. Furthermore, no noticeable change within the energy resolution is observed across the antiferromagnetic transition of Eu2+ ordering, suggesting weak coupling between Eu sublattice and FeAs sublattice.

preprint2010arXiv

Itinerant Flat-Band Magnetism in Hydrogenated Carbon Nanotubes

We investigate the electronic and magnetic properties of hydrogenated carbon nanotubes using ab initio spin-polarized calculations within both the local density approximation (LDA) and the generalized gradient approximation (GGA). We find that the combination of charge transfer and carbon network distortion makes the spin-polarized flat-band appear in the tube's energy gap. Various spin-dependent ground state properties are predicted with the changes of the radii, the chiralities of the tubes and the concentration of hydrogen (H). It is found that strain or external electric field can effectively modulate the flat-band spin-splitting, and even induce an insulator-metal transition.

preprint2010arXiv

Joint Relay Selection and Link Adaptation for Distributed Beamforming in Regenerative Cooperative Networks

Relay selection enhances the performance of the cooperative networks by selecting the links with higher capacity. Meanwhile link adaptation improves the spectral efficiency of wireless data-centric networks through adapting the modulation and coding schemes (MCS) to the current link condition. In this paper, relay selection is combined with link adaptation for distributed beamforming in a two-hop regenerative cooperative system. A novel signaling mechanism and related optimal algorithms are proposed for joint relay selection and link adaptation. In the proposed scheme, there is no need to feedback the relay selection results to each relay. Instead, by broadcasting the link adaptation results from the destination, each relay will automatically understand whether it is selected or not. The lower and upper bounds of the throughput of the proposed scheme are derived. The analysis and simulation results indicate that the proposed scheme provides synergistic gains compared to the pure relay selection and link adaptation schemes.

preprint2010arXiv

Joint Uplink and Downlink Relay Selection in Cooperative Cellular Networks

We consider relay selection technique in a cooperative cellular network where user terminals act as mobile relays to help the communications between base station (BS) and mobile station (MS). A novel relay selection scheme, called Joint Uplink and Downlink Relay Selection (JUDRS), is proposed in this paper. Specifically, we generalize JUDRS in two key aspects: (i) relay is selected jointly for uplink and downlink, so that the relay selection overhead can be reduced, and (ii) we consider to minimize the weighted total energy consumption of MS, relay and BS by taking into account channel quality and traffic load condition of uplink and downlink. Information theoretic analysis of the diversity-multiplexing tradeoff demonstrates that the proposed scheme achieves full spatial diversity in the quantity of cooperating terminals in this network. And numerical results are provided to further confirm a significant energy efficiency gain of the proposed algorithm comparing to the previous best worse channel selection and best harmonic mean selection algorithms.

preprint2007arXiv

Structural transformations of double-walled carbon nanotube bundle under hydrostatic pressure

Three kinds of the response mechanisms to the external pressure have been found for double-walled carbon nanotube (DWNT) bundle, depending strongly on their average radius and symmetry. The small-diameter DWNT bundle undergoes a small discontinuous volume change, and then deform continuously. The intermediate-diameter DWNT bundle collapses completely after a structure phase transition (SPT). Significantly, two SPTs exist for the larger-diameter DWNT bundle if the outer tube has no $C_{6}$ or $C_{3}$ symmetry. It would be interesting to search for signatures of these different structural transformations by experimentally investigating mechanical, optical and thermal response functions of DWNT bundle.