arXiv subjects

Jie Chen

Publications and source records attributed to Jie Chen.

At least 721 records · Page 40Linked to original sources

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↗

arXiv2014

Significant Reduction of Graphene Thermal Conductivity by Phononic Crystal Structure

We studied the thermal conductivity of graphene phononic crystal (GPnC), also named as graphene nanomesh, by molecular dynamics simulations. The dependences of thermal conductivity of GPnCs on both length and temperature are investigated. It is found that the thermal conductivity of GPnCs is significantly lower than that of graphene and can be efficiently tuned by changing the porosity and period length. For example, the ratio of thermal conductivity of GPnC to thermal conductivity of graphene can be changed from 0.1 to 0.01 when the porosity is changed from about 21% to 65%. The phonon participation ratio spectra reveal that more phonon modes are localized in GPnCs with larger porosity. Our results suggest that creating GPnCs is a valuable method to efficiently manipulate the thermal conductivity of graphene.

cond-mat.mtrl-sci↗

arXiv2014

Inverse problem of electroseismic conversion. I: Inversion of Maxwell's equations with internal data

Pride (1994, Phys. Rev. B 50 15678-96) derived the governing model of electroseismic conversion, in which Maxwell's equations are coupled with Biot's equations through an electrokinetic mobility parameter. The inverse problem of electroseismic conversion was first studied by Chen and Yang (2013, Inverse Problem 29 115006). By following the construction of Complex Geometrical Optics (CGO) solutions to a matrix \Schrodinger equation introduced by Ola and Somersalo (1996, SIAM J. Appl. Math. 56 No. 4 1129-1145), we analyze the reconstruction of conductivity, permittivity and the electrokinetic mobility parameter in Maxwell's equations with internal measurements, while allowing the magnetic permeability $μ$ to be a variable function. We show that knowledge of two internal data sets associated with well-chosen boundary electric sources uniquely determines these parameters. Moreover, a Lipschitz-type stability is obtained based on the same set.

math.AP↗

arXiv2014

Ultrasmall Au10-12(SG)10-12 Nanomolecules for High Tumor Specificity and Cancer Radiotherapy

Radiosensitizers can increase the local treatment efficacy under a relatively low and safe radiation dose, thereby facilitating tumor eradication and minimizing side effects. Here, we report a new class of radiosensitizers that contain several gold (Au) atoms embedded inside a peptide shell (e.g., Au10-12(SG)10-12) and can achieve ultrahigh tumor uptake (10.86 SUV at 24 h post injection) and targeting specificity, efficient renal clearance, and high radiotherapy enhancement.

physics.bio-ph↗

arXiv2014

Detection in Analog Sensor Networks with a Large Scale Antenna Fusion Center

We consider the distributed detection of a zero-mean Gaussian signal in an analog wireless sensor network with a fusion center (FC) configured with a large number of antennas. The transmission gains of the sensor nodes are optimized by minimizing the ratio of the log probability of detection (PD) and log probability of false alarm (PFA). We show that the problem is convex with respect to the squared norm of the transmission gains, and that a closed-form solution can be found using the Karush-Kuhn-Tucker conditions. Our results indicate that a constant PD can be maintained with decreasing sensor transmit gain provided that the number of antennas increases at the same rate. This is contrasted with the case of a single-antenna FC, where PD is monotonically decreasing with transmit gain. On the other hand, we show that when the transmit power is high, the single- and multi-antenna FC both asymptotically achieve the same PD upper bound.

cs.IT↗

arXiv2014

GP-Localize: Persistent Mobile Robot Localization using Online Sparse Gaussian Process Observation Model

Central to robot exploration and mapping is the task of persistent localization in environmental fields characterized by spatially correlated measurements. This paper presents a Gaussian process localization (GP-Localize) algorithm that, in contrast to existing works, can exploit the spatially correlated field measurements taken during a robot's exploration (instead of relying on prior training data) for efficiently and scalably learning the GP observation model online through our proposed novel online sparse GP. As a result, GP-Localize is capable of achieving constant time and memory (i.e., independent of the size of the data) per filtering step, which demonstrates the practical feasibility of using GPs for persistent robot localization and autonomy. Empirical evaluation via simulated experiments with real-world datasets and a real robot experiment shows that GP-Localize outperforms existing GP localization algorithms.

