Even though research has shown that the spectral parameters of yellow-edge, red-edge and NIR (near-infrared) shoulder wavelength regions are able to estimate green cover leaf area index (LAI), a large amount dead materials in grasslands challenges accuracy their estimation using hyperspectral remote sensing. However, exact impact vegetation on these remains unclear. Therefore, we evaluated infl...

The study shows that leaf area index (LAI) and canopy chlorophyll content can be mapped in a heterogeneous Mediterranean grassland from canopy spectral reflectance measurements. Canopy spectral measurements were made in the field using a GER 3700 spectroradiometer, along with concomitant in situ measurements of LAI and chlorophyll content. We tested the utility of univariate techniques, involvi...

The goal of this study was to evaluate the reliability among transcribers of a standard prosodic labeling system under relatively optimal conditions of training, supervision, facilities, procedures, and extent of speaker familiarity. The ToBI (Tones and Break Indices) model for standard American English[7][1] was used in the study; break indices indicate the degree of junction between words, pi...

The second and third geometric-arithmetic indices GA2(G) and GA3(G) of a graph G are defined, respectively, as ∑ uv∈E(G) √ nu(e,G)nv(e,G) 1 2 [nu(e,G)+nv(e,G)] and ∑ uv∈E(G) √ mu(e,G)mv(e,G) 1 2 [mu(e,G)+mv(e,G)] , where e = uv is one edge in G, nu(e,G) denotes the number of vertices in G lying closer to u than to v andmu(e,G) denotes the number of edges in G lying closer to u than to v. The Sz...

Many existing degree based topological indices can be clasified as bond incident degree (BID) indices, whose general form is BID(G) = ∑ uv∈E(G) Ψ(du, dv), where uv is the edge connecting the vertices u, v of the graph G, E(G) is the edge set of G, du is the degree of the vertex u and Ψ is a non-negative real valued (symmetric) function of du and dv. Here, it has been proven that if the extensio...

The edge Szeged index of a connected graph G is defined as the sum of products mu(e|G)mv(e|G) over all edges e = uv of G, where mu(e|G) is the number of edges whose distance to vertex u is smaller than the distance to vertex v, and mv(e|G) is the number of edges whose distance to vertex v is smaller than the distance to vertex u. In this paper, we determine the n-vertex unicyclic graphs with th...

For a (molecular) graph, the hyper Zagreb index is defined as HM(G) = ∑ uv∈E(G) (dG(u) + dG(v)) 2 and the hyper Zagreb coindex is defined asHM(G) = ∑ uv/ ∈E(G) (dG(u)+dG(v)) 2. In this paper, the hyper Zagreb indices and its coindices of edge corona product graph, double graph and Mycielskian graph are obtained.

abstract let ‎g=(v,e) ‎be a‎ ‎simple ‎connected ‎graph ‎with ‎vertex ‎set ‎v‎‎‎ ‎and ‎edge ‎set ‎‎‎e. ‎the szeged index ‎of ‎‎g is defined by ‎ where ‎ respectively ‎ ‎ is the number of vertices of ‎g ‎closer to ‎u‎ (‎‎respectively v)‎ ‎‎than ‎‎‎v (‎‎respectively u‎).‎ ‎‎if ‎‎‎‎s ‎is a‎ ‎set ‎of ‎size‎ ‎ ‎ ‎let ‎‎v ‎be ‎the ‎set ‎of ‎all ‎subsets ‎of ‎‎s ‎of ‎size ‎3. ‎then ‎we ‎define ‎three ‎...

We give a new short proof of Koren’s characterization of graphic lists, extended to multigraphs with bounded multiplicity p, called p-graphs. The Edge-Count Criterion (ECC) for an integer n-tuple d and integer p is the statement that for all disjoint sets I and J of indices, ∑

The aim of this study was to evaluate the cultivation potential of cartilage taken from the debrided edge of a chronic lesion of the articular surface. A total of 14 patients underwent arthroscopy of the knee for a chronic lesion on the femoral condyles or trochlea. In addition to the routine cartilage biopsy, a second biopsy of cartilage was taken from the edge of the lesion. The cells isolate...