Saint-Martin-d'Hères, France
Saint-Martin-d'Hères, France

Time filter

Source Type

Garcia K.,CINVESTAV | Kirsch-Pinheiro M.,Paris-Sorbonne University | Mendoza S.,CINVESTAV | Decouchant D.,Laboratoire LIG | Decouchant D.,Metropolitan Autonomous University
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2013

Most of the working environments offer multiple hardware and software that could be shared among the members of staff. However, it could be particularly difficult to take advantages of all these resources without a proper software support capable of discovering the ones that fulfill both a user's requirements and each resource owner's sharing preferences. To try to overcome this problem, several service discovery protocols have been developed, aiming to promote the use of network resources and to reduce configuration tasks. Unfortunately, these protocols are mainly focused on finding resources based just on their type or some minimal features, lacking information about: user preferences, restrictions and contextual variables. To outstrip this deficiency, we propose to exploit the power of semantic description, by creating a knowledge base integrated by a set of ontologies generically designed to be adopted by any type of organization. To validate this proposal, we have customized the ontologies for our case of study, which is a research center. © Springer-Verlag 2013.


Heien E.M.,Laboratoire LIG | Kondo D.,Laboratoire LIG | Anderson D.P.,University of California at Berkeley
IEEE Transactions on Parallel and Distributed Systems | Year: 2012

Understanding and modeling resources of Internet end hosts are essential for the design of desktop software and Internet-distributed applications. In this paper, we develop a correlated resource model of Internet end hosts based on real-trace data taken from several volunteer computing projects, including SETI@home. This data cover a five-year period with statistics for 6.7 million hosts. Our resource model is based on statistical analysis of host computational power, memory, and storage as well as how these resources change over time and the correlations among them. We find that resources with few discrete values (core count, memory) are well modeled by approximations governing the change of relative resource quantities over time. Resources with a continuous range of values are well modeled by correlated log-normal distributions (cache, processor speed, and available disk space). We validate and show the utility of the model by applying it to a resource allocation problem for Internet-distributed applications, and compare it to other models. We also make our trace data and tool for automatically generating realistic Internet end hosts publicly available. © 1990-2012 IEEE.


Bisson G.,Laboratoire LIG | Grimal C.,Laboratoire LIG
Proceedings - IEEE International Conference on Data Mining, ICDM | Year: 2012

In many applications, entities of the domain are described through different views that clustering methods often process one by one.We introduce here the architecture MVSim, that is able to deal simultaneously with all the information contained in such multi-view datasets by using several instances of a co-similarity algorithm. We show that this architecture provides better results than both single-view and multi-view approaches and that it can be easily parallelized thus reducing both time and space complexities of the computations. © 2012 IEEE.


Garcia K.,CINVESTAV | Mendoza S.,CINVESTAV | Decouchant D.,Metropolitan Autonomous University | Decouchant D.,Laboratoire LIG | And 2 more authors.
Communications in Computer and Information Science | Year: 2011

The majority of the solutions proposed in the domain of service discovery protocols mainly focus on developing single-user applications. Consequently, these applications are unaware of third-party interventions supposing that nobody interferes nor observes. This paper describes a system for discovering sharable resources in ubiquitous collaborative environments. The proposed system is based on the publish/subscribe model, which makes possible for collaborators to: 1) publish resources to share them with their colleagues and 2) subscribe themselves to get information about resources they are interested in. Dynamic information is gathered from different sources, such as user's applications, a resource locator and a human face recognizer in order to find out the best available resource for a specific request. Resource availability is determined according to several parameters: technical characteristics, roles, usage restrictions and dependencies with other resources in terms of ownership, presence, location and even availability. © 2011 Springer-Verlag Berlin Heidelberg.


Priego-Roche L.M.,Laboratoire LIG | Front A.,Laboratoire LIG | Rieu D.,Laboratoire LIG
Requirements Engineering | Year: 2015

