An initiative conflict is an overlap of speech in which both conversants try to steer the conversation in different directions. In this paper, we investigate how conversants in human-human dialogue deal with such conflicts. First, in investigating why initiative conflicts occur, we find that the offsets of the utterances involved in initiative conflicts tend to be very short, and that initiativ...

where ρ ≥ 1 is a mass parameter corresponding to a bare fermion mass mb = m(ρ − 1), and Q is the hermitian Wilson operator with a negative mass parameter −m. Note that γ5 sign(Q) is unitary. We can also define a hermitian overlap operator Dh = γ5Du. Both operators are normal, i.e. they commute with their adjoints. We will approximate the matrix sign function using the Zolotarev partial fraction...

Comparison of 3-dimensional protein folds is a core problem in molecular biology. The Contact Map Overlap (CMO) scheme provides one of the most common measures for protein structure similarity. Maximizing CMO is, however, NP-hard. To approximately solve CMO, we combine softassign and dynamic programming. Softassign approximately solves the maximum common subgraph (MCS) problem. Dynamic programm...

Packing problems arise in a wide variety of application areas. The basic problem is that of determining an efficient arrangement of different objects in a region without any overlap. The simplest packing problem is rectangular packing, where both the objects and the region are rectangular. Many research works have been done on two and three dimensional rectangular packing. However there are man...

10 We prove that there exist infinitely many infinite overlap-free binary partial words. 11 Moreover, we show that these words can contain only one hole and the hole must 12 occur either in the first or in the second position. We define that a partial word is 13 k-overlap-free if it does not contain a factor of the form xyxyx where the length 14 of x is at least k. We prove that there exist inf...

Being able to respond appropriately to users’ overlaps should be seen as one of the core competencies of incremental dialogue systems. At the same time identifying whether an interlocutor wants to support or grab the turn is a task which comes naturally to humans, but has not yet been implemented in such systems. Motivated by this we first investigate whether prosodic characteristics of speech ...

In this paper we demonstrate that two common problems in Machine Learning—imbalanced and overlapping data distributions—do not have independent effects on the performance of SVM classifiers. This result is notable since it shows that a model of either of these factors must account for the presence of the other. Our study of the relationship between these problems has lead to the discovery of a ...

We prove that a morphism h over a two-letter alphabet {a, b} is overlap-free, i.e., maps overlap-free words into overlap-free words, iff the word h(abbabaab) is overlap-free. As a consequence, we obtain a simple proof of the fact that the only infinite overlap-free words that can be obtained by iterating a morphism are the Thue-Morse sequence and its opposite. RLsumP Nous prouvons qu’un morphis...

In the previous two chapters we have assumed our systems to be ideal without any interchannel interference. In this chapter we analyze the effects of interchannel interference on the performance of the receiver. The model assumed is that of rectangular spectra with spacing of channels less than channel width so that there is some overlap. It is shown that some overlap in the system is acceptabl...

When representing 2D data points with spacious objects such as labels, overlap can occur. We present a simple algorithm which modifies the (Mani-)Wordle idea with scan-line based techniques to allow a better placement. We give an introduction to common placement techniques from different fields and compare our method to these techniques w.r.t. euclidean displacement, changes in orthogonal order...