Searcharxiv⌕ Search

arXiv subjects

Wei Wei

Publications and source records attributed to Wei Wei.

At least 487 records · Page 27Linked to original sources

Lifting the Veil on Quark Matter in Compact Stars with Core g-mode Oscillations

Compact stars containing quark matter may masquerade as neutron stars in the range of measured mass and radius, making it difficult to draw firm conclusions on the phase of matter inside the star. The sensitivity of core $g$-mode oscillations to the presence of a mixed phase may alleviate this difficulty. In hybrid stars that admit quark matter in a mixed phase, the $g$-mode frequency rises sharply due to a marked decrease in the equilibrium sound speed. Resonant excitation of $g$-modes can leave an imprint on the waveform of coalescing binary compact stars. We present some analytic and numeric results to assess the sensitivity displayed by $g$-mode oscillations to quark matter in a homogeneous or mixed phase and find that the $g$-mode can probe the fraction of quark matter inside the star.

nucl-th↗

AI Matrix - Synthetic Benchmarks for DNN

Deep neural network (DNN) architectures, such as convolutional neural networks (CNN), involve heavy computation and require hardware, such as CPU, GPU, and AI accelerators, to provide the massive computing power. With the many varieties of AI hardware prevailing on the market, it is often hard to decide which one is the best to use. Thus, benchmarking AI hardware effectively becomes important and is of great help to select and optimize AI hardware. Unfortunately, there are few AI benchmarks available in both academia and industry. Examples are BenchNN[1], DeepBench[2], and Dawn Bench[3], which are usually a collection of typical real DNN applications. While these benchmarks provide performance comparison across different AI hardware, they suffer from a number of drawbacks. First, they cannot adapt to the emerging changes of DNN algorithms and are fixed once selected. Second, they contain tens to hundreds of applications and take very long time to finish running. Third, they are mainly selected from open sources, which are restricted by copyright and are not representable to proprietary applications. In this work, a synthetic benchmarks framework is firstly proposed to address the above drawbacks of AI benchmarks. Instead of pre-selecting a set of open-sourced benchmarks and running all of them, the synthetic approach generates only a one or few benchmarks that best represent a broad range of applications using profiled workload characteristics data of these applications. Thus, it can adapt to emerging changes of new DNN algorithms by re-profiling new applications and updating itself, greatly reduce benchmark count and running time, and strongly represent DNN applications of interests. The generated benchmarks are called AI Matrix, serving as a performance benchmarks matching the statistical workload characteristics of a combination of applications of interests.

cs.CV↗

Camouflage of the Phase Transition to Quark Matter in Neutron Stars

It has been known for some time that compact stars containing quark matter can masquerade as neutron stars in the range of measured mass and radius, making it difficult to draw firm conclusions on the phases of matter present inside the star. Using the vector-enhanced Bag model (vBag), we examine mass-radius and mass-compactness relations with Maxwell and Gibbs construction for hybrid stars with transitions from nuclear matter to two or three-flavor quark matter, including sequential transitions. Not only can stable hybrid stars with either two or three-flavor quark matter mimic neutron stars (the traditional masquerade), it appears as well difficult to distinguish two-flavor from three-flavor quark matter even in cases where a phase transition can be said to have occurred, as in the presence of a distinct kink in the mass-radius relation. Furthermore, allowing for sequential flavor transitions, we find that the transition into an unstable branch can be caused by either a transition from a nuclear to unstable quark matter or the sequential transition from nuclear to stable but "masquerading" two-flavor to unstable three-flavor quark matter. Addressing chiral restoration as well as quark deconfinement in a model of the phase transition, as the vBag does, adds further flexibility to the high-density equation of state, motivating caution in using even high-precision $M$-$R$ data to draw firm conclusions on the nature of phases and phase transitions in neutron stars.

nucl-th↗

Core Influence Mechanism on Vertex-Cover Problem through Leaf-Removal-Core Breaking

Leaf-Removal process has been widely researched and applied in many mathematical and physical fields to help understand the complex systems, and a lot of problems including the minimal vertex-cover are deeply related to this process and the Leaf-Removal cores. In this paper, based on the structural features of the Leaf-Removal cores, a method named Core Influence is proposed to break the graphs into No-Leaf-Removal-Core ones, which takes advantages of identifying some significant nodes by localized and greedy strategy. By decomposing the minimal vertex-cover problem into the Leaf-Removal cores breaking process and maximal matching of the remained graphs, it is proved that any minimal vertex-covers of the whole graph can be located into these two processes, of which the latter one is a P problem, and the best boundary is achieved at the transition point. Compared with other node importance indices, the Core Influence method could break down the Leaf-Removal cores much faster and get the no-core graphs by removing fewer nodes from the graphs. Also, the vertex-cover numbers resulted from this method are lower than existing node importance measurements, and compared with the exact minimal vertex-cover numbers, this method performs appropriate accuracy and stability at different scales. This research provides a new localized greedy strategy to break the hard Leaf-Removal Cores efficiently and heuristic methods could be constructed to help understand some NP problems.

