Loading [MathJax]/extensions/MathZoom.js
Displaying 341 –
360 of
924
A well known result of Fraenkel and Simpson
states that the number of distinct squares in a word of length n is bounded by 2n since at each position there are at most two distinct squares whose last occurrence starts.
In this paper, we investigate squares in partial words with one hole,
or sequences over a finite alphabet that have a “do not know” symbol or “hole”.
A square in a partial word over a given alphabet has the form uv where u is compatible with v, and consequently, such square is...
It is well known that each tree metric M has a unique realization as a tree, and that this realization minimizes the total length of the edges among all other realizations of M. We extend this result to the class of symmetric matrices M with zero diagonal, positive entries, and such that mij + mkl ≤ max{mik + mjl, mil + mjk} for all distinct i,j,k,l.
We compare two sets of (infinite) binary sequences whose suffixes satisfy extremal conditions: one occurs when studying iterations of unimodal continuous maps from the unit interval into itself, but it also characterizes univoque real numbers; the other is a disguised version of the set of characteristic sturmian sequences. As a corollary to our study we obtain that a real number in is univoque and self-sturmian if and only if the -expansion of is of the form , where is a characteristic...
We compare two sets of (infinite) binary sequences whose suffixes satisfy
extremal conditions: one occurs when studying iterations of unimodal
continuous maps from the unit interval into itself, but it also characterizes
univoque real numbers; the other is a disguised version of the set of
characteristic Sturmian sequences. As a corollary to our study we obtain
that a real number β in (1,2) is univoque and self-Sturmian if and
only if the β-expansion of 1 is of the form 1v, where v is a
characteristic...
In order to approximate discrete-event systems in which there exist considerable states and events, David and Alla define a continuous Petri net (CPN). So far, CPNs have been a useful tool not only for approximating discrete-event systems but also for modelling continuous processes. Due to different ways of calculating instantaneous firing speeds of transitions, various continuous Petri net models, such as the CCPN (constant speed CPN), VCPN (variable speed CPN) and the ACPN (asymptotic CPN), have...
A major drawback of orthogonal frequency division multiplexing (OFDM) signals is the high value of peak to average power ratio (PAPR). Partial transmit sequences (PTS) is a popular PAPR reduction method with good PAPR reduction performance, but its search complexity is high. In this paper, in order to reduce PTS search complexity we propose a new technique based on biogeography-based optimization (BBO). More specifically, we present a new Generalized Oppositional Biogeography Based Optimization...
The research on the robust principal component analysis has been attracting much attention recently. Generally, the model assumes sparse noise and characterizes the error term by the -norm. However, the sparse noise has clustering effect in practice so using a certain -norm simply is not appropriate for modeling. In this paper, we propose a novel method based on sparse Bayesian learning principles and Markov random fields. The method is proved to be very effective for low-rank matrix recovery...
Currently displaying 341 –
360 of
924