Timed Specification For Web Services Compatibility Analysis

Web services are becoming one of the main technologies for designing and building complex inter-enterprise business applications. Usually, a business application cannot be fulfilled by one Web service but by coordinating a set of them. In particular, to perform a coordination, one of the important investigations is the compatibility analysis. Two Web services are said compatible if they can interact correctly. In the literature, the proposed frameworks for the services compatibility checking rely on the supported sequences of messages. The interaction of services depends also on other properties, such that the exchanged data flow. Thus, considering only supported sequences of messages seems to be insufficient. Other properties on which the services interaction can rely on, are the temporal constraints. In this paper, we focus our interest on the compatibility analysis of Web services regarding their (1) supported sequences of messages, (2) the exchanged data flow, (3) constraints related to the exchanged data flow and (4) the temporal requirements. Based on these properties, we study three compatibility classes: (i) absolute compatibility, (ii) likely compatibility and (iii) absolute incompatibility.     

Editorial

International Journal of Computer Vision -     

Training a support vector machine in the primal

Most literature on support vector machines (SVMs) concentrates on the dual optimization problem. In this letter, we point out that the primal problem can also be solved efficiently for both linear and nonlinear SVMs and that there is no reason for ignoring this possibility. On the contrary, from the primal point of view, new families of algorithms for large-scale SVM training can be investigated.     

On the hardness of offline multi-objective optimization

It has been empirically established that multiobjective evolutionary algorithms do not scale well with the number of conflicting objectives. This paper shows that the convergence rate of all comparison-based multi-objective algorithms, for the Hausdorff distance, is not much better than the convergence rate of the random search under certain conditions. The number of objectives must be very moderate and the framework should hold the following assumptions: the objectives are conflicting and the computational cost is lower bounded by the number of comparisons is a good model. Our conclusions are: (i) the number of conflicting objectives is relevant (ii) the criteria based on comparisons with random-search for multi-objective optimization is also relevant (iii) having more than 3-objectives optimization is very hard. Furthermore, we provide some insight into cross-over operators.     

d-Dimensional parametric models for dynamic animation of deformable objects

This paper introduces an accurate, efficient, and unified engine dedicated to dynamic animation of d-dimensional deformable objects. The objects are modelled as d-dimensional manifolds defined as functional combinations of a mesh of 3D control points, weighted by parametric blending functions. This model ensures that, at each time step, the object shape conforms to its manifold definitions. The object motion is deduced from the control points dynamic animation. In fact, control points should be viewed as the degrees of freedom of the continuous object. The chosen dynamic equations (Lagrangian formalism) reflect this generic modelling scheme and yield an exact and computationally efficient linear system.     

A semidynamic construction of higher-order voronoi diagrams and its randomized analysis

Thek-Delaunay tree extends the Delaunay tree introduced in [1], and [2]. It is a hierarchical data structure that allows the semidynamic construction of the higher-order Voronoi diagrams of a finite set ofn points in any dimension. In this paper we prove that a randomized construction of thek-Delaunay tree, and thus of all the orderk Voronoi diagrams, can be done inO(n logn+k ³n) expected time and O(k²n) expected storage in the plane, which is asymptotically optimal for fixedk. Our algorithm extends tod-dimensional space with expected time complexityO(k ^(d+1)/2+1 n ^(d+1)/2) and space complexityO(k ^(d+1)/2 n ^(d+1)/2). The algorithm is simple and experimental results are given.This work has been supported in part by the ESPRIT Basic Research Action No. 3075 (ALCOM).     

A digital photography framework enabling affective awareness in home communication

By transforming the personal computer into a communication appliance, the Internet has initiated the true home computing revolution. As a result, Computer Mediated Communication (CMC) technologies are increasingly used in domestic settings, and are changing the way people keep in touch with their relatives and friends. This article first looks at how CMC tools are currently used in the home, and points at some of their benefits and limitations. Most of these tools supportexplicit interpersonal communication, by providing a new medium for sustaining conversations. The need for tools supportingimplicit interaction between users, in more natural and effottless ways, is then argued for. The idea of affective awareness is introduced as a general sense of being in touch with one's family and friends. Finally, the KAN-G framework, which enables affective awareness through the exchange of digital photographs, is described. Various components, which make the capture, distribution, observation and annotation of snapshots easy and effortless, are discussed.     

Cytochemical investigation of the digestive gland of two strombidae species (Strombus gigas and Strombus pugilis) in relation to the nutrition

Strombus gigas and Strombus pugilis are threatened species and aquaculture represents a good alternative solution to the fishing. In this study, we highlighted the intracellular digestion process in the digestive gland of two Strombidae species, S. gigas and Strombuspugilis, by the cytochemical characterization of two lysosomal enzymes: acid phosphatase and arylsulfatase. In order to check the efficiency of artificial food digestion, we conducted the characterization on freshly collected, starved and artificially fed individuals of S. pugilis. TEM observations of digestive gland sections from freshly collected individuals of both species revealed the presence of acid phosphatase and arylsulfatase activity mostly located in the apical third of digestive cells. Both enzymes were also detected in artificially fed individuals. In response to the starvation, acid phosphatase is not produced anymore by digestive cells, while arylsulfatase is still present. To our knowledge, this is the first cytochemical validation of intracellular digestion of artificial food in Strombidae. This study highlights the intracellular digestion of artificial food developed for Strombidae aquaculture. Moreover, we have shown that the lysosomal activity could be used as a feed index. Microsc. Res. Tech. 2012. © 2012 Wiley Periodicals, Inc.     

Vision Based UAV Attitude Estimation: Progress and Insights

Unmanned aerial vehicles (UAVs) are increasingly replacing manned systems in situations that are dangerous, remote, or difficult for manned aircraft to access. Its control tasks are empowered by computer vision technology. Visual sensors are robustly used for stabilization as primary or at least secondary sensors. Hence, UAV stabilization by attitude estimation from visual sensors is a very active research area. Vision based techniques are proving their effectiveness and robustness in handling this problem. In this work a comprehensive review of UAV vision based attitude estimation approaches is covered, starting from horizon based methods and passing by vanishing points, optical flow, and stereoscopic based techniques. A novel segmentation approach for UAV attitude estimation based on polarization is proposed. Our future insightes for attitude estimation from uncalibrated catadioptric sensors are also discussed.