Parallel random prism: a computationally efficient ensemble learner for classification

Generally classifiers tend to overfit if there is noise in the training data or there are missing values. Ensemble learning methods are often used to improve a classifier's classification accuracy. Most ensemble learning approaches aim to improve the classification accuracy of decision trees. However, alternative classifiers to decision trees exist. The recently developed Random Prism ensemble learner for classification aims to improve an alternative classification rule induction approach, the Prism family of algorithms, which addresses some of the limitations of decision trees. However, Random Prism suffers like any ensemble learner from a high computational overhead due to replication of the data and the induction of multiple base classifiers. Hence even modest sized datasets may impose a computational challenge to ensemble learners such as Random Prism. Parallelism is often used to scale up algorithms to deal with large datasets. This paper investigates parallelisation for Random Prism, implements a prototype and evaluates it empirically using a Hadoop computing cluster.

Assumption of knowledge and the Chinese Room in Turing test interrogation

Whilst common sense knowledge has been well researched in terms of intelligence and (in particular) artificial intelligence, specific, factual knowledge also plays a critical part in practice. When it comes to testing for intelligence, testing for factual knowledge is, in every-day life, frequently used as a front line tool. This paper presents new results which were the outcome of a series of practical Turing tests held on 23rd June 2012 at Bletchley Park, England. The focus of this paper is on the employment of specific knowledge testing by interrogators. Of interest are prejudiced assumptions made by interrogators as to what they believe should be widely known and subsequently the conclusions drawn if an entity does or does not appear to know a particular fact known to the interrogator. The paper is not at all about the performance of machines or hidden humans but rather the strategies based on assumptions of Turing test interrogators. Full, unedited transcripts from the tests are shown for the reader as working examples. As a result, it might be possible to draw critical conclusions with regard to the nature of human concepts of intelligence, in terms of the role played by specific, factual knowledge in our understanding of intelligence, whether this is exhibited by a human or a machine. This is specifically intended as a position paper, firstly by claiming that practicalising Turing's test is a useful exercise throwing light on how we humans think, and secondly, by taking a potentially controversial stance, because some interrogators adopt a solipsist questioning style of hidden entities with a view that it is a thinking intelligent human if it thinks like them and knows what they know. The paper is aimed at opening discussion with regard to the different aspects considered.

Towards expressive rule induction on IP network event streams

In order to gain insights into events and issues that may cause errors and outages in parts of IP networks, intelligent methods that capture and express causal relationships online (in real-time) are needed. Whereas generalised rule induction has been explored for non-streaming data applications, its application and adaptation on streaming data is mostly undeveloped or based on periodic and ad-hoc training with batch algorithms. Some association rule mining approaches for streaming data do exist, however, they can only express binary causal relationships. This paper presents the ongoing work on Online Generalised Rule Induction (OGRI) in order to create expressive and adaptive rule sets real-time that can be applied to a broad range of applications, including network telemetry data streams.

Gentlemen, stop your engines!

For fifty years, computer chess has pursued an original goal of Artificial Intelligence, to produce a chess-engine to compete at the highest level. The goal has arguably been achieved, but that success has made it harder to answer questions about the relative playing strengths of man and machine. The proposal here is to approach such questions in a counter-intuitive way, handicapping or stopping-down chess engines so that they play less well. The intrinsic lack of man-machine games may be side-stepped by analysing existing games to place computer engines as accurately as possible on the FIDE ELO scale of human play. Move-sequences may also be assessed for likelihood if computer-assisted cheating is suspected.

Generating recipient-centred explanations about drug prescription

In this paper we describe how we generated written explanations to ‘indirect users’ of a knowledge-based system in the domain of drug prescription. We call ‘indirect users’ the intended recipients of explanations, to distinguish them from the prescriber (the ‘direct’ user) who interacts with the system. The Explanation Generator was designed after several studies about indirect users' information needs and physicians' explanatory attitudes in this domain. It integrates text planning techniques with ATN-based surface generation. A double modeling component enables adapting the information content, order and style to the indirect user to whom explanation is addressed. Several examples of computer-generated texts are provided, and they are contrasted with the physicians' explanations to discuss advantages and limits of the approach adopted.

