An hybrid approach for efficient multicast stream authentication over unsecured channels

We study the multicast stream authentication problem when an opponent can drop, reorder and inject data packets into the communication channel. In this context, bandwidth limitation and fast authentication are the core concerns. Therefore any authentication scheme is to reduce as much as possible the packet overhead and the time spent at the receiver to check the authenticity of collected elements. Recently, Tartary and Wang developed a provably secure protocol with small packet overhead and a reduced number of signature verifications to be performed at the receiver. In this paper, we propose an hybrid scheme based on Tartary and Wang’s approach and Merkle hash trees. Our construction will exhibit a smaller overhead and a much faster processing at the receiver making it even more suitable for multicast than the earlier approach. As Tartary and Wang’s protocol, our construction is provably secure and allows the total recovery of the data stream despite erasures and injections occurred during transmission.

Diversity or perversity?: Award-winning children's literature and the Australian curriculum

Two of the three cross-curriculum priorities for the national Australian Curriculum prescribed by the Australian Curriculum Assessment and Reporting Authority (ACARA) are focussed on what might be called diversity education: “Aboriginal and Torres Strait Islander histories and culture”, and "Asia and Australia's Engagement with Asia” (ACARA, “Cross”). One need not be versed in complex rhetorical theory to understand that, laudable and legitimate as such priorities are, their existence implies that mainstream education in Australia has been or is characterised by the marginalisation or erasure of Australia's history—the original Indigenous cultures are not only living and vibrant today, but also have tens of thousands of years’ “head start” on Australia’s settler cultures—and of its geography—Australia is, after all, located in some physical proximity to Asia. Some might even suggest that Australia is in Asia. These temporal and spatial “forgettings” constitute a kind of cultural perversity which the cross-curricular priorities both seek to address and serve to reinscribe. Even as ACARA requires Australian school students to engage with Aboriginal and Asian histories, cultures, societies, they imply that such histories, cultures, and societies are “diverse”, that they are not those of the students in Australian classrooms; producing them as objects of study rather than as lived experience. This should not necessarily be surprising. Michael W. Apple has provocatively argued that: “one of the perverse effects of a national curriculum actually will be to ‘legitimise inequality.’ It may in fact help create the illusion that whatever the massive differences in schools, they all have something in common” (18). In the Australian context, attempts to mitigate such perversity are articulated via the selection of literary texts. As educators move to resource ACARA’s cross-curricular priorities, ACARA notes that “Teachers and schools are best placed to make decisions about the selection of texts in their teaching and learning programs that address the content in the Australian Curriculum while also meeting the needs of the students in their classes” (ACARA, “Advice”). This assertion appears on a webpage called “Advice on selection of literary texts” which is notable first and foremost for its total lack of any literary texts being named, and its list of weblinks pointing to lists of texts compiled elsewhere, by other organisations, and in the main, compiled to serve agendas other than the Australian curriculum. One of the major resources referred to by ACARA for literary text selection is the Children’s Book Council of Australia (CBCA). Of course, the CBCA’s annual book awards do not share ACARA’s educational priorities, but do have a history of being drawn upon by schools as a curriculum resource. In this paper, I consider the literary texts which have been prized by the CBCA in recent years attending to their engagements with Aboriginal cultures.

The Hazards

"The much-anticipated second collection from the 2007 winner of the Thomas Shapcott Prize. Charged with fierce imagination and swift lyricism, Holland-Batt’s cosmopolitan poems reflect a predatory world rife with hazards both real and imagined. Opening with a vision of a leveret’s agonising death by myxomatosis and closing with a lover disappearing into dangerous waters, this collection careens through diverse geographical territory – from haunted post-colonial landscapes in Australia to brutal animal hierarchies in the cloud forests of Nicaragua. Engaging everywhere with questions of violence and loss, erasure and extinction, The Hazards inhabits unsettling terrain, unafraid to veer straight into turbulence."--Publisher website

Anomalous thermal dynamics of Bragg gratings inscribed in germanosilicate optical fiber

An interesting, periodic appearance of a new peak has been observed in the reflected spectrum of a Fiber Bragg Grating (FBG) inscribed in a germanosilicate fiber during thermal treatment. The new peak occurs on the longer wavelength side of the spectrum during heating and on the shorter wavelength side during cooling, following an identical reverse dynamics. Comparison with a commercial grating with 99.9% reflectivity shows a similar decay dynamics. It is proposed that the distortion due to simultaneous erasure and thermal expansion of the index modulation profile may be responsible for the observed anomaly. The reported results help us in understanding the thermal behavior of FBGs and provide additional insights into the mechanisms responsible for the photosensitivity in germanosilicate fibers.

