arXiv subjects

Fan Zhang

Publications and source records attributed to Fan Zhang.

At least 811 records · Page 45Linked to original sources

arXiv2019

The Medium Energy (ME) X-ray telescope onboard the Insight-HXMT astronomy satellite

The Medium Energy X-ray telescope (ME) is one of the three main telescopes on board the Insight Hard X-ray Modulation Telescope (Insight-HXMT) astronomy satellite. ME contains 1728 pixels of Si-PIN detectors sensitive in 5-30 keV with a total geometrical area of 952 cm2. Application Specific Integrated Circuit (ASIC) chips, VA32TA6, is used to achieve low power consumption and low readout noise. The collimators define three kinds of field of views (FOVs) for the telescope, 1°{\times}4°, 4°{\times}4°, and blocked ones. Combination of such FOVs can be used to estimate the in-orbit X-ray and particle background components. The energy resolution of ME is ~3 keV at 17.8 keV (FWHM) and the time resolution is 255 μs. In this paper, we introduce the design and performance of ME.

astro-ph.IM↗

arXiv2019

A Survey of Deep Learning-based Object Detection

Object detection is one of the most important and challenging branches of computer vision, which has been widely applied in peoples life, such as monitoring security, autonomous driving and so on, with the purpose of locating instances of semantic objects of a certain class. With the rapid development of deep learning networks for detection tasks, the performance of object detectors has been greatly improved. In order to understand the main development status of object detection pipeline, thoroughly and deeply, in this survey, we first analyze the methods of existing typical detection models and describe the benchmark datasets. Afterwards and primarily, we provide a comprehensive overview of a variety of object detection methods in a systematic manner, covering the one-stage and two-stage detectors. Moreover, we list the traditional and new applications. Some representative branches of object detection are analyzed as well. Finally, we discuss the architecture of exploiting these object detection methods to build an effective and efficient system and point out a set of development trends to better follow the state-of-the-art algorithms and further research.

cs.CV↗

arXiv2019

Alternative route towards the change of metric signature

Beginning with Hartle and Hawking's no-boundary proposal, it has long been known that the pathology of a big bang singularity can be suppressed if a transition into Riemannian (Euclidean) metric signature (the usual singularity theorems become invalid in this region) occurs when we track back along cosmic time. A vital component of this type of models, that needs to be clarified, is the set of junction conditions at the boundary between the two signature regimes. In the traditional approach, the signature change occurs in the temporal sector through a switch of sign in the lapse-squared function. Motivated by more straightforward connections with the big bang cosmology, we explore here an alternative whereby the spatial metric eigenvalues change sign instead, so that the Riemannian side is purely timelike. We investigate the junction conditions required in this case.

gr-qc↗

arXiv2019

Learning-Guided Network Fuzzing for Testing Cyber-Physical System Defences

The threat of attack faced by cyber-physical systems (CPSs), especially when they play a critical role in automating public infrastructure, has motivated research into a wide variety of attack defence mechanisms. Assessing their effectiveness is challenging, however, as realistic sets of attacks to test them against are not always available. In this paper, we propose smart fuzzing, an automated, machine learning guided technique for systematically finding 'test suites' of CPS network attacks, without requiring any knowledge of the system's control programs or physical processes. Our approach uses predictive machine learning models and metaheuristic search algorithms to guide the fuzzing of actuators so as to drive the CPS into different unsafe physical states. We demonstrate the efficacy of smart fuzzing by implementing it for two real-world CPS testbeds---a water purification plant and a water distribution system---finding attacks that drive them into 27 different unsafe states involving water flow, pressure, and tank levels, including six that were not covered by an established attack benchmark. Finally, we use our approach to test the effectiveness of an invariant-based defence system for the water treatment plant, finding two attacks that were not detected by its physical invariant checks, highlighting a potential weakness that could be exploited in certain conditions.

cs.CR↗

arXiv2019

The method of mixed events for higher cumulants of conserved charges

Higher cumulants of conserved charges are sensitive observables of quantum chromodynamics phase transitions. The sample of mixed events provides a background to estimate non-critical effects of cumulants. Four possible methods for constructing the sample of mixed events are suggested. The effectiveness of each method is examined. It is showed that the method of most random or least constrain is the best, rather than the conventional method.

hep-ph↗

arXiv2019

Unsupervised Domain Adaptation via Disentangled Representations: Application to Cross-Modality Liver Segmentation

