MPGS: an interactive tool for the specification and generation ofmultimedia presentations

Multimedia presentations are composed of objects belonging to different data types such as video, audio, text and image. An important aspect is that, quite often, the user defining a presentation needs to express sophisticated temporal and spatial constraints among the objects composing the presentation. We present a system (called MPGS-Multimedia Presentation Generator System) which supports the specification of constraints among multimedia objects and the generation of multimedia presentations according to the specified constraints. The constraint model provided by MPGS is very flexible and powerful in terms of the kinds of object constraints it can represent. A large number of innovative features are supported including: asynchronous and simultaneous spatial constraints; components of interest and priority levels; motion functions. Obviously, the flexibility provided to the users requires the development of nontrivial techniques to check constraint consistency and to generate a presentation satisfying the specified constraints. We illustrate the solutions we have devised in the framework of MPGS     

Information systems for enhancing social experience in a conference context: A sensor based approach

We combine Auto Identification and Web technologies in an extensible on-site event support system for enhancing experience of conference organizers as well as participants. Our system enables users to authenticate themselves using RFID badges and to access interactive, Web-based services via a touchscreen PC. The developed services aim at supporting social interactions of participants, and thus validate the promising usage directions of the combination of offline social networks and the online social Web. The main hypothesis of our work is that: ??A sensor based information system can truly enhance social conference experience.?? Technically, we have investigated employment of Web 2.0 technologies in social, sensor and mobile technologies enabled systems at conferences and events. This article gives an overview of the overall system and its evaluation via a user survey and usage log data collected during the Extended Semantic Web Conference (ESWC) 2010 and similar international conferences, altogether with several hundred participants.     

Project proposal for the investigation of particle-stabilised emulsions and foams by microgravity experiments

The utilisation of particle-surfactants nanostructures as stabilising agents represents today the technologic and scientific frontier in the stabilisation of liquid films in emulsion and foams. This topic will be addressed by the proposal STEFAN (STabilisation of Emulsions and FoAms by Nanoparticles), proposed by European groups in the framework of the ESA AO-2004 for Life and Physical Sciences and Applied Research projects Similarly to what can be observed for surfactant-stabilised emulsions and foams, microgravity provides ideal conditions for the investigation of the hierarchy of involved objects: interfacial layer, liquid film, dispersed systems foam or emulsion. Microgravity experiments are planned by refurbishing the Experimental Container FASES for the ISS Fluid Science Laboratory and the facility FASTER for the European Drawer Rack, already under development in existing research programmes. Here the scientific guidelines of the project are presented together with examples and preliminary results on the effect of nano-particle-surfactant structures adsorbed at liquid interfaces. First experimental results have been achieved for particle monolayers at the water/air interface and a thermodynamic model was derived to describe the obtained surface pressure-area isotherms.     

Rheological studies with spherically shaped thin liquid films

The present work shows the first experimental and theoretical results for investigations on the rheology of liquid films. The experiments are planned to be performed under microgravity conditions. This environment will allow forming films of different thickness, which is impossible under ground conditions due to drainage. Then the films are forced to harmonic oscillations of the film area so that the film elasticity can be measured as a function of frequency. The presented theoretical model demonstrates the main relationships to be solved under corresponding boundary conditions     

Automatic multiscale meshing through HRBF networks

A procedure for the real-time construction of three-dimensional (3-D) multiscale meshes from not evenly sampled 3-D points is described and discussed in this paper. The process is based on the connectionist model named hierarchical radial basis functions network (HRBF), which has been proved effective in the reconstruction of smooth surfaces from sparse noisy data points. The network goal is to achieve a uniform reconstruction error, equal to measurement error, by stacking noncomplete grids of Gaussians at decreasing scales. It is shown here how the HRBF properties can be used to develop a configuration algorithm, which produces a continuous surface in real time. In addition, the model is extended to automatically convert the continuous surface into a 3-D mesh according to an adequate error measure.     

Surface Segregation Mechanisms in Ferroelectric Thin Films