cs.SI↗

Searching Toward Pareto-Optimal Device-Aware Neural Architectures

Recent breakthroughs in Neural Architectural Search (NAS) have achieved state-of-the-art performance in many tasks such as image classification and language understanding. However, most existing works only optimize for model accuracy and largely ignore other important factors imposed by the underlying hardware and devices, such as latency and energy, when making inference. In this paper, we first introduce the problem of NAS and provide a survey on recent works. Then we deep dive into two recent advancements on extending NAS into multiple-objective frameworks: MONAS and DPP-Net. Both MONAS and DPP-Net are capable of optimizing accuracy and other objectives imposed by devices, searching for neural architectures that can be best deployed on a wide spectrum of devices: from embedded systems and mobile devices to workstations. Experimental results are poised to show that architectures found by MONAS and DPP-Net achieves Pareto optimality w.r.t the given objectives for various devices.

cs.LG↗

Escaping from Collapsing Modes in a Constrained Space

Generative adversarial networks (GANs) often suffer from unpredictable mode-collapsing during training. We study the issue of mode collapse of Boundary Equilibrium Generative Adversarial Network (BEGAN), which is one of the state-of-the-art generative models. Despite its potential of generating high-quality images, we find that BEGAN tends to collapse at some modes after a period of training. We propose a new model, called \emph{BEGAN with a Constrained Space} (BEGAN-CS), which includes a latent-space constraint in the loss function. We show that BEGAN-CS can significantly improve training stability and suppress mode collapse without either increasing the model complexity or degrading the image quality. Further, we visualize the distribution of latent vectors to elucidate the effect of latent-space constraint. The experimental results show that our method has additional advantages of being able to train on small datasets and to generate images similar to a given real image yet with variations of designated attributes on-the-fly.

cs.LG↗

DPP-Net: Device-aware Progressive Search for Pareto-optimal Neural Architectures

Recent breakthroughs in Neural Architectural Search (NAS) have achieved state-of-the-art performances in applications such as image classification and language modeling. However, these techniques typically ignore device-related objectives such as inference time, memory usage, and power consumption. Optimizing neural architecture for device-related objectives is immensely crucial for deploying deep networks on portable devices with limited computing resources. We propose DPP-Net: Device-aware Progressive Search for Pareto-optimal Neural Architectures, optimizing for both device-related (e.g., inference time and memory usage) and device-agnostic (e.g., accuracy and model size) objectives. DPP-Net employs a compact search space inspired by current state-of-the-art mobile CNNs, and further improves search efficiency by adopting progressive search (Liu et al. 2017). Experimental results on CIFAR-10 are poised to demonstrate the effectiveness of Pareto-optimal networks found by DPP-Net, for three different devices: (1) a workstation with Titan X GPU, (2) NVIDIA Jetson TX1 embedded system, and (3) mobile phone with ARM Cortex-A53. Compared to CondenseNet and NASNet (Mobile), DPP-Net achieves better performances: higher accuracy and shorter inference time on various devices. Additional experimental results show that models found by DPP-Net also achieve considerably-good performance on ImageNet as well.

cs.CV↗

Thoracic Disease Identification and Localization with Limited Supervision

Accurate identification and localization of abnormalities from radiology images play an integral part in clinical diagnosis and treatment planning. Building a highly accurate prediction model for these tasks usually requires a large number of images manually annotated with labels and finding sites of abnormalities. In reality, however, such annotated data are expensive to acquire, especially the ones with location annotations. We need methods that can work well with only a small amount of location annotations. To address this challenge, we present a unified approach that simultaneously performs disease identification and localization through the same underlying model for all images. We demonstrate that our approach can effectively leverage both class information as well as limited location annotation, and significantly outperforms the comparative reference baseline in both classification and localization tasks.

cs.CV↗

Adaptive Importance Learning for Improving Lightweight Image Super-resolution Network

