In vitro breeding strategies in the development of Australian native plants

Plant tissue culture is a technique that exploits the ability of many plant cells to revert to a meristematic state. Although originally developed for botanical research, plant tissue culture has now evolved into important commercial practices and has become a significant research tool in agriculture, horticulture and in many other areas of plant sciences. Plant tissue culture is the sterile culture of plant cells, tissues, or organs under aseptic conditions leading to cell multiplication or regeneration or organs and whole plants. The steps required to develop reliable systems for plant regeneration and their application in plant biotechnology are reviewed in countless books. Some of the major landmarks in the evolution of in vitro techniques are summarised in Table 5.1. In this chapter the current applications of this technology to agriculture, horticulture, forestry and plant breeding are briefly described with specific examples from Australian plants when applicable.

Experiences with implementing common mathematical operations using field programmable gate arrays

Many computationally intensive scientific applications involve repetitive floating point operations other than addition and multiplication which may present a significant performance bottleneck due to the relatively large latency or low throughput involved in executing such arithmetic primitives on commod- ity processors. A promising alternative is to execute such primitives on Field Programmable Gate Array (FPGA) hardware acting as an application-specific custom co-processor in a high performance reconfig- urable computing platform. The use of FPGAs can provide advantages such as fine-grain parallelism but issues relating to code development in a hardware description language and efficient data transfer to and from the FPGA chip can present significant application development challenges. In this paper, we discuss our practical experiences in developing a selection of floating point hardware designs to be implemented using FPGAs. Our designs include some basic mathemati cal library functions which can be implemented for user defined precisions suitable for novel applications requiring non-standard floating point represen- tation. We discuss the details of our designs along with results from performance and accuracy analysis tests.

Solving tri-diagonal linear systems using field programmable gate arrays

In this paper, we present the outcomes of a project on the exploration of the use of Field Programmable Gate Arrays(FPGAs) as co-processors for scientific computation. We designed a custom circuit for the pipelined solving of multiple tri-diagonal linear systems. The design is well suited for applications that require many independent tri diagonal system solves, such as finite difference methods for solving PDEs or applications utilising cubic spline interpolation. The selected solver algorithm was the Tri Diagonal Matrix Algorithm (TDMA or Thomas Algorithm). Our solver supports user specified precision thought the use of a custom floating point VHDL library supporting addition, subtraction, multiplication and division. The variable precision TDMA solver was tested for correctness in simulation mode. The TDMA pipeline was tested successfully in hardware using a simplified solver model. The details of implementation, the limitations, and future work are also discussed.

Solving tri-diagonal linear systems using field programmable gate arrays

In this paper, we present the outcomes of a project on the exploration of the use of Field Programmable Gate Arrays (FPGAs) as co-processors for scientific computation. We designed a custom circuit for the pipelined solving of multiple tri-diagonal linear systems. The design is well suited for applications that require many independent tri-diagonal system solves, such as finite difference methods for solving PDEs or applications utilising cubic spline interpolation. The selected solver algorithm was the Tri-Diagonal Matrix Algorithm (TDMA or Thomas Algorithm). Our solver supports user specified precision thought the use of a custom floating point VHDL library supporting addition, subtraction, multiplication and division. The variable precision TDMA solver was tested for correctness in simulation mode. The TDMA pipeline was tested successfully in hardware using a simplified solver model. The details of implementation, the limitations, and future work are also discussed.

Compression therapy : getting it right

Teaching basic principles of colonisation, contamination and infection has revolutionised approaches to wound care. Wound colonisation is classified as the existence of bacteria with no obvious host reaction (Carville 2005). The act of wound contamination is recognised as introducing micro-organisms into the wound (Ellis 2004). Wound infection is an invasion and multiplication of micro-organisms causing localised and systemic effects (Baranoski and Ayello 2004). Through clinical practice, nurses inadvertently engage in wound contamination thus setting the environment for wound infection.

Simulation architecture for cooperative ITS applications and augmented perception

Cooperative Systems provide, through the multiplication of information sources over the road, a lot of potential to improve the safety of road users, especially drivers. However, developing cooperative ITS applications requires additional resources compared to non-cooperative applications which are both time consuming and expensive. In this paper, we present a simulation architecture aimed at prototyping cooperative ITS applications in an accurate and detailed, close-to-reality environment; the architecture is designed to be modular and generalist. It can be used to simulate any type of CS applications as well as augmented perception. Then, we discuss the results of two applications deployed with our architecture, using a common freeway emergency braking scenario. The first application is Emergency Electronic Brake Light (EEBL); we discuss improvements in safety in terms of the number of crashes and the severity of crashes. The second application compares the performance of a cooperative risk assessment using an augmented map against a non-cooperative approach based on local-perception only. Our results show a systematic improvement of forward warning time for most vehicles in the string when using the augmented-map-based risk assessment.

