Reconceptualising moderation in asynchronous online discussions using grounded theory.

This paper reports a grounded theory study of e-moderation of asynchronous online discussions, to explore the processes by which tutors in higher education decide when and how to e-moderate. It aims to construct a theory of e-moderation based on some key factors which appear to influence e-moderation. It discusses previous research on the definition and practice of e-moderation, and then describes the study, which involved four e-moderators working in two different university contexts. Key themes on e-moderation, which emerged using a grounded theory approach, are discussed. It proposes a paradigm framework for e-moderation and suggests that as a facilitative activity, it should be sufficiently contained within ‘a ring-fenced learning arena’. Factors outwith and inside the ring-fence which appear to influence e-moderation and their implications for future theory development and validation are discussed. Keywords: e-moderation; grounded theory; online learning; asynchronous discussions; ring-fence

Asynchronous Auction for Distributed Nonlinear Resource Allocation Problem

Resource Allocation Problems (RAPs) are concerned with the optimal allocation of resources to tasks. Problems in fields such as search theory, statistics, finance, economics, logistics, sensor & wireless networks fit this formulation. In literature, several centralized/synchronous algorithms have been proposed including recently proposed auction algorithm, RAP Auction. Here we present asynchronous implementation of RAP Auction for distributed RAPs.

dPAM: A Distributed Prefetching Protocol for Scalable Asynchronous Multicast in P2P Systems

We leverage the buffering capabilities of end-systems to achieve scalable, asynchronous delivery of streams in a peer-to-peer environment. Unlike existing cache-and-relay schemes, we propose a distributed prefetching protocol where peers prefetch and store portions of the streaming media ahead of their playout time, thus not only turning themselves to possible sources for other peers but their prefetched data can allow them to overcome the departure of their source-peer. This stands in sharp contrast to existing cache-and-relay schemes where the departure of the source-peer forces its peer children to go the original server, thus disrupting their service and increasing server and network load. Through mathematical analysis and simulations, we show the effectiveness of maintaining such asynchronous multicasts from several source-peers to other children peers, and the efficacy of prefetching in the face of peer departures. We confirm the scalability of our dPAM protocol as it is shown to significantly reduce server load.

Deterministic Computations Whose History Is Independent of the Order of Asynchronous Updating

Consider a network of processors (sites) in which each site x has a finite set N(x) of neighbors. There is a transition function f that for each site x computes the next state ξ(x) from the states in N(x). But these transitions (updates) are applied in arbitrary order, one or many at a time. If the state of site x at time t is η(x; t) then let us define the sequence ζ(x; 0); ζ(x; 1), ... by taking the sequence η(x; 0),η(x; 1), ... , and deleting each repetition, i.e. each element equal to the preceding one. The function f is said to have invariant histories if the sequence ζ(x; i), (while it lasts, in case it is finite) depends only on the initial configuration, not on the order of updates. This paper shows that though the invariant history property is typically undecidable, there is a useful simple sufficient condition, called commutativity: For any configuration, for any pair x; y of neighbors, if the updating would change both ξ(x) and ξ(y) then the result of updating first x and then y is the same as the result of doing this in the reverse order. This fact is derivable from known results on the confluence of term-rewriting systems but the self-contained proof given here may be justifiable.

Cache-and-Relay Streaming Media Delivery for Asynchronous Clients

We consider the problem of delivering popular streaming media to a large number of asynchronous clients. We propose and evaluate a cache-and-relay end-system multicast approach, whereby a client joining a multicast session caches the stream, and if needed, relays that stream to neighboring clients which may join the multicast session at some later time. This cache-and-relay approach is fully distributed, scalable, and efficient in terms of network link cost. In this paper we analytically derive bounds on the network link cost of our cache-and-relay approach, and we evaluate its performance under assumptions of limited client bandwidth and limited client cache capacity. When client bandwidth is limited, we show that although finding an optimal solution is NP-hard, a simple greedy algorithm performs surprisingly well in that it incurs network link costs that are very close to a theoretical lower bound. When client cache capacity is limited, we show that our cache-and-relay approach can still significantly reduce network link cost. We have evaluated our cache-and-relay approach using simulations over large, synthetic random networks, power-law degree networks, and small-world networks, as well as over large real router-level Internet maps.

Does the medium dictate the message? Cultivating communication in an asynchronous environment

