Does Marriage Matter for Children? Assessing the Impact of Legal Marriage in Sweden

This paper examines whether parental marriage confers educational advantages to children relative to cohabitation. We exploit a dramatic marriage boom in Sweden in late 1989 created by a reform of the Widow’s Pension System that raised the attractiveness of marriage compared to cohabitation to identify the effect of marriage and the effect of selection bias on marriage estimates. Sweden’s rich administrative data sources enable us to identify the children who were affected by parental marriage due to this marriage boom. Our analysis addresses the question of whether marginal marriages created by a policy initiative have an impact on children. Using grade point average at age 16 as the outcome variable, we first show the expected pattern that children with married parents do better than children with cohabiting parents. However, once we control for observable family background and compare the outcomes for children whose parents married due to the reform with those for children whose parents remained unmarried, the differences largely disappear. The results from a sibling difference analysis are consistent with the conclusion that the differentials among children of married and cohabiting parents reflect selection rather than causation.family structure; marriage; child well-being; educational attainment

Family Structure and Child Outcomes in the United States and Sweden

It is well known that children reared in non-intact families on average have less favorable educational outcomes than children reared in two-parent families. Evidence from the United States and Sweden indicates that living in a non-intact family is correlated with lower educational attainment. In this paper we compare the relationships between family structure and children?s outcomes in terms of educational attainment and earnings using data from Sweden and the United States. Comparing the United States and Sweden is interesting because both family structure and public policy environments in the two countries differ significantly. Family structure could potentially have a less negative effect in Sweden than in the United States because of the extensive social safety net provided by that country. We find, however, the associations between family structure and children?s outcomes to be remarkably similar in the United States and Sweden even though the policy and social environments differ between the two countries; living in a non-intact family is negatively related to child outcomes. This relationship is weakened when we control for other family characteristics, such as time lived with full and half siblings. In addition, when we use siblingdifference models to take account of unobserved family characteristics, the relationship is no longer statistically significant. Taken together, our results suggest that the true effect of family structure is more complex than the biological relationship of parents to children in both Sweden and the United States

Information about dissemination of trial results in patient information leaflets for clinicals trials in the UK and Ireland : the what and the when.

Acknowledgments Ellen Murphy and Genevieve Shiely Hayes for their contributions to data collection. Funding: MB was funded for a summer period by the Health Research Board, Ireland through funding from the HRB Trials Methodology Research Network (Ref: HRB TMRN-2017-1). The Health Services Research Unit, Institute of Applied Health Sciences (University of Aberdeen), is core-funded by the Chief Scientist Office of the Scottish Government Health and Social Care Directorates (CZU/3/3). The funders had no involvement in study design, collection, analysis and interpretation of data, reporting or the decision to publish.Peer reviewedPublisher PD

What properties characterize the hub proteins of the protein-protein interaction network of Saccharomyces cerevisiae?

BACKGROUND: Most proteins interact with only a few other proteins while a small number of proteins (hubs) have many interaction partners. Hub proteins and non-hub proteins differ in several respects; however, understanding is not complete about what properties characterize the hubs and set them apart from proteins of low connectivity. Therefore, we have investigated what differentiates hubs from non-hubs and static hubs (party hubs) from dynamic hubs (date hubs) in the protein-protein interaction network of Saccharomyces cerevisiae. RESULTS: The many interactions of hub proteins can only partly be explained by bindings to similar proteins or domains. It is evident that domain repeats, which are associated with binding, are enriched in hubs. Moreover, there is an over representation of multi-domain proteins and long proteins among the hubs. In addition, there are clear differences between party hubs and date hubs. Fewer of the party hubs contain long disordered regions compared to date hubs, indicating that these regions are important for flexible binding but less so for static interactions. Furthermore, party hubs interact to a large extent with each other, supporting the idea of party hubs as the cores of highly clustered functional modules. In addition, hub proteins, and in particular party hubs, are more often ancient. Finally, the more recent paralogs of party hubs are underrepresented. CONCLUSION: Our results indicate that multiple and repeated domains are enriched in hub proteins and, further, that long disordered regions, which are common in date hubs, are particularly important for flexible binding

Spotting Trees with Few Leaves

We show two results related to the Hamiltonicity and $k$-Path algorithms in undirected graphs by Bj\"orklund [FOCS'10], and Bj\"orklund et al., [arXiv'10]. First, we demonstrate that the technique used can be generalized to finding some $k$-vertex tree with $l$ leaves in an $n$-vertex undirected graph in $O^*(1.657^k2^{l/2})$ time. It can be applied as a subroutine to solve the $k$-Internal Spanning Tree ($k$-IST) problem in $O^*(\min(3.455^k, 1.946^n))$ time using polynomial space, improving upon previous algorithms for this problem. In particular, for the first time we break the natural barrier of $O^*(2^n)$. Second, we show that the iterated random bipartition employed by the algorithm can be improved whenever the host graph admits a vertex coloring with few colors; it can be an ordinary proper vertex coloring, a fractional vertex coloring, or a vector coloring. In effect, we show improved bounds for $k$-Path and Hamiltonicity in any graph of maximum degree $\Delta=4,\ldots,12$ or with vector chromatic number at most 8

