On-the-fly web content integrity check boosts users' confidence

Web servers are accessible by anyone who can access the Internet. Although this universal accessibility is attractive for all kinds of Web-based applications, Web servers are exposed to attackers who may want to alter their contents. Alterations range from humorous additions or changes, which are typically easy to spot, to more sinister tampering, such as providing false or damaging information.

‘Healthy mobile check-ins’ study: using GIS in smartphones to track use of urban environment by survivors of endometrial cancer

Aims/Objectives Our study aims to test the capacity of a newly developed smartphone innovation to obtain data on social, structural, and spatial determinants of the daily health-related behaviours of women living in urban Brisbane neighbourhoods who have survived endometrial cancer. Methods The women used a mobile web app designed specifically for the project to record GIS/location data on every destination they visited within their local urban neighbourhoods over a two-week period. Additionally, we gathered textual data on the social context/reasons for travel, as well as mode of transport to reach these destinations. The data was transported to SPSS and Google Earth for statistical and spatial analysis. We then met with the women to discuss lifestyle interventions to maximise their use of their local neighbourhoods in ways that could increase their physical activity levels and improve their overall health and well-being. These interventions will be evaluated and translated into a large-scale national study if effective. Results Initial findings about patterns in the group’s use of the local urban environment will be displayed, including daily distances travelled, types of locations visited, walking levels, use of public transport, use of green spaces and use of health-related resources. Any socio-demograpahic differences found between the women will be reported. Qualitative, quantitative, and spatial/mapping data will be displayed Conclusion The benefits and limitations of the mobile website designed to collect a range of data types about human-neighbourhood interactions with implications for intervention design will be discussed.

Combining initial segments of lists

We propose a new way to build a combined list from K base lists, each containing N items. A combined list consists of top segments of various sizes from each base list so that the total size of all top segments equals N. A sequence of item requests is processed and the goal is to minimize the total number of misses. That is, we seek to build a combined list that contains all the frequently requested items. We first consider the special case of disjoint base lists. There, we design an efficient algorithm that computes the best combined list for a given sequence of requests. In addition, we develop a randomized online algorithm whose expected number of misses is close to that of the best combined list chosen in hindsight. We prove lower bounds that show that the expected number of misses of our randomized algorithm is close to the optimum. In the presence of duplicate items, we show that computing the best combined list is NP-hard. We show that our algorithms still apply to a linearized notion of loss in this case. We expect that this new way of aggregating lists will find many ranking applications.

Final report : Estimating the extent of unlicensed driving: Roadside licence check survey - Wave2. Report to Queensland Department of Transport and Main Roads

This report documents a second, revised roadside licence check survey undertaken by the Queensland Police Service (QPS) in conjunction with roadside random breath testing (RBT) traffic operations. The methodology utilised was devised by the Centre for Accident Research and Road Safety – Queensland (CARRS-Q), Transport and Main Roads (TMR) and QPS, after consideration of a number of options.

Approximate nearest-neighbour search with inverted signature slice lists

In this paper we present an original approach for finding approximate nearest neighbours in collections of locality-sensitive hashes. The paper demonstrates that this approach makes high-performance nearest-neighbour searching feasible on Web-scale collections and commodity hardware with minimal degradation in search quality.

An annotated check list of Ramularia species in Australia

An annotated check list of Ramularia species in Australia, based on re-examinations of collections deposited at BRIP, DAR and VPRI, is presented. Twenty-eight species are reported in Australia, most of them on introduced host plants. The new species Cladosporium myrtacearum, Ramularia craspediicola and R. muehlenbeckiae are described. Collections of Cladosporium uredinicola, Neoramularia karelii, Passalora perfoliati and Pseudocercospora pongamiae-pinnatae, previously deposited in Australian herbaria under 'Ramularia sp.', are newly recognised for Australia.

Aaron Lopez papers, undated, 1752-1794, 1846, 1852, 1953.

Contains approximately 6800 manuscripts arranged chronologically by year for years 1752-1794. Approximately 100 are letters received or written by Lopez, his partner and father-in-law, Jacob Rodriguez Rivera, members of his family and company, and commercial agents pertaining to business activities and sailing orders for the captains of various ships. Several also refer to personal matters and acquaintances, including a series of six letters from Silas Cooke of White Hall (Middletown), R.I., to Aaron Lopez, asking his aid in returning a run-away slave (1776). The great majority of the collection consists of account records, bills of sale, orders, shipping agreements, lists of sailors on the various ships, repair records and cargo invoices. Of particular interest are a receipt for payment of a half-year's subscription to the "tzedakah" of Congregation Nefutzei Israel, Newport (1755) and several documents that reveal Lopez as a supplier of kosher meat and other religious articles to people in various parts of the colonies, Surinam, and Jamaica. Also included in this group are copies of sailing lists, documents pertaining to Lopez's naturalization which shed light upon the status of a Jew applying for citizenship in Massachusetts and a check to Lopez from the United States government for a loan made during the Revolutionary War (1779).

Forgery attacks on ++AE authenticated encryption mode

In this paper, we analyse a block cipher mode of operation submitted in 2014 to the cryptographic competition for authenticated encryption (CAESAR). This mode is designed by Recacha and called ++AE (plus-plus-ae). We propose a chosen plaintext forgery attack on ++AE that requires only a single chosen message query to allow an attacker to construct multiple forged messages. Our attack is deterministic and guaranteed to pass ++AE integrity check. We demonstrate the forgery attack using 128-bit AES as the underlying block cipher. Hence, ++AE is insecure as an authenticated encryption mode of operation.

Performance improvement of short-length regular low-density parity-check codes with low-complexity post-processing

It is well known that extremely long low-density parity-check (LDPC) codes perform exceptionally well for error correction applications, short-length codes are preferable in practical applications. However, short-length LDPC codes suffer from performance degradation owing to graph-based impairments such as short cycles, trapping sets and stopping sets and so on in the bipartite graph of the LDPC matrix. In particular, performance degradation at moderate to high E-b/N-0 is caused by the oscillations in bit node a posteriori probabilities induced by short cycles and trapping sets in bipartite graphs. In this study, a computationally efficient algorithm is proposed to improve the performance of short-length LDPC codes at moderate to high E-b/N-0. This algorithm makes use of the information generated by the belief propagation (BP) algorithm in previous iterations before a decoding failure occurs. Using this information, a reliability-based estimation is performed on each bit node to supplement the BP algorithm. The proposed algorithm gives an appreciable coding gain as compared with BP decoding for LDPC codes of a code rate equal to or less than 1/2 rate coding. The coding gains are modest to significant in the case of optimised (for bipartite graph conditioning) regular LDPC codes, whereas the coding gains are huge in the case of unoptimised codes. Hence, this algorithm is useful for relaxing some stringent constraints on the graphical structure of the LDPC code and for developing hardware-friendly designs.