Distributed intelligent management of active networks

This paper focuses on improving computer network management by the adoption of artificial intelligence techniques. A logical inference system has being devised to enable automated isolation, diagnosis, and even repair of network problems, thus enhancing the reliability, performance, and security of networks. We propose a distributed multi-agent architecture for network management, where a logical reasoner acts as an external managing entity capable of directing, coordinating, and stimulating actions in an active management architecture. The active networks technology represents the lower level layer which makes possible the deployment of code which implement teleo-reactive agents, distributed across the whole network. We adopt the Situation Calculus to define a network model and the Reactive Golog language to implement the logical reasoner. An active network management architecture is used by the reasoner to inject and execute operational tasks in the network. The integrated system collects the advantages coming from logical reasoning and network programmability, and provides a powerful system capable of performing high-level management tasks in order to deal with network fault.

Automated pre-processing strategies for species occurrence data used in biodiversity modelling

To construct Biodiversity richness maps from Environmental Niche Models (ENMs) of thousands of species is time consuming. A separate species occurrence data pre-processing phase enables the experimenter to control test AUC score variance due to species dataset size. Besides, removing duplicate occurrences and points with missing environmental data, we discuss the need for coordinate precision, wide dispersion, temporal and synonymity filters. After species data filtering, the final task of a pre-processing phase should be the automatic generation of species occurrence datasets which can then be directly ’plugged-in’ to the ENM. A software application capable of carrying out all these tasks will be a valuable time-saver particularly for large scale biodiversity studies.

Association between ovarian follicle development and pregnancy rates in dairy cows undergoing spontaneous oestrous cycles

Ovarian follicle development continues in a wave-like manner during the bovine oestrous cycle giving rise to variation in the duration of ovulatory follicle development. The objectives of the present study were to determine whether a relationship exists between the duration of ovulatory follicle development and pregnancy rates following artificial insemination (AI) in dairy cows undergoing spontaneous oestrous cycles, and to identify factors influencing follicle turnover and pregnancy rate and the relationship between these two variables. Follicle development was monitored by daily transrectal ultrasonography from 10 days after oestrus until the subsequent oestrus in 158 lactating dairy cows. The cows were artificially inseminated following the second observed oestrus and pregnancy was diagnosed 35 days later. The predominant pattern of follicle development was two follicle waves (74.7%) with three follicle waves in 22.1% of oestrous cycles and four or more follicle waves in 3.2% of oestrous cycles. The interval from ovulatory follicle emergence to oestrus (EOI) was 3 days longer (P < 0.0001) in cows with two follicle waves than in those with three waves. Ovulatory follicles from two-wave oestrous cycles grew more slowly but were approximately 2 mm larger (P < 0.0001) on the day of oestrus. Twin ovulations were observed in 14.2% of oestrous cycles and occurred more frequently (P < 0.001) in three-wave oestrous cycles; consequently EOI was shorter in cows with twin ovulations. Overall, 57.0% of the cows were diagnosed pregnant 35 days after AI. Linear logistic regression analysis revealed an inverse relationship between EOI and the proportion of cows diagnosed pregnant, among all cows (n = 158; P < 0.01) and amongst those with single ovulations (n = 145; P < 0.05). Mean EOI was approximately I day shorter (P < 0.01) in cows that became pregnant than in non-pregnant cows; however, pregnancy rates did not differ significantly among cows with different patterns of follicle development. These findings confirm and extend previous observations in pharmacologically manipulated cattle and show, for the first time, that in dairy cows undergoing spontaneous oestrous cycles, natural variation in the duration of post-emergence ovulatory follicle development has a significant effect on pregnancy rate, presumably reflecting variation in oocyte developmental competence.