A deep learning model trained on some labeled data from a certain source domain generally performs poorly on data from different target domains due to domain shifts. Unsupervised domain adaptation methods address this problem by alleviating the domain shift between the labeled source data and the unlabeled target data. In this work, we achieve cross-modality domain adaptation, i.e. between CT and MRI images, via disentangled representations. Compared to learning a one-to-one mapping as the state-of-art CycleGAN, our model recovers a many-to-many mapping between domains to capture the complex cross-domain relations. It preserves semantic feature-level information by finding a shared content space instead of a direct pixelwise style transfer. Domain adaptation is achieved in two steps. First, images from each domain are embedded into two spaces, a shared domain-invariant content space and a domain-specific style space. Next, the representation in the content space is extracted to perform a task. We validated our method on a cross-modality liver segmentation task, to train a liver segmentation model on CT images that also performs well on MRI. Our method achieved Dice Similarity Coefficient (DSC) of 0.81, outperforming a CycleGAN-based method of 0.72. Moreover, our model achieved good generalization to joint-domain learning, in which unpaired data from different modalities are jointly learned to improve the segmentation performance on each individual modality. Lastly, under a multi-modal target domain with significant diversity, our approach exhibited the potential for diverse image generation and remained effective with DSC of 0.74 on multi-phasic MRI while the CycleGAN-based method performed poorly with a DSC of only 0.52.

eess.IV↗

arXiv2019

Domain-Agnostic Learning with Anatomy-Consistent Embedding for Cross-Modality Liver Segmentation

Domain Adaptation (DA) has the potential to greatly help the generalization of deep learning models. However, the current literature usually assumes to transfer the knowledge from the source domain to a specific known target domain. Domain Agnostic Learning (DAL) proposes a new task of transferring knowledge from the source domain to data from multiple heterogeneous target domains. In this work, we propose the Domain-Agnostic Learning framework with Anatomy-Consistent Embedding (DALACE) that works on both domain-transfer and task-transfer to learn a disentangled representation, aiming to not only be invariant to different modalities but also preserve anatomical structures for the DA and DAL tasks in cross-modality liver segmentation. We validated and compared our model with state-of-the-art methods, including CycleGAN, Task Driven Generative Adversarial Network (TD-GAN), and Domain Adaptation via Disentangled Representations (DADR). For the DA task, our DALACE model outperformed CycleGAN, TD-GAN ,and DADR with DSC of 0.847 compared to 0.721, 0.793 and 0.806. For the DAL task, our model improved the performance with DSC of 0.794 from 0.522, 0.719 and 0.742 by CycleGAN, TD-GAN, and DADR. Further, we visualized the success of disentanglement, which added human interpretability of the learned meaningful representations. Through ablation analysis, we specifically showed the concrete benefits of disentanglement for downstream tasks and the role of supervision for better disentangled representation with segmentation consistency to be invariant to domains with the proposed Domain-Agnostic Module (DAM) and to preserve anatomical information with the proposed Anatomy-Preserving Module (APM).

eess.IV↗

arXiv2019

Ekiden: A Platform for Confidentiality-Preserving, Trustworthy, and Performant Smart Contract Execution

Smart contracts are applications that execute on blockchains. Today they manage billions of dollars in value and motivate visionary plans for pervasive blockchain deployment. While smart contracts inherit the availability and other security assurances of blockchains, however, they are impeded by blockchains' lack of confidentiality and poor performance. We present Ekiden, a system that addresses these critical gaps by combining blockchains with Trusted Execution Environments (TEEs). Ekiden leverages a novel architecture that separates consensus from execution, enabling efficient TEE-backed confidentiality-preserving smart-contracts and high scalability. Our prototype (with Tendermint as the consensus layer) achieves example performance of 600x more throughput and 400x less latency at 1000x less cost than the Ethereum mainnet. Another contribution of this paper is that we systematically identify and treat the pitfalls arising from harmonizing TEEs and blockchains. Treated separately, both TEEs and blockchains provide powerful guarantees, but hybridized, though, they engender new attacks. For example, in naive designs, privacy in TEE-backed contracts can be jeopardized by forgery of blocks, a seemingly unrelated attack vector. We believe the insights learned from Ekiden will prove to be of broad importance in hybridized TEE-blockchain systems.

cs.CR↗

arXiv2019

Edge AIBench: Towards Comprehensive End-to-end Edge Computing Benchmarking

