arXiv subjects

Jie Shen

Publications and source records attributed to Jie Shen.

At least 163 records · Page 9Linked to original sources

arXiv2021

Ponzi Scheme Detection in EthereumTransaction Network

With the rapid growth of blockchain, an increasing number of users have been attracted and many implementations have been refreshed in different fields. Especially in the cryptocurrency investment field, blockchain technology has shown vigorous vitality. However, along with the rise of online business, numerous fraudulent activities, e.g., money laundering, bribery, phishing, and others, emerge as the main threat to trading security. Due to the openness of Ethereum, researchers can easily access Ethereum transaction records and smart contracts, which brings unprecedented opportunities for Ethereum scams detection and analysis. This paper mainly focuses on the Ponzi scheme, a typical fraud, which has caused large property damage to the users in Ethereum. By verifying Ponzi contracts to maintain Ethereum's sustainable development, we model Ponzi scheme identification and detection as a node classification task. In this paper, we first collect target contracts' transactions to establish transaction networks and propose a detecting model based on graph convolutional network (GCN) to precisely distinguishPonzi contracts. Experiments on different real-world Ethereum datasets demonstrate that our proposed model has promising results compared with general machine learning methods to detect Ponzi schemes.

cs.CR↗

arXiv2021

Identity Inference on Blockchain using Graph Neural Network

The anonymity of blockchain has accelerated the growth of illegal activities and criminal behaviors on cryptocurrency platforms. Although decentralization is one of the typical characteristics of blockchain, we urgently call for effective regulation to detect these illegal behaviors to ensure the safety and stability of user transactions. Identity inference, which aims to make a preliminary inference about account identity, plays a significant role in blockchain security. As a common tool, graph mining technique can effectively represent the interactive information between accounts and be used for identity inference. However, existing methods cannot balance scalability and end-to-end architecture, resulting high computational consumption and weak feature representation. In this paper, we present a novel approach to analyze user's behavior from the perspective of the transaction subgraph, which naturally transforms the identity inference task into a graph classification pattern and effectively avoids computation in large-scale graph. Furthermore, we propose a generic end-to-end graph neural network model, named $\text{I}^2 \text{BGNN}$, which can accept subgraph as input and learn a function mapping the transaction subgraph pattern to account identity, achieving de-anonymization. Extensive experiments on EOSG and ETHG datasets demonstrate that the proposed method achieve the state-of-the-art performance in identity inference.

cs.SI↗

arXiv2021

M-Evolve: Structural-Mapping-Based Data Augmentation for Graph Classification

Graph classification, which aims to identify the category labels of graphs, plays a significant role in drug classification, toxicity detection, protein analysis etc. However, the limitation of scale in the benchmark datasets makes it easy for graph classification models to fall into over-fitting and undergeneralization. To improve this, we introduce data augmentation on graphs (i.e. graph augmentation) and present four methods:random mapping, vertex-similarity mapping, motif-random mapping and motif-similarity mapping, to generate more weakly labeled data for small-scale benchmark datasets via heuristic transformation of graph structures. Furthermore, we propose a generic model evolution framework, named M-Evolve, which combines graph augmentation, data filtration and model retraining to optimize pre-trained graph classifiers. Experiments on six benchmark datasets demonstrate that the proposed framework helps existing graph classification models alleviate over-fitting and undergeneralization in the training on small-scale benchmark datasets, which successfully yields an average improvement of 3 - 13% accuracy on graph classification tasks.

cs.LG↗

arXiv2021

Stability and error analysis of IMEX SAV schemes for the magneto-hydrodynamic equations

We construct and analyze first- and second-order implicit-explicit (IMEX) schemes based on the scalar auxiliary variable (SAV) approach for the magneto-hydrodynamic equations. These schemes are linear, only require solving a sequence of linear differential equations with constant coefficients at each time step, and are unconditionally energy stable. We derive rigorous error estimates for the velocity, pressure and magnetic field of the first-order scheme in the two dimensional case without any condition on the time step. Numerical examples are presented to validate the proposed schemes.

math.NA↗

arXiv2021

