Hybrid intelligent framework for one-day ahead wind speed forecasting

Neural Computing and Applications - Nowadays wind power is considered as one of the fastest growing alternative energies, that is expected to continue to grow rapidly in the upcoming...     

Relevance feedback for CBIR: a new approach based on probabilistic feature weighting with positive and negative examples.

In content-based image retrieval, understanding the user's needs is a challenging task that requires integrating him in the process of retrieval. Relevance feedback (RF) has proven to be an effective tool for taking the user's judgement into account. In this paper, we present a new RF framework based on a feature selection algorithm that nicely combines the advantages of a probabilistic formulation with those of using both the positive example (PE) and the negative example (NE). Through interaction with the user, our algorithm learns the importance he assigns to image features, and then applies the results obtained to define similarity measures that correspond better to his judgement. The use of the NE allows images undesired by the user to be discarded, thereby improving retrieval accuracy. As for the probabilistic formulation of the problem, it presents a multitude of advantages and opens the door to more modeling possibilities that achieve a good feature selection. It makes it possible to cluster the query data into classes, choose the probability law that best models each class, model missing data, and support queries with multiple PE and/or NE classes. The basic principle of our algorithm is to assign more importance to features with a high likelihood and those which distinguish well between PE classes and NE classes. The proposed algorithm was validated separately and in image retrieval context, and the experiments show that it performs a good feature selection and contributes to improving retrieval effectiveness.     

Intrinsic nonlinear multiscale image decomposition: A 2D empirical mode decomposition-like tool

Many works have been achieved for analyzing images with a multiscale approach. In this paper, an intrinsic and nonlinear multiscale image decomposition is proposed, based on partial differential equations (PDEs) and the image frequency contents. Our model is inspired from the 2D empirical mode decomposition (EMD) for which a theoretical study is quite nonexistent, mainly because the algorithm is based on heuristic and ad hoc elements making its mathematical study hard. This work has three main advantages. Firstly, we prove that the 2D sifting process iterations are consistent with the resolution of a nonlinear PDE, by considering continuous morphological operators to build local upper and lower envelopes of the image extrema. In addition to the fact that now differential calculus can be performed on envelopes, the introduction of such morphological filters eliminates the interpolation dependency that also terribly suffers the method. Also, contrary to former 2D empirical modes, precise mathematical definition for a class of functions are now introduced thanks to the nonlinear PDE derived from the consistency result, and their characterization on the basis of Meyer spaces. Secondly, an intrinsic multiscale image decomposition is introduced based on the image frequency contents; the proposed approach almost captures the essence and philosophy of the 2D EMD and is linked to the well known Absolutely Minimizing Lipschitz Extension model. Lastly, the proposed multiscale decomposition allows a reconstruction of images. The filterbank capability of the new multiscale decomposition algorithm is shown both on synthetic and real images, and results show that our proposed approach improves a lot on the 2D EMD. Moreover, the complexity of the proposed multiscale decomposition is very reduced compared to the 2D EMD by avoiding the surface interpolation approach, which is the core of all 2D EMD algorithms and is very time consuming. For that purpose also, our work will then be a great benefit; especially, in higher dimension spaces.     

Opening web applications for third-party development: a service-oriented solution

Web applications are nowadays prevalent software systems in our everyday’s life. A lot of these applications have been developed for end users only. Thus, they are not designed by considering future extensions that would be developed by third parties. One possible and interesting solution for opening these applications for such kind of extension development is to create and deploy Web services starting from these applications. In this paper, we present a method and a tool for semiautomatically creating Web service implementations from applications having Web interfaces. The proposed method generates operations that are published in Web services for each functionality provided by a Web application. In addition, it generates new operations starting from Web interfaces. Our approach goes further in the creation of services by generating executable orchestrations, as BPEL processes, starting from navigations in the Web interfaces of these applications and by providing BPMN choreography specifications starting from the collaborations between the generated Web services. We implemented and experimented our solution in the migration of three real-world Web applications toward Web service-oriented systems.     

The Rank-Width of Edge-Coloured Graphs

