In this paper the principle of fractal theory and fractal Brownian motion (FBM) are analyzed in detail. The Diamond-Square algorithm is introduced. And it introduces the process of generating three dimensional terrain, cloud and sky by this algorithm. There also analyses the physical meaning of FBM’s two parameters H and σ . Through the analysis of the effect of different parameters, there is p...

diamond like carbon (dlc) film was grown by hot filament chemical vapor deposition (hfcvd)technique. in the present work, we investigated the quality of the dlc films groew on the substratesthat were coated with various metal nanocatalysts (au and ni). a combination of ch4/ar/h2 rendersthe growth of carbon nanostructures technique (diamond like carbon). the utilized samples werecharacterized by...

Given an undirected and vertex weighted graph G = (V,E,w), the Weighted Feedback Vertex Problem (WFVP) consists of 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 and to be polynomially solvable on some special classes of graphs (e.g., interval graphs, co-comparability graphs, di...

Rhombellanes are mathematical structures existing in various environments, in crystal or quasicrystal networks, or even in their homeomorphs, further possible becoming real molecules. Rhombellanes originate in the K2.3 complete bipartite graph, a tile found in the linear polymeric staffanes. In close analogy, a rod-like polymer derived from hexahydroxy-cyclohexane was imagined. Further, the ide...

The Diamond storage architecture enables efficient interactive search of unindexed data by supporting the execution of application-specific filter binaries directly at storage devices. This functionality allows irrelevant objects to be discarded at the early stages of the search pipeline, thereby reducing the load on the interconnect and the user’s workstation. In order to achieve efficient use...

We consider online routing algorithms for finding paths between the vertices of plane graphs. Although it has been shown in Bose et al. [4] that there exists no competitive routing scheme that works on all triangulations, we show that there exists a simple online O(1)-memory c-competitive routing strategy that approximates the shortest path in triangulations possessing the diamond property, i.e...

We give a bijective proof of the Aztec diamond theorem, stating that there are 2n(n+1)/2 domino tilings of the Aztec diamond of order n. The proof in fact establishes a similar result for non-intersecting families of n+ 1 Schröder paths, with horizontal, diagonal or vertical steps, linking the grid points of two adjacent sides of an n× n square grid; these families are well known to be in bijec...

In this work, we used the depth resolution function (DRF) of the secondary ion mass spectrometry (SIMS) to deconvolve the boron depth profile of nanometer-thin embedded diamond layers. Thanks to an isotopic change within a thin layer, where carbon-12 (C) and carbon-13 (C) are substituted, the DRF was evaluated by a self-consistent algorithm. In a second step, this DRF was used to deconvolve the...

In this paper, we propose a fast motion estimation algorithm that is suitable for searching both center-biased motion and large motion by applying the small diamond pattern used in some block-matching algorithms (BMA). The search will be terminated by a small diamond search (SDS) method after performing a large search based on a modified three-step search (3SS) strategy. The results of the expe...