A coding approach to the multicast stream authentication problem

We study the multicast stream authentication problem when an opponent can drop, reorder and introduce data packets into the communication channel. In such a model, packet overhead and computing efficiency are two parameters to be taken into account when designing a multicast stream protocol. In this paper, we propose to use two families of erasure codes to deal with this problem, namely, rateless codes and maximum distance separable codes. Our constructions will have the following advantages. First, our packet overhead will be small. Second, the number of signature verifications to be performed at the receiver is O(1). Third, every receiver will be able to recover all the original data packets emitted by the sender despite losses and injection occurred during the transmission of information.

Dictionary learning and sparse coding on Grassmann manifolds : an extrinsic solution

Recent advances in computer vision and machine learning suggest that a wide range of problems can be addressed more appropriately by considering non-Euclidean geometry. In this paper we explore sparse dictionary learning over the space of linear subspaces, which form Riemannian structures known as Grassmann manifolds. To this end, we propose to embed Grassmann manifolds into the space of symmetric matrices by an isometric mapping, which enables us to devise a closed-form solution for updating a Grassmann dictionary, atom by atom. Furthermore, to handle non-linearity in data, we propose a kernelised version of the dictionary learning algorithm. Experiments on several classification tasks (face recognition, action recognition, dynamic texture classification) show that the proposed approach achieves considerable improvements in discrimination accuracy, in comparison to state-of-the-art methods such as kernelised Affine Hull Method and graph-embedding Grassmann discriminant analysis.

Drosophila 3′ UTRs are more complex than protein-coding sequences

The 3′ UTRs of eukaryotic genes participate in a variety of post-transcriptional (and some transcriptional) regulatory interactions. Some of these interactions are well characterised, but an undetermined number remain to be discovered. While some regulatory sequences in 3′ UTRs may be conserved over long evolutionary time scales, others may have only ephemeral functional significance as regulatory profiles respond to changing selective pressures. Here we propose a sensitive segmentation methodology for investigating patterns of composition and conservation in 3′ UTRs based on comparison of closely related species. We describe encodings of pairwise and three-way alignments integrating information about conservation, GC content and transition/transversion ratios and apply the method to three closely related Drosophila species: D. melanogaster, D. simulans and D. yakuba. Incorporating multiple data types greatly increased the number of segment classes identified compared to similar methods based on conservation or GC content alone. We propose that the number of segments and number of types of segment identified by the method can be used as proxies for functional complexity. Our main finding is that the number of segments and segment classes identified in 3′ UTRs is greater than in the same length of protein-coding sequence, suggesting greater functional complexity in 3′ UTRs. There is thus a need for sustained and extensive efforts by bioinformaticians to delineate functional elements in this important genomic fraction. C code, data and results are available upon request.

Technicolouring the fridge : reducing food waste through uses of colour-coding and cameras

Domestic food wastage is a growing problem for the environment and food security. Some causes of domestic food wastes are attributed to a consumer’s behaviours during food purchasing, storage and consumption, such as: excessive food purchases and stockpiling in storage. Recent efforts in human-computer interaction research have examined ways of influencing consumer behaviour. The outcomes have led to a number of interventions that assist users with performing everyday tasks. The Internet Fridge is an example of such an intervention. However, new pioneering technologies frequently confront barriers that restrict their future impact in the market place, which has prompted investigations into the effectiveness of behaviour changing interventions used to encourage more sustainable practices. In this paper, we investigate and compare the effectiveness of two interventions that encourage behaviour change: FridgeCam and the Colour Code Project. We use FridgeCam to examine how improving a consumer’s food supply knowledge can reduce food stockpiling. We use the Colour Code Project to examine how improving consumer awareness of food location can encourage consumption of forgotten foods. We explore opportunities to integrate these interventions into commercially available technologies, such as the Internet Fridge, to: (i) increase the technology’s benefit and value to users, and (ii) promote reduced domestic food wastage. We conclude that interventions improving consumer food supply and location knowledge can promote behaviours that reduce domestic food waste over a longer term. The implications of this research present new opportunities for existing and future technologies to play a key role in reducing domestic food waste.

Fine-mapping the HOXB region detects common variants tagging a rare coding allele : evidence for synthetic association in prostate cancer

The HOXB13 gene has been implicated in prostate cancer (PrCa) susceptibility. We performed a high resolution fine-mapping analysis to comprehensively evaluate the association between common genetic variation across the HOXB genetic locus at 17q21 and PrCa risk. This involved genotyping 700 SNPs using a custom Illumina iSelect array (iCOGS) followed by imputation of 3195 SNPs in 20,440 PrCa cases and 21,469 controls in The PRACTICAL consortium. We identified a cluster of highly correlated common variants situated within or closely upstream of HOXB13 that were significantly associated with PrCa risk, described by rs117576373 (OR 1.30, P = 2.62×10(-14)). Additional genotyping, conditional regression and haplotype analyses indicated that the newly identified common variants tag a rare, partially correlated coding variant in the HOXB13 gene (G84E, rs138213197), which has been identified recently as a moderate penetrance PrCa susceptibility allele. The potential for GWAS associations detected through common SNPs to be driven by rare causal variants with higher relative risks has long been proposed; however, to our knowledge this is the first experimental evidence for this phenomenon of synthetic association contributing to cancer susceptibility.