Intersex onscreen: An overview of recent fictional characters with intersex variations on television

Throughout history, people with intersex variations have been positioned somewhere between ‘prodigy literature and pornography, mythology and medical discourse’ (Gilbert 2000, 145). Indubitably, contemporary representations have changed in step with societal values, yet it could be argued there is still slippage, and, moreover, very little is seen or heard about intersex at all. Where once there was the awe and horror of the highly visible carnival sideshow or medical treatise, the intersex body is now rendered absent by medical intervention, which is invoked to fix the intersexed in both mind and body. This paper explores the fictional representation of people with intersex variations on screen – television and film in predominantly the genres of drama and comedy – arriving finally at characters originating from program-makers willing to work closely with the intersex community. Such texts disrupt unwarranted categorization and erasure by “owning” discursive practices, defying current medical interference and promoting ethical debates around the will-to-normalise what is considered to be aberrant, deviant and abject.

The con-stitutional re-cognition (s)cam-pain: The campaign for the hidden recognition of first nations peoples' racial inferiority

The constitutional recognition campaign has received party-wide support and its efforts have been promoted by Prime Minister Tony Abbott as being something that would ‘complete our Constitution.’ The broader rhetoric surrounding this campaign suggests that it will result in a just, albeit delayed, recognition of indigenous peoples in the Australian legal system. However, beneath the surface of this seemingly benevolent gesture, is a reaffirmation of the colonial subordination and erasure of the several hundred original nations’ peoples and ways of being.

Hardness of approximation results for the problem of finding the stopping distance in Tanner graphs

Tanner Graph representation of linear block codes is widely used by iterative decoding algorithms for recovering data transmitted across a noisy communication channel from errors and erasures introduced by the channel. The stopping distance of a Tanner graph T for a binary linear block code C determines the number of erasures correctable using iterative decoding on the Tanner graph T when data is transmitted across a binary erasure channel using the code C. We show that the problem of finding the stopping distance of a Tanner graph is hard to approximate within any positive constant approximation ratio in polynomial time unless P = NP. It is also shown as a consequence that there can be no approximation algorithm for the problem achieving an approximation ratio of 2(log n)(1-epsilon) for any epsilon > 0 unless NP subset of DTIME(n(poly(log n))).

Explicit Construction of Optimal Exact Regenerating Codes for Distributed Storage

Erasure coding techniques are used to increase the reliability of distributed storage systems while minimizing storage overhead. Also of interest is minimization of the bandwidth required to repair the system following a node failure. In a recent paper, Wu et al. characterize the tradeoff between the repair bandwidth and the amount of data stored per node. They also prove the existence of regenerating codes that achieve this tradeoff. In this paper, we introduce Exact Regenerating Codes, which are regenerating codes possessing the additional property of being able to duplicate the data stored at a failed node. Such codes require low processing and communication overheads, making the system practical and easy to maintain. Explicit construction of exact regenerating codes is provided for the minimum bandwidth point on the storage-repair bandwidth tradeoff, relevant to distributed-mail-server applications. A sub-space based approach is provided and shown to yield necessary and sufficient conditions on a linear code to possess the exact regeneration property as well as prove the uniqueness of our construction. Also included in the paper, is an explicit construction of regenerating codes for the minimum storage point for parameters relevant to storage in peer-to-peer systems. This construction supports a variable number of nodes and can handle multiple, simultaneous node failures. All constructions given in the paper are of low complexity, requiring low field size in particular.

The evolution of genomic imprinting