Association between ovarian follicle development and pregnancy rates in dairy cows undergoing spontaneous oestrous cycles

Ovarian follicle development continues in a wave-like manner during the bovine oestrous cycle giving rise to variation in the duration of ovulatory follicle development. The objectives of the present study were to determine whether a relationship exists between the duration of ovulatory follicle development and pregnancy rates following artificial insemination (AI) in dairy cows undergoing spontaneous oestrous cycles, and to identify factors influencing follicle turnover and pregnancy rate and the relationship between these two variables. Follicle development was monitored by daily transrectal ultrasonography from 10 days after oestrus until the subsequent oestrus in 158 lactating dairy cows. The cows were artificially inseminated following the second observed oestrus and pregnancy was diagnosed 35 days later. The predominant pattern of follicle development was two follicle waves (74.7%) with three follicle waves in 22.1% of oestrous cycles and four or more follicle waves in 3.2% of oestrous cycles. The interval from ovulatory follicle emergence to oestrus (EOI) was 3 days longer (P < 0.0001) in cows with two follicle waves than in those with three waves. Ovulatory follicles from two-wave oestrous cycles grew more slowly but were approximately 2 mm larger (P < 0.0001) on the day of oestrus. Twin ovulations were observed in 14.2% of oestrous cycles and occurred more frequently (P < 0.001) in three-wave oestrous cycles; consequently EOI was shorter in cows with twin ovulations. Overall, 57.0% of the cows were diagnosed pregnant 35 days after AI. Linear logistic regression analysis revealed an inverse relationship between EOI and the proportion of cows diagnosed pregnant, among all cows (n = 158; P < 0.01) and amongst those with single ovulations (n = 145; P < 0.05). Mean EOI was approximately I day shorter (P < 0.01) in cows that became pregnant than in non-pregnant cows; however, pregnancy rates did not differ significantly among cows with different patterns of follicle development. These findings confirm and extend previous observations in pharmacologically manipulated cattle and show, for the first time, that in dairy cows undergoing spontaneous oestrous cycles, natural variation in the duration of post-emergence ovulatory follicle development has a significant effect on pregnancy rate, presumably reflecting variation in oocyte developmental competence.

Unsupervised genetic algorithm deployed for intrusion detection

This paper represents the first step in an on-going work for designing an unsupervised method based on genetic algorithm for intrusion detection. Its main role in a broader system is to notify of an unusual traffic and in that way provide the possibility of detecting unknown attacks. Most of the machine-learning techniques deployed for intrusion detection are supervised as these techniques are generally more accurate, but this implies the need of labeling the data for training and testing which is time-consuming and error-prone. Hence, our goal is to devise an anomaly detector which would be unsupervised, but at the same time robust and accurate. Genetic algorithms are robust and able to avoid getting stuck in local optima, unlike the rest of clustering techniques. The model is verified on KDD99 benchmark dataset, generating a solution competitive with the solutions of the state-of-the-art which demonstrates high possibilities of the proposed method.

Wireless sensor networks

This paper provides an introduction to Wireless Sensor Networks (WSN), their applications in the field of control engineering and elsewhere and gives pointers to future research needs. WSN are collections of stand-alone devices which, typically, have one or more sensors (e.g. temperature, light level), some limited processing capability and a wireless interface allowing communication with a base station. As they are usually battery powered, the biggest challenge is to achieve the necessary monitoring whilst using the least amount of power.

Verifying and fixing password authentication protocol

Password Authentication Protocol (PAP) is widely used in the Wireless Fidelity Point-to-Point Protocol to authenticate an identity and password for a peer. This paper uses a new knowledge-based framework to verify the PAP protocol and a fixed version. Flaws are found in both the original and the fixed versions. A new enhanced protocol is provided and the security of it is proved The whole process is implemented in a mechanical reasoning platform, Isabelle. It only takes a few seconds to find flaws in the original and the fixed protocol and to verify that the enhanced version of the PAP protocol is secure.