Click-evoked otoacoustic emissions (CEOAEs) and acoustical responses evoked by bandlimited Gaussian noise (noise-evoked otoacoustic emissions; NEOAEs) were measured in three normal-hearing subjects. For the NEOAEs the first- and second-order Wiener kernel and polynomial correlation functions up to the sixth order were calculated by cross correlating the noise stimulus and the emission response....

The vertex-edge Wiener polynomials of a simple connected graph are defined based on the distances between vertices and edges of that graph. The first derivative of these polynomials at one are called the vertex-edge Wiener indices. In this paper, we express some basic properties of the first and second vertex-edge Wiener polynomials of simple connected graphs and compare the first and second ve...

Polynomial interpolation can be used to obtain closed formulas for topological indices of infinite series of molecular graphs. The method is discussed and its advantages and limitations are pointed out. This is illustrated on fullerenes C12k+4 and four topological indices: the Wiener index, the edge Wiener index, the eccentric connectivity index, and the reverse Wiener index. The results for th...

A novel semi-blind defocused image deconvolution technique is proposed, which is based on multivariate local polynomial regression and iterative Wiener filtering. In this technique, firstly a multivariate local polynomial regression model is trained in wavelet domain to estimate defocus parameter. After obtaining the point spread function (PSF ) parameter, iterative wiener filter is adopted to ...

The Hosoya polynomial of a graph, H(G, z), has the property that its first derivative, evaluated at z = 1, equals the Wiener index, i.e., W(G) = H’(G, 1). In this paper, an equation is presented that gives the hyper-Wiener index, WW(G), in terms of the first and second derivatives of H(G,z). Also defined here is a hyper-Hosoya polynomial, HH(G,r), which has the property WW(G) = HH’(G, l), analo...

The sum of distances between all vertices pairs in a connected graph is known as the Wiener Index. It is the earliest of the indices that correlates well with many physicochemical properties of organic compounds and as such has been well-studied over the last quarter of a century. A q-analogue of this index, termed the Wiener Polynomial by Hosoya but also known today as the Hosoya Polynomial, e...

This paper presents analytical and Monte Carlo results for a stochastic gradient adaptive scheme that tracks a time-varying polynomial Wiener system [i.e., a linear time-invariant (LTI) filter with memory followed by a time-varying memoryless polynomial nonlinearity]. The adaptive scheme consists of two phases: 1) estimation of the LTI memory using the LMS algorithm and 2) tracking the time-var...

For a connected graph G and an non-empty set S ⊆ V (G), the Steiner distance dG(S) among the vertices of S is defined as the minimum size among all connected subgraphs whose vertex sets contain S. This concept represents a natural generalization of the concept of classical graph distance. Recently, the Steiner Wiener index of a graph was introduced by replacing the classical graph distance used...