@conference {62758,
	title = {Discrete Large-scale Multi-Objective Teaching-Learning-Based Optimization Algorithm},
	booktitle = {Proceedings of the 4th International Conference on Networking, Information Systems \& Security},
	year = {2021},
	month = {2021},
	pages = {1-6},
	abstract = {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.},
	url = {https://dl.acm.org/doi/abs/10.1145/3454127.3456609},
	author = {Aouadj, Wafa and Abdessemed, Mohamed Rida and Seghir, Rachid}
}
@article {62609,
	title = {A New Social Volunteer Computing Environment With Task-Adapted Scheduling Policy (TASP)},
	journal = {International Journal of Grid and High Performance Computing (IJGHPC)International Journal of Grid and High Performance Computing (IJGHPC)},
	volume = {13},
	year = {2021},
	month = {2021},
	pages = {39-55},
	author = {Kadache, Nabil and Seghir, Rachid}
}
@article {62565,
	title = {A parallel content-based image retrieval system using spark and tachyon frameworks},
	journal = {Journal of King Saud University - Computer and Information SciencesJournal of King Saud University - Computer and Information Sciences},
	year = {2021},
	month = {2021},
	abstract = {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.\&nbsp;(i) image indexation step, in which we use\&nbsp;MapReduce\&nbsp;distributed model on Spark in order to speed up the indexation process. We also use a memory-centric\&nbsp;distributed storage system, called Tachyon, to enhance the write operation\&nbsp;(ii) image retrieving step\&nbsp;which we speed up by using a parallel k-Nearest Neighbors (k-NN) search method based on\&nbsp;MapReduce model\&nbsp;implemented under\&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.},
	author = {Mezzoudj, Saliha and Behloul, Ali and Seghir, Rachid and Saadna, Yassmina}
}
@article {62759,
	title = {A Reliable Behavioral Model: Optimizing Energy Consumption and Object Clustering Quality by Na{\"\i}ve Robots},
	journal = {International Journal of Swarm Intelligence Research (IJSIR)International Journal of Swarm Intelligence Research (IJSIR)},
	volume = {12},
	year = {2021},
	month = {2021},
	pages = {125-145},
	author = {Aouadj, Wafa and Abdessemed, Mohamed-Rida and Seghir, Rachid}
}
@article {45158,
	title = {A New Social Volunteer Computing Environment With Task-Adapted Scheduling Policy (TASP)},
	journal = {International Journal of Grid and High Performance Computing (IJGHPC)},
	volume = {13},
	number = {2},
	year = {2021},
	pages = {39-55},
	publisher = {IGI Global},
	abstract = {
	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{\textquoteright}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{\textquoteright}s project, called {\textquotedblleft}Collatz Conjecture.{\textquotedblright}

},
	url = {https://www.igi-global.com/article/a-new-social-volunteer-computing-environment-with-task-adapted-scheduling-policy-tasp/273653},
	author = {Kadache, Nabil and Seghir, Rachid}
}
@proceedings {63130,
	title = {A Distributed Information Retrieval Approach for Copyright Protection},
	journal = {Proceedings of the 3rd International Conference on Networking, Information Systems \& Security},
	year = {2020},
	month = {2020},
	pages = {1-6},
	author = {Benbelgacem, Sonia and Larbi GUEZOULI and Seghir, Rachid}
}
@proceedings {63146,
	title = {Static versus dynamic memory allocation: a comparison for linear algebra kernels},
	journal = {IMPACT 2020, in conjunction with HiPEAC 2020},
	year = {2020},
	month = {2020},
	author = {Baroudi, Toufik and Loechner, Vincent and Seghir, Rachid}
}
@article {63322,
	title = {A parallel content-based image retrieval system using spark and tachyon frameworks},
	journal = {Journal of King Saud University - Computer and Information SciencesJournal of King Saud University - Computer and Information Sciences},
	year = {2019},
	month = {2019},
	abstract = {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.\&nbsp;(i) image indexation step, in which we use\&nbsp;MapReduce\&nbsp;distributed model on Spark in order to speed up the indexation process. We also use a memory-centric\&nbsp;distributed storage system, called Tachyon, to enhance the write operation\&nbsp;(ii) image retrieving step\&nbsp;which we speed up by using a parallel k-Nearest Neighbors (k-NN) search method based on\&nbsp;MapReduce model\&nbsp;implemented under\&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.},
	author = {Mezzoudj, Saliha and Behloul, Ali and Seghir, Rachid and Saadna, Yassmina}
}
@article {64527,
	title = {Optimization of Triangular and Banded Matrix Operations Using 2d-Packed Layouts},
	journal = {ACM Transactions on Architecture and Code Optimization (TACO)ACM Transactions on Architecture and Code Optimization (TACO)},
	volume = {14},
	year = {2017},
	month = {2017},
	abstract = {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.},
	author = {Baroudi, Toufik and Seghir, Rachid and Loechner, Vincent}
}
@article {45142,
	title = {Optimization of triangular and banded matrix operations using 2d-packed layouts},
	journal = {ACM Transactions on Architecture and Code Optimization (TACO)},
	volume = {14},
	number = {4},
	year = {2017},
	pages = {1-19},
	publisher = {ACM New York, NY, USA},
	isbn = {1544-3566},
	author = {Baroudi, Toufik and Seghir, Rachid and Loechner, Vincent}
}
@proceedings {66044,
	title = {Towards a repository for the reuse of business process models from a requirements analysis perspective},
	journal = {Proceedings of the International Conference on Intelligent Information Processing, Security and Advanced Communication},
	year = {2015},
	month = {2015},
	pages = {1-5},
	author = {Aouachria, Moufida and Ghomari, Abdessamed R{\'e}da and Seghir, Rachid}
}
@article {67009,
	title = {A Comparative Study of Well-known SVD-based Image Watermarking},
	journal = {Models \& Optimisation and Mathematical Analysis JournalModels \& Optimisation and Mathematical Analysis Journal},
	volume = {1},
	year = {2012},
	month = {2012},
	pages = {18-24},
	isbn = {2588-2112},
	author = {Gol{\'e}a, Nour El-Houda and Seghir, Rachid and Benzid, Redha}
}
@article {66880,
	title = {Integer affine transformations of parametric ℤ-polytopes and applications to loop nest optimization},
	journal = {ACM Transactions on Architecture and Code Optimization (TACO)ACM Transactions on Architecture and Code Optimization (TACO)},
	volume = {9},
	year = {2012},
	month = {2012},
	pages = {1-27},
	isbn = {1544-3566},
	author = {Seghir, Rachid and Loechner, Vincent and Meister, Benoit}
}
@proceedings {66881,
	title = {Zpolytrans: a library for computing and enumerating integer transformations of z-polyhedra},
	journal = {2nd Int{\textquoteright}l Workshop on Polyhedral Compilation Techniques (IMPACT{\textquoteright}12)},
	year = {2012},
	month = {2012},
	author = {Seghir, Rachid and Loechner, V}
}
@proceedings {67512,
	title = {A bind RGB color image watermarking based on singular value decomposition},
	journal = {ACS/IEEE International Conference on Computer Systems and Applications-AICCSA 2010},
	year = {2010},
	month = {2010},
	pages = {1-5},
	publisher = {IEEE},
	isbn = {1-4244-7717-4},
	author = {Gol{\'e}a, Nour El-Houda and Seghir, Rachid and Benzid, Redha}
}
@article {62215,
	title = {Counting integer points in parametric polytopes using Barvinok{\textquoteright}s rational functions},
	journal = {AlgorithmicaAlgorithmica},
	volume = {48},
	year = {2007},
	month = {2007},
	pages = {37-66},
	isbn = {1432-0541},
	author = {Verdoolaege, Sven and Seghir, Rachid and Beyls, Kristof and Loechner, Vincent and Bruynooghe, Maurice}
}
@article {62084,
	title = {Counting integer points in polyhedra and applications to program optimization},
	year = {2006},
	month = {2006},
	author = {Seghir, Rachid}
}
@article {62083,
	title = {{\'E}cole Doctorale Math{\'e}matiques, Sciences de l{\textquoteright}Information et de l{\textquoteright}ing{\'e}nieur},
	year = {2006},
	month = {2006},
	author = {Seghir, Rachid}
}
@proceedings {62085,
	title = {Memory optimization by counting points in integer transformations of parametric polytopes},
	journal = {Proceedings of the 2006 international conference on Compilers, architecture and synthesis for embedded systems},
	year = {2006},
	month = {2006},
	pages = {74-82},
	author = {Seghir, Rachid and Loechner, Vincent}
}
@article {62082,
	title = {M{\'e}thodes de d{\'e}nombrement de points entiers de poly{\`e}dres et applications {\`a} l{\textquoteright}optimisation de programmes},
	year = {2006},
	month = {2006},
	author = {Seghir, Rachid}
}
@proceedings {62086,
	title = {Minimizing memory strides using integer transformations of parametric polytopes},
	journal = {LSIIT-ICPS UMR7005 ULP-CNRS},
	year = {2006},
	month = {2006},
	author = {Seghir, Rachid and Loechner, Vincent and Meister, Beno{\i}t and P{\^o}le, API and Brant, Bd S{\'e}bastien}
}
@article {61666,
	title = {La Projection Entiere de Polytopes Param{\'e}tr{\'e}s},
	year = {2005},
	author = {Seghir, Rachid and API, ICPS-LSIIT P{\^o}le}
}
@article {61925,
	title = {Analytical computation of ehrhart polynomials and its applications for embedded systems},
	journal = {CW ReportsCW Reports},
	year = {2004},
	month = {2004},
	pages = {12-12},
	author = {Verdoolaege, Sven and Beyls, Kristof and Bruynooghe, Maurice and Seghir, Rachid and Loechner, Vincent}
}
@proceedings {61920,
	title = {Analytical computation of Ehrhart polynomials and its application in compile-time generated cache hints},
	journal = {International Conference on Compilers, Architecture and Synthesis for Embedded Systems, CASES},
	year = {2004},
	month = {2004},
	author = {Seghir, Rachid and Verdoolaege, Sven and Beyls, Kristof and Loechner, Vincent}
}
@proceedings {61926,
	title = {Analytical computation of Ehrhart polynomials: Enabling more compiler analyses and optimizations},
	journal = {Proceedings of the 2004 international conference on Compilers, architecture, and synthesis for embedded systems},
	year = {2004},
	month = {2004},
	pages = {248-258},
	author = {Verdoolaege, Sven and Seghir, Rachid and Beyls, Kristof and Loechner, Vincent and Bruynooghe, Maurice}
}
@article {61837,
	title = {D{\'e}nombrement des point entiers de l{\textquoteright}union et de l{\textquoteright}image des poly{\'e}dres param{\'e}tr{\'e}s},
	journal = {Master{\textquoteright}s thesis, ICPS, Strasbourg, FranceMaster{\textquoteright}s thesis, ICPS, Strasbourg, France},
	year = {2002},
	month = {2002},
	author = {Seghir, Rachid}
}
