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

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

Pioneer 11's encounter with Jupiter and mission to Saturn

Plans for Pioneer 11's approach to Saturn are described. A flyby somewhat parallel to the ring plane is being proposed as an interim target, with a future option held for a possible high risk (or suicide) plunge through the nearly transparent space between Saturn and its rings

Semidirect product decomposition of Coxeter groups

Let $(W,S)$ be a Coxeter system, let $S=I \dot{\cup} J$ be a partition of $S$ such that no element of $I$ is conjugate to an element of $J$, let $\widetilde{J}$ be the set of $W_I$-conjugates of elements of $J$ and let $\widetilde{W}$ be the subgroup of $W$ generated by $\widetilde{J}$. We show that $W=\widetilde{W} \rtimes W_I$ and that $(\widetilde{W},\widetilde{J})$ is a Coxeter system.Comment: 28 pages, one table. We have added some comments on parabolic subgroups, double cosets representatives, finite and affine Weyl groups, invariant theory, Solomon descent algebr

Multifractal Analysis of Packed Swiss Cheese Cosmologies

The multifractal spectrum of various three-dimensional representations of Packed Swiss Cheese cosmologies in open, closed, and flat spaces are measured, and it is determined that the curvature of the space does not alter the associated fractal structure. These results are compared to observational data and simulated models of large scale galaxy clustering, to assess the viability of the PSC as a candidate for such structure formation. It is found that the PSC dimension spectra do not match those of observation, and possible solutions to this discrepancy are offered, including accounting for potential luminosity biasing effects. Various random and uniform sets are also analyzed to provide insight into the meaning of the multifractal spectrum as it relates to the observed scaling behaviors.Comment: 3 latex files, 18 ps figure

Apollo 17 mission Report. Supplement 6: Calibration results for gamma ray spectrometer sodium iodide crystal

A major difficulty in medium energy gamma-ray remote sensing spectroscopy and astronomy measurements was the high rate of unwanted background resulting from the following major sources: (1) prompt secondary gamma-rays produced by cosmic-ray interactions in satellite materials; (2) direct charged-particle counts; (3) radioactivity induced in the detector materials by cosmic-ray and trapped protons; (4) radioactivity induced in detector materials by the planetary (e.g., earth or moon) albedo neutron flux; (5) radioactivity induced in the detector materials by the interaction of secondary neutrons produced throughout the spacecraft by cosmic-ray and trapped proton interactions; (6) radioactivity induced in spacecraft materials by the mechanisms outlined in 3, 4, and 5; and (7) natural radioactivity in spacecraft and detector materials. The purpose of this experiment was to obtain information on effects 3, 4, and 5, and from this information start developing calculational methods for predicting the background induced in the crystal detector in order to correct the Apollo gamma-ray spectrometer data for this interference

Practical Homomorphic Encryption Over the Integers for Secure Computation in the Cloud

We present novel homomorphic encryption schemes for integer arithmetic, intended primarily for use in secure single-party computation in the cloud. These schemes are capable of securely computing arbitrary degree polynomials homomorphically. In practice, ciphertext size and running times limit the polynomial degree, but this appears sufficient for most practical applications. We present four schemes, with increasing levels of security, but increasing computational overhead. Two of the schemes provide strong security for high-entropy data. The remaining two schemes provide strong security regardless of this assumption. These four algorithms form the first two levels of a hierarchy of schemes which require linearly decreasing entropy. We have evaluated these four algorithms by computing low-degree polynomials. The timings of these computations are extremely favourable by comparison with even the best of existing methods, and dramatically out-perform running times of directly comparable schemes by a factor of up to 1000, and considerably more than that for fully homomorphic schemes, used in the same context. The results clearly demonstrate the practical applicability of our schemes

Practical homomorphic encryption over the integers for secure computation in the cloud

We present novel homomorphic encryption schemes for integer arithmetic, intended primarily for use in secure single-party computation in the cloud. These schemes are capable of securely computing arbitrary degree polynomials homomorphically. In practice, ciphertext size and running times limit the polynomial degree, but this appears sufficient for most practical applications. We present four schemes, with increasing levels of security, but increasing computational overhead. Two of the schemes provide strong security for high-entropy data. The remaining two schemes provide strong security regardless of this assumption. These four algorithms form the first two levels of a hierarchy of schemes, and we also present the general cases of each scheme. We further elaborate how a fully homomorphic system can be constructed from one of our general cases. In addition, we present a variant based upon Chinese Remainder Theorem secret sharing. We detail extensive evaluation of the first four algorithms of our hierarchy by computing low-degree polynomials. The timings of these computations are extremely favourable by comparison with even the best of existing methods and dramatically outperform many well-publicised schemes. The results clearly demonstrate the practical applicability of our schemes