arXiv subjects

Jie Chen

Publications and source records attributed to Jie Chen.

At least 721 records · Page 40Linked to original sources

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↗

arXiv2013

Stochastic approximation of score functions for Gaussian processes

We discuss the statistical properties of a recently introduced unbiased stochastic approximation to the score equations for maximum likelihood calculation for Gaussian processes. Under certain conditions, including bounded condition number of the covariance matrix, the approach achieves $O(n)$ storage and nearly $O(n)$ computational effort per optimization step, where $n$ is the number of data sites. Here, we prove that if the condition number of the covariance matrix is bounded, then the approximate score equations are nearly optimal in a well-defined sense. Therefore, not only is the approximation efficient to compute, but it also has comparable statistical properties to the exact maximum likelihood estimates. We discuss a modification of the stochastic approximation in which design elements of the stochastic terms mimic patterns from a $2^n$ factorial design. We prove these designs are always at least as good as the unstructured design, and we demonstrate through simulation that they can produce a substantial improvement over random designs. Our findings are validated by numerical experiments on simulated data sets of up to 1 million observations. We apply the approach to fit a space-time model to over 80,000 observations of total column ozone contained in the latitude band $40^{\circ}$-$50^{\circ}$N during April 2012.

stat.AP↗

arXiv2013

Metabolizable Bi2Se3 Nanoplates: Biodistribution, Toxicity, and Uses for Cancer Radiation Therapy and Imaging

Bi, a high atom number element, has a high photoelectric absorption coefficient, and Se element has anticancer activity. Hence, their compound chalcogenide (Bi2Se3) deserves a thorough investigation for biomedical applications. This study reveals that Bi2Se3 nanoplates (54 nm wide) protected with poly(vinylpyrollidone) (PVP) are biocompatible and have low toxicity even at a high dose of 20 mg/kg in mice. This conclusion was made through the studies on the biodistribution and 90-day long term in vivo clearance of the nanoplates. Liver and spleen were dominant organs for the nanoplates accumulation which was mainly due to RES absorption, but 93 % the nanoplates were cleared after 90 days treatment. Concentrations of Bi and Se in tumor tissue continuously increased until 72 h after intraperitoneal injection into mice. Such selective accumulation of Bi was utilized to enhance the contrast of X-ray CT images. The Bi elements concentrated in a tumor led to damage on the tumor cells when exposed to gamma radiation. Growth of the tumor significantly delayed and stopped after 16 days after the tumor was treated with the Bi2Se3 nanoplates and radiation. This work clearly shows that the Bi2Se3 nanoplates may be used for cancer radiation therapy and CT imaging. They deserve further studies for biological and medical applications.

physics.bio-ph↗

arXiv2013

Multitask Diffusion Adaptation over Networks

Adaptive networks are suitable for decentralized inference tasks, e.g., to monitor complex natural phenomena. Recent research works have intensively studied distributed optimization problems in the case where the nodes have to estimate a single optimum parameter vector collaboratively. However, there are many important applications that are multitask-oriented in the sense that there are multiple optimum parameter vectors to be inferred simultaneously, in a collaborative manner, over the area covered by the network. In this paper, we employ diffusion strategies to develop distributed algorithms that address multitask problems by minimizing an appropriate mean-square error criterion with $\ell_2$-regularization. The stability and convergence of the algorithm in the mean and in the mean-square sense is analyzed. Simulations are conducted to verify the theoretical findings, and to illustrate how the distributed strategy can be used in several useful applications related to spectral sensing, target localization, and hyperspectral data unmixing.

cs.MA↗

arXiv2013

Nonlinear unmixing of hyperspectral images using a semiparametric model and spatial regularization

Incorporating spatial information into hyperspectral unmixing procedures has been shown to have positive effects, due to the inherent spatial-spectral duality in hyperspectral scenes. Current research works that consider spatial information are mainly focused on the linear mixing model. In this paper, we investigate a variational approach to incorporating spatial correlation into a nonlinear unmixing procedure. A nonlinear algorithm operating in reproducing kernel Hilbert spaces, associated with an $\ell_1$ local variation norm as the spatial regularizer, is derived. Experimental results, with both synthetic and real data, illustrate the effectiveness of the proposed scheme.

stat.ML↗

arXiv2013

Diffusion LMS for clustered multitask networks

