Higher Order Thinking through ICT: What do middle years teachers think really matters?

The middle years of schooling has emerged as an important focus in Australian education. Student disengagement and alienation, the negative effects of non-completion of the senior years of schooling and underachievement have raised concerns about the quality of education during the middle years. For many schools, reshaping the middle years has involved incorporating Information and Communication Technologies (ICT) to motivate students. However, simultaneously there is a need to ensure that programs are academically rigorous. There is little doubt that there are potential benefits to integrating ICT into programs for middle years’ students. However, little is known about how middle years’ teachers perceive higher order thinking, which is a component of academic rigour. This paper investigates the question of What are teachers’ perceptions of higher order thinking in an ICT environment? The study is underpinned by socio-cultural theory which is based on the belief that learning occurs through social interaction and that individuals are shaped by the social and cultural tools and instruments they engage with. This investigation used a collective case study design. Two methods were used for data collection. These methods are semi-structured interviews with individual teachers and a class and a focus group discussion with teachers. Findings indicate that teachers hold various perceptions of higher order thinking that lead to productive approaches to integrating ICT in middle years’ classrooms. The paper highlights that there may be a continuum of perceptions of higher order thinking with ICT. This continuum may inform professional developers who are guiding and supporting teachers to integrate ICT into middle years’ classrooms.

Robust image hash functions using higher order spectra

Robust hashing is an emerging field that can be used to hash certain data types in applications unsuitable for traditional cryptographic hashing methods. Traditional hashing functions have been used extensively for data/message integrity, data/message authentication, efficient file identification and password verification. These applications are possible because the hashing process is compressive, allowing for efficient comparisons in the hash domain but non-invertible meaning hashes can be used without revealing the original data. These techniques were developed with deterministic (non-changing) inputs such as files and passwords. For such data types a 1-bit or one character change can be significant, as a result the hashing process is sensitive to any change in the input. Unfortunately, there are certain applications where input data are not perfectly deterministic and minor changes cannot be avoided. Digital images and biometric features are two types of data where such changes exist but do not alter the meaning or appearance of the input. For such data types cryptographic hash functions cannot be usefully applied. In light of this, robust hashing has been developed as an alternative to cryptographic hashing and is designed to be robust to minor changes in the input. Although similar in name, robust hashing is fundamentally different from cryptographic hashing. Current robust hashing techniques are not based on cryptographic methods, but instead on pattern recognition techniques. Modern robust hashing algorithms consist of feature extraction followed by a randomization stage that introduces non-invertibility and compression, followed by quantization and binary encoding to produce a binary hash output. In order to preserve robustness of the extracted features, most randomization methods are linear and this is detrimental to the security aspects required of hash functions. Furthermore, the quantization and encoding stages used to binarize real-valued features requires the learning of appropriate quantization thresholds. How these thresholds are learnt has an important effect on hashing accuracy and the mere presence of such thresholds are a source of information leakage that can reduce hashing security. This dissertation outlines a systematic investigation of the quantization and encoding stages of robust hash functions. While existing literature has focused on the importance of quantization scheme, this research is the first to emphasise the importance of the quantizer training on both hashing accuracy and hashing security. The quantizer training process is presented in a statistical framework which allows a theoretical analysis of the effects of quantizer training on hashing performance. This is experimentally verified using a number of baseline robust image hashing algorithms over a large database of real world images. This dissertation also proposes a new randomization method for robust image hashing based on Higher Order Spectra (HOS) and Radon projections. The method is non-linear and this is an essential requirement for non-invertibility. The method is also designed to produce features more suited for quantization and encoding. The system can operate without the need for quantizer training, is more easily encoded and displays improved hashing performance when compared to existing robust image hashing algorithms. The dissertation also shows how the HOS method can be adapted to work with biometric features obtained from 2D and 3D face images.

Nonlinear analysis for the pre- and post-yield behaviour of a hybrid structure by a higher-order element with the refined plastic hinge approach

Efficient and accurate geometric and material nonlinear analysis of the structures under ultimate loads is a backbone to the success of integrated analysis and design, performance-based design approach and progressive collapse analysis. This paper presents the advanced computational technique of a higher-order element formulation with the refined plastic hinge approach which can evaluate the concrete and steel-concrete structure prone to the nonlinear material effects (i.e. gradual yielding, full plasticity, strain-hardening effect when subjected to the interaction between axial and bending actions, and load redistribution) as well as the nonlinear geometric effects (i.e. second-order P-d effect and P-D effect, its associate strength and stiffness degradation). Further, this paper also presents the cross-section analysis useful to formulate the refined plastic hinge approach.

Speaker identification using higher order spectral phase features and their effectiveness vis-a-vis Mel-Cepstral features

