arXiv subjects

Jie Chen

Publications and source records attributed to Jie Chen.

At least 703 records · Page 39Linked to original sources

arXiv2016

Queue Theory based Response Time Analyses for Geo-Information Processing Chain

Typical characteristics of remote sensing applications are concurrent tasks, such as those found in disaster rapid response. The existing composition approach to geographical information processing service chain, searches for an optimisation solution and is what can be deemed a "selfish" way. This way leads to problems of conflict amongst concurrent tasks and decreases the performance of all service chains. In this study, a non-cooperative game-based mathematical model to analyse the competitive relationships between tasks, is proposed. A best response function is used, to assure each task maintains utility optimisation by considering composition strategies of other tasks and quantifying conflicts between tasks. Based on this, an iterative algorithm that converges to Nash equilibrium is presented, the aim being to provide good convergence and maximise the utilisation of all tasks under concurrent task conditions. Theoretical analyses and experiments showed that the newly proposed method, when compared to existing service composition methods, has better practical utility in all tasks.

cs.DC↗

arXiv2015

An Autonomous Observation and Control System Based on EPICS and RTS2 for Antarctic Telescopes

For an unattended telescopes in Antarctic, the remote operation, autonomous observation and control are essential. An EPICS (Experimental Physics and Industrial Control System) and RTS2(Remote Telescope System, 2nd Version) based autonomous observation and control system with remoted operation is introduced in this paper. EPICS is a set of Open Source software tools, libraries and applications developed collaboratively and used worldwide to create distributed soft real-time control systems for scientific instruments while RTS2 is an open source environment for control of a fully autonomous observatory. Using the advantage of EPICS and RTS2 respectively, a combined integrated software framework for autonomous observation and control is established that use RTS2 to fulfill the function of astronomical observation and use EPICS to fulfill the device control of telescope. A command and status interface for EPICS and RTS2 is designed to make the EPICS IOC (Input/Output Controller) components integrate to RTS2 directly. For the specification and requirement of control system of telescope in Antarctic, core components named Executor and Auto-focus for autonomous observation is designed and implemented with remote operation user interface based on Browser-Server mode. The whole system including the telescope is tested in Lijiang Observatory in Yunnan Province for practical observation to complete the autonomous observation and control, including telescope control, camera control, dome control, weather information acquisition with the local and remote operation.

astro-ph.IM↗

arXiv2015

Fully Distributed Adaptive Output Feedback Protocols for Linear Multi-Agent Systems with Directed Graphs: A Sequential Observer Design Approach

This paper studies output feedback consensus protocol design problems for linear multi-agent systems with directed graphs. We consider both leaderless and leader-follower consensus with a leader whose control input is nonzero and bounded. We propose a novel sequential observer design approach, which makes it possible to design fully distributed adaptive output feedback protocols that the existing methods fail to accomplish. With the sequential observer architecture, we show that leaderless consensus can be achieved for any strongly connected directed graph in a fully distributed manner, whenever the agents are stabilizable and detectable. For the case with a leader of bounded control input, we further present novel distributed adaptive output feedback protocols, which include nonlinear functions to deal with the effect of the leaders's nonzero control input and are able to achieve leader-follower consensus for any directed graph containing a directed spanning tree with the leader as the root.

eess.SY↗

arXiv2015

In-medium and isospin effects on particle production near threshold energies in heavy-ion collisions

Dynamics of pseudoscalar mesons ($π$, $η$, $K$ and $\overline{K}$ ) and hyperons ($Λ$ and $Σ$) produced in heavy-ion collisions near threshold energies has been investigated within the Lanzhou quantum molecular dynamics (LQMD) transport model. The in-medium modifications on particle production in dense nuclear matter are implemented in the model through corrections on the elementary cross sections and by inclusion of the meson (hyperon)-nucleon potentials, in which the isospin effects are considered. It is found that the transportation of particles are influenced with the in-medium corrections. The total number of pions is reduced with an isospin, density and momentum dependent pion-nucleon potential. However, the ratios of charged pions is enhanced with inclusion of the potential. The production of eta in the domain of mid-rapidities and high momenta is sensitive to the $η$-nucleon potential, but weakly depends on symmetry energy. The attractive antikaon-nucleon potential enhances the subthreshold $\overline{K}$ production and also influences the structure of phase-space distributions. Dynamics of etas, kaons, antikaons and hyperons is also influenced by the pion potential because of collisions between pions and nucleons (resonances). The impacts of mean-field potentials on particle dynamics are investigated, such as the phase-space distributions from rapidity and transverse momentum spectra, inclusive invariant spectra, collective flows etc.

