SearcharxivSearch

arXiv subjects

Liang Cai

Publications and source records attributed to Liang Cai.

13 recordsLinked to original sources

AnchorFormer: Differentiable Anchor Attention for Efficient Vision Transformer

Recently, vision transformers (ViTs) have achieved excellent performance on vision tasks by measuring the global self-attention among the image patches. Given $n$ patches, they will have quadratic complexity such as $\mathcal{O}(n^2)$ and the time cost is high when splitting the input image with a small granularity. Meanwhile, the pivotal information is often randomly gathered in a few regions of an input image, some tokens may not be helpful for the downstream tasks. To handle this problem, we introduce an anchor-based efficient vision transformer (AnchorFormer), which employs the anchor tokens to learn the pivotal information and accelerate the inference. Firstly, by estimating the bipartite attention between the anchors and tokens, the complexity will be reduced from $\mathcal{O}(n^2)$ to $\mathcal{O}(mn)$, where $m$ is an anchor number and $m < n$. Notably, by representing the anchors with the neurons in a neural layer, we can differentiably learn these anchors and approximate global self-attention through the Markov process. It avoids the burden caused by non-differentiable operations and further speeds up the approximate attention. Moreover, we extend the proposed model to three downstream tasks including classification, detection, and segmentation. Extensive experiments show the effectiveness of our AnchorFormer, e.g., achieving up to a 9.0% higher accuracy or 46.7% FLOPs reduction on ImageNet classification, 81.3% higher mAP on COCO detection under comparable FLOPs, as compared to the current baselines.

cs.CV

SourceP: Detecting Ponzi Schemes on Ethereum with Source Code

As blockchain technology becomes more and more popular, a typical financial scam, the Ponzi scheme, has also emerged in the blockchain platform Ethereum. This Ponzi scheme deployed through smart contracts, also known as the smart Ponzi scheme, has caused a lot of economic losses and negative impacts. Existing methods for detecting smart Ponzi schemes on Ethereum mainly rely on bytecode features, opcode features, account features, and transaction behavior features of smart contracts, which are unable to truly characterize the behavioral features of Ponzi schemes, and thus generally perform poorly in terms of detection accuracy and false alarm rates. In this paper, we propose SourceP, a method to detect smart Ponzi schemes on the Ethereum platform using pre-trained models and data flow, which only requires using the source code of smart contracts as features. SourceP reduces the difficulty of data acquisition and feature extraction of existing detection methods. Specifically, we first convert the source code of a smart contract into a data flow graph and then introduce a pre-trained model based on learning code representations to build a classification model to identify Ponzi schemes in smart contracts. The experimental results show that SourceP achieves 87.2% recall and 90.7% F-score for detecting smart Ponzi schemes within Ethereum's smart contract dataset, outperforming state-of-the-art methods in terms of performance and sustainability. We also demonstrate through additional experiments that pre-trained models and data flow play an important contribution to SourceP, as well as proving that SourceP has a good generalization ability.

cs.SE

Fourier Diffusion Models: A Method to Control MTF and NPS in Score-Based Stochastic Image Generation

Score-based stochastic denoising models have recently been demonstrated as powerful machine learning tools for conditional and unconditional image generation. The existing methods are based on a forward stochastic process wherein the training images are scaled to zero over time and white noise is gradually added such that the final time step is approximately zero-mean identity-covariance Gaussian noise. A neural network is then trained to approximate the time-dependent score function, or the gradient of the logarithm of the probability density, for that time step. Using this score estimator, it is possible to run an approximation of the time-reversed stochastic process to sample new images from the training data distribution. These score-based generative models have been shown to out-perform generative adversarial neural networks using standard benchmarks and metrics. However, one issue with this approach is that it requires a large number of forward passes of the neural network. Additionally, the images at intermediate time steps are not useful, since the signal-to-noise ratio is low. In this work we present a new method called Fourier Diffusion Models which replaces the scalar operations of the forward process with shift-invariant convolutions and the additive white noise with additive stationary noise. This allows for control of MTF and NPS at intermediate time steps. Additionally, the forward process can be crafted to converge to the same MTF and NPS as the measured images. This way, we can model continuous probability flow from true images to measurements. In this way, the sample time can be used to control the tradeoffs between measurement uncertainty and generative uncertainty of posterior estimates. We compare Fourier diffusion models to existing scalar diffusion models and show that they achieve a higher level of performance and allow for a smaller number of time steps.

physics.med-ph

Phalanx: A Practical Byzantine Ordered Consensus Protocol

Byzantine fault tolerance (BFT) consensus is a fundamental primitive for distributed computation. However, BFT protocols suffer from the ordering manipulation, in which an adversary can make front-running. Several protocols are proposed to resolve the manipulation problem, but there are some limitations for them. The batch-based protocols such as Themis has significant performance loss because of the use of complex algorithms to find strongly connected components (SCCs). The timestamp-based protocols such as Pompe have simplified the ordering phase, but they are limited on fairness that the adversary can manipulate the ordering via timestamps of transactions. In this paper, we propose a Byzantine ordered consensus protocol called Phalanx, in which transactions are committed by anchor-based ordering strategy. The anchor-based strategy makes aggregation of the Lamport logical clock of transactions on each participant and generates the final ordering without complex detection for SCCs. Therefore, Phalanx has achieved satisfying performance and performs better in resisting ordering manipulation than timestamp-based strategy.

cs.DC

Divergence Behavior of Thermodynamic Curvature Scalar at Critical Point in the Extended Phase Space of Generic Black Holes