Deep neural networks have achieved remarkable success in single image super-resolution (SISR). The computing and memory requirements of these methods have hindered their application to broad classes of real devices with limited computing power, however. One approach to this problem has been lightweight network architectures that bal- ance the super-resolution performance and the computation burden. In this study, we revisit this problem from an orthog- onal view, and propose a novel learning strategy to maxi- mize the pixel-wise fitting capacity of a given lightweight network architecture. Considering that the initial capacity of the lightweight network is very limited, we present an adaptive importance learning scheme for SISR that trains the network with an easy-to-complex paradigm by dynam- ically updating the importance of image pixels on the basis of the training loss. Specifically, we formulate the network training and the importance learning into a joint optimization problem. With a carefully designed importance penalty function, the importance of individual pixels can be gradu- ally increased through solving a convex optimization problem. The training process thus begins with pixels that are easy to reconstruct, and gradually proceeds to more complex pixels as fitting improves.

cs.CV↗

Exploring the Node Importance Based on von Neumann Entropy

When analyzing the statistical and topological characteristics of complex networks, an effective and convenient way is to compute the centralities for recognizing influential and significant nodes or structures, yet most of them are restricted to local environment or some specific configurations. In this paper we propose a new centrality for nodes based on the von Neumann entropy, which allows us to investigate the importance of nodes in the view of spectrum eigenvalues distribution. By presenting the performances of this centrality with network examples in reality, it is shown that the von Neumann entropy node centrality is an excellent index for selecting crucial nodes as well as classical ones. Then to lower down the computational complexity, an approximation calculation to this centrality is given which only depends on its first and second neighbors. Furthermore, in the optimal spreader problem and reducing average clustering coefficients, this entropy centrality presents excellent efficiency and unveil topological structure features of networks accurately. The entropy centrality could reduce the scales of giant connected components fastly in Erdos-Renyi and scale-free networks, and break down the cluster structures efficiently in random geometric graphs. This new methodology reveals the node importance in the perspective of spectrum, which provides a new insight into networks research and performs great potentials to discover essential structural features in networks.

cs.SI↗

Image Registration Based Flicker Solving in Video Face Replacement and Analysis Based Sub-pixel Image Registration

In this paper, a framework of video face replacement is proposed and it deals with the flicker of swapped face in video sequence. This framework contains two main innovations: 1) the technique of image registration is exploited to align the source and target video faces for eliminating the flicker or jitter of the segmented video face sequence; 2) a fast subpixel image registration method is proposed for farther accuracy and efficiency. Unlike the priori works, it minimizes the overlapping region and takes spatiotemporal coherence into account. Flicker in resulted videos is usually caused by the frequently changed bound of the blending target face and unregistered faces between and along video sequences. The subpixel image registration method is proposed to solve the flicker problem. During the alignment process, integer pixel registration is formulated by maximizing the similarity of images with down sampling strategy speeding up the process and sub-pixel image registration is a single-step image match via analytic method. Experimental results show the proposed algorithm reduces the computation time and gets a high accuracy when conducting experiments on different data sets.

cs.CV↗

Locating All Real Solutions of Power Flow Equations: A Convex Optimization Based Method

This paper proposes a convex optimization based method that either locates all real roots of a set of power flow equations or declares no real solution exists in the given area. In the proposed method, solving the power flow equations is reformulated as a global optimization problem (GPF for short) that minimizes the sum of slack variables. All the global minima of GPF with a zero objective value have a one-to-one correspondence to the real roots of power flow equations. By solving a relaxed version of GPF over a hypercube, if the optimal value is strictly positive, there is no solution in this area and the hypercube is discarded. Otherwise the hypercube is further divided into smaller ones. This procedure repeats recursively until all the real roots are located in small enough hypercubes through the successive refinement of the feasible region embedded in a bisection paradigm. This method is desired in a number of power system security assessment applications, for instance, the transient stability analysis as well as voltage stability analysis, where the closest unstable equilibrium and all Type-I unstable equilibrium is required, respectively. The effectiveness of the proposed method is verified by analyzing several test systems.

math.OC↗

Stabilization of self-mode-locked quantum dash lasers by symmetric dual-loop optical feedback

We report experimental studies of the influence of symmetric dual-loop optical feedback on the RF linewidth and timing jitter of self-mode-locked two-section quantum dash lasers emitting at 1550 nm. Various feedback schemes were investigated and optimum levels determined for narrowest RF linewidth and low timing jitter, for single-loop and symmetric dual-loop feedback. Two symmetric dual-loop configurations, with balanced and unbalanced feedback ratios, were studied. We demonstrate that unbalanced symmetric dual loop feedback, with the inner cavity resonant and fine delay tuning of the outer loop, gives narrowest RF linewidth and reduced timing jitter over a wide range of delay, unlike single and balanced symmetric dual-loop configurations. This configuration with feedback lengths 80 and 140 m narrows the RF linewidth by 4-67x and 10-100x, respectively, across the widest delay range, compared to free-running. For symmetric dual-loop feedback, the influence of different power split ratios through the feedback loops was determined. Our results show that symmetric dual-loop feedback is markedly more effective than single-loop feedback in reducing RF linewidth and timing jitter, and is much less sensitive to delay phase, making this technique ideal for applications where robustness and alignment tolerance are essential.

