Universal codes from switching strategies

We discuss algorithms for combining sequential prediction strategies, a task which can be viewed as a natural generalisation of the concept of universal coding. We describe a graphical language based on Hidden Markov Models for defining prediction strategies, and we provide both existing and new models as examples. The models include efficient, parameterless models for switching between the input strategies over time, including a model for the case where switches tend to occur in clusters, and finally a new model for the scenario where the prediction strategies have a known relationship, and where jumps are typically between strongly related ones. This last model is relevant for coding time series data where parameter drift is expected. As theoretical contributions we introduce an interpolation construction that is useful in the development and analysis of new algorithms, and we establish a new sophisticated lemma for analysing the individual sequence regret of parameterised models.

Higher order universal one-way hash functions from the subset sum assumption

Universal One-Way Hash Functions (UOWHFs) may be used in place of collision-resistant functions in many public-key cryptographic applications. At Asiacrypt 2004, Hong, Preneel and Lee introduced the stronger security notion of higher order UOWHFs to allow construction of long-input UOWHFs using the Merkle-Damgård domain extender. However, they did not provide any provably secure constructions for higher order UOWHFs. We show that the subset sum hash function is a kth order Universal One-Way Hash Function (hashing n bits to m < n bits) under the Subset Sum assumption for k = O(log m). Therefore we strengthen a previous result of Impagliazzo and Naor, who showed that the subset sum hash function is a UOWHF under the Subset Sum assumption. We believe our result is of theoretical interest; as far as we are aware, it is the first example of a natural and computationally efficient UOWHF which is also a provably secure higher order UOWHF under the same well-known cryptographic assumption, whereas this assumption does not seem sufficient to prove its collision-resistance. A consequence of our result is that one can apply the Merkle-Damgård extender to the subset sum compression function with ‘extension factor’ k+1, while losing (at most) about k bits of UOWHF security relative to the UOWHF security of the compression function. The method also leads to a saving of up to m log(k+1) bits in key length relative to the Shoup XOR-Mask domain extender applied to the subset sum compression function.

Efficient extension of standard Schnorr/RSA signatures into Universal Designated-Verifier Signatures

Universal Designated-Verifier Signature (UDVS) schemes are digital signature schemes with additional functionality which allows any holder of a signature to designate the signature to any desired designated-verifier such that the designated-verifier can verify that the message was signed by the signer, but is unable to convince anyone else of this fact. Since UDVS schemes reduce to standard signatures when no verifier designation is performed, it is natural to ask how to extend the classical Schnorr or RSA signature schemes into UDVS schemes, so that the existing key generation and signing implementation infrastructure for these schemes can be used without modification. We show how this can be efficiently achieved, and provide proofs of security for our schemes in the random oracle model.

Universal designated-verifier signatures

Motivated by privacy issues associated with dissemination of signed digital certificates, we define a new type of signature scheme called a ‘Universal Designated-Verifier Signature’ (UDVS). A UDVS scheme can function as a standard publicly-verifiable digital signature but has additional functionality which allows any holder of a signature (not necessarily the signer) to designate the signature to any desired designated-verifier (using the verifier’s public key). Given the designated-signature, the designated-verifier can verify that the message was signed by the signer, but is unable to convince anyone else of this fact. We propose an efficient deterministic UDVS scheme constructed using any bilinear group-pair. Our UDVS scheme functions as a standard Boneh-Lynn-Shacham (BLS) signature when no verifier-designation is performed, and is therefore compatible with the key-generation, signing and verifying algorithms of the BLS scheme. We prove that our UDVS scheme is secure in the sense of our unforgeability and privacy notions for UDVS schemes, under the Bilinear Diffie-Hellman (BDH) assumption for the underlying group-pair, in the random-oracle model. We also demonstrate a general constructive equivalence between a class of unforgeable and unconditionally-private UDVS schemes having unique signatures (which includes the deterministic UDVS schemes) and a class of ID-Based Encryption (IBE) schemes which contains the Boneh-Franklin IBE scheme but not the Cocks IBE scheme.

Towards universal search design

