The search-volume corrected period distribution of contact binaries of the W UMa type appears to reflect primarily the constant number ratio of ≃ 1/500 to the number of stars along the Main Sequence; there exist no evidence for angular momentum evolution. The maximum in contact binary numbers is located at shorter periods than estimated before, P ≃ 0.27 d. The drop in numbers towards the cut-of...

We give query-efficient algorithms for the global min-cut and the s-t cut problem in unweighted, undirected graphs. Our oracle model is inspired by the submodular function minimization problem: on query S ⊂ V , the oracle returns the size of the cut between S and V \ S. We provide algorithms computing an exact minimum s-t cut in G with Õ(n5/3) queries, and computing an exact global minimum cut ...

Given G = (V, E) an undirected graph and two speci ed nonadjacent nodes a and b of V , a cut separator is a subset F = δ(C) ⊆ E such that a, b ∈ V \C and a and b belong to di erent connected components of the graph induced by V \C. Given a nonnegative cost vector c ∈ R|E| + , the optimal cut separator problem is to nd a cut separator of minimum cost. This new problem is closely related to the v...

Spreading depression (SD) is pronounced depolarization of neurons and glia that travels slowly across brain tissue followed by massive redistribution of ions between intra- and extracellular compartments. There is a relationship between SD and some neurological disorders. In the present study the effects of repetitive SD on neuronal damage in cortical and subcortical regions of juvenile rat bra...

Forest operations often enhance runoff and soil loss in roads skid trails, where cut slopes fill are the most important source of sediment. This study evaluated effectiveness four erosion control treatments applied to slope segments forest different ages Hyrcanian northern Iran. The treatment combinations, each replicated three times, included classes mulch cover (bare [BS], wood chips [WCH], s...

OF THE DISSERTATION On Generation of Cut Conjunctions, Minimal k-Connected Spanning Subgraphs, Minimal Connected and Spanning Subsets and Vertices by Konrad Borys Dissertation Director: Professor Endre Boros We consider the following problems: • Cut conjunctions in graphs: given an undirected graphG = (V,E) and a collection of vertex pairs B ⊆ V × V generate all minimal edge sets X ⊆ E such tha...

x To acknowledge the corn-This purely American expression means to admit the losing of an argument , especially in regard to a detail; to retract; to admit defeat. It is over a hundred years old. Andrew Stewart, a member of Congress, is said to have mentioned it in a speech in 1828. He said that haystacks and cornfields were sent by Indiana, Ohio and Kentucky to Philadelphia and New York. Charl...

In this paper we introduce the graph layout parameter neighbourhood-width as a variation of the well-known cut-width. The cut-width of a graph G = (V ,E) is the smallest integer k, such that there is a linear layout : V → {1, . . . , |V |}, such that for every 1 i < |V | there are at most k edges {u, v} with (u) i and (v)> i. The neighbourhood-width of a graph is the smallest integer k, such th...