BACKGROUND A three-dimensionally favourable mandibular bone crest is desirable to be able to successfully implant placement to meet the aesthetic and functional criteria in the implant-prosthetic rehabilitation. Several surgical procedures have been advocated for bone augmentation of the atrophic mandible, and the sandwich osteotomy is one of these techniques. The aim of the present case report...

This paper describes a new technique for the closure of oro-antral fistula/communication, in which both hard tissue (bone) and soft tissue closure is achieved. The sandwich technique utilizes a suitable bone grafting material sandwiched between two sheaths of Biogide (a resorbable membrane) for the hard tissue closure of oro-antral communication post traumatic exodontia. The bone grafting mater...

An experimental investigation was conducted to evaluate the dynamic performance of E-glass Vinyl Ester composite face sheet / foam core sandwich panels when subjected to pre-compression and subsequent blast loading. The sandwich panels were subjected to 0 kN, 15 kN and 25 kN of in plane compression respectively, prior to transverse blast wave loading with peak incident pressure of 1 MPa and vel...

The focus of this work was on designing a label-free DNA biosensor based on a super-sandwich assay using the electrochemical impedance spectroscopy technique. For this purpose, we designed a signal-up configuration whose linker probes could hybridize with two regions of the target DNA. In this configuration, the presented target DNA would effectively decrease the electron transfer, which would ...

Deciding whether a collection of unrooted trees is compatible is a fundamental problem in phylogenetics. Two different graph-theoretic characterizations of tree compatibility have recently been proposed. In one of these, tree compatibility is characterized in terms of the existence of a specific kind of triangulation in a structure known as the display graph. An alternative characterization exp...

The P4-sparse Graph Sandwich Problem asks, given two graphs G 1 = (V, E1) and G2 = (V, E2), whether there exists a graph G = (V, E) such that E1 ⊆ E ⊆ E2 and G is P4-sparse. In this paper we present a polynomial-time algorithm for solving the Graph Sandwich Problem for P4-sparse graphs. c © 2008 Elsevier B.V. All rights reserved.

In this paper we introduce the simultaneous membership problem, defined for any graph class C characterized in terms of representations, e.g. any class of intersection graphs. Two graphs G1 and G2, sharing some vertices X (and the corresponding induced edges), are said to be simultaneous members of graph class C, if there exist representations R1 and R2 of G1 and G2 that are “consistent” on X ....

A graph is a 1-join composition if its vertex set can be partitioned into four nonempty sets AL; AR ; SL and SR such that: every vertex of AL is adjacent to every vertex of AR; no vertex of SL is adjacent to vertex of AR∪SR; no vertex of SR is adjacent to a vertex of AL∪SL. The graph sandwich problem for 1-join composition is de9ned as follows: Given a vertex set V , a forced edge set E, and a ...

Introduction: The aim of the present study was to evaluate the effect of glass ceramic insert in the sandwich technique to reduce microleakage in class II composite resin restorations. Methods: Sixty sound human upper second premolars were selected and randomly divided into six groups (n=10). Class II boxonly cavities were prepared in distal aspects of each tooth with gingival margin located ap...