Searcharxiv⌕ Search

arXiv subjects

Yongming Li

Publications and source records attributed to Yongming Li.

At least 55 records · Page 3Linked to original sources

Hybrid Embedded Deep Stacked Sparse Autoencoder with w_LPPD SVM Ensemble

Deep learning is a kind of feature learning method with strong nonliear feature transformation and becomes more and more important in many fields of artificial intelligence. Deep autoencoder is one representative method of the deep learning methods, and can effectively extract abstract the information of datasets. However, it does not consider the complementarity between the deep features and original features during deep feature transformation. Besides, it suffers from small sample problem. In order to solve these problems, a novel deep autoencoder - hybrid feature embedded stacked sparse autoencoder(HESSAE) has been proposed in this paper. HFESAE is capable to learn discriminant deep features with the help of embedding original features to filter weak hidden-layer outputs during training. For the issue that class representation ability of abstract information is limited by small sample problem, a feature fusion strategy has been designed aiming to combining abstract information learned by HFESAE with original feature and obtain hybrid features for feature reduction. The strategy is hybrid feature selection strategy based on L1 regularization followed by an support vector machine(SVM) ensemble model, in which weighted local discriminant preservation projection (w_LPPD), is designed and employed on each base classifier. At the end of this paper, several representative public datasets are used to verify the effectiveness of the proposed algorithm. The experimental results demonstrated that, the proposed feature learning method yields superior performance compared to other existing and state of art feature learning algorithms including some representative deep autoencoder methods.

cs.LG↗

Classification Algorithm of Speech Data of Parkinsons Disease Based on Convolution Sparse Kernel Transfer Learning with Optimal Kernel and Parallel Sample Feature Selection

Labeled speech data from patients with Parkinsons disease (PD) are scarce, and the statistical distributions of training and test data differ significantly in the existing datasets. To solve these problems, dimensional reduction and sample augmentation must be considered. In this paper, a novel PD classification algorithm based on sparse kernel transfer learning combined with a parallel optimization of samples and features is proposed. Sparse transfer learning is used to extract effective structural information of PD speech features from public datasets as source domain data, and the fast ADDM iteration is improved to enhance the information extraction performance. To implement the parallel optimization, the potential relationships between samples and features are considered to obtain high-quality combined features. First, features are extracted from a specific public speech dataset to construct a feature dataset as the source domain. Then, the PD target domain, including the training and test datasets, is encoded by convolution sparse coding, which can extract more in-depth information. Next, parallel optimization is implemented. To further improve the classification performance, a convolution kernel optimization mechanism is designed. Using two representative public datasets and one self-constructed dataset, the experiments compare over thirty relevant algorithms. The results show that when taking the Sakar dataset, MaxLittle dataset and DNSH dataset as target domains, the proposed algorithm achieves obvious improvements in classification accuracy. The study also found large improvements in the algorithms in this paper compared with nontransfer learning approaches, demonstrating that transfer learning is both more effective and has a more acceptable time cost.

cs.LG↗

Two-Phase Object-Based Deep Learning for Multi-temporal SAR Image Change Detection

Change detection is one of the fundamental applications of synthetic aperture radar (SAR) images. However, speckle noise presented in SAR images has a much negative effect on change detection. In this research, a novel two-phase object-based deep learning approach is proposed for multi-temporal SAR image change detection. Compared with traditional methods, the proposed approach brings two main innovations. One is to classify all pixels into three categories rather than two categories: unchanged pixels, changed pixels caused by strong speckle (false changes), and changed pixels formed by real terrain variation (real changes). The other is to group neighboring pixels into segmented into superpixel objects (from pixels) such as to exploit local spatial context. Two phases are designed in the methodology: 1) Generate objects based on the simple linear iterative clustering algorithm, and discriminate these objects into changed and unchanged classes using fuzzy c-means (FCM) clustering and a deep PCANet. The prediction of this Phase is the set of changed and unchanged superpixels. 2) Deep learning on the pixel sets over the changed superpixels only, obtained in the first phase, to discriminate real changes from false changes. SLIC is employed again to achieve new superpixels in the second phase. Low rank and sparse decomposition are applied to these new superpixels to suppress speckle noise significantly. A further clustering step is applied to these new superpixels via FCM. A new PCANet is then trained to classify two kinds of changed superpixels to achieve the final change maps. Numerical experiments demonstrate that, compared with benchmark methods, the proposed approach can distinguish real changes from false changes effectively with significantly reduced false alarm rates, and achieve up to 99.71% change detection accuracy using multi-temporal SAR imagery.

cs.CV↗

