76 resultados para Gordon Rule
em Deakin Research Online - Australia
Resumo:
Current studies to analyzing security protocols using formal methods require users to predefine authentication goals. Besides, they are unable to discover potential correlations between secure messages. This research attempts to analyze security protocols using data mining. This is done by extending the idea of association rule mining and converting the verification of protocols into computing the frequency and confidence of inconsistent secure messages. It provides a novel and efficient way to analyze security protocols and find out potential correlations between secure messages. The conducted experiments demonstrate our approaches.
Resumo:
Classification methods are usually used to categorize text documents, such as, Rocchio method, Naïve bayes based method, and SVM based text classification method. These methods learn labeled text documents and then construct classifiers. The generated classifiers can predict which category is located for a new coming text document. The keywords in the document are often used to form rules to categorize text documents, for example “kw = computer” can be a rule for the IT documents category. However, the number of keywords is very large. To select keywords from the large number of keywords is a challenging work. Recently, a rule generation method based on enumeration of all possible keywords combinations has been proposed [2]. In this method, there remains a crucial problem: how to prune irrelevant combinations at the early stages of the rule generation procedure. In this paper, we propose a method than can effectively prune irrelative keywords at an early stage.
Resumo:
The Apriori algorithm’s frequent itemset approach has become the standard approach to discovering association rules. However, the computation requirements of the frequent itemset approach are infeasible for dense data and the approach is unable to discover infrequent associations. OPUS AR is an efficient algorithm for association rule discovery that does not utilize frequent itemsets and hence avoids these problems. It can reduce search time by using additional constraints on the search space as well as constraints on itemset frequency. However, the effectiveness of the pruning rules used during search will determine the efficiency of its search. This paper presents and analyses pruning rules for use with OPUS AR. We demonstrate that application of OPUS AR is feasible for a number of datasets for which application of the frequent itemset approach is infeasible and that the new pruning rules can reduce compute time by more than 40%.
Resumo:
The tale of research methodology in information systems is told through the fantasy of Tolkien’s Lord of the Rings. The tale is intended to be at once a piece of light hearted fun in its placement of the struggles of research methodology as an epic story but, in the tradition of the court jester, attempts to provide a new perspective on Information Systems (IS) research methodology and our struggles with positivism in particular. Our tale is one of developing a greater maturity and confidence in IS methodology and introduces postmodern methodologies to Information Systems. Our tale, our pastiche, is itself postmodern.
Resumo:
Microarray data provides quantitative information about the transcription profile of cells. To analyze microarray datasets, methodology of machine learning has increasingly attracted bioinformatics researchers. Some approaches of machine learning are widely used to classify and mine biological datasets. However, many gene expression datasets are extremely high dimensionality, traditional machine learning methods can not be applied effectively and efficiently. This paper proposes a robust algorithm to find out rule groups to classify gene expression datasets. Unlike the most classification algorithms, which select dimensions (genes) heuristically to form rules groups to identify classes such as cancerous and normal tissues, our algorithm guarantees finding out best-k dimensions (genes), which are most discriminative to classify samples in different classes, to form rule groups for the classification of expression datasets. Our experiments show that the rule groups obtained by our algorithm have higher accuracy than that of other classification approaches
Resumo:
The Defining Issues Test (DIT), developed by Rest (1986), measures a person's level of moral development using hypothetical social dilemmas. Although the DIT is useful for measuring moral development in social settings, it might not adequately capture an individual's moral judgement abilities in solving work-related problems (Weber, 1990; Trevino, 1992; Welton et al., 1994). In the present study, the moral judgement levels of 97 accounting students were measured over a 1 year period using two separate test instruments, the DIT and a context-specific instrument developed by Welton et al. (1994). The test scores are significantly higher on the DIT than the Welton instrument (between the instruments and over time), suggesting that accounting students use higher levels of moral reasoning in resolving hypothetical social dilemmas and lower levels of moral reasoning in resolving context-specific dilemmas. The difference in test scores was highest during cooperative education (work placement programme), implying that the environment is a significant determinant on students' test scores.
Resumo:
The author poses the question whether the rule of law is a constitutionalist promise that protects all Australians or whether it is simply a juridical principle that may be balanced against certain social factors. Constitutionalist promises involve the limiting and supporting of state power. The author examines several instances of state power exercised in Australia and concludes that we should not rely on the rule of law as an absolute means of achieving equality, human rights, justice, freedom and even democracy.