Assignment Games with Conflicts: Robust Price of Anarchy and Convergence Results via Semi-Smoothness

We study assignment games in which jobs select machines, and in which certain pairs of jobs may conflict, which is to say they may incur an additional cost when they are both assigned to the same machine, beyond that associated with the increase in load. Questions regarding such interactions apply beyond allocating jobs to machines: when people in a social network choose to align themselves with a group or party, they typically do so based upon not only the inherent quality of that group, but also who amongst their friends (or enemies) chooses that group as well. We show how semi-smoothness, a recently introduced generalization of smoothness, is necessary to find tight bounds on the robust price of anarchy, and thus on the quality of correlated and Nash equilibria, for several natural job-assignment games with interacting jobs. For most cases, our bounds on the robust price of anarchy are either exactly 2 or approach 2. We also prove new convergence results implied by semi-smoothness for our games. Finally we consider coalitional deviations, and prove results about the existence and quality of strong equilibrium.     

Generating test case chains for reactive systems

Testing of reactive systems is challenging because long input sequences are often needed to drive them into a state to test a desired feature. This is particularly problematic in on-target testing, where a system is tested in its real-life application environment and the amount of time required for resetting is high. This article presents an approach to discovering a test case chain—a single software execution that covers a group of test goals and minimizes overall test execution time. Our technique targets the scenario in which test goals for the requirements are given as safety properties. We give conditions for the existence and minimality of a single test case chain and minimize the number of test case chains if a single test case chain is infeasible. We report experimental results with our ChainCover tool for C code generated from Simulink models and compare it to state-of-the-art test suite generators.     

Search combinators

The ability to model search in a constraint solver can be an essential asset for solving combinatorial problems. However, existing infrastructure for defining search heuristics is often inadequate. Either modeling capabilities are extremely limited or users are faced with a general-purpose programming language whose features are not tailored towards writing search heuristics. As a result, major improvements in performance may remain unexplored. This article introduces search combinators, a lightweight and solver-independent method that bridges the gap between a conceptually simple modeling language for search (high-level, functional and naturally compositional) and an efficient implementation (low-level, imperative and highly non-modular). By allowing the user to define application-tailored search strategies from a small set of primitives, search combinators effectively provide a rich domain-specific language (DSL) for modeling search to the user. Remarkably, this DSL comes at a low implementation cost to the developer of a constraint solver. The article discusses two modular implementation approaches and shows, by empirical evaluation, that search combinators can be implemented without overhead compared to a native, direct implementation in a constraint solver.     

VALENCE: affective visualisation using EEG

VALENCE is an interactive visualisation controlled by live brainwave monitoring. We used a wireless EEG headset to monitor the player's alpha waves (an indicator of relaxation) and valence (an indicator of emotion or arousal). The game world is an emergent system of attractive and repulsive forces responding to EEG input.     

Discipline-based instruction to promote interdisciplinary design of wearable and pervasive computing products

This paper reports on a design experience for undergraduates in computer engineering, industrial design, and marketing that focuses on pervasive computing devices. Across a broad range of targeted application areas and user groups, many of the student designs have been wearable computers. Consequently, our course will be of interest to the wearable computing community, particularly in terms of our aim of bridging the gap between design and engineering. For the two most recent offerings of the course, we have utilized external observers and surveyed the students in order to validate the impact of aspects of our process and changes to it. This paper is based upon 5 years of experience and 2 years of analysis of our course, and it presents an overview of our process with both qualitative and quantitative results from these two most recent offerings.     

Explaining IS continuance in environments where usage is mandatory

Several research efforts over the last decade have attempted to explain user acceptance in mandated environments. This research is an attempt in the same direction. It addresses users’ satisfaction in mandated environments to further contribute to our understanding of how we can manage mandated use of information systems (IS) effectively beyond initial adoption. To better explain users’ IS continuance a revised post-acceptance model is proposed and empirically tested using the structural equation modelling technique. The results demonstrate the reliability and validity of the proposed measurement model and further demonstrate that confirmed expectations and ease of use perceptions explain 61% of the users’ satisfaction in this setting. Our findings have important implications for the management of users in mandated environments as well as for further research in the area of mandated use. To that end, we offer directions for future research.     

我的随身电脑——华硕Eee PC 1000HE上网本使用体会

瘦客户机 瘦客户机对于目前的医疗保健、金融、教育及其它行业来说．是一项良好的解决方案。不但经济实惠,也更便于IT管理人员进行管理。我们评测的是实达WT-8040瘦客户机。     

Immunoglobulin 1 (IgG1) Fc-glycosylation profiling of anti-citrullinated peptide antibodies from human serum

In several autoimmune disorders, including rheumatoid arthritis (RA), autoantibodies are thought to be the driving force of pathogenicity. Glycosylation of the Fc-part of human Igs is known to modulate biological activity. Hitherto, glycosylation of human IgG-Fc has been analyzed predominantly at the level of total serum IgG, revealing reduced galactosylation in RA. Given the pathogenic relevance of autoantibodies in RA, we wished, in the present study, to address the question whether distinct Fc-glycosylation features are observable at the level of antigen-specific IgG subpopulations. For this purpose, we have developed a method for the microscale purification and Fc-glycosylation analysis of anti-citrullinated peptide antibodies (ACPA). ACPA represent a group of autoantibodies that occur with unique specificity in RA patients. Their presence is associated with increased inflammatory disease activity and rapid joint destruction. Results indicate that ACPA of the IgG1 subclass vary considerably from total serum IgG1 with respect to Fc-galactosylation, with galactosylation being higher on ACPA than on serum IgG1 for some patients, while other patients show higher galactosylation on serum IgG1 than on ACPA. Using this method, studies can be performed on the biological and clinical relevance of ACPA glycosylation within RA patient cohorts.