Randomised controlled trials in pre-hospital trauma : a systematic mapping review

Acknowledgements The authors thank Paul Manson (HSRU Information Scientist) for help with the database searches, Professor Graeme MacLennan for advice on categorising adaptive design trials, and Professor Marion Campbell for commenting on a draft version of the manuscript. Funding statement RL held an NHS Research Scotland Fellowship during the delivery of this project. The Health Services Research Unit, Institute of Applied Health Sciences (University of Aberdeen), is core-funded by the Chief Scientist Office of the Scottish Government Health and Social Care Directorates. The funders had no involvement in study design, collection, analysis and interpretation of data, reporting or the decision to publish.Peer reviewedPublisher PD

Expansion of Protein Domain Repeats

Many proteins, especially in eukaryotes, contain tandem repeats of several domains from the same family. These repeats have a variety of binding properties and are involved in protein–protein interactions as well as binding to other ligands such as DNA and RNA. The rapid expansion of protein domain repeats is assumed to have evolved through internal tandem duplications. However, the exact mechanisms behind these tandem duplications are not well-understood. Here, we have studied the evolution, function, protein structure, gene structure, and phylogenetic distribution of domain repeats. For this purpose we have assigned Pfam-A domain families to 24 proteomes with more sensitive domain assignments in the repeat regions. These assignments confirmed previous findings that eukaryotes, and in particular vertebrates, contain a much higher fraction of proteins with repeats compared with prokaryotes. The internal sequence similarity in each protein revealed that the domain repeats are often expanded through duplications of several domains at a time, while the duplication of one domain is less common. Many of the repeats appear to have been duplicated in the middle of the repeat region. This is in strong contrast to the evolution of other proteins that mainly works through additions of single domains at either terminus. Further, we found that some domain families show distinct duplication patterns, e.g., nebulin domains have mainly been expanded with a unit of seven domains at a time, while duplications of other domain families involve varying numbers of domains. Finally, no common mechanism for the expansion of all repeats could be detected. We found that the duplication patterns show no dependence on the size of the domains. Further, repeat expansion in some families can possibly be explained by shuffling of exons. However, exon shuffling could not have created all repeats

Tree Buffers

In runtime verification, the central problem is to decide if a given program execution violates a given property. In online runtime verification, a monitor observes a program’s execution as it happens. If the program being observed has hard real-time constraints, then the monitor inherits them. In the presence of hard real-time constraints it becomes a challenge to maintain enough information to produce error traces, should a property violation be observed. In this paper we introduce a data structure, called tree buffer, that solves this problem in the context of automata-based monitors: If the monitor itself respects hard real-time constraints, then enriching it by tree buffers makes it possible to provide error traces, which are essential for diagnosing defects. We show that tree buffers are also useful in other application domains. For example, they can be used to implement functionality of capturing groups in regular expressions. We prove optimal asymptotic bounds for our data structure, and validate them using empirical data from two sources: regular expression searching through Wikipedia, and runtime verification of execution traces obtained from the DaCapo test suite

Latent Autoimmune Diabetes in Adults: Background, Safety and Feasibility of an Ongoing Pilot Study With Intra-Lymphatic Injections of GAD-Alum and Oral Vitamin D

BackgroundLatent Autoimmune Diabetes in Adults (LADA) constitutes around 10% of all diabetes. Many LADA patients gradually lose their insulin secretion and progress to insulin dependency. In a recent trial BALAD (Behandling Av LADa) early insulin treatment compared with sitagliptin failed to preserve insulin secretion, which deteriorated in individuals displaying high levels of antibodies to GAD (GADA). These findings prompted us to evaluate a treatment that directly affects autoimmunity. Intra-lymphatic GAD-alum treatment has shown encouraging results in Type 1 diabetes patients. We therefore tested the feasibility of such therapy in LADA-patients (the GADinLADA pilot study).Material and MethodsFourteen GADA-positive (>190 RU/ml), insulin-independent patients 30-70 years old, with LADA diagnosed within < 36 months were included in an open-label feasibility trial. They received an intra-nodal injection of 4 μg GAD-alum at Day 1, 30 and 60 plus oral Vitamin D 2000 U/d from screening 30 days before (Day -30) for 4 months if the vitamin D serum levels were below 100 nmol/L (40 ng/ml). Primary objective is to evaluate safety and feasibility. Mixed Meal Tolerance Test and i.v. Glucagon Stimulation Test at baseline and after 5 and 12 months are used for estimation of beta cell function. Results will be compared with those of the recent BALAD study with comparable patient population. Immunological response is followed.ResultsPreliminary results show feasibility and safety, with almost stable beta cell function and metabolic control during follow-up so far (5 months).ConclusionsIntra-lymphatic GAD-alum treatment is an option to preserve beta cell function in LADA-patients. An ongoing trial in 14 LADA-patients show feasibility and safety. Clinical and immunological responses will determine how to proceed with future trials