In a red-blue coloring of a nonempty graph, every edge is colored red or blue. If the resulting edge-colored graph contains a nonempty subgraph G without isolated vertices every edge of which is colored the same, then G is said to be monochromatic. For two nonempty graphs G and H without isolated vertices, the monochromatic Ramsey number mr(G,H) of G and H is the minimum integer n such that eve...

Platelet-associated IgG (PAIgG) has been reported to be elevated in nonthrombocytopenic patients who have a normal platelet lifespan. This has been interpreted as indicating that PAIgG is a nonspecific finding in these patients and not a determinant of platelet survival. It is important to recognize that the reticuloendothelial (RE) system plays an important role in the clearance of antibody-se...

Given any simple connected graph G =< V,E > such that each edge e ∈ E has unit resistance, Foster’s Resistance Theorem states that the summation of effective resistances over all edges equals n− 1. That is, ∑ e∈E Re = n− 1 Further, given a general graph with resistances re corresponding to edges e ∈ E, the theorem states: ∑ e∈E Re re = n− 1 Tetali[1] proved Foster’s Resistance Theorem by consid...

A grid re nement scheme has been developed for tetrahedral and triangular grid-based calculations in message-passing environments. The element adaption scheme is based on edge bisection of elements marked for re nement by an appropriate error indicator. Hash table/linked list data structures are used to store nodal and element information. The grid along inter-processor boundaries is re ned con...

A $k$-uniform tight cycle is a hypergraph with cyclic ordering of its vertices such that edges are all the sets size $k$ formed by consecutive in ordering.We prove every red-blue edge-coloured $K_n^{(4)}$ contains red and blue vertex-disjoint together cover $n-o(n)$ vertices. Moreover, we $K_n^{(5)}$ four monochromatic cycles

Consider a game played on the edge set of the infinite clique by two players, Builder and Painter. In each round, Builder chooses an edge and Painter colours it red or blue. Builder wins by creating either a red copy of G or a blue copy of H for some fixed graphs G and H. The minimum number of rounds within which Builder can win, assuming both players play perfectly, is the on-line Ramsey numbe...

Consider a graph whose edges have been colored red and blue. Assign a nonnegative real weight to every edge so that at every vertex, the sum of the weights of the incident red edges equals the sum of the weights of the incident blue edges. The set of all such assignments forms a convex polyhedral cone in the edge space, called the alternating cone. The integral (respectively, {0, 1}) vectors in...

Although most demosaicking methods assume the existence of high local correlation in estimating the missing color components, such an assumption may fail for images with high color saturation and sharp color transitions. This paper presents a demosaicking scheme by exploiting both the variance of color differences (VCD) and the non-local similarity. First, the missing green components are estim...

The effects of 3d transition metal doping in TiO2 phases have been simulated in detail. The results of modelling indicate that Mn has the biggest potential among 3d transition metals, for the reduction of energy gap and the introduction of effective intermediate bands to allow multi-band optical absorption. On the basis of theoretical formulation, we have incorporated considerable amount of Mn ...

In order to build an automatic system that searches, acquires and analyses chromosomal aberrations, we have coupled a commercial system, Metafer4 (MetaSystems, Germany), with an original software (VRAIC) that is able to separate normal from aberrant metaphase images. Images of metaphases are first stained with a FISH technique and then acquired in three different channels: a BLUE channel, where...