Calibration functions for estimating soil moisture from GPR dielectric constant measurements

Ground-penetrating radar (GPR) is widely used for assessment of soil moisture variability in field soils. Because GPR does not measure soil water content directly, it is common practice to use calibration functions that describe its relationship with the soil dielectric properties and textural parameters. However, the large variety of models complicates the selection of the appropriate function. In this article an overview is presented of the different functions available, including volumetric models, empirical functions, effective medium theories, and frequency-specific functions. Using detailed information presented in summary tables, the choice for which calibration function to use can be guided by the soil variables available to the user, the frequency of the GPR equipment, and the desired level of detail of the output. This article can thus serve as a guide for GPR practitioners to obtain soil moisture values and to estimate soil dielectric properties.

Dispositional resistance to change : measurement equivalence and the link to personal values across 17 nations

The concept of dispositional resistance to change has been introduced in a series of exploratory and confirmatory analyses through which the validity of the Resistance to Change (RTC) Scale has been established (S. Oreg, 2003). However, the vast majority of participants with whom the scale was validated were from the United States. The purpose of the present work was to examine the meaningfulness of the construct and the validity of the scale across nations. Measurement equivalence analyses of data from 17 countries, representing 13 languages and 4 continents, confirmed the cross-national validity of the scale. Equivalent patterns of relationships between personal values and RTC across samples extend the nomological net of the construct and provide further evidence that dispositional resistance to change holds equivalent meanings across nations.

Measurement equivalence of the dispositional resistance to change scale

