ICT driven pedagogies and its impact on learning outcomes in high school mathematics

ICT (Information and Communication Technology) creates numerous opportunities for teachers to re-think their pedagogies. In subjects like mathematics which draws upon abstract concepts, ICT creates such an opportunity. Instead of a mimetic pedagogical approach, suitably designed activities with ICT can enable learners to engage more proactively with their learning. In this quasi-experimental designed study, ICT was used in teaching mathematics to a group of first year high school students (N=25) in Australia. The control group was taught predominantly through traditional pedagogies (N=22). Most of the variables that had previously impacted on the design of such studies were suitably controlled in this yearlong investigation. Quantitative and qualitative results showed that students who were taught by ICT driven pedagogies benefitted from the experience. Pre and post-test means showed that there was a difference between the treatment and control groups. Of greater significance was that the students (in the treatment group) believed that the technology enabled them to engage more with their learning.

Application-level simulation for network security

NeSSi (network security simulator) is a novel network simulation tool which incorporates a variety of features relevant to network security distinguishing it from general-purpose network simulators. Its capabilities such as profile-based automated attack generation, traffic analysis and support for detection algorithm plug-ins allow it to be used for security research and evaluation purposes. NeSSi has been successfully used for testing intrusion detection algorithms, conducting network security analysis and developing overlay security frameworks. NeSSi is built upon the agent framework JIAC, resulting in a distributed and extensible architecture. In this paper, we provide an overview of the NeSSi architecture as well as its distinguishing features and briefly demonstrate its application to current security research projects.

Teamworking for security : the collaborative approach

Collaborative methods are promising tools for solving complex security tasks. In this context, the authors present the security overlay framework CIMD (Collaborative Intrusion and Malware Detection), enabling participants to state objectives and interests for joint intrusion detection and find groups for the exchange of security-related data such as monitoring or detection results accordingly; to these groups the authors refer as detection groups. First, the authors present and discuss a tree-oriented taxonomy for the representation of nodes within the collaboration model. Second, they introduce and evaluate an algorithm for the formation of detection groups. After conducting a vulnerability analysis of the system, the authors demonstrate the validity of CIMD by examining two different scenarios inspired sociology where the collaboration is advantageous compared to the non-collaborative approach. They evaluate the benefit of CIMD by simulation in a novel packet-level simulation environment called NeSSi (Network Security Simulator) and give a probabilistic analysis for the scenarios.

Combinatorial design of key distribution mechanisms for wireless sensor networks

Key distribution is one of the most challenging security issues in wireless sensor networks where sensor nodes are randomly scattered over a hostile territory. In such a sensor deployment scenario, there will be no prior knowledge of post deployment configuration. For security solutions requiring pairwise keys, it is impossible to decide how to distribute key pairs to sensor nodes before the deployment. Existing approaches to this problem are to assign more than one key, namely a key-chain, to each node. Key-chains are randomly drawn from a key-pool. Either two neighboring nodes have a key in common in their key-chains, or there is a path, called key-path, among these two nodes where each pair of neighboring nodes on this path has a key in common. Problem in such a solution is to decide on the key-chain size and key-pool size so that every pair of nodes can establish a session key directly or through a path with high probability. The size of the key-path is the key factor for the efficiency of the design. This paper presents novel, deterministic and hybrid approaches based on Combinatorial Design for key distribution. In particular, several block design techniques are considered for generating the key-chains and the key-pools.

Nutrient removal from wastewaters using high performance materials