We explore three possible pathways for the evolution of genomic imprinting. (1) Imprinting may be advantageous in itself when imprinted and unimprinted alleles of a locus confer different phenotypes. If a segment of DNA is imprinted in the gametes of one sex but not in those of the other, it might lead to effects correlated with sexual dimorphism. More fundamentally, in certain organisms, sex determination might have evolved because of imprinting. When imprinting leads to chromosome elimination or inactivation and occurs in some embryos but not in others, two classes of embryos, differing in the number of functional gene copies, would result. A model for sex determination based on inequality in the actual or effective copy-number of particular noncoding, regulatory sequences of DNA has been proposed (Chandra, Proc. natn. Acad. Sci. U.S.A. 82. 1165–1169 and 6947–6949, 1985). Maternal control of offspring sex is another possible consequence of imprinting; this would indicate a potential role for imprinting in sex ratio evolution. (2) Genes responsible for imprinting may have pleiotropic effects and they may have been selected for reasons other than their imprinting ability. Lack of evidence precludes further consideration of this possibility. (3) Imprinting could have co-evolved with other traits. For instance, gamete-specific imprinting could lead to a lowered fitness of androgenetic or gynogenetic diploids relative to the fitness of ‘normal’ diploids. This in turn would reinforce the evolution of anisogamy. The reversibility of imprinting raises the possibility of occasional incomplete or improper erasure. If the site of imprinting is the egg – as appears to be the case with the human X (Chandra and Brown, Nature 253. 165–168, 1975) – either improper imprinting or improper erasure could lead to unusual patterns of inheritance (as in the fragile-X syndrome) or fitness effects skipping generations.

Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction

Regenerating codes are a class of distributed storage codes that allow for efficient repair of failed nodes, as compared to traditional erasure codes. An [n, k, d] regenerating code permits the data to be recovered by connecting to any k of the n nodes in the network, while requiring that a failed node be repaired by connecting to any d nodes. The amount of data downloaded for repair is typically much smaller than the size of the source data. Previous constructions of exact-regenerating codes have been confined to the case n = d + 1. In this paper, we present optimal, explicit constructions of (a) Minimum Bandwidth Regenerating (MBR) codes for all values of [n, k, d] and (b) Minimum Storage Regenerating (MSR) codes for all [n, k, d >= 2k - 2], using a new product-matrix framework. The product-matrix framework is also shown to significantly simplify system operation. To the best of our knowledge, these are the first constructions of exact-regenerating codes that allow the number n of nodes in the network, to be chosen independent of the other parameters. The paper also contains a simpler description, in the product-matrix framework, of a previously constructed MSR code with [n = d + 1, k, d >= 2k - 1].

Codes with Locality for Two Erasures

In this paper, we study codes with locality that can recover from two erasures via a sequence of two local, parity-check computations. By a local parity-check computation, we mean recovery via a single parity-check equation associated with small Hamming weight. Earlier approaches considered recovery in parallel; the sequential approach allows us to potentially construct codes with improved minimum distance. These codes, which we refer to as locally 2-reconstructible codes, are a natural generalization along one direction, of codes with all-symbol locality introduced by Gopalan et al, in which recovery from a single erasure is considered. By studying the generalized Hamming weights of the dual code, we derive upper bounds on the minimum distance of locally 2-reconstructible codes and provide constructions for a family of codes based on Turan graphs, that are optimal with respect to this bound. The minimum distance bound derived here is universal in the sense that no code which permits all-symbol local recovery from 2 erasures can have larger minimum distance regardless of approach adopted. Our approach also leads to a new bound on the minimum distance of codes with all-symbol locality for the single-erasure case.

Layered Exact-Repair Regenerating Codes via Embedded Error Correction and Block Designs

A new class of exact-repair regenerating codes is constructed by stitching together shorter erasure correction codes, where the stitching pattern can be viewed as block designs. The proposed codes have the help-by-transfer property where the helper nodes simply transfer part of the stored data directly, without performing any computation. This embedded error correction structure makes the decoding process straightforward, and in some cases the complexity is very low. We show that this construction is able to achieve performance better than space-sharing between the minimum storage regenerating codes and the minimum repair-bandwidth regenerating codes, and it is the first class of codes to achieve this performance. In fact, it is shown that the proposed construction can achieve a nontrivial point on the optimal functional-repair tradeoff, and it is asymptotically optimal at high rate, i.e., it asymptotically approaches the minimum storage and the minimum repair-bandwidth simultaneously.

Coding for information storage

Storage systems are widely used and have played a crucial rule in both consumer and industrial products, for example, personal computers, data centers, and embedded systems. However, such system suffers from issues of cost, restricted-lifetime, and reliability with the emergence of new systems and devices, such as distributed storage and flash memory, respectively. Information theory, on the other hand, provides fundamental bounds and solutions to fully utilize resources such as data density, information I/O and network bandwidth. This thesis bridges these two topics, and proposes to solve challenges in data storage using a variety of coding techniques, so that storage becomes faster, more affordable, and more reliable.

