Searcharxiv⌕ Search

arXiv subjects

Jing Li

Publications and source records attributed to Jing Li.

At least 775 records · Page 43Linked to original sources

Representing high throughput expression profiles via perturbation barcodes reveals compound targets

High throughput mRNA expression profiling can be used to characterize the response of cell culture models to perturbations such as pharmacologic modulators and genetic perturbations. As profiling campaigns expand in scope, it is important to homogenize, summarize, and analyze the resulting data in a manner that captures significant biological signals in spite of various noise sources such as batch effects and stochastic variation. We used the L1000 platform for large-scale profiling of 978 genes, chosen to be representative of the genome as whole, across thousands of compound treatments. Here, a method is described that uses deep learning techniques to convert the expression changes of the landmark genes into a perturbation barcode that reveals important features of the underlying data, performing better than the raw data in revealing important biological insights. The barcode captures compound structure and target information, in addition to predicting a compound's high throughput screening promiscuity, to a higher degree than the original data measurements, indicating that the approach uncovers underlying factors of the expression data that are otherwise entangled or masked by noise. Furthermore, we demonstrate that visualizations derived from the perturbation barcode can be used to more sensitively assign functions to unknown compounds through a guilt-by-association approach, which we use to predict and experimentally validate the activity of compounds on the MAPK pathway. The demonstrated application of deep metric learning to large-scale chemical genetics projects highlights the utility of this and related approaches to the extraction of insights and testable hypotheses from big, sometimes noisy data.

q-bio.GN↗

Developing a Magnetism Conceptual Survey and Assessing Gender Differences in Student Understanding of Magnetism

We discuss the development of a research-based conceptual multiple-choice survey related to magnetism. We also discuss the use of the survey to investigate gender differences in students' difficulties with concepts related to magnetism. We find that while there was no gender difference on the pre-test, female students performed significantly worse than male students when the survey was given as a post-test in traditionally taught calculus-based introductory physics courses (similar results in both the regular and honors versions of the course). In the algebra-based courses, the performance of the female students and the male students has no statistical difference in the pre-test or the post-test.

physics.ed-ph↗

Students' Difficulties with Equations involving Circuit Elements

We discuss an investigation exploring students' difficulties with equations involving resistance, capacitance and inductance. We find that introductory physics students have great difficulty understanding, e.g., how the resistance of an ohmic resistor can be written in terms of the potential difference across it and the current through it, but it does not change when the potential difference across the resistor is varied. Similar confusions arose in problems relating to capacitors and inductors. We discuss these difficulties with equations in the context of introductory physics students' performance on questions about circuit elements both in the free-response and multiple-choice formats.

physics.ed-ph↗

Structural topography-mediated high temperature wetting symmetry breaking

Directed motion of liquid droplets is of considerable importance in various industrial processes. Despite extensive advances in this field of research, our understanding and the ability to control droplet dynamics at high temperature remain limited, in part due to the emergence of complex wetting states intertwined by the phase change process at the triple-phase interfaces. Here we show that two concurrent wetting states (Leidenfrost and contact boiling) can be manifested in a single droplet above its boiling point rectified by the presence of asymmetric textures. The breaking of the wetting symmetry at high temperature subsequently leads to the preferential motion towards the region with higher heat transfer coefficient. We demonstrate experimentally and analytically that the droplet vectoring is intricately dependent on the interplay between the structural topography and its imposed thermal state. Our fundamental understanding and the ability to control the droplet dynamics at high temperature represent an important advance and enable the rational design of various surfaces for multifunctional applications, especially in high temperature thermal systems where high energy efficiency, security and stability are preferred.

physics.flu-dyn↗

Bioinspired interfacial materials with enhanced drop mobility: From fundamentals to multifunctional applications

The development of bio-inspired interfacial materials with enhanced drop mobility that mimic the innate functionalities of nature will have significant impact on the energy, environment and global healthcare. In spite of extensive progress, the state of the art of interfacial materials have not reached the level of maturity sufficient for industrial applications in terms of scalability, stability and reliability, which are complicated by their operating environments and lack of facile approaches to exquisitely control the local structural texture and chemical composition at multiple length scales. In this review, we focus on the recent advances in the fundamental understanding as well as practical applications of bio-inspired interfacial materials, with an emphasis on the drop impact induced bouncing and coalescence induced jumping behaviors. We also suggest our own perspectives on how to catalyze new discoveries and to foster technological adoption to move this exciting area forward.

