The realization of software projects can be significantly eased by extending the focus of reuse to architectural aspects instead of concentrating on separate software elements. Yet in any case, operational techniques are required to support the retrieval and selection of reusable items. To this end, we extend on the concept of design spaces which allows to describe the relevant properties of so...

The examples of topological spaces that we construct in this exposition arose simultaneously from two seemingly disparate fields: the first author, in his thesis [1], discovered these spaces after working with H. Landau, Z. Landau, J. Pommersheim, and E. Zaslow on problems about random walks on graphs [2]. The second author discovered these same spaces while collaborating with D. Koditschek in ...

We define algebraic cobordism of classifying spaces, Ω∗(BG) and G-equivariant algebraic cobordism Ω∗G(−) for a linear algebraic group G. We prove some properties of the coniveau filtration on algebraic cobordism, denoted F (Ω(−)), which are required for the definition to work. We show that G-equivariant cobordism satisfies the localization exact sequence. We calculate Ω(BG) for algebraic groups...

People can derive a great deal of value from social interactions. This paper discusses how one might “seed” online environments to be rich in social interaction. The argument presented is based on an analysis of research on the support of collaboration among distributed work teams. This revealed four elements that may contribute towards for fostering interaction among team members: place-making...

A well known application of Ramsey’s Theorem to Banach Space Theory is the notion of a spreading model (ẽi) of a normalized basic sequence (xi) in a Banach space X. We show how to generalize the construction to define a new creature (ei), which we call an asymptotic model of X. Every spreading model of X is an asymptotic model of X and in most settings, such as if X is reflexive, every normaliz...

In the article concepts and facts necessary to continue formalization of theory of continuous lattices according to [11] are introduced. and [4] provide the notation and terminology for this paper. 1. PRELIMINARIES The following two propositions are true: (1) For all sets X, A, B such that A ∈ Fin X and B ⊆ A holds B ∈ Fin X. (2) For every set X and for every family F of subsets of X such that ...

ADDRESSING UTILITY SPACE COMPLEXITY IN NEGOTIATIONS INVOLVING HIGHLY UNCORRELATED, CONSTRAINT-BASED UTILITY SPACES IVAN MARSA-MAESTRE,1 MIGUEL A. LOPEZ-CARMONA,1 MARK KLEIN,2 TAKAYUKI ITO,3 AND KATSUHIDE FUJITA3 1Computer Engineering Department, Universidad de Alcala, Madrid, Spain 2Center for Collective Intelligence, Massachusetts Institute of Technology, Cambridge, Massachusetts, USA 3School ...

Knowledge work in organizations, by definition, leverages contributions of many individuals to solve problems too complex for a single individual to tackle alone (e.g., Argote, McEvily, and Reagans, 2003). In organizations, such problem solving occurs not just at the individual level but also at the organizational level, expertise therefore becomes the core organizational asset, and superior an...

The existence of approximate fixed points and approximate endpoints of the multivalued almost I-contractions is established. We also develop quantitative estimates of the sets of approximate fixed points and approximate endpoints for multivalued almost I-contractions. The proved results unify and improve recent results of Amini-Harandi 2010 , M. Berinde and V. Berinde 2007 , Ćirić 2009 , M. Păc...

This panel paper proposes to consider the process that learners or educators commonly follow while interacting with learning analytics tools as part of an orchestration loop. This may be particularly valuable to facilitate understanding of the key role that learning analytics may have to provide sustained support to learners and educators. The complexity of learning situations where learning oc...