<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Aouadj, Wafa</style></author><author><style face="normal" font="default" size="100%">Abdessemed, Mohamed Rida</style></author><author><style face="normal" font="default" size="100%">Seghir, Rachid</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Discrete Large-scale Multi-Objective Teaching-Learning-Based Optimization Algorithm</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 4th International Conference on Networking, Information Systems &amp; Security</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2021</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2021</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://dl.acm.org/doi/abs/10.1145/3454127.3456609</style></url></web-urls></urls><pages><style face="normal" font="default" size="100%">1-6</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">This paper presents a teaching-learning-based optimization algorithm for discrete large-scale multi-objective problems (DLM-TLBO). Unlike the previous variants, the learning strategy used by each individual and the acquired knowledge are defined based on its level. The proposed approach is used to solve a bi-objective object clustering task (B-OCT) in a swarm robotic system, as a case study. The simple robots have as mission the gathering of a number of objects distributed randomly, while respecting two objectives: maximizing the clustering quality, and minimizing the energy consumed by these robots. The simulation results of the proposed algorithm are compared to those obtained by the well-known algorithm NSGA-II. The results show the superiority of the proposed DLM-TLBO in terms of the quality of the obtained Pareto front approximation and convergence speed.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Kadache, Nabil</style></author><author><style face="normal" font="default" size="100%">Seghir, Rachid</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A New Social Volunteer Computing Environment With Task-Adapted Scheduling Policy (TASP)</style></title><secondary-title><style face="normal" font="default" size="100%">International Journal of Grid and High Performance Computing (IJGHPC)International Journal of Grid and High Performance Computing (IJGHPC)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2021</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2021</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">2</style></number><volume><style face="normal" font="default" size="100%">13</style></volume><pages><style face="normal" font="default" size="100%">39-55</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Mezzoudj, Saliha</style></author><author><style face="normal" font="default" size="100%">Behloul, Ali</style></author><author><style face="normal" font="default" size="100%">Seghir, Rachid</style></author><author><style face="normal" font="default" size="100%">Saadna, Yassmina</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A parallel content-based image retrieval system using spark and tachyon frameworks</style></title><secondary-title><style face="normal" font="default" size="100%">Journal of King Saud University - Computer and Information SciencesJournal of King Saud University - Computer and Information Sciences</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2021</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2021</style></date></pub-dates></dates><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">With the huge increase of large-scale multimedia over Internet, especially images, building Content-Based Image Retrieval (CBIR) systems for large-scale images has become a big challenge. One of the drawbacks associated with CBIR is the very long execution time. In this article, we propose a fast Content-Based Image Retrieval system using Spark (CBIR-S) targeting large-scale images. Our system is composed of two steps.&amp;nbsp;(i) image indexation step, in which we use&amp;nbsp;MapReduce&amp;nbsp;distributed model on Spark in order to speed up the indexation process. We also use a memory-centric&amp;nbsp;distributed storage system, called Tachyon, to enhance the write operation&amp;nbsp;(ii) image retrieving step&amp;nbsp;which we speed up by using a parallel k-Nearest Neighbors (k-NN) search method based on&amp;nbsp;MapReduce model&amp;nbsp;implemented under&amp;nbsp;Apache Spark, in addition to exploiting the cache method of spark framework. We have showed, through a wide set of experiments, the effectiveness of our approach in terms of processing time.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Aouadj, Wafa</style></author><author><style face="normal" font="default" size="100%">Abdessemed, Mohamed-Rida</style></author><author><style face="normal" font="default" size="100%">Seghir, Rachid</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Reliable Behavioral Model: Optimizing Energy Consumption and Object Clustering Quality by Naïve Robots</style></title><secondary-title><style face="normal" font="default" size="100%">International Journal of Swarm Intelligence Research (IJSIR)International Journal of Swarm Intelligence Research (IJSIR)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2021</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2021</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">4</style></number><volume><style face="normal" font="default" size="100%">12</style></volume><pages><style face="normal" font="default" size="100%">125-145</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Kadache, Nabil</style></author><author><style face="normal" font="default" size="100%">Seghir, Rachid</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A New Social Volunteer Computing Environment With Task-Adapted Scheduling Policy (TASP)</style></title><secondary-title><style face="normal" font="default" size="100%">International Journal of Grid and High Performance Computing (IJGHPC)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2021</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.igi-global.com/article/a-new-social-volunteer-computing-environment-with-task-adapted-scheduling-policy-tasp/273653</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">IGI Global</style></publisher><volume><style face="normal" font="default" size="100%">13</style></volume><pages><style face="normal" font="default" size="100%">39-55</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;text-align: justify;&quot;&gt;
	Volunteer computing (VC) has become a relatively mature technique of distributed computing. It is based on exploiting the idle time of ordinary online machines with the consent of their owners. Target applications are generally scientific projects requiring a huge amount of computational resources. Existing VC platforms raise several challenges. This work attempts to bring solutions for two defeats. The first one is the involvement of volunteers; the decreasing of participants affects the global performances. To cope with this, a new social volunteer computing environment is proposed in order to involve more volunteers. The second addressed problem is the task scheduling, which aims to optimize the use of resources. The proposed algorithm generates for each resource's class, a number of tasks whose cost of execution reflects the momentary capacity of the resources. The new solutions are validated through a theory of number's project, called “Collatz Conjecture.”
