We ana/lyze the performance of a recently reported Ge/Si core/shell nanowire transistor using a semiclassical, ballistic transport model and an sp3d5s* tight-binding treatment of the electronic structure. Comparison of the measured performance of the device with the effects of series resistance removed to the simulated result assuming ballistic transport shows that the experimental device opera...

Abstract We consider the diameter of a random graph G(n, p) for various ranges of p close to the phase transition point for connectivity. For a disconnected graph G, we use the convention that the diameter of G is the maximum diameter of its connected components. We show that almost surely the diameter of random graph G(n, p) equals (1 + o(1)) log n log(np) if np → ∞. Moreover if np log n = c >...

In this paper we study zero-divisor graphs of semirings. We show that all zero-divisor graphs of (possibly noncommutative) semirings are connected and have diameter less than or equal to 3. We characterize all acyclic zero-divisor graphs of semirings and prove that in the case zero-divisor graphs are cyclic, their girths are less than or equal to 4. We also give a description of the zero-diviso...

Given a compact connected set E in the unit disk B2, we give new upper bound for conformal capacity of condenser (B2,E) terms hyperbolic diameter t E. Moreover, t>0, construct and apply novel numerical methods to show that it has larger than with same diameter. The is called Reuleaux triangle geometry constant width equal t.

A study of dry ice growth on bundled (duplex) cylinders has been performed using icing wind tunnel experiments and computational fluid dynamics (CFD) numerical simulations. The aim this is to "fill the gaps" in works Wagner (2010) Qing et al. (2018). simulations cover a range possible conditions by varying operating speed, median volume diameter, for some cases-the angle incidence between cylin...

An n-dimensional hierarchical cubic network (denoted by HCN(n)) contains 2 n n-dimensional hypercubes. The diameter of the HCN(n), which is equal to n+(n+1)/3+1, is about two-thirds the diameter of a comparable hypercube, although it uses about half as many links per node. In this paper, a maximal number of node-disjoint paths are constructed between every two distinct nodes of the HCN(n). Th...