Association study of MTHFD1 coding polymorphisms R134K and R653Q with migraine susceptibility

Objective There is evidence that folate metabolism has a role in migraine pathophysiology, particularly in the migraine with aura subtype. In this study we investigate whether two non-synonymous single nucleotide polymorphisms (SNPs), rs1950902 (C401T; R134K) and rs2236225 (G1958A; R653Q), in MTHDF1 are associated with migraine in an Australian case-control population. Background Increased plasma levels of homocysteine (HCy), one of the metabolites produced in the folate pathway, has been found to be a risk factor for migraine. There is also a genetic link, as a common polymorphism (C667T) that reduces the catalytic activity of MTHFR, the enzyme that catalyses the formation of HCy, is associated with an increase in risk of the migraine with aura (MA) subtype. MTHFD1 is a crucial multifunctional enzyme that catalyses three separate reactions of the folate pathway and therefore variants in MTHFD1 may also influence migraine susceptibility. Methods The R134K and R653Q variants in MTHFD1 were genotyped in an Australian cohort of 520 unrelated migraineurs (162 were diagnosed with migraine without aura [MO] and 358 with MA) and 520 matched controls. Data were analysed for association with migraine and for interaction with the MTHFR C667T polymorphism. Results We find no significant differences in genotype or allele frequencies for either SNP between migraineurs and controls, or when either MO or MA cases were compared to controls. In addition these MTHFD1 polymorphisms did not appear to influence the risk of MA conferred by the MTHFR 667T allele. Conclusions We find no evidence for association of the MTHFD1 R134K and R653Q polymorphisms with migraine in our Australian case-control population. However, as folate metabolism appears to be important in migraine, particularly with respect to the aura component, future studies using high throughput methods to expand the number of SNPs in folate-related genes genotyped and investigation of interactions between SNPs may be justified.

The many meanings of live coding

The ten-year anniversary of TOPLAP presents a unique opportunity for reflection and introspection. In this essay we ask the question, what is the meaning of live coding? Our goal is not to answer this question, in absolute terms, but rather to attempt to unpack some of live coding's many meanings. Our hope is that by exploring some of the formal, embodied, and cultural meanings surrounding live-coding practice, we may help to stimulate a conversation that will resonate within the live-coding community for the next ten years

Coding livecoding

Livecoding is an artistic programming practice in which an artist's low-level interaction can be observed with sufficiently high fidelity to allow for transcription and analysis. This paper presents the first reported" coding" of livecoding videos. From an identified corpus of videos available on the web, we coded performances of two different livecoding artists, recording both the (textual) programming edit events and the musical effect of these edits.

Plant biology: Coding in non-coding RNAs

The discovery of peptides encoded by what were thought to be non-coding – or 'junk' – regions of precursors to microRNA sequences reveals a new layer of gene regulation. These sequences may not be junk, after all.

The alchemy of junk: patent law and non-coding DNA

This article considers the recent international controversy over the patents held by a Melbourne firm, Genetic Technologies Limited (GTG), in respect of non-coding DNA and genomic mapping. It explores the ramifications of the GTG dispute in terms of licensing, litigation, and policy reform, and—as a result of this dispute—the perceived conflict between law and science. GTG has embarked upon an ambitious licensing program with twenty seven commercial licensees and five research licensees. Most significantly, GTG has obtained an exclusive licence from Myriad Genetics to use and exploit its medical diagnostics in Australia, New Zealand, and the Asia-Pacific region. In the US, GTG brought a legal action for patent infringement against the Applera Corporation and its subsidiaries. In response, Applera counterclaimed that the patents of GTG were invalid because they failed to comply with the requirements of US patent law, such as novelty, inventive step, and written specifications. In New Zealand, the Auckland District Health Board brought legal action in the High Court, seeking a declaration that the patents of GTG were invalid, and that, in any case, the Board has not infringed them. The New Zealand Ministry of Health and the Ministry of Economic Development have reported to Cabinet on the issues relating to the patenting of genetic material. Similarly, the Australian Law Reform Commission (ALRC) has also engaged in an inquiry into gene patents and human health; and the Advisory Council on Intellectual Property (ACIP) has considered whether there should be a new defence in respect of experimental use and research.

On robust face recognition via sparse coding: The good, the bad and the ugly

