A two-stage decision model for information filtering

Information mismatch and overload are two fundamental issues influencing the effectiveness of information filtering systems. Even though both term-based and pattern-based approaches have been proposed to address the issues, neither of these approaches alone can provide a satisfactory decision for determining the relevant information. This paper presents a novel two-stage decision model for solving the issues. The first stage is a novel rough analysis model to address the overload problem. The second stage is a pattern taxonomy mining model to address the mismatch problem. The experimental results on RCV1 and TREC filtering topics show that the proposed model significantly outperforms the state-of-the-art filtering systems.

Early childhood education

Young children are the most vulnerable and most at risk of environmental challenges, current and future. Yet, early learning around environment and sustainability issues and topics has been neglected and underrated in early childhood education even though there is an expanding body of research literature – from economics, neuroscience, sociology and health – that shows that early investments in human capital offer substantial returns for individuals and for communities and have a long reach into the future. Early childhood education for sustainability (ECEfS) - a synthesis of early childhood education (ECE) and education for sustainability (EfS) - builds on groundings in play, outdoor learning and nature education, but takes a stronger focus on learning about, and engagement with, environmental and sustainability issues. Child participation and agency is central to ECEfS and can relate, for example, to local environmental problem-solving such as water and energy conservation or waste reduction in a childcare centre, kindergarten or preschool, or young children’s social learning for Indigenous Reconciliation and cultural inclusivity. While the ECE field has been much slower than other educational sectors in taking up the challenges of sustainability, this situation is rapidly changing as early childhood practitioners begin to engage – it is fast moving from the margins of early childhood curriculum and pedagogic decision-making into the mainstream. This presents challenges, however, as ECEfS is somewhat misunderstood and misrepresented and, as a new field, is under-researched and under-theorised.

Enriching XML documents clustering by using concise structure and content

With the growing number of XML documents on theWeb it becomes essential to effectively organise these XML documents in order to retrieve useful information from them. A possible solution is to apply clustering on the XML documents to discover knowledge that promotes effective data management, information retrieval and query processing. However, many issues arise in discovering knowledge from these types of semi-structured documents due to their heterogeneity and structural irregularity. Most of the existing research on clustering techniques focuses only on one feature of the XML documents, this being either their structure or their content due to scalability and complexity problems. The knowledge gained in the form of clusters based on the structure or the content is not suitable for reallife datasets. It therefore becomes essential to include both the structure and content of XML documents in order to improve the accuracy and meaning of the clustering solution. However, the inclusion of both these kinds of information in the clustering process results in a huge overhead for the underlying clustering algorithm because of the high dimensionality of the data. The overall objective of this thesis is to address these issues by: (1) proposing methods to utilise frequent pattern mining techniques to reduce the dimension; (2) developing models to effectively combine the structure and content of XML documents; and (3) utilising the proposed models in clustering. This research first determines the structural similarity in the form of frequent subtrees and then uses these frequent subtrees to represent the constrained content of the XML documents in order to determine the content similarity. A clustering framework with two types of models, implicit and explicit, is developed. The implicit model uses a Vector Space Model (VSM) to combine the structure and the content information. The explicit model uses a higher order model, namely a 3- order Tensor Space Model (TSM), to explicitly combine the structure and the content information. This thesis also proposes a novel incremental technique to decompose largesized tensor models to utilise the decomposed solution for clustering the XML documents. The proposed framework and its components were extensively evaluated on several real-life datasets exhibiting extreme characteristics to understand the usefulness of the proposed framework in real-life situations. Additionally, this research evaluates the outcome of the clustering process on the collection selection problem in the information retrieval on the Wikipedia dataset. The experimental results demonstrate that the proposed frequent pattern mining and clustering methods outperform the related state-of-the-art approaches. In particular, the proposed framework of utilising frequent structures for constraining the content shows an improvement in accuracy over content-only and structure-only clustering results. The scalability evaluation experiments conducted on large scaled datasets clearly show the strengths of the proposed methods over state-of-the-art methods. In particular, this thesis work contributes to effectively combining the structure and the content of XML documents for clustering, in order to improve the accuracy of the clustering solution. In addition, it also contributes by addressing the research gaps in frequent pattern mining to generate efficient and concise frequent subtrees with various node relationships that could be used in clustering.