A C-coloured graph is a graph, that is possibly directed, where the edges are coloured with colours from the set C. Clique-width is a complexity measure for C-coloured graphs, for finite sets C. Rank-width is an equivalent complexity measure for undirected graphs and has good algorithmic and structural properties. It is in particular related to the vertex-minor relation. We discuss some possible extensions of the notion of rank-width to C-coloured graphs. There is not a unique natural notion of rank-width for C-coloured graphs. We define two notions of rank-width for them, both based on a coding of C-coloured graphs by ${\mathbb{F}}^{*}$ -graphs— $\mathbb {F}$ -coloured graphs where each edge has exactly one colour from $\mathbb{F}\setminus \{0\},\ \mathbb{F}$ a field—and named respectively $\mathbb{F}$ -rank-width and $\mathbb {F}$ -bi-rank-width. The two notions are equivalent to clique-width. We then present a notion of vertex-minor for $\mathbb{F}^{*}$ -graphs and prove that $\mathbb{F}^{*}$ -graphs of bounded $\mathbb{F}$ -rank-width are characterised by a list of $\mathbb{F}^{*}$ -graphs to exclude as vertex-minors (this list is finite if $\mathbb{F}$ is finite). An algorithm that decides in time O(n ³) whether an $\mathbb{F}^{*}$ -graph with n vertices has $\mathbb{F}$ -rank-width (resp. $\mathbb{F}$ -bi-rank-width) at most k, for fixed k and fixed finite field $\mathbb{F}$ , is also given. Graph operations to check MSOL-definable properties on $\mathbb{F}^{*}$ -graphs of bounded $\mathbb{F}$ -rank-width (resp. $\mathbb{F}$ -bi-rank-width) are presented. A specialisation of all these notions to graphs without edge colours is presented, which shows that our results generalise the ones in undirected graphs.     

Internet addiction: Meta-synthesis of qualitative research for the decade 1996–2006

Internet addiction is “an individual’s inability to control their Internet use, which in turn leads to feelings of distress and functional impairment of daily activities” [Shapira, N., Lessig, M., Goldsmith, T., Szabo, S., Lazoritz, M., Gold, M. et al. (2003). Problematic Internet use: Proposed classification and diagnostic criteria. Depression and Anxiety, 17(4), 207–216]. Previous research in this field has offered inconclusive data on whether Internet addiction can be classified as a disorder. This study provides an in-depth and comprehensive analysis of internet addiction through a meta-synthesis of qualitative studies on excessive Internet use published during the period of 1996–2006. Several constructs pertaining to the domain of Internet addiction have been identified and a theoretical model of Internet addiction has been proposed.     

Adaptive IPTV services based on a novel IP Multimedia Subsystem

Heterogeneous communication devices are emerging and changing the way of communication. Innovative multimedia applications are now accessible through these embedded systems. The 3GPP IP Multimedia Subsystem (IMS) provides a basic architecture framework for the Next Generation Network (NGN) supporting the convergence platform for service provisioning in heterogeneous networks. ETSI TISPAN standardization effort focuses on delivering IPTV services on such platform. Nevertheless, IPTV on IMS standardization suffers from a lack of efficient user-centric network management mechanisms as the end-user may consume IPTV service from different access networks, on different mobile devices, at anytime. User’s Perceived Quality of Service (PQoS) or Quality of Experience (QoE) of IPTV service may also suffer from wireless access network impairments. This paper introduces new functionalities in IPTV over IMS architecture which optimize satisfaction of the end-user and resource utilization of the operator’s networks. A context-sensitive User Profile (UP) model is used to deliver IPTV streams adapted to the user’s environment. In order to optimize the operator network usage, the impact of spatiotemporal dynamics of the video content on the deduced perceptual quality is considered. A Multimedia Content Management System (MCMS) is proposed to perform dynamic cross-layer adaptation of the IPTV stream based on PQoS measurements at the end-user side.     

A method to select a successful interoperability solution through a simulation approach

Enterprise applications and software systems need to be interoperable in order to achieve seamless business across organizational boundaries and thus realize virtual networked organizations. Our proposition can be considered as an interoperability project selection approach and is based on three steps: (1) Modelling both collaborative business processes and potential related interoperability projects; (2) Evaluating the accessibility of each project regarding the current state of the organization; (3) Simulating each project and assessing the associated performance. These results are finally projected on a comparison matrix used as a decision support to select the most appropriate interoperability solution. An application case extracted from the French aerospace sector demonstrates the applicability and the benefits of the proposition.