Plate tectonic reconstructions with continuously closing plates

We present a new algorithm for modeling a self-consistent set of global plate polygons. Each plate polygon is composed of a finite list of plate margins, all with different Euler poles. We introduce a "continuously closed plate" (CCP), such that, as each margin moves independently, the plate polygon remains closed geometrically as a function of time. This method solves emerging needs in computational geodynamics to combine kinematic with dynamic models. Because they have polygons that are too widely spaced in time and have inconsistent motions between margins and plates, traditional global plate tectonic reconstructions have become inadequate for geodynamics. The CCP algorithm has been incorporated into the GPlates open-source paleogeographic system. The algorithm is a set of procedures and data structures that operate on collections of reconstructed geometric data to form closed plate polygons; the main data structures used for each plate polygon are based on a nested hierarchy of topological elements. Reconstructions with CCPs can be created, edited, visualized, and exported with GPlates. The native storage of the dynamic reconstructions is the GPlates Markup Language, GPML, which uses an XML-based file format called GML. We demonstrate the utility of the CCP method by creating a global reconstruction with continuously closing plates from 140 Ma to the present using data from existing, traditional reconstructions.     

SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs

This paper introduces a propositional encoding for recursive path orders (RPO), in connection with dependency pairs. Hence, we capture in a uniform setting all common instances of RPO, i.e., lexicographic path orders (LPO), multiset path orders (MPO), and lexicographic path orders with status (LPOS). This facilitates the application of SAT solvers for termination analysis of term rewrite systems (TRSs). We address four main inter-related issues and show how to encode them as satisfiability problems of propositional formulas that can be efficiently handled by SAT solving: (A) the lexicographic comparison w.r.t. a permutation of the arguments; (B) the multiset extension of a base order; (C) the combined search for a path order together with an argument filter to orient a set of inequalities; and (D) how the choice of the argument filter influences the set of inequalities that have to be oriented (so-called usable rules). We have implemented our contributions in the termination prover AProVE. Extensive experiments show that by our encoding and the application of SAT solvers one obtains speedups in orders of magnitude as well as increased termination proving power.     

Cost-benefit analysis of an SLA mapping approach for defining standardized Cloud computing goods

Due to the large variety in computing resources and, consequently, the large number of different types of service level agreements (SLAs), computing resource markets face the problem of a low market liquidity. Restricting the number of different resource types to a small set of standardized computing resources seems to be the appropriate solution to counteract this problem. Standardized computing resources are defined through an SLA template. An SLA template defines the structure of an SLA, the service attributes, the names of the service attributes, and the service attribute values. However, since existing research results have only introduced static SLA templates so far, the SLA templates cannot reflect changes in user needs and market structures. To address this shortcoming, we present a novel approach of adaptive SLA matching. This approach adapts SLA templates based on SLA mappings of users. It allows Cloud users to define mappings between a public SLA template, which is available in the Cloud market, and their private SLA templates, which are used for various in-house business processes of the Cloud user. Besides showing how public SLA templates are adapted to the demand of Cloud users, we also analyze the costs and benefits of this approach. Costs are incurred every time a user has to define a new SLA mapping to a public SLA template due to its adaptation. In particular, we investigate how the costs differ with respect to the public SLA template adaptation method. The simulation results show that the use of heuristics within adaptation methods allows balancing the costs and benefits of the SLA mapping approach.     

A method to align the coordinate system of accelerometers to the axes of a human body: The depitch algorithm

One of the key problems in accelerometry based gait analyses is that it may not be possible to attach an accelerometer to the lower trunk so that its axes are perfectly aligned to the axes of the subject. In this paper we will present an algorithm that was designed to virtually align the axes of the accelerometer to the axes of the subject during walking sections. This algorithm is based on a physically reasonable approach and built for measurements in unsupervised settings, where the test persons are applying the sensors by themselves. For evaluation purposes we conducted a study with 6 healthy subjects and measured their gait with a manually aligned and a skewed accelerometer attached to the subject's lower trunk. After applying the algorithm the intra-axis correlation of both sensors was on average 0.89±0.1 with a mean absolute error of 0.05g. We concluded that the algorithm was able to adjust the skewed sensor node virtually to the coordinate system of the subject.     

Model checking agent programming languages

In this paper we describe a verification system for multi-agent programs. This is the first comprehensive approach to the verification of programs developed using programming languages based on the BDI (belief-desire-intention) model of agency. In particular, we have developed a specific layer of abstraction, sitting between the underlying verification system and the agent programming language, that maps the semantics of agent programs into the relevant model-checking framework. Crucially, this abstraction layer is both flexible and extensible; not only can a variety of different agent programming languages be implemented and verified, but even heterogeneous multi-agent programs can be captured semantically. In addition to describing this layer, and the semantic mapping inherent within it, we describe how the underlying model-checker is driven and how agent properties are checked. We also present several examples showing how the system can be used. As this is the first system of its kind, it is relatively slow, so we also indicate further work that needs to be tackled to improve performance.     