State of Origin : Queensland Crown Leasehold - lessons from New South Wales

Throughout Australia freehold land interests are protected by statutory schemes which grant indefeasibility of title to registered interests. Queensland freehold land interests are protected by Torrens system established by the Land Title Act 1994. However, no such protection exists for Crown land interests. The extent of Queensland occupied under some form of Crown tenure, in excess of 70%, means that Queensland Crown land users are disadvantaged when compared to freehold land users. This article examines the role indefeasibility of title has in protecting interests in Crown land. A comparative analysis is undertaken between Queensland and New South Wales land management frameworks to determine whether interests in crown land are adequately protected in Queensland.

Peer state assessment of TxDOT maintenance program and practices, part II : test section survey findings and recommendations

This paper presents a road survey as part of a workshop conducted by the Texas Department of Transportation (TxDOT) to evaluate and improve the maintenance practices of the Texas highway system. Directors of maintenance from six peer states (California, Kansas, Georgia, Missouri, North Carolina, and Washington) were invited to this 3-day workshop. One of the important parts of this workshop was a Maintenance Test Section Survey (MTSS) to evaluate a number of pre-selected one-mile roadway sections. The workshop schedule allowed half a day to conduct the field survey and 34 sections were evaluated. Each of the evaluators was given a booklet and asked to rate the selected road sections. The goals of the MTSS were to: 1. Assess the threshold level at which maintenance activities are required as perceived by the evaluators from the peer states; 2. Assess the threshold level at which maintenance activities are required as perceived by evaluators from other TxDOT districts; and 3. Perform a pilot evaluation of the MTSS concept. This paper summarizes the information obtained from survey and discusses the major findings based on a statistical analysis of the data and comments from the survey participants.

Peer state assessment of TxDOT maintenance program and practices, part I : workshop findings and recommendations

To assess and improve their practices, and thus ensure the future excellence of the Texas highway system, the Texas Department of Transportation (TxDOT) sought a forum in which experts from other State Departments of Transportation could evaluate the TxDOT maintenance program and practices based on their expertise. To meet this need, a Peer State Review of TxDOT Maintenance Practices project was organized and conducted by the Center for Transportation Research (CTR) at The University of Texas at Austin. CTR researchers, along with TxDOT staff, conducted a workshop to present TxDOT’s maintenance practices to the visiting peer reviewers and invite their feedback. Directors of maintenance from six different states—California, Kansas, Georgia, Missouri, North Carolina, and Washington—participated in the workshop. CTR and TxDOT worked together to design a questionnaire with 15 key questions to capture the peers’ opinions on maintenance program and practices. This paper compiles and summarizes this information. The examination results suggested that TxDOT should use a more state-wide approach to funding and planning, in addition to funding and planning for each district separately. Additionally, the peers recommended that criteria such as condition and level of service of the roadways be given greater weight in the funding allocation than lane miles or vehicle miles traveled (VMT). The Peer Reviewers also determined that TxDOT maintenance employee experience and communications were strong assets. Additional strengths included the willingness of TxDOT to invite peer reviews of their practices and a willingness to consider opportunities for improvement.

State convergence in the initialisation of the Sfinks stream cipher

Sfinks is a shift register based stream cipher designed for hardware implementation. The initialisation state update function is different from the state update function used for keystream generation. We demonstrate state convergence during the initialisation process, even though the individual components used in the initialisation are one-to-one. However, the combination of these components is not one-to-one.

A hybrid shifting bottleneck procedure algorithm for the parallel-machine job-shop scheduling problem

