This study examined the average surface roughness (Ra, microm) of 2 microfilled (Durafill and Perfection), 1 hybrid (Filtek Z250) and 2 packable composite resins (Surefil and Fill Magic), before (baseline) and after eight different finishing and polishing treatments. The surface roughness was assessed using a profilometer. Ten specimens of each composite resin were randomly subjected to one of ...

Amyotrophic lateral sclerosis (ALS) is a fatal neurological disease characterized by the degeneration of the motor neurons. We tested whether treatment of superoxide dismutase (SOD1)-G93A transgenic mouse, a model of ALS, with a neural stem cell subpopulation double positive for Lewis X and the chemokine receptor CXCR4 (LeX+CXCR4+) can modify the disease's progression. In vitro, after exposure ...

Let A = K[x1, . . . , xn] denote the polynomial ring in n variables over a field K of characteristic 0 with each deg xi = 1. Given arbitrary integers i and j with 2 ≤ i ≤ n and 3 ≤ j ≤ n, we will construct a monomial ideal I ⊂ A such that (i) βk(I) < βk(Gin(I)) for all k < i, (ii) βi(I) = βi(Gin(I)), (iii) βl(Gin(I)) < βl(Lex(I)) for all l < j and (iv) βj(Gin(I)) = βj(Lex(I)), where Gin(I) is t...

A short new proof of the fact that all shifted complexes are fixed by reverse lexicographic shifting is given. A notion of lexicographic shifting, ∆lex — an operation that transforms a monomial ideal of S = k[xi : i ∈ N] that is finitely generated in each degree into a squarefree strongly stable ideal — is defined and studied. It is proved that (in contrast to the reverse lexicographic case) a ...

We study the problem of minimal triangulation of graphs. One of the first algorithms to solve this problem is Lex M, which was presented in 1976. A new algorithm, and a simplification of Lex M, called MCS-M was presented in 2002. In this paper we compare these two algorithms and show that they produce the same set of chordal graphs, answering an open question mentioned by the authors of MCS-M.

We generalize a well-known algorithm for the generation of all subsets of a set in lexicographic order with respect to the sets as lists of elements (subset-lex order). We obtain algorithms for various combinatorial objects such as the subsets of a multiset, compositions and partitions represented as lists of parts, and for certain restricted growth strings. The algorithms are often loopless an...

In this paper we applied multilabel classification algorithms to the EUR-Lex database of legal documents of the European Union. On this document collection, we studied three different multilabel classification problems, the largest being the categorization into the EUROVOC concept hierarchy with almost 4000 classes. We evaluated three algorithms: (i) the binary relevance approach which independ...

AIMS AND OBJECTIVES Satisfactory composite restoration depends upon its smooth finish, quality of polishing agents, type of composite material used, and its composition. The present study evaluated the effect of different polishing systems on the surface roughness of composite resin. MATERIALS AND METHODS Forty discs of composite were prepared and equally subjected to different finishing and ...

Let A = K[x1, . . . , xn] denote the polynomial ring in n variables over a field K of characteristic 0 with each deg xi = 1. Given arbitrary integers i and j with 2 ≤ i ≤ n and 3 ≤ j ≤ n, we will construct a monomial ideal I ⊂ A such that (i) βk(I) < βk(Gin(I)) for all k < i, (ii) βi(I) = βi(Gin(I)), (iii) βl(Gin(I)) < βl(Lex(I)) for all l < j and (iv) βj(Gin(I)) = βj(Lex(I)), where Gin(I) is t...