Virtual organizations (VOs) are formed by an alliance of organizations linked by a partnership for dealing with emerging challenges. Information and communication technologies play a fundamental role facilitating cooperation, communication and collaboration among the VO members. The formal identification and representation of Requirements Engineering (RE) for one organization have been researched to a large extent along with several elicitation techniques. However, these techniques are not adequate for covering the major challenges of RE for VO. We explore the work done in the management and RE fields to propose a model-based framework for eliciting VOs’ requirements. The goal is to analyze the VO from two points of view: border (intra-organizational, inter-organizational and extra-organizational) and abstract (intentional, organizational and operational). This article includes the framework validation with a case study and a transformation process to develop partial Business Process Diagram from the intentional models. © 2015 Springer-Verlag London


Ben Nejma G.,Laboratoire LIUPPA | Roose P.,Laboratoire LIUPPA | Gensel J.,Laboratoire LIG | Dalmau M.,Laboratoire LIUPPA
31st INFORSID 2013 | Year: 2013

This article presents the design and development of a community application that facilitates user's access to a community. The application provides multiple services in order to satisfy the needs of users united by a common interest or practice. Our approach is based on an ontology, which models the different components of a community and their relationships. Based on this ontological representation, our goal is to assist the user in his search for a community and enable him to exchange information within other members. The proposed approach has been validated through a prototype for visitors to a botanical garden. Copyright © (2013) by INFORSID.


Bougeret M.,CNRS Montpellier Laboratory of Informatics, Robotics and Microelectronics | Dutot P.-F.,Laboratoire LIG | Trystram D.,Laboratoire LIG | Trystram D.,Institut Universitaire de France
Theoretical Computer Science | Year: 2013

We consider in this paper the classical Q||Cmax scheduling problem. The objective is to minimize the maximum completion time (called makespan) while scheduling independent jobs in parallel on machines that have different speeds. While several approximation schemes has been proposed (and in particular a recent EPTAS, Jansen, 2010 [12]), the current best "direct" algorithm (i.e. an algorithm specifically designed for reaching a given approximation ratio) is still due to Chen (1991) [4] with a 1.382 ratio. Our objective in this work is not to provide yet another improvement of the asymptotic dependencies in 1/∈ (ensuring a (1+∈) ratio), but to design faster direct algorithms by targeting respectively 4/3 and 5/4 ratios. Indeed, instantiating any of the existing approximation scheme for ∈=1/3 (respectively 1/4) leads to polynomial complexities, but not to practical algorithms because of the hidden large constants in the computational complexity. Thus, our approach focuses on a moderately exponential algorithm and provides a (4/3+∈) dual approximation algorithm running in O(m (1+1/3∈)log(3(β+1))(m+n)), where m is the number of machines, n the number of jobs, β an integer lower than m depending on the instance. This result is obtained through an oracle framework, where the algorithm guesses possible answers from an oracle. The terseness of the answers points out the critical information needed while solving any instance. Such an approach leads to a better comprehension of the problem. Similarly, we obtain the same kind of results for a 5/4+∈ ratio. Moreover, the proposed techniques seem promising for tackling classical specific cases (like scheduling on identical machines), as the complexity becomes a low degree polynomial when the speeds are non arbitrary. © 2013 Elsevier B.V. All rights reserved.


Nejma G.B.,Laboratoire LIUPPA | Roose P.,Laboratoire LIUPPA | Dalmau M.,Laboratoire LIUPPA | Gensel J.,Laboratoire LIG
Ingenierie des Systemes d'Information | Year: 2013

In recent years, there has been a phenomenal growth of the number of devices (e.g. smartphones, touchpads, laptops, sensors, etc.) and mobile applications. Community application fit this trend. The application provides multiple services in order to satisfy the needs of users who share common interests or practices. This application allows users to communicate, share information and access to virtual community services. In this paper, we introduce the notion of spontaneous community with geolocalisation. Then we present a model of community based on ontology. Our goal is to assist the user in his search for a community. The proposed approach has been validated through a prototype for visitors to a botanical garden. © 2013 Lavoisier.

Loading Laboratoire LIG collaborators
Loading Laboratoire LIG collaborators