The sun gives without ever receiving

YEAR: 2010 ROLE: Artist FORMAT: Miniature 3D Sculpture produced in resin using 3D printing technologies. WITH: International Touring Show ‘Inside Out’ WHAT: A miniature sculpture that contributes towards my ongoing explorations into how our collective ability to sustain (the future) is as much a cultural problematic as it is an economic or technological one. OVERVIEW: The curatorial brief was for each curated artist was to design a piece in CAD suitable for 3D resin printing - The object should be entirely generated through 3D visualisation and modelling tools and should be machined and shipped within the dimensions of 6cm x 6cm x 6cm. My design for this brief was influenced by recent research I had conducted in Mildura in the Sunraysia irrigated region of NW Victoria. Each name set within the work is an Australian soldier/settler – who, on returning from the ‘Great War’ was duly awarded a ‘block’ in Australia’s new inland irrigated settlements - with the explicit task of clearing it to plant and reap. Through their concerted and well-intentioned efforts, these workers began to profoundly re-shape Australia’s marginal country - inadvertently presaging the bleak future faced today by many of Australia’s inland lands and river systems. Furthermore, through that time's predominant colonial conception of ‘terra nullius’ (this land is unoccupied and therefore free to be claimed) they each played a small but formative part in building the profound cultural divide between land and peoples that still haunts Australia today. THE EXHIBITION: Inside Out is a compelling international touring exhibition featuring forty-six miniature sculptures produced in resin using 3D printing technologies. Developments in virtual computer visualisation and integrated digital technologies are giving contemporary makers new insight and opportunities to create objects and forms which were previously impossible to produce or difficult to envisage. The exhibition is the result of collaboration between the Art Technology Coalition, the University of Technology Sydney and RMIT University in Australia along with De Montfort University, Manchester Metropolitan University and Dartington College of Arts at University College Falmouth in the United Kingdom.

3D-printing of highly uniform CaSiO3 ceramic scaffolds : preparation, characterization and in vivo osteogenesis

Calcium silicate (CaSiO3, CS) ceramics have received significant attention for application in bone regeneration due to their excellent in vitro apatite-mineralization ability; however, how to prepare porous CS scaffolds with a controllable pore structure for bone tissue engineering still remains a challenge. Conventional methods could not efficiently control the pore structure and mechanical strength of CS scaffolds, resulting in unstable in vivo osteogenesis. The aim of this study is to set out to solve these problems by applying a modified 3D-printing method to prepare highly uniform CS scaffolds with controllable pore structure and improved mechanical strength. The in vivo osteogenesis of the prepared 3D-printed CS scaffolds was further investigated by implanting them in the femur defects of rats. The results show that the CS scaffolds prepared by the modified 3D-printing method have uniform scaffold morphology. The pore size and pore structure of CS scaffolds can be efficiently adjusted. The compressive strength of 3D-printed CS scaffolds is around 120 times that of conventional polyurethane templated CS scaffolds. 3D-Printed CS scaffolds possess excellent apatite-mineralization ability in simulated body fluids. Micro-CT analysis has shown that 3D-printed CS scaffolds play an important role in assisting the regeneration of bone defects in vivo. The healing level of bone defects implanted by 3D-printed CS scaffolds is obviously higher than that of 3D-printed b-tricalcium phosphate (b-TCP) scaffolds at both 4 and 8 weeks. Hematoxylin and eosin (H&E) staining shows that 3D-printed CS scaffolds induce higher quality of the newly formed bone than 3D-printed b-TCP scaffolds. Immunohistochemical analyses have further shown that stronger expression of human type I collagen (COL1) and alkaline phosphate (ALP) in the bone matrix occurs in the 3D-printed CS scaffolds than in the 3D-printed b-TCP scaffolds. Considering these important advantages, such as controllable structure architecture, significant improvement in mechanical strength, excellent in vivo osteogenesis and since there is no need for second-time sintering, it is indicated that the prepared 3D-printed CS scaffolds are a promising material for application in bone regeneration.

Curbing resource consumption using team-based feedback : paper printing in a longitudinal case study

This paper details a team-based feedback approach for reducing resource consumption. The approach uses paper printing within office environments as a case study. It communicates the print usage of each participant’s team rather than the participant’s individual print usage. Feedback is provided weekly via emails and contains normative information, along with eco-metrics and team-based comparative statistics. The approach was empirically evaluated to study the effectiveness of the feedback method. The experiment comprised of 16 people belonging to 4 teams with data on their print usage gathered over 58 weeks, using the first 30-35 weeks as a baseline. The study showed a significant reduction in individual printing with an average of 28%. The experiment confirms the underlying hypothesis that participants are persuaded to reduce their print usage in order to improve the overall printing behaviour of their teams. The research provides clear pathways for future research to qualitatively investigate our findings.

Improved foreground detection via block-based classifier cascade with probabilistic decision integration

Background subtraction is a fundamental low-level processing task in numerous computer vision applications. The vast majority of algorithms process images on a pixel-by-pixel basis, where an independent decision is made for each pixel. A general limitation of such processing is that rich contextual information is not taken into account. We propose a block-based method capable of dealing with noise, illumination variations, and dynamic backgrounds, while still obtaining smooth contours of foreground objects. Specifically, image sequences are analyzed on an overlapping block-by-block basis. A low-dimensional texture descriptor obtained from each block is passed through an adaptive classifier cascade, where each stage handles a distinct problem. A probabilistic foreground mask generation approach then exploits block overlaps to integrate interim block-level decisions into final pixel-level foreground segmentation. Unlike many pixel-based methods, ad-hoc postprocessing of foreground masks is not required. Experiments on the difficult Wallflower and I2R datasets show that the proposed approach obtains on average better results (both qualitatively and quantitatively) than several prominent methods. We furthermore propose the use of tracking performance as an unbiased approach for assessing the practical usefulness of foreground segmentation methods, and show that the proposed approach leads to considerable improvements in tracking accuracy on the CAVIAR dataset.

