The Computer as Coach: An Athletic Paradigm for Intellectual Education

Over the next five years, computer games will find their way into a vast number of American homes, creating a unique educational opportunity: the development of "computer coaches" for the serious intellectual skills required by some of these games. From the player's perspective, the coach will provide advice regarding strategy and tactics for better play. But, from the perspective of the coach, the request for help is an opportunity to tutor basic mathematical, scientific or other kinds of knowledge that the game exercises.

An Admission Control Paradigm for Real-time Databases

We propose and evaluate an admission control paradigm for RTDBS, in which a transaction is submitted to the system as a pair of processes: a primary task, and a recovery block. The execution requirements of the primary task are not known a priori, whereas those of the recovery block are known a priori. Upon the submission of a transaction, an Admission Control Mechanism is employed to decide whether to admit or reject that transaction. Once admitted, a transaction is guaranteed to finish executing before its deadline. A transaction is considered to have finished executing if exactly one of two things occur: Either its primary task is completed (successful commitment), or its recovery block is completed (safe termination). Committed transactions bring a profit to the system, whereas a terminated transaction brings no profit. The goal of the admission control and scheduling protocols (e.g., concurrency control, I/O scheduling, memory management) employed in the system is to maximize system profit. We describe a number of admission control strategies and contrast (through simulations) their relative performance.

Client-based Logging: A New Paradigm of Distributed Transaction Management

The proliferation of inexpensive workstations and networks has created a new era in distributed computing. At the same time, non-traditional applications such as computer-aided design (CAD), computer-aided software engineering (CASE), geographic-information systems (GIS), and office-information systems (OIS) have placed increased demands for high-performance transaction processing on database systems. The combination of these factors gives rise to significant challenges in the design of modern database systems. In this thesis, we propose novel techniques whose aim is to improve the performance and scalability of these new database systems. These techniques exploit client resources through client-based transaction management. Client-based transaction management is realized by providing logging facilities locally even when data is shared in a global environment. This thesis presents several recovery algorithms which utilize client disks for storing recovery related information (i.e., log records). Our algorithms work with both coarse and fine-granularity locking and they do not require the merging of client logs at any time. Moreover, our algorithms support fine-granularity locking with multiple clients permitted to concurrently update different portions of the same database page. The database state is recovered correctly when there is a complex crash as well as when the updates performed by different clients on a page are not present on the disk version of the page, even though some of the updating transactions have committed. This thesis also presents the implementation of the proposed algorithms in a memory-mapped storage manager as well as a detailed performance study of these algorithms using the OO1 database benchmark. The performance results show that client-based logging is superior to traditional server-based logging. This is because client-based logging is an effective way to reduce dependencies on server CPU and disk resources and, thus, prevents the server from becoming a performance bottleneck as quickly when the number of clients accessing the database increases.

Forewarding in Mobile Opportunistic Networks

Recent advances in processor speeds, mobile communications and battery life have enabled computers to evolve from completely wired to completely mobile. In the most extreme case, all nodes are mobile and communication takes place at available opportunities – using both traditional communication infrastructure as well as the mobility of intermediate nodes. These are mobile opportunistic networks. Data communication in such networks is a difficult problem, because of the dynamic underlying topology, the scarcity of network resources and the lack of global information. Establishing end-to-end routes in such networks is usually not feasible. Instead a store-and-carry forwarding paradigm is better suited for such networks. This dissertation describes and analyzes algorithms for forwarding of messages in such networks. In order to design effective forwarding algorithms for mobile opportunistic networks, we start by first building an understanding of the set of all paths between nodes, which represent the available opportunities for any forwarding algorithm. Relying on real measurements, we enumerate paths between nodes and uncover what we refer to as the path explosion effect. The term path explosion refers to the fact that the number of paths between a randomly selected pair of nodes increases exponentially with time. We draw from the theory of epidemics to model and explain the path explosion effect. This is the first contribution of the thesis, and is a key observation that underlies subsequent results. Our second contribution is the study of forwarding algorithms. For this, we rely on trace driven simulations of different algorithms that span a range of design dimensions. We compare the performance (success rate and average delay) of these algorithms. We make the surprising observation that most algorithms we consider have roughly similar performance. We explain this result in light of the path explosion phenomenon. While the performance of most algorithms we studied was roughly the same, these algorithms differed in terms of cost. This prompted us to focus on designing algorithms with the explicit intent of reducing costs. For this, we cast the problem of forwarding as an optimal stopping problem. Our third main contribution is the design of strategies based on optimal stopping principles which we refer to as Delegation schemes. Our analysis shows that using a delegation scheme reduces cost over naive forwarding by a factor of O(√N), where N is the number of nodes in the network. We further validate this result on real traces, where the cost reduction observed is even greater. Our results so far include a key assumption, which is unbounded buffers on nodes. Next, we relax this assumption, so that the problem shifts to one of prioritization of messages for transmission and dropping. Our fourth contribution is the study of message prioritization schemes, combined with forwarding. Our main result is that one achieves higher performance by assigning higher priorities to young messages in the network. We again interpret this result in light of the path explosion effect.

