arXiv subjects

Xiaohui Zhang

Publications and source records attributed to Xiaohui Zhang.

At least 109 records · Page 6Linked to original sources

arXiv2019

Topological Coding and Topological Matrices Toward Network Overall Security

A mathematical topology with matrix is a natural representation of a coding relational structure that is found in many fields of the world. Matrices are very important in computation of real applications, s ce matrices are easy saved in computer and run quickly, as well as matrices are convenient to deal with communities of current networks, such as Laplacian matrices, adjacent matrices in graph theory. Motivated from convenient, useful and powerful matrices used in computation and investigation of today's networks, we have introduced Topcode-matrices, which are matrices of order $3\times q$ and differ from popular matrices applied in linear algebra and computer science. Topcode-matrices can use numbers, letters, Chinese characters, sets, graphs, algebraic groups \emph{etc.} as their elements. One important thing is that Topcode-matrices of numbers can derive easily number strings, since number strings are text-based passwords used in information security. Topcode-matrices can be used to describe topological graphic passwords (Topsnut-gpws) used in information security and graph connected properties for solving some problems coming in the investigation of Graph Networks and Graph Neural Networks proposed by GoogleBrain and DeepMind. Our topics, in this article, are: Topsnut-matrices, Topcode-matrices, Hanzi-matrices, adjacency ve-value matrices and pan-Topcode-matrices, and some connections between these Topcode-matrices will be proven. We will discuss algebraic groups obtained from the above matrices, graph groups, graph networking groups and number string groups for encrypting different communities of dynamic networks. The operations and results on our matrices help us to set up our overall security mechanism to protect networks.

cs.IT↗

arXiv2019

Using Chinese Characters To Generate Text-Based Passwords For Information Security

Graphical passwords (GPWs) are in many areas of the current world. Topological graphic passwords (Topsnut-gpws) are a new type of cryptography, and they differ from the existing GPWs. A Topsnut-gpw consists of two parts: one is a topological structure (graph), and one is a set of discrete elements (a graph labelling, or coloring), the topological structure connects these discrete elements together to form an interesting "story". Our idea is to transform Chinese characters into computer and electronic equipments with touch screen by speaking, writing and keyboard for forming Hanzi-graphs and Hanzi-gpws. We will use Hanzigpws to produce text-based passwords (TB-paws). We will introduce flawed graph labellings on disconnected Hanzi-graphs.

cs.IT↗

arXiv2019

On the structure of split regular Hom-Lie Rinehart algebras

The aim of this paper is to study the structures of split regular Hom-Lie Rinehart algebras. Let $(L,A)$ be a split regular Hom-Lie Rinehart algebra. We first show that $L$ is of the form $L=U+\sum_{[γ]\inΓ/\thicksim}I_{[γ]}$ with $U$ a vector space complement in $H$ and $I_{[γ]}$ are well described ideals of $L $ satisfying $I_{[γ]},I_{[δ]}=0$ if $I_{[γ]}\neq I_{[δ]}$. Also, we discuss the weight spaces and decompositions of $A$ and present the relation between the decompositions of $L$ and $A$. Finally, we consider the structures of tight split regular Hom-Lie Rinehart algebras.

math.RA↗

arXiv2019

Derivations and deformations of $δ$-Jordan Lie supertriple systems

Let $T$ be a $δ$-Jordan Lie supertriple system. We first introduce the notions of generalized derivations and representations of $T$ and present some properties. Also, we study the low dimension cohomology and the coboundary operator of $T$, and then we investigate the deformations and Nijenhuis operators of $T$ by choosing some suitable cohomology.

math.RA↗

arXiv2019

Central invariants and enveloping algebras of braided Hom-Lie algebras

Let $(H,α)$ be a monoidal Hom-Hopf algebra and $^{H}_{H}\mathcal{HYD}$ the Hom-Yetter-Drinfeld category over $(H,α)$. Then in this paper, we first introduce the definition of braided Hom-Lie algebras and show that each monoidal Hom-algebra in $^{H}_{H}\mathcal{HYD}$ gives rise to a braided Hom-Lie algebra. Second, we prove that if $(A,β)$ is a sum of two $H$-commutative monoidal Hom-subalgebras, then the commutator Hom-ideal $[A,A]$ of $A$ is nilpotent. Also, we study the central invariant of braided Hom-Lie algebras as a generalization of generalized Lie algebras. Finally, we obtain a construction of the enveloping algebras of braided Hom-Lie algebras and show that the enveloping algebras are $H$-cocommutative Hom-Hopf algerbas.

math.RA↗

arXiv2019

The constructions of 3-Hom-Lie bialgebras

