We point out that a cold dark matter condensate made of gauge bosons from an extra hidden U(1) sector dubbed hiddenphotons can create a small, oscillating electric density current. Thus, they could also be searched for in the recently proposed LC-circuit setup conceived for axion cold dark matter search by Sikivie, Sullivan and Tanner. We estimate the sensitivity of this setup for hidden-photon...

A code C ⊆ Fn 2 is a (c, ǫ, δ)-expander code if it has a Tanner graph, where every variable node has degree c, and every subset of variable nodes L0 such that |L0| ≤ δn has at least ǫc|L0| neighbors. Feldman et al. (IEEE IT, 2007) proved that LP decoding corrects 3ǫ−2 2ǫ−1 · (δn − 1) errors of (c, ǫ, δ)expander code, where ǫ > 2 3 + 1 3c . In this paper, we provide a simpler proof of their resu...

A diffusive Holling–Tanner predator–prey model with no-flux boundary condition is considered, and it is proved that the unique constant equilibrium is globally asymptotically stable under a new simpler parameter condition. © 2011 Elsevier Ltd. All rights reserved.

Alon and Roichman (1994) proved that for every ε > 0 there is a finite c(ε) such that for any sufficiently large group G, the expected value of the second largest (in absolute value) eigenvalue of the normalized adjacency matrix of the Cayley graph with respect to c(ε) log |G| random elements is less than ε. We reduce the number of elements to c(ε) logD(G) (for the same c), where D(G) is the su...

It is shown that in a sequence of randomly generated bipartite configurations with number of left nodes approaching infinity, the probability that a particular configuration in the sequence has a minimum bisection width proportional to the number of vertices in the configuration approaches 1 so long as a sufficient condition on the node degree distribution is satisfied. This graph theory result...

We would like to better understand the fundamental cone of Tanner graphs derived from finite projective planes. Towards this goal, we discuss bounds on the AWGNC and BSC pseudo-weight of minimal pseudo-codewords of such Tanner graphs, on one hand, and study the structure of minimal pseudo-codewords, on the other.

Data Science Journal are simultaneously publishing " Toward Implementation of the Global Earth Observation System of Systems Data Sharing Principles. " The paper is a collaborative, interdisciplinary product of a number of authors who participated in the Group on Earth Observations (GEO) Task DA-06-01 on furthering the practical application of the agreed GEOSS data sharing principles. To assure...

In this lecture, we shall look at Expander Codes, Tanner Codes which are a generalization of Expander Codes and Distance amplification codes. These codes visualize the code as a graph where the value of the ith bit of a codeword corresponds to, for example, the value associated with the ith vertex or the ith edge of the graph. The properties of the graph determine the properties such as distanc...

A message-passing based search algorithm for cycles in a Tanner graph is proposed for designing good lowdensity parity-check (LDPC) codes. By applying the message-passing algorithm with only two message alphabets to a cycle search, we can easily perform the cycle search for a good LDPC code with an existing message-passing decoder.