The purpose of the present study is to evaluate the fracture load of composite-based repairs to fractured zirconium oxide (Z) crowns and to ceramic-fused-to-metal (CM) crowns, comparing different mechanical surface preparation methods. A total of 75 crowns were repaired; samples then underwent dynamic loading and thermocycling. Final fracture load values for failure of the repaired crowns were ...

In this paper, three types of (philosophical, optimistic and pessimistic) multigranulation single valued neutrosophic (SVN) covering-based rough set models are presented, and these three models are applied to the problem of multi-criteria group decision making (MCGDM).Firstly, a type of SVN covering-based rough set model is proposed.Based on this rough set model, three types of mult...

An outer-independent double Italian dominating function (OIDIDF)on a graph $G$ with vertex set $V(G)$ is a function$f:V(G)longrightarrow {0,1,2,3}$ such that if $f(v)in{0,1}$ for a vertex $vin V(G)$ then $sum_{uin N[v]}f(u)geq3$,and the set $ {uin V(G)|f(u)=0}$ is independent. The weight ofan OIDIDF $f$ is the value $w(f)=sum_{vin V(G)}f(v)$. Theminimum weight of an OIDIDF on a graph $G$ is cal...

A bstract The classical bicovering problem seeks to cover all pairs from a v-set by a family F of k-sets so that every pair occurs at least twice and the cardinality of F is minimaL A weight function is introduced for blocks in such a design, and its use in constructing bicoverings is illustrated. A covering is a collection of k-sets (blocks) chosen from elements of a v-set so that each pair fr...

A covering array of size N, degree k, order v and strength t is a k N array with entries from a set of v symbols such that in any t N subarray every t 1 column occurs at least once. Covering arrays have been studied for their applications to drug screening and software testing. We present explicit constructions and give constructive upper bounds for the size of a covering array of strength three.

A covering array CA(N ; t, k, v) is an N × k array such that every N × t sub-array contains all t-tuples from v symbols at least once, where t is the strength of the array. Covering arrays are used to generate software test suites to cover all t-sets of component interactions. Recursive constructions for covering arrays of strengths 3 and 4 are developed, generalizing many “Rouxtype” constructi...

Let S̃p(q,R) be the universal covering of the symplectic group. In this paper, we study the unitarity problem for the representation induced from a one dimensional character ( , v) of G̃L(q − p) tensoring with a unitary representation σ0 of a smaller S̃p(p,R). We establish the unitarity when the real character v is in a certain interval depending on and σ0 satisfies a certain growth condition. We ...