A Timing Assumption and Two t-Resilient Protocols for Implementing an Eventual Leader Service in Asynchronous Shared Memory Systems

This paper considers the problem of electing an eventual leader in an asynchronous shared memory system. While this problem has received a lot of attention in message-passing systems, very few solutions have been proposed for shared memory systems. As an eventual leader cannot be elected in a pure asynchronous system prone to process crashes, the paper first proposes to enrich the asynchronous system model with an additional assumption. That assumption (denoted AWB) is particularly weak. It is made up of two complementary parts. More precisely, it requires that, after some time, (1) there is a process whose write accesses to some shared variables be timely, and (2) the timers of (t−f) other processes be asymptotically well-behaved (t denotes the maximal number of processes that may crash, and f the actual number of process crashes in a run). The asymptotically well-behaved timer notion is a new notion that generalizes and weakens the traditional notion of timers whose durations are required to monotonically increase when the values they are set to increase (a timer works incorrectly when it expires at arbitrary times, i.e., independently of the value it has been set to). The paper then focuses on the design of t-resilient AWB-based eventual leader protocols. “t-resilient” means that each protocol can cope with up to t process crashes (taking t=n−1 provides wait-free protocols, i.e., protocols that can cope with any number of process failures). Two protocols are presented. The first enjoys the following noteworthy properties: after some time only the elected leader has to write the shared memory, and all but one shared variables have a bounded domain, be the execution finite or infinite. This protocol is consequently optimal with respect to the number of processes that have to write the shared memory. The second protocol guarantees that all the shared variables have a bounded domain. This is obtained at the following additional price: t+1 processes are required to forever write the shared memory. A theorem is proved which states that this price has to be paid by any protocol that elects an eventual leader in a bounded shared memory model. This second protocol is consequently optimal with respect to the number of processes that have to write in such a constrained memory model. In a very interesting way, these protocols show an inherent tradeoff relating the number of processes that have to write the shared memory and the bounded/unbounded attribute of that memory.     

An investigation of student practices in asynchronous computer conferencing courses

This study investigated the online practices of students enrolled in graduate-level distance education courses. Using interviews and a questionnaire as data sources, the study sought to: (a) identify common practices that students adopt in asynchronous discussions, and (b) gain an understanding of why students adopt them. An analysis of the data suggests that many of the practices are coping mechanisms developed to help students more easily meet course participation requirements. Some of these are time saving strategies designed to reduce information overload (e.g., skimming messages rather than reading them carefully). Other strategies are designed to help students project an image of themselves as knowledgeable and collaborative course participants. It is argued that although these practices provide students with a level of efficiency in terms of meeting course requirements, they may inadvertently undermine learning.     

Free-living inferential modeling of blood glucose level using only noninvasive inputs

The goal of this work is to present a causation modeling methodology with the ability to accurately infer blood glucose levels using a large set of highly correlated noninvasive input variables over an extended period of time. These models can provide insight to improve glucose monitoring, and glucose regulation through advanced model-based control technologies. The efficacy of this approach is demonstrated using real data from a type 2 diabetic (T2D) subject collected under free-living conditions over a period of 25 consecutive days. The model was identified and tested using eleven variables that included three food variables as well as several activity and stress variables. The model was trained using 20 days of data and validated using 5 days of data. This gave a fitted correlation coefficient of 0.70 and an average absolute error (AAE) (i.e., the average of the absolute values for the measured glucose concentration minus modeled glucose concentration) of 13.3 mg/dL for the validation data. This AAE result was significantly better than the subject’s personal glucose meter AAE of 15.3 mg/dL for replicated measurements.     

Social evaluations of embodied agents and avatars

The purpose of this study was to examine social evaluations (i.e., perceptions of empathy and positivity) following peoples’ interactions with digital human representations. Female research participants engaged in a 3-min interaction while immersed in a 3-D immersive virtual environment with a “peer counselor.” Participants were led to believe that the peer counselor was either an embodied agent (i.e., computer algorithm) or an avatar (i.e., another person). During the interaction, the peer counselor either smiled or not. As predicted, a digitally-rendered smile was found to affect participants’ social evaluations. However, these effects were moderated by participants’ beliefs about their interaction partner. Specifically, smiles enhanced social evaluations of embodied agents but degraded them for avatars. Although these results are consistent with other findings concerning the communicative realism of embodied agents and avatars they uniquely demonstrate that people’s beliefs alone, rather than actual differences in virtual representations, can impact social evaluations.     

An order-clique-based approach for mining maximal co-locations

