Search results for "Crete"
showing 10 items of 2495 documents
Editorial: The Role of the Muscle Secretome in Health and Disease
2020
myokines, exercise, muscle-derived secreted factors, circulating miRNA, extracellular vesicles
Importance sampling for Lambda-coalescents in the infinitely many sites model
2011
We present and discuss new importance sampling schemes for the approximate computation of the sample probability of observed genetic types in the infinitely many sites model from population genetics. More specifically, we extend the 'classical framework', where genealogies are assumed to be governed by Kingman's coalescent, to the more general class of Lambda-coalescents and develop further Hobolth et. al.'s (2008) idea of deriving importance sampling schemes based on 'compressed genetrees'. The resulting schemes extend earlier work by Griffiths and Tavar\'e (1994), Stephens and Donnelly (2000), Birkner and Blath (2008) and Hobolth et. al. (2008). We conclude with a performance comparison o…
The expressive power of the shuffle product
2010
International audience; There is an increasing interest in the shuffle product on formal languages, mainly because it is a standard tool for modeling process algebras. It still remains a mysterious operation on regular languages.Antonio Restivo proposed as a challenge to characterize the smallest class of languages containing the singletons and closed under Boolean operations, product and shuffle. This problem is still widely open, but we present some partial results on it. We also study some other smaller classes, including the smallest class containing the languages composed of a single word of length 2 which is closed under Boolean operations and shuffle by a letter (resp. shuffle by a l…
On a class of languages with holonomic generating functions
2017
We define a class of languages (RCM) obtained by considering Regular languages, linear Constraints on the number of occurrences of symbols and Morphisms. The class RCM presents some interesting closure properties, and contains languages with holonomic generating functions. As a matter of fact, RCM is related to one-way 1-reversal bounded k-counter machines and also to Parikh automata on letters. Indeed, RCM is contained in L-NFCM but not in L-DFCM, and strictly includes L-CPA. We conjecture that L-DFCM subset of RCM
Unitary units and skew elements in group algebras
2003
Let FG be the group algebra of a group G over a field F and let * denote the canonical involution of FG induced by the map g→g −1 ,gG. Let Un(FG)={uFG|uu * =1} be the group of unitary units of FG. In case char F=0, we classify the torsion groups G for which Un(FG) satisfies a group identity not vanishing on 2-elements. Along the way we actually prove that, in characteristic 0, the unitary group Un(FG) does not contain a free group of rank 2 if FG − , the Lie algebra of skew elements of FG, is Lie nilpotent. Motivated by this connection we characterize most groups G for which FG − is Lie nilpotent and char F≠2.
Polynomials generated by linear operators
2004
We study the class of Banach algebra-valued n n -homogeneous polynomials generated by the n t h n^{th} powers of linear operators. We compare it with the finite type polynomials. We introduce a topology w E F w_{EF} on E , E, similar to the weak topology, to clarify the features of these polynomials.
On an Inequality for Trigonometric Polynomials In Several Variables
1990
Publisher Summary This chapter presents trigonometric polynomials in n variables. Using the methods of approximation theory, an inequality can be extended to almost periodic functions and to still more general classes of functions as in the case for Bohr's inequality. However, no analogous result exists in the case of two variables. For the solution of problems containing small divisors, the estimate has to be completed by theorems concerning the best approximation of holomorphic functions by trigonometric polynomials in polystrips. The chapter also presents equations to provide an estimate for a differential operator.
Complex Numbers and Polynomials
2016
As mentioned in Chap. 1, for a given set and an operator applied to its elements, if the result of the operation is still an element of the set regardless of the input of the operator, then the set is said closed with respect to that operator.
Maximum weight relaxed cliques and Russian Doll Search revisited
2015
Trukhanov et al. [Trukhanov S, Balasubramaniam C, Balasundaram B, Butenko S (2013) Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations. Comp. Opt. and Appl., 56(1), 113–130] used the Russian Doll Search (RDS) principle to effectively find maximum hereditary structures in graphs. Prominent examples of such hereditary structures are cliques and some clique relaxations intensely discussed and studied in network analysis. The effectiveness of the tailored RDS by Trukhanov et al. for s-plex and s-defective clique can be attributed to their cleverly designed incremental verification procedures used to distinguish feasible from infeasible struct…
On the chromatic number of disk graphs
1998
Colorings of disk graphs arise in the study of the frequency-assignment problem in broadcast networks. Motivated by the observations that the chromatic number of graphs modeling real networks hardly exceeds their clique number, we examine the related properties of the unit disk (UD) graphs and their different generalizations. For all these graphs including the most general class of the double disk (DD) graphs, it is shown that X(G) ≤ c.ω(G) for a constant c. Several coloring algorithms are analyzed for disk graphs, aiming to improve the bounds on X(G). We find that their worst-case performance expressed in the number of used colors is indeed reached in some instances.