For people with cognitive disabilities, technology is more often thought of as a support mechanism, rather than a source of division that may require intervention to equalize access across the cognitive spectrum. This paper presents a first attempt at formalizing the digital gap created by the generalization of search engines. This was achieved through the development of a mapping of cognitive abilities required by users to execute low- level tasks during a standard Web search task. The mapping demonstrates how critical these abilities are to successfully use search engines with an adequate level of independence. It will lead to a set of design guidelines for search engine interfaces that will allow for the engagement of users of all abilities, and also, more importantly, in search algorithms such as query suggestion and measure of relevance (i.e. ranking).

On the symbiosis of law and truth in Christian theology: Reconciling universal and particular through the Pauline law of love

This article argues that the secular liberal and positivist foundations of the modern Western legal system render it violent. In particular, the liberal exclusion of faith and subjectivity in favour of abstract and universal reason in conjunction with its privileging of individual autonomy at the expense of the community leads to alienation of the individual from the community. Similarly, the positivist exclusion of faith and theology from law, with its enforced conformity to the posited law, also results in this violence of alienation. In response, this article proposes a new foundation for law, a natural law based in the truth of Trinitarian theology articulated by John Milbank. In the Trinity, the members exist as a perfect unity in diversity, providing a model for the reconciliation of the legal individual and community: the law of love. Through the law of love as the basic norm, individuals love their neighbours as themselves, reconciling the particular and the universal, and providing a community of peace rather than violence.

Countering disablism: An alternative universal income support system based on egalitarianism

The long-term vision of economic security and social participation for people with a disability held by disability activists and policy-makers has not been realised on a global scale. This is despite the implementation of various poverty alleviation initiatives by international and national governments. Indeed within advanced Western liberal democracies, the inequalities and poverty gaps have widened rather than closed. This article is based on findings from a historical-comparative policy and discourse analysis of disability income support system in Australia and the Basic Income model. The findings suggest that a model such as Basic Income, grounded in principles of social citizenship, goes some way to maintaining an adequate level of subsistence for people with a disability. The article concludes by presenting some challenges and a commitment to transforming income support policy.

Path algebra for mobile robots

In this paper, we introduce a path algebra well suited for navigation in environments that can be abstracted as topological graphs. From this path algebra, we derive algorithms to reduce routes in such environments. The routes are reduced in the sense that they are shorter (contain fewer edges), but still connect the endpoints of the initial routes. Contrary to planning methods descended from Disjktra’s Shortest Path Algorithm like D , the navigation methods derived from our path algebra do not require any graph representation. We prove that the reduced routes are optimal when the graphs are without cycles. In the case of graphs with cycles, we prove that whatever the length of the initial route, the length of the reduced route is bounded by a constant that only depends on the structure of the environment.

Universal crack closure integral for SIF estimation

Numerical analysis of cracked structures often involves numerical estimation of stress intensity factors (SIFs) at a crack tip/front. A newly developed formulation called universal crack closure integral (UCCI) for the evaluation of potential energy release rates (PERRs) and the corresponding SIFs is presented in this paper. Unlike the existing element dedicated forms of crack closure integrals (MCCI, VCCI) with application limited to finite element analysis, this new numerical SIF/PERR estimation technique is independent of the basic stress analysis procedure, making it universally applicable. The second merit of this procedure is that it avoids the generally error-producing zones close to the crack tip/front singularity. The UCCI procedure, based on Irwin's original CCI, is formulated and explored using a simple 2D problem of a straight crack in an infinite sheet. It is then applied to some three-dimensional crack geometries with the stresses and displacements obtained from a boundary element program.

Logic as the Universal Science : Bertrand Russell's Early Conception of Logic and Its Philosophical Context

