M. MOUSSAOUI Adel

MCB

Directory of teachers

Department

Informatics Department

Research Interests

geometric constraints, Operating systems, Artificial Intelligence. Geometric constraints, Artificial Intelligence Operating systems

Contact Info

University of M'Sila, Algeria

Email : adel.moussaoui@univ-msila.dz

On the Web:

  • Google Scholar N/A
  • ResearchGate
    ResearchGate N/A
  • ORCID N/A
  • SC
    Scopus N/A

Recent Publications

2024-03-15

Attack via missed record synchronization on transformation-based fingerprint template protection algorithms

ancelable biometric template protection (BTP) schemes are proposed to overcome some security issues that traditional biometric templates know once compromised in particular the non-renewability and the user trackability. The main concern of the existing BTP algorithms is to ensure the non-invertibility of the transform function and maintain high separability statistics to assess the security of the transformed template so that the original biometric data can’t be recovered back. We show in this paper that even if a BTP algorithm fulfills the above requirements, it is still vulnerable. We demonstrate this claim by launching an attack against a representative example of a transformation-based fingerprint template protection algorithm. The proposed attack, namely Attack via Missed Record Synchronization (AMRS), exploits the miss of shared redundant information between multiple correlated protected templates to deduce some additional hidden information that helps to reverse the transform function and spoof the authentication system. The proposed algorithm also allows to reconstruct the original template in terms of minutiae. The experiments conducted on the FVC database show that the proposed attack can break down the security of some cancelable algorithms knowing only reduced number of transformed templates.
Citation

M. MOUSSAOUI Adel, Foudil Belhadj, , (2024-03-15), "Attack via missed record synchronization on transformation-based fingerprint template protection algorithms", [national] Multimedia Tools and Applications , Springer

Read Full Paper
2020

Path parameters effect on localization using a mobile anchor in wireless sensor networks

Finding the physical positions of sensors after random deployment is called localization. One of the localization techniques is to use a mobile anchor that moves along a path to help unknown nodes to locate themselves automatically. In this paper, we study the impact of three essential parameters on the performance metrics of path planning models for mobile anchor based localization to help configure the localization system for achieving better results. These parameters include path degree, mobile communication range and distance estimation errors. For this purpose, we analyzed four path planning methods: Scan, Hilbert, Z-curve and LMAT in terms of localization accuracy, localization ratio, path length and cost of communication. Simulation results confirm the importance of path parameterization in the quality of the localization system with a mobile anchor node.
Citation

M. MOUSSAOUI Adel, Nawel Boukhari, Salim Bouamama, , (2020), "Path parameters effect on localization using a mobile anchor in wireless sensor networks", [international] Third Conference on Informatics and Applied Mathematics IAM’20 , Guelma, Algeria

Read Full Paper

Path Parameters Effect on Localization Using a Mobile Anchor in WSN.

dergipark.org.tr
Path Parameters Effect on Localization Using a Mobile Anchor in WSN
Nawel Boukhari, Salim Bouamama, Adel Moussaoui
International Journal of Informatics and Applied Mathematics 3 (2), 12-22, 2020
Finding the physical positions of sensors after random deployment is called localization. One of the localization techniques is to use a mobile anchor that moves along a path to help unknown nodes to locate themselves automatically. In this paper, we study the impact of three essential parameters on the performance metrics of path planning models for mobile anchor-based localization to help configure the localization system for achieving better results. These parameters include path degree, mobile communication range and distance estimation errors. For this purpose, we analyzed four path planning methods: SCAN, HILBERT, Zcurve and LMAT in terms of localization accuracy, localization ratio, path length and cost of communication. Simulation results confirm the importance of path parameterization in the quality of the localization system with a mobile anchor node.
Citation

M. MOUSSAOUI Adel, (2020), "Path Parameters Effect on Localization Using a Mobile Anchor in WSN.", [national] International Journal of Informatics and Applied Mathematics , Dergipark

Read Full Paper
2016

Generator of 2D geometric constraint graphs

In 2-dimensional geometric constraint solving, graph-based techniques are a dominant approach, particularly in CAD context. These methods transform the geometric problem into a graph which is decomposed into small sub-graphs. Each one is solved, separately, and the final solution is obtained by recomposing the solved sub-graphs. To the best of our knowledge, there is no random geometric constraint graph generator so far. In this paper, we introduce a simple, but efficient generator that produces any possible geometric configuration. It would be parameterized to generate graphs with some desirable proprieties, like highly or weakly decomposable graphs, or restricting the generated graph to a specific class of geometric configuration. Generated graphs can be used as a benchmark to make consistent tests, or to observe algorithm behaviour on the geometric constraint graphs with different sizes and structural properties. We prove that our generator is complete and suitable for two main classes of solving approaches.
Citation

M. MOUSSAOUI Adel, Samy Ait-Aoudia, , (2016), "Generator of 2D geometric constraint graphs", [national] Computer-Aided Design and Applications , Taylor & Francis

Read Full Paper

Geometric Constraint Solver

