Yhdessä ajattelu ja osallistuminen : Interventiotutkimus yhteistoiminnallisen oppimisen kehittymisestä kahdessa alakoulun pienryhmässä

Participation and social modes of thinking - An intervention study on the development of collaborative learning in two primary school small groups This study explores the thinking together -intervention programme in three primary school classes. The object of the intervention was to teach pupils to use exploratory talk in small group collaboratory learning. Exploratory talk is a type of talk in which joint reasoning is made explicit. Research has shown that exploratory talk can improve mathematics and science learning, argumentative skills and competence in reasoning tests. The object of this study was to investigate the theory of social modes of thinking which the intervention program is based on. I tried to find out how the thinking together -intervention programme suits the Finnish context. Therefore my study is part of an international research project of interventions that have been implemented for example in Great-Britain and in Mexico. One essential drawback in former research made on thinking together -approach is that the nature of participation has not been studied properly. In this study I also examine how the nature of participation develops in small groups. In addition to that I aim to develope a theoretical framework which includes both the perspectives of the social modes of thinking and the nature of participation. The perspective of this study is sociocultural. The research material consists of video recordings of collaborative learning tasks of two small groups. In groups there were pupils of age groups 9 - 11. I study the nature of participation using both qualitative and quantitative methods. Quantitative methods include for example IR-analysis method and counting of turns at talk and words. I also use qualitative content analysis to analyze both the nature of participation and social modes of thinking. As a result of my study I found out that the interaction of the other group was leadership based and in the other group the interaction was without leadership relations. In both groups the participation was quantitatively more symmetrical in the end of the intervention. In the group in which the interaction was leadership based the participation of the pupils was more symmetrical. Exploratory talk was found more in the group without leadership relations, but in both groups the amount of exploratory talk was increased during the intervention. Leadership based interaction was further divided into interaction of alienating and inclusive leadership according to how symmetrical the participation was in the dialogue. Exploratory talk was found only when the leadership was inclusive or the interaction was without leadership relations. The main result of the study was that the exploratory talk was further divided into four subcategories according to the nature of participation. In open and inclusive exploratory talk all group members participated initiatively and their initiatives were responded by others. In closed and uneven exploratory talk some group members couldn't participate properly. Therefore it cannot be said that exploratory talk guarantees symmetrical participation. The nature of participation must be investigated separately.

An explicit finite element modelling method for masonry walls under out-of-plane loading

An explicit finite element modelling method is formulated using a layered shell element to examine the behaviour of masonry walls subject to out-of-plane loading. Masonry is modelled as a homogenised material with distinct directional properties that are calibrated from datasets of a “C” shaped wall tested under pressure loading applied to its web. The predictions of the layered shell model have been validated using several out-of-plane experimental datasets reported in the literature. Profound influence of support conditions, aspect ratio, pre-compression and opening to the strength and ductility of masonry walls is exhibited from the sensitivity analyses performed using the model.

Implicit and explicit interactions in video mediated collaboration

In this paper we report the results of a study comparing implicit-only and explicit-only interactions in a collaborative, video-mediated task with shared content. Expanding on earlier work which has typically only evaluated how implicit interaction can augment primarily explicit systems, we report issues surrounding control, anxiousness and negotiation in the context of video mediated collaboration. We conclude that implicit interaction has the potential to improve collaborative work, but that there are a multitude of issues that must first be negotiated.

A generic individual-based spatially explicit model as a novel tool for investigating insect-plant interactions: A case study of the behavioural ecology of frugivorous Tephritidae

Computational modelling of mechanisms underlying processes in the real world can be of great value in understanding complex biological behaviours. Uptake in general biology and ecology has been rapid. However, it often requires specific data sets that are overly costly in time and resources to collect. The aim of the current study was to test whether a generic behavioural ecology model constructed using published data could give realistic outputs for individual species. An individual-based model was developed using the Pattern-Oriented Modelling (POM) strategy and protocol, based on behavioural rules associated with insect movement choices. Frugivorous Tephritidae (fruit flies) were chosen because of economic significance in global agriculture and the multiple published data sets available for a range of species. The Queensland fruit fly (Qfly), Bactrocera tryoni, was identified as a suitable individual species for testing. Plant canopies with modified architecture were used to run predictive simulations. A field study was then conducted to validate our model predictions on how plant architecture affects fruit flies’ behaviours. Characteristics of plant architecture such as different shapes, e.g., closed-canopy and vase-shaped, affected fly movement patterns and time spent on host fruit. The number of visits to host fruit also differed between the edge and centre in closed-canopy plants. Compared to plant architecture, host fruit has less contribution to effects on flies’ movement patterns. The results from this model, combined with our field study and published empirical data suggest that placing fly traps in the upper canopy at the edge should work best. Such a modelling approach allows rapid testing of ideas about organismal interactions with environmental substrates in silico rather than in vivo, to generate new perspectives. Using published data provides a saving in time and resources. Adjustments for specific questions can be achieved by refinement of parameters based on targeted experiments.

