If u(t, x) is a solution of a one–dimensional, parabolic, second– order, linear partial differential equation (PDE), then it is known that, under suitable conditions, the number of zero–crossings of the function u(t, ·) decreases (that is, does not increase) as time t increases. Such theorems have applications to the study of blow–up of solutions of semilinear PDE, time dependent Sturm Liouvill...

A novel representation of reset control systems with a zero-crossing resetting law, in the framework hybrid inclusions, is postulated. The well-posedness and stability issues resulting dynamical system are investigated, strong focus on how non-deterministic behavior implemented practice. Several conditions have been developed by using eigenstructure matrices related to periods interval sequence...

Zero-crossing data can provide important feature information about an utterance which is not available in a purely spectral representation. This report describes the incorporation of zero-crossing information into the spectral representation used in a template-matching system (CICADA). An analysis of zero-crossing data for an extensive (2880 utterance, 8 talker) alpha-digit data base is describ...

In this paper some results are presented on the statistical properties of zero crossings of turbulent velocity fluctuations in boundary layers over a wide range of Reynolds numbers. The earlier finding that the probability density function (pdf) of the intervals between successive zero crossings of the streamwise velocity fluctuation u can be approximated by two exponentials, ,* each with its o...

We prove that the scale map of the .zero-crossings of almost all signals filtered by a gaussian of variable size determines the signal uniquely, up to a constant scaling. Exceptions are signals that are antisymmetric about all their zeros (for instance infinitely periodic gratings). Our proof provides a method for reconstructing almost all signals from knowledge of how the zero-crossing contour...

In this paper, we present a framework and two linear time algorithms for obtaining circular drawings of graphs. The first technique produces circular drawings of biconnected graphs and finds a zero crossing circular drawing if one exists. The second technique finds multiple embedding circle drawings. Techniques for the reduction of edge crossings are also discussed. Results of experimental stud...