Intended to bridge the gap between the latest methodological developments and cross-cultural research, this interdisciplinary resource presents the latest strategies for analyzing cross-cultural data. Techniques are demonstrated through the use of applications that employ cross national data sets such as the latest European Social Survey. With an emphasis on the generalized latent variable approach, internationally?prominent researchers from a variety of fields explain how the methods work, how to apply them, and how they relate to other methods presented in the book. Syntax and graphical and verbal explanations of the techniques are included. [from publisher's website]

Differences in membrane acyl phospholipid composition between an endothermic mammal and an ectothermic reptile are not limited to any phospholipid class

This study examined questions concerning differences in the acyl composition of membrane phospholipids that have been linked to the faster rates of metabolic processes in endotherms versus ectotherms. In liver, kidney, heart and brain of the ectothermic reptile, Trachydosaurus rugosus, and the endothermic mammal, Rattus norvegicus, previous findings of fewer unsaturates but a greater unsaturation index (UI) in membranes of the mammal versus those of the reptile were confirmed. Moreover, the study showed that the distribution of phospholipid head-group classes was similar in the same tissues of the reptile and mammal and that the differences in acyl composition were present in all phospholipid classes analysed, suggesting a role for the physical over the chemical properties of membranes in determining the faster rates of metabolic processes in endotherms. The most common phosphatidylcholine (PC) molecules present in all tissues (except brain) of the reptile were 16:0/18:1, 16:0/18:2, 18:0/18:2, 18:1/18:1 and 18:1/18:2, whereas arachidonic acid (20:4), containing PCs 16:0/ 20: 4, 18: 0/ 20: 4, were the common molecules in the mammal. The most abundant phosphatidylethanolamines ( PE) used in the tissue of the reptile were 18:0/18:2, 18:0/20:4, 18:1/18:1, 18:1/18:2 and 18:1/20:4, compared to 16: 0/ 18: 2, 16: 0/ 20: 4, 16: 0/ 22: 6, 18: 0/ 20: 4, 18: 0/ 22: 6 and 18:1/20: 4 in the mammal. UI differences were primarily due to arachidonic acid found in both PC and PEs, whereas docosahexaenoic acid (22:6) was a lesser contributor mainly within PEs and essentially absent in the kidney. The phospholipid composition of brain was more similar in the reptile and mammal compared to those of other tissues.

Configurations of Gender, Class and Rurality in Resource Affected Rural Australia

Historically, class has been a key concern in studies of resource affected communities (e.g., Williamson 1982, Warwick and Littlejohn 1992). While work continues, particularly in Britain, today it reflects the rationalization of the British mining sector, and thus focuses largely on mining heritage (e.g., Strangleman et al. 1999, Dicks 2008). In contrast, this chapter examines class relations as manifest in a contemporary setting in rural Australia. This site, the Ravensthorpe Shire in the south west of Western Australia, relied largely on agriculture until 2004 when BHP Billiton commenced construction of a nickel mine in the area. This affected the entire Shire as well as the two rural communities of Ravensthorpe and Hopetoun. The mine, which was officially opened in June 2008, is one of a large number of new mineral and energy developments being established in non metropolitan areas of the country as high international demand for resources fuels significant growth in the sector. In a single six month period in 2009, for example, 15 major minerals and energy projects were completed across the nation and a further 74 projects were at advanced stages (Australian Bureau of Agricultural Economics 2009). A number of these were, as was the case in Ravensthorpe, in what had been traditionally agricultural communities.

A study of the emotional climate of a science education class for pre-service teachers in Bhutan

This thesis studied the emotional climate (EC) of a pre-service science teachers' class in Bhutan. It examined the types of activities students engaged in and the relationship between the tutor and students whose interactions produced both positive and negative EC in the class. The major finding was that the activities involving students' presentations using video clips and models, group activity, and coteaching valenced the class EC positively. Negative EC was identified when the tutor ignored students' responses, during formal lectures, and when the tutor was uncertain of the subject knowledge. The replication of activities that produce positive EC by other Bhutanese tutors may improve the standard of science education in the country.

Corporate governance and securities class actions

This study investigates the governance attributes of firms that have been subject to securities class actions (SCAs). There has been a recent sizable increase in the number of firms subject to SCAs in Australia. We examine a sample of firms that have been subject to SCAs due to disclosure breaches and match the firms by industry and size to a control sample. First, we examine the compliance culture of the SCA firms via the frequency of Australian Securities Exchange (ASX)queries of the firm and find that the frequency of ASX queries is positively associated with the occurrence of a SCA. Secondly, we provide evidence that SCA firms exhibit weaker levels of corporate governance than the matched control sample. In addition, we contribute to the understanding of firms subject to SCAs and their corporate governance attributes. Our results suggest the presence of a nomination committee may be associated with higher agency costs and that the influence of CEO duality may reduce the effectiveness of a nomination committee.

The SOS screen in Arabidopsis: a search for functions involved in DNA metabolism

The SOS screen, as originally described by Perkins et al. (1999), was setup with the aim of identifying Arabidopsis functions that might potentially be involved in the DNA metabolism. Such functions, when expressed in bacteria, are prone to disturb replication and thus trigger the SOS response. Consistently, expression of AtRAD51 and AtDMC1 induced the SOS response in bacteria, even affecting E. coli viability. 100 SOS-inducing cDNAs were isolated from a cDNA library constructed from an Arabidopsis cell suspension that was found to highly express meiotic genes. A large proportion of these SOS+ candidates are clearly related to the DNA metabolism, others could be involved in the RNA metabolism, while the remaining cDNAs encode either totally unknown proteins or proteins that were considered as irrelevant. Seven SOS+ candidate genes are induced following gamma irradiation. The in planta function of several of the SOS-inducing clones was investigated using T-DNA insertional mutants or RNA interference. Only one SOS+ candidate, among those examined, exhibited a defined phenotype: silenced plants for DUT1 were sensitive to 5-fluoro-uracil (5FU), as is the case of the leaky dut-1 mutant in E. coli that are affected in dUTPase activity. dUTPase is essential to prevent uracil incorporation in the course of DNA replication.

Generalized azimuthal shear deformations in compressible isotropic elastic materials

In this article we study the azimuthal shear deformations in a compressible Isotropic elastic material. This class of deformations involves an azimuthal displacement as a function of the radial and axial coordinates. The equilibrium equations are formulated in terms of the Cauchy-Green strain tensors, which form an overdetermined system of partial differential equations for which solutions do not exist in general. By means of a Legendre transformation, necessary and sufficient conditions for the material to support this deformation are obtained explicitly, in the sense that every solution to the azimuthal equilibrium equation will satisfy the remaining two equations. Additionally, we show how these conditions are sufficient to support all currently known deformations that locally reduce to simple shear. These conditions are then expressed both in terms of the invariants of the Cauchy-Green strain and stretch tensors. Several classes of strain energy functions for which this deformation can be supported are studied. For certain boundary conditions, exact solutions to the equilibrium equations are obtained. © 2005 Society for Industrial and Applied Mathematics.

Higher order universal one-way hash functions from the subset sum assumption

Universal One-Way Hash Functions (UOWHFs) may be used in place of collision-resistant functions in many public-key cryptographic applications. At Asiacrypt 2004, Hong, Preneel and Lee introduced the stronger security notion of higher order UOWHFs to allow construction of long-input UOWHFs using the Merkle-Damgård domain extender. However, they did not provide any provably secure constructions for higher order UOWHFs. We show that the subset sum hash function is a kth order Universal One-Way Hash Function (hashing n bits to m < n bits) under the Subset Sum assumption for k = O(log m). Therefore we strengthen a previous result of Impagliazzo and Naor, who showed that the subset sum hash function is a UOWHF under the Subset Sum assumption. We believe our result is of theoretical interest; as far as we are aware, it is the first example of a natural and computationally efficient UOWHF which is also a provably secure higher order UOWHF under the same well-known cryptographic assumption, whereas this assumption does not seem sufficient to prove its collision-resistance. A consequence of our result is that one can apply the Merkle-Damgård extender to the subset sum compression function with ‘extension factor’ k+1, while losing (at most) about k bits of UOWHF security relative to the UOWHF security of the compression function. The method also leads to a saving of up to m log(k+1) bits in key length relative to the Shoup XOR-Mask domain extender applied to the subset sum compression function.

Homogeneous bent functions of degree n in 2n variables do not exist for n>3

We prove that homogeneous bent functions f:GF(2)^2n --> GF(2) of degree n do not exist for n>3. Consequently homogeneous bent functions must have degree 3.

How to strengthen any weakly unforgeable signature into a strongly unforgeable signature

Standard signature schemes are usually designed only to achieve weak unforgeability – i.e. preventing forgery of signatures on new messages not previously signed. However, most signature schemes are randomised and allow many possible signatures for a single message. In this case, it may be possible to produce a new signature on a previously signed message. Some applications require that this type of forgery also be prevented – this requirement is called strong unforgeability. At PKC2006, Boneh Shen and Waters presented an efficient transform based on any randomised trapdoor hash function which converts a weakly unforgeable signature into a strongly unforgeable signature and applied it to construct a strongly unforgeable signature based on the CDH problem. However, the transform of Boneh et al only applies to a class of so-called partitioned signatures. Although many schemes fall in this class, some do not, for example the DSA signature. Hence it is natural to ask whether one can obtain a truly generic efficient transform based on any randomised trapdoor hash function which converts any weakly unforgeable signature into a strongly unforgeable one. We answer this question in the positive by presenting a simple modification of the Boneh-Shen-Waters transform. Our modified transform uses two randomised trapdoor hash functions.

Shared generation of pseudo-random functions

In Crypto’95, Micali and Sidney proposed a method for shared generation of a pseudo-random function f(·) among n players in such a way that for all the inputs x, any u players can compute f(x) while t or fewer players fail to do so, where 0⩽tfunctions, among the n players, each player gets a subset of S, in such a way that any u players together hold all the secret seeds in S while any t or fewer players will lack at least one element from S. The pseudo-random function is then computed as where fsi(·)'s are poly-random functions. One question raised by Micali and Sidney is how to distribute the secret seeds satisfying the above condition such that the number of seeds, d, is as small as possible. In this paper, we continue the work of Micali and Sidney. We first provide a general framework for shared generation of pseudo-random function using cumulative maps. We demonstrate that the Micali–Sidney scheme is a special case of this general construction. We then derive an upper and a lower bound for d. Finally we give a simple, yet efficient, approximation greedy algorithm for generating the secret seeds S in which d is close to the optimum by a factor of at most u ln 2.

Shared generation of pseudo-random functions with cumulative maps

In Crypto’95, Micali and Sidney proposed a method for shared generation of a pseudo-random function f(·) among n players in such a way that for all the inputs x, any u players can compute f(x) while t or fewer players fail to do so, where 0 ≤ t < u ≤ n. The idea behind the Micali-Sidney scheme is to generate and distribute secret seeds S = s1, . . . , sd of a poly-random collection of functions, among the n players, each player gets a subset of S, in such a way that any u players together hold all the secret seeds in S while any t or fewer players will lack at least one element from S. The pseudo-random function is then computed as where f s i (·)’s are poly-random functions. One question raised by Micali and Sidney is how to distribute the secret seeds satisfying the above condition such that the number of seeds, d, is as small as possible. In this paper, we continue the work of Micali and Sidney. We first provide a general framework for shared generation of pseudo-random function using cumulative maps. We demonstrate that the Micali-Sidney scheme is a special case of this general construction.We then derive an upper and a lower bound for d. Finally we give a simple, yet efficient, approximation greedy algorithm for generating the secret seeds S in which d is close to the optimum by a factor of at most u ln 2.