let g=(v,e) be a simple graph. an edge labeling f:e to {0,1} induces a vertex labeling f^+:v to z_2 defined by $f^+(v)equiv sumlimits_{uvin e} f(uv)pmod{2}$ for each $v in v$, where z_2={0,1} is the additive group of order 2. for $iin{0,1}$, let e_f(i)=|f^{-1}(i)| and v_f(i)=|(f^+)^{-1}(i)|. a labeling f is called edge-friendly if $|e_f(1)-e_f(0)|le 1$. i_f(g)=v_f(1)-v_f(0) is called the edge-f...

In this paper we define a new labeling called skolem odd difference mean labeling and investigate skolem odd difference meanness of some standard graphs. Let G = (V,E) be a graph with p vertices and q edges. G is said be skolem odd difference mean if there exists a function f : V (G) → {0, 1, 2, 3, . . . , p + 3q − 3} satisfying f is 1−1 and the induced map f : E(G) → {1, 3, 5, . . . , 2q−1} de...

This paper proposes a new first-scan method for two-scan labeling algorithms. In the first scan, our proposed method first scans every fourth image line, and processes the scan line and its two neighbor lines. Then, it processes the remaining lines from top to bottom one by one. Our method decreases the average number of times that must be checked to process a foreground pixel will; thus, the e...

We report a novel computer method for automatic labeling of structures in 3D MRI data sets using expert anatomical knowledge that is coded in fuzzy sets and fuzzy rules. The method first identifies major structures and then uses spatial relationships to these landmarks to recognize other structures. This labeling process simulates the iterative process that we ourselves use to locate structures...

In this application note, we describe a novel method to rapidly measure the size and concentration of Adeno-Associated Virus (AAV) utilizing the Nanoparticle Tracking Analysis (NTA) technique and a gold labeling method. By labeling AAV capsids with small gold nanoparticles, we were able to increase the amount of light scattered by each capsid, enabling rapid NTA characterization to determine th...

A NEW APPROACH TO SEARCH RESULT CLUSTERING AND LABELING Anıl Türel M.S. in Computer Engineering Supervisor: Prof. Dr. Fazlı Can August, 2011 Search engines present query results as a long ordered list of web snippets divided into several pages. Post-processing of information retrieval results for easier access to the desired information is an important research problem. A post-processing techni...

a graceful labeling of a graph g of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of g, such that when each edge of g has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. if a graceful labeling f of a bipartite graph g assigns the smaller labels to one of the two stable sets of g, then f...