background: the advantages of coated orthodontic wires such as esthetic and their effectson reduced friction, corrosion and allergic reaction and the signifi cant consequences of plaque accumulation on oral health encouraged us to assess bacterial colonization on these wires. materials and methods: a total of 18 (9 upper and 9 lower) epoxy resin coated 16 × 22 nickeltitanium wires (spectra, gac...

Abstract The set‐coloring Ramsey number is defined to be the minimum such that if each edge of complete graph assigned a set colors from , then one contains monochromatic clique size . case usual ‐color number, and was studied by Erdős, Hajnal Rado in 1965, Erdős Szemerédi 1972. first significant results for general were obtained only recently, Conlon, Fox, He, Mubayi, Suk Verstraëte, who showe...

We obtain a number of lower bounds on the running time of algorithms solving problems on graphs of bounded treewidth. We prove the results under the Strong Exponential Time Hypothesis of Impagliazzo and Paturi. In particular, assuming that SAT cannot be solved in (2−ǫ)m time, we show that for any ǫ > 0; • INDEPENDENT SET cannot be solved in (2 − ǫ)tw(G)|V (G)| time, • DOMINATING SET cannot be s...

We use the generalization of the Laplacian matrix to hypergraphs to obtain several spectral-like results on partition problems in hypergraphs which are computationally difficult to solve (NP-hard or NP-complete). Therefore it is very important to obtain nontrivial bounds. More precisely, the following parameters are bounded in the paper: bipartition width, averaged minimal cut, isoperimetric nu...

Given a graph G = (V,E), let P be a partition of V . We say that P is dominating if, for each part P of P, the set V \ P is a dominating set in G (equivalently, if every vertex has a neighbour of a different colour from its own). We say that P is acyclic if for any parts P, P ′ of P, the bipartite subgraph G[P, P ′] consisting of the edges between P and P ′ in P contains no cycles. The acyclic ...

A cutset in the poset 2, of subsets of {1, . . . , n} ordered by inclusion, is a subset of 2 that intersects every maximal chain. Let 0 ≤ α ≤ 1 be a real number. Is it possible to find a cutset in 2 that, for each 0 ≤ i ≤ n, contains at most α ( n i ) subsets of size i? Let α(n) be the greatest lower bound of all real numbers for which the answer is positive. In this note we prove the rather su...

(This paper is an extended abstract for an invited talk at 29th Linz Seminar on Fuzzy Set Theory, February 2008.) Höhle has shown that fuzzy sets, valued in a frame (complete Heyting algebra) Ω, can be identified with certain sheaves over Ω: they are the subsheaves of constant sheaves, and more general sheaves can be got as quotients of the fuzzy sets. The technical development is complicated b...

The aim of this paper is to develop an effective method for solving matrix games with payoffs of triangular fuzzy numbers (TFNs) which are arbitrary. In this method, it always assures that players’ gain-floor and loss-ceiling have a common TFN-type fuzzy value and hereby any matrix game with payoffs of TFNs has a TFN-type fuzzy value. Based on duality theorem of linear programming (LP) and the ...

We supplement WordNet entries with information on the subjectivity of its word senses. Supervised classifiers that operate on word sense definitions in the same way that text classifiers operate on web or newspaper texts need large amounts of training data. The resulting data sparseness problem is aggravated by the fact that dictionary definitions are very short. We propose a semi-supervised mi...