AITPM national newsletter president's report April 2010

Well, it has been Clem 7 month here in Brisbane and my impression is “so far, so good!” For those of you who know Brisbane, the four lane twin Clem Jones Tunnel (M7) is approximately 4.5km long, and connects Ipswich Road (A7) at the Princess Alexandra Hospital on the south side with Bowen Bridge Road (A3) at the Royal Brisbane Hospital on the north side. There are also south access ramps to the Pacific Motorway and east access ramps to Shafston Avenue (headed to/from Wynnum). Brisbanites have been enjoying a three week no-toll taste test, and I paced through it one evening with minimal fuss. The tunnel seems to have eased the congestion at the Stanley Street on-ramp to the Pacific Motorway quite a bit, and Ipswich Road – Main Street through the ‘Gabba. One must watch the signage carefully, but once we get used to the infrastructure, this will not likely be problematic. It will be interesting to see how traffic behaves when the system settles after tolling, which has likely commenced by the time you’re reading. I believe a passenger car toll is about $4.20 one way but saves about 24 signalised intersection pass-throughs.

Formation of one-dimensional capped ZnO nanoparticle assemblies at the air/water interface

The self-assembling behavior and microscopic structure of zinc oxide nanoparticle Langmuir-Blodgett monolayer films were investigated for the case of zinc oxide nanoparticles coated with a hydrophobic layer of dodecanethiol. Evolution of nanoparticle film structure as a function of surface pressure (π) at the air-water interface was monitored in situ using Brewster’s angle microscopy, where it was determined that π=16 mN/m produced near-defect-free monolayer films. Transmission electron micrographs of drop-cast and Langmuir-Schaefer deposited films of the dodecanethiol-coated zinc oxide nanoparticles revealed that the nanoparticle preparation method yielded a microscopic structure that consisted of one-dimensional rodlike assemblies of nanoparticles with typical dimensions of 25 x 400 nm, encased in the organic dodecanethiol layer. These nanoparticle-containing rodlike micelles were aligned into ordered arrangements of parallel rods using the Langmuir-Blodgett technique.

TaNF-YC11, one of the light-upregulated NF-YC members in Triticum aestivum, is co-regulated with photosynthesis-related genes

NF-Y is a heterotrimeric transcription factor complex. Each of the NF-Y subunits (NF-YA, NF-YB and NF-YC) in plants is encoded by multiple genes. Quantitative RT-PCR analysis revealed that five wheat NF-YC members (TaNF-YC5, 8, 9, 11 & 12) were upregulated by light in both the leaf and seedling shoot. Co-expression analysis of Affymetrix wheat genome array datasets revealed that transcript levels of a large number of genes were consistently correlated with those of the TaNF-YC11 and TaNF-YC8 genes in 3-4 separate Affymetrix array datasets. TaNF-YC11-correlated transcripts were significantly enriched with the Gene Ontology term photosynthesis. Sequence analysis in the promoters of TaNF-YC11-correlated genes revealed the presence of putative NF-Y complex binding sites (CCAAT motifs). Quantitative RT-PCR analysis of a subset of potential TaNF-YC11 target genes showed that ten out of the thirteen genes were also light-upregulated in both the leaf and seedling shoot and had significantly correlated expression profiles with TaNF-YC11. The potential target genes for TaNF-YC11 include subunit members from all four thylakoid membrane bound complexes required for the conversion of solar energy into chemical energy and rate limiting enzymes in the Calvin cycle. These data indicate that TaNF-YC11 is potentially involved in regulation of photosynthesis-related genes.

Security analysis and enhancement of one-way hash based low-cost authentication protocol (OHLCAP)

Choi et al. recently proposed an efficient RFID authentication protocol for a ubiquitous computing environment, OHLCAP(One-Way Hash based Low-Cost Authentication Protocol). However, this paper reveals that the protocol has several security weaknesses : 1) traceability based on the leakage of counter information, 2) vulnerability to an impersonation attack by maliciously updating a random number, and 3) traceability based on a physically-attacked tag. Finally, a security enhanced group-based authentication protocol is presented.

Numerical study of two ill-posed one-phase Stefan problems

We treat two related moving boundary problems. The first is the ill-posed Stefan problem for melting a superheated solid in one Cartesian coordinate. Mathematically, this is the same problem as that for freezing a supercooled liquid, with applications to crystal growth. By applying a front-fixing technique with finite differences, we reproduce existing numerical results in the literature, concentrating on solutions that break down in finite time. This sort of finite-time blow-up is characterised by the speed of the moving boundary becoming unbounded in the blow-up limit. The second problem, which is an extension of the first, is proposed to simulate aspects of a particular two-phase Stefan problem with surface tension. We study this novel moving boundary problem numerically, and provide results that support the hypothesis that it exhibits a similar type of finite-time blow-up as the more complicated two-phase problem. The results are unusual in the sense that it appears the addition of surface tension transforms a well-posed problem into an ill-posed one.