Reliability issues have hampered the adoption of ferroelectric thin films by the microelectronics industry. One of these is imprint, an important problem affecting the performance of ferroelectric non-volatile memories. This paper presents the effects of the low temperature pyrolysis step on the chemical and physical properties of SrBi₂Ta₂O₉ films. A comparison of the hysteretic properties and composition profiles shows that control of the oxidising conditions during pyrolysis is critical to the dielectric properties. Data from this work and from the literature have been used to construct a model that explains the origin of surface depletion and segregation, self poling and as-grown imprint in ferroelectric films.     

Multirobot motion coordination in space and time

This paper describes a solution to the multirobot motion planning problem based on a decoupled analysis in the space domain and in the time domain. It investigates the practical use of the notion of motion plan quality and of the motion plan robustness measures for computing safe motions. The use of anytime algorithms allows one to evaluate the opportunity of looking for alternative solution paths by generating small variations of robot motions affecting both its geometrical path and its scheduled velocity. By using the concept of plan robustness, several alternative paths are generated and evaluated through various performance indices and impact factors, using heuristic rules. These indices allow one to know how much a variation affects a given plan. Finally, some recent experiments are outlined.     

Multiscale approximation with hierarchical radial basis functions networks

An approximating neural model, called hierarchical radial basis function (HRBF) network, is presented here. This is a self-organizing (by growing) multiscale version of a radial basis function (RBF) network. It is constituted of hierarchical layers, each containing a Gaussian grid at a decreasing scale. The grids are not completely filled, but units are inserted only where the local error is over threshold. This guarantees a uniform residual error and the allocation of more units with smaller scales where the data contain higher frequencies. Only local operations, which do not require any iteration on the data, are required; this allows to construct the network in quasi-real time. Through harmonic analysis, it is demonstrated that, although a HRBF cannot be reduced to a traditional wavelet-based multiresolution analysis (MRA), it does employ Riesz bases and enjoys asymptotic approximation properties for a very large class of functions. HRBF networks have been extensively applied to the reconstruction of three-dimensional (3-13) models from noisy range data. The results illustrate their power in denoising the original data, obtaining an effective multiscale reconstruction of better quality than that obtained by MRA.     

A Mixed Closure-CSP Method for Solving Scheduling Problems

Scheduling problems can be viewed as a set of temporal metric and disjunctive constraints and so they can be formulated in terms of CSP techniques. In the literature, there are CSP-based methods which sequentially interleave search efforts with the application of consistency enforcing mechanisms and variable/ordering heuristics. Therefore, the number of backtrackings needed to obtain a solution is reduced. In this paper, we propose a new method that effectively integrates the CSP process into a limited closure process: not by interleaving them but rather as a part of the same process. Such an integration allows us to define more informed heuristics. These heuristics are used to limit the complete closure process to a maximum number of disjunctions, thereby reducing its complexity while at the same time reducing the search space. Some open disjunctive solutions can be maintained in the CSP process, limiting the number of backtrackings necessary, and avoiding having to know all the problem constraints in advance. Our experiments with flow-shop and job-shop instances show that this approach obtains a feasible solution/optimal solution without having to use backtracking in most cases. We also analyze the behaviour of our algorithm when some constraints are known dynamically and we demonstrate that it can provide better results than a pure CSP process.     

A Lagrange duality characterisation for stability under arbitrary switching in switched positive linear systems

The present communication is concerned with uniform exponential stability, under arbitrary switching, in discrete-time switched positive linear systems. Lagrange duality is used in order to obtain a new characterisation for uniform exponential stability which is in terms of sets of inequalities involving each of the matrices that represent the modes of the system. These sets of inequalities are shown to generalise the classical linear Lyapunov inequality that characterises, in positive matrices, the property of being Schur. Each solution to these sets of inequalities is shown to provide a representation, in terms of a number of linear functionals, for a common Lyapunov function for the switched positive linear system. A result is further presented which conveys to, a conservative upper bound on the minimum required number of linear functionals (in the above mentioned representation), and also to a method for computing them. Our proof for the aforementioned characterisation is based on another (equivalent) characterisation, in terms of the solvability of a dynamic programming equation associated to the switched positive linear system, which is also reported in the paper. In particular, it is shown that the associated dynamic programming equation has at most one solution. And this solution is shown to be convex, monotonic, positively homogeneous, and it yields a common Lyapunov function for the switched positive linear system.