Efficient unification is considered within the context of logic programming. Unification is explained in terms of equivalence classes made up of terms, where there is a constraint that no equivalence class may contain more than one function term. It is demonstrated that several well-known "efficient" but nonlinear unification algorithms continually maintain the said constraint as a consequence of their choice of data structure for representing equivalence classes. The linearity of the Paterson-Wegman unification algorithm is shown largely to be a consequence of its use of unbounded lists of pointers for representing equivalences between terms, which allows it to avoid the nonlinearity of "union-find".

Sustainability requires a new pathway and our industry must evolve to be a contributor to finding the right answer, rather than delivering the trusted solutions that have served us well in an industry of unconstrained resources. Aspiration of initiating a dialogue about our professional responsibility: the dialogue must engage with matters beyond engineering and find relevance in the disparate academic research, to drive the pragmatic decision making required by industry. / Dissertation (MArch(Prof))--University of Pretoria, 2009. / Architecture / unrestricted

With the developments in computing and communication technologies, wireless sensor networks have become popular in wide range of application areas such as health, military, environment and habitant monitoring. Moreover, wireless acoustic sensor networks have been widely used for target tracking applications due to their passive nature, reliability and low cost. Traditionally, acoustic sensor arrays built in linear, circular or other regular shapes are used for tracking acoustic sources. The maintaining of relative geometry of the acoustic sensors in the array is vital for accurate target tracking, which greatly reduces the flexibility of the sensor network. To overcome this limitation, we propose using only a single acoustic sensor at each sensor node. This design greatly improves the flexibility of the sensor network and makes it possible to deploy the sensor network in remote or hostile regions through air-drop or other stealth approaches. Acoustic arrays are capable of performing the target localization or generating the bearing estimations on their own. However, with only a single acoustic sensor, the sensor nodes will not be able to generate such measurements. Thus, self-organization of sensor nodes into virtual arrays to perform the target localization is essential. We developed an energy-efficient and distributed self-organization algorithm for target tracking using wireless acoustic sensor networks. The major error sources of the localization process were studied, and an energy-aware node selection criterion was developed to minimize the target localization errors. Using this node selection criterion, the self-organization algorithm selects a near-optimal localization sensor group to minimize the target tracking errors. In addition, a message passing protocol was developed to implement the self-organization algorithm in a distributed manner. In order to achieve extended sensor network lifetime, energy conservation was incorporated into the self-organization algorithm by incorporating a sleep-wakeup management mechanism with a novel cross layer adaptive wakeup probability adjustment scheme. The simulation results confirm that the developed self-organization algorithm provides satisfactory target tracking performance. Moreover, the energy saving analysis confirms the effectiveness of the cross layer power management scheme in achieving extended sensor network lifetime without degrading the target tracking performance.

abstract: I present my work on a scalable and programmable I/O controller for region-based computing, which will be used in a rhythmic pixel-based camera pipeline. I provide a breakdown of the development and design of the I/O controller and how it fits in to rhythmic pixel regions, along with a studyon memory traffic of rhythmic pixel regions and how this translates to energy efficiency. This rhythmic pixel region-based camera pipeline has been jointly developed through Dr. Robert LiKamWa’s research lab. High spatiotemporal resolutions allow high precision for vision applications, such as for detecting features for augmented reality or face detection. High spatiotemporal resolution also comes with high memory throughput, leading to higher energy usage. This creates a tradeoff between high precision and energy efficiency, which becomes more important in mobile systems. In addition, not all pixels in a frame are necessary for the vision application, such as pixels that make up the background. Rhythmic pixel regions aim to reduce the tradeoff by creating a pipeline that allows an application developer to specify regions to capture at a non-uniform spatiotemporal resolution. This is accomplished by encoding the incoming image, and only sending the pixels within these specified regions. Later these encoded representations will be decoded to a standard frame representation usable by traditional vision applications. My contribution to this effort has been the design, testing and evaluation of the I/O controller. / Dissertation/Thesis / Masters Thesis Computer Science 2020

Power management is an active area of research in wireless sensor networks (WSNs). Efficient power management is necessary because WSNs are battery-operated devices that can be deployed in mission-critical applications. From the communications perspective, one main approach to reduce energy is to maximize throughput so the data can be transmitted in a short amount of time. Frame fragmentation techniques aim to achieve higher throughput by reducing retransmissions. Using experiments on a WSN testbed, we show that frame fragmentation helps to reduce energy consumption. We then study and compare recent frame fragmentation schemes to find the most energy-efficient scheme. Our main contribution is to propose a new frame fragmentation scheme that is optimized to be energy efficient, which is originated from the chosen frame fragmentation scheme. This new energy-efficient frame fragmentation protocol is called (Green-Frag). Green-Frag uses an algorithm that gives sensor nodes the ability to transmit data with optimal transmit power and optimal frame structure based on environmental conditions. Green-Frag takes into consideration the channel conditions, interference patterns and level, as well as the distance between sender and receiver. The thesis discusses various design and implementation considerations for Green-Frag. Also, it shows empirical results of comparing Green-Frag with other frame fragmentation protocols in terms of energy efficiency. Green-Frag performance results shows that it is capable of choosing the best transmit according to the channel conditions. Subsequently, Green-Frag achieves the least energy consumption in all environmental conditions.

