Generic Self-calibration of Central Cameras from Two Rotational Flows

We address the self-calibration of a smooth generic central camera from only two dense rotational flows produced by rotations of the camera about two unknown linearly independent axes passing through the camera centre. We give a closed-form theoretical solution to this problem, and we prove that it can be solved exactly up to a linear orthogonal transformation ambiguity. Using the theoretical results, we propose an algorithm for the self-calibration of a generic central camera from two rotational flows.     

Time-extended multi-robot coordination for domains with intra-path constraints

Many applications require teams of robots to cooperatively execute tasks. Among these domains are those in which successful coordination must respect intra-path constraints, which are constraints that occur on the paths of agents and affect route planning. This work focuses on multi-agent coordination for disaster response with intra-path precedence constraints, a compelling application that is not well addressed by current coordination methods. In this domain a group of fire truck agents attempt to address fires spread throughout a city in the wake of a large-scale disaster. The disaster has also caused many city roads to be blocked by impassable debris, which can be cleared by bulldozer robots. A high-quality coordination solution must determine not only a task allocation but also what routes the fire trucks should take given the intra-path precedence constraints and which bulldozers should be assigned to clear debris along those routes.     

Bio-PEPA: A framework for the modelling and analysis of biological systems

In this work we present Bio-PEPA, a process algebra for the modelling and the analysis of biochemical networks. It is a modification of PEPA, originally defined for the performance analysis of computer systems, in order to handle some features of biological models, such as stoichiometry and the use of general kinetic laws. Bio-PEPA may be seen as an intermediate, formal, compositional representation of biological systems, on which different kinds of analyses can be carried out. Bio-PEPA is enriched with some notions of equivalence. Specifically, the isomorphism and strong bisimulation for PEPA have been considered and extended to our language. Finally, we show the translation of a biological model into the new language and we report some analysis results.     

Adapting application execution in CMPs using helper threads

In parallel to the changes in both the architecture domain–the move toward chip multiprocessors (CMPs)–and the application domain–the move toward increasingly data-intensive workloads–issues such as performance, energy efficiency and CPU availability are becoming increasingly critical. The CPU availability can change dynamically due to several reasons such as thermal overload, increase in transient errors, or operating system scheduling. An important question in this context is how to adapt, in a CMP, the execution of a given application to CPU availability change at runtime. Our paper studies this problem, targeting the energy-delay product (EDP) as the main metric to optimize. We first discuss that, in adapting the application execution to the varying CPU availability, one needs to consider the number of CPUs to use, the number of application threads to accommodate and the voltage/frequency levels to employ (if the CMP has this capability). We then propose to use helper threads to adapt the application execution to CPU availability change in general with the goal of minimizing the EDP. The helper thread runs parallel to the application execution threads and tries to determine the ideal number of CPUs, threads and voltage/frequency levels to employ at any given point in execution. We illustrate this idea using four applications (Fast Fourier Transform, MultiGrid, LU decomposition and Conjugate Gradient) under different execution scenarios. The results collected through our experiments are very promising and indicate that significant EDP reductions are possible using helper threads. For example, we achieved up to 66.3%, 83.3%, 91.2%, and 94.2% savings in EDP when adjusting all the parameters properly in applications FFT, MG, LU, and CG, respectively. We also discuss how our approach can be extended to address multi-programmed workloads.     

Computing the null space of finite element problems

We present a method for computing the null space of finite element models, including models with equality constraints. The method is purely algebraic; it requires access to the element matrices, but not to the geometry or material properties of the model.Theoretical considerations show that under certain conditions, both the amount of computation and the amount of memory required by our method scale linearly with model size; memory scales linearly but computation scales quadratically with the dimension of the null space. Our experiments confirm this: the method scales extremely well on 3-dimensional model problems. In general, large industrial models do not satisfy all the conditions that the theoretical results assume; however, experimentally the method performs well and outperforms an established method on industrial models, including models with many equality constraints.The accuracy of the computed null vectors is acceptable, but the method is usually less accurate than a more naive (and computationally much more expensive) method.     

An SNS-based model for finding collaborative partners

This paper proposes a model, Recommendation of Appropriate Partners (RAP), used on a Social Networking Service (SNS) for locating appropriate “helpers” for users based on individual users’ Chain of Friends (CoF) relationships. Using the RAP model, individual users can participate in a collaborative online community in remote locations, whereby helpers are willing to help other users solve their tasks/problems, and it is intended that both the users and helpers gain knowledge from these interactive online sessions. An example of the RAP-based system was implemented to invite Program Committee members to an international conference. The system was evaluated and the experimental results show that our model is very effective for discovering collaboration partners and finding users with similar interests in order to create communities for providing future and longer-term helping exchange.

     

Practical prototyping

The design of robotic mechanisms is a complex process involving geometric, kinematic, dynamic, tolerance, and stress analyses. In the design of a real system, the construction of a physical prototype is often considered. Indeed, a physical prototype helps the designer to identify the fundamental characteristics and the potential pitfalls of the proposed architecture. However, the design and fabrication of a prototype using traditional techniques is rather long, tedious, and costly. In this context, the availability of rapid prototyping machines can be exploited in order to allow designers of robotic mechanisms to build prototypes rapidly and at a low cost. In the article, the rapid prototyping of mechanisms using a commercially available computer-aided design (CAD) package and a fused deposition modeling (FDM) rapid prototyping machine is presented. A database of lower kinematic pairs (joints) is developed using the CAD package, and parameters of fabrication are determined experimentally for each of the joints. These joints are then used in the design of the prototypes where the links are developed and adapted to the particular geometries of the mechanisms to be built. Also, a procedure is developed to build gears and Geneva mechanisms. Examples of mechanisms are then studied and their design is presented. For each mechanism, the joints are described and the design of the links is discussed. Some of the physical prototypes built using the FDM rapid prototyping machine are shown     

Interactive classification for pre-integrated volume rendering of high-precision volume data

The pre-integrated volume rendering technique is widely used for creating high quality images. It produces good images even though the transfer function is nonlinear. Because the size of the pre-integration lookup table is proportional to the square of data precision, the required storage and computation load steeply increase for rendering of high-precision volume data. In this paper, we propose a method that approximates the pre-integration function proportional to the data precision. Using the arithmetic mean instead of the geometric mean and storing opacity instead of extinction density, this technique reduces the size and the update time of the pre-integration lookup table so that it classifies high-precision volume data interactively. We demonstrate performance gains for typical renderings of volume datasets.     

The Other Mathematical Bridge

This paper contextualises, describes and discusses a student project which takes a particular exploratory approach to using mathematical surface definition as a language and vehicle for co-rational design co-authorship for architecture and engineering. The project has two authors, one from an architectural and one from an engineering educational background. It investigates the metaphorical and operational role of mathematics in the design process and outcomes.