arXiv subjects

Mingxing Zhang

Publications and source records attributed to Mingxing Zhang.

26 records · Page 2Linked to original sources

arXiv2020

HpGAN: Sequence Search with Generative Adversarial Networks

Sequences play an important role in many engineering applications and systems. Searching sequences with desired properties has long been an interesting but also challenging research topic. This article proposes a novel method, called HpGAN, to search desired sequences algorithmically using generative adversarial networks (GAN). HpGAN is based on the idea of zero-sum game to train a generative model, which can generate sequences with characteristics similar to the training sequences. In HpGAN, we design the Hopfield network as an encoder to avoid the limitations of GAN in generating discrete data. Compared with traditional sequence construction by algebraic tools, HpGAN is particularly suitable for intractable problems with complex objectives which prevent mathematical analysis. We demonstrate the search capabilities of HpGAN in two applications: 1) HpGAN successfully found many different mutually orthogonal complementary code sets (MOCCS) and optimal odd-length Z-complementary pairs (OB-ZCPs) which are not part of the training set. In the literature, both MOCSSs and OB-ZCPs have found wide applications in wireless communications. 2) HpGAN found new sequences which achieve four-times increase of signal-to-interference ratio--benchmarked against the well-known Legendre sequence--of a mismatched filter (MMF) estimator in pulse compression radar systems. These sequences outperform those found by AlphaSeq.

cs.LG↗

arXiv2019

LCuts: Linear Clustering of Bacteria using Recursive Graph Cuts

Bacterial biofilm segmentation poses significant challenges due to lack of apparent structure, poor imaging resolution, limited contrast between conterminous cells and high density of cells that overlap. Although there exist bacterial segmentation algorithms in the existing art, they fail to delineate cells in dense biofilms, especially in 3D imaging scenarios in which the cells are growing and subdividing in a complex manner. A graph-based data clustering method, LCuts, is presented with the application on bacterial cell segmentation. By constructing a weighted graph with node features in locations and principal orientations, the proposed method can automatically classify and detect differently oriented aggregations of linear structures (represent by bacteria in the application). The method assists in the assessment of several facets, such as bacterium tracking, cluster growth, and mapping of migration patterns of bacterial biofilms. Quantitative and qualitative measures for 2D data demonstrate the superiority of proposed method over the state of the art. Preliminary 3D results exhibit reliable classification of the cells with 97% accuracy.

eess.IV↗

arXiv2019

A Case for Asymmetric Non-Volatile Memory Architecture

The byte-addressable Non-Volatile Memory (NVM) is a promising technology since it simultaneously provides DRAM-like performance, disk-like capacity, and persistency. The current NVM deployment is symmetric, where NVM devices are directly attached to servers. Due to the higher density, NVM provides larger capacity and can be shared among servers. Unfortunately, in the symmetric setting, the availability of NVM devices is affected by the specific machine it is attached to. High availability can be realized by replicating data to NVM on a remote machine. However, it requires full replication of data structure in local memory, limiting the size of the working set. This paper rethinks NVM deployment and makes a case for the asymmetric NVM architecture, which decouples servers from persistent data storage. In the proposed AsymNVM architecture, NVM devices (back-end nodes) can be shared by multiple servers (front-end nodes) and provide recoverable persistent data structures. The asymmetric architecture is made possible by RDMA, and follows the recent industry trend of resource disaggregation. We build AsymNVM framework based on AsymNVM architecture that implements: 1) high performance persistent data structure update; 2) NVM data management; 3) concurrency control; and 4) crash-consistency and replication. The central idea is to use operation logs to reduce the stall due to RDMA writes and enable efficient batching and caching in front-end nodes. To evaluation performance, we construct eight widely used data structures and two applications based on AsymNVM framework, and use traces of industry workloads. In a cluster with ten machines, the results show that AsymNVM achieves comparable performance to the best possible symmetric architecture while avoiding all the drawbacks with disaggregation. Compared to the baseline AsymNVM, speedup brought by the proposed optimizations is 6~22x.

cs.DC↗

arXiv2018

$\partial$-reducible handle additions

