نتایج جستجو برای: regular and irregular plans

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

Journal: :Japanese journal of mathematics. New series 1980

Journal: :poultry science journal 2013
ahammad mu okamoto s kawamoto y nakada t

the aim of this study was to examine whether the secreted fluid from the uterus influences the survival and fertilization capacity of fowl sperm in the hen oviduct. hens with either regular uterine fluid secretion or irregular uterine fluid secretion were artificially inseminated through the transfer of sperm into the uterus. twenty-four hours after  artificial insemination, 3 hens with regular...

Journal: :Computational Statistics & Data Analysis 2010

One of the most important tools to reduce traffic violations and consequently the number of accidents in the country is to penalize the offenders. In Iran, double penalty is approved for delaying in payment of a fine, but it is possible that a significant number of offenders would not pay their fines in addition to late payment fines. Hence, in this study, the interactions between traffic polic...

Journal: :CoRR 2016
Houssam Abbas Alena Rodionova Ezio Bartocci Scott A. Smolka Radu Grosu

Motivated by the desire to verify the correctness of algorithms for arrhythmia discrimination used in cardiac medical devices, we present a general wavelet-based characterization of peaks (local maxima and minima) that occur in cardiac electrograms, along with two peak-detection algorithms based on this characterization. Peak detection (PD) is a common signal-processing task, as peaks indicate ...

Journal: :Discrete Mathematics 2012
Mark Anderson Richard P. Vitray Jay Yellen

An irregular coloring of a graph is a proper vertex coloring that distinguishes vertices in the graph either by their own colors or by the colors of their neighbors. In algebraic graph theory, graphs with a certain amount of symmetry can sometimes be specified in terms of a group and a smaller graph called a voltage graph. In [3], Radcliffe and Zhang found a bound for the irregular chromatic nu...

Journal: :SIAM J. Discrete Math. 1996
Don Coppersmith Uriel Feige James B. Shearer

For an undirected graph and an optimal cyclic list of all its vertices, the cyclic cover time is the expected time it takes a simple random walk to travel from vertex to vertex along the list, until it completes a full cycle. The main result of this paper is a characterization of the cyclic cover time in terms of simple and easy to compute graph properties. Namely, for any connected graph, the ...

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

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