In edge computing scenarios, the distribution of data and collaboration of workloads on different layers are serious concerns for performance, privacy, and security issues. So for edge computing benchmarking, we must take an end-to-end view, considering all three layers: client-side devices, edge computing layer, and cloud servers. Unfortunately, the previous work ignores this most important point. This paper presents the BenchCouncil's coordinated e ort on edge AI benchmarks, named Edge AIBench. In total, Edge AIBench models four typical application scenarios: ICU Patient Monitor, Surveillance Camera, Smart Home, and Autonomous Vehicle with the focus on data distribution and workload collaboration on three layers. Edge AIBench is a part of the open-source AIBench project, publicly available from http://www.benchcouncil.org/AIBench/index.html. We also build an edge computing testbed with a federated learning framework to resolve performance, privacy, and security issues.

cs.PF↗

arXiv2019

Comparative studies of optoelectrical properties of prominent PV materials: Halide Perovskite, CdTe, and GaAs

We compare three representative high performance PV materials: halide perovskite MAPbI3, CdTe, and GaAs, in terms of photoluminescence (PL) efficiency, PL lineshape, carrier diffusion, and surface recombination, over multiple orders of photo-excitation density. An analytic model is used to describe the excitation density dependence of PL intensity and extract the internal PL efficiency and multiple pertinent recombination parameters. A PL imaging technique is used to obtain carrier diffusion length without using a PL quencher, thus, free of unintended influence beyond pure diffusion. Our results show that perovskite samples tend to exhibit lower Shockley-Read-Hall (SRH) recombination rate in both bulk and surface, thus higher PL efficiency than the inorganic counterparts, particularly under low excitation density, even with no or preliminary surface passivation. PL lineshape and diffusion analysis indicate that there is considerable structural disordering in the perovskite materials, and thus photo-generated carriers are not in global thermal equilibrium, which in turn suppresses the nonradiative recombination. This study suggests that relatively low point-defect density, less detrimental surface recombination, and moderate structural disordering contribute to the high PV efficiency in the perovskite. This comparative photovoltaics study provides more insights into the fundamental material science and the search for optimal device designs by learning from different technologies.

physics.app-ph↗

arXiv2019

Insight-HXMT observations of Swift J0243.6+6124 during its 2017-2018 outburst

