The action of point crossover is modeled as a random walk on a group, and convergence and rate results are established for the walk. Speci cally, it is shown that there is a cut-o phenomenon in the rate at which the sample get randomized. As long as the number of crossover steps is less than a certain critical number, the total variation distance (with respect to the stationary distribution) is...

In this paper, another thick dielectric (DD) fix cluster radio wire model working at 28 GHz for future fifth generation (5G) cell systems is exhibited. This cluster radio wire is proposed and planned with a standard printed circuit board procedure to be reasonable for combination with radio recurrence/microwave hardware. The proposed structure utilizes four round molded DD fix radiator radio wi...

this paper examines the relationship between accounting conservatism and informational content of earnings using data of 167 firms listed on the tehran stock exchange during 2004-2013. accounting conservatism is measured based on khan and watts' (2009) model and feltham and ohlsson (1995) price model and easton and hariss (1991) return models were used to evaluate the informational content...

first we show that the cosets of a fuzzy ideal μ in a bck-algebrax form another bck-algebra  x/μ (called the fuzzy quotient bck-algebra of x by μ). also we show thatx/μ is a fuzzy partition of x and we prove several some isomorphism theorems. moreover we prove that if the associated fuzzy similarity relation of a fuzzy partition p of a commutative bck-algebra iscompatible, then p is a fuzzy quo...

The level of biochemical composition sweet cherry fruits different ripening periods was investigated. It has been established that the content chemical elements in depends on a number factors. Fruits period is listed frstaming features pomological variety. Weather conditions during formation and have signifcant effect chemicals. variety Melitopolskaya krapchastaya revealed to high dry soluble s...

Graph-based video segmentation methods rely on superpixels as starting point. While most previous work has focused on the construction of the graph edges and weights as well as solving the graph partitioning problem, this paper focuses on better superpixels for video segmentation. We demonstrate by a comparative analysis that superpixels extracted from boundaries perform best, and show that bou...

The NP-hard graph bisection problem is to partition the nodes of an undirected graph into two equal-sized groups so as to minimize the number of edges that cross the partition. The more general graph l-partition problem is to partition the nodes of an undirected graph into l equal-sized groups so as to minimize the total number of edges that cross between groups. We present a simple, linear-tim...