Sensor Scheduling with Intelligent Optimization Algorithm Based on Quantum Theory

The particle swarm optimization (PSO) algorithm superiority exists in convergence rate, but it tends to get stuck in local optima. An improved PSO algorithm is proposed using a best dimension mutation technique based on quantum theory, and it was applied to sensor scheduling problem for target tracking. The dynamics of the target are assumed as linear Gaussian model, and the sensor measurements show a linear correlation with the state of the target. This paper discusses the single target tracking problem with multiple sensors using the proposed best dimension mutation particle swarm optimization (BDMPSO) algorithm for various cases. Our experimental results verify that the proposed algorithm is able to track the target more reliably and accurately than previous ones

Z2Z_2 fractionalized phases of a solvable, disordered, tt-JJ model

We describe the phases of a solvable $t$-$J$ model of electrons with infinite-range, and random, hopping and exchange interactions, similar to those in the Sachdev-Ye-Kitaev models. The electron fractionalizes, as in an `orthogonal metal', into a fermion $f$ which carries both the electron spin and charge, and a boson $\phi$. Both $f$ and $\phi$ carry emergent $\mathbb{Z}_2$ gauge charges. The model has a phase in which the $\phi$ bosons are gapped, and the $f$ fermions are gapless and critical, and so the electron spectral function is gapped. This phase can be considered as a toy model for the underdoped cuprates. The model also has an extended, critical, `quasi-Higgs' phase where both $\phi$ and $f$ are gapless, and the electron operator $\sim f \phi$ has a Fermi liquid-like $1/\tau$ propagator in imaginary time, $\tau$. So while the electron spectral function has a Fermi liquid form, other properties are controlled by $\mathbb{Z}_2$ fractionalization and the anomalous exponents of the $f$ and $\phi$ excitations. This `quasi-Higgs' phase is proposed as a toy model of the overdoped cuprates. We also describe the critical state separating these two phases.Comment: 30 pages, 9 figure

A New High-Speed Foreign Fiber Detection System with Machine Vision

A new high-speed foreign fiber detection system with machine vision is proposed for removing foreign fibers from raw cotton using optimal hardware components and appropriate algorithms designing. Starting from a specialized lens of 3-charged couple device (CCD) camera, the system applied digital signal processor (DSP) and field-programmable gate array (FPGA) on image acquisition and processing illuminated by ultraviolet light, so as to identify transparent objects such as polyethylene and polypropylene fabric from cotton tuft flow by virtue of the fluorescent effect, until all foreign fibers that have been blown away safely by compressed air quality can be achieved. An image segmentation algorithm based on fast wavelet transform is proposed to identify block-like foreign fibers, and an improved canny detector is also developed to segment wire-like foreign fibers from raw cotton. The procedure naturally provides color image segmentation method with region growing algorithm for better adaptability. Experiments on a variety of images show that the proposed algorithms can effectively segment foreign fibers from test images under various circumstances

Numerical study of fermion and boson models with infinite-range random interactions

We present numerical studies of fermion and boson models with random all-to-all interactions (the SYK models). The high temperature expansion and exact diagonalization of the N-site fermion model are used to compute the entropy density: our results are consistent with the numerical solution of N = 1 saddle point equations, and the presence of a non-zero entropy density in the limit of vanishing temperature. The exact diagonalization results for the fermion Green’s function also appear to converge well to the N = 1 solution. For the hard-core boson model, the exact diagonalization study indicates spin glass order. Some results on the entanglement entropy and the out-of-time-order correlators are also presented.Physic

Analyzing Divergence for Nondeterministic Probabilistic Models

Branching and weak probabilistic bisimilarities are two well-known notions capturing behavioral equivalence between nondeterministic probabilistic systems. For probabilistic systems, divergence is of major concern. Recently several divergence-sensitive refinements of branching and weak probabilistic bisimilarities have been proposed in the literature. Both the definitions of these equivalences and the techniques to investigate them differ significantly. This paper presents a comprehensive comparative study on divergence-sensitive behavioral equivalence relations that refine the branching and weak probabilistic bisimilarities. Additionally, these equivalence relations are shown to have efficient checking algorithms. The techniques of this paper might be of independent interest in a more general setting

Ref-NMS: Breaking Proposal Bottlenecks in Two-Stage Referring Expression Grounding

The prevailing framework for solving referring expression grounding is based on a two-stage process: 1) detecting proposals with an object detector and 2) grounding the referent to one of the proposals. Existing two-stage solutions mostly focus on the grounding step, which aims to align the expressions with the proposals. In this paper, we argue that these methods overlook an obvious mismatch between the roles of proposals in the two stages: they generate proposals solely based on the detection confidence (i.e., expression-agnostic), hoping that the proposals contain all right instances in the expression (i.e., expression-aware). Due to this mismatch, current two-stage methods suffer from a severe performance drop between detected and ground-truth proposals. To this end, we propose Ref-NMS, which is the first method to yield expression-aware proposals at the first stage. Ref-NMS regards all nouns in the expression as critical objects, and introduces a lightweight module to predict a score for aligning each box with a critical object. These scores can guide the NMS operation to filter out the boxes irrelevant to the expression, increasing the recall of critical objects, resulting in a significantly improved grounding performance. Since Ref- NMS is agnostic to the grounding step, it can be easily integrated into any state-of-the-art two-stage method. Extensive ablation studies on several backbones, benchmarks, and tasks consistently demonstrate the superiority of Ref-NMS. Codes are available at: https://github.com/ChopinSharp/ref-nms.Comment: Appear in AAAI 2021, Codes are available at: https://github.com/ChopinSharp/ref-nm