cond-mat.mtrl-sci↗

Symmetry-breaking in drop bouncing on curved surfaces

The impact of liquid drops on solid surfaces is ubiquitous in nature, and of practical importance in many industrial processes. A drop hitting a flat surface retains a circular symmetry throughout the impact process. Here we show that a drop impinging on Echevaria leaves exhibits asymmetric bouncing dynamics with distinct spreading and retraction along two perpendicular directions. This is a direct consequence of the cylindrical leaves which have a convex/concave architecture of size comparable to the drop. Systematic experimental investigations on mimetic surfaces and lattice Boltzmann simulations reveal that this novel phenomenon results from an asymmetric momentum and mass distribution that allows for preferential fluid pumping around the drop rim. The asymmetry of the bouncing leads to ~40% reduction in contact time.

physics.flu-dyn↗

Analysis of Performance of Linear Analog Codes

In this paper we carefully study the MSE performance of the linear analog codes. We have derived a lower bound of the MSE performance under Likelihood(ML) and Linear Minimal Mean Square Error(LMMSE) decoding criteria respectively. It is proved in this essay that a kind of linear analog codes called \emph {unitary codes} can simultaneously achieve both of these two bounds. At the same time, we compare the obtained linear analog codes' MSE bounds with the performance of some existing nonlinear codes. The results showed that linear analog codes are actually not very satisfying and convinced us that more concerns should be cast onto the nonlinear class in order to find powerful analog codes.

cs.IT↗

MIMO Beamforming Design towards Maximizing Mutual Information in Wireless Sensor Network

This paper considers joint beamformer design towards maximizing the mutual information in a coherent wireless sensor network with noisy observation and multiple antennae. Leveraging the weighted minimum mean square error and block coordinate ascent (BCA) framework, we propose two new and efficient methods: batch-mode BCA and cyclic multi-block BCA. The existing batch-mode approaches require stringent conditions such as diagonal channel matrices and positive definite second-order matrices, and are therefore inapplicable to our problem. Our match-mode BCA overcomes the previous limitations via a general second-order cone programming formation, and exhibits a strong convergence property which we have rigorously proven. The existing multi-block approaches rely on numerical solvers to handle the subproblems and some render good performance only at high signal-to-noise ratios. Exploiting the convexity of the trust-region subproblem for the convex case, our multi-block BCA significantly reduces the complexity and enhances the previous results by providing an analytical expression for the energy-preserving optimal solution. Analysis and simulations confirm the advantages of the proposed methods.

cs.IT↗

Global Existence of Weak Solutions to the Barotropic Compressible Navier-Stokes Flows with Degenerate Viscosities

This paper concerns the existence of global weak solutions to the barotropic compressible Navier-Stokes equations with degenerate viscosity coefficients. We construct suitable approximate system which has smooth solutions satisfying the energy inequality, the BD entropy one, and the Mellet-Vasseur type estimate. Then, after adapting the compactness results due to Mellet-Vasseur [Comm. Partial Differential Equations 32 (2007)], we obtain the global existence of weak solutions to the barotropic compressible Navier-Stokes equations with degenerate viscosity coefficients in two or three dimensional periodic domains or whole space for large initial data. This, in particular, solved an open problem in [P. L. Lions. Mathematical topics in fluid mechanics. Vol. 2. Compressible models. Oxford University Press, 1998].

math.AP↗

Electrically tunable resonant scattering in fluorinated bilayer graphene

Adatom-decorated graphene offers a promising new path towards spintronics in the ultrathin limit. We combine experiment and theory to investigate the electronic properties of dilutely fluorinated bilayer graphene, where the fluorine adatoms covalently bond to the top graphene layer. We show that fluorine adatoms give rise to resonant impurity states near the charge neutrality point of the bilayer, leading to strong scattering of charge carriers and hopping conduction inside a field-induced band gap. Remarkably, the application of an electric field across the layers is shown to tune the resonant scattering amplitude from fluorine adatoms by nearly twofold. The experimental observations are well explained by a theoretical analysis combining Boltzmann transport equations and fully quantum-mechanical methods. This paradigm can be generalized to many bilayer graphene-adatom materials, and we envision that the realization of electrically tunable resonance may be a key advantage in graphene-based spintronic devices.

