Intervertebral staple grading system with micro-CT

Introduction Intervertebral stapling is a leading method of fusionless scoliosis treatment which attempts to control growth by applying pressure to the convex side of a scoliotic curve in accordance with the Hueter-Volkmann principle. In addition to that, staples have the potential to damage surrounding bone during insertion and subsequent loading. The aim of this study was to assess the extent of bony structural damage including epiphyseal injury as a result of intervertebral stapling using an in vitro bovine model. Materials and Methods Thoracic spines from 6-8 week old calves were dissected and divided into motion segments including levels T4-T11 (n=14). Each segment was potted in polymethylemethacrylate. An Instron Biaxial materials testing machine with a custom made jig was used for testing. The segments were tested in flexion/extension, lateral bending and axial rotation at 37⁰C and 100% humidity, using moment control to a maximum 1.75 Nm with a loading rate of 0.3 Nm per second for 10 cycles. The segments were initially tested uninstrumented with data collected from the tenth load cycle. Next an anterolateral 4-prong Shape Memory Alloy (SMA) staple (Medtronic Sofamor Danek, USA) was inserted into each segment. Biomechanical testing was repeated as before. The staples were cut in half with a diamond saw and carefully removed. Micro-CT scans were performed and sagittal, transverse and coronal reformatted images were produced using ImageJ (NIH, USA).The specimens were divided into 3 grades (0, 1 and 2) according to the number of epiphyses damaged by the staple prongs. Results: There were 9 (65%) segments with grade 1 staple insertions and 5 (35%) segments with grade 2 insertions. There were no grade 0 staples. Grade 2 spines had a higher stiffness level than grade 1 spines, in all axes of movement, by 28% (p=0.004). This was most noted in flexion/extension with an increase of 49% (p=0.042), followed by non-significant change in lateral bending 19% (p=0.129) and axial rotation 8% (p=0.456) stiffness. The cross sectional area of bone destruction from the prongs was only 0.4% larger in the grade 2 group compared to the grade 1 group (p=0.961). Conclusion Intervertebral staples cause epiphyseal damage. There is a difference in stiffness between grade 1 and grade 2 staple insertion segments in flexion/extension only. There is no difference in the cross section of bone destruction as a result of prong insertion and segment motion.

Total factor productivity growth and convergence in the petroleum industry : empirical analysis testing for convexity

While economic theory acknowledges that some features of technology (e.g., indivisibilities, economies of scale and specialization) can fundamentally violate the traditional convexity assumption, almost all empirical studies accept the convexity property on faith. In this contribution, we apply two alternative flexible production technologies to measure total factor productivity growth and test the significance of the convexity axiom using a nonparametric test of closeness between unknown distributions. Based on unique field level data on the petroleum industry, the empirical results reveal significant differences, indicating that this production technology is most likely non-convex. Furthermore, we also show the impact of convexity on answers to traditional convergence questions in the productivity growth literature.

Mapping Hydrophobicity on the Protein Molecular Surface at Atom-Level Resolution

A precise representation of the spatial distribution of hydrophobicity, hydrophilicity and charges on the molecular surface of proteins is critical for the understanding of the interaction with small molecules and larger systems. The representation of hydrophobicity is rarely done at atom-level, as this property is generally assigned to residues. A new methodology for the derivation of atomic hydrophobicity from any amino acid-based hydrophobicity scale was used to derive 8 sets of atomic hydrophobicities, one of which was used to generate the molecular surfaces for 35 proteins with convex structures, 5 of which, i.e., lysozyme, ribonuclease, hemoglobin, albumin and IgG, have been analyzed in more detail. Sets of the molecular surfaces of the model proteins have been constructed using spherical probes with increasingly large radii, from 1.4 to 20 A˚, followed by the quantification of (i) the surface hydrophobicity; (ii) their respective molecular surface areas, i.e., total, hydrophilic and hydrophobic area; and (iii) their relative densities, i.e., divided by the total molecular area; or specific densities, i.e., divided by property-specific area. Compared with the amino acid-based formalism, the atom-level description reveals molecular surfaces which (i) present an approximately two times more hydrophilic areas; with (ii) less extended, but between 2 to 5 times more intense hydrophilic patches; and (iii) 3 to 20 times more extended hydrophobic areas. The hydrophobic areas are also approximately 2 times more hydrophobicity-intense. This, more pronounced "leopard skin"-like, design of the protein molecular surface has been confirmed by comparing the results for a restricted set of homologous proteins, i.e., hemoglobins diverging by only one residue (Trp37). These results suggest that the representation of hydrophobicity on the protein molecular surfaces at atom-level resolution, coupled with the probing of the molecular surface at different geometric resolutions, can capture processes that are otherwise obscured to the amino acid-based formalism.

