One of the locations of renal artery atherosclerosis is at the orifice of the renal artery, therefore thestructure of this orifice was assessed in 6 normal, adult male dogs by light microscopy (LM) andtransmission electron microscopy (TEM). For the LM study, processed tissues were embedded in paraffinand sectioned serially into 6-μm thickness. Sections were stained with orcein. For the TEM stud...

We report x-ray absorption near edge spectroscopy (XANES) of Ca and O K-edges of Ba(1-x)Ca(x)TiO3 (x = 0, 0.01, 0.08, 1) and understand the spectral features related to the electronic structure of these perovskites. The XANES spectra of Ca K-edge possess a pre-edge peak similar to other 3d transition metals like Ti, Ni when present in perovskite structure and provides information about p-type o...

The 24-month results of the EVEREST II (Endovascular Valve Edge-to-Edge REpair Study), presented at the American College of Cardiology 2011 Scientific Sessions/i2 Summit and recently published (1), investigating the safety and efficacy of the MitraClip (Abbott Vascular, Santa Clara, California) device, validated the interest in percutaneous approaches to the treatment of mitral regurgitation (M...

We introduce overlap cluster graph modification problems where, other than in most previous work, the clusters of the target graph may overlap. More precisely, the studied graph problems ask for a minimum number of edge modifications such that the resulting graph consists of clusters (maximal cliques) that may overlap up to a certain amount specified by the overlap number s. In the case of s-ve...

An analysis is conducted on the robustness of measures of centrality in the face of random error in the network data. We use random networks of varying sizes and densities and subject them (separately) to four kinds of random error in varying amounts. The types of error are edge deletion, node deletion, edge addition, and node addition. The results show that the accuracy of centrality measures ...

The Internet Integrated Services (IIS) architecturee3] has a fundamental scaling problem in that per ow state is maintained at all routers and end-systems supporting a ow. This paper examines the use of aggregation as a technique to reduce the amount of state needed to provide IIS. In our approach, routers at the edge of a region doing aggregation keep detailed IIS state, while in the interior ...

let g be a (p,q) graph. an injective map f : e(g) → {±1,±2,...,±q} is said to be an edge pair sum labeling if the induced vertex function f*: v (g) → z - {0} defined by f*(v) = σp∈ev f (e) is one-one where ev denotes the set of edges in g that are incident with a vertex v and f*(v (g)) is either of the form {±k1,±k2,...,±kp/2} or {±k1,±k2,...,±k(p-1)/2} u {±k(p+1)/2} according a...

Let G be a 2-edge-connected undirected graph, A be an (additive) abelian group and 19 A∗ = A−{0}. A graph G is A-connected if G has an orientation D(G) such that for every 20 function b : V (G) → A satisfying Pv∈V (G) b(v) = 0, there is a function f : E(G) → A∗ 21 such that for each vertex v ∈ V (G), the total amount of f values on the edges directed 22 out from v minus the total amount of f va...

Let G be a 2-edge-connected undirected graph, A be an (additive) abelian group and A∗ = A−{0}. A graph G is A-connected if G has an orientation D(G) such that for every function b : V (G) 7→ A satisfying ∑ v∈V (G) b(v) = 0, there is a function f : E(G) 7→ A ∗ such that for each vertex v ∈ V (G), the total amount of f values on the edges directed out from v minus the total amount of f values on ...

Let G be a 2-edge-connected undirected graph, A be an (additive) abelian group and A∗=A−{0}. A graph G is A-connected if G has an orientation D(G) such that for every function b :V (G) →A satisfying ∑ v∈V (G)b(v )=0, there is a function f :E(G) →A∗ such that for each vertex v ∈V (G), the total amount of f values on the edges directed out from v minus the total amount of f values on the edges di...