Let $M$ be a simple 3-manifold, and $F$ be a component of $\partial M$ of genus at least 2. Let $α$ and $β$ be separating slopes on $F$. Let $M(α)$ (resp. $M(β)$) be the manifold obtained by adding a 2-handle along $α$ (resp. $β$). If $M(α)$ and $M(β)$ are $\partial$-reducible, then the minimal geometric intersection number of $α$ and $β$ is at most 8.

math.GT↗

arXiv2015

RFP: A Remote Fetching Paradigm for RDMA-Accelerated Systems

Remote Direct Memory Access (RDMA) is an efficient way to improve the performance of traditional client-server systems. Currently, there are two main design paradigms for RDMA-accelerated systems. The first allows the clients to directly operate the server's memory and totally bypasses the CPUs at server side. The second follows the traditional server-reply paradigm, which asks the server to write results back to the clients. However, the first method has to expose server's memory and needs tremendous re-design of upper-layer software, which is complex, unsafe, error-prone, and inefficient. The second cannot achieve high input/output operations per second (IOPS), because it employs out-bound RDMA-write at server side which is not efficient. We find that the performance of out-bound RDMA-write and in-bound RDMA-read is asymmetric and the latter is 5 times faster than the former. Based on this observation, we propose a novel design paradigm named Remote Fetching Paradigm (RFP). In RFP, the server is still responsible for processing requests from the clients. However, counter-intuitively, instead of sending results back to the clients through out-bound RDMA-write, the server only writes the results in local memory buffers, and the clients use in-bound RDMA-read to remotely fetch these results. Since in-bound RDMA-read achieves much higher IOPS than out-bound RDMA-write, our model is able to bring higher performance than the traditional models. In order to prove the effectiveness of RFP, we design and implement an RDMA-accelerated in-memory key-value store following the RFP model. To further improve the IOPS, we propose an optimization mechanism that combines status checking and result fetching. Experiment results show that RFP can improve the IOPS by 160%~310% against state-of-the-art models for in-memory key-value stores.

cs.DC↗

arXiv2008

Additivity of Heegaard genera of bounded surface sums

Let $M$ be a surface sum of 3-manifolds $M_1$ and $M_2$ along a bounded connected surface $F$ and $\partial_i$ be the component of $\partial M_i$ containing $F$. If $M_i$ has a high distance Heegaard splitting, then any minimal Heegaard splitting of $M$ is the amalgamation of those of $M^1, M^2$ and $M^*$, where $M^i=M_i\setminus\partial_i\times I$, and $M^{*}=\partial_1\times I\cup_{F} \partial_2\times I$. Furthermore, once both $\partial_i\setminus F$ are connected, then $g(M) = Min\bigl\{g(M_1)+g(M_2), α\bigr\}$, where $α= g(M_1) + g(M_2) + 1/2(2χ(F) + 2 - χ(\partial_1) - χ(\partial_2)) - Max\bigl\{g(\partial_1), g(\partial_2)\bigl\}$; in particular $g(M)=g(M_1)+g(M_2)$ if and only if $χ(F)\geq 1/2Max\bigl\{χ(\partial_1), χ(\partial_2)\bigr\}.$ The proofs rely on Scharlemann-Tomova's theorem.

math.GT↗

arXiv2007

Boundary reducible handle additions on simple 3-manifolds

Let $M$ be a simple manifold, and $F$ be a component of $\partial M$ of genus two. For a slope $γ$ on $F$, we denote by $M(γ)$ the manifold obtained by attaching a 2-handle to $M$ along a regular neighborhood of $γ$ on $F$. In this paper, we shall prove that there is at most one separating slope $γ$ on $F$ so that $M(γ)$ is $\partial$-reducible.

math.GT↗

arXiv2006

The distance between two separating, reducing slopes is at most 4

Let $M$ be a simple 3-manifold such that one component of $\partial M$, say $F$, has genus at least two. For a slope $α$ on $F$, we denote by $M(α)$ the manifold obtained by attaching a 2-handle to $M$ along a regular neighborhood of $α$ on $F$. If $M(α)$ is reducible, then $α$ is called a reducing slope. In this paper, we shall prove that the distance between two separating, reducing slopes on $F$ is at most 4.

math.GT↗