Semi-dynamic shortest-path tree algorithms for directed graphs with arbitrary weights

Given a directed graph $G$ with arbitrary real-valued weights, the single source shortest-path problem (SSSP) asks for, given a source $s$ in $G$, finding a shortest path from $s$ to each vertex $v$ in $G$. A classical SSSP algorithm detects a negative cycle of $G$ or constructs a shortest-path tree (SPT) rooted at $s$ in $O(mn)$ time, where $m,n$ are the numbers of edges and vertices in $G$ respectively. In many practical applications, new constraints come from time to time and we need to update the SPT frequently. Given an SPT $T$ of $G$, suppose the weight on a certain edge is modified. We show by rigorous proof that the well-known {\sf Ball-String} algorithm for positively weighted graphs can be adapted to solve the dynamic SPT problem for directed graphs with arbitrary weights. Let $n_0$ be the number of vertices that are affected (i.e., vertices that have different distances from $s$ or different parents in the input and output SPTs) and $m_0$ the number of edges incident to an affected vertex. The adapted algorithms terminate in $O(m_0+n_0 \log n_0)$ time, either detecting a negative cycle (only in the decremental case) or constructing a new SPT $T'$ for the updated graph. We show by an example that the output SPT $T'$ may have more than necessary edge changes to $T$. To remedy this, we give a general method for transforming $T'$ into an SPT with minimal edge changes in time $O(n_0)$ provided that $G$ has no cycles with zero length.

cs.DS↗

Inequivalent Multipartite Coherence Classes and New Coherence Monotones

Quantum coherence has received significant attention in recent years, but its study is mostly conducted in single party settings. In this paper, we generalize important results in multipartite entanglement theory to their counterparts in quantum coherence theory. First, we give a necessary and sufficient condition for when two pure multipartite states are equivalent under local quantum incoherent operations and classical communication (LICC), i.e., two states can be deterministically transformed to each other under LICC operations. Next, we investigate and give the conditions in which such a transformation succeeds only stochastically. Different from entanglement case for two-qubit states, we find that the SLICC equivalence classes are infinite. Moreover, it's possible that there are some classes of states in multipartite entanglement can convert into each other, while, they cannot convert into each other in multipartite coherence. In order to show the difference among SLICC classes, we introduce two coherence monotones: accessible coherence and source coherence, following the logistics given in [\emph{Phys.~Rev.~Lett. 115,~150502 (2015)}]. These coherence monotones have a straightforward operational interpretation, namely, the accessible coherence characterizes the proficiency of a state to generate other states via quantum incoherent operations, while the source coherence characterizes the set of states that can be reached via quantum incoherent operations acting on the given state of interest.

quant-ph↗

Monogamy of $α$th Power Entanglement Measurement in Qubit Systems

In this paper, we study the $α$th power monogamy properties related to the entanglement measure in bipartite states. The monogamy relations related to the $α$th power of negativity and the Convex- Roof Extended Negativity are obtained for N-qubit states. We also give a tighter bound of hierarchical monogamy inequality for the entanglement of formation. We find that the GHZ state and W state can be used to distinguish the $α$th power the concurrence for $0<α<2$. Furthermore, we compare concurrence with negativity in terms of monogamy property and investigate the difference between them.

quant-ph↗

General Monogamy of Tsallis $q$-Entropy Entanglement in Multiqubit Systems

In this paper, we study the monogamy inequality of Tsallis-q entropy entanglement. We first provide an analytic formula of Tsallis-q entropy entanglement in two-qubit systems for $\frac{5-\sqrt{13}}{2}\leq q\leq\frac{5+\sqrt{13}}{2}.$ The analytic formula of Tsallis-q entropy entanglement in $2\otimes d$ system is also obtained and we show that Tsallis-q entropy entanglement satisfies a set of hierarchical monogamy equalities. Furthermore, we prove the squared Tsallis-q entropy entanglement follows a general inequality in the qubit systems. Based on the monogamy relations, a set of multipartite entanglement indicators is constructed, which can detect all genuine multiqubit entangled states even in the case of $N$-tangle vanishes. Moreover, we study some examples in multipartite higher-dimensional system for the monogamy inequalities.

quant-ph↗

Quantum coherence quantifiers based on the Rényi $α$-relative entropy

