Barren

In the aftermath of their baby’s stillbirth, eccentric couple Marlow and Dev clash with overbearing loved ones, outspoken neighbor kids, and each other while trying to reconcile unmet expectations and their newfound reality. Bottling up her emotions, Marlow begins to see inanimate objects speak, spewing out the feelings she hopes to keep suppressed

Why Don't Women Patent?

We investigate women's underrepresentation among holders of commercialized patents: only 5.5% of holders of such patents are female. Using the National Survey of College Graduates 2003, we find only 7% of the gap is accounted for by women's lower probability of holding any science or engineering degree, because women with such a degree are scarcely more likely to patent than women without. Differences among those without a science or engineering degree account for 15%, while 78% is accounted for by differences among those with a science or engineering degree. For the latter group, we find that women's underrepresentation in engineering and in jobs involving development and design explain much of the gap; closing it would increase U.S. GDP per capita by 2.7%.

Limitations of variable number of tandem repeat typing identified through whole genome sequencing of Mycobacterium avium subsp. paratuberculosis on a national and herd level

Background: Mycobacterium avium subsp. paratuberculosis (MAP), the causative bacterium of Johne’s disease in dairy cattle, is widespread in the Canadian dairy industry and has significant economic and animal welfare implications. An understanding of the population dynamics of MAP can be used to identify introduction events, improve control efforts and target transmission pathways, although this requires an adequate understanding of MAP diversity and distribution between herds and across the country. Whole genome sequencing (WGS) offers a detailed assessment of the SNP-level diversity and genetic relationship of isolates, whereas several molecular typing techniques used to investigate the molecular epidemiology of MAP, such as variable number of tandem repeat (VNTR) typing, target relatively unstable repetitive elements in the genome that may be too unpredictable to draw accurate conclusions. The objective of this study was to evaluate the diversity of bovine MAP isolates in Canadian dairy herds using WGS and then determine if VNTR typing can distinguish truly related and unrelated isolates.<p></p> Results: Phylogenetic analysis based on 3,039 SNPs identified through WGS of 124 MAP isolates identified eight genetically distinct subtypes in dairy herds from seven Canadian provinces, with the dominant type including over 80% of MAP isolates. VNTR typing of 527 MAP isolates identified 12 types, including “bison type” isolates, from seven different herds. At a national level, MAP isolates differed from each other by 1–2 to 239–240 SNPs, regardless of whether they belonged to the same or different VNTR types. A herd-level analysis of MAP isolates demonstrated that VNTR typing may both over-estimate and under-estimate the relatedness of MAP isolates found within a single herd.<p></p> Conclusions: The presence of multiple MAP subtypes in Canada suggests multiple introductions into the country including what has now become one dominant type, an important finding for Johne’s disease control. VNTR typing often failed to identify closely and distantly related isolates, limiting the applicability of using this typing scheme to study the molecular epidemiology of MAP at a national and herd-level.<p></p&gt

Evolution of Network Enumeration Strategies in Emulated Computer Networks

Successful attacks on computer networks today do not often owe their victory to directly overcoming strong security measures set up by the defender. Rather, most attacks succeed because the number of possible vulnerabilities are too large for humans to fully protect without making a mistake. Regardless of the security elsewhere, a skilled attacker can exploit a single vulnerability in a defensive system and negate the benefits of those security measures. This paper presents an evolutionary framework for evolving attacker agents in a real, emulated network environment using genetic programming, as a foundation for coevolutionary systems which can automatically discover and mitigate network security flaws. We examine network enumeration, an initial network reconnaissance step, through our framework and present results demonstrating its success, indicating a broader applicability to further cyber-security tasks

Solving Partition Problems Almost Always Requires Pushing Many Vertices Around