In this paper, we first introduce the notion of a 3-Hom-Lie bialgebra and prove that it is equivalent to a Manin triple of 3-Hom-Lie algebras. Also, we study the $\mathcal{O}$-operator and construct solutions of the 3-Lie classical Hom-Yang-Baxter equation interms of $\mathcal{O}$-operators and 3-Hom-pre-Lie algebras. Finally, we show that a 3-Hom-Lie algebra has a phase space if and only if it is sub-adjacent to a 3-Hom-pre-Lie algebra.

math.RA↗

arXiv2018

Text-based Passwords Generated From Topological Graphic Passwords

Topological graphic passwords (Topsnut-gpws) are one of graph-type passwords, but differ from the existing graphical passwords, since Topsnut-gpws are saved in computer by algebraic matrices. We focus on the transformation between text-based passwords (TB-paws) and Topsnut-gpws in this article. Several methods for generating TB-paws from Topsnut-gpws are introduced; these methods are based on topological structures and graph coloring/labellings, such that authentications must have two steps: one is topological structure authentication, and another is text-based authentication. Four basic topological structure authentications are introduced and many text-based authentications follow Topsnut-gpws. Our methods are based on algebraic, number theory and graph theory, many of them can be transformed into polynomial algorithms. A new type of matrices for describing Topsnut-gpws is created here, and such matrices can produce TB-paws in complex forms and longer bytes. Estimating the space of TB-paws made by Topsnut-gpws is very important for application. We propose to encrypt dynamic networks and try to face: (1) thousands of nodes and links of dynamic networks; (2) large numbers of Topsnut-gpws generated by machines rather than human's hands. As a try, we apply spanning trees of dynamic networks and graphic groups (Topsnut-groups) to approximate the solutions of these two problems. We present some unknown problems in the end of the article for further research.

cs.IT↗

arXiv2018

Cohomology and derivations of BiHom-Lie conformal algebras

In this paper, we introduce the notion of a BiHom-Lie conformal algebra and develop its cohomology theory. Also, we discuss some applications to the study of deformations of regular BiHom-Lie conformal algebras. Finally, we introduce derivations of multiplicative BiHom-Lie conformal algebras and study their properties.

math.RA↗

arXiv2018

The construction of Hom left-symmetric conformal bialgebras

In this paper, we first introduce the notion of Hom-left-symmetric conformal bialgebras and show some nontrivial examples. Also, we present construction methods of matched pairs of Hom-Lie conformal algebras and Hom-left-symmetric conformal algebras. Finally, we prove that a finite Hom-left-symmetric conformal bialgebra is free as a $\mathbb{C}[\partial]$-module is equivalent to a Hom-parakähler Lie conformal algebra. In particular, we investigate the coboundary Hom-left-symmetric conformal bialgebras.

math.RA↗

arXiv2018

Manin triples and quasitriangular structures of Hom-Poisson bialgebras

In this paper, we first introduce the definition of a Hom-Poisson bialgebra and give an equivalent descriptions via the Manin triple of Hom-Poisson algebras. Also we introduce notions of $\mathcal{O}$-operator on a Hom-Poisson algebra, post-Hom-Poisson algebra and quasitriangular Hom-Poisson bialgebra, and present a method to construct post-Hom-Poisson algebras. Finally, we show that a quasitriangular Hom-Poisson bialgebra naturally yields a post-Hom-Poisson algebra.

math.RA↗

arXiv2018

Automated vehicle's behavior decision making using deep reinforcement learning and high-fidelity simulation environment

Automated vehicles are deemed to be the key element for the intelligent transportation system in the future. Many studies have been made to improve the Automated vehicles' ability of environment recognition and vehicle control, while the attention paid to decision making is not enough though the decision algorithms so far are very preliminary. Therefore, a framework of the decision-making training and learning is put forward in this paper. It consists of two parts: the deep reinforcement learning training program and the high-fidelity virtual simulation environment. Then the basic microscopic behavior, car-following, is trained within this framework. In addition, theoretical analysis and experiments were conducted on setting reward function for accelerating training using deep reinforcement learning. The results show that on the premise of driving comfort, the efficiency of the trained Automated vehicle increases 7.9% compared to the classical traffic model, intelligent driver model. Later on, on a more complex three-lane section, we trained the integrated model combines both car-following and lane-changing behavior, the average speed further grows 2.4%. It indicates that our framework is effective for Automated vehicle's decision-making learning.

cs.AI↗

arXiv2017

The construction and deformation of BiHom-Novikov agebras

BiHom-Novikov agebra is a generalized Hom-Novikov algebra endowed with two commuting multiplicative linear maps. The main purpose of this paper is to show that two classes of BiHom-Novikov algebras can be constructed from BiHom-commutative algebras together with derivations and BiHom-Novikov algebras with Rota-Baxter operators, respectively. We show that quadratic BiHom-Novikov algebras are associative algebras and the sub-adjacent BiHom-Lie algebras of BiHom-Novikov algebras are 2-step nilpotent. Moreover, we develop the 1-parameter formal deformation theory of BiHom-Novikov algebras.

