Research Commons

Browsing Computing and Mathematical Sciences by Submit Date

Research Commons

Browsing Computing and Mathematical Sciences by Submit Date

Sort by: Order: Results:

  • Robins, Judith H.; Miller, Steven D.; Russell, James C.; Harper, Grant A.; Fewster, Rachel M. (New Zealand Ecological Society, 2016)
    The ship rat invasion of Big South Cape Island/Taukihepa in the 1960s was an ecological catastrophe that marked a turning point for the management of rodents on offshore islands of New Zealand. Despite the importance of ...
  • Kalnins, Ernie G.; Miller, W., Jr.; Post, Sarah (MAIK NAUKA/INTERPERIODICA/SPRINGER, 2010)
    We give the first explicit construction of the quadratic algebra for a 3D quantum superintegrable system with nondegenerate (4-parameter) potential together with realizations of irreducible representations of the quadratic ...
  • Ko, Ryan K.L.; Russello, Giovanni; Nelson, Richard; Pang, Shaoning; Cheang, Aloysius; Dobbie, Gill; Sarrafzadeh, Abdolhossein; Chaisiri, Sivadon; Asghar, Muhammad Rizwan; Holmes, Geoffrey (Springer International Publishing, 2015)
    When we upload or create data into the cloud or the web, we immediately lose control of our data. Most of the time, we will not know where the data will be stored, or how many copies of our files are there. Worse, we are ...
  • Mohajerani, Sahar; Malik, Robi; Fabian, Martin (Springer, 2016)
    This paper presents a framework for compositional nonblocking verification of discrete event systems modelled as extended finite-state machines (EFSM). Previous results are improved to consider general conflict-equivalence ...
  • Bifet, Albert; de Francisci Morales, Gianmarco; Read, Jess; Holmes, Geoff; Pfahringer, Bernhard (ACM, 2015)
    The evaluation of classifiers in data streams is fundamental so that poorly-performing models can be identified, and either improved or replaced by better-performing models. This is an increasingly relevant and important ...
  • Heinonen, Robin; Kalnins, Ernie G.; Miller, W., Jr.; Subag, Eyal (Institute of Mathematics of National Academy of Science of Ukraine, 2015)
    Two-dimensional quadratic algebras are generalizations of Lie algebras that include the symmetry algebras of 2nd order superintegrable systems in 2 dimensions as special cases. The superintegrable systems are exactly ...
  • Kalnins, Ernie G.; Pogosyan, G.S.; Yakhno, Alexander (Institute of Mathematics of National Academy of Science of Ukraine, 2012)
    In this paper analytic contractions have been established in the R → ∞ con- traction limit for exactly solvable basis functions of the Helmholtz equation on the two- dimensional two-sheeted hyperboloid. As a consequence ...
  • Chen, Yuxan; Kalnins, Ernie G.; Li, Qiushi; Miller, W., Jr. (Institute of Mathematics of National Academy of Science of Ukraine, 2015)
    Classical (maximal) superintegrable systems in n dimensions are Hamiltonian systems with 2n - 1 independent constants of the motion, globally defined, the maximum number possible. They are very special because they can be ...
  • Read, Jesse; Reutemann, Peter; Pfahringer, Bernhard; Holmes, Geoff (2016)
    Multi-label classification has rapidly attracted interest in the machine learning literature, and there are now a large number and considerable variety of methods for this type of learning. We present MEKA: an open-source ...
  • Mayo, M; Daoud, M (Elsevier, 2016)
    Correct placement of turbines in a wind farm is a critical issue in wind farm design optimisation. While traditional "trial and error"-based approaches suffice for small layouts, automated approaches are required for larger ...
  • Delbourgo, Daniel; Lei, Antonio (Cambridge University Press (CUP), 2015)
    Let E/ℚ be a semistable elliptic curve, and p ≠ 2 a prime of bad multiplicative reduction. For each Lie extension ℚ FT / ℚ with Galois group G∞ ≅ℤр ⋊ ℤ p ×, we construct p-adic L-functions interpolating Artin twists of ...
  • Delbourgo, Daniel; Lei, Antonio (Rocky Mountain Mathematics Consortium, 2015)
    Let A/k denote an abelian variety defined over a number field k with good ordinary reduction at all primes above p, and let K∞ =∪n≥1 Kn be a p-adic Lie extension of k containing the cyclotomic Zp-extension. We use K-theory ...
  • Dang, Chi Tai; Masoodian, Masood; André, Elisabeth (University of Bamberg Press, 2015)
    Large interactive displays provide potential platforms for collaborative visualizations to support groups of co-located people in interacting with shared information spaces. In these settings, it is often necessary to ...
  • Stringer, Jonathan; Pemberton, Dean; Fu, Qiang; Lorier, Christopher; Nelson, Richard; Bailey, Josh; Corrêa, Carlos N.A.; Rothenberg, Christian Esteve (IEEE, 2014)
    Software Defined Networking (SDN) is an active area for network research, with many organizations exploring the opportunities provided by the decoupling of network control from packet forwarding. However, questions remain ...
  • Jung, Yoonsuh (World Academy of Science, Engineering and technology, 2016)
    As DNA microarray data contain relatively small sample size compared to the number of genes, high dimensional models are often employed. In high dimensional models, the selection of tuning parameter (or, penalty parameter) ...
  • Pearson, Murray; Melchert, Matthew (University of Waikato, Department of Computer Science, 1993)
    This paper describes the background and development of PICSIL1 a visual language for specifying parallel algorithms using structured decomposition. PICSIL1 draws upon graphical and textual specification techniques; the ...
  • Cleary, John G.; Olthof, Ian (University of Waikato, Department of Computer Science, 1993)
    A distributed AND-parallel Prolog implementation is described. The system can correctly handle all pure Prolog programs. In particular, it deals with the problem of distributed backtracking. Conflicts in variable bindings ...
  • Cleary, John G. (University of Waikato, Department of Computer Science, 1993)
    This report provides an informal and gentle introduction to the logic programming language Starlog and is intended to eventually form the first chapter of a book on Starlog. Like Prolog (a widely known and common logic ...
  • Cleary, John G. (University of Waikato, Department of Computer Science, 1993)
    Logical arithmetic is a logically correct technique for real arithmetic in Prolog which uses constraints over interval representations for its implementation. Four problems with the technique are considered: answers are ...
  • Hinze, Annika; Jung, Doris; Cunningham, Sally Jo (University of Waikato, Department of Computer Science, 2006)
    The CWC 2006 Proceedings contains the following student papers: • Kathryn Hempstalk: Hiding Behind Corners: Using Edges in Images for Better Steganography • Supawan Prompramote, Kathy Blashki: Playing to Learn: Enhancing ...