Return side streams from anaerobic digesters and dewatering facilities at wastewater treatment plants (WWTPs) contribute a significant proportion of the total nitrogen load on a mainstream process. Similarly, significant phosphate loads are also recirculated in biological nutrient removal (BNR) wastewater treatment plants. Ion exchange using a new material, known by the name MesoLite, shows strong potential for the removal of ammonia from these side streams and an opportunity to concurrently reduce phosphate levels. A pilot plant was designed and operated for several months on an ammonia rich centrate from a dewatering centrifuge at the Oxley Creek WWTP, Brisbane, Australia. The system operated with a detention time in the order of one hour and was operated for between 12 and 24 hours prior to regeneration with a sodium rich solution. The same pilot plant was used to demonstrate removal of phosphate from an abattoir wastewater stream at similar flow rates. Using MesoLite materials, >90% reduction of ammonia was achieved in the centrate side stream. A full-scale process would reduce the total nitrogen load at the Oxley Creek WWTP by at least 18%. This reduction in nitrogen load consequently improves the TKN/COD ratio of the influent and enhances the nitrogen removal performance of the biological nutrient removal process.

High-resolution imaging of ordered mixed-layer clays

HRTEM has been used to examine illite/smectite from the Mancos shale, rectorite from Garland County, Arkansas; illite from Silver Hill, Montana; Na-smectite from Crook County, Wyoming; corrensite from Packwood, Washington; and diagenetic chlorite from the Tuscaloosa formation. Thin specimens were prepared by ion milling, ultra-microtome sectioning and/or grain dispersal on a porous carbon substrate. Some smectite-bearing clays were also examined after intercalation with dodecylamine hydrochloride (DH). Intercalation of smectite with DH proved to be a reliable method of HRTEM imaging of expanded smectite, d(001) 16 A which could then be distinguished from unexpanded illite, d(001) 10 A. Lattice fringes of basal spacings of DH-intercalated rectorite and illite/smectite showed 26 A periodicity. These data support XRD studies which suggest that these samples are ordered, interstratified varieties of illite and smectite. The ion-thinned, unexpanded corrensite sample showed discrete crystallites containing 10 A and 14 A basal spacings corresponding with collapsed smectite and chlorite, respectively. Regions containing disordered layers of chlorite and smectite were also noted. Crystallites containing regular alternations of smectite and chlorite were not common. These HRTEM observations of corrensite did not corroborate XRD data. Particle sizes parallel to the c axis ranged widely for each sample studied, and many particles showed basal dimensions equivalent to > five layers. -J.M.H.

Human rights, the law, cyber-security and democracy : after the European Convention

Many commentators have treated the internet as a site of democratic freedom and as a new kind of public sphere. While there are good reasons for optimism, like any social space digital space also has its dark side. Citizens and governments alike have expressed anxiety about cybercrime and cyber-security. In August 2011, the Australian government introduced legislation to give effect to Australia becoming a signatory to the European Convention on Cybercrime (2001). At the time of writing, that legislation is still before the Parliament. In this article, attention is given to how the legal and policy-making process enabling Australia to be compliant with the European Convention on Cybercrime came about. Among the motivations that informed both the development of the Convention in Europe and then the Australian exercise of legislating for compliance with it was a range of legitimate concerns about the impact that cybercrime can have on individuals and communities. This article makes the case that equal attention also needs to be given to ensuring that legislators and policy makers differentiate between legitimate security imperatives and any over-reach evident in the implementation of this legislation that affects rule of law principles, our capacity to engage in democratic practices, and our civic and human rights.

High resolution imaging of boron carbide microstructures

Two samples of boron carbide have been examined using high resolution transmission electron microscopy (HRTEM). A hot pressed B13C2 sample shows a high density of variable width twins normal to (10-11). Subtle shifts or offsets of lattice fringes along the twin plane and normal to (10 5) were also observed. A B4C powder showed little evidence of stacking disorder in crystalline regions.

High strong order explicit Runge-Kutta methods for stochastic ordinary differential equations

The pioneering work of Runge and Kutta a hundred years ago has ultimately led to suites of sophisticated numerical methods suitable for solving complex systems of deterministic ordinary differential equations. However, in many modelling situations, the appropriate representation is a stochastic differential equation and here numerical methods are much less sophisticated. In this paper a very general class of stochastic Runge-Kutta methods is presented and much more efficient classes of explicit methods than previous extant methods are constructed. In particular, a method of strong order 2 with a deterministic component based on the classical Runge-Kutta method is constructed and some numerical results are presented to demonstrate the efficacy of this approach.

