A binary vertex coloring (labeling) f : V (G) → Z2 of a graph G is said to be friendly if the number of vertices labeled 0 is almost the same as the number of vertices labeled 1. This friendly labeling induces an edge labeling f∗ : E(G) → Z2 defined by f∗(uv) = f(u)f(v) for all uv ∈ E(G). Let ef (i) = |{uv ∈ E(G) : f∗(uv) = i}| be the number of edges of G that are labeled i. Product-cordial ind...

Analyzing the influencing factors for well-off construction for an county, an evaluation index was set up for the well-off construction on which most of the influencing factors are characterized economically, socially and environmentally friendly. Considering the mass data is included in the county system, therefore the data-mining method and theory of self-organization that is adapted to those...

We consider the role that firm attributes play in accounting for the divergence in the careers of women and men, in terms of the wage and non-wage attributes of jobs, with the onset of parenthood. We exploit a matched employer-employee data set from Sweden that provides a rich set of firm and worker attributes. We index firms by their “family friendliness” and analyze the effect of firm family ...

For a graph G = (V,E) with a binary vertex coloring f : V (G)→ Z2, let vf (i) = |f−1(i)|. We say f is friendly if |vf (1) − vf (0)| ≤ 1, i.e., the number of vertices labeled 1 is the same or almost the same as the number of vertices labeled 0. The coloring f induces an edge labeling f ∗ : E(G) → Z2 defined by f ∗(uv) = f(u) + f(v) (mod 2), for each uv ∈ E(G). Let ef (i) = |{uv ∈ E(G) : f ∗(uv) ...

In this paper we make a novel use of the Johnson-Lindenstrauss Lemma. The Lemma has an existential form saying that there exists a JL transformation f of the data points into lower dimensional space such that all of them fall into predefined error range δ. We formulate in this paper a theorem stating that we can choose the target dimensionality in a random projection type JL linear transformati...

TCP Westwood (TCPW) is a sender-side only modification of TCP Reno congestion control, which exploits end-to-end bandwidth estimation to properly set the values of slow-start threshold and congestion window after a congestion episode. This paper aims at showing via both mathematical modeling and extensive simulations that TCPW significantly improves fair sharing of high-speed networks capacity ...