The recently discovered neutron star transient Swift J0243.6+6124 has been monitored by {\it the Hard X-ray Modulation Telescope} ({\it Insight-\rm HXMT). Based on the obtained data, we investigate the broadband spectrum of the source throughout the outburst. We estimate the broadband flux of the source and search for possible cyclotron line in the broadband spectrum. No evidence of line-like features is, however, found up to $\rm 150~keV$. In the absence of any cyclotron line in its energy spectrum, we estimate the magnetic field of the source based on the observed spin evolution of the neutron star by applying two accretion torque models. In both cases, we get consistent results with $B\rm \sim 10^{13}~G$, $D\rm \sim 6~kpc$ and peak luminosity of $\rm >10^{39}~erg~s^{-1}$ which makes the source the first Galactic ultraluminous X-ray source hosting a neutron star.

astro-ph.HE↗

arXiv2019

Predicting Treatment Initiation from Clinical Time Series Data via Graph-Augmented Time-Sensitive Model

Many computational models were proposed to extract temporal patterns from clinical time series for each patient and among patient group for predictive healthcare. However, the common relations among patients (e.g., share the same doctor) were rarely considered. In this paper, we represent patients and clinicians relations by bipartite graphs addressing for example from whom a patient get a diagnosis. We then solve for the top eigenvectors of the graph Laplacian, and include the eigenvectors as latent representations of the similarity between patient-clinician pairs into a time-sensitive prediction model. We conducted experiments using real-world data to predict the initiation of first-line treatment for Chronic Lymphocytic Leukemia (CLL) patients. Results show that relational similarity can improve prediction over multiple baselines, for example a 5% incremental over long-short term memory baseline in terms of area under precision-recall curve.

cs.LG↗

arXiv2019

K-Core Maximization through Edge Additions

A popular model to measure the stability of a network is k-core - the maximal induced subgraph in which every vertex has at least k neighbors. Many studies maximize the number of vertices in k-core to improve the stability of a network. In this paper, we study the edge k-core problem: Given a graph G, an integer k and a budget b, add b edges to non-adjacent vertex pairs in G such that the k-core is maximized. We prove the problem is NP-hard and APX-hard. A heuristic algorithm is proposed on general graphs with effective optimization techniques. Comprehensive experiments on 9 real-life datasets demonstrate the effectiveness and the efficiency of our proposed methods.

cs.SI↗

arXiv2019

Critical Edge Identification: A K-Truss Based Model

In a social network, the strength of relationships between users can significantly affect the stability of the network. In this paper, we use the k-truss model to measure the stability of a social network. To identify critical connections, we propose a novel problem, named k-truss minimization. Given a social network G and a budget b, it aims to find b edges for deletion which can lead to the maximum number of edge breaks in the k-truss of G. We show that the problem is NP-hard. To accelerate the computation, novel pruning rules are developed to reduce the candidate size. In addition, we propose an upper bound based strategy to further reduce the searching space. Comprehensive experiments are conducted over real social networks to demonstrate the efficiency and effectiveness of the proposed techniques.

cs.SI↗

arXiv2019

MediaPipe: A Framework for Building Perception Pipelines

Building applications that perceive the world around them is challenging. A developer needs to (a) select and develop corresponding machine learning algorithms and models, (b) build a series of prototypes and demos, (c) balance resource consumption against the quality of the solutions, and finally (d) identify and mitigate problematic cases. The MediaPipe framework addresses all of these challenges. A developer can use MediaPipe to build prototypes by combining existing perception components, to advance them to polished cross-platform applications and measure system performance and resource consumption on target platforms. We show that these features enable a developer to focus on the algorithm or model development and use MediaPipe as an environment for iteratively improving their application with results reproducible across different devices and platforms. MediaPipe will be open-sourced at https://github.com/google/mediapipe.

cs.DC↗

arXiv2019

A Distributionally Robust Boosting Algorithm

Distributionally Robust Optimization (DRO) has been shown to provide a flexible framework for decision making under uncertainty and statistical estimation. For example, recent works in DRO have shown that popular statistical estimators can be interpreted as the solutions of suitable formulated data-driven DRO problems. In turn, this connection is used to optimally select tuning parameters in terms of a principled approach informed by robustness considerations. This paper contributes to this growing literature, connecting DRO and statistics, by showing how boosting algorithms can be studied via DRO. We propose a boosting type algorithm, named DRO-Boosting, as a procedure to solve our DRO formulation. Our DRO-Boosting algorithm recovers Adaptive Boosting (AdaBoost) in particular, thus showing that AdaBoost is effectively solving a DRO problem. We apply our algorithm to a financial dataset on credit card default payment prediction. We find that our approach compares favorably to alternative boosting methods which are widely used in practice.

stat.ML↗

arXiv2019

Experience: Understanding Long-Term Evolving Patterns of Shared Electric Vehicle Networks

Due to the ever-growing concerns on air pollution and energy security, many cities have started to update their taxi fleets with electric ones. Although environmentally friendly, the rapid promotion of electric taxis raises problems to both taxi drivers and governments, e.g., prolonged waiting/charging time, unbalanced utilization of charging infrastructures and reduced taxi supply due to the long charging time. In this paper, we make the first effort to understand the long-term evolving patterns through a five-year study on one of the largest electric taxi networks in the world, i.e., the Shenzhen electric taxi network in China. In particular, we perform a comprehensive measurement investigation called ePat to explore the evolving mobility and charging patterns of electric vehicles. Our ePat is based on 4.8 TB taxi GPS data, 240 GB taxi transaction data, and metadata from 117 charging stations, during an evolving process from 427 electric taxis in 2013 to 13,178 in 2018. Moreover, ePat also explores the impacts of various contexts and benefits during the evolving process. Our ePat as a comprehensive investigation of the electric taxi network mobility and charging evolving has the potential to advance the understanding of the evolving patterns of electric taxi networks and pave the way for analyzing future shared autonomous vehicles.

eess.SP↗

arXiv2019

Composite Dirac Semimetal

Weak topological insulators and Dirac semimetals are gapped and nodal phases with distinct topological properties, respectively. Here, we propose a novel topological phase that exhibits features of both and is dubbed composite Dirac semimetal (CDSM). In its bulk, the CDSM has a pair of Dirac points and a pair of bands inverted along a high-symmetry path. At side surfaces, a pair of Fermi arcs connecting the projected Dirac points coexist with a pair of Fermi loops traversing the surface Brillouin zone. A nonsymmorphic symmetry dictates degeneracies between the Fermi arcs and the Fermi loops. We characterize the CDSM by multiple topological invariants and show that, under a transition without breaking any symmetry, it deforms into a topological crystalline insulator hosting two pairs of surface Fermi loops. We demonstrate the CDSM in two models and predict its realization in the KAuTe-family materials.

cond-mat.mes-hall↗