Adaptive online gradient descent

We study the rates of growth of the regret in online convex optimization. First, we show that a simple extension of the algorithm of Hazan et al eliminates the need for a priori knowledge of the lower bound on the second derivatives of the observed functions. We then provide an algorithm, Adaptive Online Gradient Descent, which interpolates between the results of Zinkevich for linear functions and of Hazan et al for strongly convex functions, achieving intermediate rates between [square root T] and [log T]. Furthermore, we show strong optimality of the algorithm. Finally, we provide an extension of our results to general norms.

Edge-weighting of gene expression graphs

In recent years, considerable research efforts have been directed to micro-array technologies and their role in providing simultaneous information on expression profiles for thousands of genes. These data, when subjected to clustering and classification procedures, can assist in identifying patterns and providing insight on biological processes. To understand the properties of complex gene expression datasets, graphical representations can be used. Intuitively, the data can be represented in terms of a bipartite graph, with weighted edges corresponding to gene-sample node couples in the dataset. Biologically meaningful subgraphs can be sought, but performance can be influenced both by the search algorithm, and, by the graph-weighting scheme and both merit rigorous investigation. In this paper, we focus on edge-weighting schemes for bipartite graphical representation of gene expression. Two novel methods are presented: the first is based on empirical evidence; the second on a geometric distribution. The schemes are compared for several real datasets, assessing efficiency of performance based on four essential properties: robustness to noise and missing values, discrimination, parameter influence on scheme efficiency and reusability. Recommendations and limitations are briefly discussed. Keywords: Edge-weighting; weighted graphs; gene expression; bi-clustering

Estimating link-dependent origin-destination matrices from sample trajectories and traffic counts

In transport networks, Origin-Destination matrices (ODM) are classically estimated from road traffic counts whereas recent technologies grant also access to sample car trajectories. One example is the deployment in cities of Bluetooth scanners that measure the trajectories of Bluetooth equipped cars. Exploiting such sample trajectory information, the classical ODM estimation problem is here extended into a link-dependent ODM (LODM) one. This much larger size estimation problem is formulated here in a variational form as an inverse problem. We develop a convex optimization resolution algorithm that incorporates network constraints. We study the result of the proposed algorithm on simulated network traffic.

Discrete families of Saffman–Taylor fingers with exotic shapes

The mathematical problem of determining the shape of a steadily propagating Saffman–Taylor finger in a rectangular Hele-Shaw cell is known to have a countably infinite number of solutions for each fixed surface tension value. For sufficiently large surface tension values, we find that fingers on higher solution branches are non-convex. The tips of the fingers have increasingly exotic shapes as the branch number increases.

Persistent anterior chamber silicone oil and myopia

A 60-year-old male experienced a marked unilateral myopic shift of 20 D following attempted removal of intravitreal heavy silicone oil (HSO) used in the treatment of inferior proliferative vitreous retinopathy following retinal detachment. Examination revealed HSO adherent to the corneal endothelium forming a convex interface with the aqueous, obscuring the entire pupil, which required surgical intervention to restore visual acuity. This case highlights the potential ocular complications associated with silicone oil migration into the anterior chamber, which include corneal endothelial decompensation and a significant increase in myopia.

Estimating link-dependent origin-destination matrices from sample trajectories and traffic counts

Origin-Destination matrices (ODM) estimation can benefits of the availability of sample trajectories which can be measured thanks to recent technologies. This paper focus on the case of transport networks where traffic counts are measured by magnetic loops and sample trajectories available. An example of such network is the city of Brisbane, where Bluetooth detectors are now operating. This additional data source is used to extend the classical ODM estimation to a link-specific ODM (LODM) one using a convex optimisation resolution that incorporates networks constraints as well. The proposed algorithm is assessed on a simulated network.

Linear programming for large-scale Markov decision problems

We consider the problem of controlling a Markov decision process (MDP) with a large state space, so as to minimize average cost. Since it is intractable to compete with the optimal policy for large scale problems, we pursue the more modest goal of competing with a low-dimensional family of policies. We use the dual linear programming formulation of the MDP average cost problem, in which the variable is a stationary distribution over state-action pairs, and we consider a neighborhood of a low-dimensional subset of the set of stationary distributions (defined in terms of state-action features) as the comparison class. We propose a technique based on stochastic convex optimization and give bounds that show that the performance of our algorithm approaches the best achievable by any policy in the comparison class. Most importantly, this result depends on the size of the comparison class, but not on the size of the state space. Preliminary experiments show the effectiveness of the proposed algorithm in a queuing application.

Learning with symmetric label noise: The importance of being unhinged

Convex potential minimisation is the de facto approach to binary classification. However, Long and Servedio [2008] proved that under symmetric label noise (SLN), minimisation of any convex potential over a linear function class can result in classification performance equivalent to random guessing. This ostensibly shows that convex losses are not SLN-robust. In this paper, we propose a convex, classification-calibrated loss and prove that it is SLN-robust. The loss avoids the Long and Servedio [2008] result by virtue of being negatively unbounded. The loss is a modification of the hinge loss, where one does not clamp at zero; hence, we call it the unhinged loss. We show that the optimal unhinged solution is equivalent to that of a strongly regularised SVM, and is the limiting solution for any convex potential; this implies that strong l2 regularisation makes most standard learners SLN-robust. Experiments confirm the unhinged loss’ SLN-robustness.

A curve shortening flow rule for closed embedded plane curves with a prescribed rate of change in enclosed area

Motivated by a problem from fluid mechanics, we consider a generalization of the standard curve shortening flow problem for a closed embedded plane curve such that the area enclosed by the curve is forced to decrease at a prescribed rate. Using formal asymptotic and numerical techniques, we derive possible extinction shapes as the curve contracts to a point, dependent on the rate of decreasing area; we find there is a wider class of extinction shapes than for standard curve shortening, for which initially simple closed curves are always asymptotically circular. We also provide numerical evidence that self-intersection is possible for non-convex initial conditions, distinguishing between pinch-off and coalescence of the curve interior.

Behaviour of natural zeolites used for the treatment of simulated and actual coal seam gas water

Coal seam gas operations produce significant quantities of associated water which often require demineralization. Ion exchange with natural zeolites has been proposed as a possible approach. The interaction of natural zeolites with solutions of sodium chloride and sodium bicarbonate in addition to coal seam gas water is not clear. Hence, we investigated ion exchange kinetics, equilibrium, and column behaviour of an Australian natural zeolite. Kinetic tests suggested that the pseudo first order equation best simulated the data. Intraparticle diffusion was part of the rate limiting step and more than one diffusion process controlled the overall rate of sodium ion uptake. Using a constant mass of zeolite and variable concentration of either sodium chloride or sodium bicarbonate resulted in a convex isotherm which was fitted by a Langmuir model. However, using a variable mass of zeolite and constant concentration of sodium ions revealed that the exchange of sodium ions with the zeolite surface sites was in fact unfavourable. Sodium ion exchange from bicarbonate solutions (10.3 g Na/kg zeolite) was preferred relative to exchange from sodium chloride solutions (6.4 g Na/kg zeolite). The formation of calcium carbonate species was proposed to explain the observed behaviour. Column studies of coal seam gas water showed that natural zeolite had limited ability to reduce the concentration of sodium ions (loading 2.1 g Na/kg zeolite) with rapid breakthrough observed. It was concluded that natural zeolites may not be suitable for the removal of cations from coal seam gas water without improvement of their physical properties.