Quasiconvex Programming

We define quasiconvex programming, a form of generalized linear programming in which one seeks the point minimizing the pointwise maximum of a collection of quasiconvex functions. We survey algorithms for solving quasiconvex programs either numerically or via generalizations of the dual simplex method from linear programming, and describe varied applications of this geometric optimization technique in meshing, scientific computation, information visualization, automated algorithm analysis, and robust statistics.Comment: 33 pages, 14 figure

Enhancing rotational placement of reconstruction prostheses of the distal femur after sarcoma resection

Introduction: Currently there are no accepted international guidelines for the correct placement of reconstruction prostheses in the axial plane of the femur after en bloc resection. The most accepted method is based on the linea aspera as an intraoperative landmark, indicating posterior. This study was conducted to address the reliability of the linea aspera as a landmark for rotational alignment. Material and methods: 50 CT angiographies of the right limb were used for this purpose. These 2D images were reconstructed into 3D models using proprietary software (materialize NV, Leuven, Belgium). The posterior condylar line was used as a reference axis. The orientation of the linea aspera was described as the angle between the perpendicular line to the PCL, through the center of the diaphysis, and the lateral (a) and medial labium (beta). Results: The linear mixed model shows that the alpha- and beta-angles are significantly associated with the distance from the joint line (p<0.001) and vary significantly between subjects (p<0.001). The alpha-angle has the lowest variance and approximates more closely true posterior, while the median beta-angle never overlaps true posterior. Discussion: When a surgeon would blindly rely on the linea aspera as a posterior landmark roughly 78% of the femoral implants would exceed the accepted +/- 3 degrees deviation around the surgical transepicondylar axis (sTEA) as defined in total knee replacement. The linea aspera is not a reliable landmark for axial rotation of femoral implants. The position is highly dependent on the osteotomy height and in addition differs between individual patients. Preoperative assessment of the linea aspera is advocated in order to reduce the risk of malrotation. As the height of the osteotomy cannot always be determined correctly preoperatively, a table was designed as a guideline for how much a deviation from the planned resection height will affect the rotation of the implant. (c) 2020 IPEM. Published by Elsevier Ltd. All rights reserved

Analysis of Crowdsourced Sampling Strategies for HodgeRank with Sparse Random Graphs

Crowdsourcing platforms are now extensively used for conducting subjective pairwise comparison studies. In this setting, a pairwise comparison dataset is typically gathered via random sampling, either \emph{with} or \emph{without} replacement. In this paper, we use tools from random graph theory to analyze these two random sampling methods for the HodgeRank estimator. Using the Fiedler value of the graph as a measurement for estimator stability (informativeness), we provide a new estimate of the Fiedler value for these two random graph models. In the asymptotic limit as the number of vertices tends to infinity, we prove the validity of the estimate. Based on our findings, for a small number of items to be compared, we recommend a two-stage sampling strategy where a greedy sampling method is used initially and random sampling \emph{without} replacement is used in the second stage. When a large number of items is to be compared, we recommend random sampling with replacement as this is computationally inexpensive and trivially parallelizable. Experiments on synthetic and real-world datasets support our analysis

The role of initial geometry in experimental models of wound closing

Wound healing assays are commonly used to study how populations of cells, initialised on a two-dimensional surface, act to close an artificial wound space. While real wounds have different shapes, standard wound healing assays often deal with just one simple wound shape, and it is unclear whether varying the wound shape might impact how we interpret results from these experiments. In this work, we describe a new kind of wound healing assay, called a sticker assay, that allows us to examine the role of wound shape in a series of wound healing assays performed with fibroblast cells. In particular, we show how to use the sticker assay to examine wound healing with square, circular and triangular shaped wounds. We take a standard approach and report measurements of the size of the wound as a function of time. This shows that the rate of wound closure depends on the initial wound shape. This result is interesting because the only aspect of the assay that we change is the initial wound shape, and the reason for the different rate of wound closure is unclear. To provide more insight into the experimental observations we describe our results quantitatively by calibrating a mathematical model, describing the relevant transport phenomena, to match our experimental data. Overall, our results suggest that the rates of cell motility and cell proliferation from different initial wound shapes are approximately the same, implying that the differences we observe in the wound closure rate are consistent with a fairly typical mathematical model of wound healing. Our results imply that parameter estimates obtained from an experiment performed with one particular wound shape could be used to describe an experiment performed with a different shape. This fundamental result is important because this assumption is often invoked, but never tested

A Parallel Adaptive P3M code with Hierarchical Particle Reordering

We discuss the design and implementation of HYDRA_OMP a parallel implementation of the Smoothed Particle Hydrodynamics-Adaptive P3M (SPH-AP3M) code HYDRA. The code is designed primarily for conducting cosmological hydrodynamic simulations and is written in Fortran77+OpenMP. A number of optimizations for RISC processors and SMP-NUMA architectures have been implemented, the most important optimization being hierarchical reordering of particles within chaining cells, which greatly improves data locality thereby removing the cache misses typically associated with linked lists. Parallel scaling is good, with a minimum parallel scaling of 73% achieved on 32 nodes for a variety of modern SMP architectures. We give performance data in terms of the number of particle updates per second, which is a more useful performance metric than raw MFlops. A basic version of the code will be made available to the community in the near future.Comment: 34 pages, 12 figures, accepted for publication in Computer Physics Communication

Smoothing equations for large P\'olya urns

Consider a balanced non triangular two-color P\'olya-Eggenberger urn process, assumed to be large which means that the ratio sigma of the replacement matrix eigenvalues satisfies 1/2<sigma <1. The composition vector of both discrete time and continuous time models admits a drift which is carried by the principal direction of the replacement matrix. In the second principal direction, this random vector admits also an almost sure asymptotics and a real-valued limit random variable arises, named WDT in discrete time and WCT in continous time. The paper deals with the distributions of both W. Appearing as martingale limits, known to be nonnormal, these laws remain up to now rather mysterious. Exploiting the underlying tree structure of the urn process, we show that WDT and WCT are the unique solutions of two distributional systems in some suitable spaces of integrable probability measures. These systems are natural extensions of distributional equations that already appeared in famous algorithmical problems like Quicksort analysis. Existence and unicity of the solutions of the systems are obtained by means of contracting smoothing transforms. Via the equation systems, we find upperbounds for the moments of WDT and WCT and we show that the laws of WDT and WCT are moment-determined. We also prove that WDT is supported by the whole real line and admits a continuous density (WCT was already known to have a density, infinitely differentiable on R\{0} and not bounded at the origin)