Version Spaces and Generalized Monotone Boolean Functions

We consider generalized monotone functions f: X --> {0,1}defined for an arbitrary binary relationoperations research;ordinal classification;artificial intelligence;machine learning;partially defined Boolean functions

Assessment of the effectiveness of head only and back-of-the-head electrical stunning of chickens

The study assesses the effectiveness of reversible head-only and back-of-the-head electrical stunning of chickens using 130–950 mA per bird at 50 Hz AC

Totally balanced combinatorial optimization games

Combinatorial optimization games deal with cooperative games for which the value of every subset of players is obtained by solving a combinatorial optimization problem on the resources collectively owned by this subset. A solution of the game is in the core if no subset of players is able to gain advantage by breaking away from this collective decision of all players. The game is totally balanced if and only if the core is non-empty for every induced subgame of it. We study the total balancedness of several combinatorial optimization games in this paper. For a class of the partition game [5], we have a complete characterization for the total balancedness. For the packing and covering games [3], we completely clarify the relationship between the related primal/dual linear programs for the corresponding games to be totally balanced. Our work opens up the question of fully characterizing the combinatorial structures of totally balanced packing and covering games, for which we present some interesting examples: the totally balanced matching, vertex cover, and minimum coloring games.link_to_subscribed_fulltex

Manipulations of egg-gallery length to vary brood density in spruce beetle, Dendroctonus rufipennis (Coleoptera: Scolytidae): Effects on brood survival and quality

Different brood densities were produced under a constant bark surface area of the spruce host, by excising egg-producing female <i>Dendroctonus rufipennis</i> from the host material after they had excavated galleries of specified lengths. This procedure allowed a constant attack density. The numbers of adult progeny produced/cm of egg-gallery were significantly greater from bark slabs with short galleries and low densities: the sizes (pronotal widths) of adult progeny of both sexes were also significantly greater from low than from high densities; and the distribution patterns of chromatin differed significantly among high, medium and low densities

Bin packing and multiprocessor scheduling problems with side constraint on job types

AbstractThis paper deals with the bin packing problem and the multiprocessor scheduling problem both with an additional constraint specifying the maximum number of jobs in each type to the processed on a processor. Since these problems are NP-complete, various approximation algorithms are proposed by generalizing those algorithms known for the ordinary bin packing and multiprocessor scheduling problems. The worst-case performance of the proposed algorithms are analyzed, and some computational results are reported to indicate their average case behavior

Manipulations of egg-gallery length to vary brood density in spruce beetle, Dendroctonus rufipennis (Coleoptera: Scolytidae): Effects on brood survival and quality

Different brood densities were produced under a constant bark surface area of the spruce host, by excising egg-producing female Dendroctonus rufipennis from the host material after they had excavated galleries of specified lengths. This procedure allowed a constant attack density. The numbers of adult progeny produced/cm of egg-gallery were significantly greater from bark slabs with short galleries and low densities: the sizes (pronotal widths) of adult progeny of both sexes were also significantly greater from low than from high densities; and the distribution patterns of chromatin differed significantly among high, medium and low densities