Interoperability for eLearning Service Management and Provision

Learning Objects offer flexibility and adaptability for users to request personalised information for learning. There are standards to guide the development of learning objects. However, individual developers may customise these standards for serving different purposes when defining, describing, managing and providing learning objects, which are normally stored in heterogeneous repositories. Barriers to interoperability hinder sharing of learning services and subsequently affect quality of instructional design as learners expect to be able to receive their personalised learning content. All these impose difficulties to the users in getting the right information from the right sources. This paper investigates the interoperability issues in eLearning services management and provision and presents an approach to resolve interoperability at three levels.

Collaborative eLearning Assistant Network: caring agents are conscious agents

Would a research assistant - who can search for ideas related to those you are working on, network with others (but only share the things you have chosen to share), doesn’t need coffee and who might even, one day, appear to be conscious - help you get your work done? Would it help your students learn? There is a body of work showing that digital learning assistants can be a benefit to learners. It has been suggested that adaptive, caring, agents are more beneficial. Would a conscious agent be more caring, more adaptive, and better able to deal with changes in its learning partner’s life? Allow the system to try to dynamically model the user, so that it can make predictions about what is needed next, and how effective a particular intervention will be. Now, given that the system is essentially doing the same things as the user, why don’t we design the system so that it can try to model itself in the same way? This should mimic a primitive self-awareness. People develop their personalities, their identities, through interacting with others. It takes years for a human to develop a full sense of self. Nobody should expect a prototypical conscious computer system to be able to develop any faster than that. How can we provide a computer system with enough social contact to enable it to learn about itself and others? We can make it part of a network. Not just chatting with other computers about computer ‘stuff’, but involved in real human activity. Exposed to ‘raw meaning’ – the developing folksonomies coming out of the learning activities of humans, whether they are traditional students or lifelong learners (a term which should encompass everyone). Humans have complex psyches, comprised of multiple strands of identity which reflect as different roles in the communities of which they are part – so why not design our system the same way? With multiple internal modes of operation, each capable of being reflected onto the outside world in the form of roles – as a mentor, a research assistant, maybe even as a friend. But in order to be able to work with a human for long enough to be able to have a chance of developing the sort of rich behaviours we associate with people, the system needs to be able to function in a practical and helpful role. Unfortunately, it is unlikely to get a free ride from many people (other than its developer!) – so it needs to be able to perform a useful role, and do so securely, respecting the privacy of its partner. Can we create a system which learns to be more human whilst helping people learn?

Nitrogen recycling through the gut and the nitrogen economy of ruminants: An asynchronous symbiosis

The extensive development of the ruminant forestomach sets apart their N economy from that of nonruminants in a number of respects. Extensive pregastric fermentation alters the profile of protein reaching the small intestine, largely through the transformation of nitrogenous compounds into microbial protein. This process is fueled primarily by carbohydrate fermentation and includes extensive recycling of N between the body and gut lumen pools. Nitrogen recycling occurs via blood and gut lumen exchanges of urea and NH3, as well as endogenous gut and secretory N entry into the gut lumen, and the subsequent digestion and absorption of microbial and endogenous protein. Factors controlling urea transfer to the gut from blood, including the contributions of urea transporters, remain equivocal. Ammonia produced by microbial degradation of urea and dietary and endogenous AA is utilized by microbial fermentation or absorbed and primarily converted to urea. Therefore, microbial growth and carbohydrate fermentation affect the extent of NH3 absorption and urea N recycling and excretion. The extensive recycling of N to the rumen represents an evolutionary advantage of the ruminant in terms of absorbable protein supply during periods of dietary protein deficiency, or asynchronous carbohydrate and protein supply, but incurs a cost of greater N intakes, especially in terms of excess N excretion. Efforts to improve the efficiency of N utilization in ruminants by synchronizing fermentable energy and N availability have generally met with limited success with regards to production responses. In contrast, imposing asynchrony through oscillating dietary protein concentration, or infrequent supplementation, surprisingly has not negatively affected production responses unless the frequency of supplementation is less than once every 3 d. In some cases, oscillation of dietary protein concentration has improved N retention compared with animals fed an equal amount of dietary protein on a daily basis. This may reflect benefits of Orn cycle adaptations and sustained recycling of urea to the gut. The microbial symbiosis of the ruminant is inherently adaptable to asynchronous N and energy supply. Recycling of urea to the gut buffers the effect of irregular dietary N supply such that intuitive benefits of rumen synchrony in terms of the efficiency of N utilization are typically not observed in practice.

