Residential real estate forecasting has become a part of the larger process of business planning and strategic management. Several studies of housing price trends recommend confining statistical analysis to repeated sales of residential property. This study presents an alternate methodology which combines information only on repeated residential sales regardless of the changes that has been made in the house in-between the sales. Additive and multiplicative models were used to forecast the residential property prices in Nelson Mandela Metropole. Data was collected from various sources and was reconciled into one data set for analysis through a process of data screening.

The method of paired comparisons is seen as a technique used to rank a set of objects with respect to an abstract or immeasurable property. To do this, the objects get to be compared two at a time. The results are input into a model, resulting in numbers known as weights being assigned to the objects. The weights are then used to rank the objects. The method of paired comparisons was first used for psychometric investigations. Various other applications of the method are also present, for example economic applications, and applications in sports statistics. This study involves taking paired comparison models and making them time-dependent. Not much research has been done in this area. Three new time series models for paired comparisons are created. Simulations are done to support the evidence obtained, and theoretical as well as practical examples are given to illustrate the results and to verify the efficiency of the new models. A literature study is given on the method of paired comparisons, as well as on the areas in which we apply our models. Our first two time series models for paired comparisons are the Linear-Trend Bradley- Terry Model and the Sinusoidal Bradley-Terry Model. We use the maximum likelihood approach to solve these models. We test our models using exact and randomly simulated data for various time periods and various numbers of objects. We adapt the Linear-Trend Bradley-Terry Model and received our third time series model for paired comparisons, the Log Linear-Trend Bradley-Terry Model. The daily maximum and minimum temperatures were received for Port Elizabeth, Uitenhage and Coega for 2005 until 2009. To evaluate the performance of the Linear-Trend Bradley-Terry Model and the Sinusoidal Bradley-Terry Model on estimating missing temperature data, we artificially remove observations of temperature from Coega’s temperature dataset for 2006 until 2008, and use various forms of these models to estimate the missing data points. The exchange rates for 2005 until 2008 between the following currencies: the Rand, Dollar, Euro, Pound and Yen, were obtained and various forms of our Log Linear-Trend Bradley-Terry Model are used to forecast the exchange rate for one day ahead for each month in 2006 until 2008. One of the features of this study is that we apply our time series models for paired comparisons to areas which comprise non-standard paired comparisons; and we want to encourage the use of the method of paired comparisons in a broader sense than what it is traditionally used for. The results of this study can be used in various other areas, like for example, in sports statistics, to rank the strength of sports players and predict their future scores; in Physics, to calculate weather risks of electricity generation, particularly risks related to nuclear power plants, and so forth, as well as in many other areas. It is hoped that this research will open the door to much more research in combining time series analysis with the method of paired comparisons.

The effect of semantic satiation of the mediator on A-C learning was investigated in the A-B, B-C, A-C mediation paradigm. The possibility of evaluating the "pseudomediation" proposal is discussed. Two experiments were conducted, both yielding the same results: mediated pairs were learned more easily than non-mediated pairs, and satiation did not appear to have any effect. The "pseudomediation" hypothesis was not tested, and several explanations are offered for the apparent failure of satiation. / Arts, Faculty of / Psychology, Department of / Graduate

No description available.

No description available.

A paired-associate list of three-word stimuli and one-word responses comprised the first list of an A-B, A-Br paradigm. Each of the three words from the first-list three-word stimuli was singly re-paired with first-list responses to make up three of the second-list conditions. The fourth second-list condition used the first-list stimuli plus re-paired first-list responses. Results obtained were that: (a) nine of the sixteen subjects spontaneously shifted encoding cues from first to second lists, (b) evidence of significantly greater negative transfer occurred only in the A-B, A1 2 3-Br condition, and (c) although not attaining significance level, across all A -Br conditions there were more errors on second-list learning for those not shifting encoding cues from first to second list. For those who did shift, performance was only slightly lower than the A-B, C-B control condition. Neither the encoding variability nor the associative variability theory was entirely supported. A gestalt interpretation was suggested.

An experiment was conducted in order to distinguish between semantic elaboration and interacting imagery theories of children's linked noun pair learning. Grades 2 and 6 students were presented with sixteen pairs of nouns linked by different types of connectives and following learning set presentation were required to recall the second noun of each pair upon presentation of the first. One third of the Ss in each grade were asked to form visual images of the two nouns of each pair (Imagery Prompting condition); one third were instructed to form interacting images of each pair (Imagery Training condition); and the remaining Ss were given no special instruction (No Training condition). Results from the experiment showed No Training and Imagery Training Ss to be unaffected by the type of connective employed to link the pairs. However, those Ss in the Imagery Prompting condition recalled significantly more pairs linked by interaction suggesting links (i.e., verbs and interaction suggesting prepositions) relative to pairs linked by connectives which did not suggest a physical interaction (i.e., conjunctions and non-interaction suggesting prepositions). The results were interpreted as favouring an interacting imagery rather than semantic elaboration theory of children's linked noun pair learning. / Arts, Faculty of / Psychology, Department of / Graduate

In this paper, we continue the study of the domination game in graphs introduced by Brešar, Klavžar, and Rall [SIAM J. Discrete Math. 24 (2010) 979-991]. We study the paired-domination version of the domination game which adds a matching dimension to the game. This game is played on a graph G by two players, named Dominator and Pairer. They alternately take turns choosing vertices of G such that each vertex chosen by Dominator dominates at least one vertex not dominated by the vertices previously chosen, while each vertex chosen by Pairer is a vertex not previously chosen that is a neighbor of the vertex played by Dominator on his previous move. This process eventually produces a paired-dominating set of vertices of G; that is, a dominating set in G that induces a subgraph that contains a perfect matching. Dominator wishes to minimize the number of vertices chosen, while Pairer wishes to maximize it. The game paired-domination number γgpr(G) of G is the number of vertices chosen when Dominator starts the game and both players play optimally. Let G be a graph on n vertices with minimum degree at least 2. We show that γgpr(G) ≤ 45 n, and this bound is tight. Further we show that if G is (C4, C5)-free, then γgpr(G) ≤ 43 n, where a graph is (C4, C5)-free if it has no induced 4-cycle or 5-cycle. If G is 2-connected and bipartite or if G is 2-connected and the sum of every two adjacent vertices in G is at least 5, then we show that γgpr(G) ≤ 34 n.

Given a digraph D = (V, A), with vertex set V and arc set A, a set S ⊆ V is a dominating set if for every vertex v in V \ S, there are a vertex u in S and an arc (u, v) from u to v. In this chapter we consider the counterparts in directed graphs of independent, dominating, independent dominating, and total dominating sets in undirected graphs.

A set S of vertices in a graph G is a paired dominating set if every vertex of G is adjacent to a vertex in S and the subgraph induced by S contains a perfect matching (not necessarily as an induced subgraph). The minimum cardinality of a paired dominating set of G is the paired domination number of G. This chapter presents a survey of the major results on paired domination with an emphasis on bounds for the paired domination number.