نتایج جستجو برای: co farthest map

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

Journal: :Journal of animal science 2008
J P Grobbel M E Dikeman M C Hunt G A Milliken

Fresh meat color is a major factor influencing the purchase of meat products by consumers, whereas tenderness is the primary trait determining overall eating satisfaction of consumers. The objectives of this research were to determine the effects of packaging atmosphere on fresh beef color stability, cooked color, and tenderness. Longissimus lumborum muscles (n = 14 pairs) from USDA Select, A-m...

2017
Gregor Dolinar Bojan Kuzma Polona Oblak

It is shown that matrices over algebraically closed fields that are farthest apart in the commuting graph must be non-derogatory. Rank-one matrices and diagonalizable matrices are also characterized in terms of the commuting graph.

2012
GREGOR DOLINAR P. Oblak

It is shown that matrices over algebraically closed fields that are farthest apart in the commuting graph must be non-derogatory. Rank-one matrices and diagonalizable matrices are also characterized in terms of the commuting graph.

Journal: :American journal of physiology. Heart and circulatory physiology 2004
Ben J A Janssen Tijl De Celle Jacques J M Debets Agnieszka E Brouns Michael F Callahan Thomas L Smith

The aim of this study was to compare the systemic hemodynamic effects of four commonly used anesthetic regimens in mice that were chronically instrumented for direct and continuous measurements of cardiac output (CO). Mice (CD-1, Swiss, and C57BL6 strains) were instrumented with a transit-time flow probe placed around the ascending aorta for CO measurement. An arterial catheter was inserted int...

Journal: :iranian journal of mathematical chemistry 2013
h. s. ramane a. b. ganagi h. b. walikar

the wiener index w(g) of a connected graph g is defined as the sum of the distances betweenall unordered pairs of vertices of g. the eccentricity of a vertex v in g is the distance to avertex farthest from v. in this paper we obtain the wiener index of a graph in terms ofeccentricities. further we extend these results to the self-centered graphs.

The city of Tehran undergoes an increasing growth in population as well as industrial activities, both of which increase the concentration of air pollutants. The current research tries to turn a limited and focused system of air contamination measurement and control to an unlimited and extensive one that examines the concentration of each of the contaminants in any area of Tehran. Accordingly, ...

2013
S. Revathi

Clustering is the process of grouping of data, where the grouping is established by finding similarities between data based on their characteristics. Such groups are termed as Clusters. A comparative study of clustering algorithms across two different data items is performed here. The performance of the various clustering algorithms is compared based on the time taken to form the estimated clus...

2011
Aritra Banik Bhaswar B. Bhattacharya Sandip Das

Given a set S of n static points and a mobile point p in R, we study the variations of the smallest circle that encloses S ∪ {p} when p moves along a straight line `. In this work, a complete characterization of the locus of the center of the minimum enclosing circle (MEC) of S ∪{p}, for p ∈ `, is presented. The locus is a continuous and piecewise differentiable linear function, and each of its...

Journal: :EURASIP J. Adv. Sig. Proc. 2004
Reza Shahidi Cecilia Moloney Giovanni Ramponi

In an earlier paper, we briefly presented a new halftoning algorithm called farthest-point halftoning. In the present paper, this method is analyzed in detail, and a novel dispersion measure is defined to improve the simplicity and flexibility of the result. This new stochastic screen algorithm is loosely based on Kang’s dispersed-dot ordered dither halftone array construction technique used as...

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

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