Constraining a spatially dependent rotation of the Cosmic Microwave Background Polarization

Following Kamionkowski (2008), a quadratic estimator of the rotation of the plane of polarization of the CMB is constructed. This statistic can estimate a spatially varying rotation angle. We use this estimator to quantify the prospects of detecting such a rotation field with forthcoming experiments. For PLANCK and CMBPol we find that the estimator containing the product of the E and B components of the polarization field is the most sensitive. The variance of this EB estimator, N(L) is roughly independent of the multipole L, and is only weakly dependent on the instrumental beam. For FWHM of the beam size ~ 5'-50', and instrument noise $\Delta_p ~ 5-50 uK-arcmin, the scaling of variance N(L) can be fitted by a power law N(L)=3.3 x 10^{-7} \Delta^2_p (FWHM)^{1.3} sq-deg. For small instrumental noise \Delta_p \leq 5 uK-arcmin, the lensing B-modes become important, saturating the variance to ~10^{-6} sq-deg even for an ideal experiment. Upcoming experiments like PLANCK will be able to detect a power spectrum of the rotation angle, C^{\alpha \alpha}(L), as small as 0.01 sq-deg, while futuristic experiment like CMBPol will be able to detect rotation angle power spectrum as small as 2.5 x 10^{-5} sq-deg. We discuss the implications of such constraints, both for the various physical effects that can rotate the polarization as photons travel from the last scattering surface as well as for constraints on instrumental systematics that can also lead to a spurious rotation signal. Rotation of the CMB polarization generates B-modes which will act as contamination for the primordial B-modes detection. We discuss an application of our estimator to de-rotate the CMB to increase the sensitivity for the primordial B-modes.Comment: 11 pages, 5 figure

High scale mixing relations as a natural explanation for large neutrino mixing

The origin of small mixing among the quarks and a large mixing among the neutrinos has been an open question in particle physics. In order to answer this question, we postulate general relations among the quarks and the leptonic mixing angles at a high scale, which could be the scale of Grand Unified Theories. The central idea of these relations is that the quark and the leptonic mixing angles can be unified at some high scale either due to some quark-lepton symmetry or some other underlying mechanism and as a consequence, the mixing angles of the leptonic sector are proportional to that of the quark sector. We investigate the phenomenology of the possible relations where the leptonic mixing angles are proportional to the quark mixing angles at the unification scale by taking into account the latest experimental constraints from the neutrino sector. These relations are able to explain the pattern of leptonic mixing at the low scale and thereby hint that these relations could be possible signatures of a quark-lepton symmetry or some other underlying quark-lepton mixing unification mechanism at some high scale linked to Grand Unified Theories.Comment: 44 pages, several comments and three sub-sections are added for further clarificatio

Forbidden Extension Queries

Document retrieval is one of the most fundamental problem in information retrieval. The objective is to retrieve all documents from a document collection that are relevant to an input pattern. Several variations of this problem such as ranked document retrieval, document listing with two patterns and forbidden patterns have been studied. We introduce the problem of document retrieval with forbidden extensions. Let D={T_1,T_2,...,T_D} be a collection of D string documents of n characters in total, and P^+ and P^- be two query patterns, where P^+ is a proper prefix of P^-. We call P^- as the forbidden extension of the included pattern P^+. A forbidden extension query asks to report all occ documents in D that contains P^+ as a substring, but does not contain P^- as one. A top-k forbidden extension query asks to report those k documents among the occ documents that are most relevant to P^+. We present a linear index (in words) with an O(|P^-| + occ) query time for the document listing problem. For the top-k version of the problem, we achieve the following results, when the relevance of a document is based on PageRank: - an O(n) space (in words) index with O(|P^-|log sigma+ k) query time, where sigma is the size of the alphabet from which characters in D are chosen. For constant alphabets, this yields an optimal query time of O(|P^-|+ k). - for any constant epsilon > 0, a |CSA| + |CSA^*| + Dlog frac{n}{D} + O(n) bits index with O(search(P)+ k cdot tsa cdot log ^{2+epsilon} n) query time, where search(P) is the time to find the suffix range of a pattern P, tsa is the time to find suffix (or inverse suffix) array value, and |CSA^*| denotes the maximum of the space needed to store the compressed suffix array CSA of the concatenated text of all documents, or the total space needed to store the individual CSA of each document

Connecting protein and mRNA burst distributions for stochastic models of gene expression

