Stimulation discomfort comparison of asynchronous and synchronous methods with multi-field electrodes

Functional Electrical Stimulation (FES) is a technique that consists on applying electrical current pulses to artificially activate motor nerve fibers and produce muscle contractions to achieve functional movements. The main applications of FES are within the rehabilitation field, in which this technique is used to aid recovery or to restore lost motor functions. People that benefit of FES are usually patients with neurological disorders which result in motor dysfunctions; most common patients include stroke and spinal cord injury (SCI). Neuroprosthesis are devices that have their basis in FES technique, and their aim is to bridge interrupted or damaged neural paths between the brain and upper or lower limbs. One of the aims of neuroprosthesis is to artificially generate muscle contractions that produce functional movements, and therefore, assist impaired people by making them able to perform activities of daily living (ADL). FES applies current pulses and stimulates nerve fibers by means of electrodes, which can be either implanted or surface electrodes. Both of them have advantages and disadvantages. Implanted electrodes need open surgery to place them next to the nerve root, so these electrodes carry many disadvantages that are produced by the use of invasive techniques. In return, as the electrodes are attached to the nerve, they make it easier to achieve selective functional movements. On the contrary, surface electrodes are not invasive and are easily attached or detached on the skin. Main disadvantages of surface electrodes are the difficulty of selectively stimulating nerve fibers and uncomfortable feeling perceived by users due to sensory nerves located in the skin. Electrical stimulation surface electrode technology has improved significantly through the years and recently, multi-field electrodes have been suggested. This multi-field or matrix electrode approach brings many advantages to FES; among them it is the possibility of easily applying different stimulation methods and techniques. The main goal of this thesis is therefore, to test two stimulation methods, which are asynchronous and synchronous stimulation, in the upper limb with multi-field electrodes. To this end, a purpose-built wrist torque measuring system and a graphic user interface were developed to measure wrist torque produced with each of the methods and to efficiently carry out the experiments. Then, both methods were tested on 15 healthy subjects and sensitivity results were analyzed for different cases. Results show that there are significant differences between methods regarding sensation in some cases, which can affect effectiveness or success of FES.

Resetting asynchronous QDI systems

Quasi Delay-Insensitive (QDI) systems must be reset into a valid initial state before normal operation can start. Otherwise, deadlock may occur due to wrong handshake communication between processes. This thesis first reviews the traditional Global Reset Schemes (GRS). It then proposes a new Wave Reset Schemes (WRS). By utilizing the third possible value of QDI data codes - reset value, WRS propagates the data with reset value and triggers Local Reset (LR) sequentially. The global reset network for GRS can be removed and all reset signals are generated locally for each process. Circuits templates as well as some special blocks are modified to accommodate the reset value in WRS. An algorithm is proposed to choose the proper Local Reset Input (LRI) in order to shorten reset time. WRS is then applied to an iterative multiplier. The multiplier is proved working under different operating conditions.

Pharmacogenetics of MicroRNAs and MicroRNAs Biogenesis Machinery in Pediatric Acute Lymphoblastic Leukemia

Despite the clinical success of acute lymphoblastic leukemia (ALL) therapy, toxicity is frequent. Therefore, it would be useful to identify predictors of adverse effects. In the last years, several studies have investigated the relationship between genetic variation and treatment-related toxicity. However, most of these studies are focused in coding regions. Nowadays, it is known that regions that do not codify proteins, such as microRNAs (miRNAs), may have an important regulatory function. MiRNAs can regulate the expression of genes affecting drug response. In fact, the expression of some of those miRNAs has been associated with drug response. Genetic variations affecting miRNAs can modify their function, which may lead to drug sensitivity. The aim of this study was to detect new toxicity markers in pediatric B-ALL, studying miRNA-related polymorphisms, which can affect miRNA levels and function. We analyzed 118 SNPs in pre-miRNAs and miRNA processing genes in association with toxicity in 152 pediatric B-ALL patients all treated with the same protocol (LAL/SHOP). Among the results found, we detected for the first time an association between rs639174 in DROSHA and vomits that remained statistically significant after FDR correction. DROSHA had been associated with alterations in miRNAs expression, which could affect genes involved in drug transport. This suggests that miRNA-related SNPs could be a useful tool for toxicity prediction in pediatric B-ALL.

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.