SomeCast: A Paradigm for Real-Time Adaptive Reliable Multicast

SomeCast is a novel paradigm for the reliable multicast of real-time data to a large set of receivers over the Internet. SomeCast is receiver-initiated and thus scalable in the number of receivers, the diverse characteristics of paths between senders and receivers (e.g. maximum bandwidth and round-trip-time), and the dynamic conditions of such paths (e.g. congestion-induced delays and losses). SomeCast enables receivers to dynamically adjust the rate at which they receive multicast information to enable the satisfaction of real-time QoS constraints (e.g. rate, deadlines, or jitter). This is done by enabling a receiver to join SOME number of concurrent multiCAST sessions, whereby each session delivers a portion of an encoding of the real-time data. By adjusting the number of such sessions dynamically, client-specific QoS constraints can be met independently. The SomeCast paradigm can be thought of as a generalization of the AnyCast (e.g. Dynamic Server Selection) and ManyCast (e.g. Digital Fountain) paradigms, which have been proposed in the literature to address issues of scalability of UniCast and MultiCast environments, respectively. In this paper we overview the SomeCast paradigm, describe an instance of a SomeCast protocol, and present simulation results that quantify the significant advantages gained from adopting such a protocol for the reliable multicast of data to a diverse set of receivers subject to real-time QoS constraints.

Biased ART: A Neural Architecture that Shifts Attention Toward Previously Disregarded Features Following an Incorrect Prediction

Memories in Adaptive Resonance Theory (ART) networks are based on matched patterns that focus attention on those portions of bottom-up inputs that match active top-down expectations. While this learning strategy has proved successful for both brain models and applications, computational examples show that attention to early critical features may later distort memory representations during online fast learning. For supervised learning, biased ARTMAP (bARTMAP) solves the problem of over-emphasis on early critical features by directing attention away from previously attended features after the system makes a predictive error. Small-scale, hand-computed analog and binary examples illustrate key model dynamics. Twodimensional simulation examples demonstrate the evolution of bARTMAP memories as they are learned online. Benchmark simulations show that featural biasing also improves performance on large-scale examples. One example, which predicts movie genres and is based, in part, on the Netflix Prize database, was developed for this project. Both first principles and consistent performance improvements on all simulation studies suggest that featural biasing should be incorporated by default in all ARTMAP systems. Benchmark datasets and bARTMAP code are available from the CNS Technology Lab Website: http://techlab.bu.edu/bART/.

Distributed Hypothesis Testing, Attention Shifts and Transmitter Dynatmics During the Self-Organization of Brain Recognition Codes

BP (89-A-1204); Defense Advanced Research Projects Agency (90-0083); National Science Foundation (IRI-90-00530); Air Force Office of Scientific Research (90-0175, 90-0128); Army Research Office (DAAL-03-88-K0088)

Prostate cancer: an evolving paradigm.

Since at least the early 1990s, stage and risk migration have been seen in patients with prostate cancer, likely corresponding to the institution of prostate specific antigen (PSA) screening in health systems. Preoperative risk factors, including PSA level and clinical stage, have decreased significantly. These improved prognostic variables have led to a larger portion of men being stratified with low-risk disease, as per the classification of D'Amico and associates. This, in turn, has corresponded with more favorable postoperative variables, including decreased extraprostatic tumor extension and prolonged biochemical-free recurrence rates. The advent of focal therapy is bolstered by findings of increased unilateral disease with decreased tumor volume. Increasingly, targeted or delayed therapies may be possible within the current era of lower risk disease.

