Design approaches in technology enhanced learning

Design is a critical to the successful development of any interactive learning environment (ILE). Moreover, in technology enhanced learning (TEL), the design process requires input from many diverse areas of expertise. As such, anyone undertaking tool development is required to directly address the design challenge from multiple perspectives. We provide a motivation and rationale for design approaches for learning technologies that draws upon Simon's seminal proposition of Design Science (Simon, 1969). We then review the application of Design Experiments (Brown, 1992) and Design Patterns (Alexander et al., 1977) and argue that a patterns approach has the potential to address many of the critical challenges faced by learning technologists

New Modularity of DAP-Kinases: Alternative Splicing of the DRP-1 Gene Produces a ZIPk-Like Isoform

DRP-1 and ZIPk are two members of the Death Associated Protein Ser/Thr Kinase (DAP-kinase) family, which function in different settings of cell death including autophagy. DAP kinases are very similar in their catalytic domains but differ substantially in their extra-catalytic domains. This difference is crucial for the significantly different modes of regulation and function among DAP kinases. Here we report the identification of a novel alternatively spliced kinase isoform of the DRP-1 gene, termed DRP-1β. The alternative splicing event replaces the whole extra catalytic domain of DRP-1 with a single coding exon that is closely related to the sequence of the extra catalytic domain of ZIPk. As a consequence, DRP-1β lacks the calmodulin regulatory domain of DRP-1, and instead contains a leucine zipper-like motif similar to the protein binding region of ZIPk. Several functional assays proved that this new isoform retained the biochemical and cellular properties that are common to DRP-1 and ZIPk, including myosin light chain phosphorylation, and activation of membrane blebbing and autophagy. In addition, DRP-1β also acquired binding to the ATF4 transcription factor, a feature characteristic of ZIPk but not DRP-1. Thus, a splicing event of the DRP-1 produces a ZIPk like isoform. DRP-1β is highly conserved in evolution, present in all known vertebrate DRP-1 loci. We detected the corresponding mRNA and protein in embryonic mouse brains and in human embryonic stem cells thus confirming the in vivo utilization of this isoform. The discovery of module conservation within the DAPk family members illustrates a parsimonious way to increase the functional complexity within protein families. It also provides crucial data for modeling the expansion and evolution of DAP kinase proteins within vertebrates, suggesting that DRP-1 and ZIPk most likely evolved from their ancient ancestor gene DAPk by two gene duplication events that occurred close to the emergence of vertebrates

Cognitive rehabilitation treatment for mental slowness in conversion disorder : A case report

Cognitive rehabilitation treatment (CRT) has been described in patients with brain injury, but it has not been attempted in cases of cognitive dysfunction without organic cause. This case report describes CRT of neurocognitive impairment in a 54-year-old female patient with conversion disorder (CD). She experienced difficulties with regard to speaking, motor function, and pain symptoms, which developed after stressful life circumstances. Baseline neuropsychological assessment (NPA) showed mental slowness and impaired (working) memory. Time Pressure Management (TPM) was used as CRT to teach the patient a compensatory strategy to overcome mental slowness in 12 sessions. During treatment, physical symptoms were monitored with the Physical Symptom Questionnaire (LKV), and mental slowness with the Mental Slowness Questionnaire (MSQ). After treatment, the LKV score dropped from 85 to 47, indicating 54% treatment response. Mental slowness showed improvement based on the MSQ and was confirmed by an NPA after treatment. Other neurocognitive functions improved as well and the motoric CD symptoms subsided. This case report suggests that improvement of mental slowness, as well as motor CD symptoms, can be achieved by TPM in non-organic neurocognitive impairment in CD. This finding has not been described in the literature. Further research is warranted to explore the efficacy of TPM in CD.Keywords: conversion disorder, neurocognitive impairment, cognitive rehabilitation treatment, time pressure management, pai

Improved Combination of Online Algorithms for Acceptance and Rejection

Given two admission control algorithms that are cA-accept- competitive and cR-reject-competitive respectively, we give two ways to make an algorithm that is simultaneously O(cA )- accept-competitive and O(cAcR)-reject-competitive. The combined algorithms make no reference to the o#ine optimal solution. In addition, one of the algorithms does not require knowing the value of either cA or cR . This improves on work of Azar, Blum, and Mansour, whose combined algorithm was O(c A )-accept-competitive, involved computing o#ine optimal solutions, and required knowing the values of both cA and cR

Combining online algorithms for acceptance and rejection

Abstract: Resource allocation and admission control are critical tasks in a communication network that often must be performed online. Algorithms for these types of problems have been considered both under benefit models (e.g., with a goal of approximately maximizing the number of requests accepted) and under cost models (e.g., with a goal of approximately minimizing the number of requests rejected). Unfortunately, algorithms designed for these two measures can often be quite different, even polar opposites. In this work we consider the problem of combining algorithms designed for each of these objectives in a way that is good under both measures simultaneously. More formally, we are given an algorithm A that is cA competitive with respect to the number of accepted requests and an algorithm R that is cR competitive with respect to the number of rejected requests. We show how to derive a combined algorithm with competitive ratio O(cRcA) for rejection and O(cA) for acceptance. We also build on known techniques to show that given a collection of k algorithms, we ca

Combining Online Algorithms for Acceptance and Rejection

Resource allocation and admission control are critical tasks in a communication network that often must be performed online. Algorithms for these types of problems have been considered both under benefit models (e.g., with a goal of approximately maximizing the number of requests accepted) and under cost models (e.g., with a goal of approximately minimizing the number of requests rejected). Unfortunately, algorithms designed for these two measures can often be quite different, even polar opposites. In this work we consider the problem of combining algorithms designed for each of these objectives in a way that is good under both measures simultaneously. More formally, we are given an algorithm A that is cA competitive with respect to the number of accepted requests and an algorithm R that is cR competitive with respect to the number of rejected requests. We show how to derive a combined algorithm with competitive ratio O(cRcA) for rejection and O(cA) for acceptance. We also build on known techniques to show that given a collection of k algorithms, we can construct one master algorithm that performs similarly to the best algorithm among the k for the acceptance problem and another master algorithm that performs similarly to the best algorithm among the k for the rejection problem. Using our main result we can combine the two master algorithms to a single algorithm that guarantees both rejection and acceptance competitiveness