Towards a secure human-and-computer mutual authentication protocol

We blend research from human-computer interface (HCI) design with computational based crypto- graphic provable security. We explore the notion of practice-oriented provable security (POPS), moving the focus to a higher level of abstraction (POPS+) for use in providing provable security for security ceremonies involving humans. In doing so we high- light some challenges and paradigm shifts required to achieve meaningful provable security for a protocol which includes a human. We move the focus of security ceremonies from being protocols in their context of use, to the protocols being cryptographic building blocks in a higher level protocol (the security cere- mony), which POPS can be applied to. In order to illustrate the need for our approach, we analyse both a protocol proven secure in theory, and a similar proto- col implemented by a �nancial institution, from both HCI and cryptographic perspectives.

High strong order methods for non-commutative stochastic ordinary differential equation systems and the Magnus formula

In recent years considerable attention has been paid to the numerical solution of stochastic ordinary differential equations (SODEs), as SODEs are often more appropriate than their deterministic counterparts in many modelling situations. However, unlike the deterministic case numerical methods for SODEs are considerably less sophisticated due to the difficulty in representing the (possibly large number of) random variable approximations to the stochastic integrals. Although Burrage and Burrage [High strong order explicit Runge-Kutta methods for stochastic ordinary differential equations, Applied Numerical Mathematics 22 (1996) 81-101] were able to construct strong local order 1.5 stochastic Runge-Kutta methods for certain cases, it is known that all extant stochastic Runge-Kutta methods suffer an order reduction down to strong order 0.5 if there is non-commutativity between the functions associated with the multiple Wiener processes. This order reduction down to that of the Euler-Maruyama method imposes severe difficulties in obtaining meaningful solutions in a reasonable time frame and this paper attempts to circumvent these difficulties by some new techniques. An additional difficulty in solving SODEs arises even in the Linear case since it is not possible to write the solution analytically in terms of matrix exponentials unless there is a commutativity property between the functions associated with the multiple Wiener processes. Thus in this present paper first the work of Magnus [On the exponential solution of differential equations for a linear operator, Communications on Pure and Applied Mathematics 7 (1954) 649-673] (applied to deterministic non-commutative Linear problems) will be applied to non-commutative linear SODEs and methods of strong order 1.5 for arbitrary, linear, non-commutative SODE systems will be constructed - hence giving an accurate approximation to the general linear problem. Secondly, for general nonlinear non-commutative systems with an arbitrary number (d) of Wiener processes it is shown that strong local order I Runge-Kutta methods with d + 1 stages can be constructed by evaluated a set of Lie brackets as well as the standard function evaluations. A method is then constructed which can be efficiently implemented in a parallel environment for this arbitrary number of Wiener processes. Finally some numerical results are presented which illustrate the efficacy of these approaches. (C) 1999 Elsevier Science B.V. All rights reserved.

Enhancing security of linux-based android devices

