The Detailed Chemical Abundance Patterns of M31 Globular Clusters

We present detailed chemical abundances for $>$20 elements in $\sim$30 globular clusters in M31. These results have been obtained using high resolution ($\lambda/\Delta\lambda\sim$24,000) spectra of their integrated light and analyzed using our original method. The globular clusters have galactocentric radii between 2.5 kpc and 117 kpc, and therefore provide abundance patterns for different phases of galaxy formation recorded in the inner and outer halo of M31. We find that the clusters in our survey have a range in metallicity of $-2.2<$[Fe/H]$<-0.11$. The inner halo clusters cover this full range, while the outer halo globular clusters at R$>$20 kpc have a small range in abundance of [Fe/H]$=-1.6 \pm 0.10$. We also measure abundances of alpha, r- and s-process elements. These results constitute the first abundance pattern constraints for old populations in M31 that are comparable to those known for the Milky Way halo.Comment: XII International Symposium on Nuclei in the Cosmos August 5-12, 2012 Cairns, Australia. To appear in Proceedings of Scienc

Large Magnetic Fields and Motions of OH Masers in W75 N

We report on a second epoch of VLBA observations of the 1665 and 1667 MHz OH masers in the massive star-forming region W75 N. We find evidence to confirm the existence of very strong (~40 mG) magnetic fields near source VLA 2. The masers near VLA 2 are dynamically distinct and include a very bright spot apparently moving at 50 km/s relative to those around VLA 1. This fast-moving spot may be an example of a rare class of OH masers seen in outflows in star-forming regions. Due to the variability of these masers and the rapidity of their motions, tracking these motions will require multiple observations over a significantly shorter time baseline than obtained here. Proper motions of the masers near VLA 1 are more suggestive of streaming along magnetized shocks rather than Keplerian rotation in a disk. The motions of the easternmost cluster of masers in W75 N (B) may be tracing slow expansion around an unseen exciting source.Comment: 7 pages including 4 figures (2 color) & 3 tables, to appear in Ap

Comparing the Weighted Density Approximation with the LDA and GGA for Ground State Properties of Ferroelectric Perovskites

First-principles calculations within the weighted density approximation (WDA) were performed for ground state properties of ferroelectric perovskites PbTiO$_3$, BaTiO$_3$, SrTiO$_3$, KNbO$_3$ and KTaO$_3$. We used the plane-wave pseudopotential method, a pair distribution function $G$ based on the uniform electron gas, and shell partitioning. Comparing with the local density approximation (LDA) and the general gradient approximation (GGA), we found that the WDA significantly improves the equilibrium volume of these materials in cubic symmetry over both the LDA and GGA; Ferroelectric instabilities calculated by the WDA agree with the LDA and GGA very well; At the experimental ferroelectric lattice, optimized atom positions by the WDA are in good agreement with measured data; However the WDA overestimates the strain of tetragonal PbTiO$_3$ at experimental volume; The WDA overestimates the volume of fully relaxed structures, but the GGA results are even worse. Some calculations were also done with other models for $G$. It is found that a $G$ with longer range behavior yields improved relaxed structures. Possible avenues for improving the WDA are discussed.Comment: 19 pages, 3 figures, submitted to PR

Where is the length effect? A cross-linguistic study.

Many models of speech production assume that one cannot begin to articulate a word before all its segmental units are inserted into the articulatory plan. Moreover, some of these models assume that segments are serially inserted from left to right. As a consequence, latencies to name words should increase with word length. In a series of five experiments, however, we showed that the time to name a picture or retrieve a word associated with a symbol is not affected by the length of the word. Experiments 1 and 2 used French materials and participants, while Experiments 3, 4 and 5 were conducted with English materials and participants. These results are discussed in relation to current models of speech production, and previous reports of length effects are reevaluated in light of these findings. We conclude that if words are encoded serially, then articulation can start before an entire phonological word has been encoded

Cramer-Rao Lower Bound for Point Based Image Registration with Heteroscedastic Error Model for Application in Single Molecule Microscopy

The Cramer-Rao lower bound for the estimation of the affine transformation parameters in a multivariate heteroscedastic errors-in-variables model is derived. The model is suitable for feature-based image registration in which both sets of control points are localized with errors whose covariance matrices vary from point to point. With focus given to the registration of fluorescence microscopy images, the Cramer-Rao lower bound for the estimation of a feature's position (e.g. of a single molecule) in a registered image is also derived. In the particular case where all covariance matrices for the localization errors are scalar multiples of a common positive definite matrix (e.g. the identity matrix), as can be assumed in fluorescence microscopy, then simplified expressions for the Cramer-Rao lower bound are given. Under certain simplifying assumptions these expressions are shown to match asymptotic distributions for a previously presented set of estimators. Theoretical results are verified with simulations and experimental data

Pseudorandom Generators for Width-3 Branching Programs

We construct pseudorandom generators of seed length $\tilde{O}(\log(n)\cdot \log(1/\epsilon))$ that $\epsilon$-fool ordered read-once branching programs (ROBPs) of width $3$ and length $n$. For unordered ROBPs, we construct pseudorandom generators with seed length $\tilde{O}(\log(n) \cdot \mathrm{poly}(1/\epsilon))$. This is the first improvement for pseudorandom generators fooling width $3$ ROBPs since the work of Nisan [Combinatorica, 1992]. Our constructions are based on the `iterated milder restrictions' approach of Gopalan et al. [FOCS, 2012] (which further extends the Ajtai-Wigderson framework [FOCS, 1985]), combined with the INW-generator [STOC, 1994] at the last step (as analyzed by Braverman et al. [SICOMP, 2014]). For the unordered case, we combine iterated milder restrictions with the generator of Chattopadhyay et al. [CCC, 2018]. Two conceptual ideas that play an important role in our analysis are: (1) A relabeling technique allowing us to analyze a relabeled version of the given branching program, which turns out to be much easier. (2) Treating the number of colliding layers in a branching program as a progress measure and showing that it reduces significantly under pseudorandom restrictions. In addition, we achieve nearly optimal seed-length $\tilde{O}(\log(n/\epsilon))$ for the classes of: (1) read-once polynomials on $n$ variables, (2) locally-monotone ROBPs of length $n$ and width $3$ (generalizing read-once CNFs and DNFs), and (3) constant-width ROBPs of length $n$ having a layer of width $2$ in every consecutive $\mathrm{poly}\log(n)$ layers.Comment: 51 page