Explicit Construction of Optimal Exact Regenerating Codes for Distributed Storage

Erasure coding techniques are used to increase the reliability of distributed storage systems while minimizing storage overhead. Also of interest is minimization of the bandwidth required to repair the system following a node failure. In a recent paper, Wu et al. characterize the tradeoff between the repair bandwidth and the amount of data stored per node. They also prove the existence of regenerating codes that achieve this tradeoff. In this paper, we introduce Exact Regenerating Codes, which are regenerating codes possessing the additional property of being able to duplicate the data stored at a failed node. Such codes require low processing and communication overheads, making the system practical and easy to maintain. Explicit construction of exact regenerating codes is provided for the minimum bandwidth point on the storage-repair bandwidth tradeoff, relevant to distributed-mail-server applications. A sub-space based approach is provided and shown to yield necessary and sufficient conditions on a linear code to possess the exact regeneration property as well as prove the uniqueness of our construction. Also included in the paper, is an explicit construction of regenerating codes for the minimum storage point for parameters relevant to storage in peer-to-peer systems. This construction supports a variable number of nodes and can handle multiple, simultaneous node failures. All constructions given in the paper are of low complexity, requiring low field size in particular.

Optimal explicit guidance of multistage launch vehicle along three-dimensional trajectory

Details of an efficient optimal closed-loop guidance algorithm for a three-dimensional launch are presented with simulation results. Two types of orbital injections, with either true anomaly or argument of perigee being free at injection, are considered. The resulting steering-angle profile under the assumption of uniform gravity lies in a canted plane which transforms a three-dimensional problem into an equivalent two-dimensional one. Effects of thrust are estimated using a series in a recursive way. Encke's method is used to predict the trajectory during powered flight and then to compute the changes due to actual gravity using two gravity-related vectors. Guidance parameters are evaluated using the linear differential correction method. Optimality of the algorithm is tested against a standard ground-based trajectory optimization package. The performance of the algorithm is tested for accuracy, robustness, and efficiency for a sun-synchronous mission involving guidance for a multistage vehicle that requires large pitch and yaw maneuver. To demonstrate applicability of the algorithm to a range of missions, injection into a geostationary transfer orbit is also considered. The performance of the present algorithm is found to be much better than others.

Analysis of the evanescent field coupling between a fiber and a planar waveguide using the explicit finite difference method with a nonuniform mesh (Journal Paper)

We investigate an optical waveguide system consisting of an unclad fiber core suspended at a constant distance parallel to the surface of a planar waveguide. The coupling and propagation of light in the combined system is studied using the three-dimensional explicit finite difference beam propagation method with a nonuniform mesh configuration. The power loss in the fiber and the field distribution in the waveguide are studied as a function of various parameters, such as index changes, index profile, and propagation distance, for the combined system.

Optimal explicit terminal guidance for a launch vehicle

It is observed that general explicit guidance schemes exhibit numerical instability close to the injection point. This difficulty is normally attributed to the demand for exact injection which, in turn, calls for finite corrections to be enforced in a relatively short time. The deviations in vehicle state which need corrective maneuvers are caused by the off-nominal operating conditions. Hence, the onset of terminal instability depends on the type of off-nominal conditions encountered. The proposed separate terminal guidance scheme overcomes the above difficulty by minimizing a quadratic penalty on injection errors rather than demanding an exact injection. There is also a special requirement in the terminal phase for the faster guidance computations. The faster guidance computations facilitate a more frequent guidance update enabling an accurate terminal thrust cutoff. The objective of faster computations is realized in the terminal guidance scheme by employing realistic assumptions that are accurate enough for a short terminal trajectory. It is observed from simulations that one of the guidance parameters (P) related to the thrust steering angular rates can indicate the onset of terminal instability due to different off-nominal operating conditions. Therefore, the terminal guidance scheme can be dynamically invoked based on monitoring of deviations in the lone parameter P.

Explicit and Optimal Exact-Regenerating Codes for the Minimum-Bandwidth Point in Distributed Storage

