The Analysis of Data from Continuous Probability Distributions

Conventional statistics begins with a model, and assigns a likelihood of obtaining any particular set of data. The opposite approach, beginning with the data and assigning a likelihood to any particular model, is explored here for the case of points drawn randomly from a continuous probability distribution. A scalar field theory is used to assign a likelihood over the space of probability distributions. The most likely distribution may be calculated, providing an estimate of the underlying distribution and a convenient graphical representation of the raw data. Fluctuations around this maximum likelihood estimate are characterized by a robust measure of goodness-of-fit. Its distribution may be calculated by integrating over fluctuations. The resulting method of data analysis has some advantages over conventional approaches.Comment: 8 pages, 2 figures, REVTe

Ultrasonic Songs of Male Mice

Previously it was shown that male mice, when they encounter female mice or their pheromones, emit ultrasonic vocalizations with frequencies ranging over 30–110 kHz. Here, we show that these vocalizations have the characteristics of song, consisting of several different syllable types, whose temporal sequencing includes the utterance of repeated phrases. Individual males produce songs with characteristic syllabic and temporal structure. This study provides a quantitative initial description of male mouse songs, and opens the possibility of studying song production and perception in an established genetic model organism

A hierarchy of Ramsey-like cardinals

We introduce a hierarchy of large cardinals between weakly compact and measurable cardinals, that is closely related to the Ramsey-like cardinals introduced by Victoria Gitman, and is based on certain infinite filter games, however also has a range of equivalent characterizations in terms of elementary embeddings. The aim of this paper is to locate the Ramsey-like cardinals studied by Gitman, and other well-known large cardinal notions, in this hierarchy

G-quadruplex Mediated Splicing of p53 mRNA

The protein p53 is a master regulator of the cell cycle and its mutation/inactivation is associated with over 50% of cancer cases. Mutations in p53 are associated with worse survival rates, resistance to therapies, and other risk factors in breast cancer specifically. p53 is encoded by the TP53 gene and is expressed as several transcripts. In the G-rich portion of intron 3, secondary DNA structures known as G-quadruplexes are able to form. The stabilization of these G-quadruplexes leads to correct splicing of intron 2, thus making a functional p53 protein. A known quadruplex-stabilizing compound (TMPyP4) was tested to determine its ability to stabilize these structures through electronic circular dichroism. The effect TMPyP4 had on pre-mRNA splicing of p53 in MCF-7 breast cancer cells was also evaluated through real-time quantitative polymerase chain reaction and gel electrophoresis. This compound did possess stabilizing qualities in the intron 3 region of the TP53 gene. Although more pharmacologic testing needs to be completed, TMPyP4 shows potential to regulate splicing of p53, which could improve the prognosis of breast cancer patients

Class forcing, the forcing theorem and Boolean completions

The forcing theorem is the most fundamental result about set forcing, stating that the forcing relation for any set forcing is definable and that the truth lemma holds, that is everything that holds in a generic extension is forced by a condition in the relevant generic filter. We show that both the definability (and, in fact, even the amenability) of the forcing relation and the truth lemma can fail for class forcing. In addition to these negative results, we show that the forcing theorem is equivalent to the existence of a (certain kind of) Boolean completion, and we introduce a weak combinatorial property (approachability by projections) that implies the forcing theorem to hold. Finally, we show that unlike for set forcing, Boolean completions need not be unique for class forcing

Forcing lightface definable well-orders without the CGH

For any given uncountable cardinal $\kappa$ with $\kappa^{{<}\kappa}=\kappa$, we present a forcing that is $<\kappa$-directed closed, has the $\kappa^+$-c.c. and introduces a lightface definable well-order of $H(\kappa^+)$. We use this to define a global iteration that does this for all such $\kappa$ simultaneously and is capable of preserving the existence of many large cardinals in the universe