Most algorithms for mining spatial co-locations adopt an Apriori-like approach to generate size-k prevalence co-locations after size-(k − 1) prevalence co-locations. However, generating and storing the co-locations and table instances is costly. A novel order-clique-based approach for mining maximal co-locations is proposed in this paper. The efficiency of the approach is achieved by two techniques: (1) the spatial neighbor relationships and the size-2 prevalence co-locations are compressed into extended prefix-tree structures, which allows the order-clique-based approach to mine candidate maximal co-locations and co-location instances; and (2) the co-location instances do not need to be stored after computing some characteristics of the corresponding co-location, which significantly reduces the execution time and space required for mining maximal co-locations. The performance study shows that the new method is efficient for mining both long and short co-location patterns, and is faster than some other methods (in particular the join-based method and the join-less method).     

A modified version of the three-compartment model to predict fatigue during submaximal tasks with complex force-time histories

The three-compartment model (3CM) was validated previously for prediction of endurance times by modifying its fatigue and recovery rates. However, endurance times do not typically represent work demands, and it is unknown if the current version of the 3CM is applicable for ergonomics analysis of all occupational tasks. The purpose of this study was to add biological fidelity to the 3CM, and validate the model against a series of submaximal force plateaus. The fatigue and recovery rates were modified to represent graded physiological motor unit characteristics (termed 3CM_GMU). In nine experiments of submaximal efforts, the 3CM_GMU produced a root-mean squared difference (RMSD) of 4.1 ± 0.5% MVC over experiments with an average strength loss (i.e. fatigue) of 31.0 ± 1.1% MVC. The 3CM_GMU model performed poorly for endurance tasks. The 3CM_GMU model is an improvement for evaluating submaximal force patterns consisting of intermittent muscle contractions of the hand and forearm.

Practitioner Summary: We modified an existing fatigue model using known physiological properties in order to predict fatigue during nine different submaximal force profiles; consistent with efforts seen in industrial work. We expect this model to be included in digital human modelling software, for the assessment of repetitive work and muscle fatigue in repetitive tasks.

Social Media Summary: The proposed model has applications for estimating task fatigue in proactive ergonomic analyses of complex force patterns using digital human models.     

From Autonomy to Cooperative Traded Control of Humanoid Manipulation Tasks with Unreliable Communication

In this paper, we present our system design, operational procedure, testing process, field results, and lessons learned for the valve-turning task of the DARPA Robotics Challenge (DRC). We present a software framework for cooperative traded control that enables a team of operators to control a remote humanoid robot over an unreliable communication link. Our system, composed of software modules running on-board the robot and on a remote workstation, allows the operators to specify the manipulation task in a straightforward manner. In addition, we have defined an operational procedure for the operators to manage the teleoperation task, designed to improve situation awareness and expedite task completion. Our testing process, consisting of hands-on intensive testing, remote testing, and remote practice runs , demonstrates that our framework is able to perform reliably and is resilient to unreliable network conditions. We analyze our approach, field tests, and experience at the DRC Trials and discuss lessons learned which may be useful for others when designing similar systems.     

ADL: An Activity Description Language for Real-Time Networks

This paper introduces and motivates ADL, a new formal notation for the specification of the temporal and functional behaviour of concurrent processes. ADL is tailored to be directly compatible with the DORIS design method. It combines a graphical Activity State-Machine (ASM) notation and a model-based Activity Functional Behaviour (AFB) notation. The abstract syntax, and static and dynamic semantics for the ASM notation are given, the dynamic semantics being given proof-theoretically in many-sorted logic extended with the RTL ‘occurrence’ relation, Θ, and the ERTL ‘holding’ relation, Φ. ADL is used to specify a small network, and proofs are given of its timeliness and safety properties. Received November 1998 / Accepted in revised form May 2000     

Who Are You? The Trade-Off between Information Utility and Privacy

There's no doubt that personal information can be valuable to companies. People are willing to give up information about themselves not because they're stupid or because they're being tricked by evil corporations, but because it can sometimes be in their best interests to do so. From this perspective, the important questions are how users can provide or limit access to that information, what benefits they might receive in exchange for a bit of information, and how they perceive the value of those benefits.     

Service Science

This paper is a first exploration of the relationship between service science and Grid computing. Service science is the study of value co-creation interactions among entities, known as service systems. Within the emerging service science community, service is often defined as the application of competences (resources) for the benefit of another. Grid computing is the study of resource sharing among entities, known as virtual organizations, which solve complex business, societal, scientific, and engineering problems. Within the Grid computing community, service is sometimes defined as protocols plus behavior. Both Grid computing and service science are connecting academic, industry, government, and volunteer sector collaborators on a range of projects including eScience, healthcare, environmental sustainability, and more. This paper compares and contrasts the notions of resource, entity, service, interaction, and success criteria for the two areas of study. In conclusion, new areas for collaborative inquiry are proposed.