The intrinsic stochasticity of gene expression can lead to large variability in protein levels for genetically identical cells. Such variability in protein levels can arise from infrequent synthesis of mRNAs which in turn give rise to bursts of protein expression. Protein expression occurring in bursts has indeed been observed experimentally and recent studies have also found evidence for transcriptional bursting, i.e. production of mRNAs in bursts. Given that there are distinct experimental techniques for quantifying the noise at different stages of gene expression, it is of interest to derive analytical results connecting experimental observations at different levels. In this work, we consider stochastic models of gene expression for which mRNA and protein production occurs in independent bursts. For such models, we derive analytical expressions connecting protein and mRNA burst distributions which show how the functional form of the mRNA burst distribution can be inferred from the protein burst distribution. Additionally, if gene expression is repressed such that observed protein bursts arise only from single mRNAs, we show how observations of protein burst distributions (repressed and unrepressed) can be used to completely determine the mRNA burst distribution. Assuming independent contributions from individual bursts, we derive analytical expressions connecting means and variances for burst and steady-state protein distributions. Finally, we validate our general analytical results by considering a specific reaction scheme involving regulation of protein bursts by small RNAs. For a range of parameters, we derive analytical expressions for regulated protein distributions that are validated using stochastic simulations. The analytical results obtained in this work can thus serve as useful inputs for a broad range of studies focusing on stochasticity in gene expression

Shared-Constraint Range Reporting

Orthogonal range reporting is one of the classic and most fundamental data structure problems. (2,1,1) query is a 3 dimensional query with two-sided constraint on the first dimension and one sided constraint on each of the 2nd and 3rd dimension. Given a set of N points in three dimension, a particular formulation of such a (2,1,1) query (known as four-sided range reporting in three-dimension) asks to report all those K points within a query region [a, b]X(-infinity, c]X[d, infinity). These queries have overall 4 constraints. In Word-RAM model, the best known structure capable of answering such queries with optimal query time takes O(N log^{epsilon} N) space, where epsilon>0 is any positive constant. It has been shown that any external memory structure in optimal I/Os must use Omega(N log N/ log log_B N) space (in words), where B is the block size [Arge et al., PODS 1999]. In this paper, we study a special type of (2,1,1) queries, where the query parameters a and c are the same i.e., a=c. Even though the query is still four-sided, the number of independent constraints is only three. In other words, one constraint is shared. We call this as a Shared-Constraint Range Reporting (SCRR) problem. We study this problem in both internal as well as external memory models. In RAM model where coordinates can only be compared, we achieve linear-space and O(log N+K) query time solution, matching the best-known three dimensional dominance query bound. Whereas in external memory, we present a linear space structure with O(log_B N + log log N + K/B) query I/Os. We also present an I/O-optimal (i.e., O(log_B N+K/B) I/Os) data structure which occupies O(N log log N)-word space. We achieve these results by employing a novel divide and conquer approach. SCRR finds application in database queries containing sharing among the constraints. We also show that SCRR queries naturally arise in many well known problems such as top-k color reporting, range skyline reporting and ranked document retrieval

Detecting transient gravitational waves in non-Gaussian noise with partially redundant analysis methods

There is a broad class of astrophysical sources that produce detectable, transient, gravitational waves. Some searches for transient gravitational waves are tailored to known features of these sources. Other searches make few assumptions about the sources. Typically events are observable with multiple search techniques. This work describes how to combine the results of searches that are not independent, treating each search as a classifier for a given event. This will be shown to improve the overall sensitivity to gravitational-wave events while directly addressing the problem of consistent interpretation of multiple trials.Comment: 11 pages, 5 figure

Farmers’ Perception and Adoption of Agroforestry Practices in Faridpur District of Bangladesh

This study mainly focused on exploring perception of farmers' towards agroforestry practices and identifying the demographic factors influencing agroforestry adoption in Faridpur district. Field survey was conducted during November-December, 2016 using semi-structured questionnaire. Multi-stage random sampling was used to select upazillas, unions and villages. Snowball purposive sampling was applied to select 84 respondents in total for the questionnaire survey. Chi-square was used to test variables at 5% level of significance. Homestead agroforestry was found to be the most common agroforestry practice (39.28%), followed by fruit-based agroforestry (21.42%), woodlot plantation (13.09%) and so on. Agroforestry was perceived to increase farm productivity by 82.14% of the respondents, 73.8% opined that agroforestry increase household income, while 30.95% perceived it as a means to food security. On the contrary, 34.52% opined that agroforestry practices decrease cash crops production, 17.85% of the respondents stated agroforestry as a difficult practice. Chi-square test showed no significant association between the adoption of agroforestry practices and respondent's age (P > 0.05) or income range (P > 0.05) of the respondents. On the other hand, there is a positive significant association between the adoption of agroforestry practices and educational level (p< 0.05) as well as the farm size (p< 0.05) of the respondents. The study suggests raising awareness regarding the benefits of agroforestry practices as well as providing technical assistance