Group Strategyproof Pareto-Stable Marriage with Indifferences via the Generalized Assignment Game

We study the variant of the stable marriage problem in which the preferences of the agents are allowed to include indifferences. We present a mechanism for producing Pareto-stable matchings in stable marriage markets with indifferences that is group strategyproof for one side of the market. Our key technique involves modeling the stable marriage market as a generalized assignment game. We also show that our mechanism can be implemented efficiently. These results can be extended to the college admissions problem with indifferences

Independent Set Reconfiguration in Cographs

We study the following independent set reconfiguration problem, called TAR-Reachability: given two independent sets $I$ and $J$ of a graph $G$, both of size at least $k$, is it possible to transform $I$ into $J$ by adding and removing vertices one-by-one, while maintaining an independent set of size at least $k$ throughout? This problem is known to be PSPACE-hard in general. For the case that $G$ is a cograph (i.e. $P_4$-free graph) on $n$ vertices, we show that it can be solved in time $O(n^2)$, and that the length of a shortest reconfiguration sequence from $I$ to $J$ is bounded by $4n-2k$, if such a sequence exists. More generally, we show that if $X$ is a graph class for which (i) TAR-Reachability can be solved efficiently, (ii) maximum independent sets can be computed efficiently, and which satisfies a certain additional property, then the problem can be solved efficiently for any graph that can be obtained from a collection of graphs in $X$ using disjoint union and complete join operations. Chordal graphs are given as an example of such a class $X$

Remote ischemic preconditioning in patients with intermittent claudication

OBJECTIVE: Remote ischemic preconditioning (RIPC) is a phenomenon in which a short period of sub-lethal ischemia in one organ protects against subsequent bouts of ischemia in another organ. We hypothesized that RIPC in patients with intermittent claudication would increase muscle tissue resistance to ischemia, thereby resulting in an increased ability to walk. METHODS: In a claudication clinic, 52 ambulatory patients who presented with complaints of intermittent claudication in the lower limbs associated with an absent or reduced arterial pulse in the symptomatic limb and/or an ankle-brachial index <0.90 were recruited for this study. The patients were randomly divided into three groups (A, B and C). All of the patients underwent two tests on a treadmill according to the Gardener protocol. Group A was tested first without RIPC. Group A was subjected to RIPC prior to the second treadmill test. Group B was subjected to RIPC prior to the first treadmill test and then was subjected to a treadmill test without RIPC. In Group C (control group), both treadmill tests were performed without RIPC. The first and second tests were conducted seven days apart. Brazilian Clinical Trials: RBR-7TF6TM. RESULTS: Group A showed a significant increase in the initial claudication distance in the second test compared to the first test. CONCLUSION: RIPC increased the initial claudication distance in patients with intermittent claudication; however, RIPC did not affect the total walking distance of the patients

Manipulation Strategies for the Rank Maximal Matching Problem

We consider manipulation strategies for the rank-maximal matching problem. In the rank-maximal matching problem we are given a bipartite graph $G = (A \cup P, E)$ such that $A$ denotes a set of applicants and $P$ a set of posts. Each applicant $a \in A$ has a preference list over the set of his neighbours in $G$, possibly involving ties. Preference lists are represented by ranks on the edges - an edge $(a,p)$ has rank $i$, denoted as $rank(a,p)=i$, if post $p$ belongs to one of $a$'s $i$-th choices. A rank-maximal matching is one in which the maximum number of applicants is matched to their rank one posts and subject to this condition, the maximum number of applicants is matched to their rank two posts, and so on. A rank-maximal matching can be computed in $O(\min(c \sqrt{n},n) m)$ time, where $n$ denotes the number of applicants, $m$ the number of edges and $c$ the maximum rank of an edge in an optimal solution. A central authority matches applicants to posts. It does so using one of the rank-maximal matchings. Since there may be more than one rank- maximal matching of $G$, we assume that the central authority chooses any one of them randomly. Let $a_1$ be a manipulative applicant, who knows the preference lists of all the other applicants and wants to falsify his preference list so that he has a chance of getting better posts than if he were truthful. In the first problem addressed in this paper the manipulative applicant $a_1$ wants to ensure that he is never matched to any post worse than the most preferred among those of rank greater than one and obtainable when he is truthful. In the second problem the manipulator wants to construct such a preference list that the worst post he can become matched to by the central authority is best possible or in other words, $a_1$ wants to minimize the maximal rank of a post he can become matched to

Trends in mortality by labour market position around retirement ages in three European countries with different welfare regimes

&lt;p&gt;Objectives: In the face of economic downturn and increasing life expectancy, many industrial nations are adopting a policy of postponing the retirement age. However, questions still remain around the consequence of working longer into old age. We examine mortality by work status around retirement ages in countries with different welfare regimes; Finland (social democratic), Turin (Italy; conservative), and England and Wales (liberal).&lt;/p&gt; &lt;p&gt;Methods: Death rates and rate ratios (RRs) (reference rates = ‘in-work’), 1970 s–2000 s, were estimated for those aged 45–64 years using the England and Wales longitudinal study, Turin longitudinal study, and the Finnish linked register study.&lt;/p&gt; &lt;p&gt;Results: Mortality of the not-in-work was consistently higher than the in-work. Death rates for the not-in-work were lowest in Turin and highest in Finland. Rate ratios were smallest in Turin (RR men 1972–76 1.73; 2002–06 1.63; women 1.22; 1.68) and largest in Finland (RR men 1991–95 3.03; 2001–05 3.80; women 3.62; 4.11). Unlike RRs for men, RRs for women increased in every country (greatest in Finland).&lt;/p&gt; &lt;p&gt;Conclusions: These findings signal that overall, employment in later life is associated with lower mortality, regardless of welfare regime.&lt;/p&gt

