This community houses research from the Faculty of Computing and Mathematical Sciences at the University of Waikato.

Sub-communities within Computing and Mathematical Sciences

Collections in Computing and Mathematical Sciences

  • WekaDeeplearning4j: A deep learning package for weka based on Deeplearning4j

    Lang, Steven; Bravo-Marquez, Felipe; Beckham, Christopher J.; Hall, Mark A.; Frank, Eibe (Elsevier BV, 2019)
    Deep learning is a branch of machine learning that generates multi-layered representations of data, commonly using artificial neural networks, and has improved the state-of-the-art in various machine learning tasks (e.g., ...
  • Ensembles of nested dichotomies with multiple subset evaluation

    Leathart, Tim; Frank, Eibe; Pfahringer, Bernhard; Holmes, Geoffrey (Springer, 2019)
    A system of nested dichotomies (NDs) is a method of decomposing a multiclass problem into a collection of binary problems. Such a system recursively applies binary splits to divide the set of classes into two subsets, and ...
  • Prior Robustness for Bayesian Implementation of the Fault Tree Analysis

    Joshi, Chaitanya; Ruggeri, Fabrizio; Wilson, Simon P. (IEEE, 2018)
    We propose a prior robustness approach for the Bayesian implementation of the fault tree analysis (FTA). FTA is often used to evaluate risk in large, safety critical systems but has limitations due to its static structure. ...
  • The effect of surface tension on free-surface flow induced by a point sink

    Hocking, Graeme Charles; Nguyen, H.H.N.; Forbes, L.K.; Stokes, Tim E. (Cambridge University Press, 2016)
    The steady, axisymmetric flow induced by a point sink (or source) submerged in an inviscid fluid of infinite depth is computed and the resulting deformation of the free surface is obtained. The effect of surface tension ...
  • Algebraic properties of If-Then-Else and commutative three-valued tests

    Soo, Khi-Ui; Stokes, Tim E. (2019)
    This paper establishes a finite axiomatization of possibly non-halting computer programs and tests, with the if-then-else operation. The model is a two-sorted algebra, with one sort being the programs and the other being ...
  • Counterexample Computation in Compositional Nonblocking Verification

    Malik, Robi; Ware, Simon (Elsevier, 2018)
    This paper describes algorithms to compute a counterexample when compositional nonblocking verification determines that a discrete event system is blocking. Counterexamples are an important feature of model checking that ...
  • Optimal Task Scheduling in a Flexible Manufacturing System using Model Checking

    Malik, Robi; Pena, Patícia N. (Elsevier Ltd., 2018)
    This paper demonstrates the use of model checking to solve the problem of optimal task scheduling in a flexible manufacturing system. The system is modelled as a discrete event system, for which the least restrictive safe ...
  • Computing L-Invariants for the Symmetric Square of an Elliptic Curve

    Delbourgo, Daniel; Gilmore, Hamish (Taylor & Francis, 2019)
    Let E be an elliptic curve over Q, and p≠2 a prime of good ordinary reduction. The p-adic L-function for Sym²E always vanishes at s = 1, even though the complex L-function does not have a zero there. The L-invariant itself ...
  • Health information research privacy standards should include Māori perspectives on privacy

    Ragupathy, Rajan; Yogarajan, Vithya; Luoni, Chris (New Zealand Medical Association, 2019)
    Secondary research using health records and other personal health data (henceforth referred to as health information research) is a valuable tool for tackling New Zealand’s health and social challenges. It requires however ...
  • Boosting decision stumps for dynamic feature selection on data streams

    Barddal, Jean Paul; Enembreck, Fabrício; Gomes, Heitor Murilo; Bifet, Albert; Pfahringer, Bernhard (2019)
    Feature selection targets the identification of which features of a dataset are relevant to the learning task. It is also widely known and used to improve computation times, reduce computation requirements, and to decrease ...
  • K₁-congruences for three-dimensional Lie groups

    Delbourgo, Daniel; Chao, Qin (Springer, 2019)
    We completely describe K₁ (Zₚ [[G∞]]) and its localisations by using an infinite family of p-adic congruences, where G∞ is any solvable p-adic Lie group of dimension 3. This builds on earlier work of Kato when ...
  • Cyber security vulnerabilities in Tonga

    Laulaupea'alu, Siuta; Keegan, Te Taka Adrian Gregory (2019)
    A research project undertaken in Tonga in 2016 showed that Tonga's computer systems are susceptible and can be easily exploited by cybercriminals. This paper builds on that research by identifying areas of vulnerability ...
  • Learning Through Utility Optimization in Regression Tasks

    Branco, Paula; Torgo, Luís; Ribeiro, Rita P.; Frank, Eibe; Pfahringer, Bernhard; Rau, Markus Michael (IEEE, 2017)
    Accounting for misclassification costs is important in many practical applications of machine learning, and cost-sensitive techniques for classification have been studied extensively. Utility-based learning provides a ...
  • Improving Naive Bayes for regression with optimised artificial surrogate data

    Mayo, Michael; Frank, Eibe (2018)
    Can we evolve better training data for machine learning algorithms? To investigate this question we use population-based optimisation algorithms to generate artificial surrogate training data for naive Bayes for regression. ...
  • Long-term hip function in slipped capital femoral epiphysis treated with in situ pinning.

    Bond, Elizabeth C.; Phillips, Paul; Larsen, Peter D.; Hunt, Lynette Anne; Willoughby, Richard (2019)
    BACKGROUND:: In recent years, there has been a trend toward more aggressive management of slipped capital femoral epiphysis (SCFE) with acute anatomical realignment; however, the literature is unclear with regard to the ...
  • Using crowdsourcing marketplaces for network measurements: the case of Spoofer

    Lone, Qasim; Luckie, Matthew; Korczynski, Maciej; Asghari, Hadi; Javed, Mobin; van Eeten, Michel (IEEE, 2018)
    Internet measurement tools are used to make inferences about network policies and practices across the Internet, such as censorship, traffic manipulation, bandwidth, and security measures. Some tools must be run from vantage ...
  • Identifying equivalent SDN forwarding behaviour

    Sanger, Richard; Luckie, Matthew John; Nelson, Richard (ACM, 2019)
    Software-Defined Networking (SDN) enables network operators the flexibility to program their own forwarding rules, providing more than one way to achieve the same behaviour. Verifying equivalence between rulesets is a ...
  • From event streams to process models and back: Challenges and opportunities

    Soffer, Pnina; Hinze, Annika; Koschmider, Agnes; Ziekow, Holger; Di Ciccio, Claudio; Koldehofe, Boris; Kopp, Oliver; Jacobsen, Arno; Suermeli, Jan; Son, Wei (Pergamon-Elsevier Science Ltd, 2019)
    The domains of complex event processing (CEP) and business process management (BPM) have different origins but for many aspects draw on similar concepts. While specific combinations of BPM and CEP have attracted research ...
  • Exploring orientation cues in both digital and physical books

    Vanderschantz, Nicholas; Timpany, Claire; Hinze, Annika; Du, Yuchen (BISL, 2017)
    Electronic books (eBooks) and eReaders are now a commonplace tool in the reading experience for many readers. Yet these have long received mixed reviews. Designing suitable interactions that support successful eReading ...
  • Visual semantic enrichment for ereading

    Coleman, Michael; Hinze, Annika (BISL, 2017)
    The current transition from physical to electronic books opens up opportunities to present semantic information about a book’s content. This paper reports on a project that aims to improve the eBook reading experience by ...

View more