Stability and error analysis of a class of high-order IMEX schemes for Navier-stokes equations with periodic boundary conditions

We construct high-order semi-discrete-in-time and fully discrete (with Fourier-Galerkin in space) schemes for the incompressible Navier-Stokes equations with periodic boundary conditions, and carry out corresponding error analysis. The schemes are of implicit-explicit type based on a scalar auxiliary variable (SAV) approach. It is shown that numerical solutions of these schemes are uniformly bounded without any restriction on time step size. These uniform bounds enable us to carry out a rigorous error analysis for the schemes up to fifth-order in a unified form, and derive global error estimates in $l^\infty(0,T;H^1)\cap l^2(0,T;H^2)$ in the two dimensional case as well as local error estimates in $l^\infty(0,T;H^1)\cap l^2(0,T;H^2)$ in the three dimensional case. We also present numerical results confirming our theoretical convergence rates and demonstrating advantages of higher-order schemes for flows with complex structures in the double shear layer problem.

math.NA↗

arXiv2021

Modeling and simulation of nuclear architecture reorganization process using a phase field approach

We develop a special phase field/diffusive interface method to model the nuclear architecture reorganization process. In particular, we use a Lagrange multiplier approach in the phase field model to preserve the specific physical and geometrical constraints for the biological events. We develop several efficient and robust linear and weakly nonlinear schemes for this new model. To validate the model and numerical methods, we present ample numerical simulations which in particular reproduce several processes of nuclear architecture reorganization from the experiment literature.

math.NA↗

arXiv2021

Implicit-explicit BDF $k$ SAV schemes for general dissipative systems and their error analysis

We construct efficient implicit-explicit BDF$k$ scalar auxiliary variable (SAV) schemes for general dissipative systems. We show that these schemes are unconditionally stable, and lead to a uniform bound of the numerical solution in the norm based on the principal linear operator in the energy. Based on this uniform bound, we carry out a rigorous error analysis for the $k$th-order $(k=1,2,3,4,5)$ SAV schemes in a unified form for a class of typical Allen-Cahn type and Cahn-Hilliard type equations. We also present numerical results confirming our theoretical convergence rates.

math.NA↗

arXiv2021

Attribute-Efficient Learning of Halfspaces with Malicious Noise: Near-Optimal Label Complexity and Noise Tolerance

This paper is concerned with computationally efficient learning of homogeneous sparse halfspaces in $\mathbb{R}^d$ under noise. Though recent works have established attribute-efficient learning algorithms under various types of label noise (e.g. bounded noise), it remains an open question when and how $s$-sparse halfspaces can be efficiently learned under the challenging malicious noise model, where an adversary may corrupt both the unlabeled examples and the labels. We answer this question in the affirmative by designing a computationally efficient active learning algorithm with near-optimal label complexity of $\tilde{O}\big({s \log^4 \frac d ε} \big)$ and noise tolerance $η= Ω(ε)$, where $ε\in (0, 1)$ is the target error rate, under the assumption that the distribution over (uncorrupted) unlabeled examples is isotropic log-concave. Our algorithm can be straightforwardly tailored to the passive learning setting, and we show that the sample complexity is $\tilde{O}\big({\frac 1 εs^2 \log^5 d} \big)$ which also enjoys the attribute efficiency. Our main techniques include attribute-efficient paradigms for instance reweighting and for empirical risk minimization, and a new analysis of uniform concentration for unbounded data -- all of them crucially take the structure of the underlying halfspace into account.

stat.ML↗

arXiv2021

Face Mask Extraction in Video Sequence

Inspired by the recent development of deep network-based methods in semantic image segmentation, we introduce an end-to-end trainable model for face mask extraction in video sequence. Comparing to landmark-based sparse face shape representation, our method can produce the segmentation masks of individual facial components, which can better reflect their detailed shape variations. By integrating Convolutional LSTM (ConvLSTM) algorithm with Fully Convolutional Networks (FCN), our new ConvLSTM-FCN model works on a per-sequence basis and takes advantage of the temporal correlation in video clips. In addition, we also propose a novel loss function, called Segmentation Loss, to directly optimise the Intersection over Union (IoU) performances. In practice, to further increase segmentation accuracy, one primary model and two additional models were trained to focus on the face, eyes, and mouth regions, respectively. Our experiment shows the proposed method has achieved a 16.99% relative improvement (from 54.50% to 63.76% mean IoU) over the baseline FCN model on the 300 Videos in the Wild (300VW) dataset.

