نتایج جستجو برای: balanced clusters

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

2014
Yongzhong Qiao Qi Liang

By analyzing the granted patents distribution of the energy-saving and environmental protection industry in China from 2008 to 2013, the conclusion can be reached: firstly, technological innovations of the energy-saving industry are focused on the environmentally air-conditioning and heat pump technical field, and technological innovations of the resources recycling industry is mainly concentra...

2006
G. G. Volkov

Experimental observation of Majorana fermion matter gives a new impetus to the understanding of the Lorentz symmetry and its extension, the geometrical properties of the ambient space-time structure, matter–antimatter symmetry and some new ways to understand the baryo–genesis problem in cosmology. Based on the primordial Majorana fermion matter assumption, we discuss a possibility to solve the ...

2002
Veronica Vinciotti David J. Hand

A long-running issue in scorecard construction in retail banking is how to handle dramatically unbalanced class sizes. This is important because, in many applications, the class sizes are very different. We describe the impact ignoring such imbalance can have and review the various strategies which have been proposed for tackling it, embedding them in a common theoretical framework. We then des...

Journal: :Environmental Health Perspectives 1979
C G Elinder M Pannone

Biliary excretion of cadmium was studied in two groups of five rats which were given repeated injections of 109Cd. The first group was given a total amount of 6 mg Cd/kg which was 6 times as much as the second group. The elimination of cadmium in bile, urine, and feces was measured 4 to 5 weeks after the last injection. The relative biliary excretion of cadmium was the same in both groupetion, ...

Journal: :Informatica (Slovenia) 1998
David R. Helman Joseph JáJá

We introduce an efficient algorithm for sorting on clusters of symmetric multiprocessors (SMPs). This algorithm relies on a novel scheme for stably sorting on a single SMP coupled with balanced regular communication on the cluster. Our SMP algorithm seems to be asymptotically faster than any of the published algorithms. The algorithms were implemented in C using POSIX threads and the SIMPLE lib...

2009
Yuntao Jia Michael Garland John C. Hart

The hierarchical edge bundle method clusters the graph edges to better understand and analyze graphs, but its effectiveness relies critically on the quality of the hierarchical organization of its nodes and edges. This paper proposes a novel graph visualization approach that extracts the community structure of a network and organizes it into a more balanced and meaningful hierarchy so that its ...

2009
Yuntao Jia Michael Garland

The hierarchical edge bundle method clusters the edges of a radial layout to better understand and analyze graphs, but its effectiveness relies critically on the quality of the hierarchical organization of its nodes and edges. This paper proposes a novel graph visualization approach that extracts the community structure of a network and organizes it into a more balanced and meaningful hierarchy...

2009
Ronald C. Beckett

Large-scale collaborations such as business networks and clusters are being promoted worldwide, but some OECD studies suggest that measuring the performance of such collaborations can be problematic. In this paper a grounded theory approach leads to the proposition that important attributes of a large-scale collaboration are its dimensions, maturity and relative heterogeneity of participants; w...

2017
Hu Ding

The problem of constrained k-center clustering has attracted significant attention in the past decades. In this paper, we study balanced k-center cluster where the size of each cluster is constrained by the given lower and upper bounds. The problem is motivated by the applications in processing and analyzing large-scale data in high dimension. We provide a simple nearly linear time 4-approximat...

H. YOUSEFI-AZARI M. TAVAKOLI

Distance-balanced graphs are introduced as graphs in which every edge uv has the following property: the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. Basic properties of these graphs are obtained. In this paper, we study the conditions under which some graph operations produce a distance-balanced graph.

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

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