Templated i-PVD of metallic nanodot arrays

The results of numerical simulation of plasma-based, porous, template-assisted nanofabrication of Au nanodot arrays on highly-doped silicon taking into account typical electron density of low-temperature plasma of 1017-1018 m-3 and electron temperature of 2-5 eV are reported here. Three-dimensional microscopic topography of ion flux distribution over the outer and inner surfaces of the nanoporous template is obtained via numerical simulation of Au ion trajectories in the plasma sheath, in the close proximity of, and inside the nanopores. It is shown that, by manipulating the electron temperature, the cross-sheath potential drop, and by additionally altering the structure of the nanoporous template, one can control the ion fluxes within the nanopores, and eventually maximize the ion deposition onto the top surface of the developing crystalline Au nanodots (see top panel in the figure). In the same time, this procedure allows one to minimize amorphous deposits on the sidewalls that clutter and may eventually close the nanopores, thus disrupting the nanodot growth process, as it is shown in the bottom panel in the figure on the right.

Enriching the "I" in Bim : a BIM-Specifications (Bimspecs) approach

This paper conceptualizes a framework for bridging the BIM-Specifications divide by embedding project-specific information in BIM objects by means of a product library. We demonstrate how model information, enriched with data at various levels of development (LODs), can evolve simultaneously with design and construction using a window object embedded in a wall as life-cycle phase exemplars at different levels of granularity. The conceptual approach is informed by the need for exploring an approach that takes cognizance of the limitations of current modelling tools in enhancing the information content of BIM models. Therefore, this work attempts to answer the question, “How can the modelling of building information be enhanced throughout the life-cycle phases of buildings utilizing building specification information?”

On secure multi-party computation in black-box groups

We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function f G (x 1,...,x n ) = x 1 ·x 2 ⋯ x n in an arbitrary finite group (G,·), where the input of party P i is x i  ∈ G for i = 1,...,n. For flexibility, we are interested in protocols for f G which require only black-box access to the group G (i.e. the only computations performed by players in the protocol are a group operation, a group inverse, or sampling a uniformly random group element). Our results are as follows. First, on the negative side, we show that if (G,·) is non-abelian and n ≥ 4, then no ⌈n/2⌉-private protocol for computing f G exists. Second, on the positive side, we initiate an approach for construction of black-box protocols for f G based on k-of-k threshold secret sharing schemes, which are efficiently implementable over any black-box group G. We reduce the problem of constructing such protocols to a combinatorial colouring problem in planar graphs. We then give two constructions for such graph colourings. Our first colouring construction gives a protocol with optimal collusion resistance t < n/2, but has exponential communication complexity O(n*2t+1^2/t) group elements (this construction easily extends to general adversary structures). Our second probabilistic colouring construction gives a protocol with (close to optimal) collusion resistance t < n/μ for a graph-related constant μ ≤ 2.948, and has efficient communication complexity O(n*t^2) group elements. Furthermore, we believe that our results can be improved by further study of the associated combinatorial problems.

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.

What I want for my Social Network privacy

Social Networks (SN) users have various privacy requirements to protect their information; to address this issue, a six-stage thematic analysis of scholarly articles related to SN user privacy concerns were synthesized. Then this research combines mixed methods research employing the strengths of quantitative and qualitative research to investigate general SN users, and thus construct a new set of ?ve primary and Twenty-?ve secondary SN user privacy requirements. Such an approach has been rarely used to examine the privacy requirements. Factor analysis results show superior agreement with theoretical predictions and signi?cant improvement over previous alternative models of SN user privacy requirements. This research presented here has the potential to provide for the development of more sophisticated privacy controls which will increase the ability of SN users to: specify their rights in SNs and to determine the protection of their own SN data.

Optimizing I/O cost and managing memory for composition vector method based on correlation matrix calculation in bioinformatics

The generation of a correlation matrix for set of genomic sequences is a common requirement in many bioinformatics problems such as phylogenetic analysis. Each sequence may be millions of bases long and there may be thousands of such sequences which we wish to compare, so not all sequences may fit into main memory at the same time. Each sequence needs to be compared with every other sequence, so we will generally need to page some sequences in and out more than once. In order to minimize execution time we need to minimize this I/O. This paper develops an approach for faster and scalable computing of large-size correlation matrices through the maximal exploitation of available memory and reducing the number of I/O operations. The approach is scalable in the sense that the same algorithms can be executed on different computing platforms with different amounts of memory and can be applied to different bioinformatics problems with different correlation matrix sizes. The significant performance improvement of the approach over previous work is demonstrated through benchmark examples.