In the distributed storage setting that we consider, data is stored across n nodes in the network such that the data can be recovered by connecting to any subset of k nodes. Additionally, one can repair a failed node by connecting to any d nodes while downloading beta units of data from each. Dimakis et al. show that the repair bandwidth d beta can be considerably reduced if each node stores slightly more than the minimum required and characterize the tradeoff between the amount of storage per node and the repair bandwidth. In the exact regeneration variation, unlike the functional regeneration, the replacement for a failed node is required to store data identical to that in the failed node. This greatly reduces the complexity of system maintenance. The main result of this paper is an explicit construction of codes for all values of the system parameters at one of the two most important and extreme points of the tradeoff - the Minimum Bandwidth Regenerating point, which performs optimal exact regeneration of any failed node. A second result is a non-existence proof showing that with one possible exception, no other point on the tradeoff can be achieved for exact regeneration.

The effect of traffic shaping in efficiently providing end-to-end performance guarantees

This paper reports new results concerning the capabilities of a family of service disciplines aimed at providing per-connection end-to-end delay (and throughput) guarantees in high-speed networks. This family consists of the class of rate-controlled service disciplines, in which traffic from a connection is reshaped to conform to specific traffic characteristics, at every hop on its path. When used together with a scheduling policy at each node, this reshaping enables the network to provide end-to-end delay guarantees to individual connections. The main advantages of this family of service disciplines are their implementation simplicity and flexibility. On the other hand, because the delay guarantees provided are based on summing worst case delays at each node, it has also been argued that the resulting bounds are very conservative which may more than offset the benefits. In particular, other service disciplines such as those based on Fair Queueing or Generalized Processor Sharing (GPS), have been shown to provide much tighter delay bounds. As a result, these disciplines, although more complex from an implementation point-of-view, have been considered for the purpose of providing end-to-end guarantees in high-speed networks. In this paper, we show that through ''proper'' selection of the reshaping to which we subject the traffic of a connection, the penalty incurred by computing end-to-end delay bounds based on worst cases at each node can be alleviated. Specifically, we show how rate-controlled service disciplines can be designed to outperform the Rate Proportional Processor Sharing (RPPS) service discipline. Based on these findings, we believe that rate-controlled service disciplines provide a very powerful and practical solution to the problem of providing end-to-end guarantees in high-speed networks.

Explicit codes uniformly reducing repair bandwidth in distributed storage

A distributed storage setting is considered where a file of size B is to be stored across n storage nodes. A data collector should be able to reconstruct the entire data by downloading the symbols stored in any k nodes. When a node fails, it is replaced by a new node by downloading data from some of the existing nodes. The amount of download is termed as repair bandwidth. One way to implement such a system is to store one fragment of an (n, k) MDS code in each node, in which case the repair bandwidth is B. Since repair of a failed node consumes network bandwidth, codes reducing repair bandwidth are of great interest. Most of the recent work in this area focuses on reducing the repair bandwidth of a set of k nodes which store the data in uncoded form, while the reduction in the repair bandwidth of the remaining nodes is only marginal. In this paper, we present an explicit code which reduces the repair bandwidth for all the nodes to approximately B/2. To the best of our knowledge, this is the first explicit code which reduces the repair bandwidth of all the nodes for all feasible values of the system parameters.

Explicit codes minimizing repair bandwidth for distributed storage

We consider the problem of minimizing the bandwidth required to repair a failed node when data is stored across n nodes in a distributed manner, so as to facilitate reconstruction of the entire data by connecting to any k out of the n nodes. We provide explicit and optimal constructions which permit exact replication of a failed systematic node.

On the explicit determination of the polar decomposition in n-dimensional vector spaces

A method for the explicit determination of the polar decomposition (and the related problem of finding tensor square roots) when the underlying vector space dimension n is arbitrary (but finite), is proposed. The method uses the spectral resolution, and avoids the determination of eigenvectors when the tensor is invertible. For any given dimension n, an appropriately constructed van der Monde matrix is shown to play a key role in the construction of each of the component matrices (and their inverses) in the polar decomposition.

Explicit Codes Uniformly Reducing Repair Bandwidth in Distributed Storage

A distributed storage setting is considered where a file of size B is to be stored across n storage nodes. A data collector should be able to reconstruct the entire data by downloading the symbols stored in any k nodes. When a node fails, it is replaced by a new node by downloading data from some of the existing nodes. The amount of download is termed as repair bandwidth. One way to implement such a system is to store one fragment of an (n, k) MDS code in each node, in which case the repair bandwidth is B. Since repair of a failed node consumes network bandwidth, codes reducing repair bandwidth are of great interest. Most of the recent work in this area focuses on reducing the repair bandwidth of a set of k nodes which store the data in uncoded form, while the reduction in the repair bandwidth of the remaining nodes is only marginal. In this paper, we present an explicit code which reduces the repair bandwidth for all the nodes to approximately B/2. To the best of our knowledge, this is the first explicit code which reduces the repair bandwidth of all the nodes for all feasible values of the system parameters.