A fundamental graph problem is to recognize whether the vertex set of a graph G can be bipartitioned into sets A and B such that G[A] and G[B] satisfy properties Pi_A and Pi_B, respectively. This so-called (Pi_A,Pi_B)-Recognition problem generalizes amongst others the recognition of 3-colorable, bipartite, split, and monopolar graphs. A powerful algorithmic technique that can be used to obtain fixed-parameter algorithms for many cases of (Pi_A,Pi_B)-Recognition, as well as several other problems, is the pushing process. For bipartition problems, the process starts with an "almost correct" bipartition (A\u27,B\u27), and pushes appropriate vertices from A\u27 to B\u27 and vice versa to eventually arrive at a correct bipartition. In this paper, we study whether (Pi_A,Pi_B)-Recognition problems for which the pushing process yields fixed-parameter algorithms also admit polynomial problem kernels. In our study, we focus on the first level above triviality, where Pi_A is the set of P_3-free graphs (disjoint unions of cliques, or cluster graphs), the parameter is the number of clusters in the cluster graph G[A], and Pi_B is characterized by a set H of connected forbidden induced subgraphs. We prove that, under the assumption that NP not subseteq coNP/poly, (Pi_A,Pi_B)-Recognition admits a polynomial kernel if and only if H contains a graph of order at most 2. In both the kernelization and the lower bound results, we make crucial use of the pushing process

Disconnected cuts in claw-free graphs.

A disconnected cut of a connected graph is a vertex cut that itself also induces a disconnected subgraph. The corresponding decision problem is called Disconnected Cut. It is known that Disconnected Cut is NP-hard on general graphs, while polynomial-time algorithms exist for several graph classes. However, the complexity of the problem on claw-free graphs remained an open question. Its connection to the complexity of the problem to contract a claw-free graph to the 4-vertex cycle C4 led Ito et al. (TCS 2011) to explicitly ask to resolve this open question. We prove that Disconnected Cut is polynomial-time solvable on claw-free graphs, answering the question of Ito et al. The basis for our result is a decomposition theorem for claw-free graphs of diameter 2, which we believe is of independent interest and builds on the research line initiated by Chudnovsky and Seymour (JCTB 2007–2012) and Hermelin et al. (ICALP 2011). On our way to exploit this decomposition theorem, we characterize how disconnected cuts interact with certain cobipartite subgraphs, and prove two further algorithmic results, namely that Disconnected Cut is polynomial-time solvable on circular-arc graphs and line graphs

The Living Planet Index (LPI) for migratory freshwater fish:Technical Report

Migratory freshwater fish (i.e. fish that use freshwater systems, either partly or exclusively) occur around the world and travel between critical habitats to complete their life cycle. They are disproportionately threatened compared to other fish groups but global trends in abun-dance, regional differences and drivers of patterns have not yet been comprehensively described. Using abundance information from the Living Planet Database, we found widespread declines between 1970 and 2016 in tropical and temperate areas and across all regions, all migration categories and all populations. Globally, migratory freshwater fish have declined by an average of 76%. Average declines have been more pronounced in Europe (-93%) and Latin America & Caribbean (-84%), and least in North America (-28%). The percentage of species represented was highest in the two temperate regions of Europe and North America (almost 50%). For the continents of Africa, Asia, Oceania, and South America, data was highly deficient, and we advise against making conclusions on the status of migratory freshwater SUMMARYfish in these areas. Potamodromous fish, have declined more than fish migrating between fresh and salt water on average (-83% vs -73%). Populations that are known to be affected by threats anywhere along their migration routes show an average decline of 94% while those not threatened at the population level have increased on av-erage. Habitat degradation, alteration, and loss accounted for around a half of threats to migratory fish, while over-exploitation accounted for around one-third. Protected, regulated and exploited populations decreased less than unmanaged ones, with the most often recorded actions being related to fisheries regulations, including fishing restrictions, no-take zones, fisheries closures, bycatch reductions and stocking (these were most com-mon in North America and Europe). Recorded reasons for observed increases tended to be mostly unknown or un-described, especially in tropical regions. This information is needed to assemble a more complete picture to assess how declines in migratory freshwater fishes could be reduced or reversed. Our findings confirm that migratory freshwater fish may be more threatened throughout their range than previously documented