The $P$-$V$ phase transition and critical behavior in the extended phase space of asymptotic Anti-de Sitter (AdS) black holes have been widely investigated, in which four critical exponents around critical point are found to be consistent with values in the mean field theory. Recently, another critical exponent $ν$ related to divergent correlation length at critical point is proposed by using thermodynamic curvature scalar $R_N$ in the charged AdS black hole. In this paper, we develop a method to investigate the divergent behavior of $R_N$ at critical point, and find that the divergent behavior of $R_N$ around the critical point expresses a universal property in generic black holes. We further directly apply this method to investigate black holes in de Rham-Gabadadze-Tolley (dRGT) massive gravity to check this universality. Those results shed new lights on the microscopic properties of black holes.

gr-qc

Quantum Uncertainty Based on Metric Adjusted Skew Information

Prompted by the open questions in Gibilisco [Int. J. Software Informatics, 8(3-4): 265, 2014], in which he introduced a family of measurement-induced quantum uncertainty measures via metric adjusted skew informations, we investigate these measures' fundamental properties (including basis independence and spectral representation), and illustrate their applications to detect quantum nonlocality and entanglement.

quant-ph

Mining Sandboxes for Linux Containers

A container is a group of processes isolated from other groups via distinct kernel namespaces and resource allocation quota. Attacks against containers often leverage kernel exploits through system call interface. In this paper, we present an approach that mines sandboxes for containers. We first explore the behaviors of a container by leveraging automatic testing, and extract the set of system calls accessed during testing. The set of system calls then results as a sandbox of the container. The mined sandbox restricts the container's access to system calls which are not seen during testing and thus reduces the attack surface. In the experiment, our approach requires less than eleven minutes to mine sandbox for each of the containers. The enforcement of mined sandboxes does not impact the regular functionality of a container and incurs low performance overhead.

cs.CR

Quantized photonic spin Hall effect in graphene

We examine the photonic spin Hall effect (SHE) in a graphene-substrate system with the presence of external magnetic field. In the quantum Hall regime, we demonstrate that the in-plane and transverse spin-dependent splittings in photonic SHE exhibit different quantized behaviors. The quantized SHE can be described as a consequence of a quantized geometric phase (Berry phase), which corresponds to the quantized spin-orbit interaction. Furthermore, an experimental scheme based on quantum weak value amplification is proposed to detect the quantized SHE in terahertz frequency regime. By incorporating the quantum weak measurement techniques, the quantized photonic SHE holds great promise for detecting quantized Hall conductivity and Berry phase. These results may bridge the gap between the electronic SHE and photonic SHE in graphene.

physics.optics

Strong spin-orbit interaction of light on the surface of atomically thin crystals

The photonic spin Hall effect (SHE) can be regarded as a direct optical analogy of the SHE in electronic systems where a refractive index gradient plays the role of electric potential. However, it has been demonstrated that the effective refractive index fails to adequately explain the lightmatter interaction in atomically thin crystals. In this paper, we examine the spin-orbit interaction on the surface of the freestanding atomically thin crystals. We find that it is not necessary to involve the effective refractive index to describe the spin-orbit interaction and the photonic SHE in the atomically thin crystals. The strong spin-orbit interaction and giant photonic SHE have been predicted, which can be explained as the large polarization rotation of plane-wave components in order to satisfy the transversality of photon.

physics.optics

Observation of the Goos-Hänchen shift in graphene via weak measurements

We report the observation of the Goos-Hänchen effect in graphene via a weak value amplification scheme. We demonstrate that the amplified Goos-Hänchen shift in weak measurements is sensitive to the variation of graphene layers. Combining the Goos-Hänchen effect with weak measurements may provide important applications in characterizing the parameters of graphene.

physics.optics

A Probabilistic Characterization of g-Harmonic Functions

This paper gives a definition of g-harmonic functions and shows the relation between the g-harmonic functions and g-martingales. It's direct to construct such relation under smooth case, but for continuous case we need the theory of viscosity solution. The results show that under the nonlinear expectation mechanism, we also can get the similar relation between harmonic functions and martingales. Finally, we will give a result about the strict converse problem of mean value property of g-harmonic functions.

math.PR

Metric adjusted skew information: Convexity and restricted forms of superadditivity

We give a truly elementary proof of the convexity of metric adjusted skew information following an idea of Effros. We extend earlier results of weak forms of superadditivity to general metric adjusted skew informations. Recently, Luo and Zhang introduced the notion of semi-quantum states on a bipartite system and proved superadditivity of the Wigner-Yanase-Dyson skew informations for such states. We extend this result to general metric adjusted skew informations. We finally show that a recently introduced extension to parameter values $ 1<p\le 2 $ of the WYD-information is a special case of (unbounded) metric adjusted skew information.

math-ph

Inequalities for quantum skew information

We study quantum information inequalities and show that the basic inequality between the quantum variance and the metric adjusted skew information generates all the multi-operator matrix inequalities or Robertson type determinant inequalities studied by a number of authors. We introduce an order relation on the set of functions representing quantum Fisher information that renders the set into a lattice with an involution. This order structure generates new inequalities for the metric adjusted skew informations. In particular, the Wigner-Yanase skew information is the maximal skew information with respect to this order structure in the set of Wigner-Yanase-Dyson skew informations. Key words and phrases: Quantum covariance, metric adjusted skew information, Robertson-type uncertainty principle, operator monotone function, Wigner-Yanase-Dyson skew information.

math-ph