We consider unknown ad-hoc radio networks, when the underlying network is bidirectional and nodes can have polynomially large labels. For this model, we present a deterministic protocol for gossiping which takes O(n lg n lg lgn) rounds. This improves upon the previous best result for deterministic gossiping for this model by [Gasienec, Potapov, Pagourtizis, Deterministic Gossiping in Radio Netw...

Given a sequence of n elements, the All Nearest Smaller Values (ANSV) problem is to nd, for each element in the sequence, the nearest element to the left (right) that is smaller, or to report that no such element exists. Time and work optimal algorithms for this problem are known on all the PRAM models 4, 6], but the running time of the best previous hypercube algorithm 9] is optimal only when ...

PURPOSE To investigate the osmotic water permeability of lacrimal gland (LG) duct epithelium by means of calculation of filtration permeability and to investigate LG ductal fluid secretion. METHODS Experiments were performed on isolated rabbit LG duct segments maintained in short-term culture. Osmotically determined fluid movement or fluid secretion into the closed intraluminal space of cultu...

PURPOSE Gene expression and protein analysis studies require high-quality human tissue which is a challenge and difficult to obtain through live human biopsies. Human postmortem lacrimal gland (LG) and submandibular gland (SMG) tissues have the potential to provide an invaluable source for studying the mechanisms involved in LG and SMG dysfunction. Therefore, we aimed to test the suitability of...

Genetic linkage maps provide a useful resource for non-model genomes and can aid in genome reassembly to form more contiguous pseudo-chromosomes. We present the first map of any cephalopod, H. maculosa, composed 47 groups (LG). A total 2166 single nucleotide polymorphisms 2455 presence–absence variant loci were utilised by Lep-Map3 construction. The length spans 2016.62 cM with an average marke...

where capG(S, S̄) is the total weight of the edges crossing from S to S̄ = V − S. We show that the minimum generalized eigenvalue λ(LG, LH) of the pair of Laplacians LG and LH satisfies λ(LG, LH) ≥ φ(G,H)φ(G)/8, where φ(G) is the usual conductance of G. A generalized cut that meets this bound can be obtained from the generalized eigenvector corresponding to λ(LG, LH). The inequality complements a...

where capG(S, S̄) is the total weight of the edges crossing from S to S̄ = V − S. We show that the minimum generalized eigenvalue λ(LG, LH) of the pair of Laplacians LG and LH satisfies λ(LG, LH) ≥ φ(G,H)φ(G)/8, where φ(G) is the usual conductance of G. A generalized cut that meets this bound can be obtained from the generalized eigenvector corresponding to λ(LG, LH). The inequality complements a...

In his milestone textbook Lattice Theory, Garrett Birkhoff challenged his readers to develop a “common abstraction” that includes Boolean algebras and latticeordered groups as special cases. In this paper, after reviewing the past attempts to solve the problem, we provide our own answer by selecting as common generalization of BA and LG their join BA∨LG in the lattice of subvarieties of FL (the...