نتایج جستجو برای: m shadow graph
تعداد نتایج: 731331 فیلتر نتایج به سال:
The Visual Secret Sharing (VSS) scheme proposed by Naor and Shamir is a perfectly secure scheme to share a secret image. By using m sub pixels to represent one pixel, we encrypt the secret image into several noise-like shadow images. The value of m is known as the pixel expansion. More pixel expansion increases the shadow size and makes VSS schemes impractical for real application. In this pape...
it is necessary to generate the automorphism group of a chemical graph in computer-aidedstructure elucidation. an euclidean graph associated with a molecule is defined by a weightedgraph with adjacency matrix m = [dij], where for i≠j, dij is the euclidean distance between thenuclei i and j. in this matrix dii can be taken as zero if all the nuclei are equivalent. otherwise,one may introduce dif...
Edge colorings of r-uniform hypergraphs naturally define a multicoloring on the 2-shadow, i.e. on the pairs that are covered by hyperedges. We show that in any (r− 1)-coloring of the edges of an r-uniform hypergraph with n vertices and at least (1−2)(n r ) edges, the 2-shadow has a monochromatic matching covering all but at most o(n) vertices. This result implies that for any fixed r and suffic...
a graph is called textit{circulant} if it is a cayley graph on a cyclic group, i.e. its adjacency matrix is circulant. let $d$ be a set of positive, proper divisors of the integer $n>1$. the integral circulant graph $icg_{n}(d)$ has the vertex set $mathbb{z}_{n}$ and the edge set e$(icg_{n}(d))= {{a,b}; gcd(a-b,n)in d }$. let $n=p_{1}p_{2}cdots p_{k}m$, where $p_{1},p_{2},cdots,p_{k}$ are disti...
Interval volumes are a generalization of isosurfaces that represent the set of points between two surfaces. In this paper, we present a compact multi-resolution representation for interval volume meshes extracted from regularly sampled volume data sets. The multi-resolution model is a hierarchical tetrahedral mesh whose updates are based on the longest edge bisection (LEB) subdivision strategy ...
Effects of ATP and Mg2+ concentrations on bioluminescence reaction of luciferase (Photinus pyralis) were investigated by home-made luminometer. The Michaelis constants of the enzyme for ATP and Mg2+ obtained from the Lineweaver-Burk graph, were 61.9 mM ±3.3 mM and 251.6mM ± 39.0mM...
a concept related to the spectrum of a graph is that of energy. the energy e(g) of a graph g is equal to the sum of the absolute values of the eigenvalues of the adjacency matrix of g . the laplacian energy of a graph g is equal to the sum of distances of the laplacian eigenvalues of g and the average degree d(g) of g. in this paper we introduce the concept of laplacian energy of fuzzy graphs. ...
We consider the poset of all submatrices of a given matrix, ordered by containment. The unique rank function for this poset is given by r(M) = R(M)+C(M)?1, where R(M) and C(M) denote the number of rows and columns of a nonempty matrix M, respectively, and the rank of the empty matrix is 0. For xed k and i our objective is to nd a set M of submatrices M 1 ; M 2 ; : : :; M k such that r(M j) = i ...
The shadow algorithm is designed to perform compiled event-driven unit-delay simulations of asynchronous sequential circuits. It has been specifically designed to take advantage of the instruction caches that are present in many of the latest workstations. The underlying mechanism is a dynamically created linked-list of environments called shadows. Each environment invokes a short code-segment ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید