Bearing Fault Diagnostics Using the Spectral Pattern Recognition

In the field of diagnostics of rolling element bearings, the development of sophisticated techniques, such as Spectral Kurtosis and 2nd Order Cyclostationarity, extended the capability of expert users to identify not only the presence, but also the location of the damage in the bearing. Most of the signal-analysis methods, as the ones previously mentioned, result in a spectrum-like diagram that presents line frequencies or peaks in the neighbourhood of some theoretical characteristic frequencies, in case of damage. These frequencies depend only on damage position, bearing geometry and rotational speed. The major improvement in this field would be the development of algorithms with high degree of automation. This paper aims at this important objective, by discussing for the first time how these peaks can draw away from the theoretical expected frequencies as a function of different working conditions, i.e. speed, torque and lubrication. After providing a brief description of the peak-patterns associated with each type of damage, this paper shows the typical magnitudes of the deviations from the theoretical expected frequencies. The last part of the study presents some remarks about increasing the reliability of the automatic algorithm. The research is based on experimental data obtained by using artificially damaged bearings installed in a gearbox.

My Kitchen Rules pair are all the rage on social media – for now

The launch of the current series of My Kitchen Rules has undoubtedly been successful, both in terms of television ratings and in capturing a social media audience, clearly winning the battle for the Twitter audience on premiere night, and maintaining a lead over both The Block and The Biggest Loser since then. But it is the controversy surrounding Perth contestants Kelly Ramsay and Chloe James that has dominated media coverage today, detailing the abuse to which they have been subjected on social media.

Structured feature extraction using association rules

As of today, opinion mining has been widely used to iden- tify the strength and weakness of products (e.g., cameras) or services (e.g., services in medical clinics or hospitals) based upon people's feed- back such as user reviews. Feature extraction is a crucial step for opinion mining which has been used to collect useful information from user reviews. Most existing approaches only find individual features of a product without the structural relationships between the features which usually exists. In this paper, we propose an approach to extract features and feature relationship, represented as tree structure called a feature hi- erarchy, based on frequent patterns and associations between patterns derived from user reviews. The generated feature hierarchy profiles the product at multiple levels and provides more detailed information about the product. Our experiment results based on some popularly used review datasets show that the proposed feature extraction approach can identify more correct features than the baseline model. Even though the datasets used in the experiment are about cameras, our work can be ap- plied to generate features about a service such as the services in hospitals or clinics.

Predicting fault-prone software modules with rank sum classification

The detection and correction of defects remains among the most time consuming and expensive aspects of software development. Extensive automated testing and code inspections may mitigate their effect, but some code fragments are necessarily more likely to be faulty than others, and automated identification of fault prone modules helps to focus testing and inspections, thus limiting wasted effort and potentially improving detection rates. However, software metrics data is often extremely noisy, with enormous imbalances in the size of the positive and negative classes. In this work, we present a new approach to predictive modelling of fault proneness in software modules, introducing a new feature representation to overcome some of these issues. This rank sum representation offers improved or at worst comparable performance to earlier approaches for standard data sets, and readily allows the user to choose an appropriate trade-off between precision and recall to optimise inspection effort to suit different testing environments. The method is evaluated using the NASA Metrics Data Program (MDP) data sets, and performance is compared with existing studies based on the Support Vector Machine (SVM) and Naïve Bayes (NB) Classifiers, and with our own comprehensive evaluation of these methods.

On the hardness of the sum of K mins problem

The sum of k mins protocol was proposed by Hopper and Blum as a protocol for secure human identification. The goal of the protocol is to let an unaided human securely authenticate to a remote server. The main ingredient of the protocol is the sum of k mins problem. The difficulty of solving this problem determines the security of the protocol. In this paper, we show that the sum of k mins problem is NP-Complete and W[1]-Hard. This latter notion relates to fixed parameter intractability. We also discuss the use of the sum of k mins protocol in resource-constrained devices.

Reframe : QUT's evaluation framework survey business rules

Reframe is changing our approach to the evaluation of courses, units, teaching and student experience at QUT. We are moving away from a single survey tool to a richer, more holistic and customisable approach. This approach will help our academics design and deliver high-quality learning experiences, and review the impact of their teaching practice on student learning. Through it, we will also be able to provide more timely access to specialised support and meet external reporting requirements.

Broken gates and leaky graves : spectral language and Australia's ghost stories

Ghost stories are unusual amongst supernatural literatures in their modelling of a recognisable, mimetic reality interrupted or infiltrated by immaterial forces. In its discussion of Australian ghost stories, this thesis advances a new approach to ghost narratives which seeks to model and articulate the mechanics of ghosts and hauntings as something reliant on and engaged with the material and the mundane.

Interpretation of association rules with multi-tier granule mining

This study was a step forward to improve the performance for discovering useful knowledge – especially, association rules in this study – in databases. The thesis proposed an approach to use granules instead of patterns to represent knowledge implicitly contained in relational databases; and multi-tier structure to interpret association rules in terms of granules. Association mappings were proposed for the construction of multi-tier structure. With these tools, association rules can be quickly assessed and meaningless association rules can be justified according to the association mappings. The experimental results indicated that the proposed approach is promising.

Children's perspectives on values and rules in Australian early education

In recent years, issues relating to moral and conventional values have been emphasized in educational policies. This study examines young children’s (100 children aged 4–8 years) own understandings of values and rules for how to treat others and participate in school. Eleven classrooms, within seven different elementary schools in Queensland, were visited. Children were interviewed regarding their views about moral and conventional issues, rules and participation in everyday school life. According to the children, ‘doing the right thing’ in school involved both a concern for others’ wellbeing and for the social order in school, including conventions, rules and behaviour connected with discipline. The children’s responsibility seemed, however, to be to adapt to the (school) system, rather than being an active participant in constructing the system.

Interpretation of association rules in multi-tier structures

Dealing with the large amount of data resulting from association rule mining is a big challenge. The essential issue is how to provide efficient methods for summarizing and representing meaningful discovered knowledge from databases. This paper presents a new approach called multi-tier granule mining to improve the performance of association rule mining. Rather than using patterns, it uses granules to represent knowledge that is implicitly contained in relational databases. This approach also uses multi-tier structures and association mappings to interpret association rules in terms of granules. Consequently, association rules can be quickly assessed and meaningless association rules can be justified according to these association mappings. The experimental results indicate that the proposed approach is promising

Federal Court Rules 027 r 11 - Subpoena to give evidence

In Australian Prudential Regulation Authority v Rural and General Insurance Let [2004] FCA 933, Gyles J considered what he described as "a novel question", namely, whether taking steps to prepare to give oral evidence when subpoenaed to attend for that purpose, including the obtaining of legal advice and assistance, could be recovered by the witness under O 27 r 11 of the Federal Court Rules

Practice and Procedure - Uniform Civil Procedure Rules 1999 r 212(2) - whether draft expert reports must be disclosed

In Mitchell Contractors Pty Ltd v Townsville-Thuringowa Water Supply Joint Board [2004] QSC 329, Douglas J considered the issue of broad significance for litigation practitioners of whether draft expert reports fall within the description in r212(2) of the Uniform Civil Procedure Rules 1999 (Qld) of documents "consisting of a statement or report of an expert" and are therefore not privileged from disclosure.

Rules of thumb for comparing multinomial logit and multinomial probit coefficients

A rule of thumb is suggested for comparing multinomial logit coefficients with multinomial probit coefficients in the special case where the normal errors are distributed N(0,1). The rule is a generalization of the '1.6' rule for comparing logit and probit coefficients. © 1989.

Higher order universal one-way hash functions from the subset sum assumption

Universal One-Way Hash Functions (UOWHFs) may be used in place of collision-resistant functions in many public-key cryptographic applications. At Asiacrypt 2004, Hong, Preneel and Lee introduced the stronger security notion of higher order UOWHFs to allow construction of long-input UOWHFs using the Merkle-Damgård domain extender. However, they did not provide any provably secure constructions for higher order UOWHFs. We show that the subset sum hash function is a kth order Universal One-Way Hash Function (hashing n bits to m < n bits) under the Subset Sum assumption for k = O(log m). Therefore we strengthen a previous result of Impagliazzo and Naor, who showed that the subset sum hash function is a UOWHF under the Subset Sum assumption. We believe our result is of theoretical interest; as far as we are aware, it is the first example of a natural and computationally efficient UOWHF which is also a provably secure higher order UOWHF under the same well-known cryptographic assumption, whereas this assumption does not seem sufficient to prove its collision-resistance. A consequence of our result is that one can apply the Merkle-Damgård extender to the subset sum compression function with ‘extension factor’ k+1, while losing (at most) about k bits of UOWHF security relative to the UOWHF security of the compression function. The method also leads to a saving of up to m log(k+1) bits in key length relative to the Shoup XOR-Mask domain extender applied to the subset sum compression function.

The subset sum problem in Keno modelling

Aspects of Keno modelling throughout the Australian states of Queensland, New South Wales and Victoria are discussed: the trivial Heads or Tails and the more interesting Keno Bonus, which leads to consideration of the subset sum problem. The most intricate structure is where Heads or Tails and Keno Bonus are combined, and here, the issue of independence arises. Closed expressions for expected return to player are presented in each case.