nucl-th↗

arXiv2015

HEp-2 Cell Classification: The Role of Gaussian Scale Space Theory as A Pre-processing Approach

\textit{Indirect Immunofluorescence Imaging of Human Epithelial Type 2} (HEp-2) cells is an effective way to identify the presence of Anti-Nuclear Antibody (ANA). Most existing works on HEp-2 cell classification mainly focus on feature extraction, feature encoding and classifier design. Very few efforts have been devoted to study the importance of the pre-processing techniques. In this paper, we analyze the importance of the pre-processing, and investigate the role of Gaussian Scale Space (GSS) theory as a pre-processing approach for the HEp-2 cell classification task. We validate the GSS pre-processing under the Local Binary Pattern (LBP) and the Bag-of-Words (BoW) frameworks. Under the BoW framework, the introduced pre-processing approach, using only one Local Orientation Adaptive Descriptor (LOAD), achieved superior performance on the Executable Thematic on Pattern Recognition Techniques for Indirect Immunofluorescence (ET-PRT-IIF) image analysis. Our system, using only one feature, outperformed the winner of the ICPR 2014 contest that combined four types of features. Meanwhile, the proposed pre-processing method is not restricted to this work; it can be generalized to many existing works.

cs.CV↗

arXiv2015

Scalable Computation of Regularized Precision Matrices via Stochastic Optimization

We consider the problem of computing a positive definite $p \times p$ inverse covariance matrix aka precision matrix $θ=(θ_{ij})$ which optimizes a regularized Gaussian maximum likelihood problem, with the elastic-net regularizer $\sum_{i,j=1}^{p} λ(α|θ_{ij}| + \frac{1}{2}(1- α) θ_{ij}^2),$ with regularization parameters $α\in [0,1]$ and $λ>0$. The associated convex semidefinite optimization problem is notoriously difficult to scale to large problems and has demanded significant attention over the past several years. We propose a new algorithmic framework based on stochastic proximal optimization (on the primal problem) that can be used to obtain near optimal solutions with substantial computational savings over deterministic algorithms. A key challenge of our work stems from the fact that the optimization problem being investigated does not satisfy the usual assumptions required by stochastic gradient methods. Our proposal has (a) computational guarantees and (b) scales well to large problems, even if the solution is not too sparse; thereby, enhancing the scope of regularized maximum likelihood problems to many large-scale problems of contemporary interest. An important aspect of our proposal is to bypass the \emph{deterministic} computation of a matrix inverse by drawing random samples from a suitable multivariate Gaussian distribution.

math.ST↗

arXiv2015

Stochastic Behavior of the Nonnegative Least Mean Fourth Algorithm for Stationary Gaussian Inputs and Slow Learning

Some system identification problems impose nonnegativity constraints on the parameters to estimate due to inherent physical characteristics of the unknown system. The nonnegative least-mean-square (NNLMS) algorithm and its variants allow to address this problem in an online manner. A nonnegative least mean fourth (NNLMF) algorithm has been recently proposed to improve the performance of these algorithms in cases where the measurement noise is not Gaussian. This paper provides a first theoretical analysis of the stochastic behavior of the NNLMF algorithm for stationary Gaussian inputs and slow learning. Simulation results illustrate the accuracy of the proposed analysis.

math.NA↗

arXiv2015

Symmetric low-rank representation for subspace clustering

