Existing mobile IT applications in the construction industry are constrained by their reliance on static methods of information delivery, from dynamic project conditions. This paper information delivery (CAID), which promises to ma changing work demands. A roadmap to personalized pervasive user-centred intelligent work environment capable of serving relevant information needs of busy constructi...

This paper is concerned with representations which enable a technical agent to recognize objects and aggregates from mechanical parts as they evolve in an ongoing construction task. The general goal is that the technical agent has a detailed understanding of the task situation such that it can execute instructions issued by a human user in a dynamically changing situation. A levelled approach f...

A requirement to support teachers’ professional vision for highperformance classrooms is to clarify criteria for analyze data collected from classroom. Plans of lessons can be a criterion for it because teachers can figure out and compare what are the plans for and what is happening in the lessons. This paper discusses the contribution of modeling plans of lessons based on ontological engineering.

We present a highly parallel, linearly scalable technique of kd-tree construction for ray tracing of dynamic geometry. We use conventional kd-tree compatible with the high performing algorithms such as MLRTA or frustum tracing. Proposed technique offers exceptional construction speed maintaining reasonable kd-tree quality for rendering stage. The algorithm builds a kd-tree from scratch each fra...

We present a new conceptual abstraction in symmetry breaking – the GE-tree. The construction and traversal of a GE-tree breaks all symmetries in any constraint satisfaction or similar problem. We give a polynomial-time algorithm for this construction in the case of CSPs with arbitrary value symmetries. We have implemented this technique, and supply experimental evidence of its practical effecti...

We review the linear time suux tree constructions by Weiner, McCreight, and Ukkonen. We use the terminology of the most recent algorithm, Ukkonen's online construction, to explain its historic predecessors. This reveals relationships much closer than one would expect, since the three algorithms are based on rather diierent intuitive ideas. Moreover, it completely explains the diierences between...

The aim of this paper is to apply the concept of robust optimization introduced by Bel-Tal and Nemirovski to the portfolio selection problems based on multi-stage scenario trees. The objective of our portfolio selection is to maximize an expected utility function value (or equivalently, to minimize an expected disutility function value) as in a classical stochastic programming problem, except t...

We broaden the theoretical basis for generating scenario trees in multi-stage stochastic programming based on stability analysis. Numerical experience for constructing trees of demand and price scenarios in electricity portfolio management of a municipal power utility is also provided.

We examine on-line heap construction and on-line permutation routing on trees under the matching model. Let T be and n-node tree of maximum degree d. By providing on-line algorithms we prove that: 1. For a rooted tree of height h, on-line heap construction can be completed within (2d − 1)h routing steps. 2. For an arbitrary tree, on-line permutation routing can be completed within 4dn routing s...

Context scenarios are widely used for assessing the robustness of strategies and policies in both the private and the public sector. Royal Dutch Shell, for instance, has become renowned for it’s strategic use of context scenarios in the seventies and developed a methodological stepwise approach for scenario construction. Nowadays context scenarios have become one of the standard tools of policy...