Super-stability in the Student-Project Allocation Problem with Ties

The Student-Project Allocation problem with lecturer preferences over Students ( Open image in new window ) involves assigning students to projects based on student preferences over projects, lecturer preferences over students, and the maximum number of students that each project and lecturer can accommodate. This classical model assumes that preference lists are strictly ordered. Here, we study a generalisation of Open image in new window where ties are allowed in the preference lists of students and lecturers, which we refer to as the Student-Project Allocation problem with lecturer preferences over Students with Ties ( Open image in new window ). We investigate stable matchings under the most robust definition of stability in this context, namely super-stability. We describe the first polynomial-time algorithm to find a super-stable matching or to report that no such matching exists, given an instance of Open image in new window . Our algorithm runs in O(L) time, where L is the total length of all the preference lists. Finally, we present results obtained from an empirical evaluation of the linear-time algorithm based on randomly-generated Open image in new window instances. Our main finding is that, whilst super-stable matchings can be elusive, the probability of such a matching existing is significantly higher if ties are restricted to the lecturers’ preference lists

Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems

When ties and incomplete preference lists are permitted in the Stable Marriage and Hospitals/Residents problems, stable matchings can have different sizes. The problem of finding a maximum cardinality stable matching in this context is known to be NP-hard, even under very severe restrictions on the number, size and position of ties. In this paper, we describe polynomial-time 5/3-approximation algorithms for variants of these problems in which ties are on one side only and at the end of the preference lists. The particular variant is motivated by important applications in large scale centralised matching schemes

An Algorithm for Strong Stability in the Student-Project Allocation Problem With Ties

We study a variant of the Student-Project Allocation problem with lecturer preferences over Students where ties are allowed in the preference lists of students and lecturers (spa-st). We investigate the concept of strong stability in this context. Informally, a matching is strongly stable if there is no student and lecturer l such that if they decide to form a private arrangement outside of the matching via one of l’s proposed projects, then neither party would be worse off and at least one of them would strictly improve. We describe the first polynomial-time algorithm to find a strongly stable matching or report that no such matching exists, given an instance of spa-st. Our algorithm runs in O(m2) time, where m is the total length of the students’ preference lists

Integer programming methods for special college admissions problems

We develop Integer Programming (IP) solutions for some special college admission problems arising from the Hungarian higher education admission scheme. We focus on four special features, namely the solution concept of stable score-limits, the presence of lower and common quotas, and paired applications. We note that each of the latter three special feature makes the college admissions problem NP-hard to solve. Currently, a heuristic based on the Gale-Shapley algorithm is being used in the application. The IP methods that we propose are not only interesting theoretically, but may also serve as an alternative solution concept for this practical application, and also for other ones

An Integer Programming Approach to the Student-Project Allocation Problem with Preferences over Projects

The Student-Project Allocation problem with preferences over Projects (SPA-P) involves sets of students, projects and lecturers, where the students and lecturers each have preferences over the projects. In this context, we typically seek a stable matching of students to projects (and lecturers). However, these stable matchings can have different sizes, and the problem of finding a maximum stable matching (MAX-SPA-P) is NP-hard. There are two known approximation algorithms for MAX-SPA-P, with performance guarantees of 2 and 32 . In this paper, we describe an Integer Programming (IP) model to enable MAX-SPA-P to be solved optimally. Following this, we present results arising from an empirical analysis that investigates how the solution produced by the approximation algorithms compares to the optimal solution obtained from the IP model, with respect to the size of the stable matchings constructed, on instances that are both randomly-generated and derived from real datasets. Our main finding is that the 32 -approximation algorithm finds stable matchings that are very close to having maximum cardinality

Complex mosaic structural variations in human fetal brains

Somatic mosaicism, manifesting as single nucleotide variants (SNVs), mobile element insertions and structural changes in the DNA, is a common phenomenon in human brain cells, with potential functional consequences. Using a clonal approach, we previously detected 200-400 mosaic SNVs per cell in three human fetal brains (15 to 21 weeks post-conception). However, structural variation in the human fetal brain has not yet been investigated. Here, we discover and validate four mosaic structural variants (SVs) in the same brains and resolve their precise breakpoints. The SVs were of kilobase scale and complex, consisting of deletion(s) and rearranged genomic fragments, which sometimes originated from different chromosomes. Sequences at the breakpoints of these rearrangements had microhomologies, suggesting their origin from replication errors. One SV was found in two clones and we timed its origin to ~14 weeks post-conception. No large scale mosaic copy number variants (CNVs) were detectable in normal fetal human brains, suggesting that previously reported megabase-scale CNVs in neurons arise at later stages of development. By reanalysis of public single nuclei data from adult brain neurons, we detected an extra-chromosomal circular DNA event. Our study reveals the existence of mosaic SVs in the developing human brain, likely arising from cell proliferation during mid-neurogenesis. Although relatively rare compared to SNVs, and present in ~10% neurons, SVs in developing human brain affect a comparable number of bases in the genome (~6,200 vs ~4,000 bps), implying that they may have similar functional consequences

Immune cell constitution in bone marrow microenvironment predicts outcome in adult ALL

As novel immunological treatments are gaining a foothold in the treatment of acute lymphoblastic leukemia (ALL), it is elemental to examine ALL immunobiology in more detail. We used multiplexed immunohistochemistry (mIHC) to study the immune contexture in adult precursor B cell ALL bone marrow (BM). In addition, we developed a multivariate risk prediction model that stratified a poor survival group based on clinical parameters and mIHC data. We analyzed BM biopsy samples of ALL patients (n = 52) and healthy controls (n = 14) using mIHC with 30 different immunophenotype markers and computerized image analysis. In ALL BM, the proportions of M1-like macrophages, granzyme B+CD57+CD8+ T cells, and CD27+ T cells were decreased, whereas the proportions of myeloid-derived suppressor cells and M2-like macrophages were increased. Also, the expression of checkpoint molecules PD1 and CTLA4 was elevated. In the multivariate model, age, platelet count, and the proportion of PD1+TIM3+ double-positive CD4+ T cells differentiated a poor survival group. These results were validated by flow cytometry in a separate cohort (n = 31). In conclusion, the immune cell contexture in ALL BM differs from healthy controls. CD4+PD1+TIM3+ T cells were independent predictors of poor outcome in our multivariate risk model, suggesting that PD1 might serve as an attractive immuno-oncological target in B-ALL.Peer reviewe

Study for alternative refrigerants: part 1: composition shift in liquid recirculation systems: part 2: a simple prediction method for the condensation heat transfer of alternative refrigerants inside a microfin tube

Dottorato di ricerca in fisica tecnicaConsiglio Nazionale delle Ricerche - Biblioteca Centrale - P.le Aldo Moro, 7 Rome; Biblioteca Nazionale Centrale - P.za Cavalleggeri, 1, Florence / CNR - Consiglio Nazionale delle RichercheSIGLEITItal