نتایج جستجو برای: track level irregularity
تعداد نتایج: 1139313 فیلتر نتایج به سال:
A simple graph G is said to be regular if its vertices have the same number of neighbors. Otherwise, id="M2"> nonregular. So far, various formulas, such as Albertson index, total and degree deviation, been introduced quantify irregularity a graph. In this paper, we present sharp lower bounds for these indices in terms or...
Ventricular Late Potentials (VLPs) are low-level highfrequency signals that are usually found within the terminal part of the QRS complex from patients after Myocardial Infarction. Patients with VLPs are at risk of developing Ventricular Tachycardia, which is the major cause of death of patients suffering from heart disease. In this study, the Continuous Wavelet Transform was used to detect VLP...
Ballast rheology is a phenomenon that describes movements of ballast particles due to the discrete nature, which eventually leads bed fluid deformation after long-time service. In most cases, main reason track irregularity some defects, e.g., hanging sleeper and mud spots. Therefore, it significant confirm mechanism, not only benefits for alleviating prolonging service providing safe transporta...
The response of a suspended cables subjected to narrow-band random excitations with two types of peaked P.S.D. is formulated and analyzed. Banach fixed-point theorem is used for eigenfunction analysis of the differential-integral equations of motion for the first time in this paper. Fredholm approach also is used in the free vibration analysis of the suspended cable and then using Galerkin mode...
A hypergraph is k-irregular if there is no set of k vertices all of which have the same degree. We asymptotically determine the probability that a random uniform hypergraph is k-irregular.
Let G = (V,E), V = {1,2, . . . ,n}, be a simple graph without isolated vertices, with vertex degree sequence d1 ≥ d2 ≥ ·· · ≥ dn > 0, di = d(i). A graph G is regular if and only if d1 = d2 = · · · = dn. A graph invariant I(G) is measure of irregularity of graph G with the property I(G) = 0 if and only ifG is regular, and I(G)> 0 otherwise. In this paper we introduce some new irregularity measures.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید