A semantics for Behavior Trees using CSP with specification commands

In this paper we give a formal definition of the requirements translation language Behavior Trees. This language has been used with success in industry to systematically translate large, complex, and often erroneous requirements documents into a structured model of the system. It contains a mixture of state-based manipulations, synchronisation, message passing, and parallel, conditional, and iterative control structures. The formal semantics of a Behavior Tree is given via a translation to a version of Hoare’s process algebra CSP, extended with state-based constructs such as guards and updates, and a message passing facility similar to that used in publish/subscribe protocols. We first provide the extension of CSP and its operational semantics, which preserves the meaning of the original CSP operators, and then the Behavior Tree notation and its translation into the extended version of CSP.     

Succinct representation of dynamic trees

We study the problem of maintaining a dynamic ordered tree succinctly under updates of the following form: insertion or deletion of a leaf, insertion of a node on an edge (edge subdivision) or deletion of a node with only one child (the child becomes a child of its former grandparent). We allow satellite data of a fixed size to be associated to the nodes of the tree.We support update operations in constant amortized time and support access to satellite data and basic navigation operations in worst-case constant time; the basic navigation operations include parent, first/last-child, previous/next-child. These operations are moving from a node to its parent, leftmost/rightmost child, and its previous and next child respectively.We demonstrate that to efficiently support more extended operations, such as determining the i-th child of a node, rank of a child among its siblings, or size of the subtree rooted at a node, one requires a restrictive pattern for update strategy, for which we propose the finger-update model. In this model, updates are performed at the location of a finger that is only allowed to crawl on the tree between a child and a parent or between consecutive siblings. Under this model, we describe how the named extended operations are performed in worst-case constant time.Previous work on dynamic succinct trees (Munro et al., 2001 [17]; Raman and Rao, 2003 [19]) is mainly restricted to binary trees and achieves poly-logarithmic (Munro et al., 2001 [17]) or “poly-log-log” (Raman and Rao, 2003 [19]) update time under a more restricted model, where updates are performed in traversals starting at the root and ending at the root and queries can be answered when the traversal is completed. A previous result on ordinal trees achieves only sublinear amortized update time and “poly-log-log” query time (Gupta et al., 2007 [11]). More recently, the update time has been improved to O(logn/loglogn) while queries can be performed in O(logn/loglogn) time (Sadakane and Navarro, 2010 [20]).     

Combining the Power of Taverna and caGrid: Scientific Workflows that Enable Web-Scale Collaboration

Service-oriented architecture represents a promising approach to integrating data and software across different institutional and disciplinary sources, thus facilitating Web-scale collaboration while avoiding the need to convert different data and software to common formats. The US National Cancer Institute's Biomedical Information Grid program seeks to create both a service-oriented infrastructure (caGrid) and a suite of data and analytic services. Workflow tools in caGrid facilitate both the use and creation of services by accelerating service discovery, composition, and orchestration tasks. The authors present caGrid's workflow requirements and explain how they met these requirements by adopting and extending the Taverna system.     

Towards the next generation of artificial neural networks for civil engineering

The purpose of this paper is to stimulate interest within the civil engineering research community for developing the next generation of applied artificial neural networks. In particular, it identifies what the next generation of these devices needs to achieve, and provides direction in terms of how their development may proceed. An analysis of the current situation indicates that progress in the development of artificial neural network applications has largely stagnated. Suggestions are made for advancing the field to the next level of sophistication and application, using genetic algorithms and related techniques. It is shown that this approach will require the design of some very sophisticated genetic coding mechanisms in order to develop the required higher-order network structures, and will utilize development mechanisms observed in nature such as growth, self-organization, and multi-stage objective functions. The capabilities of such an approach and the way in which they can be achieved are explored with reference to the problems of: (a) determining truck attributes from the strain envelopes they induce in structural members when crossing a bridge, and; (b) developing a decision support system for dynamic control of industrialized manufacturing of houses.     

Aero-structural optimization using adjoint coupled post-optimality sensitivities

A new subspace optimization method for performing aero-structural design is introduced. The method relies on a semi-analytic adjoint approach to the sensitivity analysis that includes post-optimality sensitivity information from the structural optimization subproblem. The resulting coupled post-optimality sensitivity approach is used to guide a gradient-based optimization algorithm. The new approach simplifies the system-level problem, thereby reducing the number of calls to a potentially costly aerodynamics solver. The aero-structural optimization of an aircraft wing is performed using linear aerodynamic and structural analyses, and a performance comparison is made between the new approach and the conventional multidisciplinary feasible method. The new asymmetric suboptimization method is found to be the more efficient approach when it adequately reduces the number of system evaluations or when there is a large enough discrepancy between disciplinary solution times.     

A novel induction motor control scheme using IDA-PBC

A new control scheme for induction motors is proposed in the present paper, applying the interconnection and damping assignment-passivity based control （IDA-PBC） method. The scheme is based exclusively on passivity based control, without restricting the input frequency as it is done in field oriented control （FOC）. A port-controlled Hamiltonian （PCH） model of the induction motor is deduced to make the interconnection and damping of energy explicit on the scheme. The proposed controller is validated under computational simulations and experimental tests using an inverter prototype.     

Visual signatures in video visualization

Video visualization is a computation process that extracts meaningful information from original video data sets and conveys the extracted information to users in appropriate visual representations. This paper presents a broad treatment of the subject, following a typical research pipeline involving concept formulation, system development, a path-finding user study, and a field trial with real application data. In particular, we have conducted a fundamental study on the visualization of motion events in videos. We have, for the first time, deployed flow visualization techniques in video visualization. We have compared the effectiveness of different abstract visual representations of videos. We have conducted a user study to examine whether users are able to learn to recognize visual signatures of motions, and to assist in the evaluation of different visualization techniques. We have applied our understanding and the developed techniques to a set of application video clips. Our study has demonstrated that video visualization is both technically feasible and cost-effective. It has provided the first set of evidence confirming that ordinary users can be accustomed to the visual features depicted in video visualizations, and can learn to recognize visual signatures of a variety of motion events.     

A study of the polymerization behaviour of N-(4-phenoxy)-phenylmaleimide using DSC analysis

Summary The thermal cure of a monofunctional maleimide N-(4-phenoxy)-phenylmaleimid (1) was examined using differential scanning calorimetry (DSC). The analogous bis-maleimide bis-(4-maleimidophenyl)ether (2) was also analyzed in the same manner for comparison. Polymerization kinetics derived from scanning DSC measurements showed an order of reaction varying between n=1 and 2 for (1), compared to an order of reaction between n=2 and 3 (by multiple linear regression analysis) for (2). The overall enthalpy of polymerization (H_o) for N-(4-phenoxy)-phenylmaleimide (94kJ/mole) agrees well with that obtained for maleimide itself (89kJ/mole) using conventional calorimetric techniques indicating that polymerization appears complete within the timescale of the experiment. In contrast the analogous BMI displays a markedly lower overall polymerization enthalpy (ca. 66kJ/mole) indicating an apparent conversion of only 37%.