Recent Submissions

  • Comparing leaf and root insertion 

    Geldenhuys, Jaco; Van der Merwe, Brink (South African Institute of Computer Scientists and Information Technologists, 2009)
    We consider two ways of inserting a key into a binary search tree: leaf insertion which is the standard method, and root insertion which involves additional rotations. Although the respective cost of constructing leaf and ...
  • Revival of the magnetar PSR J1622–4950 : observations with MeerKAT, Parkes, XMM-Newton, Swift, Chandra, and NuSTAR 

    Camilo, F.; Serylak, M.; Buchner, S.; Merryfield, M.; Kaspi, V. M.; Archibald, R. F.; Bailes, M.; Jameson, A.; Van Straten, W.; Sarkissian, J.; Reynolds, J. E.; Johnston, S.; Hobbs, G.; Abbott, T. D.; Adam, R. M.; Adams, G. B.; Alberts, T.; Andreas, R.; Asad, K. M. B.; Baker, D. E.; Baloyi, T.; Bauermeister, E. F.; Baxana, T.; Bennett, T. G. H.; Bernardi, G.; Booisen, D.; Booth, R. S.; Botha, D. H.; Boyana, L.; Brederode, L. R. S.; Burge, J. P.; Cheetham, T.; Conradie, J.; Conradie, J. P.; Davidson, D. B.; De Bruin, G.; De Swardt, B.; De Villiers, C.; De Villiers, D. I. L.; De Villiers, M. S.; De Villiers, W.; De Waal, C.; Dikgale, M. A.; Du Toit, G.; Du Toit, L. J.; Esterhuyse, S. W. P.; Fanaroff, B.; Fataar, S.; Foley, A. R.; Foste, G.; Fourie, D.; Gamatham, R.; Gatsi, T.; Geschke, R.; Goedhart, S.; Grobler, T. L.; Gumede, S. C.; Hlakola, M. J.; Hokwana, A.; Hoorn, D. H.; Horn, D.; Horrell, J.; Hugo, B.; Isaacson, A.; Jacobs, O.; Jansen Van Rensburg, J. P.; Jonas, J. L.; Jordaan, B.; Joubert, A.; Joubert, F.; Jozsa, G. I. G.; Julie, R.; Julius, C. C.; Kapp, F.; Karastergiou, A.; Karels, F.; Kariseb, M.; Karuppusamy, R.; Kasper, V.; Knox-Davies, E. C.; Koch, D.; Kotze, P. P. A.; Krebs, A.; Kriek, N.; Kriel, H.; Kusel, T.; Lamoor, S.; Lehmensiek, R.; Liebenberg, D.; Liebenberg, I.; Lord, R. T.; Lunsky, B.; Mabombo, N.; Macdonald, T.; Macfarlane, P.; Madisa, K.; Mafhungo, L.; Magnus, L. G.; Magozore, C.; Mahgoub, O.; Main, J. P. L.; Makhathini, S.; Malan, J. A.; Malgas, P.; Manley, J. R.; Manzini, M.; Marais, L.; Marais, N.; Marais, S. J.; Maree, M.; Martens, A.; Matshawule, S. D.; Matthysen, N.; Mauch, T.; McNally, L. D.; Merry, B.; Millenaar, R. P.; Mjikelo, C.; Mkhabela, N.; Mnyandu, N.; Moeng, I. T.; Mokone, O. J.; Monama, T. E.; Montshiwa, K.; Moss, V.; Mphego, M.; New, W.; Ngcebetsha, B.; Ngoasheng, K.; Niehaus, H.; Ntuli, P.; Nzama, A.; Obies, F.; Obrocka, M.; Ockards, M. T.; Olyn, C.; Oozeer, N.; Otto, A. J.; Padayachee, Y.; Passmoor, S.; Patel, A. A.; Paula, S.; Peens-Hough, A.; Pholoholo, B.; Prozesky, P.; Rakoma, S.; Ramaila, A. J. T.; Rammala, I.; Ramudzuli, Z. R.; Rasivhaga, M.; Ratcliffe, S.; Reader, H. C.; Renil, R.; Richter, L.; Robyntjies, A.; Rosekrans, D.; Rust, A.; Salie, S.; Sambu, N.; Schollar, C. T. G.; Schwardt, L.; Seranyane, S.; Sethosa, G.; Sharpe, C.; Siebrits, R.; Sirothia, S. K.; Slabber, M. J.; Smirnov, O.; Smith, S.; Sofeya, L.; Songqumase, N.; Spann, R.; Stappers, B.; Steyn, D.; Steyn, T. J.; Strong, R.; Struthers, A.; Struthers, A.; Stuart, C.; Sunnylall, P.; Swart, P. S.; Taljaard, B.; Tasse, C.; Taylor, G.; Theron, I. P.; Thondikulam, V.; Thorat, K.; Tiplady, A.; Toruvanda, O.; Van Aardt, J.; Van Balla, T.; Van den Heever, L.; Van der Byl, A.; Van der Merwe, C.; Van der Merwe, P.; Van Niekerk, P. C.; Van Rooyen, R.; Van Staden, J. P.; Van Tonder, V.; Van Wyk, R.; Wait, I.; Walker, A. L.; Wallace, B.; Welz, M.; Williams, L. P.; Xaia, B.; Young, N.; Zitha, S. (American Astronomical Society, 2018)
    New radio (MeerKAT and Parkes) and X-ray (XMM-Newton, Swift, Chandra, and NuSTAR) observations of PSR J1622–4950 indicate that the magnetar, in a quiescent state since at least early 2015, reactivated between 2017 March ...
  • An assessment of algorithms for deriving failure deterministic finite automata 

    Nxumalo, Madoda; Kourie, Derrick G.; Cleophas, Loek; Watson, Bruce W. (South African Institute of Computer Scientists and Information Technologists, 2017)
    Failure deterministic finite automata (FDFAs) represent regular languages more compactly than deterministic finite automata (DFAs). Four algorithms that convert arbitrary DFAs to language-equivalent FDFAs are empirically ...
  • Identification of broadly neutralizing antibody epitopes in the HIV-1 envelope glycoprotein using evolutionary models 

    Lacerda, Miguel; Moore, Penny L.; Ngandu, Nobubelo K.; Seaman, Michael; Gray, Elin S.; Murrell, Ben; Krishnamoorthy, Mohan; Nonyane, Molati; Madiga, Maphuti; Wibmer, Constantinos K.; Sheward, Daniel; Bailer, Robert T.; Gao, Hongmei; Greene, Kelli M.; Karim, Salim S. A.; Mascola, John R.; Korber, Bette T. M.; Montefiori, David C.; Morris, Lynn; Williamson, Carolyn; Seoighe, Cathal; the CAVD-NSDP Consortium (BioMed Central, 2013-12-02)
    Background Identification of the epitopes targeted by antibodies that can neutralize diverse HIV-1 strains can provide important clues for the design of a preventative vaccine. Methods We ...