7,429 research outputs found

    A Dichotomy Theorem for the Approximate Counting of Complex-Weighted Bounded-Degree Boolean CSPs

    Get PDF
    We determine the computational complexity of approximately counting the total weight of variable assignments for every complex-weighted Boolean constraint satisfaction problem (or CSP) with any number of additional unary (i.e., arity 1) constraints, particularly, when degrees of input instances are bounded from above by a fixed constant. All degree-1 counting CSPs are obviously solvable in polynomial time. When the instance's degree is more than two, we present a dichotomy theorem that classifies all counting CSPs admitting free unary constraints into exactly two categories. This classification theorem extends, to complex-weighted problems, an earlier result on the approximation complexity of unweighted counting Boolean CSPs of bounded degree. The framework of the proof of our theorem is based on a theory of signature developed from Valiant's holographic algorithms that can efficiently solve seemingly intractable counting CSPs. Despite the use of arbitrary complex weight, our proof of the classification theorem is rather elementary and intuitive due to an extensive use of a novel notion of limited T-constructibility. For the remaining degree-2 problems, in contrast, they are as hard to approximate as Holant problems, which are a generalization of counting CSPs.Comment: A4, 10pt, 20 pages. This revised version improves its preliminary version published under a slightly different title in the Proceedings of the 4th International Conference on Combinatorial Optimization and Applications (COCOA 2010), Lecture Notes in Computer Science, Springer, Vol.6508 (Part I), pp.285--299, Kailua-Kona, Hawaii, USA, December 18--20, 201

    Neutron detector simultaneously measures fluence and dose equivalent

    Get PDF
    Neutron detector acts as both an area monitoring instrument and a criticality dosimeter by simultaneously measuring dose equivalent and fluence. The fluence is determined by activation of six foils one inch below the surface of the moderator. Dose equivalent is determined from activation of three interlocked foils at the center of the moderator

    Fast Consensus under Eventually Stabilizing Message Adversaries

    Full text link
    This paper is devoted to deterministic consensus in synchronous dynamic networks with unidirectional links, which are under the control of an omniscient message adversary. Motivated by unpredictable node/system initialization times and long-lasting periods of massive transient faults, we consider message adversaries that guarantee periods of less erratic message loss only eventually: We present a tight bound of 2D+12D+1 for the termination time of consensus under a message adversary that eventually guarantees a single vertex-stable root component with dynamic network diameter DD, as well as a simple algorithm that matches this bound. It effectively halves the termination time 4D+14D+1 achieved by an existing consensus algorithm, which also works under our message adversary. We also introduce a generalized, considerably stronger variant of our message adversary, and show that our new algorithm, unlike the existing one, still works correctly under it.Comment: 13 pages, 5 figures, updated reference

    A Simulation Study of the Relative Efficiency of the Minimized Integrated Square Error Estimator (L2E) For Phase I Control Charting

    Get PDF
    Parameter estimates used in control charting, the sample mean and variance, are based on maximum likelihood estimation (MLE). Unfortunately, MLEs are not robust to contaminated data and can lead to improper conclusions regarding parameter values. This article proposes a more robust estimation technique; the minimized integrated square error estimator (L2E)

    Association patterns and foraging behaviour in natural and artificial guppy shoals

    Get PDF
    Animal groups are often nonrandom assemblages of individuals that tend to be assorted by factors such as sex, body size, relatedness and familiarity. Laboratory studies using fish have shown that familiarity among shoal members confers a number of benefits to individuals, such as increased foraging success. However, it is unclear whether fish in natural shoals obtain these benefits through association with familiars. We investigated whether naturally occurring shoals of guppies, Poecilia reticulata, are more adept at learning a novel foraging task than artificial (in which we selected shoal members randomly) shoals. We used social network analysis to compare the structures of natural and artificial shoals and examined whether shoal organization predicts patterns of foraging behaviour. Fish in natural shoals benefited from increased success in the novel foraging task compared with fish in artificial shoals. Individuals in natural shoals showed a reduced latency to approach the novel feeder, followed more and formed smaller subgroups compared to artificial shoals. Our findings show that fish in natural shoals do gain foraging benefits and that this may be facilitated by a reduced perception of risk among familiarized individuals and/or enhanced social learning mediated by following other individuals and small group sizes. Although the structure of shoals was stable over time, we found no direct relationship between shoal social structure and patterns of foraging behaviour

    Measurement of the dependence of the light yields of linear alkylbenzene-based and EJ-301 scintillators on electron energy

    Full text link
    An experimental test of the electron energy scale linearities of SNO+ and EJ-301 scintillators was carried out using a Compton spectrometer with electrons in the energy range 0.09-3 MeV. The linearity of the apparatus was explicitly demonstrated. It was found that the response of both types of scintillators with respect to electrons becomes non-linear below ~0.4 MeV. An explanation is given in terms of Cherenkov light absorption and re-emission by the scintillators.Comment: 8 pages, 7 figure
    corecore