A highly reliable integrated PDMS interconnector with a long cast flange for microfluidic systems

This paper presents a highly reliable macro to micro domain interconnection technology for microfluidic applications using Polydimethylsiloxane (PDMS) casting techniques. Characteristic to the interconnectors are long flanges fabricated in the PDMS film; therefore the contact area between PDMS and tubes is considerably increased compared to other interconnection technologies. Thus, both glass capillaries and Polytetrafluoroethylene (PTFE) tubes can be held in position very reliably and rigidly. To test the reliability of the interconnectors, PTFE tubes were successfully connected to microfluidic chips without the aid of any liquid adhesives. Both leakage and pull-out tests demonstrated the functionality and reliability of the PDMS interconnectors; no leakage was detected under a working pressure up to 400?kPa. A pull-out test yielded a pull-out force of 22.45?N. Furthermore, once a casting mould is fabricated, it can be re-used as a template repeatedly achieving a low cost technology and making it suitable for batch production.     

The implications of cross-regional differences for the design of In-vehicle Information Systems: a comparison of Australian and Chinese drivers

The increasing global distribution of automobiles necessitates that the design of In-vehicle Information Systems (IVIS) is appropriate for the regions to which they are being exported. Differences between regions such as culture, environment and traffic context can influence the needs, usability and acceptance of IVIS. This paper describes two studies aimed at identifying regional differences in IVIS design needs and preferences across drivers from Australia and China to determine the impact of any differences on IVIS design. Using a questionnaire and interaction clinics, the influence of cultural values and driving patterns on drivers' preferences for, and comprehension of, surface- and interaction-level aspects of IVIS interfaces was explored. Similarities and differences were found between the two regional groups in terms of preferences for IVIS input control types and labels and in the comprehension of IVIS functions. Specifically, Chinese drivers preferred symbols and Chinese characters over English words and were less successful (compared to Australians) at comprehending English abbreviations, particularly for complex IVIS functions. Implications in terms of the current trend to introduce Western-styled interfaces into other regions with little or no adaptation are discussed.     

The effects of user factors and symbol referents on public symbol design using the stereotype production method

This study investigated the influence of user factors and symbol referents on public symbol design among older people, using the stereotype production method for collecting user ideas during the symbol design process. Thirty-one older adults were asked to draw images based on 28 public symbol referents and to indicate their familiarity with and ease with which they visualised each referent. Differences were found between the pictorial solutions generated by males and females. However, symbol design was not influenced by participants' education level, vividness of visual imagery, object imagery preference or spatial imagery preference. Both familiar and unfamiliar referents were illustrated pictorially without much difficulty by users. The more visual the referent, the less difficulty the users had in illustrating it. The findings of this study should aid the optimisation of the stereotype production method for user-involved symbol design.     

A family of non-conforming elements and the analysis of Nitsche’s method for a singularly perturbed fourth order problem

In this paper we address several issues arising from a singularly perturbed fourth order problem with small parameter ε. First, we introduce a new family of non-conforming elements. We then prove that the corresponding finite element method is robust with respect to the parameter ε and uniformly convergent to order h ^1/2. In addition, we analyze the effect of treating the Neumann boundary condition weakly by Nitsche’s method. We show that such treatment is superior when the parameter ε is smaller than the mesh size h and obtain sharper error estimates. Such error analysis is not restricted to the proposed elements and can easily be carried out to other elements as long as the Neumann boundary condition is imposed weakly. Finally, we discuss the local error estimates and the pollution effect of the boundary layers in the interior of the domain.     

Implementing molecular dynamics on hybrid high performance computers – Particle–particle particle-mesh

The use of accelerators such as graphics processing units (GPUs) has become popular in scientific computing applications due to their low cost, impressive floating-point capabilities, high memory bandwidth, and low electrical power requirements. Hybrid high-performance computers, machines with nodes containing more than one type of floating-point processor (e.g. CPU and GPU), are now becoming more prevalent due to these advantages. In this paper, we present a continuation of previous work implementing algorithms for using accelerators into the LAMMPS molecular dynamics software for distributed memory parallel hybrid machines. In our previous work, we focused on acceleration for short-range models with an approach intended to harness the processing power of both the accelerator and (multi-core) CPUs. To augment the existing implementations, we present an efficient implementation of long-range electrostatic force calculation for molecular dynamics. Specifically, we present an implementation of the particle–particle particle-mesh method based on the work by Harvey and De Fabritiis. We present benchmark results on the Keeneland InfiniBand GPU cluster. We provide a performance comparison of the same kernels compiled with both CUDA and OpenCL. We discuss limitations to parallel efficiency and future directions for improving performance on hybrid or heterogeneous computers.