cs.CV↗

arXiv2021

Dynamic Face Video Segmentation via Reinforcement Learning

For real-time semantic video segmentation, most recent works utilised a dynamic framework with a key scheduler to make online key/non-key decisions. Some works used a fixed key scheduling policy, while others proposed adaptive key scheduling methods based on heuristic strategies, both of which may lead to suboptimal global performance. To overcome this limitation, we model the online key decision process in dynamic video segmentation as a deep reinforcement learning problem and learn an efficient and effective scheduling policy from expert information about decision history and from the process of maximising global return. Moreover, we study the application of dynamic video segmentation on face videos, a field that has not been investigated before. By evaluating on the 300VW dataset, we show that the performance of our reinforcement key scheduler outperforms that of various baselines in terms of both effective key selections and running speed. Further results on the Cityscapes dataset demonstrate that our proposed method can also generalise to other scenarios. To the best of our knowledge, this is the first work to use reinforcement learning for online key-frame decision in dynamic video segmentation, and also the first work on its application on face videos.

cs.CV↗

arXiv2020

Dimensionality-dependent type-II Weyl semimetal state in Mo$_{0.25}$W$_{0.75}$Te$_{2}$

Weyl nodes and Fermi arcs in type-II Weyl semimetals (WSMs) have led to lots of exotic transport phenomena. Recently, Mo$_{0.25}$W$_{0.75}$Te$_{2}$ has been established as a type-II WSM with Weyl points located near Fermi level, which offers an opportunity to study its intriguing band structure by electrical transport measurements. Here, by selecting a special sample with the thickness gradient across two- (2D) and three-dimensional (3D) regime, we show strong evidences that Mo$_{0.25}$W$_{0.75}$Te$_{2}$ is a type-II Weyl semimetal by observing the following two dimensionality-dependent transport features: 1) A chiral-anomaly-induced anisotropic magneto-conductivity enhancement, proportional to the square of in-plane magnetic field (B$_{in}$$^{2}$); 2) An additional quantum oscillation with thickness-dependent phase shift. Our theoretical calculations show that the observed quantum oscillation originates from a Weyl-orbit-like scenario due to the unique band structure of Mo$_{0.25}$W$_{0.75}$Te$_{2}$. The in situ dimensionality-tuned transport experiment offers a new strategy to search for type-II WSMs.

cond-mat.mes-hall↗

arXiv2020

On fully decoupled MSAV schemes for the Cahn-Hilliard-Navier-Stokes model of Two-Phase Incompressible Flows

We construct first- and second-order time discretization schemes for the Cahn-Hilliard-Navier-Stokes system based on the multiple scalar auxiliary variables approach (MSAV) approach for gradient systems and (rotational) pressure-correction for Navier-Stokes equations. These schemes are linear, fully decoupled, unconditionally energy stable, and only require solving a sequence of elliptic equations with constant coefficients at each time step. We carry out a rigorous error analysis for the first-order scheme, establishing optimal convergence rate for all relevant functions in different norms. We also provide numerical experiments to verify our theoretical results.

math.NA↗

arXiv2020

Data Augmentation for Graph Classification

Graph classification, which aims to identify the category labels of graphs, plays a significant role in drug classification, toxicity detection, protein analysis etc. However, the limitation of scale of benchmark datasets makes it easy for graph classification models to fall into over-fitting and undergeneralization. Towards this, we introduce data augmentation on graphs and present two heuristic algorithms: random mapping and motif-similarity mapping, to generate more weakly labeled data for small-scale benchmark datasets via heuristic modification of graph structures. Furthermore, we propose a generic model evolution framework, M-Evolve, which combines graph augmentation, data filtration and model retraining to optimize pre-trained graph classifiers. Experiments conducted on six benchmark datasets demonstrate that M-Evolve helps existing graph classification models alleviate over-fitting when training on small-scale benchmark datasets and yields an average improvement of 3-12% accuracy on graph classification tasks.