We propose a symmetric low-rank representation (SLRR) method for subspace clustering, which assumes that a data set is approximately drawn from the union of multiple subspaces. The proposed technique can reveal the membership of multiple subspaces through the self-expressiveness property of the data. In particular, the SLRR method considers a collaborative representation combined with low-rank matrix recovery techniques as a low-rank representation to learn a symmetric low-rank representation, which preserves the subspace structures of high-dimensional data. In contrast to performing iterative singular value decomposition in some existing low-rank representation based algorithms, the symmetric low-rank representation in the SLRR method can be calculated as a closed form solution by solving the symmetric low-rank optimization problem. By making use of the angular information of the principal directions of the symmetric low-rank representation, an affinity graph matrix is constructed for spectral clustering. Extensive experimental results show that it outperforms state-of-the-art subspace clustering algorithms.

cs.CV↗

arXiv2015

Massive MIMO for Wireless Sensing with a Coherent Multiple Access Channel

We consider the detection and estimation of a zero-mean Gaussian signal in a wireless sensor network with a coherent multiple access channel, when the fusion center (FC) is configured with a large number of antennas and the wireless channels between the sensor nodes and FC experience Rayleigh fading. For the detection problem, we study the Neyman-Pearson (NP) Detector and Energy Detector (ED), and find optimal values for the sensor transmission gains. For the NP detector which requires channel state information (CSI), we show that detection performance remains asymptotically constant with the number of FC antennas if the sensor transmit power decreases proportionally with the increase in the number of antennas. Performance bounds show that the benefit of multiple antennas at the FC disappears as the transmit power grows. The results of the NP detector are also generalized to the linear minimum mean squared error estimator. For the ED which does not require CSI, we derive optimal gains that maximize the deflection coefficient of the detector, and we show that a constant deflection can be asymptotically achieved if the sensor transmit power scales as the inverse square root of the number of FC antennas. Unlike the NP detector, for high sensor power the multi-antenna ED is observed to empirically have significantly better performance than the single-antenna implementation. A number of simulation results are included to validate the analysis.

cs.IT↗

arXiv2015

Ultrasmall Glutathione-Protected Gold Nanoclusters as Next Generation Radiotherapy Sensitizers with High Tumor Uptake and High Renal Clearance

Radiotherapy is often the most straightforward first line cancer treatment for solid tumors. While it is highly effective against tumors, there is also collateral damage to healthy proximal tissues especially with high doses. The use of radiosensitizers is an effective way to boost the killing efficacy of radiotherapy against the tumor while drastically limiting the received dose and reducing the possible damage to normal tissues. Here, we report the design and application of a good radiosensitizer by using ultrasmall gold nanoclusters with a naturally occurring peptide (e.g., glutathione or GSH) as the protecting shell. The GSH coated gold nanoclusters can escape the RES absorption, leading to a good tumor uptake (8.1% ID/g at 24 h post injection). As a result, the as-designed Au nanoclusters led to a strong enhancement for radiotherapy, as well as a negligible damage to normal tissues. After the treatment, the ultrasmall gold nanoclusters can be efficiently cleared by the kidney, thereby avoiding potential long term side effects caused by the accumulation of gold atoms in the body. Our data suggest that the ultrasmall peptide protected Au nanoclusters are a promising radiosensitizer for cancer radiotherapy.

physics.med-ph↗

arXiv2015

Diffusion LMS over Multitask Networks

The diffusion LMS algorithm has been extensively studied in recent years. This efficient strategy allows to address distributed optimization problems over networks in the case where nodes have to collaboratively estimate a single parameter vector. Problems of this type are referred to as single-task problems. Nevertheless, there are several problems in practice that are multitask-oriented in the sense that the optimum parameter vector may not be the same for every node. This brings up the issue of studying the performance of the diffusion LMS algorithm when it is run, either intentionally or unintentionally, in a multitask environment. In this paper, we conduct a theoretical analysis on the stochastic behavior of diffusion LMS in the case where the so-called single-task hypothesis is violated. We explain under what conditions diffusion LMS continues to deliver performance superior to non-cooperative strategies in the multitask environment. When the conditions are violated, we explain how to endow the nodes with the ability to cluster with other similar nodes to remove bias. We propose an unsupervised clustering strategy that allows each node to select, via adaptive adjustments of combination weights, the neighboring nodes with which it can collaborate to estimate a common parameter vector. Simulations are presented to illustrate the theoretical results, and to demonstrate the efficiency of the proposed clustering strategy. The framework is applied to a useful problem involving a multi-target tracking task.