The resource theories of quantum coherence attract a lot of attention in recent years. Especially, the monotonicity property plays a crucial role here. In this paper we investigate the monotonicity property for the coherence measures induced by the Rényi $α$-relative entropy which present in [Phys. Rev. A 94, 052336, 2016]. We show that the Rényi $α$-relative entropy of coherence does not in general satisfy the monotonicity requirement under the subselection of measurements condition and it also does not satisfy the extension of monotonicity requirement which presents in [Phys. Rev. A 93, 032136, 2016]. Due to the Rényi $α$-relative entropy of coherence can act as a coherence monotone quantifier, we examine the trade-off relations between coherence and mixedness. Finally, some properties for the single qubit of Rényi $2$-relative entropy of coherence are derived.

quant-ph↗

Coherent-induced state ordering with fixed mixedness

In this paper, we study coherence-induced state ordering with Tsallis relative entropy of coherence, relative entropy of coherence and $l_{1}$ norm of coherence. Firstly, we show that these measures give the same ordering for single-qubit states with a fixed mixedness or a fixed length along the direction $σ_{z}$. Secondly, we consider some special cases of high dimensional states, we show that these measures generate the same ordering for the set of high dimensional pure states if any two states of the set satisfy majorization relation. Moreover, these three measures generate the same ordering for all $X$ states with a fixed mixedness. Finally, we discuss dynamics of coherence-induced state ordering under Markovian channels. We find phase damping channel don't change the coherence-induced state ordering for some single-qubit states with fixed mixedness, instead amplitude damping channel change the coherence-induced ordering even though for single-qubit states with fixed mixedness.

quant-ph↗

Generalised monogamy relation of convex-roof extended negativity in multi-level systems

In this paper, we investigate the generalised monogamy inequalities of convex-roof extended negativity (CREN) in multi-level systems. The generalised monogamy inequalities provide the upper and lower bounds of bipartite entanglement, which are obtained by using CREN and the CREN of assistance (CRENOA). Furthermore, we show that the CREN of multi-qubit pure states satisfies some monogamy relations. Additionally, we test the generalised monogamy inequalities for qudits by considering the partially coherent superposition of a generalised W-class state in a vacuum and show that the generalised monogamy inequalities are satisfied in this case as well.

quant-ph↗

Model-Checking of Linear-Time Properties Based on Possibility Measure

We study the LTL model-checking in possibilistic Kripke structure using possibility measure. First, the notion of possibilistic Kripke structure and the related possibility measure are introduced, then model-checking of reachability and repeated reachability linear-time properties in finite possibilistic Kripke structure are studied. Standard safety property and -regular property in possibilistic Kripke structure are introduced, the verification of regular safety property and -regular property using finite automata are thoroughly studied. It has been shown that the verification of regular safety property and -regular property in finite possibilistic Kripke structure can be transformed into the verification of reachability property and repeated reachability property in the product possibilistic Kripke structure introduced in this paper. Several examples are given to illustrate the methods presented in the paper.

cs.LO↗

Model-Checking of Linear-Time Properties in Multi-Valued Systems

In this paper, we study model-checking of linear-time properties in multi-valued systems. Safety property, invariant property, liveness property, persistence and dual-persistence properties in multi-valued logic systems are introduced. Some algorithms related to the above multi-valued linear-time properties are discussed. The verification of multi-valued regular safety properties and multi-valued $ω$-regular properties using lattice-valued automata are thoroughly studied. Since the law of non-contradiction (i.e., $a\wedge \neg a=0$) and the law of excluded-middle (i.e., $a\vee \neg a=1$) do not hold in multi-valued logic, the linear-time properties introduced in this paper have the new forms compared to those in classical logic. Compared to those classical model checking methods, our methods to multi-valued model checking are more directly accordingly. A new form of multi-valued model checking with membership degree is also introduced. In particular, we show that multi-valued model-checking can be reduced to the classical model checking. The related verification algorithms are also presented. Some illustrative examples and case study are also provided.

cs.LO↗

Entropic characterization of coherence in quantum evolutions

By using relative entropy of coherence, we characterize the coherence gain induced by some quantum evolutions, including the cohering power of unitary operations and the decohering power of quantum operations. We find that the cohering power of the controlled unitary operation can be reduced to the cohering power of the corresponding unitary operation. We observe that the global coherence generated via incoherent operation applied to the system and an incoherent ancilla do not exceed the amount of coherence contained in the initial system. Our result provides a much tighter lower bound of coherence for the initial quantum state, and give an interesting chain of inequalities for coherence, quantum correlation and entanglement. We also strengthen the relations between quantum correlations and coherence.

quant-ph↗

Ordering states of Tsallis relative $α$-entropies of coherence