The effectiveness of higher-order spectral (HOS) phase features in speaker recognition is investigated by comparison with Mel Cepstral features on the same speech data. HOS phase features retain phase information from the Fourier spectrum unlikeMel–frequency Cepstral coefficients (MFCC). Gaussian mixture models are constructed from Mel– Cepstral features and HOS features, respectively, for the same data from various speakers in the Switchboard telephone Speech Corpus. Feature clusters, model parameters and classification performance are analyzed. HOS phase features on their own provide a correct identification rate of about 97% on the chosen subset of the corpus. This is the same level of accuracy as provided by MFCCs. Cluster plots and model parameters are compared to show that HOS phase features can provide complementary information to better discriminate between speakers.

Biometric template security using higher order spectra

A method of improving the security of biometric templates which satisfies desirable properties such as (a) irreversibility of the template, (b) revocability and assignment of a new template to the same biometric input, (c) matching in the secure transformed domain is presented. It makes use of an iterative procedure based on the bispectrum that serves as an irreversible transformation for biometric features because signal phase is discarded each iteration. Unlike the usual hash function, this transformation preserves closeness in the transformed domain for similar biometric inputs. A number of such templates can be generated from the same input. These properties are illustrated using synthetic data and applied to images from the FRGC 3D database with Gabor features. Verification can be successfully performed using these secure templates with an EER of 5.85%

Cardiac state diagnosis using higher order spectra of heart rate variability

Heart rate variability (HRV) refers to the regulation of the sinoatrial node, the natural pacemaker of the heart, by the sympathetic and parasympathetic branches of the autonomic nervous system. Heart rate variability analysis is an important tool to observe the heart's ability to respond to normal regulatory impulses that affect its rhythm. A computer-based intelligent system for analysis of cardiac states is very useful in diagnostics and disease management. Like many bio-signals, HRV signals are nonlinear in nature. Higher order spectral analysis (HOS) is known to be a good tool for the analysis of nonlinear systems and provides good noise immunity. In this work, we studied the HOS of the HRV signals of normal heartbeat and seven classes of arrhythmia. We present some general characteristics for each of these classes of HRV signals in the bispectrum and bicoherence plots. We also extracted features from the HOS and performed an analysis of variance (ANOVA) test. The results are very promising for cardiac arrhythmia classification with a number of features yielding a p-value < 0.02 in the ANOVA test.

Peripheral higher order aberrations in emmetropes and myopes

Purpose: Poor image quality in the peripheral field may lead to myopia. Most studies measuring the higher order aberrations in the periphery have been restricted to the horizontal visual field. The purpose of this study was to measure higher order monochromatic aberrations across the central 42º horizontal x 32º vertical visual fields in myopes and emmetropes. ---------- Methods: We recruited 5 young emmetropes with spherical equivalent refractions +0.17 ± 0.45D and 5 young myopes with spherical equivalent refractions -3.9 ± 2.09D. Measurements were taken with a modified COAS-HD Hartmann-Shack aberrometer (Wavefront Sciences Inc). Measurements were taken while the subjects looked at 38 points arranged in a 7 x 6 matrix (excluding four corner points) through a beam splitter held between the instrument and the eye. A combination of the instrument’s software and our own software was used to estimate OSA Zernike coefficients for 5mm pupil diameter at 555nm for each point. The software took into account the elliptical shape of the off-axis pupil. Nasal and superior fields were taken to have positive x and y signs, respectively. ---------- Results: The total higher order RMS (HORMS) was similar on-axis for emmetropes (0.16 ± 0.02 μm) and myopes (0.17 ± 0.02 μm). There was no common pattern for HORMS for emmetropes across the visual field where as 4 out of 5 myopes showed a linear increase in HORMS in all directions away from the minimum. For all subjects, vertical and horizontal comas showed linear changes across the visual field. The mean rate of change of vertical coma across the vertical meridian was significantly lower (p = 0.008) for emmetropes (-0.005 ± 0.002 μm/deg) than for myopes (-0.013 ± 0.004 μm/deg). The mean rate of change of horizontal coma across the horizontal meridian was lower (p = 0.07) for emmetropes (-0.006 ± 0.003 μm/deg) than myopes (-0.011 ± 0.004 μm/deg). ---------- Conclusion: We have found differences in patterns of higher order aberrations across the visual fields of emmetropes and myopes, with myopes showing the greater rates of change of horizontal and vertical coma.

Robust image hashing using higher order spectral features

Robust image hashing seeks to transform a given input image into a shorter hashed version using a key-dependent non-invertible transform. These image hashes can be used for watermarking, image integrity authentication or image indexing for fast retrieval. This paper introduces a new method of generating image hashes based on extracting Higher Order Spectral features from the Radon projection of an input image. The feature extraction process is non-invertible, non-linear and different hashes can be produced from the same image through the use of random permutations of the input. We show that the transform is robust to typical image transformations such as JPEG compression, noise, scaling, rotation, smoothing and cropping. We evaluate our system using a verification-style framework based on calculating false match, false non-match likelihoods using the publicly available Uncompressed Colour Image database (UCID) of 1320 images. We also compare our results to Swaminathan’s Fourier-Mellin based hashing method with at least 1% EER improvement under noise, scaling and sharpening.