Recording and preserving legal history

The lack of a systematic approach in Australia to recording and preserving legal history was highlighted in the article by Catherine Hutchins in the August 2002 issue of the Australian Bar Review. This article describes the modest, albeit continuing, efforts on the part of the Supreme Court Library to meet this need in the State of Queensland. The efforts began in 1983 and have recently escalated with a series of exhibitions, talks, displays, interviews and preservations of documents (from online publication).

A preliminary idea for an 8-competitive, log2 DMAX + log2 log2 1/U asymptotic-space, interface generation algorithm for two-level hierarchical scheduling of constrained-deadline sporadic tasks on a uniprocessor

Consider a single processor and a software system. The software system comprises components and interfaces where each component has an associated interface and each component comprises a set of constrained-deadline sporadic tasks. A scheduling algorithm (called global scheduler) determines at each instant which component is active. The active component uses another scheduling algorithm (called local scheduler) to determine which task is selected for execution on the processor. The interface of a component makes certain information about a component visible to other components; the interfaces of all components are used for schedulability analysis. We address the problem of generating an interface for a component based on the tasks inside the component. We desire to (i) incur only a small loss in schedulability analysis due to the interface and (ii) ensure that the amount of space (counted in bits) of the interface is small; this is because such an interface hides as much details of the component as possible. We present an algorithm for generating such an interface.

Congruences on monoids of transformations preserving the orientation on a finite chain

Journal of Algebra, 321 (2009), p. 743–757

Preserving the validity of the two-Higgs-doublet model up to the Planck scale

We examine the constraints on the two Higgs doublet model (2HDM) due to the stability of the scalar potential and absence of Landau poles at energy scales below the Planck scale. We employ the most general 2HDM that incorporates an approximately Standard Model (SM) Higgs boson with a flavor aligned Yukawa sector to eliminate potential tree-level Higgs-mediated flavor changing neutral currents. Using basis independent techniques, we exhibit robust regimes of the 2HDM parameter space with a 125 GeV SM-like Higgs boson that is stable and perturbative up to the Planck scale. Implications for the heavy scalar spectrum are exhibited.

Congruences on monoids of order-preserving or order-reversing transformations on a finite chain

Glasgow Mathematical Journal, nº 47 (2005), pg. 413-424

Abelian kernels of monoids of order-preserving maps and of some of its extensions

Semigroup Forum vol. 68 (2004), p. 335–356

A high order model for piezoelectric rods: an asymptotic approach

Preprint submitted to International Journal of Solids and Structures. ISSN 0020-7683

On mappings preserving the sharp and star orders

The present paper is devoted to the study of linear maps preserving certain relations, such as the sharp partial order and the star partial order in semisimple Banach algebras and C*-algebras.

ADSNARK: Nearly practical and privacy-preserving proofs on authenticated data

We study the problem of privacy-preserving proofs on authenticated data, where a party receives data from a trusted source and is requested to prove computations over the data to third parties in a correct and private way, i.e., the third party learns no information on the data but is still assured that the claimed proof is valid. Our work particularly focuses on the challenging requirement that the third party should be able to verify the validity with respect to the specific data authenticated by the source — even without having access to that source. This problem is motivated by various scenarios emerging from several application areas such as wearable computing, smart metering, or general business-to-business interactions. Furthermore, these applications also demand any meaningful solution to satisfy additional properties related to usability and scalability. In this paper, we formalize the above three-party model, discuss concrete application scenarios, and then we design, build, and evaluate ADSNARK, a nearly practical system for proving arbitrary computations over authenticated data in a privacy-preserving manner. ADSNARK improves significantly over state-of-the-art solutions for this model. For instance, compared to corresponding solutions based on Pinocchio (Oakland’13), ADSNARK achieves up to 25× improvement in proof-computation time and a 20× reduction in prover storage space.

The naturalist's guide in collecting and preserving objects of natural history, with a complete catalogue of the birds of the eastern Massachusetts.

[1873 printing]

Smoothing singularities of Riemannian metrics while preserving lower curvature bounds

Magdeburg, Univ., Fak. für Mathematik, Diss., 2014

Approximations and asymptotic expansions for sums of heavy-tailed random variables

Magdeburg, Univ., Fak. für Mathematik, Diss., 2015