نتایج جستجو برای: full edge

تعداد نتایج: 404805  

2014
Chen Li Yelong Wu Andrew R. Lupini Naba Paudel Yanfa Yan Stephen J. Pennycook

The migration of dislocations affects many material properties including deformation, plasticity and electronic properties. In order to understand the mechanism of the motion of dislocations, both experimental and theoretical studies have been performed [1]. It is known that full dislocations such as edge or screw dislocations can dissociate into Shockley partial dislocations, which have higher...

2012
Shruti Suman

This paper presents the ring oscillator based temperature sensor. The method is highly area efficient, simple and easy for IC implementation as compared to traditional temperature sensors. The proposed temperature sensor was fabricated using 0.35 μm technology, which occupies extremely small silicon area. It exploits the frequency of the ring oscillator that is proportional to temperature, whic...

Journal: :Comp.-Aided Civil and Infrastruct. Engineering 2014
Michael O'Byrne Bidisha Ghosh Franck Schoefs Vikram Pakrashi

Imaging-based damage detection techniques are increasingly being utilized alongside traditional visual inspection methods to provide owners/operators of infrastructure with an efficient source of quantitative information for ensuring their continued safe and economic operation. However, there exists scope for significant development of improved damage detection algorithms that can characterize ...

Journal: :Comput. Graph. Forum 2011
Josiah Manson Scott Schaefer

We propose a method for calculating deformations of models by deforming a low-resolution mesh and adding details while ensuring that the details we add satisfy a set of constraints. Our method builds a low-resolution representation of a mesh by using edge collapses and performs an as-rigid-as-possible deformation on the simplified mesh. We then add back details by reversing edge-collapses so th...

Let $G$ be a simple graph of order $n$ and size $m$.The edge covering of $G$ is a set of edges such that every vertex of $G$ is incident to at least one edge of the set. The edge cover polynomial of $G$ is the polynomial$E(G,x)=sum_{i=rho(G)}^{m} e(G,i) x^{i}$,where $e(G,i)$ is the number of edge coverings of $G$ of size $i$, and$rho(G)$ is the edge covering number of $G$. In this paper we stud...

2014
E. Sree Devi B. Anand

Covering sensor surface with a Color Filter Array (CFA) and enabling a sensor pixel sample only one of three primary color values, is how single sensor digital cameras capture imagery. An interpolation process, called CFA demosaicking estimates other two missing color values at every pixel to render a full color image. This study presents two contributions to CFA demosaicking: a new and improve...

Journal: :Discrete & Computational Geometry 1998
L. Sadun

We introduce a new family of nonperiodic tilings, based on a substitution rule that generalizes the pinwheel tiling of Conway and Radin. In each tiling the tiles are similar to a single triangular prototile. In a countable number of cases, the tiles appear in a finite number of sizes and an infinite number of orientations. These tilings generally do not meet full-edge to full-edge, but can be f...

Journal: :IACR Cryptology ePrint Archive 2009
Yusuke Naito Kazuki Yoneyama Lei Wang Kazuo Ohta

In this paper, we show that major cryptosystems such as FDH, OAEP, and RSA-KEM are secure under a hash function MD with Merkle-Damg̊ard (MD) construction that uses a random oracle compression function h. First, we propose two new ideal primitives called Traceable Random Oracle (T RO) and Extension Attack Simulatable Random Oracle (ERO) which are weaker than a random oracle (RO). Second, we show ...

Journal: :iranian journal of mathematical chemistry 2014
janez zerovnik darja rupnik poklukar

one of the generalizations of the wiener number to weighted graphs is to assign probabilities to edges, meaning that in nonstatic conditions the edge is present only with some probability. the reliability wiener number is defined as the sum of reliabilities among pairs of vertices, where the reliability of a pair is the reliability of the most reliable path. closed expressions are derived for t...

1998
D. Sinclair

This paper gives details of a series of low level image processing routines which successfully break an image into a set of coloured regions. The first stage in the process is multi-scale edge detection. A fixed set of different sized kernels are used with the results being put into a single ’edgeness’ image. A fixed lower threshold is applied to the edgeness image. A non-maximum suppression st...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید