Sessional Academic Success : A distributed framework for academic support and development

With approximately half of Australian university teaching now performed by sessional academics, there has been growing recognition of the contribution they make to student learning. At the same time, sector-wide research and institutional audits continue to raise concerns about academic development, quality assurance, recognition and belonging. In response, universities have increasingly begun to offer academic development programs for sessional academics. However, such programs may be centrally delivered, generic in nature, and contained within the moment of delivery, while the Faculty contexts and cultures that sessional academics work within are diverse, and the need for support unfolds in ad-hoc and often unpredictable ways. In this paper we present the Sessional Academic Success (SAS) program–a new framework that complements and extends the central academic development program for sessional academic staff at Queensland University of Technology. This program recognises that experienced sessional academics have much to contribute to the advancement of learning and teaching, and harnesses their expertise to provide school-based academic development opportunities, peer-to-peer support, and locally contextualized community building. We describe the program’s implementation and explain how Sessional Academic Success Advisors (SASAs) are employed, trained and supported to provide advice and mentorship and, through a co-design methodology, to develop local development opportunities and communities of teaching practice within their schools. Besides anticipated benefits to new sessional academics in terms of timely and contextual support and improved sense of belonging, we explain how SAS provides a pathway for building leadership capacity and academic advancement for experienced sessional academics. We take a collaborative, dialogic and reflective practice approach to this paper, interlacing insights from the Associate Director, Academic: Sessional Development who designed the program, and two Sessional Academic Success Advisors who have piloted it within their schools.

Distributed plasticity analysis of steel frame structures comprising non-compact sections

Application of 'advanced analysis' methods suitable for non-linear analysis and design of steel frame structures permits direct and accurate determination of ultimate system strengths, without resort to simplified elastic methods of analysis and semi-empirical specification equations. However, the application of advanced analysis methods has previously been restricted to steel frames comprising only compact sections that are not influenced by the effects of local buckling. A research project has been conducted with the aim of developing concentrated plasticity methods suitable for practical advanced analysis of steel frame structures comprising non-compact sections. A primary objective was to produce a comprehensive range of new distributed plasticity analytical benchmark solutions for verification of the concentrated plasticity methods. A distributed plasticity model was developed using shell finite elements to explicitly account for the effects of gradual yielding and spread of plasticity, initial geometric imperfections, residual stresses and local buckling deformations. The model was verified by comparison with large-scale steel frame test results and a variety of existing analytical benchmark solutions. This paper presents a description of the distributed plasticity model and details of the verification study.

Intrusion detection in distributed systems, an approach based on taint marking

This paper presents a new framework for distributed intrusion detection based on taint marking. Our system tracks information flows between applications of multiple hosts gathered in groups (i.e., sets of hosts sharing the same distributed information flow policy) by attaching taint labels to system objects such as files, sockets, Inter Process Communication (IPC) abstractions, and memory mappings. Labels are carried over the network by tainting network packets. A distributed information flow policy is defined for each group at the host level by labeling information and defining how users and applications can legally access, alter or transfer information towards other trusted or untrusted hosts. As opposed to existing approaches, where information is most often represented by two security levels (low/high, public/private, etc.), our model identifies each piece of information within a distributed system, and defines their legal interaction in a fine-grained manner. Hosts store and exchange security labels in a peer to peer fashion, and there is no central monitor. Our IDS is implemented in the Linux kernel as a Linux Security Module (LSM) and runs standard software on commodity hardware with no required modification. The only trusted code is our modified operating system kernel. We finally present a scenario of intrusion in a web service running on multiple hosts, and show how our distributed IDS is able to report security violations at each host level.

Building distributed leadership for effective supervision of creative practice higher research degrees : final report 2014

Building distributed leadership for effective supervision of creative practice higher research degrees is an Office for Learning and Teaching (OLT) funded project, conducted in partnership between Queensland University of Technology, The University of Melbourne, Auckland University of Technology, University of New South Wales and University of Western Sydney. The project was initiated to develop a cooperative approach to establishing an understanding of the contextual frameworks of the emergent field of creative practice higher degrees by research (HDRs); capturing early insights of administrators and supervisors; gathering exemplars of good practices; and establishing an in-common understanding of effective approaches to supervision. To this end, the project has produced: • A literature review, to provide a research foundation for creative practice higher research degree supervision (Chapter 3). • A contextual review of disciplinary frameworks for HDR programs, produced through surveys of postgraduate research administrators (Section 4.1), and an analysis of institutional materials and academic development programs for supervisors (Section 4.2). • A National Symposium, Effective Supervision of Creative Arts Research Degrees (ESCARD), at QUT in Brisbane in February 2013, with 62 delegates from 20 Australasian Universities, at which project findings were disseminated, and delegates presented case studies and position papers, and participated in discussions on key issues for supervisors (Appendix 1). • Resources, including a booklet for supervisors: 12 Principles for the Effective Supervision of Creative Practice Higher Research Degrees, which encapsulates attitudes, insights and good practices of experienced and new supervisors. It was produced through a content analysis of interviews with twenty-five supervisors in creative disciplines (visual and performing arts, music, new media, creative writing and design) (Printed booklet, PDF, Appendix 3). • A project website to disseminate project outcomes , which holds project findings, relevant references, and a repository of case studies and position papers by supervisors and program administrators. • A call for papers for a special issue ‘Supervising Practice: Perspectives on the Supervision of Creative Practice Research Higher Degrees’ of ACCESS Journal: Critical Perspectives on Communication, Cultural & Policy Studies (ERA ranked A quality) in 2014 (Appendix 2). • A community of supervisory practice initiated through project partnerships, a national symposium where supervisors from across Australasia met in dialogue for the first time, resource sharing, and joint publishing opportunities. • A set of recommendations for supervision capacity building and academic development, produced through the triangulation of literature and contextual reviews, analysis of institutional frameworks, interviews with supervisors and national dialogues. It is anticipated that the project’s outcomes will support experienced and new supervisors in this emergent field, and so benefit HDR students, and will enable creative disciplines to build supervision capacity, and so to accommodate growth in postgraduate enrolments. Funded as a pilot project, the project set out to establish a robust research base to provide a foundation for future work involving sharing good practices, resource building, and designing effective approaches to academic development for supervisors. Recommendations that were produced out of this project include the need to extend beyond generic, formal training for supervisors to academic development that harnesses and extends distributed leadership; focuses on local, disciplinary contexts; has a strong emphasis on case studies; provides diverse resources; and facilitates dialogue between supervisors. Recommendations also include developing frameworks for mentoring new supervisors and building a national network to facilitate cross-institutional discourse, disseminate good practices, and share insights into the management of risk factors, ethical issues, and preparing candidates for examination. As a pilot investigation, the outcomes of this project lay the ground for this future work.

Multi-criteria optimization of group replacement schedules for distributed water pipeline assets

This thesis presents a multi-criteria optimisation study of group replacement schedules for water pipelines, which is a capital-intensive and service critical decision. A new mathematical model was developed, which minimises total replacement costs while maintaining a satisfactory level of services. The research outcomes are expected to enrich the body of knowledge of multi-criteria decision optimisation, where group scheduling is required. The model has the potential to optimise replacement planning for other types of linear asset networks resulting in bottom-line benefits for end users and communities. The results of a real case study show that the new model can effectively reduced the total costs and service interruptions.

A reference station-based GNSS computing mode to support unified precise point positioning and real-time kinematic services

Currently, the GNSS computing modes are of two classes: network-based data processing and user receiver-based processing. A GNSS reference receiver station essentially contributes raw measurement data in either the RINEX file format or as real-time data streams in the RTCM format. Very little computation is carried out by the reference station. The existing network-based processing modes, regardless of whether they are executed in real-time or post-processed modes, are centralised or sequential. This paper describes a distributed GNSS computing framework that incorporates three GNSS modes: reference station-based, user receiver-based and network-based data processing. Raw data streams from each GNSS reference receiver station are processed in a distributed manner, i.e., either at the station itself or at a hosting data server/processor, to generate station-based solutions, or reference receiver-specific parameters. These may include precise receiver clock, zenith tropospheric delay, differential code biases, ambiguity parameters, ionospheric delays, as well as line-of-sight information such as azimuth and elevation angles. Covariance information for estimated parameters may also be optionally provided. In such a mode the nearby precise point positioning (PPP) or real-time kinematic (RTK) users can directly use the corrections from all or some of the stations for real-time precise positioning via a data server. At the user receiver, PPP and RTK techniques are unified under the same observation models, and the distinction is how the user receiver software deals with corrections from the reference station solutions and the ambiguity estimation in the observation equations. Numerical tests demonstrate good convergence behaviour for differential code bias and ambiguity estimates derived individually with single reference stations. With station-based solutions from three reference stations within distances of 22–103 km the user receiver positioning results, with various schemes, show an accuracy improvement of the proposed station-augmented PPP and ambiguity-fixed PPP solutions with respect to the standard float PPP solutions without station augmentation and ambiguity resolutions. Overall, the proposed reference station-based GNSS computing mode can support PPP and RTK positioning services as a simpler alternative to the existing network-based RTK or regionally augmented PPP systems.

A comparative study of the semi-elastic and fully-elastic MapReduce models

MapReduce is a computation model for processing large data sets in parallel on large clusters of machines, in a reliable, fault-tolerant manner. A MapReduce computation is broken down into a number of map tasks and reduce tasks, which are performed by so called mappers and reducers, respectively. The placement of the mappers and reducers on the machines directly affects the performance and cost of the MapReduce computation in cloud computing. From the computational point of view, the mappers/reducers placement problem is a generation of the classical bin packing problem, which is NP-complete. Thus, in this paper we propose a new heuristic algorithm for the mappers/reducers placement problem in cloud computing and evaluate it by comparing with other several heuristics on solution quality and computation time by solving a set of test problems with various characteristics. The computational results show that our heuristic algorithm is much more efficient than the other heuristics and it can obtain a better solution in a reasonable time. Furthermore, we verify the effectiveness of our heuristic algorithm by comparing the mapper/reducer placement for a benchmark problem generated by our heuristic algorithm with a conventional mapper/reducer placement which puts a fixed number of mapper/reducer on each machine. The comparison results show that the computation using our mapper/reducer placement is much cheaper than the computation using the conventional placement while still satisfying the computation deadline.

A distributed control based coordination scheme of household PV systems for overvoltage prevention

This paper presents a distributed communication based active power curtailment (APC) control scheme for grid connected photovoltaic (PV) systems to address voltage rise. A simple distribution feeder model is presented and simulated using MATLAB. The resource sharing based control scheme proposed is shown to be effective at reducing voltage rise during times of peak generation and low load. Simulations also show the even distribution of APC using simple communications. Simulations demonstrate the versatility of the proposed control method under major communication failure conditions. Further research may lead to possible applications in coordinated electric vehicle (EV) charging.

Primary control level of parallel distributed energy resources converters in system of multiple interconnected autonomous microgrids within self-healing networks

To minimise the number of load sheddings in a microgrid (MG) during autonomous operation, islanded neighbour MGs can be interconnected if they are on a self-healing network and an extra generation capacity is available in the distributed energy resources (DER) of one of the MGs. In this way, the total load in the system of interconnected MGs can be shared by all the DERs within those MGs. However, for this purpose, carefully designed self-healing and supply restoration control algorithm, protection systems and communication infrastructure are required at the network and MG levels. In this study, first, a hierarchical control structure is discussed for interconnecting the neighbour autonomous MGs where the introduced primary control level is the main focus of this study. Through the developed primary control level, this study demonstrates how the parallel DERs in the system of multiple interconnected autonomous MGs can properly share the load of the system. This controller is designed such that the converter-interfaced DERs operate in a voltage-controlled mode following a decentralised power sharing algorithm based on droop control. DER converters are controlled based on a per-phase technique instead of a conventional direct-quadratic transformation technique. In addition, linear quadratic regulator-based state feedback controllers, which are more stable than conventional proportional integrator controllers, are utilised to prevent instability and weak dynamic performances of the DERs when autonomous MGs are interconnected. The efficacy of the primary control level of the DERs in the system of multiple interconnected autonomous MGs is validated through the PSCAD/EMTDC simulations considering detailed dynamic models of DERs and converters.

A novel algorithm based on honey bee mating optimization for distribution harmonic state estimation including distributed generators

This paper presents a new algorithm based on honey-bee mating optimization (HBMO) to estimate harmonic state variables in distribution networks including distributed generators (DGs). The proposed algorithm performs estimation for both amplitude and phase of each harmonics by minimizing the error between the measured values from phasor measurement units (PMUs) and the values computed from the estimated parameters during the estimation process. Simulation results on two distribution test system are presented to demonstrate that the speed and accuracy of proposed distribution harmonic state estimation (DHSE) algorithm is extremely effective and efficient in comparison with the conventional algorithms such as weight least square (WLS), genetic algorithm (GA) and tabu search (TS).

Discussion of : constructing summary statistics for approximate Bayesian computation: semi-automatic approximate Bayesian computation

This is a discussion of the journal article: "Construcing summary statistics for approximate Bayesian computation: semi-automatic approximate Bayesian computation". The article and discussion have appeared in the Journal of the Royal Statistical Society: Series B (Statistical Methodology).

Optimal distributed generation placement in radial distribution systems

Distributed generation (DG) resources are commonly used in the electric systems to obtain minimum line losses, as one of the benefits of DG, in radial distribution systems. Studies have shown the importance of appropriate selection of location and size of DGs. This paper proposes an analytical method for solving optimal distributed generation placement (ODGP) problem to minimize line losses in radial distribution systems using loss sensitivity factor (LSF) based on bus-injection to branch-current (BIBC) matrix. The proposed method is formulated and tested on 12 and 34 bus radial distribution systems. The classical grid search algorithm based on successive load flows is employed to validate the results. The main advantages of the proposed method as compared with the other conventional methods are the robustness and no need to calculate and invert large admittance or Jacobian matrices. Therefore, the simulation time and the amount of computer memory, required for processing data especially for the large systems, decreases.

Approximate Bayesian computation using auxiliary model based estimates

We present a novel approach for developing summary statistics for use in approximate Bayesian computation (ABC) algorithms using indirect infer- ence. We embed this approach within a sequential Monte Carlo algorithm that is completely adaptive. This methodological development was motivated by an application involving data on macroparasite population evolution modelled with a trivariate Markov process. The main objective of the analysis is to compare inferences on the Markov process when considering two di®erent indirect mod- els. The two indirect models are based on a Beta-Binomial model and a three component mixture of Binomials, with the former providing a better ¯t to the observed data.

Quantum direct secret sharing with efficient eavesdropping-check and authentication based on distributed fountain codes

We propose to use a simple and effective way to achieve secure quantum direct secret sharing. The proposed scheme uses the properties of fountain codes to allow a realization of the physical conditions necessary for the implementation of no-cloning principle for eavesdropping-check and authentication. In our scheme, to achieve a variety of security purposes, nonorthogonal state particles are inserted in the transmitted sequence carrying the secret shares to disorder it. However, the positions of the inserted nonorthogonal state particles are not announced directly, but are obtained by sending degrees and positions of a sequence that are pre-shared between Alice and each Bob. Moreover, they can confirm that whether there exists an eavesdropper without exchanging classical messages. Most importantly, without knowing the positions of the inserted nonorthogonal state particles and the sequence constituted by the first particles from every EPR pair, the proposed scheme is shown to be secure.