Virtual learning environments (VLEs) are often perceived by education establishments as an opportunity to widen access without traditional overheads. An integral part of most VLEs is asynchronous computer conferencing and on-line moderators must help students migrate quickly to the new virtual environment to minimize learning disruption. This paper focuses on 21 new on-line moderators and reports their changing perceptions re their role and concerns, from their first appointment through to the end of the delivery of their first on-line course. The findings suggest that it is only after socialization occurs that information can be exchanged and lead to knowledge construction. These are supported by, and extend, prior research by Z Berge, R Mason, M Paulsen and G Salmon and are reinforced by empirical work with a further 19 new on-line moderators.

On Being Too Nice: Message Interaction in an Asynchronous Learning Network

The interact system model (ISM) is used to examine the interactions between messages submitted during online discussions related to a graduate education course in curriculum theory. Interactions are analyzed using complexity science and conclusions are drawn concerning structures that could enhance discussion and support the construction of collective understandings.

Asynchronous emergence by loggerhead turtle (Caretta caretta) hatchlings

For many decades it has been accepted that marine turtle hatchlings from the same nest generally emerge from the sand together. However, for loggerhead turtles (Caretta caretta) nesting on the Creek Island of Kefalonia, a more asynchronous pattern of emergence has been documented. By placing temperature loggers at the top and bottom of nests laid on Kefalonia during 1998, we examined whether this asynchronous emergence was related to the thermal conditions within nests. Pronounced thermal variation existed not only between, but also within, individual nests. These within-nest temperature differences were related to the patterns of hatchling emergence, with hatchlings from nests displaying large thermal ranges emerging over a longer time-scale than those characterised by more uniform temperatures. In many egg-laying animals, parental care of the offspring may continue while the eggs are incubating and also after they have hatched. Consequently, the importance of the nest site for determining incubation conditions may be reduced since the parents themselves may alter the local environment. By contrast, in marine turtles, parental care ceases once the eggs have been laid and the nest site covered. The positioning of the nest site, in both space and time, may therefore have profound effects for marine turtles by affecting, for example, the survival of the eggs and hatchlings as well as their sex (Janzen and Paukstis 1991).

Voltage Sensing Using an Asynchronous Charge-to-Digital Converter for Energy-Autonomous Environments

In future systems with relatively unreliable and unpredictable energy sources such as harvesters, the system power supply may become non-deterministic. For energy effective operations, Vdd is an important parameter in any meaningful system control mechanism. Reliable and accurate on-chip voltage sensors are therefore indispensible for the power and computation management of such systems. Existing voltage sensing methods are not suitable because they usually require a stable and known reference (voltage, current, time, frequency, etc.), which is difficult to obtain in this environment. This paper describes an autonomous reference-free voltage sensor designed using an asynchronous counter powered by the charge on a capacitor and a small controller. Unlike existing methods, the voltage information is directly generated as a digital code. The sensor, fabricated in the 180 nm technology node, was tested successfully through performing measurements over the voltage range from 1.8 V down to 0.8 V.

A frequency-domain receiver for asynchronous systems employing CP-assisted DS-CDMA schemes

In this paper we consider the uplink transmission within CP-assisted (Cyclic Pre¯x) DS-CDMA (Direct Sequence Code Division Multiple Access) systems and we present a frequency-domain MUD (MultiUser Detection) receiver with iterative estimation and compensation of residual frequency errors. The proposed receiver is suitable for broadband wireless systems, with performances that can be close to the single-user MFB (Matched Filter Bound), even for fully loaded systems and/or in the presence of strong interfering signals. The receiver is powerful enough for typical asynchronous scenarios, requiring only a coarse synchronization between users.

Categorising Asynchronous Discussion Threads: Improving the Quality of Student Learning

My paper will focus on the generative potential of categorising asynchronous discussion threads as one strategy for improving the quality of students’ learning in a blended learning module. The approach to categorisation is based on social network analysis using intuitively simple descriptors of message posting patterns e.g. passive facilitator, dominant facilitator, unresponsive star and formulaic discussion. The intention is to produce descriptively vivid illustrative examples of the categories and to begin to suggest affordances of the different participation patterns. Looking forward to the beginning of the next module, it is anticipated that discussion during the module of approaches to participating in asynchronous discussion will contribute to effective engagement patterns and deeper learning.