In the field of face recognition, sparse representation (SR) has received considerable attention during the past few years, with a focus on holistic descriptors in closed-set identification applications. The underlying assumption in such SR-based methods is that each class in the gallery has sufficient samples and the query lies on the subspace spanned by the gallery of the same class. Unfortunately, such an assumption is easily violated in the face verification scenario, where the task is to determine if two faces (where one or both have not been seen before) belong to the same person. In this study, the authors propose an alternative approach to SR-based face verification, where SR encoding is performed on local image patches rather than the entire face. The obtained sparse signals are pooled via averaging to form multiple region descriptors, which then form an overall face descriptor. Owing to the deliberate loss of spatial relations within each region (caused by averaging), the resulting descriptor is robust to misalignment and various image deformations. Within the proposed framework, they evaluate several SR encoding techniques: l1-minimisation, Sparse Autoencoder Neural Network (SANN) and an implicit probabilistic technique based on Gaussian mixture models. Thorough experiments on AR, FERET, exYaleB, BANCA and ChokePoint datasets show that the local SR approach obtains considerably better and more robust performance than several previous state-of-the-art holistic SR methods, on both the traditional closed-set identification task and the more applicable face verification task. The experiments also show that l1-minimisation-based encoding has a considerably higher computational cost when compared with SANN-based and probabilistic encoding, but leads to higher recognition rates.

Co-ordinate Interleaved Distributed Space-Time Coding for Two-Antenna-Relays Networks

Distributed space time coding for wireless relay networks when the source, the destination and the relays have multiple antennas have been studied by Jing and Hassibi. In this set-up, the transmit and the receive signals at different antennas of the same relay are processed and designed independently, even though the antennas are colocated. In this paper, a wireless relay network with single antenna at the source and the destination and two antennas at each of the R relays is considered. A new class of distributed space time block codes called Co-ordinate Interleaved Distributed Space-Time Codes (CIDSTC) are introduced where, in the first phase, the source transmits a T-length complex vector to all the relays;and in the second phase, at each relay, the in-phase and quadrature component vectors of the received complex vectors at the two antennas are interleaved and processed before forwarding them to the destination. Compared to the scheme proposed by Jing-Hassibi, for T >= 4R, while providing the same asymptotic diversity order of 2R, CIDSTC scheme is shown to provide asymptotic coding gain with the cost of negligible increase in the processing complexity at the relays. However, for moderate and large values of P, CIDSTC scheme is shown to provide more diversity than that of the scheme proposed by Jing-Hassibi. CIDSTCs are shown to be fully diverse provided the information symbols take value from an appropriate multidimensional signal set.

Simple Coding Scheme For Modular Arithmetic

A dual representation scheme for performing arithmetic modulo an arbitrary integer M is presented. The coding scheme maps each integer N in the range 0 <= N < M into one of two representations, each being identified by its most significant bit. The encoding of numbers is straightforward and the problem of checking for unused combinations is eliminated.

Impact of automatic region-of-interest coding on perceived quality in mobile video

At present, the most reliable method to obtain end-user perceived quality is through subjective tests. In this paper, the impact of automatic region-of-interest (ROI) coding on perceived quality of mobile video is investigated. The evidence, which is based on perceptual comparison analysis, shows that the coding strategy improves perceptual quality. This is particularly true in low bit rate situations. The ROI detection method used in this paper is based on two approaches: - (1) automatic ROI by analyzing the visual contents automatically, and; - (2) eye-tracking based ROI by aggregating eye-tracking data across many users, used to both evaluate the accuracy of automatic ROI detection and the subjective quality of automatic ROI encoded video. The perceptual comparison analysis is based on subjective assessments with 54 participants, across different content types, screen resolutions, and target bit rates while comparing the two ROI detection methods. The results from the user study demonstrate that ROI-based video encoding has higher perceived quality compared to normal video encoded at a similar bit rate, particularly in the lower bit rate range.

Genetic analysis of foot-and-mouth disease virus serotype A of Indian origin and detection of positive selection and recombination in leader protease- and capsid-coding regions

The leader protease (L-pro) and capsid-coding sequences (P1) constitute approximately 3 kb of the foot-and-mouth disease virus (FMDV). We studied the phylogenetic relationship of 46 FMDV serotype A isolates of Indian origin collected during the period 1968-2005 and also eight vaccine strains using the neighbour-joining tree and Bayesian tree methods. The viruses were categorized under three major groups - Asian, Euro-South American and European. The Indian isolates formed a distinct genetic group among the Asian isolates. The Indian isolates were further classified into different genetic subgroups (<5% divergence). Post-1995 isolates were divided into two subgroups while a few isolates which originated in the year 2005 from Andhra Pradesh formed a separate group. These isolates were closely related to the isolates of the 1970s. The FMDV isolates seem to undergo reverse mutation or onvergent evolution wherein sequences identical to the ancestors are present in the isolates in circulation. The eight vaccine strains included in the study were not related to each other and belonged to different genetic groups. Recombination was detected in the L-pro region in one isolate (A IND 20/82) and in the VP1 coding 1D region in another isolate (A RAJ 21/96). Positive selection was identified at aa positions 23 in the L-pro (P<0.05; 0.046*) and at aa 171 in the capsid protein VP1 (P<0.01; 0.003**).