cond-mat.mes-hall↗

Efficient failure probability calculation through mesh refinement

We present a novel way of accelerating hybrid surrogate methods for the calculation of failure probabilities. The main idea is to use mesh refinement in order to obtain improved local surrogates of low computation cost to simulate on. These improved surrogates can reduce significantly the required number of evaluations of the exact model (which is the usual bottleneck of failure probability calculations). Meanwhile the effort on evaluations of surrogates is dramatically reduced by utilizing low order local surrogates. Numerical results of the application of the proposed approach in several examples of increasing complexity show the robustness, versatility and gain in efficiency of the method.

math.NA↗

A unified framework for mesh refinement in random and physical space

In recent work we have shown how an accurate reduced model can be utilized to perform mesh refinement in random space. That work relied on the explicit knowledge of an accurate reduced model which is used to monitor the transfer of activity from the large to the small scales of the solution. Since this is not always available, we present in the current work a framework which shares the merits and basic idea of the previous approach but does not require an explicit knowledge of a reduced model. Moreover, the current framework can be applied for refinement in both random and physical space. In this manuscript we focus on the application to random space mesh refinement. We study examples of increasing difficulty (from ordinary to partial differential equations) which demonstrate the efficiency and versatility of our approach. We also provide some results from the application of the new framework to physical space mesh refinement.

math.NA↗

Transceiver Design for Clustered Wireless Sensor Networks --- Towards SNR Maximization

This paper investigates the transceiver design problem in a noisy-sensing noisy-transmission multi-input multi-output (MIMO) wireless sensor network. Consider a cluster-based network, where multiple sensors scattering across several clusters will first send their noisy observations to their respective cluster-heads (CH), who will then forward the data to one common fusion center (FC). The cluster-heads and the fusion center collectively form a coherent-sum multiple access channel (MAC) that is affected by fading and additive noise. Our goal is to jointly design the linear transceivers at the CHs and the FC to maximize the signal-to-noise ratio (SNR) of the recovered signal. We develop three iterative block coordinated ascent (BCA) algorithms: 2-block BCA based on semidefinite relaxation (SDR) and rank reduction via randomization or solving linear equations, 2-block BCA based on iterative second-order cone programming (SOCP), and multi-block BCA that lends itself to efficient closed-form solutions in specific but important scenarios. We show that all of these methods optimize SNR very well but each has different efficiency characteristics that are tailored for different network setups. Convergence analysis is carried out and extensive numerical results are presented to confirm our findings.

cs.IT↗

Phonon-limited carrier mobility and resistivity from carbon nanotubes to graphene

Under which conditions do the electrical transport properties of one-dimensional (1D) carbon nanotubes (CNTs) and 2D graphene become equivalent? We have performed atomistic calculations of the phonon-limited electrical mobility in graphene and in a wide range of CNTs of different types to address this issue. The theoretical study is based on a tight-binding method and a force-constant model from which all possible electron-phonon couplings are computed. The electrical resistivity of graphene is found in very good agreement with experiments performed at high carrier density. A common methodology is applied to study the transition from 1D to 2D by considering CNTs with diameter up to 16 nm. It is found that the mobility in CNTs of increasing diameter converges to the same value, the mobility in graphene. This convergence is much faster at high temperature and high carrier density. For small-diameter CNTs, the mobility strongly depends on chirality, diameter, and existence of a bandgap.

cond-mat.mes-hall↗

Partial Decode-Forward Relaying for the Gaussian Two-Hop Relay Network