Heterogeneous multicore processors offer an energy-efficient alternative to homogeneous multicores. Typically, heterogeneous multi-core refers to a system with more than one core where all the cores use a single ISA but differ in one or more micro-architectural configurations. A carefully designed multicore system consists of cores of diverse power and performance profiles. During execution, an application is run on a core that offers the best trade-off between performance and energy-efficiency. Since the resource needs of an application may vary with time, so does the optimal core choice. Moving a thread from one core to another involves transferring the entire processor state and cache warm-up. Frequent migration leads to large performance overhead, negating any benefits of migration. Infrequent migration on the other hand leads to missed opportunities. Thus, reducing overhead of migration is integral to harnessing benefits of heterogeneous multicores. \par This work proposes \textit{AdaCore}, a novel core architecture which pushes the heterogeneity exploited in the heterogeneous multicore into a single core. \textit{AdaCore} primarily addresses the resource bottlenecks in workloads. The design attempts to adaptively match the resource demands by reconfiguring on-chip resources at a fine-grain granularity. The adaptive core morphing allows core configurations with diverse power and performance profiles within a single core by adaptive voltage, frequency and resource reconfiguration. Towards this end, the proposed novel architecture while providing energy savings, improves performance with a low overhead in-core reconfiguration. This thesis further compares \textit{AdaCore} with a standard Out-of-Order core with capability to perform Dynamic Voltage and Frequency Scaling (DVFS) designed to achieve energy efficiency. The results presented in this thesis indicate that the proposed scheme can improve the performance/Watt of application, on average, by 32\% over a static out-of-order core and by 14\% over DVFS. The proposed scheme improves $IPS^{2}/Watt$ by 38\% over static out-of-order core.

No abstract / Dissertation MCom--University of Pretoria, 2013. / hb2014 / Taxation / unrestricted

The dissertation examined the effect of cryptocurrencies on the portfolio risk-adjusted returns of traditional and alternative investments using daily arithmetic returns from August 2015 to October 2018 of traditional assets (South African stocks, bonds, currencies), alternative assets (commodities, South African real estate) and cryptocurrencies (Cryptocurrency index (CRIX) and ten other individual cryptocurrencies). This is worth investigating as cryptocurrencies have been performing well while the listed equities in South Africa and most alternative investments have been underperforming (Srilakshmi & Karpagam, 2017). The mean-variance analysis, the Sharpe ratio, the conditional value-at-risk (CVaR) and the mean-variance spanning techniques were employed to analyse the data. The spanning test carried out was the multivariate ordinary least squares (OLS) regression Wald test. The research findings showed that the inclusion of cryptocurrencies in a portfolio of investments improves the efficient frontier of the portfolio of investments and the portfolio of investments risk-adjusted returns. Moreover, the findings suggested that cryptocurrencies are good portfolio diversification assets. However, investments in cryptocurrencies should be made with caution as the risks of investments are high in relation to traditional and alternative investments. The findings of this study advocate for individual and institutional investors to include cryptocurrencies within their South African portfolio of traditional and alternative investments.

Subject of the diploma project is to design nursing home for elder people. The thesis is based on architectural study that I worked out in my previous studies (Studio 3). The diploma project takes over basic parameters of that study - programme, location and vision of the project. However, due to the newly set goals the thesis assumes a completely new design.   The aim of the diploma project is integrated architectural, structural and energy design. The goal of the thesis is to design the building in the passive standard. This means achieving values:   the annual heat demand < 15 kWh per m² of floor area, the annual demand of primary energy < 60 kWh per m² of floor area, air temperature in rooms < 27°C.   The thesis assumes that the above ground parts of the building will be designed as wooden-structured; with exceptions where other solution would be more suitable (e.g. the entrance section of the building).

A set S = {u1, u2,..., ut} of vertices of G is an efficient dominating set if every vertex of G is dominated exactly once by the vertices of S. Letting Ui denote the set of vertices dominated by ui, we note that {U1, U2,... Ut} is a partition of the vertex set of G and that each Ui contains the vertex ui and all the vertices at distance 1 from it in G. In this paper, we generalize the concept of efficient domination by considering k-efficient domination partitions of the vertex set of G, where each element of the partition is a set consisting of a vertex ui and all the vertices at distance di from it, where di ∈ {0, 1,..., k}. For any integer k ≥ 0, the k-efficient domination number of G equals the minimum order of a k-efficient partition of G. We determine bounds on the k-efficient domination number for general graphs, and for k ∈ {1, 2}, we give exact values for some graph families. Complexity results are also obtained.