This paper presents a natural and efficient implementation for the classical broadcast message passing routine which optimizes performance of Ethernet based clusters. A simple algorithm for parallel matrix multiplication is specifically designed to take advantage of both, parallel computing facilities (CPUs) provided by clusters, and optimized performance of broadcast messages on Ethernet based...

In graph clustering methods, MinMax Cut tends to provide more balanced clusters as compared to Ratio Cut and Normalized Cut. The traditional approach used spectral relaxation to solve the graph cut problem. The main disadvantage of this approach is that the obtained spectral solution has mixed signs, which could severely deviate from the true solution and have to resort to other clustering meth...

A R T I C L E I N F O A B S T R A C T Article history: Received 25 March 2017 Received in revised form 27 March 2017 Accepted 29 March 2017 Available online 31 March 2017 In an era of data increasing at a proportion larger than ever, analysis of such data covering all businesses and sectors becomes all the more important. Data mining tasks, particularly clustering, aim at partitioning bulks of ...

Understanding how stem cells are regulated in adult tissues is a major challenge in cell biology. In the basal layer of human epidermis, clusters of almost quiescent stem cells are interspersed with proliferating and differentiating cells. Previous studies have shown that the proliferating cells follow a pattern of balanced stochastic cell fate. This behaviour enables them to maintain homeostas...

edge distance-balanced graphs are graphs in which for every edge $e = uv$ the number of edges closer to vertex $u$ than to vertex $v$ is equal to the number of edges closer to $v$ than to $u$. in this paper, we study this property under some graph operations.

This paper describes an empirical investigation into the nature of challenge within the context of flow or effortless attention. An important condition of the flow state is that the challenges of the task are commensurate with the person’s level of skill. However when considering movement interaction those challenges could be composite in the sense that they could comprise physical as well as i...

The blocks of a balanced ternary design, BTD(V,B; ρ1, ρ2, R;K,Λ), can be partitioned into two sets: the b1 blocks that each contain no repeated elements, and the b2 = B − b1 blocks containing repeated elements. In this note, we address, and answer in some particular cases, the following question. For which partitions of the integer B as b1 + b2 does there exist a BTD(V,B; ρ1, ρ2, R;K,Λ)?

Given a set of n black and n white points in general position in the plane, a line l determined by them is said to be balanced if each open half-plane bounded by l contains precisely the same number of black points as white points. It is proved that the number of balanced lines is at least n. This settles a conjecture of George Baloglou.

Let S be a set of r red points and b = r + 2δ blue points in general position in the plane, with δ ≥ 0. A line l determined by them is balanced if in each open half-plane bounded by l the difference between the number of blue points and red points is δ. We show that every set S as above has at least r balanced lines. The main techniques in the proof are rotations and a generalization, sliding r...