Rather, the goal is to Microtext media (Ellen, 2011), such as SMS, IM, Twitter, gather relevant messages, organize them, and extract some and text chat, have in common that they use short strings other kind of useful information from them, such as how for immediate communication or broadcast. Microtext can well a team is performing or what people are talking about be construed as one form of micro-messaging (e.g., and when. However, micro-messages do not exist in a Milstein, et al., 2008) which we extend here to include any vacuum; they are contextually oriented and may be part of of a number of other modalities (e.g., telephone calls, a larger network of communications which includes email, face-to-face interaction) used for short, immediate and telephone and other media, including "macro-text." Given (potentially) persistent message passing among this, we have found that natural language processing of the coordinating agents. In this paper, we describe several microtext must be paired with temporal or network recent attempts to study micro-messaging military and analysis of the context. To demonstrate this process, we related organizational contexts.

We describe work on representing and using a rich notion ofcontext that goes beyond current networking applications focusingmostly on location. Our context model includes locationand surroundings, the presence of people and devices,inferred activities and the roles people fill in them. A keyelement of our work is the use of collaborative informationsharing where devices share and integrate knowledge abouttheir context. This introduces a requirement that users canset appropriate levels of privacy to protect the personal informationbeing collected and the inferences that can be drawnfrom it. We use Semantic Web technologies to model contextand to specify high-level, declarative policies specifying informationsharing constraints. The policies involve attributesof the subject (i.e., information recipient), target (i.e., the information)and their dynamic context (e.g., are the parties copresent).We discuss our ongoing work on context representationand inference and present a model for protecting andcontrolling the sharing of private data in context-aware mobileapplications.

In this paper, we present some of our work in mobile user modeling following the three steps in a general user modeling process. First, we outline a framework for mobile user activity logging. The framework integrates various hardware and software sensors on smartphones. Second, we have worked on learning relevant user locations for personal information management and recognizing user activities from sensor data to analyze the collected data. Third, the user model can be used to adapt mobile information access, for example in mobile recommender systems. The paper also outlines some requirements for an Activity Context Representation and Exchange Language from the perspective of mobile user modeling.

Lack of context in information is a serious problem for knowledge-workers. Effective utilization of computational aids for supporting knowledge-workers require a rich understanding of the nature of context of information and related knowledge-works. It also needs specifications about how such understanding can be leveraged in computer-based systems. In this paper we propose a holistic model of context of knowledge-works and information created in course of their performances. We also demonstrate with an example how such a model can be used as basis for developing a formal, machine-deployable specification of activity context.

The goal of representing context in a mixed initiative sys-tem is to model the information at a level of abstraction that is actionable for both the human and automated system. A potential solution to this problem is the Context for Human and Automation Teams (CHAT). This paper introduces the CHAT model and provides example implementations from several different applications such as task scheduling tech-niques, multi-agent systems, and human-robot interaction.

Representing context information associated with people and digital devices performing activities is presented using a formal systems model based on a legal but simplified version of set theory. A five set Venn diagram, the PentaVenn diagram, allows analysts to work using a graphical logic rather than with equations. Model symmetry is shown to facilitate identifying different types of context, tangible and intangible.

This position paper describes the Activity-Based Computing (ABC) project which has been ongoing in Denmark since 2003. Originally, the project took its outset in the design of a pervasive computing platform suited for the mobile, collaborative, and time-critical work of clinicians in a hospital setting. Out of this grew a conceptual framework, a set of six ABC principles, and a programming and runtime framework for the development of activity-based computing infrastructures and applications. Lately, these principles and technologies have been successfully moved to other application areas, and is now used to design and implement activity-based computing support for work in a biology laboratory and for global software development.

This paper introduces 'just enough' principles and 'systems engineering' approach to the practice of ontology development to provide a minimal yet complete, lightweight, agile and integrated development process, supportive of stakeholder management and implementation independence.

The aim of a modern Building Automation System (BAS) is to enhance interactive control strategies for energy efficiency and user comfort. In this context, we develop a novel control algorithm that uses a stochastic building occupancy model to improve mean energy efficiency while minimizing expected discomfort. We compare by simulation our Stochastic Model Predictive Control (SMPC) strategy to the standard heating control method to empirically demonstrate a 4.3% reduction in energy use and 38.3% reduction in expected discomfort.

We consider the general problem of finding the minimum weight $\bm$-matching on arbitrary graphs. We prove that, whenever the linear programming (LP) relaxation of the problem has no fractional solutions, then the belief propagation (BP) algorithm converges to the correct solution. We also show that when the LP relaxation has a fractional solution then the BP algorithm can be used to solve the LP relaxation. Our proof is based on the notion of graph covers and extends the analysis of (Bayati-Shah-Sharma 2005 and Huang-Jebara 2007}. These results are notable in the following regards: (1) It is one of a very small number of proofs showing correctness of BP without any constraint on the graph structure. (2) Variants of the proof work for both synchronous and asynchronous BP; it is the first proof of convergence and correctness of an asynchronous BP algorithm for a combinatorial optimization problem.