Enhanced model of load distribution along the line of contact for non-standard involute external gears

The presence of undercut at the tooth root, non-equal addendum on pinion and wheel, non-standard tooth height or non-standard center distance may have decisive influence on the load distribution along the line of contact of spur and helical gear teeth. The curve of variation of the meshing stiffness along the path of contact, quite symmetric respect the midpoint of the interval of contact, loses its symmetry for non-standard geometries and operating conditions. As a consequence, the critical contact points for bending and wear calculations may be shifted from their locations for standard gears. In this paper, a non-uniform model of load distribution along the line of contact of standard spur and helical gears, obtained from the minimum elastic potential criterion, has been enhanced to fit with the meshing conditions of the above mentioned non-standard cylindrical gear pairs. The same analytical formulation of the initial model may be used for the non-standard gears by considering appropriate values of a virtual contact ratio, which are also presented in the paper.     

Shape distortions induced by convective effect on hot object in visible, near infrared and infrared bands

The goal of this study is to examine the perturbation induced by the convective effect (or mirage effect) on shape measurement and to give an estimation of the error induced. This work explores the mirage effect in different spectral bands and single wavelengths. A numerical approach is adopted and an original setup has been developed in order to investigate easily all the spectral bands of interest with the help of a CCD camera (Si, 0.35–1.1 μm), a near infrared camera (VisGaAs, 0.8–1.7 μm) or infrared cameras (8–12 μm). Displacements due to the perturbation for each spectral band are measured and finally some hints about how to correct them are given.     

Infinitesimal Carleson Property for Weighted Measures Induced by Analytic Self-Maps of the Unit Disk

We prove that, for every $\alpha > -1$ , the pull-back measure $\varphi ({\mathcal A }_\alpha )$ of the measure $d{\mathcal A }_\alpha (z) = (\alpha + 1) (1 - |z|^2)^\alpha \, d{\mathcal A } (z)$ , where ${\mathcal A }$ is the normalized area measure on the unit disk $\mathbb D $ , by every analytic self-map $\varphi :\mathbb D \rightarrow \mathbb D $ is not only an $(\alpha \,{+}\, 2)$ -Carleson measure, but that the measure of the Carleson windows of size $\varepsilon h$ is controlled by $\varepsilon ^{\alpha + 2}$ times the measure of the corresponding window of size $h$ . This means that the property of being an $(\alpha + 2)$ -Carleson measure is true at all infinitesimal scales. We give an application by characterizing the compactness of composition operators on weighted Bergman–Orlicz spaces.     

Gromov hyperbolicity of planar graphs

We prove that under appropriate assumptions adding or removing an infinite amount of edges to a given planar graph preserves its non-hyperbolicity, a result which is shown to be false in general. In particular, we make a conjecture that every tessellation graph of ?² with convex tiles is non-hyperbolic; it is shown that in order to prove this conjecture it suffices to consider tessellation graphs of ?² such that every tile is a triangle and a partial answer to this question is given. A weaker version of this conjecture stating that every tessellation graph of ?² with rectangular tiles is non-hyperbolic is given and partially answered. If this conjecture were true, many tessellation graphs of ?² with tiles which are parallelograms would be non-hyperbolic.     

On the Heterochromatic Number of Hypergraphs Associated to Geometric Graphs and to Matroids

The heterochromatic number h _c (H) of a non-empty hypergraph H is the smallest integer k such that for every colouring of the vertices of H with exactly k colours, there is a hyperedge of H all of whose vertices have different colours. We denote by ν(H) the number of vertices of H and by τ(H) the size of the smallest set containing at least two vertices of each hyperedge of H. For a complete geometric graph G with n ≥ 3 vertices let H = H(G) be the hypergraph whose vertices are the edges of G and whose hyperedges are the edge sets of plane spanning trees of G. We prove that if G has at most one interior vertex, then h _c (H) = ν(H) ? τ(H) + 2. We also show that h _c (H) = ν(H) ? τ(H) + 2 whenever H is a hypergraph with vertex set and hyperedge set given by the ground set and the bases of a matroid, respectively.     

A simple method to find out when an ordinary differential equation is separable

In many statistical discussions, especially in data analysis, the idea of polynomials plays a key role. For example, Dwyer [1] employed polynomials to express factorial moments of discrete distribution in terms of cumulative totals. Traditionally, polynomials are derived using the difference operator method (see [2], p. 134]). In this article, using the differential equation approach as an alternative method, we obtain generalized exponential and logarithmic polynomials, and find their special cases appearing in statistical signal‐noise models.     

Special jordan H*-triple systems

This work, jointly with [9], completes the structure theory and classification of the Jordan H ^*- triple systems. The problem of describing the Jordan H ^*-triple systems is reduced in [5] to that of describing the topologically simple ones. Ruling out the finite-dimensional case, we have that any of these H ^*-triples has an underlying triple system structure of quadratic type (and these can be fully described), or it is the H ^*-triple system associated to the odd part of a topologically simple Z₂-graded Jordan H ^*-algebra, whose classification is given in [13].     

Comparison of α-Condorcet points with median and center locations

The usual concept of solution in single voting location is the Condorcet point. A Condorcet solution is the location such that no other location is preferred by a strict majority of voters; i.e. a half of them. It is assumed that each user always prefers closer locations. Because a Condorcet point does not necessarily exist, the α-Condorcet point is defined in the same way but assuming that two locations are indifferent for a user if the distances to both differ at most in α. We give bounds for the value of the objective function in an α-Condorcet point in the median and center problems. These results, for a general graph and for a tree, extend previous bounds for the objective function in a Condorcet point. We also provide a set of instances where these bounds are asymptotically reached. This research has been partially supported by DGICYT through project PB95-1237-C03-02 and by Gobierno de Canarias through the projects CO-1/97 and PI1999/116.