نتایج جستجو برای: شاخص irregularity
تعداد نتایج: 78557 فیلتر نتایج به سال:
This paper examines one key feature of intra-regional migration in Asia: irregularity, and it does so beyond the typical focus on irregular entry by highlighting ‘irregularity regularity’, that is irregularity as result extremely rigidly designed legal pathways for migration. Our analysis, thus, focuses wider policy infrastructure centres upon securitisation managerialism, with a high incidence...
For a simple, undirected graph G with, at most one isolated vertex and no edges, labeling f:E(G)→{1,2,…,k1} of positive integers to the edges is called irregular if weights each has different value. The integer k1 then irregularity strength G. If number vertices in or order |G|, μ:E(G)→{1,2,…,k2} modular remainder divided by |G| k2 disjoint union two more graphs, denoted ‘+’, an operation where...
PURPOSE To investigate the changes in irregular and regular corneal astigmatism with age in eyes that underwent cataract surgery (surgery group) and in eyes that did not undergo surgery (nonsurgery group). METHODS We enrolled 120 eyes in each of four age groups in the surgery and nonsurgery groups: (1) 50 to 59 years of age, (2) 60 to 69 years of age, (3) 70 to 79 years of age, and (4) older ...
BACKGROUND Menstrual irregularity is an indicator of endocrine disorders and reproductive health status. It is associated with various diseases and medical conditions, including obesity and underweight. We aimed to assess the association between body weight changes and menstrual irregularity in Korean women. METHODS A total of 4,621 women 19 to 54 years of age who participated in the 2010 to ...
A closed walk in a connected graph G that contains every edge of G exactly once is an Eulerian circuit. A graph is Eulerian if it contains an Eulerian circuit. It is well known that a connected graph G is Eulerian if and only if every vertex of G is even. An Eulerian walk in a connected graph G is a closed walk that contains every edge of G at least once, while an irregular Eulerian walk in G i...
I construct normal del Pezzo surfaces, and regular weak del Pezzo surfaces as well, with positive irregularity q > 0. Such things can happen only over nonperfect fields. The surfaces in question are twisted forms of nonnormal del Pezzo surfaces, which were classified by Reid. The twisting is with respect to the flat topology and infinitesimal group scheme actions. The twisted surfaces appear as...
A vertex irregular total k-labeling of a graph G with vertex set V and edge set E is an assignment of positive integer labels {1, 2, ..., k} to both vertices and edges so that the weights calculated at vertices are distinct. The total vertex irregularity strength of G, denoted by tvs(G)is the minimum value of the largest label k over all such irregular assignment. In this paper, we study the to...
congestive heart failure (chf) remains to be one of the major cardiovascular disorders in the world. due to the prevalence of chf related issues, it is prudent to seek out new prognostic predictors that would facilitate the prevention, monitoring, and treatment of the disease on a daily basis. a detection approach using entropy measures extracted from surface electrocardiograms (ecgs) and class...
High irregularity of Iris tissue is the main reason of its usage in identification systems. In some literatures, this irregularity has been known as a result of a stochastic genetic process. In this paper an efficient method based on the Poincaré section and modified version of fractal dimension is used. In fact, this method is introduced a pattern for decision making about series specification...
Let G be a simple graph with no isolated edges and at most one isolated vertex. For a positive integer w, a w-weighting of G is a map f : E(G) → {1, 2, . . . , w}. An irregularity strength of G, s(G), is the smallest w such that there is a w-weighting of G for which ∑
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید