The stable marriage problem is that of matching n men and n women, each of whom has ranked the members of the opposite sex in order of preference, so that no unmatched couple both prefer each other to their partners under the matching. At least one stable matching exists for every stable marriage instance, and efficient algorithms for finding such a matching are well known. The stable roommates...

Eastern boundary currents are often described as 'wasp-waist' ecosystems in which one or few mid-level forage species support a high diversity of larger predators that are highly susceptible to fluctuations in prey biomass. The assumption of wasp-waist control has not been empirically tested in all such ecosystems. This study used stable isotope analysis to test the hypothesis of wasp-waist con...

The Hurwitz stable polynomials are important in the study of differential equations systems and control theory (see [7] and [19]). A property of these polynomials is related to Hadamard product. Consider two polynomials p, q ∈ R[x]: p(x) = anx n + an−1x n−1 + · · ·+ a1x + a0 q(x) = bmx m + bm−1x m−1 + · · ·+ b1x + b0 the Hadamard product (p ∗ q) is defined as (p ∗ q)(x) = akbkx + ak−1bk−1x + · ...

The essential oil yield stability of damask rose (Rosa damascena Mill.) as an important medicinal and aromatic plant in different environments has not been well documented. In order to determine appropriate stability parameters, six statistics were studied for essential oil stability of 35 Rosa damascena landraces in seven locations (Sanandaj, Arak, Kashan, Dezful, Stahban, Ke...

This paper investigates the expressive power and complexity of partial model semantics for disjunctive deductive databases. In particular, partial stable, regular model, maximal stable (M-stable), and least undeened stable (L-stable) semantics for function-free disjunctive logic programs are considered, for which the expressiveness of queries based on possibility and certainty inference is dete...

A property P defined on all graphs of order n is said to be k-stable if for any graph of order n that does not satisfy P , the fact that uv is not an edge of G and that G+uv satisfies P implies dG(u)+dG(v) < k. Every property is (2n−3)-stable and every k-stable property is (k+1)stable. We denote by s(P ) the smallest integer k such that P is k-stable and call it the stability of P . This number...

This article introduces a novel Monte Carlo type algorithm, which we call the Metropolized Forward Chaining (MFC) algorithm, to find a stable model of a general propositional logic program P if P has a stable model or to find a maximal subprogram P ′ of P and stable model M ′ of P ′ if P does not have a stable model. Our algorithm combines the forward chaining algorithm of Marek, Nerode, and Re...