University of Victoria

About: University of Victoria is a education organization based out in Victoria, British Columbia, Canada. It is known for research contribution in the topics: Population & Galaxy. The organization has 14994 authors who have published 41051 publications receiving 1447972 citations. The organization is also known as: Victoria College.

Self-Regulation, Co-Regulation, and Shared Regulation in Collaborative Learning Environments

Abstract: Early socio-cognitive conceptions of self-regulated learning (SRL) emphasized individual, cognitive-constructive aspects involved in cognition, behavior, and motivation, as well as social context as a component in the triadic process of self-regulation. In this chapter, there are three primary modes of regulation in collaborative learning: self-regulated learning, [socially] shared regulation of learning, and co-regulated learning. The following revisions to those constructs more adequately address conceptual and empirical challenges emerging in the past few years. SRL became a cornerstone for exploring more social forms of regulation such as co-regulation and shared regulation. Co-regulation occurs when affordances or constraints are appropriated by individuals (self-regulation) or groups (shared regulation) to fundamentally provoke strategic monitoring, evaluating, or adapting of motivational, behavioral, cognitive, and/or affective products within and across phases of regulation. Shared regulation can be successfully promoted by scripting planning and reflection to: increase awareness of learning processes, externalize learning processes in a social plane, and activate key regulation processes.

The vertex separation and search number of a graph

Abstract: We relate two concepts in graph theory and algorithmic complexity, namely the search number and the vertex separation of a graph. Let s ( G ) denote the search number and vs ( G ) denote the vertex separation of a connected, undirected graph G . We show that vs ( G ) ≤ s ( G ) ≤ vs ( G ) + 2 and we give a simple transformation from G to G′ such that vs ( G′ ) = s ( G ). We characterize those trees having a given vertex separation and describe the smallest such trees. We also note that there exist trees for which the difference between search number and vertex separation is indeed 2. We give algorithms that, for any tree T , compute vs ( T ) in linear time and compute an optimal layout with respect to vertex separation in time O ( n log n ). Vertex separation has previously been related to progressive black / white pebble demand and has been shown to be identical to a variant of search number, node search number , and to path width , which has been related to gate matrix layout cost . All these properties are known to be computationally intractable. For fixed k , an O ( n log 2 n ) algorithm is known which decides whether a graph has path width at most k .