Outcomes and implications of one teacher's approach to context-based science in the middle years

In Australia, there is a crisis in science education with students becoming disengaged with canonical science in the middle years of schooling. One recent initiative that aims to improve student interest and motivation without diminishing conceptual understanding is the context-based approach. Contextual units that connect the canonical science with the students’ real world of their local community have been used in the senior years but are new in the middle years. This ethnographic study explored the learning transactions that occurred in one 9th grade science class studying a context-based Environmental Science unit for 11 weeks. Outcomes of the study and implications are discussed in this paper.

Shifting : one-inclusion mistake bounds and sample compression

We present new expected risk bounds for binary and multiclass prediction, and resolve several recent conjectures on sample compressibility due to Kuzmin and Warmuth. By exploiting the combinatorial structure of concept class F, Haussler et al. achieved a VC(F)/n bound for the natural one-inclusion prediction strategy. The key step in their proof is a d = VC(F) bound on the graph density of a subgraph of the hypercube—oneinclusion graph. The first main result of this paper is a density bound of n [n−1 <=d-1]/[n <=d] < d, which positively resolves a conjecture of Kuzmin and Warmuth relating to their unlabeled Peeling compression scheme and also leads to an improved one-inclusion mistake bound. The proof uses a new form of VC-invariant shifting and a group-theoretic symmetrization. Our second main result is an algebraic topological property of maximum classes of VC-dimension d as being d contractible simplicial complexes, extending the well-known characterization that d = 1 maximum classes are trees. We negatively resolve a minimum degree conjecture of Kuzmin and Warmuth—the second part to a conjectured proof of correctness for Peeling—that every class has one-inclusion minimum degree at most its VCdimension. Our final main result is a k-class analogue of the d/n mistake bound, replacing the VC-dimension by the Pollard pseudo-dimension and the one-inclusion strategy by its natural hypergraph generalization. This result improves on known PAC-based expected risk bounds by a factor of O(logn) and is shown to be optimal up to an O(logk) factor. The combinatorial technique of shifting takes a central role in understanding the one-inclusion (hyper)graph and is a running theme throughout.

Corrigendum to “Shifting : one-inclusion mistake bounds and sample compression” [J. Comput. System Sci. 75 (1) (2009) 37–59]

H. Simon and B. Szörényi have found an error in the proof of Theorem 52 of “Shifting: One-inclusion mistake bounds and sample compression”, Rubinstein et al. (2009). In this note we provide a corrected proof of a slightly weakened version of this theorem. Our new bound on the density of one-inclusion hypergraphs is again in terms of the capacity of the multilabel concept class. Simon and Szörényi have recently proved an alternate result in Simon and Szörényi (2009).

Shifting : one-inclusion mistake bounds and sample compression

We present new expected risk bounds for binary and multiclass prediction, and resolve several recent conjectures on sample compressibility due to Kuzmin and Warmuth. By exploiting the combinatorial structure of concept class F, Haussler et al. achieved a VC(F)/n bound for the natural one-inclusion prediction strategy. The key step in their proof is a d=VC(F) bound on the graph density of a subgraph of the hypercube—one-inclusion graph. The first main result of this report is a density bound of n∙choose(n-1,≤d-1)/choose(n,≤d) < d, which positively resolves a conjecture of Kuzmin and Warmuth relating to their unlabeled Peeling compression scheme and also leads to an improved one-inclusion mistake bound. The proof uses a new form of VC-invariant shifting and a group-theoretic symmetrization. Our second main result is an algebraic topological property of maximum classes of VC-dimension d as being d-contractible simplicial complexes, extending the well-known characterization that d=1 maximum classes are trees. We negatively resolve a minimum degree conjecture of Kuzmin and Warmuth—the second part to a conjectured proof of correctness for Peeling—that every class has one-inclusion minimum degree at most its VC-dimension. Our final main result is a k-class analogue of the d/n mistake bound, replacing the VC-dimension by the Pollard pseudo-dimension and the one-inclusion strategy by its natural hypergraph generalization. This result improves on known PAC-based expected risk bounds by a factor of O(log n) and is shown to be optimal up to a O(log k) factor. The combinatorial technique of shifting takes a central role in understanding the one-inclusion (hyper)graph and is a running theme throughout