Our daily lives become more and more dependent upon smartphones due to their increased capabilities. Smartphones are used in various ways from payment systems to assisting the lives of elderly or disabled people. Security threats for these devices become increasingly dangerous since there is still a lack of proper security tools for protection. Android emerges as an open smartphone platform which allows modification even on operating system level. Therefore, third-party developers have the opportunity to develop kernel-based low-level security tools which is not normal for smartphone platforms. Android quickly gained its popularity among smartphone developers and even beyond since it bases on Java on top of "open" Linux in comparison to former proprietary platforms which have very restrictive SDKs and corresponding APIs. Symbian OS for example, holding the greatest market share among all smartphone OSs, was closing critical APIs to common developers and introduced application certification. This was done since this OS was the main target for smartphone malwares in the past. In fact, more than 290 malwares designed for Symbian OS appeared from July 2004 to July 2008. Android, in turn, promises to be completely open source. Together with the Linux-based smartphone OS OpenMoko, open smartphone platforms may attract malware writers for creating malicious applications endangering the critical smartphone applications and owners� privacy. In this work, we present our current results in analyzing the security of Android smartphones with a focus on its Linux side. Our results are not limited to Android, they are also applicable to Linux-based smartphones such as OpenMoko Neo FreeRunner. Our contribution in this work is three-fold. First, we analyze android framework and the Linux-kernel to check security functionalities. We survey wellaccepted security mechanisms and tools which can increase device security. We provide descriptions on how to adopt these security tools on Android kernel, and provide their overhead analysis in terms of resource usage. As open smartphones are released and may increase their market share similar to Symbian, they may attract attention of malware writers. Therefore, our second contribution focuses on malware detection techniques at the kernel level. We test applicability of existing signature and intrusion detection methods in Android environment. We focus on monitoring events on the kernel; that is, identifying critical kernel, log file, file system and network activity events, and devising efficient mechanisms to monitor them in a resource limited environment. Our third contribution involves initial results of our malware detection mechanism basing on static function call analysis. We identified approximately 105 Executable and Linking Format (ELF) executables installed to the Linux side of Android. We perform a statistical analysis on the function calls used by these applications. The results of the analysis can be compared to newly installed applications for detecting significant differences. Additionally, certain function calls indicate malicious activity. Therefore, we present a simple decision tree for deciding the suspiciousness of the corresponding application. Our results present a first step towards detecting malicious applications on Android-based devices.

Design and modeling of collaboration architecture for security

Threats against computer networks evolve very fast and require more and more complex measures. We argue that teams respectively groups with a common purpose for intrusion detection and prevention improve the measures against rapid propagating attacks similar to the concept of teams solving complex tasks known from field of work sociology. Collaboration in this sense is not easy task especially for heterarchical environments. We propose CIMD (collaborative intrusion and malware detection) as a security overlay framework to enable cooperative intrusion detection approaches. Objectives and associated interests are used to create detection groups for exchange of security-related data. In this work, we contribute a tree-oriented data model for device representation in the scope of security. We introduce an algorithm for the formation of detection groups, show realization strategies for the system and conduct vulnerability analysis. We evaluate the benefit of CIMD by simulation and probabilistic analysis.

Mechanism of dehydroxylation temperature decrease and high temperature phase transition of coal-bearing strata kaolinite intercalated by potassium acetate

The thermal decomposition and dehydroxylation process of coal-bearing strata kaolinite–potassium acetate intercalation complex (CSKK) has been studied using X-ray diffraction (XRD), infrared spectroscopy (IR), thermal analysis, mass spectrometric analysis and infrared emission spectroscopy. The XRD results showed that the potassium acetate (KAc) have been successfully intercalated into coal-bearing strata kaolinite with an obvious basal distance increase of the first basal peak, and the positive correlation was found between the concentration of intercalation regent KAc and the degree of intercalation. As the temperature of the system is raised, the formation of KHCO3, KCO3 and KAlSiO4, which is derived from the thermal decomposition or phase transition of CSKK, is observed in sequence. The IR results showed that new bands appeared, the position and intensities shift can also be found when the concentration of intercalation agent is raised. The thermal analysis and mass spectrometric analysis results revealed that CSKK is stable below 300 °C, and the thermal decomposition products (H2O and CO2) were further proved by the mass spectrometric analysis. A comparison of thermal analysis results of original coal-bearing strata kaolinite and its intercalation complex gives new discovery that not only a new mass loss peak is observed at 285 °C, but also the temperature of dehydroxylation and dehydration of coal bearing strata kaolinite is decreased about 100 °C. This is explained on the basis of the interlayer space of the kaolinite increased obviously after being intercalated by KAc, which led to the interlayer hydrogen bonds weakened, enables the dehydroxylation from kaolinite surface more easily. Furthermore, the possible structural model for CSKK has been proposed, with further analysis required in order to prove the most possible structures.