Ovarian Cancer Screening: Current status and future directions

Ovarian cancer is the third most common gynaecological malignancy and the most lethal worldwide. Most patients are diagnosed with advanced disease which carries significant mortality. Improvements in treatment have only resulted in modest increases in survival. This has driven efforts to reduce mortality through screening. Multimodal ovarian cancer screening using a longitudinal CA125 algorithm has resulted in diagnosis at an earlier stage, both in average and high risk women in two large UK trials. However, no randomised controlled trial has demonstrated a definitive mortality benefit. Extended follow up is underway in the largest trial to date, UKCTOCS to explore the delayed reduction in mortality that was noted. Meanwhile, screening is not currently recommended in the general population Some countries offer surveillance of high risk women. Novel screening modalities and longitudinal biomarker algorithms offer potential improvements to future screening strategies as does the development of better risk stratification tools

Nash bargaining in ordinal environments

We analyze the implications of Nash’s (1950) axioms in ordinal bargaining environments; there, the scale invariance axiom needs to be strenghtened to take into account all order-preserving transformations of the agents’ utilities. This axiom, called ordinal invariance, is a very demanding one. For two-agents, it is violated by every strongly individually rational bargaining rule. In general, no ordinally invariant bargaining rule satisfies the other three axioms of Nash. Parallel to Roth (1977), we introduce a weaker independence of irrelevant alternatives axiom that we argue is better suited for ordinally invariant bargaining rules. We show that the three-agent Shapley-Shubik bargaining rule uniquely satisfies ordinal invariance, Pareto optimality, symmetry, and this weaker independence of irrelevant alternatives axiom. We also analyze the implications of other independence axioms

Fully Dynamic Matching in Bipartite Graphs

Maximum cardinality matching in bipartite graphs is an important and well-studied problem. The fully dynamic version, in which edges are inserted and deleted over time has also been the subject of much attention. Existing algorithms for dynamic matching (in general graphs) seem to fall into two groups: there are fast (mostly randomized) algorithms that do not achieve a better than 2-approximation, and there slow algorithms with \O(\sqrt{m}) update time that achieve a better-than-2 approximation. Thus the obvious question is whether we can design an algorithm -- deterministic or randomized -- that achieves a tradeoff between these two: a $o(\sqrt{m})$ approximation and a better-than-2 approximation simultaneously. We answer this question in the affirmative for bipartite graphs. Our main result is a fully dynamic algorithm that maintains a 3/2 + \eps approximation in worst-case update time O(m^{1/4}\eps^{/2.5}). We also give stronger results for graphs whose arboricity is at most \al, achieving a (1+ \eps) approximation in worst-case time O(\al (\al + \log n)) for constant \eps. When the arboricity is constant, this bound is $O(\log n)$ and when the arboricity is polylogarithmic the update time is also polylogarithmic. The most important technical developement is the use of an intermediate graph we call an edge degree constrained subgraph (EDCS). This graph places constraints on the sum of the degrees of the endpoints of each edge: upper bounds for matched edges and lower bounds for unmatched edges. The main technical content of our paper involves showing both how to maintain an EDCS dynamically and that and EDCS always contains a sufficiently large matching. We also make use of graph orientations to help bound the amount of work done during each update.Comment: Longer version of paper that appears in ICALP 201

Normal frames for general connections on differentiable fibre bundles

The theory of frames normal for general connections on differentiable bundles is developed. Links with the existing theory of frames normal for covariant derivative operators (linear connections) in vector bundles are revealed. The existence of bundle coordinates normal at a given point and/or along injective horizontal path is proved. A necessary and sufficient condition of existence of bundle coordinates normal along injective horizontal mappings is derived.Comment: 24 LaTeX pages. The packages AMS-LaTeX and amsfonts are required. In version 2 some results are generalized and proved under weaker conditions. For other papers on the same topic view the "publication" pages at http://theo.inrne.bas.bg/~bozho

Magnetic field induced charge and spin instabilities in cuprate superconductors

A d-wave superconductor, subject to strong phase fluctuations, is known to suffer an antiferromagnetic instability closely related to the chiral symmetry breaking in (2+1)-dimensional quantum electrodynamics (QED3). On the basis of this idea we formulate a "QED3 in a box" theory of local instabilities of a d-wave superconductor in the vicinity of a single pinned vortex undergoing quantum fluctuations around its equilibrium position. As a generic outcome we find an incommensurate 2D spin density wave forming in the neighborhood of a vortex with a concomitant "checkerboard" pattern in the local electronic density of states, in agreement with recent neutron scattering and tunneling spectroscopy measurements.Comment: 4 pages REVTeX + 2 PostScript figures included in text. Version to appear in PRL (minor stylistic changes, references updated). For related work and info visit http://www.physics.ubc.ca/~fran

UC-433 Finding the Limits of AI for Web Development in 2023

Our team was tasked with finding the limits of artificial intelligence for web development in 2023. This involved our team researching what the different parts of a website are, how to prompt an AI chatbot to provide us with source code, and how to put together a working prototype of an auction website by the end of our project. Our team produced various documents along the way that show our progress such as various slideshow files, documentation word docs, and a research report on our findings. After working with the AI to produce source code for our website, we have come to realize that an AI is helpful for making general outlines but, starts to have diminishing returns if one tries to get it to produce an entire website. Making general outlines can be quick but, you must be very specific in your prompting to get fully usable code that requires no modification. With this being the case, we believe that AI should be used as a sort of co-pilot when it comes to web development in 2023