A construction of commutative nilsemigroups

All commutative nilsemigroups are constructed from congruences on free commutative semigroups.     

Nonlinear vibrations of loudspeaker-like structures

During high amplitudes of vibration, nonlinearities affect the electroacoustical behavior of electrodynamic transducers and are responsible for audible distortions. We distinguish two types of nonlinearities: electrical and mechanical. In this study, attention is paid to the mechanical and geometrical properties of loudspeaker-like structures. The loudspeaker is viewed as a combination of an annular plate with a circular plate. Nonlinear vibrations of such a structure are investigated, using the dynamic analog of the Von-Kármán equations. Furthermore, the influence of both material properties and geometrical parameters is studied. It is shown that nonlinear effects can be substantially reduced by choosing appropriate material and geometrical parameters.     

Sparse geometric graphs with small dilation

Given a set S of n points in , and an integer k such that 0k<n, we show that a geometric graph with vertex set S, at most n−1+k edges, maximum degree five, and dilation O(n/(k+1)) can be computed in time O(nlogn). For any k, we also construct planar n-point sets for which any geometric graph with n−1+k edges has dilation Ω(n/(k+1)); a slightly weaker statement holds if the points of S are required to be in convex position.     

Partial inner product spaces. II. Operators

We study linear operators between nondegenerate partial inner product spaces and their relationships to selfadjoint operators in a “middle” Hilbert space.     

Exact solution of lines' model of exchange - striction in magnetic dimers

A model Hamiltonian proposed by Lines describing the magnetomechanical doupling in a magnetic dimer, is investigated. An exact solution is obtained, exhibiting variations in the nuclear geometry and vibration frequency within the different spin terms. Some theoretical and experimental implications are pointed out.     

Equal signs additive sequences in Banach spaces

A sequence (e_n) spanning a Banach space E is called ESA or equal signs additive if the norm of a linear combination of the e_i's does not change when adjacent coefficients of equal sign are combined. Call the sequence (e_n) regular if neither E nor its dual contain an isomorphic copy of c₀. It is shown that a regular ESA sequence is a boundedly complete and 1-shrinking basis for its span which is thus quasi-reflexive. It is further possible to replace a regular ESA norm by an equivalent ESA norm rendering E isometrically isomorphic to its second dual. A sequence (e_n) is called IS or invariant under spreading if the norm of a linear combination of the e_i's does not change when the mutual distances of the terms in the sequence (but not their relative positions) change. We give a simple construction of an unconditional norm for an IS sequence, hence, in particular, for an ESA sequence. Also, an inverse construction is obtained: We prove that each unconditional IS basis gives rise to an ESA basis by means of an inversion formula; to nonequivalent IS unconditional bases correspond nonequivalent ESA bases. It follows that nonisomorphic ESA bases are plentiful.     

On duration and smoothing rules in a demisyllable-based isolated-word recognition system

In a recently proposed approach to isolated-word recognition, word reference templates are constructed from a universal set of demisyllable units by concatenating the appropriate demisyllables for each vocabulary item. A dynamic time warping (DTW) algorithm is used to align test and reference patterns optimally. Nevertheless some sort of syllable duration preadjustment is necessary because of the large potential difference in duration between isolated and in-context syllables. We have found that a simple rule that reduces the length of rhyme (final) demisyllables in nonword-final stressed syllables to approximately half their isolated-syllable duration provides recognition accuracy as high as that attained through use of complex, highly context-sensitive rules. In addition to its practical application, this result can be regarded as a further demonstration of the power of DTW. We have also investigated the requirements for parameter smoothing at demisyllable boundaries. We find that an optimal window duration for smoothing is about 60-90 ms, but that failure to smooth reduces recognition accuracy only about 2% in an 1109 word test set; that linear and parabolic smoothing are equally effective; and that it does not appear that recognition accuracy can be improved by smoothing in certain phonetic contexts only. Taken together, these results can be viewed as confirming the suitability of the demisyllable as the basic unit in recognition systems.     

Computing finite commutative semigroups

Precedence results are used to improve existing algorithms for the enumeration of finite commutative semigroups. As an application 11,545,843 distinct commutative semigroups of order 9 were found.