cs.RO↗

arXiv2014

Simultaneous Investigation of Ultrafast Structural Dynamics and Transient Electric Field by Sub-picosecond Electron Pulses

The ultrafast structure dynamics and surface transient electric field, which are concurrently induced by laser excited electrons of an aluminum nanofilm, have been investigated simultaneously by the same transmission electron diffraction patterns. These two processes are found to be significantly different and distinguishable by tracing the time dependent changes of electron diffraction and deflection angles, respectively. This study also provides a practical means to evaluate simultaneously the effect of transient electric field during the study of structural dynamics under low pump fluence by transmission ultrafast electron diffraction.

cond-mat.mtrl-sci↗

arXiv2014

Power Scheduling of Kalman Filtering in Wireless Sensor Networks with Data Packet Drops

For a wireless sensor network (WSN) with a large number of low-cost, battery-driven, multiple transmission power leveled sensor nodes of limited transmission bandwidth, then conservation of transmission resources (power and bandwidth) is of paramount importance. Towards this end, this paper considers the problem of power scheduling of Kalman filtering for general linear stochastic systems subject to data packet drops (over a packet-dropping wireless network). The transmission of the acquired measurement from the sensor to the remote estimator is realized by sequentially transmitting every single component of the measurement to the remote estimator in one time period. The sensor node decides separately whether to use a high or low transmission power to communicate every component to the estimator across a packet-dropping wireless network based on the rule that promotes the power scheduling with the least impact on the estimator mean squared error. Under the customary assumption that the predicted density is (approximately) Gaussian, leveraging the statistical distribution of sensor data, the mechanism of power scheduling, the wireless network effect and the received data, the minimum mean squared error estimator is derived. By investigating the statistical convergence properties of the estimation error covariance, we establish, for general linear systems, both the sufficient condition and the necessary condition guaranteeing the stability of the estimator.

eess.SY↗

arXiv2014

Steady-state performance of non-negative least-mean-square algorithm and its variants

Non-negative least-mean-square (NNLMS) algorithm and its variants have been proposed for online estimation under non-negativity constraints. The transient behavior of the NNLMS, Normalized NNLMS, Exponential NNLMS and Sign-Sign NNLMS algorithms have been studied in our previous work. In this technical report, we derive closed-form expressions for the steady-state excess mean-square error (EMSE) for the four algorithms. Simulations results illustrate the accuracy of the theoretical results. This is a complementary material to our previous work.

cs.LG↗

arXiv2014

Optimal Power Allocation for Parameter Tracking in a Distributed Amplify-and-Forward Sensor Network

We consider the problem of optimal power allocation in a sensor network where the sensors observe a dynamic parameter in noise and coherently amplify and forward their observations to a fusion center (FC). The FC uses the observations in a Kalman filter to track the parameter, and we show how to find the optimal gain and phase of the sensor transmissions under both global and individual power constraints in order to minimize the mean squared error (MSE) of the parameter estimate. For the case of a global power constraint, a closed-form solution can be obtained. A numerical optimization is required for individual power constraints, but the problem can be relaxed to a semidefinite programming problem (SDP), and we show that the optimal result can be constructed from the SDP solution. We also study the dual problem of minimizing global and individual power consumption under a constraint on the MSE. As before, a closed-form solution can be found when minimizing total power, while the optimal solution is constructed from the output of an SDP when minimizing the maximum individual sensor power. For purposes of comparison, we derive an exact expression for the outage probability on the MSE for equal-power transmission, which can serve as an upper bound for the case of optimal power control. Finally, we present the results of several simulations to show that the use of optimal power control provides a significant reduction in either MSE or transmit power compared with a non-optimized approach (i.e., equal power transmission).

cs.IT↗