In this paper, we study the ordering states with Tsallis relative $α$-entropies of coherence and $l_{1}$ norm of coherence for single-qubit states. We show that any Tsallis relative $α$-entropies of coherence and $l_{1}$ norm of coherence give the same ordering for single-qubit pure states. However, they don't generate the same ordering for some high dimensional pure states, even though these states are pure. We also consider three special Tsallis relative $α$-entropies of coherence, such as $C_{1}$ ,$C_{2}$ and $C_{\frac{1}{2}}$, and show any one of these three measures and $C_{l_{1}}$ will not generate the same ordering for single-qubit mixed states. Furthermore, we find that any two of these three special measures generate different ordering for single-qubit mixed states.

quant-ph↗

Fuzzy alternating $\mathrm{B\ddot{u}chi}$ automata over distributive lattices

We give a new version of fuzzy alternating $\mathrm{B\ddot{u}chi}$ automata over distributive lattices: weights are putting in every leaf node of run trees rather than along with edges from every node to its children. Such settings are great benefit to obtain complement just by taking dual operation and replacing each final weight with its complement. We prove that $L$-fuzzy nondeterministic $\mathrm{B\ddot{u}chi}$ automata have the same expressive power as $L$-fuzzy alternating $\mathrm{B\ddot{u}chi}$ ones. A direct construction (without related knowledge about $L$-fuzzy nondeterministic $\mathrm{B\ddot{u}chi}$ ones such as: above equivalence relation and their closure properties) is given to show that the languages recognized by $L$-fuzzy alternating co-$\mathrm{B\ddot{u}chi}$ automata are also $L$-fuzzy $ω$-regular. Furthermore, the closure properties and the discussion about decision problems for fuzzy alternating $\mathrm{B\ddot{u}chi}$ automata are illustrated in our paper.

cs.FL↗

Quantitative Model Checking of Linear-Time Properties Based on Generalized Possibility Measures

Model checking of linear-time properties based on possibility measures was studied in previous work (Y. Li and L. Li, Model checking of linear-time properties based on possibility measure, IEEE Transactions on Fuzzy Systems, 21(5)(2013), 842-854). However, the linear-time properties considered in the previous work was classical and qualitative, possibility information of the systems was not considered at all. We shall study quantitative model checking of fuzzy linear-time properties based on generalized possibility measures in the paper. Both the model of the system, as well as the properties the system needs to adhere to, are described using possibility information to identify the uncertainty in the model/properties. The systems are modeled by {\sl generalized possibilistic Kripke structures} (GPKS, in short), and the properties are described by fuzzy linear-time properties. Concretely, fuzzy linear-time properties about reachability, always reachability, constrain reachability, repeated reachability and persitence in GPKSs are introduced and studied. Fuzzy regular safety properties and fuzzy $ω-$regular properties in GPKSs are introduced, the verification of fuzzy regular safety properties and fuzzy $ω-$regular properties using fuzzy finite automata are thoroughly studied. It has been shown that the verification of fuzzy regular safety properties and fuzzy $ω-$regular properties in a finite GPKS can be transformed into the verification of (always) reachability properties and repeated reachability (persistence) properties in the product GPKS introduced in this paper. Several examples are given to illustrate the methods presented in the paper.

cs.LO↗

Exogenous Quantum Operator Logic Based on Density Operators

Although quantum logic by using exogenous approach has been proposed for reasoning about closed quantum systems, an improvement would be worth to study quantum logic based on density operators instead of unit vectors in the state logic point of view. In order to achieve this, we build an exogenous quantum operator logic(EQOL) based on density operators for reasoning about open quantum systems. We show that this logic is sound and complete. Just as the exogenous quantum propositional logic(EQPL), by applying exogenous approach, EQOL is extended from the classical propositional logic, and is used to describe the state logic based on density operators. As its applications, we confirm the entanglement property about Bell states by reasoning and logical argument, also verify the existence of eavesdropping about the basic BB84 protocol. As a novel type of mathematical formalism for open quantum systems, we introduce an exogenous quantum Markov chain(EQMC) where its quantum states are labelled using EQOL formulae. Then, an example is given to illustrate the termination verification problem of a generalized quantum loop program described using EQMC.

cs.LO↗

Quantum coherence and correlations in quantum system

Criteria of measure quantifying quantum coherence, a unique property of quantum system, are proposed recently. In this paper, we first give an uncertainty-like expression relating the coherence and the entropy of quantum system. This finding allows us to discuss the relations between the entanglement and the coherence. Further, we discuss in detail the relations among the coherence, the discord and the deficit in the bipartite quantum system. We show that, the one-way quantum deficit is equal to the sum between quantum discord and the relative entropy of coherence of measured subsystem.

quant-ph↗