Observations of Dispersion Cancellation of Entangled Photon Pairs

An experimental study of the dispersion cancellation occurring in frequency-entangled photon pairs is presented. The approach uses time-resolved up conversion of the pairs, which has temporal resolution at the fs level, and group-delay dispersion sensitivity of $\approx \ 20 \, \mathrm{fs}^2$ under experimental conditions. The cancellation is demonstrated with dispersion stronger than $\pm 10^3 \, \mathrm{fs}^2$ in the signal $(-)$ and idler $(+)$ modes. The observations represent the generation, compression, and characterization of ultrashort biphotons with correlation width as small as 6.8 times the degenerate optical period.Comment: 5 pages, 3 figure

A composition theorem for the Fourier Entropy-Influence conjecture

The Fourier Entropy-Influence (FEI) conjecture of Friedgut and Kalai [FK96] seeks to relate two fundamental measures of Boolean function complexity: it states that $H[f] \leq C Inf[f]$ holds for every Boolean function $f$, where $H[f]$ denotes the spectral entropy of $f$, $Inf[f]$ is its total influence, and $C > 0$ is a universal constant. Despite significant interest in the conjecture it has only been shown to hold for a few classes of Boolean functions. Our main result is a composition theorem for the FEI conjecture. We show that if $g_1,...,g_k$ are functions over disjoint sets of variables satisfying the conjecture, and if the Fourier transform of $F$ taken with respect to the product distribution with biases $E[g_1],...,E[g_k]$ satisfies the conjecture, then their composition $F(g_1(x^1),...,g_k(x^k))$ satisfies the conjecture. As an application we show that the FEI conjecture holds for read-once formulas over arbitrary gates of bounded arity, extending a recent result [OWZ11] which proved it for read-once decision trees. Our techniques also yield an explicit function with the largest known ratio of $C \geq 6.278$ between $H[f]$ and $Inf[f]$, improving on the previous lower bound of 4.615

Fourier-based Function Secret Sharing with General Access Structure

Function secret sharing (FSS) scheme is a mechanism that calculates a function f(x) for x in {0,1}^n which is shared among p parties, by using distributed functions f_i:{0,1}^n -> G, where G is an Abelian group, while the function f:{0,1}^n -> G is kept secret to the parties. Ohsawa et al. in 2017 observed that any function f can be described as a linear combination of the basis functions by regarding the function space as a vector space of dimension 2^n and gave new FSS schemes based on the Fourier basis. All existing FSS schemes are of (p,p)-threshold type. That is, to compute f(x), we have to collect f_i(x) for all the distributed functions. In this paper, as in the secret sharing schemes, we consider FSS schemes with any general access structure. To do this, we observe that Fourier-based FSS schemes by Ohsawa et al. are compatible with linear secret sharing scheme. By incorporating the techniques of linear secret sharing with any general access structure into the Fourier-based FSS schemes, we show Fourier-based FSS schemes with any general access structure.Comment: 12 page

Moving beyond the ‘language problem': developing an understanding of the intersections of health, language and immigration status in interpreter-mediated health encounters

Health systems internationally are dealing with greater diversity in patient populations. However the focus on ‘the language problem’ has meant little attention is paid to diversity within and between migrant populations; and how interpreted consultations are influenced by intersecting migratory, ethnicity and sociodemographic variables. Our analysis of the experiences of patients, health care providers and interpreters in Scotland evidences the need to move beyond language, addressing multiple hidden inequalities in health care access and provision that operate in both clinic and, especially, home-based settings. We call for a practice-evidenced research agenda promoting cultural communication across health care and home settings, acknowledging immigration status as a social determinant of health. Sur le plan international, des systèmes de santé font face à une diversité croissante dans ses populations de patients. Cependant, l’accent sur ‘le problème de langue’ se traduit dans une manque d’attention à la diversité a l’intérieur même et entre des populations des migrants; et la façon par laquelle des variables migratoire, ethnique et sociodémographique influencent elles-mêmes des consultations interprétées. Notre analyse des expériences des patients, des professionnels fournissant de soins de santé et des interprètes offre des preuves du besoin de dépasser le problème de langue. Et en faisant cela, nous adressons des multiples inégalités, souvent cachées dans des contextes de soins de santé, dans les milieux clinique et domicile. Nous proposons un programme de recherche basé sur la pratique, qui favorise la communication culturelle dans des milieux clinique et domicile, et qui reconnait le statut d’immigration comme un déterminant social de la santé

