Search results for "maximal"
showing 10 items of 239 documents
Postnatal overfeeding in rats leads to moderate overweight and to cardiometabolic and oxidative alterations in adulthood.
2011
In contrast to the masses of data on obesity, few data are available concerning the cardiometabolic and oxidative consequences of moderate overweight. The model of postnatal overfeeding (OF) induces an increase in body weight at weaning that remains during adult life. Litters of Wistar rats were either maintained at 12 pups (normal-fed group, NF), or reduced to 3 pups at birth in order to induce OF. At 6 months of age, metabolic parameters, circulating oxidative stress and aortic and coronary vasoreactivity were assessed. Cardiac susceptibility to ischemia-reperfusion injury was also evaluated ex vivo as were markers of cardiac remodeling. OF led to an increase in body weight at weaning (+5…
In vitro effect of leptin on human cardiac contractility
2019
AbstractLeptin, a hormone produced by adipose tissue, has been linked to many regulatory pathways. Its role in the complex relationship between obesity and CVD is not yet clear. The aim of the present study was to evaluate whether leptin interferes directly with cardiac function regulation, altering its contractile force character, and hence contributing to different pathological processes. Muscle samples were obtained from human atrial myocardium. Each trial included two samples from the same patient. They were simultaneously electrically stimulated under sustained perfusion to perform isometric contractions. One sample was treated with a high concentration of human recombinant leptin (1 µ…
Neighbor-Distinguishing k-tuple Edge-Colorings of Graphs
2009
AbstractThis paper studies proper k-tuple edge-colorings of graphs that distinguish neighboring vertices by their sets of colors. Minimum numbers of colors for such colorings are determined for cycles, complete graphs and complete bipartite graphs. A variation in which the color sets assigned to edges have to form cyclic intervals is also studied and similar results are given.
Relaxation for a Class of Control Systems with Unilateral Constraints
2019
We consider a nonlinear control system involving a maximal monotone map and with a priori feedback. We assume that the control constraint multifunction $U(t,x)$ is nonconvex valued and only lsc in the $x \in \mathbb{R}^{N}$ variable. Using the Q-regularization (in the sense of Cesari) of $U(t,\cdot )$, we introduce a relaxed system. We show that this relaxation process is admissible.
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.
Maximal Closed Substrings
2022
A string is closed if it has length 1 or has a nonempty border without internal occurrences. In this paper we introduce the definition of a maximal closed substring (MCS), which is an occurrence of a closed substring that cannot be extended to the left nor to the right into a longer closed substring. MCSs with exponent at least 2 are commonly called runs; those with exponent smaller than 2, instead, are particular cases of maximal gapped repeats. We show that a string of length n contains O(n1.5) MCSs. We also provide an output-sensitive algorithm that, given a string of length n over a constant-size alphabet, locates all m MCSs the string contains in O(nlog n+ m) time.
Pattern Matching and Pattern Discovery Algorithms for Protein Topologies
2001
We describe algorithms for pattern-matching and pattern-learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgraph isomorphism and finding maximal common subgraphs in a restricted class of ordered graphs. We have developed a subgraph isomorphism algorithm for ordered graphs, which performs well on the given set of data. The maximal common subgraph problem then is solved by repeated subgraph extension and checking for isomorphisms. Despite its apparent inefficiency, this approach yields an algorithm with time complexity proportional to the number of graphs in the input set and is still practical on the given set of data. As a…
On groups with abelian Sylow 2-subgroups
1970
Finite groups with abelian Sylow 2-subgroups have been classified by Walter [8]. In this note I want to describe an alternate proof of some partial result of Walter's work, namely the theorem stated below. It represents the first major reduction step in that classification. The approach used here is to some extent derived from [1]. ! Besides the groups L 2 (q)= PSL(2, q) another class of simple groups enters our discussion: We say that a simple group G with abelian Sz-subgroups is of type JR (Janko-Ree) if, for any involution t in G, CG (t) is a maximal subgroup of G isomorphic to ( t ) | E where PSL(2, q)~ E ~_ PFL(2, q) with odd q > 5. In fact, E = L 2 (q), as proved by Walter 1-7] ; and …
Nilpotent length and system permutability
2022
Abstract If C is a class of groups, a C -injector of a finite group G is a subgroup V of G with the property that V ∩ K is a C -maximal subgroup of K for all subnormal subgroups K of G. The classical result of B. Fischer, W. Gaschutz and B. Hartley states the existence and conjugacy of F -injectors in finite soluble groups for Fitting classes F . We shall show that for groups of nilpotent length at most 4, F -injectors permute with the members of a Sylow basis in the group. We shall exhibit the construction of a Fitting class and a group of nilpotent length 5, which fail to satisfy the result and show that the bound is the best possible.
S_Kernel: A New Symmetry Measure
2005
Symmetry is an important feature in vision. Several detectors or transforms have been proposed. In this paper we concentrate on a measure of symmetry. Given a transform S, the kernel SK of a pattern is defined as the maximal included symmetric sub-set of this pattern. It is easily proven that, in any direction, the optimal axis corresponds to the maximal correlation of a pattern with its flipped version. For the measure we compute a modified difference between respective surfaces of a pattern and its kernel. That founds an efficient algorithm to attention focusing on symmetric patterns.