Non-separable Gabor schemes : their design and implementation

vi+164hlm.;24c

Institutional change through exposing data: the James Cook University Research Portfolio

Even within a single department in an institution, research-related data exists everywhere: different formats, inconsistent databases, separate environments. In a typical situation, this data unlikely to be directly accessible, nor visible to, or perhaps even known to exist by the person or group that it pertains to. This leads to a number of problems: access, being a difficult, disjointed experience for those who seek the information; poor quality or incompleteness, as the information may be hidden and not maintained; and a potential lack of consistency across different uses of the data. Through exposing useful data from primary sources in a logical and consistent fashion, great improvements across a research institution are possible

Reversible watermarking scheme with image-independent embedding capacity

Permanent distortion is one of the main drawbacks of all the irreversible watermarking schemes. Attempts to recover the original signal after the signal passing the authentication process are being made starting just a few years ago. Some common problems, such as salt-and-pepper artefacts owing to intensity wraparound and low embedding capacity, can now be resolved. However, some significant problems remain unsolved. First, the embedding capacity is signal-dependent, i.e., capacity varies significantly depending on the nature of the host signal. The direct impact of this is compromised security for signals with low capacity. Some signals may be even non-embeddable. Secondly, while seriously tackled in irreversible watermarking schemes, the well-known problem of block-wise dependence, which opens a security gap for the vector quantisation attack and transplantation attack, are not addressed by researchers of the reversible schemes. This work proposes a reversible watermarking scheme with near-constant signal-independent embedding capacity and immunity to the vector quantisation attack and transplantation attack

The potential of combined mutation sequencing of plasma circulating cell-free DNA and matched white blood cells for treatment response prediction

Highly sensitive mutation detection methods enable the application of circulating cell-free DNA for molecular tumor profiling. Recent studies revealed that sequencing artifacts, germline variants, and clonal hematopoiesis confound the interpretation of sequencing results and complicate subsequent treatment decision making and disease monitoring. Parallel sequencing of matched white blood cells promises to overcome these issues and enables appropriate variant calling

Transportation Risk ANalysis tool for hazardous Substances (TRANS): a user-friendly, semi-quantitative multi-mode hazmat transport route safety risk estimation methodology for Flanders

A

Bias-based modeling and entropy analysis of PUFs

Physical Unclonable Functions (PUFs) are increasingly becoming a well-known security primitive for secure key storage and anti-counterfeiting. For both applications it is imperative that PUFs provide enough entropy. The aim of this paper is to propose a new model for binary-output PUFs such as SRAM, DFF, Latch and Buskeeper PUFs, and a method to accurately estimate their entropy. In our model the measurable property of a PUF is its set of cell biases. We determine an upper bound on the ‘extractable entropy’, i.e. the number of key bits that can be robustly extracted, by calculating the mutual information between the bias measurements done at enrollment and reconstruction. In previously known methods only uniqueness was studied using information-theoretic measures, while robustness was typically expressed in terms of error probabilities or distances. It is not always straightforward to use a combination of these two metrics in order to make an informed decision about the performance of different PUF types. Our new approach has the advantage that it simultaneously captures both of properties that are vital for key storage: uniqueness and robustness. Therefore it will be possible to fairly compare performance of PUF implementations using our new method. Statistical validation of the new methodology shows that it clearly captures both of these properties of PUFs. In other words: if one of these aspects (either uniqueness or robustness) is less than optimal, the extractable entropy decreases. Analysis on a large database of PUF measurement data shows very high entropy for SRAM PUFs, but rather poor results for all other memory-based PUFs in this database