Reconfiguration on sparse graphs

A vertex-subset graph problem Q defines which subsets of the vertices of an input graph are feasible solutions. A reconfiguration variant of a vertex-subset problem asks, given two feasible solutions S and T of size k, whether it is possible to transform S into T by a sequence of vertex additions and deletions such that each intermediate set is also a feasible solution of size bounded by k. We study reconfiguration variants of two classical vertex-subset problems, namely Independent Set and Dominating Set. We denote the former by ISR and the latter by DSR. Both ISR and DSR are PSPACE-complete on graphs of bounded bandwidth and W[1]-hard parameterized by k on general graphs. We show that ISR is fixed-parameter tractable parameterized by k when the input graph is of bounded degeneracy or nowhere-dense. As a corollary, we answer positively an open question concerning the parameterized complexity of the problem on graphs of bounded treewidth. Moreover, our techniques generalize recent results showing that ISR is fixed-parameter tractable on planar graphs and graphs of bounded degree. For DSR, we show the problem fixed-parameter tractable parameterized by k when the input graph does not contain large bicliques, a class of graphs which includes graphs of bounded degeneracy and nowhere-dense graphs

Non-Penetrance for Ocular Phenotype in Two Individuals Carrying Heterozygous Loss-of-Function ZEB1 Alleles

ZEB1 loss-of-function (LoF) alleles are known to cause a rare autosomal dominant disorder—posterior polymorphous corneal dystrophy type 3 (PPCD3). To date, 50 pathogenic LoF variants have been identified as disease-causing and familial studies have indicated that the PPCD3 phenotype is penetrant in approximately 95% of carriers. In this study, we interrogated in-house exomes (n = 3616) and genomes (n = 88) for the presence of putative heterozygous LoF variants in ZEB1. Next, we performed detailed phenotyping in a father and his son who carried a novel LoF c.1279C>T; p.(Glu427*) variant in ZEB1 (NM_030751.6) absent from the gnomAD v.2.1.1 dataset. Ocular examination of the two subjects did not show any abnormalities characteristic of PPCD3. GnomAD (n = 141,456 subjects) was also interrogated for LoF ZEB1 variants, notably 8 distinct heterozygous changes presumed to lead to ZEB1 haploinsufficiency, not reported to be associated with PPCD3, have been identified. The NM_030751.6 transcript has a pLI score ≥ 0.99, indicating extreme intolerance to haploinsufficiency. In conclusion, ZEB1 LoF variants are present in a general population at an extremely low frequency. As PPCD3 can be asymptomatic, the true penetrance of ZEB1 LoF variants remains currently unknown but is likely to be lower than estimated by the familial led approaches adopted to date

Should patients with kearns-sayre syndrome and corneal endothelial failure be genotyped for a TCF4 trinucleotide repeat, commonly associated with fuchs endothelial corneal dystrophy?

The aim of this study was to describe the ocular phenotype in a case with Kearns-Sayre syndrome (KSS) spectrum and to determine if corneal endothelial cell dysfunction could be attributed to other known distinct genetic causes. Herein, genomic DNA was extracted from blood and exome sequencing was performed. Non-coding gene regions implicated in corneal endothelial dystrophies were screened by Sanger sequencing. In addition, a repeat expansion situated within an intron of TCF4 (termed CTG18.1) was genotyped using the short tandem repeat assay. The diagnosis of KSS spectrum was based on the presence of ptosis, chronic progressive external ophthalmoplegia, pigmentary retinopathy, hearing loss, and muscle weakness, which were further supported by the detection of ~6.5 kb mtDNA deletion. At the age of 33 years, the proband’s best corrected visual acuity was reduced to 0.04 in the right eye and 0.2 in the left eye. Rare ocular findings included marked corneal oedema with central corneal thickness of 824 and 844 µm in the right and left eye, respectively. No pathogenic variants in the genes, which are associated with corneal endothelial dystrophies, were identified. Furthermore, the CTG18.1 genotype was 12/33, which exceeds a previously determined critical threshold for toxic RNA foci appearance in corneal endothelial cells

Dirac Gauginos, Negative Supertraces and Gauge Mediation

In an attempt to maximize General Gauge Mediated parameter space, I propose simple models in which gauginos and scalars are generated from disconnected mechanisms. In my models Dirac gauginos are generated through the supersoft mechanism, while independent R-symmetric scalar masses are generated through operators involving non-zero messenger supertrace. I propose several new methods for generating negative messenger supertraces which result in viable positive mass squareds for MSSM scalars. The resultant spectra are novel, compressed and may contain light fermionic SM adjoint fields.Comment: 16 pages 3 figure

Ballistic nanofriction

Sliding parts in nanosystems such as Nano ElectroMechanical Systems (NEMS) and nanomotors, increasingly involve large speeds, and rotations as well as translations of the moving surfaces; yet, the physics of high speed nanoscale friction is so far unexplored. Here, by simulating the motion of drifting and of kicked Au clusters on graphite - a workhorse system of experimental relevance -- we demonstrate and characterize a novel "ballistic" friction regime at high speed, separate from drift at low speed. The temperature dependence of the cluster slip distance and time, measuring friction, is opposite in these two regimes, consistent with theory. Crucial to both regimes is the interplay of rotations and translations, shown to be correlated in slow drift but anticorrelated in fast sliding. Despite these differences, we find the velocity dependence of ballistic friction to be, like drift, viscous