Search results for "General Mathematics"
showing 10 items of 3795 documents
Predictability decomposition detects the impairment of brain-heart dynamical networks during sleep disorders and their recovery with treatment
2016
This work introduces a framework to study the network formed by the autonomic component of heart rate variability (cardiac process η ) and the amplitude of the different electroencephalographic waves (brain processes δ , θ , α , σ , β ) during sleep. The framework exploits multivariate linear models to decompose the predictability of any given target process into measures of self-, causal and interaction predictability reflecting respectively the information retained in the process and related to its physiological complexity, the information transferred from the other source processes, and the information modified during the transfer according to redundant or synergistic interaction betwee…
A NEW COMPLEXITY FUNCTION FOR WORDS BASED ON PERIODICITY
2013
Motivated by the extension of the critical factorization theorem to infinite words, we study the (local) periodicity function, i.e. the function that, for any position in a word, gives the size of the shortest square centered in that position. We prove that this function characterizes any binary word up to exchange of letters. We then introduce a new complexity function for words (the periodicity complexity) that, for any position in the word, gives the average value of the periodicity function up to that position. The new complexity function is independent from the other commonly used complexity measures as, for instance, the factor complexity. Indeed, whereas any infinite word with bound…
Representable and Continuous Functionals on Banach Quasi *-Algebras
2017
In the study of locally convex quasi *-algebras an important role is played by representable linear functionals; i.e., functionals which allow a GNS-construction. This paper is mainly devoted to the study of the continuity of representable functionals in Banach and Hilbert quasi *-algebras. Some other concepts related to representable functionals (full-representability, *-semisimplicity, etc) are revisited in these special cases. In particular, in the case of Hilbert quasi *-algebras, which are shown to be fully representable, the existence of a 1-1 correspondence between positive, bounded elements (defined in an appropriate way) and continuous representable functionals is proved.
On finite products of totally permutable groups
1996
In this paper the structure of finite groups which are the product of two totally permutable subgroups is studied. In fact we can obtain the -residual, where is a formation, -projectors and -normalisers, where is a saturated formation, of the group from the corresponding subgroups of the factor subgroups.
Relay selection in FDD amplify-and-forward cooperative networks
2017
In this paper, the problems of relay selection and distributed beamforming are investigated for bi-directional dual-hop amplify-and-forward frequency-division duplex cooperative wireless networks. When using individual per-relay maximum transmission power constraint, it has been proven that the relay selection and beamforming optimization problem becomes NP hard and requires exhaustive search to find the optimal solution. Therefore, we propose a computationally affordable sub-optimal multiple relay selection and beamforming optimization scheme based on the l1 norm squared relaxation. The proposed scheme performs the selection for the two transmission directions, simultaneously, while aiming…
Integration of a Dirac comb and the Bernoulli polynomials
2016
Abstract For any positive integer n , we consider the ordinary differential equations of the form y ( n ) = 1 − Ш + F where Ш denotes the Dirac comb distribution and F is a piecewise- C ∞ periodic function with null average integral. We prove the existence and uniqueness of periodic solutions of maximal regularity. Above all, these solutions are given by means of finite explicit formulae involving a minimal number of Bernoulli polynomials. We generalize this approach to a larger class of differential equations for which the computation of periodic solutions is also sharp, finite and effective.
Turán type inequalities for generalized inverse trigonometric functions
2013
In this paper we study the inverse of the eigenfunction $\sin_p$ of the one-dimensional $p$-Laplace operator and its dependence on the parameter $p$, and we present a Tur\'an type inequality for this function. Similar inequalities are given also for other generalized inverse trigonometric and hyperbolic functions. In particular, we deduce a Tur\'an type inequality for a series considered by Ramanujan, involving the digamma function.
Choosing Optimal Seed Nodes in Competitive Contagion.
2019
International audience; In recent years there has been a growing interest in simulating competitive markets to find out the efficient ways to advertise a product or spread an ideology. Along this line, we consider a binary competitive contagion process where two infections, A and B, interact with each other and diffuse simultaneously in a network. We investigate which is the best centrality measure to find out the seed nodes a company should adopt in the presence of rivals so that it can maximize its influence. These nodes can be used as the initial spreaders or advertisers by firms when two firms compete with each other. Each node is assigned a price tag to become an initial advertiser whi…
A Derivation of the Vlasov-Stokes System for Aerosol Flows from the Kinetic Theory of Binary Gas Mixtures
2016
In this short paper, we formally derive the thin spray equation for a steady Stokes gas, i.e. the equation consists in a coupling between a kinetic (Vlasov type) equation for the dispersed phase and a (steady) Stokes equation for the gas. Our starting point is a system of Boltzmann equations for a binary gas mixture. The derivation follows the procedure already outlined in [Bernard-Desvillettes-Golse-Ricci, arXiv:1608.00422 [math.AP]] where the evolution of the gas is governed by the Navier-Stokes equation.
Efficient lower and upper bounds of the diagonal-flip distance between triangulations
2006
There remains today an open problem whether the rotation distance between binary trees or equivalently the diagonal-flip distance between triangulations can be computed in polynomial time. We present an efficient algorithm for computing lower and upper bounds of this distance between a pair of triangulations.