A geometric constraint system consists of a finite set of geometric elements, such as points, lines, and circles, along with relationships of different types such as distance, angle, incidence and parallelism. This problem is central to many applications, such as computer-aided design, molecular modelling and recently localization in wireless sensor networks. Solving a geometric constraint system consists of finding real coordinates of geometric elements in the Euclidean space. In 2-dimensional geometric constraint solving, graph-based techniques are a dominant approach, particularly in the computer-aided design context. To speed up the resolution process, these methods transform the geometric problem into a graph, which is decomposed into small subgraphs. Each one is solved, separately, and the final solution is obtained by recomposing the solved subgraphs. However, most of the previous research on graph-based approaches has only focused on the decomposition without any attention on what will be decomposed: the geometric constraint graph. Major proposed algorithms are discussed or compared theoretically, without presenting any tests on graphs instances with different structural properties, representing several cases of difficulties. Why? because as far as we know, there is no known algorithm for the creation of non-decomposable graphs or graphs with interesting structural properties that best highlight the efficiency of any algorithm. Our contribution is the design of a simple, but efficient random 2D geometric constraint graph generator. It can be used to make benchmarks for consistent tests, or to observe the behaviour of geometric constraints solving algorithms. It produces problem instances with various sizes and structural properties, covering different cases of complexity. Our design is based on the problem classification reported in the literature. We proved that our proposed generator is complete, customizable, simple and efficient. It has been validated experimentally and some of its properties have been theoretically proved.
Citation

M. MOUSSAOUI Adel, (2016), "Geometric Constraint Solver", [national] École nationale Supérieure d’Informatique, ESI (ex INI), Oued Smar, Alger.

Read Full Paper
2009

Application d’une Approche Métaheuristique pour le Problème d’Ordonnancement des Instructions

TO be Addel next.
Citation

M. MOUSSAOUI Adel, Salim Bouamama, Abdellah Boukerram, , (2009), "Application d’une Approche Métaheuristique pour le Problème d’Ordonnancement des Instructions", [international] ICAI09, International Conf. On Applied , Bordj Bou Arreridj, Algeria

Read Full Paper
2000

Magister Thesis: Modélisation Géométrique par contraintes

Dans la plupart des systèmes industriels de CAO (Conception Assistée par Ordinateur), les objets géométriques que veut modéliser l'utilisateur doivent vérifier certaines propriétés traditionnellement appelées contraintes. Les contraintes dans les modeleurs classiques n'avaient pas de représentation informatique et c'était à l'utilisateur de les gérer manuellement et d'assurer la cohérence en cas de modification. Pour pallier ces inconvénients, certains systèmes de modélisation fournissent des outils de spécification des formes par des contraintes géométriques. Ceci offre l'avantage de libérer l'utilisateur de la tâche fastidieuse de placement exact de ces objets. Ce type de modélisation permet, en outre, d’avoir une description claire et courte et d’assurer la mise à jour lors de la modification d'une contrainte. Un système de résolution des contraintes géométriques est indispensable pour atteindre un tel objectif. Dans ce mémoire nous faisons un état de l’art sur la modélisation des solides et sur les différentes approches de résolution du système de contraintes géométriques. Nous proposons deux méthodes de résolution du système de contraintes géométriques. La première méthode consiste à utiliser la bissection pour résoudre le système d’équations issu des contraintes géométriques. Nous donnons également les différents algorithmes pour accélérer cette méthode. La deuxième méthode que nous proposons est une méthode géométrique qui exploite la structure du graphe de contraintes. Nous proposons un algorithme linéaire pour résoudre une large sous classe de problèmes constructibles à la règle et au compas.
Citation

M. MOUSSAOUI Adel, (2000), "Magister Thesis: Modélisation Géométrique par contraintes", [national] École nationale Supérieure d’Informatique, ESI (ex INI), Oued Smar, Alger

Read Full Paper
1999

Solving geometric constraints by bissection

The most popular numerical method is Newton-Raphson’s iteration. It was used, among many others, by Serrano [9] and Perez et al [10]. This method needs an initial guess, typically given by the sketch of the desired geometric scheme. However, there is a well-known problem. If Newton-Raphson’s method often works well, sometimes it does not converge or it converges to an unwanted solution [6]. In this last case, the user changes his initial guess until Newton-Raphson’s method works if it does. We use the bisection method [4, 7] to solve these" difficult" cases. The bisection method avoids the drawbacks of the Newton iteration. The bisection method enables users to reliably find all solutions to a system of non-linear equations within a region defined by bounds on each individual co-ordinate of the geometric objects. The bisection method avoids the drawbacks of the Newton iteration. It enables users to reliably find all solutions to a system of non-linear equations within a region defined by bounds on each individual co-ordinate of the geometric objects.
Citation

M. MOUSSAOUI Adel, Brahim Hamid, Samy Ait-Aoudia,, Toufik Saadi, , (1999), "Solving geometric constraints by bissection", [international] 1st Mediterranean international conference on computer technologies , Tizi ouzou. Algeria.

Read Full Paper

Cogemo: A constraint-based geometric modeller

http://scholar.google.com/scholar?cluster=3896707601676063057&hl=en&oi=scholarr
Citation

M. MOUSSAOUI Adel, S Ait-Aoudia, , (1999), "Cogemo: A constraint-based geometric modeller", [international] Swiss Conference on CAD/CAM Systems, , Neuchâtel, Swiss

Read Full Paper

Solving geometric constraints by a graph-constructive approach

A geometric constraint solver is a major component of recent CAD systems. Graph constructive solvers stem from graph theory. We describe a 2D constraint based modeller that uses a graph constructive approach to solve systems of geometric constraints. The graph based approach provides means for developing sound and efficient algorithms. We present a linear algorithm that solves a large subset of the rule and compass constructive problems. Methods for handling over- and under-constrained schemes are also given.
Citation

M. MOUSSAOUI Adel, Brahim Hamid, Samy Ait-Aoudia, Toufik Saadi, , (1999), "Solving geometric constraints by a graph-constructive approach", [international] 1999 IEEE International Conference on Information Visualization , London, UK

Read Full Paper
← Back to Researchers List