We consider the system level and study the integration of RAID schemes and distributed storage. Erasure-correcting codes are the basis of the ubiquitous RAID schemes for storage systems, where disks correspond to symbols in the code and are located in a (distributed) network. Specifically, RAID schemes are based on MDS (maximum distance separable) array codes that enable optimal storage and efficient encoding and decoding algorithms. With r redundancy symbols an MDS code can sustain r erasures. For example, consider an MDS code that can correct two erasures. It is clear that when two symbols are erased, one needs to access and transmit all the remaining information to rebuild the erasures. However, an interesting and practical question is: What is the smallest fraction of information that one needs to access and transmit in order to correct a single erasure? In Part I we will show that the lower bound of 1/2 is achievable and that the result can be generalized to codes with arbitrary number of parities and optimal rebuilding.

We consider the device level and study coding and modulation techniques for emerging non-volatile memories such as flash memory. In particular, rank modulation is a novel data representation scheme proposed by Jiang et al. for multi-level flash memory cells, in which a set of n cells stores information in the permutation induced by the different charge levels of the individual cells. It eliminates the need for discrete cell levels, as well as overshoot errors, when programming cells. In order to decrease the decoding complexity, we propose two variations of this scheme in Part II: bounded rank modulation where only small sliding windows of cells are sorted to generated permutations, and partial rank modulation where only part of the n cells are used to represent data. We study limits on the capacity of bounded rank modulation and propose encoding and decoding algorithms. We show that overlaps between windows will increase capacity. We present Gray codes spanning all possible partial-rank states and using only ``push-to-the-top'' operations. These Gray codes turn out to solve an open combinatorial problem called universal cycle, which is a sequence of integers generating all possible partial permutations.

Rewriting Schemes for Flash Memory

Flash memory is a leading storage media with excellent features such as random access and high storage density. However, it also faces significant reliability and endurance challenges. In flash memory, the charge level in the cells can be easily increased, but removing charge requires an expensive erasure operation. In this thesis we study rewriting schemes that enable the data stored in a set of cells to be rewritten by only increasing the charge level in the cells. We consider two types of modulation scheme; a convectional modulation based on the absolute levels of the cells, and a recently-proposed scheme based on the relative cell levels, called rank modulation. The contributions of this thesis to the study of rewriting schemes for rank modulation include the following: we

•propose a new method of rewriting in rank modulation, beyond the previously proposed method of “push-to-the-top”;

•study the limits of rewriting with the newly proposed method, and derive a tight upper bound of 1 bit per cell;

•extend the rank-modulation scheme to support rankings with repetitions, in order to improve the storage density;

•derive a tight upper bound of 2 bits per cell for rewriting in rank modulation with repetitions;

•construct an efficient rewriting scheme that asymptotically approaches the upper bound of 2 bit per cell.

The next part of this thesis studies rewriting schemes for a conventional absolute-levels modulation. The considered model is called “write-once memory” (WOM). We focus on WOM schemes that achieve the capacity of the model. In recent years several capacity-achieving WOM schemes were proposed, based on polar codes and randomness extractors. The contributions of this thesis to the study of WOM scheme include the following: we

•propose a new capacity-achievingWOM scheme based on sparse-graph codes, and show its attractive properties for practical implementation;

•improve the design of polarWOMschemes to remove the reliance on shared randomness and include an error-correction capability.

The last part of the thesis studies the local rank-modulation (LRM) scheme, in which a sliding window going over a sequence of real-valued variables induces a sequence of permutations. The LRM scheme is used to simulate a single conventional multi-level flash cell. The simulated cell is realized by a Gray code traversing all the relative-value states where, physically, the transition between two adjacent states in the Gray code is achieved by using a single “push-to-the-top” operation. The main results of the last part of the thesis are two constructions of Gray codes with asymptotically-optimal rate.

LiNbO3：Fe晶体光栅擦除特性

在光折变过程中，光波对掺杂中心的激发系数S是一个重要的物理量。为了求出光激发系数S对波长A的依赖，研究了在不同的擦除波长条件下，记录在光折变晶体LiNbO3：Fe中的光栅衰减特性。实验结果表明lnP（P为光擦除灵敏度）与擦除波长λ呈线性关系，即波长越短，光栅擦除越快，光擦除灵敏度越高。在单中心电子带传输模型的基础上，理论计算也证实了实验结果。利用带传输模型，给出了理论上光激发系数S对波长的指数依赖关系。同时微观量φμγ（φ为量子效率）也可由光栅擦除实验求出。