NELR Editorial Federal Updates Issue 2012:3

Despite opposition from environmentalists, farmers and parts of the fishing industry, on 23 August 2012, the $6.4bn Alpha Coal mine and rail project in Queensland was approved under the EPBC Act, subject to 19 conditions.1 The approval relates to the proposed construction and operation of an open-cut coal mine and 495km railway line to Abbott Point...

All the worldwide web's a stage : teenage girls' self-presentation and identities formation through status updates

This study investigates grade eight girls’ use of status updates on Facebook in order to create identities online. Using sociologist Erving Goffman’s theory of self-presentation as a framework, Jones and Pittman’s subsequent strategies of self-presentation are used to discover the ways in which teenage girls use status updates in order to create identities online and manage audience impressions. Using a mixed methods design, the results showed that, while existing self-presentation strategies persist, social networking has created new means of self-presentation. This study adds to a growing pool of research regarding teens’ engagement with social networking websites to form identities.

A new dynamic accumulator for batch updates

A dynamic accumulator is an algorithm, which gathers together a large set of elements into a constant-size value such that for a given element accumulated, there is a witness confirming that the element was indeed included into the value, with a property that accumulated elements can be dynamically added and deleted into/from the original set such that the cost of an addition or deletion operation is independent of the number of accumulated elements. Although the first accumulator was presented ten years ago, there is still no standard formal definition of accumulators. In this paper, we generalize formal definitions for accumulators, formulate a security game for dynamic accumulators so-called Chosen Element Attack (CEA), and propose a new dynamic accumulator for batch updates based on the Paillier cryptosystem. Our construction makes a batch of update operations at unit cost. We prove its security under the extended strong RSA (es-RSA) assumption

Updates in inducible transgene expression using viral vectors : from transient to stable expression

The prospect of economically producing useful biologics in plants has greatly increased with the advent of viral vectors. The ability of viral vectors to amplify transgene expression has seen them develop into robust transient platforms for the high-level, rapid production of recombinant proteins. To adapt these systems to stably transformed plants, new ways of deconstructing the virus machinery and linking its expression and replication to chemically controlled promoters have been developed. The more advanced of these stable, inducible hyper-expression vectors provide both activated and amplified heterologous transgene expression. Such systems could be deployed in broad acre crops and provide a pathway to fully exploit the advantages of plants as a platform for the manufacture of a wide spectrum of products.

Updates on sorting of fully homomorphic encrypted data

In this paper, we show implementation results of various algorithms that sort data encrypted with Fully Homomorphic Encryption scheme based on Integers. We analyze the complexities of sorting algorithms over encrypted data by considering Bubble Sort, Insertion Sort, Bitonic Sort and Odd-Even Merge sort. Our complexity analysis together with implementation results show that Odd-Even Merge Sort has better performance than the other sorting techniques. We observe that complexity of sorting in homomorphic domain will always have worst case complexity independent of the nature of input. In addition, we show that combining different sorting algorithms to sort encrypted data does not give any performance gain when compared to the application of sorting algorithms individually.

Scalable flow-sensitive pointer analysis for fava with strong updates

The ability to perform strong updates is the main contributor to the precision of flow-sensitive pointer analysis algorithms. Traditional flow-sensitive pointer analyses cannot strongly update pointers residing in the heap. This is a severe restriction for Java programs. In this paper, we propose a new flow-sensitive pointer analysis algorithm for Java that can perform strong updates on heap-based pointers effectively. Instead of points-to graphs, we represent our points-to information as maps from access paths to sets of abstract objects. We have implemented our analysis and run it on several large Java benchmarks. The results show considerable improvement in precision over the points-to graph based flow-insensitive and flow-sensitive analyses, with reasonable running time.

Iterated stochastic filters with additive updates for dynamic system identification: Annealing-type iterations and the filter bank

A nonlinear stochastic filtering scheme based on a Gaussian sum representation of the filtering density and an annealing-type iterative update, which is additive and uses an artificial diffusion parameter, is proposed. The additive nature of the update relieves the problem of weight collapse often encountered with filters employing weighted particle based empirical approximation to the filtering density. The proposed Monte Carlo filter bank conforms in structure to the parent nonlinear filtering (Kushner-Stratonovich) equation and possesses excellent mixing properties enabling adequate exploration of the phase space of the state vector. The performance of the filter bank, presently assessed against a few carefully chosen numerical examples, provide ample evidence of its remarkable performance in terms of filter convergence and estimation accuracy vis-a-vis most other competing filters especially in higher dimensional dynamic system identification problems including cases that may demand estimating relatively minor variations in the parameter values from their reference states. (C) 2014 Elsevier Ltd. All rights reserved.

Updates in the Philippines: Where are the captive milkfish breeders?

A map is provided showing the location of milkfish rearing facilities in the Philippines. Most of the 17,443 milkfish broodstocks are located in central Philippines. A table shows details as to the rearing facility (cage, pen, pond, tank), number of broodstocks, and age. There are 13,420 broodstocks in ponds; 2,081 in cages; 842 in tanks, and 1,100 in pens. The youngest is 3 years, the oldest 23 years old.

The HITRAN molecular spectroscopic database: Edition of 2000 including updates through 2001

This paper describes the status circa 2001, of the HITRAN compilation that comprises the public edition available through 2001. The HITRAN compilation consists of several components useful for radiative transfer calculation codes: high-resolution spectroscopic parameters of molecules in the gas phase, absorption cross-sections for molecules with very dense spectral features, aerosol refractive indices, ultraviolet line-by-line parameters and absorption cross-sections, and associated database management software. The line-by-line portion of the database contains spectroscopic parameters for 38 molecules and their isotopologues and isotopomers suitable for calculating atmospheric transmission and radiance properties. Many more molecular species are presented in the infrared cross-section data than in the previous edition, especially the chlorofluorocarbons and their replacement gases. There is now sufficient representation so that quasi-quantitative simulations can be obtained with the standard radiance codes. In addition to the description and justification of new or modified data that have been incorporated since the last edition of HITRAN (1996), future modifications are indicated for cases considered to have a significant impact on remote-sensing experiments. © 2003 Elsevier Ltd. All rights reserved.