Counterfeiting attacks on block-wise dependent fragile watermarking schemes

In this paper, we present three counterfeiting attacks on the block-wise dependent fragile watermarking schemes. We consider vulnerabilities such as the exploitation of a weak correlation among block-wise dependent watermarks to modify valid watermarked %(medical or other digital) images, where they could still be verified as authentic, though they are actually not. Experimental results successfully demonstrate the practicability and consequences of the proposed attacks for some relevant schemes. The development of the proposed attack models can be used as a means to systematically examine the security levels of similar watermarking schemes.

Unique X-linked familial FSGS with co-segregating heart block disorder is associated with a mutation in the NXF5 gene

Focal segmental glomerulosclerosis (FSGS) is the consequence of a disease process that attacks the kidney's filtering system, causing serious scarring. More than half of FSGS patients develop chronic kidney failure within 10 years, ultimately requiring dialysis or renal transplantation. There are currently several genes known to cause the hereditary forms of FSGS (ACTN4, TRPC6, CD2AP, INF2, MYO1E and NPHS2). This study involves a large, unique, multigenerational Australian pedigree in which FSGS co-segregates with progressive heart block with apparent X-linked recessive inheritance. Through a classical combined approach of linkage and haplotype analysis, we identified a 21.19 cM interval implicated on the X chromosome. We then used a whole exome sequencing approach to identify two mutated genes, NXF5 and ALG13, which are located within this linkage interval. The two mutations NXF5-R113W and ALG13-T141L segregated perfectly with the disease phenotype in the pedigree and were not found in a large healthy control cohort. Analysis using bioinformatics tools predicted the R113W mutation in the NXF5 gene to be deleterious and cellular studies support a role in the stability and localization of the protein suggesting a causative role of this mutation in these co-morbid disorders. Further studies are now required to determine the functional consequence of these novel mutations to development of FSGS and heart block in this pedigree and to determine whether these mutations have implications for more common forms of these diseases in the general population.

Formalising human recognition : a fundamental building block for security proofs

A fundamental part of many authentication protocols which authenticate a party to a human involves the human recognizing or otherwise processing a message received from the party. Examples include typical implementations of Verified by Visa in which a message, previously stored by the human at a bank, is sent by the bank to the human to authenticate the bank to the human; or the expectation that humans will recognize or verify an extended validation certificate in a HTTPS context. This paper presents general definitions and building blocks for the modelling and analysis of human recognition in authentication protocols, allowing the creation of proofs for protocols which include humans. We cover both generalized trawling and human-specific targeted attacks. As examples of the range of uses of our construction, we use the model presented in this paper to prove the security of a mutual authentication login protocol and a human-assisted device pairing protocol.

Block models for improved earthwork allocation planning in linear infrastructure construction

Earthwork planning has been considered in this article and a generic block partitioning and modelling approach has been devised to provide strategic plans of various levels of detail. Conceptually this approach is more accurate and comprehensive than others, for instance those that are section based. In response to environmental concerns the metric for decision making was fuel consumption and emissions. Haulage distance and gradient are also included as they are important components of these metrics. Advantageously the fuel consumption metric is generic and captures the physical difficulties of travelling over inclines of different gradients, that is consistent across all hauling vehicles. For validation, the proposed models and techniques have been applied to a real world road project. The numerical investigations have demonstrated that the models can be solved with relatively little CPU time. The proposed block models also result in solutions of superior quality, i.e. they have reduced fuel consumption and cost. Furthermore the plans differ considerably from those based solely upon a distance based metric thus demonstrating a need for industry to reflect upon their current practices.

Known and chosen key differential distinguishers for block ciphers

In this paper we investigate the differential properties of block ciphers in hash function modes of operation. First we show the impact of differential trails for block ciphers on collision attacks for various hash function constructions based on block ciphers. Further, we prove the lower bound for finding a pair that follows some truncated differential in case of a random permutation. Then we present open-key differential distinguishers for some well known round-reduced block ciphers.

Cryptanalysis of block ciphers with overdefined systems of equations

Several recently proposed ciphers, for example Rijndael and Serpent, are built with layers of small S-boxes interconnected by linear key-dependent layers. Their security relies on the fact, that the classical methods of cryptanalysis (e.g. linear or differential attacks) are based on probabilistic characteristics, which makes their security grow exponentially with the number of rounds N r r. In this paper we study the security of such ciphers under an additional hypothesis: the S-box can be described by an overdefined system of algebraic equations (true with probability 1). We show that this is true for both Serpent (due to a small size of S-boxes) and Rijndael (due to unexpected algebraic properties). We study general methods known for solving overdefined systems of equations, such as XL from Eurocrypt’00, and show their inefficiency. Then we introduce a new method called XSL that uses the sparsity of the equations and their specific structure. The XSL attack uses only relations true with probability 1, and thus the security does not have to grow exponentially in the number of rounds. XSL has a parameter P, and from our estimations is seems that P should be a constant or grow very slowly with the number of rounds. The XSL attack would then be polynomial (or subexponential) in N r> , with a huge constant that is double-exponential in the size of the S-box. The exact complexity of such attacks is not known due to the redundant equations. Though the presented version of the XSL attack always gives always more than the exhaustive search for Rijndael, it seems to (marginally) break 256-bit Serpent. We suggest a new criterion for design of S-boxes in block ciphers: they should not be describable by a system of polynomial equations that is too small or too overdefined.