scholarly journals Decomposable graphs and definitions with no quantifier alternation

2005 ◽  
Vol DMTCS Proceedings vol. AE,... (Proceedings) ◽  
Author(s):  
Oleg Pikhurko ◽  
Joel Spencer ◽  
Oleg Verbitsky
Keyword(s):  
The Other ◽  
Connected Components ◽  
Large Graphs ◽  
First Order ◽  
Minimum Number ◽  
International Audience ◽  
Decomposable Graphs ◽  
Number Of Iterations ◽  
Quantifier Alternation ◽  
Binary Logarithm

International audience Let $D(G)$ be the minimum quantifier depth of a first order sentence $\Phi$ that defines a graph $G$ up to isomorphism in terms of the adjacency and the equality relations. Let $D_0(G)$ be a variant of $D(G)$ where we do not allow quantifier alternations in $\Phi$. Using large graphs decomposable in complement-connected components by a short sequence of serial and parallel decompositions, we show examples of $G$ on $n$ vertices with $D_0(G) \leq 2 \log^{\ast}n+O(1)$. On the other hand, we prove a lower bound $D_0(G) \geq \log^{\ast}n-\log^{\ast}\log^{\ast}n-O(1)$ for all $G$. Here $\log^{\ast}n$ is equal to the minimum number of iterations of the binary logarithm needed to bring $n$ below $1$.

scholarly journals Acyclic, Star and Oriented Colourings of Graph Subdivisions

2005 ◽  
Vol Vol. 7 ◽  
Author(s):  
David R. Wood
Keyword(s):  
Chromatic Number ◽  
Undirected Graph ◽  
The Other ◽  
Chromatic Index ◽  
Chromatic Numbers ◽  
Minimum Number ◽  
International Audience ◽  
Vertex Partitions ◽  
Colour Classes ◽  
Vertex Colouring

