One of the biggest spots of science communication is plagiarism. This despicable practice, although it is practiced by a small percentage of scientists has created many hitches and put under suspicion the serious studies of those engaged in science as a form of knowledge to improve the condition of life on our planet. Plagiarism was one of the dominant themes of the XXI Scientific Publishing Co...

Cyanosis is a category of condemnation for poultry, as defined by Agriculture and Agrifood Canada. A retrospective study to examine the seasonal patterns and trends for turkey cyanosis condemnation was conducted for the years 1987 to 1995 with the use of condemnation records made available by a single abattoir in Ontario. Condemnation for cyanosis had a significant seasonal pattern, with major ...

The n-dimensional cube Q is the graph whose vertices are the subsets of {1, . . . , n} where two such vertices are adjacent if and only if their symmetric difference is a singleton. Clearly Q is an n-connected graph of diameter and radius n. Write M = n2n−1 = e(Q) for the size of Q. Let Q̃ = (Qt) M 0 be a random Q -process. Thus Qt is a spanning subgraph of Q n of size t, and Qt is obtained from...

It is proved that a continuum is a tree if and only if each two connected subsets meet in a connected set. In this note a continuum is a compact connected Hausdorff space. A tree is a continuum in which distinct points are never conjugate [6], i.e., any two distinct points are separated by the deletion of some third point. A dendrite is a metrizable tree. The literature is replete with characte...

In this paper we study graph problems in dynamic streaming model, where the input is defined by a sequence of edge insertions and deletions. As many natural problems require Ω(n) space, where n is the number of vertices, existing works mainly focused on designing Õ(n) space algorithms. Although sublinear in the number of edges for dense graphs, it could still be too large for many applications ...

We present a new approach to cross channel fraud detection: build graphs representing transactions from all channels and use analytics on features extracted from these graphs. Our underlying hypothesis is community based fraud detection: an account (holder) performs normal or trusted transactions within a community that is “local” to the account. We explore several notions of community based on...