Thermal properties of pressure sintered alumina–graphene composites

Journal of Thermal Analysis and Calorimetry - The work concerns the alumina–graphene materials sintered by two different pressure methods. The different particle sizes of graphene were used....     

IFS attractors and Cantor sets

We build a metric space which is homeomorphic to a Cantor set but cannot be realized as the attractor of an iterated function system. We give also an example of a Cantor set K in R³ such that every homeomorphism f of R³ which preserves K coincides with the identity on K.     

Roles of rhenium diimine complexes as metal‐ion probes and photosensitizers in functional polyurethanes

Polyurethanes incorporated with rhenium diimine complexes were synthesized. The polymers exhibited interesting morphologies and solution properties. Results from gel permeation chromatography suggested the formation of polymer aggregates in solutions. The polymers could act as probes for metal ions. The addition of metal ions to polymer solutions led to significant changes in the electronic absorption properties of the polymer solutions. This was attributed to the interactions between the polyether moieties and metal ions. The metal complexes could also act as efficient photosensitizers. After doping with charge‐transport viologens, the photoconductivity of the polymers was greatly enhanced. The experimental quantum efficiency was simulated with Onsager's theory. The thermalization distances and the primary yields were typically 12–14 Å and 10^?3, respectively. © 2003 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 41: 1708–1715, 2003     

Size complementarity in anion recognition by neutral macrocyclic tetraamides

Comparison of the anion binding properties of a series of uncharged macrocyclic tetraamides reveal significant effects of the receptor's size on the strength of its anion complexes. This study allowed for estimation of the optimal size of a macroring for complexation of common anions.     

Current and shot noise in two capacitively coupled single electron transistors with an atomic sized spacer

The currents and their fluctuations in two capacitively coupled single electron transistors are determined in the limit of sequential tunnelling. Our considerations are restricted to the case when the islands (dots) of the transistors are atomic-sized, which means each of them has only one single electronic level available for the tunnelling processes. The Coulomb interactions of accumulated charges on the both single electron transistors lead to the effect of the negative differential resistance. An enhancement of the current shot-noise was also found. Spectral decomposition analysis indicated the two main contributions to the shot-noise: low- and high-frequency fluctuations. It was found that the low frequency fluctuations (polarization noise) are responsible for a strong enhancement of the current noise. Received 9 October 2001 / Received in final form 8 March 2002 Published online 9 July 2002     

Inclusive production of vector mesons in π+ p interactions at 250 GeV/c

We report on a study of ρ⁰, ρ⁺, ω, \(\bar K^{*0} (892)\) andK ^*0 (892) inclusive production in π⁺ p interactions at 250 GeV/c, for ρ⁺, \(\bar K^{*0} (892)\) for the first time in a π⁺ p experiment. The data are compared withK ⁺ p data in the same experiment, with results of other experiments and with quark-parton models. Interesting differences are found between ρ^+,0 and ω production.     

The measure of a translated ball in uniformly convex spaces

Let (E, ¦·¦) be a uniformly convex Banach space with the modulus of uniform convexity of power type. Let be the convolution of the distribution of a random series inE with independent one-dimensional components and an arbitrary probability measure onE. Under some assumptions about the components and the smoothness of the norm we show that there exists a constant such that |{·<t}–{·+r<t}|r ^q , whereq depends on the properties of the norm. We specify it in the case ofL spaces, >1.     

The complexity of many cells in arrangements of planes and related problems

We consider several problems involving points and planes in three dimensions. Our main results are: (i) The maximum number of faces boundingm distinct cells in an arrangement ofn planes isO(m ^2/3 n logn +n ²); we can calculatem such cells specified by a point in each, in worst-case timeO(m ^2/3 n log³ n+n ² logn). (ii) The maximum number of incidences betweenn planes andm vertices of their arrangement isO(m ^2/3 n logn+n ²), but this number is onlyO(m ^3/5– n ^4/5+2 +m+n logm), for any>0, for any collection of points no three of which are collinear. (iii) For an arbitrary collection ofm points, we can calculate the number of incidences between them andn planes by a randomized algorithm whose expected time complexity isO((m ^3/4– n ^3/4+3 +m) log² n+n logn logm) for any>0. (iv) Givenm points andn planes, we can find the plane lying immediately below each point in randomized expected timeO([m ^3/4– n ^3/4+3 +m] log² n+n logn logm) for any>0. (v) The maximum number of facets (i.e., (d–1)-dimensional faces) boundingm distinct cells in an arrangement ofn hyperplanes ind dimensions,d>3, isO(m ^2/3 n ^d/3 logn+n ^d–1). This is also an upper bound for the number of incidences betweenn hyperplanes ind dimensions andm vertices of their arrangement. The combinatorial bounds in (i) and (v) and the general bound in (ii) are almost tight.Work on this paper by the first author has been supported by Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and by NSF Grant CCR-8714565. Work by the third author has been supported by Office of Naval Research Grant N00014-87-K-0129, by National Science Foundation Grant DCR-82-20085, by grants from the Digital Equipment Corporation, and the IBM Corporation, and by a research grant from the NCRD—the Israeli National Council for Research and Development. An abstract of this paper has appeared in theProceedings of the 13th International Mathematical Programming Symposium, Tokyo, 1988, p. 147.     

Implicitly representing arrangements of lines or segments

Anarrangement ofn lines (or line segments) in the plane is the partition of the plane defined by these objects. Such an arrangement consists ofO(n ²) regions, calledfaces. In this paper we study the problem of calculating and storing arrangementsimplicitly, using subquadratic space and preprocessing, so that, given any query pointp, we can calculate efficiently the face containingp. First, we consider the case of lines and show that with (n) space¹ and (n ^3/2) preprocessing time, we can answer face queries in (n)+O(K) time, whereK is the output size. (The query time is achieved with high probability.) In the process, we solve three interesting subproblems: (1) given a set ofn points, find a straight-edge spanning tree of these points such that any line intersects only a few edges of the tree, (2) given a simple polygonal path , form a data structure from which we can find the convex hull of any subpath of quickly, and (3) given a set of points, organize them so that the convex hull of their subset lying above a query line can be found quickly. Second, using random sampling, we give a tradeoff between increasing space and decreasing query time. Third, we extend our structure to report faces in an arrangement of line segments in (n ^1/3)+O(K) time, given(n ^4/3) space and (n ^5/3) preprocessing time. Lastly, we note that our techniques allow us to computem faces in an arrangement ofn lines in time (m ^2/3 n ^2/3+n), which is nearly optimal.The first author is pleased to acknowledge the support of Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and National Science Foundation Grant CCR-8714565. Work on this paper by the fifth author has been supported by Office of Naval Research Grant N00014-87-K-0129, by National Science Foundation Grant NSF-DCR-83-20085, by grants from the Digital Equipment Corporation, and the IBM Corporation, and by a research grant from the NCRD—the Israeli National Council for Research and Development. The sixth author was supported in part by a National Science Foundation Graduate Fellowship. This work was begun while the non-DEC authors were visiting at the DEC Systems Research Center.