All-Pairs Small-Stretch Paths

Let G = (V, E) be a weighted undirected graph. A path between u, v  V is said to be of stretch t if its length is at most t times the distance between u and v in the graph. We consider the problem of finding small-stretch paths between all pairs of vertices in the graph G.It is easy to see that finding paths of stretch less than 2 between all pairs of vertices in an undirected graph with n vertices is at least as hard as the Boolean multiplication of two n × n matrices. We describe three algorithms for finding small-stretch paths between all pairs of vertices in a weighted graph with n vertices and m edges. The first algorithm, STRETCH₂, runs in Õ(n^3/2m^1/2) time and finds stretch 2 paths. The second algorithm, STRETCH_7/3, runs in Õ(n^7/3) time and finds stretch 7/3 paths. Finally, the third algorithm, STRETCH₃, runs in Õ(n²) and finds stretch 3 paths.Our algorithms are simpler, more efficient and more accurate than the previously best algorithms for finding small-stretch paths. Unlike all previous algorithms, our algorithms are not based on the construction of sparse spanners or sparse neighborhood covers.     

On a superatomic Boolean algebra which is not generated by a well-founded sublattice

Let b denote the unboundedness number of ω^ω. That is, b is the smallest cardinality of a subset such that for everyg∈ω^ω there isf ∈ F such that {n: g(n) ≤ f(n)}is infinite. A Boolean algebraB is wellgenerated, if it has a well-founded sublatticeL such thatL generatesB. We show that it is consistent with ZFC that , and there is a Boolean algebraB such thatB is not well-generated, andB is superatomic with cardinal sequence 〈ℵ₀, ℵ₁, ℵ₁, 1〉. This result is motivated by the fact that if the cardinal sequence of a Boolean algebraB is 〈ℵ₀, ℵ₀, λ, 1〉, andB is not well-generated, then λ≥b.     

Bounds for solutions of a differential inequality

This work compares the solutions of an th order differential inequality plus boundary conditions with the solution of the related differential equation with boundary conditions. The differential operator is assumed to be disconjugate. It is proved that under suitable conditions the ratio of these solutions is monotone. The solution of the inequality can be replaced by the corresponding Green's function.

     

Surface properties of plasma membrane vesicles isolated from melon (Cucumus melo L.) root cells differing in salinity tolerance

The hypotheses that genotypic differences in salinity tolerance may result from (i) differences in global surface charge density or (ii) from differences in global Ca²⁺ binding were tested. An attempt was made to correlate the differing salinity tolerance of four melon cultivars with surface properties of vesicles extracted from the plasma membrane (PM) of their root cells. Surface characterization involved measurements of electrophoretic mobility and sorption of ⁴⁵Ca²⁺ to the vesicles in the presence of varying concentrations of Ca²⁺, Na⁺ and Mg²⁺. Irrespective of salinity tolerance, vesicles from the four cultivars yielded similar ζ potentials under similar conditions, indicating similar global surface charge densities. Sorption studies with vesicles from two cultivars differing in salinity tolerance predicted independently this result of equal surface charge density. The estimated global binding affinities of Ca²⁺, Na⁺ and Mg²⁺ to the PM of both cultivars were the same with binding coefficients of 50, 0.8 and 9 M⁻¹, respectively. Consequently, the hypotheses enumerated above to interpret genotypic differences in salinity toxicity are rejected. However, vesicles from the salt-resistant strain sorbed 19% more Ca²⁺ per given amount of protein in the membrane, indicating the existence of a larger number of negatively charged surface sites per given amount of protein and a smaller amount of protein per given area of membrane. Genotypic differences in site-specific Ca²⁺-binding affinity (e.g. at ion channels) remain a viable hypothesis for genotypic differences in salinity tolerance.     

Interface Modifications of InAs Quantum‐Dots Solids and their Effects on FET Performance

InAs nanocrystals field‐effect transistors with an ON/OFF ratio of 10⁵ are reported. By tailoring the interface regions in the active layer step‐by‐step, the evolution of the ON/OFF ratio can be followed from approximately 5 all the way to around 10⁵. The formation of a semiconducting solid from colloidal nanocrystals is achieved through targeted design of the nanocrystal–nanocrystal interaction. The manipulation characteristics of the nanocrystal interfaces include the matrix surrounding the inorganic core, the interparticle distance, and the order of nanocrystals in the 3D array. Through careful analysis of device characteristics following each treatment, the effect of each on the physical properties of the films are able to be verified. The enhanced performance is related to interparticle spacing, reduction in sub‐gap states, and better electronic order (lower σ parameter). Films with enhanced charge transport qualities retain their quantum‐confined characteristics throughout the procedure, thus making them useful for optoelectronic applications.     

Fluid polling systems

We study N-queues single-server fluid polling systems, where a fluid is continuously flowing into the queues at queue-dependent rates. When visiting and serving a queue, the server reduces the amount of fluid in the queue at a queue-dependent rate. Switching from queue i to queue j requires two random-duration steps: (i) departing queue i, and (ii) reaching queue j. The length of time the server resides in a queue depends on the service regime. We consider three main regimes: Exhaustive, Gated, and Globally-Gated. Two polling procedures are analyzed: (i) cyclic and (ii) probabilistic. Under steady-state, we derive the Laplace–Stieltjes transform (LST), mean, and second moment of the amount of flow at each queue at polling instants, as well as at an arbitrary moment. We further calculate the LST and mean of the “waiting time” of a drop at each queue and derive expressions for the mean total load in the system for the various service regimes. Finally, we explore optimal switching procedures.