arXiv subjects

Feng Liu

Publications and source records attributed to Feng Liu.

At least 595 records · Page 33Linked to original sources

arXiv2020

Deciphering gene regulation from gene expression dynamics using deep neural network

Complex biological functions are carried out by the interaction of genes and proteins. Uncovering the gene regulation network behind a function is one of the central themes in biology. Typically, it involves extensive experiments of genetics, biochemistry and molecular biology. In this paper, we show that much of the inference task can be accomplished by a deep neural network (DNN), a form of machine learning or artificial intelligence. Specifically, the DNN learns from the dynamics of the gene expression. The learnt DNN behaves like an accurate simulator of the system, on which one can perform in-silico experiments to reveal the underlying gene network. We demonstrate the method with two examples: biochemical adaptation and the gap-gene patterning in fruit fly embryogenesis. In the first example, the DNN can successfully find the two basic network motifs for adaptation - the negative feedback and the incoherent feed-forward. In the second and much more complex example, the DNN can accurately predict behaviors of essentially all the mutants. Furthermore, the regulation network it uncovers is strikingly similar to the one inferred from experiments. In doing so, we develop methods for deciphering the gene regulation network hidden in the DNN "black box". Our interpretable DNN approach should have broad applications in genotype-phenotype mapping.

q-bio.QM↗

arXiv2020

A Zero-Shot based Fingerprint Presentation Attack Detection System

With the development of presentation attacks, Automated Fingerprint Recognition Systems(AFRSs) are vulnerable to presentation attack. Thus, numerous methods of presentation attack detection(PAD) have been proposed to ensure the normal utilization of AFRS. However, the demand of large-scale presentation attack images and the low-level generalization ability always astrict existing PAD methods' actual performances. Therefore, we propose a novel Zero-Shot Presentation Attack Detection Model to guarantee the generalization of the PAD model. The proposed ZSPAD-Model based on generative model does not utilize any negative samples in the process of establishment, which ensures the robustness for various types or materials based presentation attack. Different from other auto-encoder based model, the Fine-grained Map architecture is proposed to refine the reconstruction error of the auto-encoder networks and a task-specific gaussian model is utilized to improve the quality of clustering. Meanwhile, in order to improve the performance of the proposed model, 9 confidence scores are discussed in this article. Experimental results showed that the ZSPAD-Model is the state of the art for ZSPAD, and the MS-Score is the best confidence score. Compared with existing methods, the proposed ZSPAD-Model performs better than the feature-based method and under the multi-shot setting, the proposed method overperforms the learning based method with little training data. When large training data is available, their results are similar.

cs.CV↗

arXiv2020

Heterogeneous domain adaptation: An unsupervised approach

Domain adaptation leverages the knowledge in one domain - the source domain - to improve learning efficiency in another domain - the target domain. Existing heterogeneous domain adaptation research is relatively well-progressed, but only in situations where the target domain contains at least a few labeled instances. In contrast, heterogeneous domain adaptation with an unlabeled target domain has not been well-studied. To contribute to the research in this emerging field, this paper presents: (1) an unsupervised knowledge transfer theorem that guarantees the correctness of transferring knowledge; and (2) a principal angle-based metric to measure the distance between two pairs of domains: one pair comprises the original source and target domains and the other pair comprises two homogeneous representations of two domains. The theorem and the metric have been implemented in an innovative transfer model, called a Grassmann-Linear monotonic maps-geodesic flow kernel (GLG), that is specifically designed for heterogeneous unsupervised domain adaptation (HeUDA). The linear monotonic maps meet the conditions of the theorem and are used to construct homogeneous representations of the heterogeneous domains. The metric shows the extent to which the homogeneous representations have preserved the information in the original source and target domains. By minimizing the proposed metric, the GLG model learns the homogeneous representations of heterogeneous domains and transfers knowledge through these learned representations via a geodesic flow kernel. To evaluate the model, five public datasets were reorganized into ten HeUDA tasks across three applications: cancer detection, credit assessment, and text classification. The experiments demonstrate that the proposed model delivers superior performance over the existing baselines.

cs.LG↗

arXiv2020

Self-controlled growth of highly uniform Ge/Si hut wires for scalable qubit devices

Semiconductor nanowires have been playing a crucial role in the development of nanoscale devices for the realization of spin qubits, Majorana fermions, single photon emitters, nanoprocessors, etc. The monolithic growth of site-controlled nanowires is a prerequisite towards the next generation of devices that will require addressability and scalability. Here, combining top-down nanofabrication and bottom-up self-assembly, we report on the growth of Ge wires on pre-patterned Si (001) substrates with controllable position, distance, length and structure. This is achieved by a novel growth process which uses a SiGe strain-relaxation template and can be generalized to other material combinations. Transport measurements show an electrically tunable spin-orbit coupling, with a spin-orbit length similar to that of III-V materials. Also, capacitive coupling between closely spaced wires is observed, which underlines their potential as a host for implementing two qubit gates. The reported results open a path towards scalable qubit devices with Si compatibility.