eess.SY↗

arXiv2014

Epidemic-like Proximity-based Traffic Offloading

Cellular networks are overloaded due to the mobile traffic surge, and mobile social network (MSNets) carrying information flow can help reduce cellular traffic load. If geographically-nearby users directly adopt WiFi or Bluetooth technology (i.e., leveraging proximity-based communication) for information spreading in MSNets, a portion of mobile traffic can be offloaded from cellular networks. For many delay-tolerant applications, it is beneficial for traffic offloading to pick some seed users as information sources, which help further spread the information to others in an epidemic-like manner using proximity-based communication. In this paper, we develop a theoretical framework to study the issue of choosing only k seed users so as to maximize the mobile traffic offloaded from cellular networks via proximity-based communication. We introduce a gossip-style social cascade (GSC) model to model the information diffusion process, which captures the epidemic-like nature of proximity-based communication and characterizes users' social participation as well. For static networks as a special-case study and mobile networks, we establish an equivalent view and a temporal mapping of the information diffusion process, respectively, leveraging virtual coupon collectors. We further prove the submodularity in the information diffusion and propose a greedy algorithm to choose the seed users for proximity-based traffic offloading, yielding a solution within about 63% of the optimal value to the traffic offloading maximization (TOM) problem. Experiments are carried out to study the offloading performance of our approach, illustrating that proximity-based communication can offload cellular traffic by over 60% with a small number of seed users and the greedy algorithm significantly outperforms the heuristic and random algorithms.

cs.IT↗

arXiv2014

Storage of Gold Nanoclusters in Muscle Leads to their Biphasic in Vivo Clearance

Ultrasmall gold nanoclusters show great potential in biomedical applications. Long term biodistribution, retention, toxicity, and pharmacokinetics profiles are prerequisites in their potential clinical applications. Here we systematically investigated the biodistribution, clearance, and toxicity of one widely used Au NC species glutathione protected Au NCs or GSH Au NCs, over a relatively long period of 90 days in mice. We observed that most of the Au NCs were cleared at 30 days post injection with a major accumulation in liver and kidney. However, it is surprising that an abnormal increase of Au amount in the heart, liver, spleen, lung, and testis was observed at 60 and 90 days, indicating that the injected Au NCs formed a V shaped time dependent distribution profile in various organs. Further investigations revealed that Au NCs were steadily accumulating in the muscle in the first 30 days p.i., and the as stored Au NCs gradually released into blood in 30 to 90 days, which induced a redistribution and reaccumulation of Au NCs in all blood rich organs. Further hematology and biochemistry studies showed that the reaccumulation of Au NCs still caused some liver toxicity at 30 days p.i. The muscle storage and subsequent release may give rise to the potential accumulation and toxicity risk of functional nanomaterials over long periods of time.

physics.bio-ph↗

arXiv2014

Parallel Gaussian Process Regression for Big Data: Low-Rank Representation Meets Markov Approximation

The expressive power of a Gaussian process (GP) model comes at a cost of poor scalability in the data size. To improve its scalability, this paper presents a low-rank-cum-Markov approximation (LMA) of the GP model that is novel in leveraging the dual computational advantages stemming from complementing a low-rank approximate representation of the full-rank GP based on a support set of inputs with a Markov approximation of the resulting residual process; the latter approximation is guaranteed to be closest in the Kullback-Leibler distance criterion subject to some constraint and is considerably more refined than that of existing sparse GP models utilizing low-rank representations due to its more relaxed conditional independence assumption (especially with larger data). As a result, our LMA method can trade off between the size of the support set and the order of the Markov property to (a) incur lower computational cost than such sparse GP models while achieving predictive performance comparable to them and (b) accurately represent features/patterns of any scale. Interestingly, varying the Markov order produces a spectrum of LMAs with PIC approximation and full-rank GP at the two extremes. An advantage of our LMA method is that it is amenable to parallelization on multiple machines/cores, thereby gaining greater scalability. Empirical evaluation on three real-world datasets in clusters of up to 32 computing nodes shows that our centralized and parallel LMA methods are significantly more time-efficient and scalable than state-of-the-art sparse and full-rank GP regression methods while achieving comparable predictive performances.

