The embellishments of makam music in Turkey are an inherent characteristic of the music rather than a separate expressive resource, thus their understanding is essential to characterize this music. We do a computational study, in which we analyze audio recordings of 8 widely acknowledged Turkish ney players covering the period from the year 1920 to 2000. From the extracted fundamental frequency...

For xed positive integers r, k and ` with ` < r, and an r-uniform hypergraph H, let κ(H, k, `) denote the number of k-colorings of the set of hyperedges of H for which any two hyperedges in the same color class intersect in at least ` vertices. Consider the function KC(n, r, k, `) = maxH∈Hn κ(H, k, `), where the maximum runs over the family Hn of all r-uniform hypergraphs on n vertices. In this...

For a binary code of length v, a v-word w produces by a set of codewords {w, . . . , w} ✓ if for all i = 1, . . . , v, we have wi 2 {w i , . . . , w i }. We call a code r-secure frameproof of size t if | | = t and for any v-word that is produced by two sets C1 and C2 of size at most r, then the intersection of these sets is non-empty. A d-biclique cover of size v of a graph G is a collection of...

A commonly used paradigm for representing graphs is to use a vector that contains normalized frequencies of occurrence of certain motifs or sub-graphs. This vector representation can be used in a variety of applications, such as, for computing similarity between graphs. The graphlet kernel of Shervashidze et al. [32] uses induced sub-graphs of k nodes (christened as graphlets by Przulj [28]) as...

Language Model smoothing is an imperative technology which deals with unseen test data by re-evaluating some zero-probability n-grams and assign them bare minimum non-zero values. There is an assortment of smoothing techniques employed to trim down tiny amount of probability from the probable grams and share out to zero probable grams within a Language Model. Kneser Ney and Latent Dirichlet All...

At every point, a smooth plane curve can be approximated, to second order, by a circle; this circle is called osculating. One may think of the osculating circle as passing through three infinitesimally close points of the curve. A vertex of the curve is a point at which the osculating circle hyper-osculates: it approximates the curve to third order. Equivalently, a vertex is a critical point of...

We investigate the proof complexity of a class of propositional formulas expressing a combinatorial principle known as the KneserLovász Theorem. This is a family of propositional tautologies, indexed by an nonnegative integer parameter k that generalizes the Pigeonhole Principle (obtained for k = 1). We show, for all fixed k, 2Ω(n) lower bounds on resolution complexity and exponential lower bou...