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.     

Analyzing Automata with Presburger Arithmetic and Uninterpreted Function Symbols

We study a class of extended automata defined by guarded commands over Presburger arithmetic with uninterpreted functions. On the theoretical side, we show that the bounded reachability problem is decidable in this model. On the practical side, the class is useful for modeling programs with unbounded data structures, and the reachability procedure can be used for symbolic simulation, testing, and verification.     

Adaptive observer design for discrete time LTV systems

In this paper, the discrete-time exponential forgetting factor observer is specialised for the joint estimation of state and parameters, leading to an adaptive observer in which the decay rates of the estimation errors for the two distinct objects can be quasi-separated. The effectiveness of the observer is demonstrated through numerical simulation.     

Team NimbRo at MBZIRC 2017: Fast landing on a moving target and treasure hunting with a team of micro aerial vehicles

The Mohamed Bin Zayed International Robotics Challenge (MBZIRC) 2017 has defined ambitious new benchmarks to advance the state‐of‐the‐art in autonomous operation of ground‐based and flying robots. This study covers our approaches to solve the two challenges that involved micro aerial vehicles (MAV). Challenge 1 required reliable target perception, fast trajectory planning, and stable control of an MAV to land on a moving vehicle. Challenge 3 demanded a team of MAVs to perform a search and transportation task, coined “Treasure Hunt,” which required mission planning and multirobot coordination as well as adaptive control to account for the additional object weight. We describe our base MAV setup and the challenge‐specific extensions, cover the camera‐based perception, explain control and trajectory‐planning in detail, and elaborate on mission planning and team coordination. We evaluated our systems in simulation as well as with real‐robot experiments during the competition in Abu Dhabi. With our system, we—as part of the larger team NimbRo—won the MBZIRC Grand Challenge and achieved a third place in both subchallenges involving flying robots.     

Selective voltammetric determination of electroactive neuromodulating species in biological samples using iron(II) phthalocyanine modified multi-wall carbon nanotubes paste electrode

Iron(II) phthalocyanine (FePc) modified multi-wall carbon nanotubes paste electrodes (MWCNTPEs) were used as voltammetric sensors to selectively detect dopamine (DA) in the presence of serotonin (5-HT). The electrochemical behavior of DA at the new modified electrode was investigated using CV. The enhanced current response of DA indicates that FePc modification of the MWCNTPE surface results in a high catalytic activity for the redox reaction of DA. Differential pulse voltammetry was applied in detection of DA and 5-HT at FePc-MWCNTPE. The method parameters were optimized. Detection limit of 2.05 × 10⁻⁷ M was obtained for DA by using the electrocatalytic oxidation signal corresponding to the Fe^II/Fe^III redox process. The separation between the peak potentials of DA and 5-HT is 170 mV which is large enough for the simultaneously, selective determination of the two chemical species in their mixtures. There was no electrochemical response for ascorbic acid (AA) added in the sample. The monoamine neurotransmitter measuring method has been tested in analyzing deproteinized serum samples.     

IRS-III: A broker-based approach to semantic Web services

A factor limiting the take up of Web services is that all tasks associated with the creation of an application, for example, finding, composing, and resolving mismatches between Web services have to be carried out by a software developer. Semantic Web services is a combination of semantic Web and Web service technologies that promise to alleviate these problems. In this paper we describe IRS-III, a framework for creating and executing semantic Web services, which takes a semantic broker-based approach to mediating between service requesters and service providers. We describe the overall approach and the components of IRS-III from an ontological and architectural viewpoint. We then illustrate our approach through an application in the eGovernment domain.     

Extreme simplification and rendering of point sets using algebraic multigrid

We present a novel approach for extreme simplification of point set models, in the context of real-time rendering. Point sets are often rendered using simple point primitives, such as oriented discs. However, this requires using many primitives to render even moderately simple shapes. Often, one wishes to render a simplified model using only a few primitives, thus trading accuracy for simplicity. For this goal, we propose a more complex primitive, called a splat, that is able to approximate larger and more complex surface areas than oriented discs. We construct our primitive by decomposing the model into quasi-flat regions, using an efficient algebraic multigrid algorithm. Next, we encode these regions into splats implemented as planar support polygons textured with color and transparency information and render the splats using a special blending algorithm. Our approach combines the advantages of mesh-less point-based techniques with traditional polygon-based techniques. We demonstrate our method on various models.     

3D multi-material and multi-joint topology optimization with tooling accessibility constraints

Structural and Multidisciplinary Optimization - This paper proposes a method for performing both multi-material topology optimization and multi-joint topology optimization. The algorithm can...     

Evolutionary algorithms for continuous-space optimisation

From a global viewpoint, evolutionary algorithms (EAs) working on continuous search-spaces can be regarded as homogeneous Markov chains (MCs) with discrete time and continuous state. We analyse from this viewpoint the (1?+?1)EA on the inclined plane fitness landscape, and derive a closed-form expression for the probability of occupancy of an arbitrary target zone, at an arbitrary iteration of the EA. For the hitting-time of an arbitrary target zone, we provide lower and upper bounds, as well as an asymptotic limit. Discretization leads to an MC with discrete time, whose simple structure is exploited to carry out efficient numerical investigations of the theoretical results obtained. The numerical results thoroughly confirm the theoretical ones, and also suggest various conjectures which go beyond the theory.