stat.ML↗

arXiv2014

Investigation of transient surface electric field induced by femtosecond laser irradiation of aluminum

Transient surface electric fields induced by femtosecond laser irradiation of an aluminum film were investigated directly by ultrashort electron pulses. At pump intensities of 2.9~7.1 * 10^10 W/cm2, the transient electric fields last at least one nanosecond with a maximum field strength of 3.2~5.3 * 10^4 V/m at 120 micro m above the aluminum surface. The transient electric fields and the associated evolution of photoelectrons were explained by a "three-layer" model. The potential influence of such fields on reflection ultrafast electron diffraction and time-resolved angle-resolved photoemission spectroscopy were evaluated.

cond-mat.mtrl-sci↗

arXiv2014

Three-component topological superfluid in one-dimensional Fermi gases with spin-orbit coupling

We theoretically investigate one-dimensional three-component spin-orbit-coupled Fermi gases in the presence of Zeeman field. By solving the Bogoliubov-de-Gennes equations, we obtain the phase diagram at given chemical potential and order parameter. We show that the system undergoes a phase transition from Bardeen-Cooper-Schrieffer superfluid to topological superfluid as increasing the intensity of Zeeman field. By comparing to the two-component system, we find, besides the topological phase transition from the trivial superfluid to nontrivial topological superfluid, the system can always be in a nontrivial topological superfluid, and there are two Majorana zero energy regions while increasing the magnetic field. We find the three-component spin-orbit-coupled Fermi gases in certain parameter range is more optimizing for experimental realization due to the smaller magnetic field needed. We therefore propose a promising candidate for realizing topological superfluid.

cond-mat.quant-gas↗

arXiv2014

Decentralized Data Fusion and Active Sensing with Mobile Sensors for Modeling and Predicting Spatiotemporal Traffic Phenomena

The problem of modeling and predicting spatiotemporal traffic phenomena over an urban road network is important to many traffic applications such as detecting and forecasting congestion hotspots. This paper presents a decentralized data fusion and active sensing (D2FAS) algorithm for mobile sensors to actively explore the road network to gather and assimilate the most informative data for predicting the traffic phenomenon. We analyze the time and communication complexity of D2FAS and demonstrate that it can scale well with a large number of observations and sensors. We provide a theoretical guarantee on its predictive performance to be equivalent to that of a sophisticated centralized sparse approximation for the Gaussian process (GP) model: The computation of such a sparse approximate GP model can thus be parallelized and distributed among the mobile sensors (in a Google-like MapReduce paradigm), thereby achieving efficient and scalable prediction. We also theoretically guarantee its active sensing performance that improves under various practical environmental conditions. Empirical evaluation on real-world urban road network data shows that our D2FAS algorithm is significantly more time-efficient and scalable than state-oftheart centralized algorithms while achieving comparable predictive performance.

cs.AI↗

arXiv2014

Parallel Gaussian Process Regression with Low-Rank Covariance Matrix Approximations

Gaussian processes (GP) are Bayesian non-parametric models that are widely used for probabilistic regression. Unfortunately, it cannot scale well with large data nor perform real-time predictions due to its cubic time cost in the data size. This paper presents two parallel GP regression methods that exploit low-rank covariance matrix approximations for distributing the computational load among parallel machines to achieve time efficiency and scalability. We theoretically guarantee the predictive performances of our proposed parallel GPs to be equivalent to that of some centralized approximate GP regression methods: The computation of their centralized counterparts can be distributed among parallel machines, hence achieving greater time efficiency and scalability. We analytically compare the properties of our parallel GPs such as time, space, and communication complexity. Empirical evaluation on two real-world datasets in a cluster of 20 computing nodes shows that our parallel GPs are significantly more time-efficient and scalable than their centralized counterparts and exact/full GP while achieving predictive performances comparable to full GP.

cs.LG↗