Ultraprecision diamond turning is an established technique, mainly used for the fabrication of free form optics and mechanical components. By the use of Piezo ceramics as servo actuator, this technique offers cutting depth modulations with accuracies suitable for the fabrication of relief holograms [?]. In a previous work, a first approach for the design of diamond turned holograms (DTH) was pr...

As a step towards resolving the genesis of inclusions in diamonds, a new technique is presented. This technique combines cathodoluminescence (CL) and electron backscatter diffraction (EBSD) using a focused ion beam– scanning electron microscope (FIB–SEM) instrument with the aim of determining, in detail, the three-dimensional diamond zonation adjacent to a diamond inclusion. EBSD reveals that m...

A closed system hot filament chemical vapor deposition (CVD) reactor has been used to deposit diamond films on silicon substrates. A fixed charge of hydrogen gas is fed into the deposition system until the desired deposition pressure level is reached. A solid graphite cylindrical rod held above the tungsten filament was the carbon source. System parameters for diamond film growth have been dete...

Use of Diamond for electronic applications was started for development of photoconductive detectors. However limitations in size and control of properties naturally limited the use of Diamond to a few specialty applications. With the development of Diamond synthesis from vapour phase has come a more serious interest in developing diamond based electronic devices. Diamond (band gap energy = 5. 6...

Irena Rusu Universit e d'Orl eans, L.I.F.O., B.P. 6759, 45067 Orl eans Cedex 2, France Abstract Everett et al. [2] conjectured that a graph with no odd hole and no stretcher is perfectly contractile, i.e. it can be reduced to a clique by successively contracting even pairs. We show that this conjecture is true for diamond-free graphs, and propose a polynomial algorithm to perform the successive...

Given an undirected and vertex weighted graph G, the Weighted Feedback Vertex Problem (WFVP) consists in finding a subset F ⊆ V of vertices of minimum weight such that each cycle in G contains at least one vertex in F . The WFVP on general graphs is known to be NP-hard. In this paper we introduce a new class of graphs, namely the diamond graphs, and give a linear time algorithm to

A new method is used to generate threedimensional terrain maps from discrete points in this paper. The process of generating terrain generates triangulation using the discrete points, by interpolation to calculate the elevation data of regular grid, with the Diamond-Square algorithm in fractal theory to further refine the grid data. The results of programming experiments show that realistic ter...

We study the asymptotic behavior of a class of stochastic dynamics on interlacing particle configurations (also known as Gelfand-Tsetlin patterns). Examples of such dynamics include, in particular, a multilayer extension of TASEP and particle dynamics related to the shuffling algorithm for domino tilings of the Aztec diamond. We prove that the process of reflected interlacing Brownian motions i...

We define a new monoidal category on collections (shuffle composition). Monoids in this category (shuffle operads) turn out to bring a new insight in the theory of symmetric operads. For this category, we develop the machinery of Gröbner bases for operads, and present operadic versions of Bergman’s Diamond Lemma and Buchberger’s algorithm. This machinery can be applied to study symmetric operad...

Based on real-world image sequence characteristics of center-biased motion vector distribution, a Hexagonal (HS) algorithm with center-biased checking point pattern for fast block motion estimation is proposed. The HS is compared with full search (FS), four-step search (4SS), new three-step search (NTSS), and recently proposed diamond search (DS) methods. Experimental results show that the prop...