Performance of asynchronous channel assignment scheme in non-uniform and dynamic topology WLANs

Dense deployments of wireless local area networks (WLANs) are fast becoming a permanent feature of all developed cities around the world. While this increases capacity and coverage, the problem of increased interference, which is exacerbated by the limited number of channels available, can severely degrade the performance of WLANs if an effective channel assignment scheme is not employed. In an earlier work, an asynchronous, distributed and dynamic channel assignment scheme has been proposed that (1) is simple to implement, (2) does not require any knowledge of the throughput function, and (3) allows asynchronous channel switching by each access point (AP). In this paper, we present extensive performance evaluation of this scheme when it is deployed in the more practical non-uniform and dynamic topology scenarios. Specifically, we investigate its effectiveness (1) when APs are deployed in a nonuniform fashion resulting in some APs suffering from higher levels of interference than others and (2) when APs are effectively switched `on/off' due to the availability/lack of traffic at different times, which creates a dynamically changing network topology. Simulation results based on actual WLAN topologies show that robust performance gains over other channel assignment schemes can still be achieved even in these realistic scenarios.

An asynchronous channel assignment scheme: performance evaluation

Due to its popularity, dense deployments of wireless local area networks (WLANs) are becoming a common feature of many cities around the world. However, with only a limited number of channels available, the problem of increased interference can severely degrade the performance of WLANs if an effective channel assignment scheme is not employed. In an earlier work, we proposed an improved asynchronous distributed and dynamic channel assignment scheme that (1) is simple to implement, (2) does not require any knowledge of the throughput function, and (3) allows asynchronous channel switching by each access point (AP). In this paper, we present extensive performance evaluation of the proposed scheme in practical scenarios found in densely populated WLAN deployments. Specifically, we investigate the convergence behaviour of the scheme and how its performance gains vary with different number of available channels and in different deployment densities. We also prove that our scheme is guaranteed to converge in a single iteration when the number of channels is greater than the number of neighbouring APs.

Effectiveness of asynchronous channel assignment scheme in heterogeneous WLANs

Due to their popularity, dense deployments of wireless local area networks (WLANs) are becoming a common feature of many cities around the world. However, with only a limited number of channels available, the problem of increased interference can severely degrade the performance of WLANs if an effective channel assignment scheme is not employed. Previous studies on channel assignment in WLANs almost always assume that all access points (AP) employ the same channel assignment scheme which is clearly unrealistic. On the other hand, to the best of our knowledge, the interaction between different channel assignment schemes has also not been studied before. Therefore, in this paper, we investigate the effectiveness of our earlier proposed asynchronous channel assignment scheme in these heterogeneous WLANs scenarios. Simulation results show that our proposed scheme is still able to provide robust performance gains even in these scenarios.

An asynchronous distributed dynamic channel assignment scheme for dense WLANs

Wireless local area networks (WLANs) have changed the way many of us communicate, work, play and live. Due to its popularity, dense deployments are becoming a norm in many cities around the world. However, increased interference and traffic demands can severely limit the aggregate throughput achievable if an effective channel assignment scheme is not used. In this paper, we propose an enhanced asynchronous distributed and dynamic channel assignment scheme that is simple to implement, does not require any knowledge of the throughput function, allows asynchronous channel switching by each access point (AP) and is superior in performance. Simulation results show that our proposed scheme converges much faster than previously reported synchronous schemes, with a reduction in convergence time and channel switches by tip to 73.8% and 30.0% respectively.

Coupling cancellation based multiuser detector for asynchronous DS/CDMA

A three-shot multiuser detector is proposed for the reverse link of asynchronous DS/CDMA systems. By taking advantage of the preceding (already reconstructed) bit and the matched filter output for the following two bits, the coupling between temporally adjacent bits (TABs, which always exists for asynchronous systems) is cancelled in a three step fashion. The obtained detector has several useful advantages over existing schemes.

Synchronisation error resistant multiuser detection for asynchronous CDMA

Linear CDMA detectors have emerged as a promising solution to multiple access interference (MAI) suppression. Unfortunately, most existing linear detectors suffer from high sensitivity to synchronisation errors (also termed parameter estimation error), and synchronisation error resistant detectors have so far not been as widely investigated as they should have. This paper extends the minimum variance distortionless response (MVDR) detector, proposed previously by this author (Zheng 2000) for synchronous systems, to asynchronous systems. It has been shown that the MVDR structure is equally effective for asynchronous systems, especially for the weaker users.

Time diversity decorrelator (TDD); a near-far resistant detector for asynchronous CDMA system

Greater attention has been focused on the use of CDMA for future cellular mobile communications. CA near-far resistant detector for asynchronous code-division multiple-access (CDMA) systems operating in additive white Gaussian noise (AWGN) channels is presented. The multiuser interference caused by K users transmitting simultaneously, each with a specific signature sequence, is completely removed at the receiver. The complexity of this detector grows only linearly with the number of users, as compared to the optimum multiuser detector which requires exponential complexity in the number of users. A modified algorithm based on time diversity is described. It performs detection on a bit-by-bit basis and overcomes the complexity of using a sequence detector. The performance of this detector is shown to be superior to that of the conventional receiver.

Asynchronous flowering and within-plant flowering diversity in wheat and the implications for crop resilience to heat

Self-pollination dominates in wheat , with a small level of out-crossing due to flowering asynchrony and male sterility. However, the timing and synchrony of male and female flowering in wheat is a crucial determinant of seed set and may be an important factor affecting gene flow and resilience to climate change. Here, a methodology is presented for assessing the timing and synchrony of flowering in wheat. From the onset of flowering until the end of anthesis, the anther and stigma activity of each floret was assessed on the first five developing ears in potted plants grown under ambient conditions and originating from cv Paragon or cvs Spark-Rialto backgrounds. At harvest maturity, seed presence, size and weight was recorded for each floret scored. The synchrony between pollen dehiscence and stigma collapse within a flower was dependent on its relative position in a spike and within a floret. Determined on the basis of synchrony within each flower, the level of pollination by pollen originating from other flowers reached approximately 30% and did not change throughout the duration of flowering. A modelling exercise parameterised by flowering observations indicated that the temporal and spatial variability of anther activity within and between spikes may influence the relative resilience of wheat to sudden, extreme climatic events which has direct relevance to predicted future climate scenarios in the UK.

Fault tolerant decentralised K-Means clustering for asynchronous large-scale networks

The K-Means algorithm for cluster analysis is one of the most influential and popular data mining methods. Its straightforward parallel formulation is well suited for distributed memory systems with reliable interconnection networks, such as massively parallel processors and clusters of workstations. However, in large-scale geographically distributed systems the straightforward parallel algorithm can be rendered useless by a single communication failure or high latency in communication paths. The lack of scalable and fault tolerant global communication and synchronisation methods in large-scale systems has hindered the adoption of the K-Means algorithm for applications in large networked systems such as wireless sensor networks, peer-to-peer systems and mobile ad hoc networks. This work proposes a fully distributed K-Means algorithm (EpidemicK-Means) which does not require global communication and is intrinsically fault tolerant. The proposed distributed K-Means algorithm provides a clustering solution which can approximate the solution of an ideal centralised algorithm over the aggregated data as closely as desired. A comparative performance analysis is carried out against the state of the art sampling methods and shows that the proposed method overcomes the limitations of the sampling-based approaches for skewed clusters distributions. The experimental analysis confirms that the proposed algorithm is very accurate and fault tolerant under unreliable network conditions (message loss and node failures) and is suitable for asynchronous networks of very large and extreme scale.

Using non-personal computers for eLearning: Sri Lankan experience

Communal Internet access facilities or telecentres are considered a good way to provide connectivity to people who do not possess home connectivity. Attempts are underway to utilize telecentres as eLearning centres providing access to learning materials to students who would otherwise not be able to take up eLearning. This paper reports on the findings of qualitative interviews conducted with 18 undergraduate students from two Sri Lankan universities on their eLearning experiences using communal Internet access centres. The findings suggest that despite the efforts by telecentres to provide a good service to eLearners, there are various problems faced by students including: costs, logistics, scarcity of resources, connectivity speeds, excessive procedures, and lack of support. The experiences of these Sri Lankan students suggest that there is much that needs to be understood about user perspectives in using telecentres, which could help formulate better policies and strategies to support eLearners who depend on communal access facilities.