Comparing cooperative and non-cooperative crash risk assessment

Cooperative Systems provide, through the multiplication of information sources over the road, a lot of potential to improve the assessment of the road risk describing a particular driving situation. In this paper, we compare the performance of a cooperative risk assessment approach against a non-cooperative approach; we used an advanced simulation framework, allowing for accurate and detailed, close-to-reality simulations. Risk is estimated, in both cases, with combinations of indicators based on the TTC. For the non-cooperative approach, vehicles are equipped only with an AAC-like forward-facing ranging sensor. On the other hand, for the cooperative approach, vehicles share information through 802.11p IVC and create an augmented map representing their environment; risk indicators are then extracted from this map. Our system shows that the cooperative risk assessment provides a systematic increase of forward warning to most of the vehicles involved in a freeway emergency braking scenario, compared to a non-cooperative system.

Modelling client puzzles and denial-of-service resistant protocols

Denial-of-service (DoS) attacks are a growing concern to networked services like the Internet. In recent years, major Internet e-commerce and government sites have been disabled due to various DoS attacks. A common form of DoS attack is a resource depletion attack, in which an attacker tries to overload the server's resources, such as memory or computational power, rendering the server unable to service honest clients. A promising way to deal with this problem is for a defending server to identify and segregate malicious traffic as earlier as possible. Client puzzles, also known as proofs of work, have been shown to be a promising tool to thwart DoS attacks in network protocols, particularly in authentication protocols. In this thesis, we design efficient client puzzles and propose a stronger security model to analyse client puzzles. We revisit a few key establishment protocols to analyse their DoS resilient properties and strengthen them using existing and novel techniques. Our contributions in the thesis are manifold. We propose an efficient client puzzle that enjoys its security in the standard model under new computational assumptions. Assuming the presence of powerful DoS attackers, we find a weakness in the most recent security model proposed to analyse client puzzles and this study leads us to introduce a better security model for analysing client puzzles. We demonstrate the utility of our new security definitions by including two hash based stronger client puzzles. We also show that using stronger client puzzles any protocol can be converted into a provably secure DoS resilient key exchange protocol. In other contributions, we analyse DoS resilient properties of network protocols such as Just Fast Keying (JFK) and Transport Layer Security (TLS). In the JFK protocol, we identify a new DoS attack by applying Meadows' cost based framework to analyse DoS resilient properties. We also prove that the original security claim of JFK does not hold. Then we combine an existing technique to reduce the server cost and prove that the new variant of JFK achieves perfect forward secrecy (the property not achieved by original JFK protocol) and secure under the original security assumptions of JFK. Finally, we introduce a novel cost shifting technique which reduces the computation cost of the server significantly and employ the technique in the most important network protocol, TLS, to analyse the security of the resultant protocol. We also observe that the cost shifting technique can be incorporated in any Diffine{Hellman based key exchange protocol to reduce the Diffie{Hellman exponential cost of a party by one multiplication and one addition.

Bandwidth considerations for multilevel converters

Multilevel converters can achieve an overall effective switch frequency multiplication and consequent ripple reduction through the cancellation of the lowest order switch frequency terms. This paper investigates the harmonic content and the frequency response of these multimodulator converters. It is shown that the transfer function of uniformly sampled modulators is a bessel function associated with the inherent sampling process. Naturally sampled modulators have a flat transfer function, but multiple switchings per switch cycle will occur unless the input is slew-rate limited. Lower sideband harmonics of the effective carrier frequency and, in uniform converters, harmonics of the input signal also limit the useful bandwidth. Observations about the effect of the number of converters, their type (naturally or uniformly sampled), and the ratio of modulating frequency and switch frequency are made

Active security in multiparty computation over black-box groups

Most previous work on unconditionally secure multiparty computation has focused on computing over a finite field (or ring). Multiparty computation over other algebraic structures has not received much attention, but is an interesting topic whose study may provide new and improved tools for certain applications. At CRYPTO 2007, Desmedt et al introduced a construction for a passive-secure multiparty multiplication protocol for black-box groups, reducing it to a certain graph coloring problem, leaving as an open problem to achieve security against active attacks. We present the first n-party protocol for unconditionally secure multiparty computation over a black-box group which is secure under an active attack model, tolerating any adversary structure Δ satisfying the Q 3 property (in which no union of three subsets from Δ covers the whole player set), which is known to be necessary for achieving security in the active setting. Our protocol uses Maurer’s Verifiable Secret Sharing (VSS) but preserves the essential simplicity of the graph-based approach of Desmedt et al, which avoids each shareholder having to rerun the full VSS protocol after each local computation. A corollary of our result is a new active-secure protocol for general multiparty computation of an arbitrary Boolean circuit.

Tensor-based item recommendation using probabilistic ranking in social tagging systems

A common problem with the use of tensor modeling in generating quality recommendations for large datasets is scalability. In this paper, we propose the Tensor-based Recommendation using Probabilistic Ranking method that generates the reconstructed tensor using block-striped parallel matrix multiplication and then probabilistically calculates the preferences of user to rank the recommended items. Empirical analysis on two real-world datasets shows that the proposed method is scalable for large tensor datasets and is able to outperform the benchmarking methods in terms of accuracy.

Linear filtering in DCT IV/DST IV and MDCT/MDST domain

In this paper, expressions for convolution multiplication properties of DCT IV and DST IV are derived starting from equivalent DFT representations. Using these expressions methods for implementing linear filtering through block convolution in the DCT IV and DST IV domain are proposed. Techniques developed for DCT IV and DST IV are further extended to MDCT and MDST where the filter implementation is near exact for symmetric filters and approximate for non-symmetric filters. No additional overlapping is required for implementing the symmetric filtering in the MDCT domain and hence the proposed algorithm is computationally competitive with DFT based systems. Moreover, inherent 50% overlap between the adjacent frames used for MDCT/MDST domain reduces the blocking artifacts due to block processing or quantization. The techniques are computationally efficient for symmetric filters and provides a new alternative to DFT based convolution.

Coplanar gas-discharge display

1. The electric field strength between coplanar electrodes is calculated employing "conformal transformations." The electron multiplication factor is then computed in the nonuniform field region. These calculations have been made for different gap lengths, voltages, and also for different gases and gas pressures. The configuration results in a curved discharge path. It is found that the electron multiplication is maximum along a particular flux line and the prebreakdown discharge is expected to follow this flux line. Experimental tubes incorporating several coplanar gaps have been fabricated. Breakdown voltages have been measured for various discharge gaps and also for various gases such as xenon, helium, neon, argon, and neon-argon mixture (99.5:0.5) at different filling pressures. The variation of breakdown voltage with pressure and gap length is discussed. The observed discharge paths are curved and this is in agreement with theoretical results. A few experimental single-digit coplanar gas-discharge displays (CGDD's) with digit height of 5 cm have been fabricated and dependence of their characteristics on various parameters, including spacing between top glass plate and bottom substrate, have been studied.

Field evaluation of micropropagated and conventionally propagated ginger in subtropical Queensland

The growth and performance of micropropagated ginger (Zingiber officinale Roscoe) was compared with 'seed'-derived plants in field trials conducted in south-eastern Queensland. In the first generation ex vitro, micropropagated plants had significantly (P<0.01) reduced rhizome yield with smaller knobs and more roots. Micropropagated plants had a greater (P<0.01) shoot: root (rhizome) ratio compared with seed-derived plants. Shoots from micropropagated plants were also significantly (P<0.01) smaller with a greater number of shoots per plant. The unusual shoot morphology of the micropropagated plants did not appear to be related to the presence of benzylaminopurine, a plant growth hormone added to the multiplication medium, as plants subcultured for 3 cycles on a hormone-free medium also exhibited similar characteristics. Seed collected from the micropropagated plants and seed-derived plants was harvested and, despite the micropropagated seed being significantly (P<0.01) smaller, by the second generation ex vitro there were no significant differences between the treatments. Factors that can improve rhizome size, while reducing production costs, need to be identified before micropropagated plants can be recommended for routine use in the ginger industry as a source of disease and pest-free planting material.

In Vitro Conditions for a Successful Biolistics transformation System of Pineapples (ananas comosus merr.), in 'Contributing to a Sustainable Future'

In order to develop an efficient and reliable biolistics transformation system for pineapples parameters need to be optimised for growth, survival and development of explants pre- and post transformation. We have optimised in vitro conditions for culture media for the various stages of plant and callus initiation and development, and for effective selection of putative transgenic material. Shoot multiplication and proliferation is best on medium containing MS basic nutrients and vitamins with the addition of 0.1 mg/L myo-inositol, 20 g/L sucrose, 2.5 mg/L BAP and 3 g/L Phytagel, followed by transfer to basic MS medium for further development. Callus production on leaf base explants is best on MS nutrients and vitamins, to which 10 mg/L of BAP and NAA each was added. Optimum explant age for bombardment is 17-35 week old callus, while a pre-bombardment osmoticum treatment in the medium is not required. By comparing several antibiotics as selective agent, it has been established that a two-step selection of 2 fortnightly sub-cultures on 50 μg/mL of geneticin in the culture medium, followed by monthly sub-cultures on 100 μg/mL geneticin is optimal for survival of transgenic callus. Shoot regeneration from callus cultures is optimal on medium containing MS nutrients and vitamins, 5% coconut water and 400 mg/L casein hydrolysate. Plants can be readily regenerated and multiplied from transgenic callus through organogenesis. Rooting of shoots does not require any additional plant hormones to the medium. A transformation efficiency of 1 – 3.5% can be achieved, depending on the gene construct applied.