cond-mat.mes-hall↗

arXiv2020

Identification of New Assembly Mode in the Heliconical Nematic Phase via Tender Resonant X-ray Scattering

Helical structures are exciting and are utilized in numerous applications ranging from biotechnology to displays to medicine. Accurate description and understanding of resonance effects in helical structures provides crucial knowledge on molecular packing beyond positional ordering. We exam-ined the manifestation of resonance effects in a nematic phase with heliconical structure, the so called twist bend nematic (NTB) via tender resonant X-ray scattering (TReXS) at the sulfur K-edge. We demonstrate for the first time quantitatively that the energy dependence of the scattering peak in the NTB phase follows the energy dependence of the complex refractive indices measured by X-ray absorption. This allows us to identify a new self-assembly mode for specific sets of liquid crystal dimers in the NTB phase. We anticipate that new avenues in the exploration of complex orientational structures both in static as well as in dynamic modes induced by external stimuli will be pursued.

cond-mat.soft↗

arXiv2020

Frosting Weights for Better Continual Training

Training a neural network model can be a lifelong learning process and is a computationally intensive one. A severe adverse effect that may occur in deep neural network models is that they can suffer from catastrophic forgetting during retraining on new data. To avoid such disruptions in the continuous learning, one appealing property is the additive nature of ensemble models. In this paper, we propose two generic ensemble approaches, gradient boosting and meta-learning, to solve the catastrophic forgetting problem in tuning pre-trained neural network models.

cs.LG↗

arXiv2019

Vertically-Oriented Graphene Oxide Membranes for High-Performance Osmotic Energy Conversion

Reverse electrodialysis is a promising method to harvest the osmotic energy stored between seawater and freshwater, but it has been a long-standing challenge to fabricate permselective membranes with the power density surpassing the industry benchmark of 5.0 W $m^{-2}$ for half a century. Herein, we report a vertically-oriented graphene oxide membranes (V-GOMs) with the combination of high ion selectivity and ultrafast ion permeation, whose permeation is three orders of magnitude higher than the extensively studied horizontally stacked GOMs (H-GOMs). By mixing artificial seawater and river water, we obtained an unprecedented high output power density of 10.6 W $m^{-2}$, outperforming all existing materials. Molecular dynamics (MD) simulations reveal the mechanism of the ultrafast transport in V-GOMs results from the quick entering of ions and the large accessible area as well as the apparent short diffusion paths in V-GOMs. These results will facilitate the practical application of osmotic energy and bring innovative design strategy for various systems involving ultrafast transport, such as filtration and catalysis.

physics.app-ph↗

arXiv2019

Distributed Stability Conditions for Power Systems with Heterogeneous Nonlinear Bus Dynamics

This paper derives distributed conditions that guarantee the system-wide stability for power systems with nonlinear and heterogeneous bus dynamics interconnected via power network. Our conditions require each bus dynamics should satisfy certain passivity-like conditions with a large enough passivity index, a sufficient requirement of which is dictated by the steady-state power flow. The passivity indices uniformly quantify the impacts on the system-wide stability of individual bus dynamics and the coupling strength from the power network. Furthermore, taking three typical bus dynamics as examples, we show that these conditions can be easily fulfilled via proper control design. Simulations on a rudimentary 3-bus example and the IEEE 39-bus system well verify our results under both small and large disturbances.

eess.SY↗

arXiv2019

Deep Reinforcement Learning based Recommendation with Explicit User-Item Interactions Modeling

Recommendation is crucial in both academia and industry, and various techniques are proposed such as content-based collaborative filtering, matrix factorization, logistic regression, factorization machines, neural networks and multi-armed bandits. However, most of the previous studies suffer from two limitations: (1) considering the recommendation as a static procedure and ignoring the dynamic interactive nature between users and the recommender systems, (2) focusing on the immediate feedback of recommended items and neglecting the long-term rewards. To address the two limitations, in this paper we propose a novel recommendation framework based on deep reinforcement learning, called DRR. The DRR framework treats recommendation as a sequential decision making procedure and adopts an "Actor-Critic" reinforcement learning scheme to model the interactions between the users and recommender systems, which can consider both the dynamic adaptation and long-term rewards. Furthermore, a state representation module is incorporated into DRR, which can explicitly capture the interactions between items and users. Three instantiation structures are developed. Extensive experiments on four real-world datasets are conducted under both the offline and online evaluation settings. The experimental results demonstrate the proposed DRR method indeed outperforms the state-of-the-art competitors.