International audience Let G be a graph with chromatic number χ (G). A vertex colouring of G is \emphacyclic if each bichromatic subgraph is a forest. A \emphstar colouring of G is an acyclic colouring in which each bichromatic subgraph is a star forest. Let χ _a(G) and χ _s(G) denote the acyclic and star chromatic numbers of G. This paper investigates acyclic and star colourings of subdivisions. Let G' be the graph obtained from G by subdividing each edge once. We prove that acyclic (respectively, star) colourings of G' correspond to vertex partitions of G in which each subgraph has small arboricity (chromatic index). It follows that χ _a(G'), χ _s(G') and χ (G) are tied, in the sense that each is bounded by a function of the other. Moreover the binding functions that we establish are all tight. The \emphoriented chromatic number χ ^→(G) of an (undirected) graph G is the maximum, taken over all orientations D of G, of the minimum number of colours in a vertex colouring of D such that between any two colour classes, all edges have the same direction. We prove that χ ^→(G')=χ (G) whenever χ (G)≥ 9.

scholarly journals Partially complemented representations of digraphs

2002 ◽  
Vol Vol. 5 ◽  
Author(s):  
Elias Dahlhaus ◽  
Jens Gustedt ◽  
Ross M. Mcconnell
Keyword(s):  
Equivalence Class ◽  
The Other ◽  
Connected Components ◽  
Special Issue ◽  
Undirected Graphs ◽  
Strongly Connected Components ◽  
Graph Decompositions ◽  
Adjacency List ◽  
Strongly Connected ◽  
International Audience

Special issue: Graph Decompositions International audience A complementation operation on a vertex of a digraph changes all outgoing arcs into non-arcs, and outgoing non-arcs into arcs. This defines an equivalence relation where two digraphs are equivalent if one can be obtained from the other by a sequence of such operations. We show that given an adjacency-list representation of a digraph G, many fundamental graph algorithms can be carried out on any member G' of G's equivalence class in O(n+m) time, where m is the number of arcs in G, not the number of arcs in G' . This may have advantages when G' is much larger than G. We use this to generalize to digraphs a simple O(n + m log n) algorithm of McConnell and Spinrad for finding the modular decomposition of undirected graphs. A key step is finding the strongly-connected components of a digraph F in G's equivalence class, where F may have ~(m log n) arcs.

scholarly journals Thematic Maps for the Variation of Bearing Capacity of Soil Using SPTs and MATLAB

Geosciences ◽  
2020 ◽  
Vol 10 (9) ◽  
pp. 329
Author(s):  
Mahdi O. Karkush ◽  
Mahmood D. Ahmed ◽  
Ammar Abdul-Hassan Sheikha ◽  
Ayad Al-Rumaithi
Keyword(s):  
Bearing Capacity ◽  
Mean Squared Error ◽  
Ground Level ◽  
The Other ◽  
Thematic Maps ◽  
First Order ◽  
Squared Error ◽  
Order Polynomial ◽  
Interpolation Polynomials ◽  
Penetration Tests

The current study involves placing 135 boreholes drilled to a depth of 10 m below the existing ground level. Three standard penetration tests (SPT) are performed at depths of 1.5, 6, and 9.5 m for each borehole. To produce thematic maps with coordinates and depths for the bearing capacity variation of the soil, a numerical analysis was conducted using MATLAB software. Despite several-order interpolation polynomials being used to estimate the bearing capacity of soil, the first-order polynomial was the best among the other trials due to its simplicity and fast calculations. Additionally, the root mean squared error (RMSE) was almost the same for the all of the tried models. The results of the study can be summarized by the production of thematic maps showing the variation of the bearing capacity of the soil over the whole area of Al-Basrah city correlated with several depths. The bearing capacity of soil obtained from the suggested first-order polynomial matches well with those calculated from the results of SPTs with a deviation of ±30% at a 95% confidence interval.

Neural computation of motion in the fly visual system: quadratic nonlinearity of responses induced by picrotoxin in the HS and CH cells

1995 ◽  
Vol 74 (6) ◽  
pp. 2665-2684 ◽  
Author(s):  
Y. Kondoh ◽  
Y. Hasegawa ◽  
J. Okuma ◽  
F. Takahashi
Keyword(s):  
Mean Square Error ◽  
Order Term ◽  
Mirror Image ◽  
Second Order ◽  
The Other ◽  
Linear Component ◽  
Mean Square ◽  
Nonlinear Component ◽  
First Order ◽  
Order Kernel

1. A computational model accounting for motion detection in the fly was examined by comparing responses in motion-sensitive horizontal system (HS) and centrifugal horizontal (CH) cells in the fly's lobula plate with a computer simulation implemented on a motion detector of the correlation type, the Reichardt detector. First-order (linear) and second-order (quadratic nonlinear) Wiener kernels from intracellularly recorded responses to moving patterns were computed by cross correlating with the time-dependent position of the stimulus, and were used to characterize response to motion in those cells. 2. When the fly was stimulated with moving vertical stripes with a spatial wavelength of 5-40 degrees, the HS and CH cells showed basically a biphasic first-order kernel, having an initial depolarization that was followed by hyperpolarization. The linear model matched well with the actual response, with a mean square error of 27% at best, indicating that the linear component comprises a major part of responses in these cells. The second-order nonlinearity was insignificant. When stimulated at a spatial wavelength of 2.5 degrees, the first-order kernel showed a significant decrease in amplitude, and was initially hyperpolarized; the second-order kernel was, on the other hand, well defined, having two hyperpolarizing valleys on the diagonal with two off-diagonal peaks. 3. The blockage of inhibitory interactions in the visual system by application of 10-4 M picrotoxin, however, evoked a nonlinear response that could be decomposed into the sum of the first-order (linear) and second-order (quadratic nonlinear) terms with a mean square error of 30-50%. The first-order term, comprising 10-20% of the picrotoxin-evoked response, is characterized by a differentiating first-order kernel. It thus codes the velocity of motion. The second-order term, comprising 30-40% of the response, is defined by a second-order kernel with two depolarizing peaks on the diagonal and two off-diagonal hyperpolarizing valleys, suggesting that the nonlinear component represents the power of motion. 4. Responses in the Reichardt detector, consisting of two mirror-image subunits with spatiotemporal low-pass filters followed by a multiplication stage, were computer simulated and then analyzed by the Wiener kernel method. The simulated responses were linearly related to the pattern velocity (with a mean square error of 13% for the linear model) and matched well with the observed responses in the HS and CH cells. After the multiplication stage, the linear component comprised 15-25% and the quadratic nonlinear component comprised 60-70% of the simulated response, which was similar to the picrotoxin-induced response in the HS cells. The quadratic nonlinear components were balanced between the right and left sides, and could be eliminated completely by their contralateral counterpart via a subtraction process. On the other hand, the linear component on one side was the mirror image of that on the other side, as expected from the kernel configurations. 5. These results suggest that responses to motion in the HS and CH cells depend on the multiplication process in which both the velocity and power components of motion are computed, and that a putative subtraction process selectively eliminates the nonlinear components but amplifies the linear component. The nonlinear component is directionally insensitive because of its quadratic non-linearity. Therefore the subtraction process allows the subsequent cells integrating motion (such as the HS cells) to tune the direction of motion more sharply.

scholarly journals Ganglioside incorporation and release by the isolated perfused rat liver

1991 ◽  
Vol 274 (2) ◽  
pp. 581-585 ◽  
Author(s):  
S C Kivatinitz ◽  
A Miglio ◽  
R Ghidoni
Keyword(s):  
Rat Liver ◽  
The Other ◽  
Regulatory Role ◽  
Isolated Perfused Rat Liver ◽  
Order Kinetic ◽  
Perfused Rat Liver ◽  
Ganglioside Gm1 ◽  
First Order ◽  
Pseudo First Order

The fate of exogenous ganglioside GM1 labelled in the sphingosine moiety, [Sph-3H]GM1, administered as a pulse, in the isolated perfused rat liver was investigated. When a non-recirculating protocol was employed, the amount of radioactivity in the liver and perfusates was found to be dependent on the presence of BSA in the perfusion liquid and on the time elapsed after the administration of the ganglioside. When BSA was added to the perfusion liquid, less radioactivity was found in the liver and more in the perfusate at each time tested, for up to 1 h. The recovery of radioactivity in the perfusates followed a complex course which can be described by three pseudo-first-order kinetic constants. The constants, in order of decreasing velocity, are interpreted as: (a) the dilution of the labelled GM1 by the constant influx of perfusion liquid; (b) the washing off of GM1 loosely bound to the surface of liver cells; (c) the release of gangliosides from the liver. Process (b) was found to be faster in the presence of BSA, probably owing to the ability of BSA to bind gangliosides. The [Sph-3H]GM1 in the liver underwent metabolism, leading to the appearance of products of anabolic (GD1a, GD1b) and catabolic (GM2, GM3) origin; GD1a appeared before GM2 and GM3 but, at times longer than 10 min, GM2 and GM3 showed more radioactivity than GD1a. At a given time the distribution of the radioactivity in the perfusates was quite different from that of the liver. In fact, after 60 min GD1a was the only metabolite present in any amount, the other being GM3, the quantity of which was small. This indicates that the liver is able to release newly synthesized gangliosides quite specifically. When a recirculating protocol was used, there were more catabolites and less GD1a than with the non-recirculating protocol. A possible regulatory role of ganglioside re-internalization on their own metabolism in the liver is postulated.

scholarly journals Pancreatic secretion and pressure biomechanics in pancreatic acinus

2020 ◽  
Vol 19 (1) ◽  
pp. 6-12
Author(s):  
G. Ya. Kostyuk ◽  
O. G. Kostyuk ◽  
M. V Burkov ◽  
I. A. Golubovsky ◽  
M. P. Bulko ◽  
...  
Keyword(s):  
Flow System ◽  
Dynamic Pressure ◽  
Excretory Duct ◽  
The Other ◽  
Duct System ◽  
First Order ◽  
Pancreatic Acinus ◽  
Mercury Column ◽  
The Mathematical Model ◽  
Oddi Sphincter

The article highlights the mechanism of the mathematical model of acinus, the components of the formation of pressure in its cavity and the formation of pancreatic juice. It has been established that the mechanism for creating pressure in the acinus cavity is similar to the intraductal one. In this case, the question remains open about the causes of such high pressure, which is measured in several hundred millimeters of a mercury column, especially since, as histologically established, the pancreas and its ducts do not have muscle structures, and those rudiments of myofibrils, which are noted in some places of the flow system, of course, cannot ensure the development of such pressure. The increase in pressure in the cavity of the acinus is associated with the phenomenon of osmosis in its cells. Since cell membranes have the property of conductivity, as a result of osmosis, water through the membrane first passes from the blood to the cell, then from the cell through the membrane into the acinus cavity. In addition to the mechanism of osmosis through the membrane, in the cells of the acinus epithelium, there is a filtering mechanism through the pores of the layer of connective tissue to the lymph channel. It has now been established that, together with simple osmosis, the phenomenon of electroosmosis takes place in secreting cells and organs of excretion, not only accelerates the transfer of substances, but also increases the pressure on the other side of the membrane against the gradient by almost several first-order units. Thus, the outflow of fluid from the acinus cavity proceeds continuously, but only with a change in the speed of movement, it is determined by the pressure drop in the acinus – tubule – excretory duct system, the opening of the Oddi sphincter and the pulse of the cardiovascular wave, which creates dynamic pressure in the capillary. This whole mechanism, as a result, leads to the filling of the cavity of the acinus and the creation of a certain pressure in it.

scholarly journals Strong chromatic index of products of graphs

2007 ◽  
Vol Vol. 9 no. 1 (Graph and Algorithms) ◽  
Author(s):  
Olivier Togni
Keyword(s):  
Cartesian Product ◽  
Complete Graphs ◽  
Chromatic Index ◽  
Induced Matching ◽  
Colour Class ◽  
Strong Chromatic Index ◽  
Minimum Number ◽  
International Audience

Graphs and Algorithms International audience The strong chromatic index of a graph is the minimum number of colours needed to colour the edges in such a way that each colour class is an induced matching. In this paper, we present bounds for strong chromatic index of three different products of graphs in term of the strong chromatic index of each factor. For the cartesian product of paths, cycles or complete graphs, we derive sharper results. In particular, strong chromatic indices of d-dimensional grids and of some toroidal grids are given along with approximate results on the strong chromatic index of generalized hypercubes.

scholarly journals Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence: Extended abstract.

2007 ◽  
Vol DMTCS Proceedings vol. AH,... (Proceedings) ◽  
Author(s):  
Svante Janson
Keyword(s):  
Order Term ◽  
Combinatorial Problem ◽  
Random Order ◽  
Priority Queues ◽  
Sorting Algorithm ◽  
Asymptotic Results ◽  
First Order ◽  
Asymptotically Normal ◽  
International Audience ◽  
Space Requirements

International audience We study the space requirements of a sorting algorithm where only items that at the end will be adjacent are kept together. This is equivalent to the following combinatorial problem: Consider a string of fixed length n that starts as a string of 0's, and then evolves by changing each 0 to 1, with the n changes done in random order. What is the maximal number of runs of 1's? We give asymptotic results for the distribution and mean. It turns out that, as in many problems involving a maximum, the maximum is asymptotically normal, with fluctuations of order $n^{1/2}$, and to the first order well approximated by the number of runs at the instance when the expectation is maximized, in this case when half the elements have changed to 1; there is also a second order term of order $n^{1/3}$. We also treat some variations, including priority queues and sock-sorting.

scholarly journals On the Number of 2-Protected Nodes in Tries and Suffix Trees

2012 ◽  
Vol DMTCS Proceedings vol. AQ,... (Proceedings) ◽  
Author(s):  
Jeffrey Gaither ◽  
Yushi Homma ◽  
Mark Sellke ◽  
Mark Daniel Ward
Keyword(s):  
Suffix Trees ◽  
First Order ◽  
International Audience

International audience We use probabilistic and combinatorial tools on strings to discover the average number of 2-protected nodes in tries and in suffix trees. Our analysis covers both the uniform and non-uniform cases. For instance, in a uniform trie with $n$ leaves, the number of 2-protected nodes is approximately 0.803$n$, plus small first-order fluctuations. The 2-protected nodes are an emerging way to distinguish the interior of a tree from the fringe.

Sign in / Sign up

Export Citation Format

Share Document