Bertrand Russell (1872 1970) introduced the English-speaking philosophical world to modern, mathematical logic and foundational study of mathematics. The present study concerns the conception of logic that underlies his early logicist philosophy of mathematics, formulated in The Principles of Mathematics (1903). In 1967, Jean van Heijenoort published a paper, Logic as Language and Logic as Calculus, in which he argued that the early development of modern logic (roughly the period 1879 1930) can be understood, when considered in the light of a distinction between two essentially different perspectives on logic. According to the view of logic as language, logic constitutes the general framework for all rational discourse, or meaningful use of language, whereas the conception of logic as calculus regards logic more as a symbolism which is subject to reinterpretation. The calculus-view paves the way for systematic metatheory, where logic itself becomes a subject of mathematical study (model-theory). Several scholars have interpreted Russell s views on logic with the help of the interpretative tool introduced by van Heijenoort,. They have commonly argued that Russell s is a clear-cut case of the view of logic as language. In the present study a detailed reconstruction of the view and its implications is provided, and it is argued that the interpretation is seriously misleading as to what he really thought about logic. I argue that Russell s conception is best understood by setting it in its proper philosophical context. This is constituted by Immanuel Kant s theory of mathematics. Kant had argued that purely conceptual thought basically, the logical forms recognised in Aristotelian logic cannot capture the content of mathematical judgments and reasonings. Mathematical cognition is not grounded in logic but in space and time as the pure forms of intuition. As against this view, Russell argued that once logic is developed into a proper tool which can be applied to mathematical theories, Kant s views turn out to be completely wrong. In the present work the view is defended that Russell s logicist philosophy of mathematics, or the view that mathematics is really only logic, is based on what I term the Bolzanian account of logic . According to this conception, (i) the distinction between form and content is not explanatory in logic; (ii) the propositions of logic have genuine content; (iii) this content is conferred upon them by special entities, logical constants . The Bolzanian account, it is argued, is both historically important and throws genuine light on Russell s conception of logic.

A universal test to determine the integrity of RNA, and its suitability for reverse transcription, in animal tissue laboratory specimens

Degradation of RNA in diagnostic specimens can cause false-negative test results and potential misdiagnosis when tests rely on the detection of specific RNA sequence. Current molecular methods of checking RNA integrity tend to be host species or group specific, necessitating libraries of primers and reaction conditions. The objective here was to develop a universal (multi-species) quality assurance tool for determining the integrity of RNA in animal tissues submitted to a laboratory for analyses. Ribosomal RNA (16S rRNA) transcribed from the mitochondrial 16S rDNA was used as template material for reverse transcription to cDNA and was amplified using polymerase chain reaction (PCR). As mitochondrial DNA has a high level of conservation, the primers used were shown to reverse transcribe and amplify RNA from every animal species tested. Deliberate degradation of rRNA template through temperature abuse of samples resulted in no reverse transcription and amplification. Samples spiked with viruses showed that single-stranded viral RNA and rRNA in the same sample degraded at similar rates, hence reverse transcription and PCR amplification of 16S rRNA could be used as a test of sample integrity and suitability for analysis that required the sample's RNA, including viral RNA. This test will be an invaluable quality assurance tool for determination of RNA integrity from tissue samples, thus avoiding erroneous test results that might occur if degraded target RNA is used unknowingly as template material for reverse transcription and subsequent PCR amplification.

Universal Access-NY User’s Guide

What is Universal Access-NY? Universal Access-NY is a complete online planning toolkit, www.UniversalAccessNY.org, where a One-Stop Delivery System can assess its practices, and develop work plans to improve physical and programmatic accessibility for all One-Stop customers. This web site and manual was developed by Cornell University’s Employment and Disability Institute, through the support and guidance of the New York State Department of Labor, with funding from two U.S. Department of Labor Work Incentive Grants (WIG 1 and 2). This web site was designed for use in a collaborative manner, bringing together One-Stop personnel, agency partners, business leaders and customers with disabilities. Universal Access-NY supports continuous improvement, with features that encourage multiple uses and incremental systems change.

Shift in disease burden from communicable to non-communicable diseases: Aiming to achieve Universal Health Coverage in Nepal

A major barrier to accessing healthcare services is spending, and the extended time that non-communicable diseases require treatment for means that many people around the world do not have proper access to care. Saval Khanal from Sankalpa Foundation, Nepal, Lennert Veerman and Samantha Hollingworth from the University of Queensland and Lisa Nissen from Queensland University of Technology lay out the results of their study and establish a method to forecast medicine use in Nepal.