physics.ins-det↗

Molecular Computing for Markov Chains

In this paper, it is presented a methodology for implementing arbitrarily constructed time-homogenous Markov chains with biochemical systems. Not only discrete but also continuous-time Markov chains are allowed to be computed. By employing chemical reaction networks (CRNs) as a programmable language, molecular concentrations serve to denote both input and output values. One reaction network is elaborately designed for each chain. The evolution of species' concentrations over time well matches the transient solutions of the target continuous-time Markov chain, while equilibrium concentrations can indicate the steady state probabilities. Additionally, second-order Markov chains are considered for implementation, with bimolecular reactions rather that unary ones. An original scheme is put forward to compile unimolecular systems to DNA strand displacement reactions for the sake of future physical implementations. Deterministic, stochastic and DNA simulations are provided to enhance correctness, validity and feasibility.

q-bio.MN↗

Optimal Stabilization of Boolean Networks through Collective Influence

The stability of Boolean networks has attracted much attention due to its wide applications in describing the dynamics of biological systems. During the past decades, much effort has been invested in unveiling how network structure and update rules will affect the stability of Boolean networks. In this paper, we aim to identify and control a minimal set of influential nodes that is capable of stabilizing an unstable Boolean network. By minimizing the largest eigenvalue of a modified non-backtracking matrix, we propose a method using the collective influence theory to identify the influential nodes in Boolean networks with high computational efficiency. We test the performance of collective influence on four different networks. Results show that the collective influence algorithm can stabilize each network with a smaller set of nodes than other heuristic algorithms. Our work provides a new insight into the mechanism that determines the stability of Boolean networks, which may find applications in identifying the virulence genes that lead to serious disease.

physics.soc-ph↗

Phase Conductor on Multi-layered Attentions for Machine Comprehension

Attention models have been intensively studied to improve NLP tasks such as machine comprehension via both question-aware passage attention model and self-matching attention model. Our research proposes phase conductor (PhaseCond) for attention models in two meaningful ways. First, PhaseCond, an architecture of multi-layered attention models, consists of multiple phases each implementing a stack of attention layers producing passage representations and a stack of inner or outer fusion layers regulating the information flow. Second, we extend and improve the dot-product attention function for PhaseCond by simultaneously encoding multiple question and passage embedding layers from different perspectives. We demonstrate the effectiveness of our proposed model PhaseCond on the SQuAD dataset, showing that our model significantly outperforms both state-of-the-art single-layered and multiple-layered attention models. We deepen our results with new findings via both detailed qualitative analysis and visualized examples showing the dynamic changes through multi-layered attention models.

cs.CL↗

Searching for the doubly-charged Higgs bosons in the Georgi-Machacek model at the electron-proton colliders

The Georgi-Machacek model is one of many beyond Standard Model scenarios with an extended scalar sector which can group under the custodial $\rm SU(2)_C$ symmetry. There are 5-plet, 3-plet and singlet Higgs bosons under the classification of such symmetry in addition to the Standard Model Higgs boson. In this paper, we study the prospects for detecting the doubly-charged Higgs boson ($\rm H_5^{\pm\pm}$) through the vector boson fusion production at the electron-proton (ep) colliders. We concentrate on our analysis through $μ$-lepton pair production via pair of same-sign W bosons decay. The $\rm H_5^{\pm\pm}$ discovery potentials at the ep colliders are presented.

hep-ph↗

Small-signal model for 2D-material based field-effect transistors targeting radio-frequency applications: the importance of considering non-reciprocal capacitances

A small-signal equivalent circuit of 2D-material based field-effect transistors is presented. Charge conservation and non-reciprocal capacitances have been assumed so the model can be used to make reliable predictions at both device and circuit levels. In this context, explicit and exact analytical expressions of the main radio-frequency figures of merit of these devices are given. Moreover, a direct parameter extraction methodology is provided based on S-parameter measurements. In addition to the intrinsic capacitances, transconductance and output conductance, our approach allows extracting the series combination of drain/source metal contact and access resistances. Accounting for these extrinsic resistances is of upmost importance when dealing with low dimensional field-effect transistors.

cond-mat.mes-hall↗