Iron(II) spin transition complexes with dendritic ligands, Part I

The ligands G1- and G2-oligo (benzyl ether) (PBE) dendrons and their iron(II) complexes [Fe(Gn-PBE)3]A2·xH2O (with n = 1, 2 and A = triflate, tosylate) were prepared. The magnetic properties of the complexes were investigated by a SQUID magnetometer. All complexes exhibit gradual spin transition below room temperature. At very low temperatures the magnetic behaviour reflects zero-field splitting (ZFS) effects. 57Fe-Mössbauer spectroscopy was performed to distinguish between ZFS of high spin species and spin state conversion into the low spin state. Further characterisation was carried out by thermogravimetric analysis (TGA) and FT-IR spectroscopy. Structural features have been determined by powder XRD measurements.

Achieving enterprise integration through software customization : part I-evidence from the field

Achieving business and IT integration is strategic goal for many organisations – it has almost become the ‘Holy Grail’ of organisational success. In this environment Enterprise Resource Planning (ERP) packages have become the defacto option for addressing this issue. Integration has come to mean adopting ERP, through configuration and without customization, but this all or nothing approach has proved difficult for many organisations. In part 1 of a 2 part update we provide evidence from the field that suggests that whilst costly, if managed appropriately, customization can have value in aiding organisational integration efforts. In part 2, we discuss in more detail the benefits and pitfalls involved in enacting a non-standard based integration strategy.

‘He has a way gayer Facebook than I do’ : investigating sexual identity disclosure and context collapse on a social networking site

This study extends previous research into social networking sites (SNSs) as environments that often reduce spatial, temporal, and social boundaries, which can result in collapsed contexts for social situations. Context collapse was investigated through interviews and Facebook walkthroughs with 27 LGBTQ young people in the United Kingdom. Since diverse sexualities are often stigmatized, participants’ sexual identity disclosure decisions were shaped by both the social conditions of their online networks and the technological architecture of SNSs. Context collapse was experienced as an event through which individuals intentionally redefined their sexual identity across audiences or managed unintentional disclosure. To prevent unintentional context collapse, participants frequently reinstated contexts through tailored performances and audience separation. These findings provide insight into stigmatized identity performances in networked publics while situating context collapse within a broader understanding of impression management, which paves the way for future research exploring the identity implications of everyday SNS use.

The Escherichia coli O157:H7 EhaB autotransporter protein binds to laminin and collagen I and induces a serum IgA response in O157:H7 challenged cattle

Enterohaemorrhagic Escherichia coli (EHEC) are a subgroup of Shiga toxin-producing E. coli that cause gastrointestinal disease with the potential for life-threatening sequelae. Cattle serve as the natural reservoir for EHEC and outbreaks occur sporadically as a result of contaminated beef and other farming products. While certain EHEC virulence mechanisms have been extensively studied, the factors that mediate host colonization are poorly defined. Previously, we identified four proteins (EhaA,B,C,D) from the prototypic EHEC strain EDL933 that belong to the autotransporter (AT) family. Here we characterize the EhaB AT protein. EhaB was shown to be located at the cell surface and overexpression in E. coli K-12 resulted in significant biofilm formation under continuous flow conditions. Overexpression of EhaB in E. coli K12 and EDL933 backgrounds also promoted adhesion to the extracellular matrix proteins collagen I and laminin. An EhaB-specific antibody revealed that EhaB is expressed in E. coli EDL933 following in vitro growth. EhaB also cross-reacted with serum IgA from cattle challenged with E. coli O157:H7, indicating that EhaB is expressed in vivo and elicits a host IgA immune response.

I fucking love you

A solo show by Courtney Coombs held at MetroArts in Brisbane as part of the 2011 Allies Program. The exhibtion comprised a series of sculptural, photographic, text and video works that each employed motifs evocative of romantic love combined with the artist self-effacing and ambivalent relationship to the art world and its male canon. The resulting exhibition acted as a meditation of female authorship in the studio and the contradictory impulses of critique and adoration.

Speaker verification using I-vector features

This PhD research has provided novel solutions to three major challenges which have prevented the wide spread deployment of speaker recognition technology: (1) combating enrolment/ verification mismatch, (2) reducing the large amount of development and training data that is required and (3) reducing the duration of speech required to verify a speaker. A range of applications of speaker recognition technology from forensics in criminal investigations to secure access in banking will benefit from the research outcomes.