Page 1. Papiers présentés à la conférence Renpar 2002 Yaya SLIMANI et Denis TRYSTRAM 2 juin 2004 ... more Page 1. Papiers présentés à la conférence Renpar 2002 Yaya SLIMANI et Denis TRYSTRAM 2 juin 2004 Page 2. ... L'ensemble des opérations est ordonné, et changer l'ordre des opérations change le programme, de même que changer l'ordre des notes change la mélodie. ...
... 81,00 Ajouter au panier le numéro de revue de TRYSTRAM Denis, SLIMANI Yahia, JEMNI Mohamed.... more ... 81,00 Ajouter au panier le numéro de revue de TRYSTRAM Denis, SLIMANI Yahia, JEMNI Mohamed. Date de parution : 03-2005 Support : Numéro de revue Langue : FRANÇAIS 286p. ... Gestion des ressources -O. Beaumont, V. Boudet, P.-F. Dutot, Y. Robert, D. Trystram. ...
2007 International Conference on Multimedia and Ubiquitous Engineering (MUE'07), 2007
ABSTRACT One of the principal motivations to use the grids computing and data grids comes from th... more ABSTRACT One of the principal motivations to use the grids computing and data grids comes from the applications using of large sets from data, for example, in high-energy physics or life science to improve the total output of the software environments used to carry these applications on the grids, data replication are deposited on various selected sites. In the field of the grids the majority of the strategies of replication of the data and scheduling of the jobs were tested by simulation. Several simulators of grids were born. One of the most simulators interesting for our study is the OptorSim tool. In this paper, we present an extension of the OptorSim simulator by a consistency management module of the replicas in the Data Grids. This extension corresponds to a hybrid approach of consistency, it inspired by the pessimistic and optimistic approaches of consistency. This suggested approach has two vocations, in the first time, it makes it possible to reduce the response times compared with the completely pessimistic approach, in the second time, it gives a good quality of service compared with the optimistic approach.
2010 International Conference on Information Retrieval & Knowledge Management (CAMP), 2010
Many approaches of terminology extraction make use of contextual information to acquire relations... more Many approaches of terminology extraction make use of contextual information to acquire relations between terms. The quality and the quantity of this information influence the accuracy of the terminology extractor. In this paper, we assume that logical structure of documents constitute a rich source of contextual information which can be used to infer semantic relations between terms and thus construct
Abstract—In this paper, we propose an adaptation of the Patricia-Tree for sparse datasets to gene... more Abstract—In this paper, we propose an adaptation of the Patricia-Tree for sparse datasets to generate ,non ,redundant ,rule associations. Using this adaptation, we can generate frequent closed itemsets that are more compact,than frequent itemsets used in Apriori approach. This adaptation has been experimented,on a set of datasets benchmarks. Keywords—Datamining, Frequent itemsets, Frequent closed
The combinatorial nature of the Feature Selection problem has made the use of heuristic methods i... more The combinatorial nature of the Feature Selection problem has made the use of heuristic methods indispensable even for moderate dataset dimensions. Recently, several optimization paradigms emerged as attractive alternatives to classic heuristic based approaches. In this paper, we propose a new an adapted Particle Swarm Optimization for the exploration of the feature selection problem search space. In spite of the
Feature subset selection is an important preprocessing and guiding step for classification. The c... more Feature subset selection is an important preprocessing and guiding step for classification. The combinatorial nature of the problem have made the use of evolutionary and heuristic methods indispensble for the exploration of high dimensional problem search spaces. In this paper, a set of hybridization schemata of genetic algorithm with local search are investigated through a memetic framework. Empirical study compares
Page 1. Papiers présentés à la conférence Renpar 2002 Yaya SLIMANI et Denis TRYSTRAM 2 juin 2004 ... more Page 1. Papiers présentés à la conférence Renpar 2002 Yaya SLIMANI et Denis TRYSTRAM 2 juin 2004 Page 2. ... L'ensemble des opérations est ordonné, et changer l'ordre des opérations change le programme, de même que changer l'ordre des notes change la mélodie. ...
... 81,00 Ajouter au panier le numéro de revue de TRYSTRAM Denis, SLIMANI Yahia, JEMNI Mohamed.... more ... 81,00 Ajouter au panier le numéro de revue de TRYSTRAM Denis, SLIMANI Yahia, JEMNI Mohamed. Date de parution : 03-2005 Support : Numéro de revue Langue : FRANÇAIS 286p. ... Gestion des ressources -O. Beaumont, V. Boudet, P.-F. Dutot, Y. Robert, D. Trystram. ...
2007 International Conference on Multimedia and Ubiquitous Engineering (MUE'07), 2007
ABSTRACT One of the principal motivations to use the grids computing and data grids comes from th... more ABSTRACT One of the principal motivations to use the grids computing and data grids comes from the applications using of large sets from data, for example, in high-energy physics or life science to improve the total output of the software environments used to carry these applications on the grids, data replication are deposited on various selected sites. In the field of the grids the majority of the strategies of replication of the data and scheduling of the jobs were tested by simulation. Several simulators of grids were born. One of the most simulators interesting for our study is the OptorSim tool. In this paper, we present an extension of the OptorSim simulator by a consistency management module of the replicas in the Data Grids. This extension corresponds to a hybrid approach of consistency, it inspired by the pessimistic and optimistic approaches of consistency. This suggested approach has two vocations, in the first time, it makes it possible to reduce the response times compared with the completely pessimistic approach, in the second time, it gives a good quality of service compared with the optimistic approach.
2010 International Conference on Information Retrieval & Knowledge Management (CAMP), 2010
Many approaches of terminology extraction make use of contextual information to acquire relations... more Many approaches of terminology extraction make use of contextual information to acquire relations between terms. The quality and the quantity of this information influence the accuracy of the terminology extractor. In this paper, we assume that logical structure of documents constitute a rich source of contextual information which can be used to infer semantic relations between terms and thus construct
Abstract—In this paper, we propose an adaptation of the Patricia-Tree for sparse datasets to gene... more Abstract—In this paper, we propose an adaptation of the Patricia-Tree for sparse datasets to generate ,non ,redundant ,rule associations. Using this adaptation, we can generate frequent closed itemsets that are more compact,than frequent itemsets used in Apriori approach. This adaptation has been experimented,on a set of datasets benchmarks. Keywords—Datamining, Frequent itemsets, Frequent closed
The combinatorial nature of the Feature Selection problem has made the use of heuristic methods i... more The combinatorial nature of the Feature Selection problem has made the use of heuristic methods indispensable even for moderate dataset dimensions. Recently, several optimization paradigms emerged as attractive alternatives to classic heuristic based approaches. In this paper, we propose a new an adapted Particle Swarm Optimization for the exploration of the feature selection problem search space. In spite of the
Feature subset selection is an important preprocessing and guiding step for classification. The c... more Feature subset selection is an important preprocessing and guiding step for classification. The combinatorial nature of the problem have made the use of evolutionary and heuristic methods indispensble for the exploration of high dimensional problem search spaces. In this paper, a set of hybridization schemata of genetic algorithm with local search are investigated through a memetic framework. Empirical study compares
Uploads