Disjunctive analogues of submodular and supermodular pseudo-Boolean functions

AbstractWe consider classes of real-valued functions of Boolean variables defined by disjunctive analogues of the submodular and supermodular functional inequalities, obtained by replacing in these inequalities addition by disjunction (max operator). The disjunctive analogues of submodular and supermodular functions are completely characterized by the syntax of their disjunctive normal forms. Classes of functions possessing combinations of these properties are also examined. A disjunctive representation theory based on one of these combination classes exhibits syntactic and algorithmic analogies with classical DNF theory

Stability in CAN-free graphs

AbstractA class F of graphs characterized by three forbidden subgraphs C, A, N is considered; C is the claw (the unique graph with degree sequence (1, 1, 1, 3)), A is the antenna (a graph with degree sequence (1, 2, 2, 3, 3, 3) which does not contain C), and N is the net (the unique graph with degree sequence (1, 1, 1, 3, 3, 3)). These graphs are called CAN-free. A construction is described which associates with every CAN-free graph G another CAN-free graph G′ with strictly fewer nodes than G and with stbility number α(G′) = α(G) − 1. This gives a good algorithm for determining the stability number of CAN-free graphs

Distance-based classification methods

Given a set of points in a Euclidean space, and a partitioning of this 'training set' into two or more subsets ('classes'), we consider the problem of identifying a 'reasonable' assignment of another point in the Euclidean space ('query point') to one of these classes. The various classifications proposed in this paper are determined by the distances between the query point and the points in the training set. We report results of extensive computational experiments comparing the new methods with two well-known distance-based classification methods (k-nearest neighbors and Parzen windows) on data sets commonly used in the literature. The results show that the performance of both new and old distance-based methods is on par with and often better than that of the other best classification methods known. Moreover, the new classification procedures proposed in this paper are: (i) easy to implement, (ii) extremely fast, and (iii) very robust (i.e. their performance is insignificantly affected by the choice of parameter values)

Approximate Deadline-Scheduling with Precedence Constraints

We consider the classic problem of scheduling a set of n jobs non-preemptively on a single machine. Each job j has non-negative processing time, weight, and deadline, and a feasible schedule needs to be consistent with chain-like precedence constraints. The goal is to compute a feasible schedule that minimizes the sum of penalties of late jobs. Lenstra and Rinnoy Kan [Annals of Disc. Math., 1977] in their seminal work introduced this problem and showed that it is strongly NP-hard, even when all processing times and weights are 1. We study the approximability of the problem and our main result is an O(log k)-approximation algorithm for instances with k distinct job deadlines

Occlusion and Motion Reasoning for Long-Term Tracking

International audienceObject tracking is a reoccurring problem in computer vision. Tracking-by-detection approaches, in particular Struck (Hare et al., 2011), have shown to be competitive in recent evaluations. However, such approaches fail in the presence of long-term occlusions as well as severe viewpoint changes of the object. In this paper we propose a principled way to combine occlusion and motion reasoning with a tracking-by-detection approach. Occlusion and motion reasoning is based on state-of-the-art long-term trajectories which are labeled as object or background tracks with an energy-based formulation. The overlap between labeled tracks and detected regions allows to identify occlusions. The motion changes of the object between consecutive frames can be estimated robustly from the geometric relation between object trajectories. If this geometric change is significant, an additional detector is trained. Experimental results show that our tracker obtains state-of-the-art results and handles occlusion and viewpoints changes better than competing tracking methods

Strong evidences of hadron acceleration in Tycho's Supernova Remnant

Very recent gamma-ray observations of G120.1+1.4 (Tycho's) supernova remnant (SNR) by Fermi-LAT and VERITAS provided new fundamental pieces of information for understanding particle acceleration and non-thermal emission in SNRs. We want to outline a coherent description of Tycho's properties in terms of SNR evolution, shock hydrodynamics and multi-wavelength emission by accounting for particle acceleration at the forward shock via first order Fermi mechanism. We adopt here a quick and reliable semi-analytical approach to non-linear diffusive shock acceleration which includes magnetic field amplification due to resonant streaming instability and the dynamical backreaction on the shock of both cosmic rays (CRs) and self-generated magnetic turbulence. We find that Tycho's forward shock is accelerating protons up to at least 500 TeV, channelling into CRs about the 10 per cent of its kinetic energy. Moreover, the CR-induced streaming instability is consistent with all the observational evidences indicating a very efficient magnetic field amplification (up to ~300 micro Gauss). In such a strong magnetic field the velocity of the Alfv\'en waves scattering CRs in the upstream is expected to be enhanced and to make accelerated particles feel an effective compression factor lower than 4, in turn leading to an energy spectrum steeper than the standard prediction {\propto} E^-2. This latter effect is crucial to explain the GeV-to-TeV gamma-ray spectrum as due to the decay of neutral pions produced in nuclear collisions between accelerated nuclei and the background gas. The self-consistency of such an hadronic scenario, along with the fact that the concurrent leptonic mechanism cannot reproduce both the shape and the normalization of the detected the gamma-ray emission, represents the first clear and direct radiative evidence that hadron acceleration occurs efficiently in young Galactic SNRs.Comment: Minor changes. Accepted for publication in Astronomy & Astrophysic

Polymorphism at High Molecular Weight Glutenin Subunits and Morphological Diversity of Aegilops geniculata Roth Collected in Algeria

A collection of 35 accessions of the tetraploid wild wheat Aegilops geniculata Roth (MM, UU) sampled in northern Algeria was evaluated for morphological and biochemical variability. Morphological and ecological analyses based on morphological traits and bioclimatic parameters, respectively, were assessed using principal component analysis (PCA). Accessions were differentiated by width characters, namely spike’s width, and a weak relationship between morphological traits and ecological parameters was found. Polymorphism of high molecular weight (HMW) glutenin subunits was carried on by sodium dodecyl sulphate-polyacrylamide gel electrophoresis (SDS-PAGE). Among accessions analyzed, 27 alleles were identified at the two loci Glu-M1 and Glu-U1: resulting in twenty-nine patterns and a nomenclature was proposed. Two alleles at the Glu-U1 locus expressed a new subunit with a slightly slower mobility than subunit 8. These results provide new information regarding the genetic variability of HMW glutenin subunits, as well as their usefulness in cultivated wheat quality improvement