First principles calculation of uniaxial magnetic anisotropy and magnetostriction in strained CMR films

We performed first - principles relativistic full-potential linearized augmented plane wave calculations for strained tetragonal ferromagnetic La(Ba)MnO$_3$ with an assumed experimental structure of thin strained tetragonal La$_{0.67}$Ca$_{0.33}$MnO$_3$ (LCMO) films grown on SrTiO$_3$[001] and LaAlO$_3$[001] substrates. The calculated uniaxial magnetic anisotropy energy (MAE) values, are in good quantitative agreement with experiment for LCMO films on SrTiO$_3$ substrate. We also analyze the applicability of linear magnetoelastic theory for describing the stain dependence of MAE, and estimate magnetostriction coefficient $\lambda_{001}$.Comment: Talk given at APS99 Meeting, Atlanta, 199

A Fast and Accessible Methodology for Micro-Patterning Cells on Standard Culture Substrates Using Parafilm™ Inserts

Micropatterning techniques provide direct control over the spatial organization of cells at the sub-mm scale. Regulation of these spatial parameters is important for controlling cell fate and cell function. While micropatterning has proved a powerful technique for understanding the impact of cell organization on cell behaviour, current methods for micropatterning cells require complex, specialized equipment that is not readily accessible in most biological and bioengineering laboratories. In addition, currently available methods require significant protocol optimization to ensure reliable and reproducible patterning. The inaccessibility of current methods has severely limited the widespread use of micropatterning as a tool in both biology and tissue engineering laboratories. Here we present a simple, cheap, and fast method to micropattern mammalian cells into stripes and circular patterns using Parafilm™, a common material found in most biology and bioengineering laboratories. Our method does not require any specialized equipment and does not require significant method optimization to ensure reproducible patterning. Although our method is limited to simple patterns, these geometries are sufficient for addressing a wide range of biological problems. Specifically, we demonstrate i) that using our Parafilm™ insert method we can pattern and co-pattern ARPE-19 and MDCK epithelial cells into circular and stripe micropatterns in tissue culture polystyrene (TCPS) wells and on glass slides, ii) that we can contain cells in the desired patterns for more than one month and iii) that upon removal of the Parafilm™ insert we can release the cells from the containment pattern and allow cell migration outward from the original pattern. We also demonstrate that we can exploit this confinement release feature to conduct an epithelial cell wound healing assay. This novel micropatterning method provides a reliable and accessible tool with the flexibility to address a wide range of biological and engineering problems that require control over the spatial and temporal organization of cells

Generalized Satisfiability Problems via Operator Assignments

Schaefer introduced a framework for generalized satisfiability problems on the Boolean domain and characterized the computational complexity of such problems. We investigate an algebraization of Schaefer's framework in which the Fourier transform is used to represent constraints by multilinear polynomials in a unique way. The polynomial representation of constraints gives rise to a relaxation of the notion of satisfiability in which the values to variables are linear operators on some Hilbert space. For the case of constraints given by a system of linear equations over the two-element field, this relaxation has received considerable attention in the foundations of quantum mechanics, where such constructions as the Mermin-Peres magic square show that there are systems that have no solutions in the Boolean domain, but have solutions via operator assignments on some finite-dimensional Hilbert space. We obtain a complete characterization of the classes of Boolean relations for which there is a gap between satisfiability in the Boolean domain and the relaxation of satisfiability via operator assignments. To establish our main result, we adapt the notion of primitive-positive definability (pp-definability) to our setting, a notion that has been used extensively in the study of constraint satisfaction problems. Here, we show that pp-definability gives rise to gadget reductions that preserve satisfiability gaps. We also present several additional applications of this method. In particular and perhaps surprisingly, we show that the relaxed notion of pp-definability in which the quantified variables are allowed to range over operator assignments gives no additional expressive power in defining Boolean relations