In practice, parallel-machine job-shop scheduling (PMJSS) is very useful in the development of standard modelling approaches and generic solution techniques for many real-world scheduling problems. In this paper, based on the analysis of structural properties in an extended disjunctive graph model, a hybrid shifting bottleneck procedure (HSBP) algorithm combined with Tabu Search metaheuristic algorithm is developed to deal with the PMJSS problem. The original-version SBP algorithm for the job-shop scheduling (JSS) has been significantly improved to solve the PMJSS problem with four novelties: i) a topological-sequence algorithm is proposed to decompose the PMJSS problem into a set of single-machine scheduling (SMS) and/or parallel-machine scheduling (PMS) subproblems; ii) a modified Carlier algorithm based on the proposed lemmas and the proofs is developed to solve the SMS subproblem; iii) the Jackson rule is extended to solve the PMS subproblem; iv) a Tabu Search metaheuristic algorithm is embedded under the framework of SBP to optimise the JSS and PMJSS cases. The computational experiments show that the proposed HSBP is very efficient in solving the JSS and PMJSS problems.

Metaheuristics for minimizing the makespan of the dynamic shop scheduling problem

For the shop scheduling problems such as flow-shop, job-shop, open-shop, mixed-shop, and group-shop, most research focuses on optimizing the makespan under static conditions and does not take into consideration dynamic disturbances such as machine breakdown and new job arrivals. We regard the shop scheduling problem under static conditions as the static shop scheduling problem, while the shop scheduling problem with dynamic disturbances as the dynamic shop scheduling problem. In this paper, we analyze the characteristics of the dynamic shop scheduling problem when machine breakdown and new job arrivals occur, and present a framework to model the dynamic shop scheduling problem as a static group-shop-type scheduling problem. Using the proposed framework, we apply a metaheuristic proposed for solving the static shop scheduling problem to a number of dynamic shop scheduling benchmark problems. The results show that the metaheuristic methodology which has been successfully applied to the static shop scheduling problems can also be applied to solve the dynamic shop scheduling problem efficiently.

A fast tabu search algorithm for the group shop scheduling problem

Three types of shop scheduling problems, the flow shop, the job shop and the open shop scheduling problems, have been widely studied in the literature. However, very few articles address the group shop scheduling problem introduced in 1997, which is a general formulation that covers the three above mentioned shop scheduling problems and the mixed shop scheduling problem. In this paper, we apply tabu search to the group shop scheduling problem and evaluate the performance of the algorithm on a set of benchmark problems. The computational results show that our tabu search algorithm is typically more efficient and faster than the other methods proposed in the literature. Furthermore, the proposed tabu search method has found some new best solutions of the benchmark instances.

Metaheuristics for the mixed shop scheduling problem

In this paper, three metaheuristics are proposed for solving a class of job shop, open shop, and mixed shop scheduling problems. We evaluate the performance of the proposed algorithms by means of a set of Lawrence’s benchmark instances for the job shop problem, a set of randomly generated instances for the open shop problem, and a combined job shop and open shop test data for the mixed shop problem. The computational results show that the proposed algorithms perform extremely well on all these three types of shop scheduling problems. The results also reveal that the mixed shop problem is relatively easier to solve than the job shop problem due to the fact that the scheduling procedure becomes more flexible by the inclusion of more open shop jobs in the mixed shop.

A comparative study of algorithms for the flowshop scheduling problem

In this paper, we propose three meta-heuristic algorithms for the permutation flowshop (PFS) and the general flowshop (GFS) problems. Two different neighborhood structures are used for these two types of flowshop problem. For the PFS problem, an insertion neighborhood structure is used, while for the GFS problem, a critical-path neighborhood structure is adopted. To evaluate the performance of the proposed algorithms, two sets of problem instances are tested against the algorithms for both types of flowshop problems. The computational results show that the proposed meta-heuristic algorithms with insertion neighborhood for the PFS problem perform slightly better than the corresponding algorithms with critical-path neighborhood for the GFS problem. But in terms of computation time, the GFS algorithms are faster than the corresponding PFS algorithms.

Revolutionary self portrait

'Revolutionary Self Portrait' (2009) is a sculptural self-portrait. The work comprises a bust engulfed in hair and a scalloped pedestal stand. Historically, divine energy has frequently been depicted using fluid forms - drapery, clouds and occasionally hair. These forms and associations act as a departure point for this sculpture in which the figure is depicted in a state of inundation by billowing tufts hair. The work was also inspired by the tendency of great 19th century utopian thinkers - for example Marx, Bakunin and Kropotkin - to wear large beards. Within both traditions, the language of heroic subjectivity is amplified by a sculptural extension of the body. In 'Revolutionary Self Portrait' however, this extension threatens to suffocate the subject - a gesture made all the more ironic due to the fact that the artist himself is incapable of growing a beard. The work was selected for the National Artists' Self Portrait Prize, University of Queensland Art Museum, 2009.

Commentary on Spence et al. : "Problem solving programme implemented by teachers may prevent depression in the short term, but longer term benefits are unclear"

This is a methodologically exemplary trial of a population based (universal) approach to preventing depression in young people. The programme used teachers in a classroom setting to deliver cognitive behavioural problem solving skills to a cohort of students. We have little knowledge about “best practice” to prevent depression in adolescence. Classroom-based universal approaches appear to offer advantages in recruitment rates and lack of stigmatisation over approaches that target specific groups of at risk students. Earlier research on a universal school-based approach to preventing depression in adolescents showed promise, but employed mental health professionals to teach cognitive behavioural coping skills in small groups.1 Using such an approach routinely would be economically unsustainable. Spence’s trial, with teachers as facilitators, therefore represents a “real world” intervention that could be routinely disseminated.

Delegation framework for federated systems

It is not uncommon for enterprises today to be faced with the demand to integrate and incor- porate many different and possibly heterogeneous systems which are generally independently designed and developed, to allow seamless access. In effect, the integration of these systems results in one large whole system that must be able, at the same time, to maintain the local autonomy and to continue working as an independent entity. This problem has introduced a new distributed architecture called federated systems. The most challenging issue in federated systems is to find answers for the question of how to efficiently cooperate while preserving their autonomous characteristic, especially the security autonomy. This thesis intends to address this issue. The thesis reviews the evolution of the concept of federated systems and discusses the organisational characteristics as well as remaining security issues with the existing approaches. The thesis examines how delegation can be used as means to achieve better security, especially authorisation while maintaining autonomy for the participating member of the federation. A delegation taxonomy is proposed as one of the main contributions. The major contribution of this thesis is to study and design a mechanism to support dele- gation within and between multiple security domains with constraint management capability. A novel delegation framework is proposed including two modules: Delegation Constraint Man- agement module and Policy Management module. The first module is designed to effectively create, track and manage delegation constraints, especially for delegation processes which require re-delegation (indirect delegation). The first module employs two algorithms to trace the root authority of a delegation constraint chain and to prevent the potential conflict when creating a delegation constraint chain if necessary. The first module is designed for conflict prevention not conflict resolution. The second module is designed to support the first module via the policy comparison capability. The major function of this module is to provide the delegation framework the capability to compare policies and constraints (written under the format of a policy). The module is an extension of Lin et al.'s work on policy filtering and policy analysis. Throughout the thesis, some case studies are used as examples to illustrate the discussed concepts. These two modules are designed to capture one of the most important aspects of the delegation process: the relationships between the delegation transactions and the involved constraints, which are not very well addressed by the existing approaches. This contribution is significant because the relationships provide information to keep track and en- force the involved delegation constraints and, therefore, play a vital role in maintaining and enforcing security for transactions across multiple security domains.