A Turing degree a is said to be almost everywhere dominating if, for almost all X ∈ 2 with respect to the “fair coin” probability measure on 2, and for all g : ω → ω Turing reducible to X, there exists f : ω → ω of Turing degree a which dominates g. We study the problem of characterizing the almost everywhere dominating Turing degrees and other, similarly defined classes of Turing degrees. We r...

the rotor of enegelberg whitener was equipped with a screw conveyor to reduce broken rice percentage. according to preliminary experiments this modification could reduce broken rice percentage about 2.5%. further experiment was performed to determine the effect of rotor speeds and blade positions on white rice quality. to do this, five rotor speeds, consisting 500, 600, 700, 800 and 900 r.p.m a...

A set C can be strongly coded under condition < B, C(A) >, where B and C are classes of sets possibly with other parameters, iff there exists A ∈ B such that every Z ∈ C(A) can be used to compute C. The issue is widely studied especially in effective mathematics and reverse mathematics. In this paper, we focus on three kinds of conditions, namely, density condition, enumeration condition and pa...

In a seminal STOC’95 paper, Arya et al. [4] devised a construction that for any set S of n points in R and any ǫ > 0, provides a (1 + ǫ)-spanner with diameter O(log n), weight O(log n)w(MST (S)), and constant maximum degree. Another construction of [4] provides a (1 + ǫ)-spanner with O(n) edges and diameter α(n), where α stands for the inverse-Ackermann function. Das and Narasimhan [18] devised...

We define a class of growing networks in which new nodes are given a spatial position and are connected to existing nodes with a probability mechanism favoring short distances and high degrees. The competition of preferential attachment and spatial clustering gives this model a range of interesting properties. Empirical degree distributions converge to a limit law, which can be a power law with...

The Wiener index of a graph is the sum of all pairwise distances of vertices of the graph. Fischermann et al [5] characterized the trees which minimize the Wiener index among all trees with the maximum degree at most ∆. They also determined the trees which maximize the Wiener index, but in a much more restricted family of trees which have two distinct vertex degrees only. In this note, we fully...

fab-less business model in semiconductor industry has led to serious concerns about trustworthy hardware. in untrusted foundries and manufacturing companies, submitted layout may be analyzed and reverse engineered to steal the information of a design or insert malicious trojans. understanding the netlist topology is the ultimate goal of the reverse engineering process. in this paper, we propose...

Introduction: The aim of this study was to in-vestigate the effect of irradiation duration and distance of light tip to prepared samples in two different light curing unites on the degree of conversion of resin composite. Materials and Methods: Conventional halogen and blue Light emitting diode (LED) units were used for polymerization of an Opalis resin com-posite. The conversion measurements w...

the topological indices, defined as the sum of contributions of all pairs of vertices (among which are the wiener, harary, hyper–wiener indices, degree distance, and many others), are expressed in terms of contributions of edges and pairs of edges.