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

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

2017
Paz Carmi Man-Kwun Chiu Matthew J. Katz Matias Korman Yoshio Okamoto André van Renssen Marcel Roeloffzen Taichi Shiitada Shakhar Smorodinsky

We prove a geometric version of the graph separator theorem for the unit disk intersection graph: for any set of n unit disks in the plane there exists a line ` such that ` intersects at most O( √ (m+ n) logn) disks and each of the halfplanes determined by ` contains at most 2n/3 unit disks from the set, where m is the number of intersecting pairs of disks. We also show that an axis-parallel li...

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...

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.

Journal: :Journal of Ethnic and Migration Studies 2022

Temporariness has become an increasingly salient feature in international migration that presents itself as fragmented, non-linear, including different intermediate stops and multiple returns new departures. This special issue proposes a analytical framework brings together the role of policies defining migrants temporary migrant’s own agency perceiving their project or permanent. The proposed ...

Journal: :Contemporary mathematics 2021

The categorical formulation of the Eilenberg-Watts calculus relates, for any pair finite categories M and N, Fun^{le}(N,M) Fun^{re}(N,M) linear left or right exact functors Deligne product \bar N \boxtimes by adjoint equivalences. We establish a variant this case that are module over tensor category. This provides in particular canonical explicitly computable equivalences between (or, more gene...

Journal: :Journal of Pure and Applied Algebra 2012

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

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