The multicast capacity of the Gaussian two-hop relay network with one source, $N$ relays, and $L$ destinations is studied. It is shown that a careful modification of the partial decode--forward coding scheme, whereby the relays cooperate through degraded sets of message parts, achieves the cutset upper bound within $(1/2)\log N$ bits regardless of the channel gains and power constraints. This scheme improves upon a previous scheme by Chern and Ozgur, which is also based on partial decode--forward yet has an unbounded gap from the cutset bound for $L \ge 2$ destinations. When specialized to independent codes among relays, the proposed scheme achieves within $\log N$ bits from the cutset bound. The computation of this relaxation involves evaluating mutual information across $L(N+1)$ cuts out of the total $L 2^N$ possible cuts, providing a very simple linear-complexity algorithm to approximate the single-source multicast capacity of the Gaussian two-hop relay network.

cs.IT↗

Nucleus and Mass Loss from Active Asteroid 313P/Gibbs

We present Hubble Space Telescope observations of active asteroid 313P/Gibbs (formerly P/2014 S4) taken over the five month interval from 2014 October to 2015 March. This object has been recurrently active near perihelion (at 2.4 AU) in two different orbits, a property that is naturally explained by the sublimation of near surface ice but which is difficult to reconcile with other activity mechanisms. We find that the mass loss peaks near 1 kg s$^{-1}$ in October and then declines over the subsequent months by about a factor of five, at nearly constant heliocentric distance. This decrease is too large to be caused by the change in heliocentric distance during the period of observation. However, it is consistent with sublimation from an ice patch shadowed by local topography, for example in a pit like those observed on the nuclei of short-period comet 67P/Churyumov-Gerasimenko. While no unique interpretation is possible, a simple self shadowing model shows that sublimation from a pit with depth to diameter ratio near 1/2 matches the observed rate of decline of the activity, while deeper and shallower pits do not. We estimate the nucleus radius to be 700$\pm$100 m (geometric albedo 0.05 assumed). Measurements of the spatial distribution of the dust were obtained from different viewing geometries. They show that dust was ejected continuously not impulsively, that the effective particle size is large, $\sim$50 $μm$, and that the ejection speed is $\sim$2.5 m s$^{-1}$. The total dust mass ejected is $\sim$10$^7$ kg, corresponding to $\sim$10$^{-5}$ of the nucleus mass. The observations are consistent with partially shadowed sublimation from $\sim$10$^4$ m$^2$ of ice, corresponding to $\sim$0.2\% of the nucleus surface. For ice to survive in 313P for billion-year timescales requires that the duty cycle for sublimation be $\lesssim$10$^{-3}$.

astro-ph.EP↗

Minimal Logarithmic Signatures for Sporadic Groups

As a special type of factorization of finite groups, logarithmic signature (LS) is used as the main component of cryptographic keys for secret key cryptosystems such as PGM and public key cryptosystems like MST1, MST2 and MST3. An LS with the shortest length is called a minimal logarithmic signature (MLS) and is even desirable for cryptographic constructions. The MLS conjecture states that every finite simple group has an MLS. Until now, the MLS conjecture has been proved true for some families of simple groups. In this paper, we will prove the existence of minimal logarithmic signatures for some sporadic groups.

cs.CR↗

Joint Transceiver Design for Wireless Sensor Networks through Block Coordinate Descent Optimization

This paper considers the joint transceiver design in a wireless sensor network where multiple sensors observe the same physical event and transmit their contaminated observations to a fusion center, with all nodes equipped with multiple antennae and linear filters. Under the mean square error (MSE) criterion, the joint beamforming design problem can be formulated as a nonconvex optimization problem. To attack this problem, various block coordinate descent (BCD) algorithms are proposed with convergence being carefully examined. First we propose a two block coordinate descent (2-BCD) algorithm that iteratively designs all the beamformers and the linear receiver, where both subproblems are convex and the convergence of limit points to stationary points is guaranteed. Besides, the thorough solution to optimizing one single beamformer is given, which, although discussed several times, is usually incomplete in existing literature. Based on that, multiple block coordinate descent algorithms are proposed. Solving the joint beamformers' design by cyclically updating each separate beamformer under the 2-BCD framework gives birth to a layered BCD algorithm, which guarantees convergence to stationary points. Besides that, a wide class of multiple BCD algorithms using the general essentially cyclic updating rule has been studied. As will be seen, by appropriately adjusting the update of single beamformer, fast converging, highly efficient and stationary point achieving algorithms can be obtained. Extensive numerical results are presented to verify our findings.

cs.IT↗