This report deals with the problem of mapping pipelined applications on heterogeneous platforms whose processors are subject to failures. We address a difficult bi-criteria problem, namely deciding which stages to replicate, and on which resources, in order to optimize the reliability of the schedule, while guaranteeing a minimal throughput. Previous work had addressed the complexity of interva...

Let an edge cut partition the vertex set of an n-dimensional quadratic grid with the side length a into k subsets A1, ..., Ak with ||Ai| − |Aj || ≤ 1. We consider the problem of determining the minimal size c(n, k, a) of such a cut and present its asymptotic c(n, k, a) ∼ nan−1 n √ k as a, k →∞ and k/an → 0. The same asymptotic holds for partitioning of the n-dimensional torus. We present also s...

Poly(ADP-ribose) polymerase-1 (PARP-1) is a DNA nick sensor involved in the base excision repair (BER) pathway. Olaparib, a PARP inhibitor, has demonstrated antitumor activity in homologous recombination (HR)-deficient cancers. To extend this specific therapy to other types of carcinomas, a panel of 11 different cancer cells were screened in the present study. JF-305, a pancreatic cancer cell l...

Object recognition is one of the hottest issues in the field of vision system for harvesting robot. How efficiently and accurately to remove the background and get the object in image is the key research. The attention mechanisms of human visual system (HVS) can be segmented an image into the region of interesting (ROI) which is considered important and the background which is less important, a...

Let s(x) denote the maximum number of non-overlapping unit squares which can be packed into a large square of side length x. Let W (x) = x − s(x) denote the “wasted” area, i.e., the area not covered by the unit squares. In this note we prove that W (x) = O ( x √ 2)/7 log x ) . This improves earlier results of Erdős-Graham and Montgomery in which the upper bounds of W (x) = O(x) and W (x) = O(x(...