cs.IR↗

arXiv2019

Excited quantum Hall effect: enantiomorphic flat bands in a Yin-Yang Kagome lattice

Quantum Hall effect (QHE) is one of the most fruitful research topics in condensed-matter physics. Ordinarily, the QHE manifests in a ground state with time-reversal symmetry broken by magnetization to carry a quantized chiral edge conductivity around a two-dimensional insulating bulk. We propose a theoretical concept and model of non-equilibrium excited-state QHE (EQHE) without intrinsic magnetization. It arises from circularly polarized photoexcitation between two enantiomorphic flat bands of opposite chirality, each supporting originally a helical topological insulating state hosted in a Yin-Yang Kagome lattice. The chirality of its edge state can be reversed by the handedness of light, instead of the direction of magnetization as in the conventional quantum (anomalous) Hall effect, offering a simple switching mechanism for quantum devices. Implications and realization of EQHE in real materials are discussed.

cond-mat.mtrl-sci↗

arXiv2019

Magnetic Weyl semimetals with diamond structure realized in spinel compounds

Diamond-structure materials have been extensively studied for decades, which form the foundation for most semiconductors and their modern day electronic devices. Here, we discover a e$_g$-orbital ($d_{z^2}$,$d_{x^2-y^2}$ ) model within the diamond lattice (e$_g$-diamond model) that hosts novel topological states. Specifically, the e$_g$-diamond model yields a 3D nodal cage (3D-NC), which is characterized by a $d$-$d$ band inversion protected by two types of degenerate states (i.e., e$_g$-orbital and diamond-sublattice degeneracies). We demonstrate materials realization of this model in the well-known spinel compounds (AB$_2$X$_4$), where the tetrahedron-site cations (A) form the diamond sub-lattice. An ideal half metal with one metallic spin channel formed by well-isolated and half-filled e$_g$-diamond bands, accompanied by a large spin gap (4.36 eV) is discovered in one 4-2 spinel compound (VMg$_2$O$_4$), which becomes a magnetic Weyl semimetal when spin-orbit coupling effect is further considered. Our discovery greatly enriches the physics of diamond structure and spinel compounds, opening a door to their application in spintronics.

cond-mat.mtrl-sci↗

arXiv2019

An Energy Sharing Game with Generalized Demand Bidding: Model and Properties

This paper proposes a novel energy sharing mechanism for prosumers who can produce and consume. Different from most existing works, the role of individual prosumer as a seller or buyer in our model is endogenously determined. Several desirable properties of the proposed mechanism are proved based on a generalized game-theoretic model. We show that the Nash equilibrium exists and is the unique solution of an equivalent convex optimization problem. The sharing price at the Nash equilibrium equals to the average marginal disutility of all prosumers. We also prove that every prosumer has the incentive to participate in the sharing market, and prosumers' total cost decreases with increasing absolute value of price sensitivity. Furthermore, the Nash equilibrium approaches the social optimal as the number of prosumers grows, and competition can improve social welfare.

math.OC↗

arXiv2019

Context-Aware Image Matting for Simultaneous Foreground and Alpha Estimation

Natural image matting is an important problem in computer vision and graphics. It is an ill-posed problem when only an input image is available without any external information. While the recent deep learning approaches have shown promising results, they only estimate the alpha matte. This paper presents a context-aware natural image matting method for simultaneous foreground and alpha matte estimation. Our method employs two encoder networks to extract essential information for matting. Particularly, we use a matting encoder to learn local features and a context encoder to obtain more global context information. We concatenate the outputs from these two encoders and feed them into decoder networks to simultaneously estimate the foreground and alpha matte. To train this whole deep neural network, we employ both the standard Laplacian loss and the feature loss: the former helps to achieve high numerical performance while the latter leads to more perceptually plausible results. We also report several data augmentation strategies that greatly improve the network's generalization performance. Our qualitative and quantitative experiments show that our method enables high-quality matting for a single natural image. Our inference codes and models have been made publicly available at https://github.com/hqqxyy/Context-Aware-Matting.

cs.CV↗

arXiv2019

IBRS: An Efficient Identity-based Batch Verification Scheme for VANETs Based on Ring Signature