cs.SI↗

arXiv2020

Shadow-wall lithography of ballistic superconductor-semiconductor quantum devices

The realization of a topological qubit calls for advanced techniques to readily and reproducibly engineer induced superconductivity in semiconductor nanowires. Here, we introduce an on-chip fabrication paradigm based on shadow walls that offers substantial advances in device quality and reproducibility. It allows for the implementation of novel quantum devices and ultimately topological qubits while eliminating many fabrication steps such as lithography and etching. This is critical to preserve the integrity and homogeneity of the fragile hybrid interfaces. The approach simplifies the reproducible fabrication of devices with a hard induced superconducting gap and ballistic normal-/superconductor junctions. Large gate-tunable supercurrents and high-order multiple Andreev reflections manifest the exceptional coherence of the resulting nanowire Josephson junctions. Our approach enables, in particular, the realization of 3-terminal devices, where zero-bias conductance peaks emerge in a magnetic field concurrently at both boundaries of the one-dimensional hybrids.

cond-mat.mes-hall↗

arXiv2020

Usability of a Robot's Realistic Facial Expressions and Peripherals in Autistic Children's Therapy

Robot-assisted therapy is an emerging form of therapy for autistic children, although designing effective robot behaviors is a challenge for effective implementation of such therapy. A series of usability tests assessed trends in the effectiveness of modelling a robot's facial expressions on realistic facial expressions and of adding peripherals enabling child-led control of emotion learning activities with autistic children. Nineteen autistic children interacted with a small humanoid robot and an adult therapist in several emotion-learning activities that featured realistic facial expressions modelled on either a pre-existing database or live facial mirroring, and that used peripherals (tablets or tangible 'squishies') to enable child-led activities. Both types of realistic facial expressions by the robot were less effective than exaggerated expressions, with the mirroring being unintuitive for children. The tablet was usable but required more feedback and lower latency, while the tactile tangibles were engaging aids.

cs.RO↗

arXiv2020

Unconditionally positivity preserving and energy dissipative schemes for Poisson--Nernst--Planck equations

We develop a set of numerical schemes for the Poisson--Nernst--Planck equations. We prove that our schemes are mass conservative, uniquely solvable and keep positivity unconditionally. Furthermore, the first-order scheme is proven to be unconditionally energy dissipative. These properties hold for various spatial discretizations. Numerical results are presented to validate these properties. Moreover, numerical results indicate that the second-order scheme is also energy dissipative, and both the first- and second-order schemes preserve the maximum principle for cases where the equation satisfies the maximum principle.

math.NA↗

arXiv2020

One-Bit Compressed Sensing via One-Shot Hard Thresholding

This paper concerns the problem of 1-bit compressed sensing, where the goal is to estimate a sparse signal from a few of its binary measurements. We study a non-convex sparsity-constrained program and present a novel and concise analysis that moves away from the widely used notion of Gaussian width. We show that with high probability a simple algorithm is guaranteed to produce an accurate approximation to the normalized signal of interest under the $\ell_2$-metric. On top of that, we establish an ensemble of new results that address norm estimation, support recovery, and model misspecification. On the computational side, it is shown that the non-convex program can be solved via one-step hard thresholding which is dramatically efficient in terms of time complexity and memory footprint. On the statistical side, it is shown that our estimator enjoys a near-optimal error rate under standard conditions. The theoretical results are substantiated by numerical experiments.

cs.LG↗

arXiv2020

Efficient Linear and Unconditionally Energy Stable Schemes for the Modified Phase Field Crystal Equation

In this paper, we construct efficient schemes based on the scalar auxiliary variable (SAV) block-centered finite difference method for the modified phase field crystal (MPFC) equation, which is a sixth-order nonlinear damped wave equation. The schemes are linear, conserve mass and unconditionally dissipate a pseudo energy. We prove rigorously second-order error estimates in both time and space for the phase field variable in discrete norms. We also present some numerical experiments to verify our theoretical results and demonstrate the robustness and accuracy.

math.NA↗