Brain activity during episodic retrieval of autobiographical and laboratory events: an fMRI study using a novel photo paradigm.

Functional neuroimaging studies of episodic memory retrieval generally measure brain activity while participants remember items encountered in the laboratory ("controlled laboratory condition") or events from their own life ("open autobiographical condition"). Differences in activation between these conditions may reflect differences in retrieval processes, memory remoteness, emotional content, retrieval success, self-referential processing, visual/spatial memory, and recollection. To clarify the nature of these differences, a functional MRI study was conducted using a novel "photo paradigm," which allows greater control over the autobiographical condition, including a measure of retrieval accuracy. Undergraduate students took photos in specified campus locations ("controlled autobiographical condition"), viewed in the laboratory similar photos taken by other participants (controlled laboratory condition), and were then scanned while recognizing the two kinds of photos. Both conditions activated a common episodic memory network that included medial temporal and prefrontal regions. Compared with the controlled laboratory condition, the controlled autobiographical condition elicited greater activity in regions associated with self-referential processing (medial prefrontal cortex), visual/spatial memory (visual and parahippocampal regions), and recollection (hippocampus). The photo paradigm provides a way of investigating the functional neuroanatomy of real-life episodic memory under rigorous experimental control.

Economic and social upgrading in global production networks: A new paradigm for a changing world

A key challenge in promoting decent work worldwide is how to improve the position of both firms and workers in value chains and global production networks driven by lead firms. This article develops a framework for analysing the linkages between the economic upgrading of firms and the social upgrading of workers. Drawing on studies which indicate that firm upgrading does not necessarily lead to improvements for workers, with a particular focus on the Moroccan garment industry, it outlines different trajectories and scenarios to provide a better understanding of the relationship between economic and social upgrading. The authors 2011 Journal compilation © International Labour Organization 2011.

Exercise elicits phase shifts and acute alterations of melatonin that vary with circadian phase

To examine the immediate phase-shifting effects of high-intensity exercise of a practical duration (1 h) on human circadian phase, five groups of healthy men 20-30 yr of age participated in studies involving no exercise or exposure to morning, afternoon, evening, or nocturnal exercise. Except during scheduled sleep/dark and exercise periods, subjects remained under modified constant routine conditions allowing a sleep period and including constant posture, knowledge of clock time, and exposure to dim light intensities averaging (±SD) 42 ± 19 lx. The nocturnal onset of plasma melatonin secretion was used as a marker of circadian phase. A phase response curve was used to summarize the phase-shifting effects of exercise as a function of the timing of exercise. A significant effect of time of day on circadian phase shifts was observed (P < 0.004). Over the interval from the melatonin onset before exercise to the first onset after exercise, circadian phase was significantly advanced in the evening exercise group by 30 ± 15 min (SE) compared with the phase delays observed in the no-exercise group (-25 ± 14 min, P < 0.05). Phase shifts in response to evening exercise exposure were attenuated on the second day after exercise exposure and no longer significantly different from phase shifts observed in the absence of exercise. Unanticipated transient elevations of melatonin levels were observed in response to nocturnal exercise and in some evening exercise subjects. Taken together with the results from previous studies in humans and diurnal rodents, the current results suggest that 1) a longer duration of exercise exposure and/or repeated daily exposure to exercise may be necessary for reliable phase-shifting of the human circadian system and that 2) early evening exercise of high intensity may induce phase advances relevant for nonphotic entrainment of the human circadian system.

Emergence: a paradigm for robust and scalable distributed applications

Natural distributed systems are adaptive, scalable and fault-tolerant. Emergence science describes how higher-level self-regulatory behaviour arises in natural systems from many participants following simple rulesets. Emergence advocates simple communication models, autonomy and independence, enhancing robustness and self-stabilization. High-quality distributed applications such as autonomic systems must satisfy the appropriate nonfunctional requirements which include scalability, efficiency, robustness, low-latency and stability. However the traditional design of distributed applications, especially in terms of the communication strategies employed, can introduce compromises between these characteristics. This paper discusses ways in which emergence science can be applied to distributed computing, avoiding some of the compromises associated with traditionally-designed applications. To demonstrate the effectiveness of this paradigm, an emergent election algorithm is described and its performance evaluated. The design incorporates nondeterministic behaviour. The resulting algorithm has very low communication complexity, and is simultaneously very stable, scalable and robust.