&lt;/p&gt;
</style></abstract><issue><style face="normal" font="default" size="100%">2</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Benbelgacem, Sonia</style></author><author><style face="normal" font="default" size="100%">Larbi GUEZOULI</style></author><author><style face="normal" font="default" size="100%">Seghir, Rachid</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Distributed Information Retrieval Approach for Copyright Protection</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 3rd International Conference on Networking, Information Systems &amp; Security</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2020</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2020</style></date></pub-dates></dates><pages><style face="normal" font="default" size="100%">1-6</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Baroudi, Toufik</style></author><author><style face="normal" font="default" size="100%">Loechner, Vincent</style></author><author><style face="normal" font="default" size="100%">Seghir, Rachid</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Static versus dynamic memory allocation: a comparison for linear algebra kernels</style></title><secondary-title><style face="normal" font="default" size="100%">IMPACT 2020, in conjunction with HiPEAC 2020</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2020</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2020</style></date></pub-dates></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Mezzoudj, Saliha</style></author><author><style face="normal" font="default" size="100%">Behloul, Ali</style></author><author><style face="normal" font="default" size="100%">Seghir, Rachid</style></author><author><style face="normal" font="default" size="100%">Saadna, Yassmina</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A parallel content-based image retrieval system using spark and tachyon frameworks</style></title><secondary-title><style face="normal" font="default" size="100%">Journal of King Saud University - Computer and Information SciencesJournal of King Saud University - Computer and Information Sciences</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2019</style></date></pub-dates></dates><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">With the huge increase of large-scale multimedia over Internet, especially images, building Content-Based Image Retrieval (CBIR) systems for large-scale images has become a big challenge. One of the drawbacks associated with CBIR is the very long execution time. In this article, we propose a fast Content-Based Image Retrieval system using Spark (CBIR-S) targeting large-scale images. Our system is composed of two steps.&amp;nbsp;(i) image indexation step, in which we use&amp;nbsp;MapReduce&amp;nbsp;distributed model on Spark in order to speed up the indexation process. We also use a memory-centric&amp;nbsp;distributed storage system, called Tachyon, to enhance the write operation&amp;nbsp;(ii) image retrieving step&amp;nbsp;which we speed up by using a parallel k-Nearest Neighbors (k-NN) search method based on&amp;nbsp;MapReduce model&amp;nbsp;implemented under&amp;nbsp;Apache Spark, in addition to exploiting the cache method of spark framework. We have showed, through a wide set of experiments, the effectiveness of our approach in terms of processing time.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Baroudi, Toufik</style></author><author><style face="normal" font="default" size="100%">Seghir, Rachid</style></author><author><style face="normal" font="default" size="100%">Loechner, Vincent</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Optimization of Triangular and Banded Matrix Operations Using 2d-Packed Layouts</style></title><secondary-title><style face="normal" font="default" size="100%">ACM Transactions on Architecture and Code Optimization (TACO)ACM Transactions on Architecture and Code Optimization (TACO)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2017</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">4</style></number><volume><style face="normal" font="default" size="100%">14</style></volume><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Over the past few years, multicore systems have become increasingly powerful and thereby very useful in high-performance computing. However, many applications, such as some linear algebra algorithms, still cannot take full advantage of these systems. This is mainly due to the shortage of optimization techniques dealing with irregular control structures. In particular, the well-known polyhedral model fails to optimize loop nests whose bounds and/or array references are not affine functions. This is more likely to occur when handling sparse matrices in their packed formats. In this article, we propose using 2d-packed layouts and simple affine transformations to enable optimization of triangular and banded matrix operations. The benefit of our proposal is shown through an experimental study over a set of linear algebra benchmarks.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Baroudi, Toufik</style></author><author><style face="normal" font="default" size="100%">Seghir, Rachid</style></author><author><style face="normal" font="default" size="100%">Loechner, Vincent</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Optimization of triangular and banded matrix operations using 2d-packed layouts</style></title><secondary-title><style face="normal" font="default" size="100%">ACM Transactions on Architecture and Code Optimization (TACO)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><publisher><style face="normal" font="default" size="100%">ACM New York, NY, USA</style></publisher><volume><style face="normal" font="default" size="100%">14</style></volume><pages><style face="normal" font="default" size="100%">1-19</style></pages><isbn><style face="normal" font="default" size="100%">1544-3566</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><issue><style face="normal" font="default" size="100%">4</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Aouachria, Moufida</style></author><author><style face="normal" font="default" size="100%">Ghomari, Abdessamed Réda</style></author><author><style face="normal" font="default" size="100%">Seghir, Rachid</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Towards a repository for the reuse of business process models from a requirements analysis perspective</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the International Conference on Intelligent Information Processing, Security and Advanced Communication</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2015</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2015</style></date></pub-dates></dates><pages><style face="normal" font="default" size="100%">1-5</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Goléa, Nour El-Houda</style></author><author><style face="normal" font="default" size="100%">Seghir, Rachid</style></author><author><style face="normal" font="default" size="100%">Benzid, Redha</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Comparative Study of Well-known SVD-based Image Watermarking</style></title><secondary-title><style face="normal" font="default" size="100%">Models &amp; Optimisation and Mathematical Analysis JournalModels &amp; Optimisation and Mathematical Analysis Journal</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2012</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">1</style></volume><pages><style face="normal" font="default" size="100%">18-24</style></pages><isbn><style face="normal" font="default" size="100%">2588-2112</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Seghir, Rachid</style></author><author><style face="normal" font="default" size="100%">Loechner, Vincent</style></author><author><style face="normal" font="default" size="100%">Meister, Benoit</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Integer affine transformations of parametric ℤ-polytopes and applications to loop nest optimization</style></title><secondary-title><style face="normal" font="default" size="100%">ACM Transactions on Architecture and Code Optimization (TACO)ACM Transactions on Architecture and Code Optimization (TACO)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2012</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">2</style></number><volume><style face="normal" font="default" size="100%">9</style></volume><pages><style face="normal" font="default" size="100%">1-27</style></pages><isbn><style face="normal" font="default" size="100%">1544-3566</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Seghir, Rachid</style></author><author><style face="normal" font="default" size="100%">Loechner, V</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Zpolytrans: a library for computing and enumerating integer transformations of z-polyhedra</style></title><secondary-title><style face="normal" font="default" size="100%">2nd Int’l Workshop on Polyhedral Compilation Techniques (IMPACT’12)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2012</style></date></pub-dates></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Goléa, Nour El-Houda</style></author><author><style face="normal" font="default" size="100%">Seghir, Rachid</style></author><author><style face="normal" font="default" size="100%">Benzid, Redha</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A bind RGB color image watermarking based on singular value decomposition</style></title><secondary-title><style face="normal" font="default" size="100%">ACS/IEEE International Conference on Computer Systems and Applications-AICCSA 2010</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2010</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">IEEE</style></publisher><pages><style face="normal" font="default" size="100%">1-5</style></pages><isbn><style face="normal" font="default" size="100%">1-4244-7717-4</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Verdoolaege, Sven</style></author><author><style face="normal" font="default" size="100%">Seghir, Rachid</style></author><author><style face="normal" font="default" size="100%">Beyls, Kristof</style></author><author><style face="normal" font="default" size="100%">Loechner, Vincent</style></author><author><style face="normal" font="default" size="100%">Bruynooghe, Maurice</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Counting integer points in parametric polytopes using Barvinok's rational functions</style></title><secondary-title><style face="normal" font="default" size="100%">AlgorithmicaAlgorithmica</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2007</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2007</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">48</style></volume><pages><style face="normal" font="default" size="100%">37-66</style></pages><isbn><style face="normal" font="default" size="100%">1432-0541</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Seghir, Rachid</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Counting integer points in polyhedra and applications to program optimization</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2006</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2006</style></date></pub-dates></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Seghir, Rachid</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">École Doctorale Mathématiques, Sciences de l’Information et de l’ingénieur</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2006</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2006</style></date></pub-dates></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Seghir, Rachid</style></author><author><style face="normal" font="default" size="100%">Loechner, Vincent</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Memory optimization by counting points in integer transformations of parametric polytopes</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 2006 international conference on Compilers, architecture and synthesis for embedded systems</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2006</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2006</style></date></pub-dates></dates><pages><style face="normal" font="default" size="100%">74-82</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Seghir, Rachid</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Méthodes de dénombrement de points entiers de polyèdres et applications à l'optimisation de programmes</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2006</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2006</style></date></pub-dates></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Seghir, Rachid</style></author><author><style face="normal" font="default" size="100%">Loechner, Vincent</style></author><author><style face="normal" font="default" size="100%">Meister, Benoıt</style></author><author><style face="normal" font="default" size="100%">Pôle, API</style></author><author><style face="normal" font="default" size="100%">Brant, Bd Sébastien</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Minimizing memory strides using integer transformations of parametric polytopes</style></title><secondary-title><style face="normal" font="default" size="100%">LSIIT-ICPS UMR7005 ULP-CNRS</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2006</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2006</style></date></pub-dates></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Seghir, Rachid</style></author><author><style face="normal" font="default" size="100%">API, ICPS-LSIIT Pôle</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">La Projection Entiere de Polytopes Paramétrés</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2005</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Verdoolaege, Sven</style></author><author><style face="normal" font="default" size="100%">Beyls, Kristof</style></author><author><style face="normal" font="default" size="100%">Bruynooghe, Maurice</style></author><author><style face="normal" font="default" size="100%">Seghir, Rachid</style></author><author><style face="normal" font="default" size="100%">Loechner, Vincent</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Analytical computation of ehrhart polynomials and its applications for embedded systems</style></title><secondary-title><style face="normal" font="default" size="100%">CW ReportsCW Reports</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2004</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2004</style></date></pub-dates></dates><pages><style face="normal" font="default" size="100%">12-12</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Seghir, Rachid</style></author><author><style face="normal" font="default" size="100%">Verdoolaege, Sven</style></author><author><style face="normal" font="default" size="100%">Beyls, Kristof</style></author><author><style face="normal" font="default" size="100%">Loechner, Vincent</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Analytical computation of Ehrhart polynomials and its application in compile-time generated cache hints</style></title><secondary-title><style face="normal" font="default" size="100%">International Conference on Compilers, Architecture and Synthesis for Embedded Systems, CASES</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2004</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2004</style></date></pub-dates></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Verdoolaege, Sven</style></author><author><style face="normal" font="default" size="100%">Seghir, Rachid</style></author><author><style face="normal" font="default" size="100%">Beyls, Kristof</style></author><author><style face="normal" font="default" size="100%">Loechner, Vincent</style></author><author><style face="normal" font="default" size="100%">Bruynooghe, Maurice</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Analytical computation of Ehrhart polynomials: Enabling more compiler analyses and optimizations</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 2004 international conference on Compilers, architecture, and synthesis for embedded systems</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2004</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2004</style></date></pub-dates></dates><pages><style face="normal" font="default" size="100%">248-258</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Seghir, Rachid</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Dénombrement des point entiers de l’union et de l’image des polyédres paramétrés</style></title><secondary-title><style face="normal" font="default" size="100%">Master's thesis, ICPS, Strasbourg, FranceMaster's thesis, ICPS, Strasbourg, France</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2002</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2002</style></date></pub-dates></dates><language><style face="normal" font="default" size="100%">eng</style></language></record></records></xml>