Lateral hyperstriatal lesions disrupt simultaneous but not successive conditional discrimination learning of pigeons (Columba livia).

Explored, in 2 experiments, the effects of lateral vs medial laminar lesions of the hyperstriatum in pigeons; medial lesions were largely confined to the hyperstriatum accessorium, and lateral lesions to the hyperstriatum dorsale and hyperstriatum ventrale. In Exp 1, lateral, but not medial, lesions disrupted acquisition of a simultaneous conditional discrimination; both medial and lateral lesions disrupted reversal of the discrimination. The reversal deficits of the medial and lateral groups were quantitatively similar, and both groups showed exaggerated positional responding. In Exp 2, neither medial nor lateral lesions disrupted acquisition of a successive conditional discrimination. Lateral hyperstriatal damage does not obtain a general disruption of conditional learning; it is speculated that the lateral hyperstriatum may play a critical role in configural learning. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

REST Eye for the SOA Guy

This paper discusses the representational state transfer (REST) and service-oriented architecture (SOA) debate. The author tries to explain REST from the viewpoint of someone steeped in SOA, with the intention of helping SOA people understand the value the REST camp so rightfully touts     

Factors influencing learning through play in ICT settings

Using a mixed method approach of questionnaires, observations and field notes, the authors have studied a number of settings during the past two years which have focussed on the development of ICT capability through play. Some of these have involved children identified as disaffected or disadvantaged, whilst others have involved initial teacher education students. In this paper, we consider some of the results obtained from the most recent of these settings, relate these to those obtained from the other settings, and explore further a number of inter-related issues which have arisen from the analysis. We particularly focus on the effect of learners’ self-esteem and self-efficacy; the influence of gender-related characteristics; the role of interaction between learners during activity; and the value of reflection.     

Fourth International Conference on Durability of Building Materials and Components

RILEM Bulletin

Fourth International Conference on Durability of Building Materials and Components     

How to find Steiner minimal trees in euclideand-space

This paper has two purposes. The first is to present a new way to find a Steiner minimum tree (SMT) connectingN sites ind-space,d >- 2. We present (in Appendix 1) a computer code for this purpose. This is the only procedure known to the author for finding Steiner minimal trees ind-space ford > 2, and also the first one which fits naturally into the framework of backtracking and branch-and-bound. Finding SMTs of up toN = 12 general sites ind-space (for anyd) now appears feasible.We tabulate Steiner minimal trees for many point sets, including the vertices of most of the regular and Archimedeand-polytopes with <- 16 vertices. As a consequence of these tables, the Gilbert-Pollak conjecture is shown to be false in dimensions 3–9. (The conjecture remains open in other dimensions; it is probably false in all dimensionsd withd 3, but it is probably true whend = 2.)The second purpose is to present some new theoretical results regarding the asymptotic computational complexity of finding SMTs to precision .We show that in two-dimensions, Steiner minimum trees may be found exactly in exponential time O(C ^N ) on a real RAM. (All previous provable time bounds were superexponential.) If the tree is only wanted to precision , then there is an (N/)^O(N)-time algorithm, which is subexponential if 1/ grows only polynomially withN. Also, therectilinear Steiner minimal tree ofN points in the plane may be found inN ^O(N) time.J. S. Provan devised an O(N ⁶/⁴)-time algorithm for finding the SMT of a convexN-point set in the plane. (Also the rectilinear SMT of such a set may be found in O(N ⁶) time.) One therefore suspects that this problem may be solved exactly in polynomial time. We show that this suspicion is in fact true—if a certain conjecture about the size of Steiner sensitivity diagrams is correct.All of these algorithms are for a real RAM model of computation allowing infinite precision arithmetic. They make no probabilistic or other assumptions about the input; the time bounds are valid in the worst case; and all our algorithms may be implemented with a polynomial amount of space. Only algorithms yielding theexact optimum SMT, or trees with lengths (1 + ) × optimum, where is arbitrarily small, are considered here.