math.RA↗

arXiv2017

A New Framework for Determination of Excitatory and Inhibitory Conductances Using Somatic Clamp

The interaction between excitation and inhibition is crucial for brain computation. To understand synaptic mechanisms underlying brain function, it is important to separate excitatory and inhibitory inputs to a target neuron. In the traditional method, after applying somatic current or voltage clamp, the excitatory and inhibitory conductances are determined from the synaptic current-voltage (I-V) relation --- the slope corresponds to the total conductance and the intercept corresponds to the reversal current. Because of the space clamp effect, the measured conductance in general deviates substantially from the local conductance on the dendrite. Therefore, the interpretation of the conductance measured by the traditional method remains to be clarified. In this work, based on the investigation of an idealized ball-and-stick neuron model and a biologically realistic pyramidal neuron model, we first demonstrate both analytically and numerically that the conductance determined by the traditional method has no clear biological interpretation due to the neglect of a nonlinear interaction between the clamp current and the synaptic current across the spatial dendrites. As a consequence, the traditional method can induce an arbitrarily large error of conductance measurement, sometimes even leads to unphysically negative conductance. To circumvent the difficulty of elucidating synaptic impact on neuronal computation using the traditional method, we then propose a framework to determine the effective conductance that reflects directly the functional impact of synaptic inputs on action potential initiation and thereby neuronal information processing. Our framework has been further verified in realistic neuron simulations, thus greatly improves upon the traditional approach by providing a reliable and accurate assessment of the role of synaptic activity in neuronal computation.

q-bio.NC↗

arXiv2017

Determination of Effective Synaptic Conductances Using Somatic Voltage Clamp

The interplay between excitatory and inhibitory neurons imparts rich functions of the brain. To understand the underlying synaptic mechanisms, a fundamental approach is to study the dynamics of excitatory and inhibitory conductances of each neuron. The traditional method of determining conductance employs the synaptic current-voltage (I-V) relation obtained via voltage clamp. Using theoretical analysis, electrophysiological experiments, and realistic simulations, here we demonstrate that the traditional method conceptually fails to measure the conductance due to the neglect of a nonlinear interaction between the clamp current and the synaptic current. Consequently, it incurs substantial measurement error, even giving rise to unphysically negative conductance as observed in experiments. To elucidate synaptic impact on neuronal information processing, we introduce the concept of effective conductance and propose a framework to determine it accurately. Our work suggests re-examination of previous studies involving conductance measurement and provides a reliable approach to assess synaptic influence on neuronal computation.

q-bio.NC↗

arXiv2017

Observations on quasihyperbolic geometry modeled on Banach spaces

In this paper, we continue our study of quasihyperbolic metric in Banach spaces. The main results of the paper present a criterion for smoothness of geodesics of quasihyperbolic type metrics in Banach spaces, under a Dini type condition on the weight function, which improves an earlier result of the two first authors. We also answer to a question posed by the two first authors in an earlier paper with R. Klén, and present results related to the question on smoothness of quasihyperbolic balls.

math.FA↗

arXiv2017

Volume growth of quasihyperbolic balls

The purpose of this paper is to study the notion of the quasihyperbolic volume and to find growth estimates for the quasihyperbolic volume of balls in a domain $G \subset {\mathbb R}^n\,$ in terms of the radii.

math.MG↗

arXiv2017

Acoustic data-driven lexicon learning based on a greedy pronunciation selection framework

Speech recognition systems for irregularly-spelled languages like English normally require hand-written pronunciations. In this paper, we describe a system for automatically obtaining pronunciations of words for which pronunciations are not available, but for which transcribed data exists. Our method integrates information from the letter sequence and from the acoustic evidence. The novel aspect of the problem that we address is the problem of how to prune entries from such a lexicon (since, empirically, lexicons with too many entries do not tend to be good for ASR performance). Experiments on various ASR tasks show that, with the proposed framework, starting with an initial lexicon of several thousand words, we are able to learn a lexicon which performs close to a full expert lexicon in terms of WER performance on test data, and is better than lexicons built using G2P alone or with a pruning criterion based on pronunciation probability.

cs.CL↗

arXiv2016

Pivotal and Ribbon Entwining Datums

Let $(C,A,φ)$ be an entwining structure over $k$. In this paper, we introduce the notions of the pivotal entwined datums and ribbon entwined datums to generalize (co)pivotal Hopf algebras and (co)ribbon Hopf algebras. These notions give necessary and sufficient conditions for the category of entwined modules to be a pivotal category and ribbon category.

math.RA↗