Vehicular ad-hoc networks (VANETs) are one of the most important components in an Intelligent Transportation System (ITS), which aims to provide information communication between vehicles. A safety-critical vehicular communication requires security, privacy, auditability, and efficiency. To satisfy these requirements simultaneously, several conditional privacy-preserving authentication schemes are proposed by employing ring signature. However, these methods have been paid too little attention to the issues like \textit{how to choose the valid ring members} or \textit{how to set up a ring}. In this paper, we introduce an efficient conditional privacy-preserving scheme which provides an appropriate approach establishing the list of ring members. Moreover, our proposed scheme also supports batch verification to significantly reduce the computational cost. According to the analysis of security, our scheme is sufficiently resistant against several common attacks in VANETs. The performance results show that the proposed scheme is efficient and practical with both low computation and communication cost.

cs.CR↗

arXiv2019

Optical Control of transverse Motion of Ionization injected Electrons in Laser Plasma Wakefield

We demonstrate an all-optical method for controlling the transverse motion of ionization injected electron beam, by utilizing the transversely asymmetrical wakefield via adjusting the shape of the laser focal spot. When the laser spot shape is changed from the circular to the obliquely elliptic in experiment, the electron beam shape becomes from elliptic to three different shapes. The 3D-PIC simulation results agree well with experiment, and it shows the trajectories of the accelerated electrons change from undulation to helix. Such an all-optical method could be useful for convenient control of the transverse motion of an electron beam which results in synchrotron radiation with orbit angular momentum.

physics.plasm-ph↗

arXiv2019

3D Ken Burns Effect from a Single Image

The Ken Burns effect allows animating still images with a virtual camera scan and zoom. Adding parallax, which results in the 3D Ken Burns effect, enables significantly more compelling results. Creating such effects manually is time-consuming and demands sophisticated editing skills. Existing automatic methods, however, require multiple input images from varying viewpoints. In this paper, we introduce a framework that synthesizes the 3D Ken Burns effect from a single image, supporting both a fully automatic mode and an interactive mode with the user controlling the camera. Our framework first leverages a depth prediction pipeline, which estimates scene depth that is suitable for view synthesis tasks. To address the limitations of existing depth estimation methods such as geometric distortions, semantic distortions, and inaccurate depth boundaries, we develop a semantic-aware neural network for depth prediction, couple its estimate with a segmentation-based depth adjustment process, and employ a refinement neural network that facilitates accurate depth predictions at object boundaries. According to this depth estimate, our framework then maps the input image to a point cloud and synthesizes the resulting video frames by rendering the point cloud from the corresponding camera positions. To address disocclusions while maintaining geometrically and temporally coherent synthesis results, we utilize context-aware color- and depth-inpainting to fill in the missing information in the extreme views of the camera path, thus extending the scene geometry of the point cloud. Experiments with a wide variety of image content show that our method enables realistic synthesis results. Our study demonstrates that our system allows users to achieve better results while requiring little effort compared to existing solutions for the 3D Ken Burns effect creation.

cs.CV↗

arXiv2019

On Learning Disentangled Representations for Gait Recognition

Gait, the walking pattern of individuals, is one of the important biometrics modalities. Most of the existing gait recognition methods take silhouettes or articulated body models as gait features. These methods suffer from degraded recognition performance when handling confounding variables, such as clothing, carrying and viewing angle. To remedy this issue, we propose a novel AutoEncoder framework, GaitNet, to explicitly disentangle appearance, canonical and pose features from RGB imagery. The LSTM integrates pose features over time as a dynamic gait feature while canonical features are averaged as a static gait feature. Both of them are utilized as classification features. In addition, we collect a Frontal-View Gait (FVG) dataset to focus on gait recognition from frontal-view walking, which is a challenging problem since it contains minimal gait cues compared to other views. FVG also includes other important variations, e.g., walking speed, carrying, and clothing. With extensive experiments on CASIA-B, USF, and FVG datasets, our method demonstrates superior performance to the SOTA quantitatively, the ability of feature disentanglement qualitatively, and promising computational efficiency. We further compare our GaitNet with state-of-the-art face recognition to demonstrate the advantages of gait biometrics identification under certain scenarios, e.g., long distance/lower resolutions, cross viewing angles.

cs.CV↗

arXiv2019

Meta Learning with Relational Information for Short Sequences

This paper proposes a new meta-learning method -- named HARMLESS (HAwkes Relational Meta LEarning method for Short Sequences) for learning heterogeneous point process models from short event sequence data along with a relational network. Specifically, we propose a hierarchical Bayesian mixture Hawkes process model, which naturally incorporates the relational information among sequences into point process modeling. Compared with existing methods, our model can capture the underlying mixed-community patterns of the relational network, which simultaneously encourages knowledge sharing among sequences and facilitates adaptive learning for each individual sequence. We further propose an efficient stochastic variational meta expectation maximization algorithm that can scale to large problems. Numerical experiments on both synthetic and real data show that HARMLESS outperforms existing methods in terms of predicting the future events.

cs.LG↗