Recent research works on distributed adaptive networks have intensively studied the case where the nodes estimate a common parameter vector collaboratively. However, there are many applications that are multitask-oriented in the sense that there are multiple parameter vectors that need to be inferred simultaneously. In this paper, we employ diffusion strategies to develop distributed algorithms that address clustered multitask problems by minimizing an appropriate mean-square error criterion with $\ell_2$-regularization. Some results on the mean-square stability and convergence of the algorithm are also provided. Simulations are conducted to illustrate the theoretical findings.

eess.SY↗

arXiv2013

Convergence analysis of kernel LMS algorithm with pre-tuned dictionary

The kernel least-mean-square (KLMS) algorithm is an appealing tool for online identification of nonlinear systems due to its simplicity and robustness. In addition to choosing a reproducing kernel and setting filter parameters, designing a KLMS adaptive filter requires to select a so-called dictionary in order to get a finite-order model. This dictionary has a significant impact on performance, and requires careful consideration. Theoretical analysis of KLMS as a function of dictionary setting has rarely, if ever, been addressed in the literature. In an analysis previously published by the authors, the dictionary elements were assumed to be governed by the same probability density function of the input data. In this paper, we modify this study by considering the dictionary as part of the filter parameters to be set. This theoretical analysis paves the way for future investigations on KLMS dictionary design.

stat.ML↗

arXiv2013

Enhanced Tumor Accumulation of Sub-2 nm Gold Nanoclusters for Cancer Radiation Therapy

A new type of metabolizable and efficient radiosensitizer for cancer radiotherapy is presented in this study by combining ultrasmall Au nanoclusters (NCs, <2 nm) with biocompatible coating ligands (glutathione, GSH). The new nano-construct (GSH-coated Au25 NCs) inherits attractive features of both the Au core (strong radiosensitizing effect) and GSH shell (good biocompatibility). It can preferentially accumulate in tumor via the improved EPR effect, which leads to strong enhancement for cancer radiotherapy. After the treatment, the small-sized GSH-Au25 NCs can be efficiently cleared by the kidney, minimizing any potential side effects due to the accumulation of Au25 NCs in the body.

physics.bio-ph↗

arXiv2013

Online dictionary learning for kernel LMS. Analysis and forward-backward splitting algorithm

Adaptive filtering algorithms operating in reproducing kernel Hilbert spaces have demonstrated superiority over their linear counterpart for nonlinear system identification. Unfortunately, an undesirable characteristic of these methods is that the order of the filters grows linearly with the number of input data. This dramatically increases the computational burden and memory requirement. A variety of strategies based on dictionary learning have been proposed to overcome this severe drawback. Few, if any, of these works analyze the problem of updating the dictionary in a time-varying environment. In this paper, we present an analytical study of the convergence behavior of the Gaussian least-mean-square algorithm in the case where the statistics of the dictionary elements only partially match the statistics of the input data. This allows us to emphasize the need for updating the dictionary in an online way, by discarding the obsolete elements and adding appropriate ones. We introduce a kernel least-mean-square algorithm with L1-norm regularization to automatically perform this task. The stability in the mean of this method is analyzed, and its performance is tested with experiments.

stat.ML↗

arXiv2013

Gaussian Process-Based Decentralized Data Fusion and Active Sensing for Mobility-on-Demand System

Mobility-on-demand (MoD) systems have recently emerged as a promising paradigm of one-way vehicle sharing for sustainable personal urban mobility in densely populated cities. In this paper, we enhance the capability of a MoD system by deploying robotic shared vehicles that can autonomously cruise the streets to be hailed by users. A key challenge to managing the MoD system effectively is that of real-time, fine-grained mobility demand sensing and prediction. This paper presents a novel decentralized data fusion and active sensing algorithm for real-time, fine-grained mobility demand sensing and prediction with a fleet of autonomous robotic vehicles in a MoD system. Our Gaussian process (GP)-based decentralized data fusion algorithm can achieve a fine balance between predictive power and time efficiency. We theoretically guarantee its predictive performance to be equivalent to that of a sophisticated centralized sparse approximation for the GP model: The computation of such a sparse approximate GP model can thus be distributed among the MoD vehicles, hence achieving efficient and scalable demand prediction. Though our decentralized active sensing strategy is devised to gather the most informative demand data for demand prediction, it can achieve a dual effect of fleet rebalancing to service the mobility demands. Empirical evaluation on real-world mobility demand data shows that our proposed algorithm can achieve a better balance between predictive accuracy and time efficiency than state-of-the-art algorithms.

cs.RO↗