Kamal Amroun - Academia.edu (original) (raw)

Papers by Kamal Amroun

Research paper thumbnail of A novel privacy-aware global infrastructure for ecological footprint calculator based on the Internet of things and blockchain

The Journal of Supercomputing, Dec 8, 2023

Research paper thumbnail of A compression algorithm for solving efficiently Non Binary CSP using Generalized Hypertree Decomposition

Research paper thumbnail of Towards Diabetes Mellitus Prediction Based on Machine- Learning

2023 International Conference on Smart Computing and Application (ICSCA), Feb 5, 2023

Research paper thumbnail of Parallel FPTCM$$^+$$: Parallel FP-Tree Based Compression Method for Large Datasets

Lecture notes in networks and systems, 2023

Research paper thumbnail of A novel privacy-aware global infrastructure for ecological footprint calculator (GIEFC) based on internet of things and blockchain

Research Square (Research Square), Mar 8, 2023

Climate change and global warming are the greatest harmful consequences of human activity. Indeed... more Climate change and global warming are the greatest harmful consequences of human activity. Indeed, Human technological development and demographic growth has been accompanied by globalization. In this new era, the logistics revolution has removed borders and industrial value chains have been distributed all over the world. It is becoming difficult to attribute responsibilities for ecological impacts accurately, since consumers are not necessarily in the same area as the countries of manufacture or extraction of raw materials. At the same time, a new paradigm called the Internet of Things has come to reshape our relationship to the world. The smallest everyday objects are connected to the Internet and allow acquisition of large amount of data, interact with cyberspace and in some cases act on the real world in an automated way. On the other hand, the last decade has also seen the rise of a new technology for storing transactions data in a reliable and consented way. Blockchain has changed the way operations are made based on the concept of distributed ledger giving a new breath to the economy. They have also dived into companies business by allowing private implementations with permissioned blockhains. The aim of this work is to take advantage of the power of the two technologies combined-the Internet of Things provides

Research paper thumbnail of Résolution des CSPs par décomposition

Research paper thumbnail of Towards Diabetes Mellitus Prediction Based on Machine- Learning

2023 International Conference on Smart Computing and Application (ICSCA), Feb 5, 2023

Research paper thumbnail of A novel multi-level hybrid load balancing and tasks scheduling algorithm for cloud computing environment

Today cloud computing is at the heart of all information technologies. This prodigious technologi... more Today cloud computing is at the heart of all information technologies. This prodigious technological paradigm relies on a very simple concept defined as the ability to deliver hardware and software resources as service directly over internet. A set of mechanisms cooperate to maintain the cloud reliability and to allow continuous delivery of these services while guaranteeing the same quality of service (QoS) and respecting the service-level agreement (SLA) for each client. Load balancing is one of those mechanisms and it ensures a crucial service, it can be defined as the ability of the system to ensure fairness in the distribution of workload over all servers. The most recent load balancing techniques are hybrid methods involving in major cases the combination between static and dynamic approaches, in other cases it can go further by integrating other mechanisms in order to improve the overall efficiency of the systems. The performance can be evaluated by parameters which generally ...

Research paper thumbnail of Reconnaissance des expressions faciales

Université Abderahmane MIRA de Bejaia, 2019

Research paper thumbnail of HSJ-Solver: a new method based on GHD for answering conjunctive queries and solving constraint satisfaction problems

Research paper thumbnail of Solving hypertree structured CSP : Sequential and parallel approaches

Solving CSP is in general N P-Complete. However, there are various subsets of CSPs that can be so... more Solving CSP is in general N P-Complete. However, there are various subsets of CSPs that can be solved in polynomial time. Some of them can be identified by analyzing their structure. Unfortunately the proposed methods for exploiting these structural proprieties are not efficient in practice. So exploiting these structural properties for solving CSP∫ is a crucial challenge. In this paper, we propose efficient algorithms which exploit these structural proprieties, for both sequential and parallel resolutions. Some experiments done on academic benchmarks show the efficiciency of our approach.

Research paper thumbnail of New Methods for Compressing Table Constraints

Research paper thumbnail of Mise en place d'une solution d'industrie 4.0 Cas d'étude

univ. A/Mira .Bejaia, 2020

Research paper thumbnail of Conception et Réalisation d'une solution Business Intelligence Cas d'étude SPA Tchin-Lait

Université A / Mira Bejaia, 2020

Research paper thumbnail of A new Wrapper Feature Selection model for Anomaly based Intrusion Detection Systems

International Journal of Security and Networks, 2022

Research paper thumbnail of An efficient heuristic approach combining maximal itemsets and area measure for compressing voluminous table constraints

The Journal of Supercomputing

Constraint Programming is a powerful paradigm to model and solve com-binatorial problems. While t... more Constraint Programming is a powerful paradigm to model and solve com-binatorial problems. While there are many kinds of constraints, the table constraint is perhaps the most significant-being the most well-studied and has the ability to encode any other constraints defined on finite variables. However, constraints can be very voluminous and their size can grow exponentially with their arity. To reduce space and the time complexity, researchers have focused on various forms of compression. In this paper we propose a new approach based on maximal frequent itemsets technique and area measure for enumerating the maximal frequent itemsets relevant for compressing table constraints. Our experimental results show the effectiveness and efficiency of this approach on compression and on solving compressed table constraints.

Research paper thumbnail of An efficient heuristic approach combining maximal itemsets and area measure for compressing voluminous table constraints

The Journal of Supercomputing

Constraint Programming is a powerful paradigm to model and solve com-binatorial problems. While t... more Constraint Programming is a powerful paradigm to model and solve com-binatorial problems. While there are many kinds of constraints, the table constraint is perhaps the most significant-being the most well-studied and has the ability to encode any other constraints defined on finite variables. However, constraints can be very voluminous and their size can grow exponentially with their arity. To reduce space and the time complexity, researchers have focused on various forms of compression. In this paper we propose a new approach based on maximal frequent itemsets technique and area measure for enumerating the maximal frequent itemsets relevant for compressing table constraints. Our experimental results show the effectiveness and efficiency of this approach on compression and on solving compressed table constraints.

Research paper thumbnail of HD DBT : Hypertree Décomposition pour la résolution des problèmes de satisfaction de contraintes basée sur un Dual Backtracking

Research paper thumbnail of A compression algorithm to improve generalized hypertree decomposition-based solving approaches for large extensional non binary CSP

ABSTRACT Many approaches exploiting Generalized Hypertree Decom-position are proposed in the lite... more ABSTRACT Many approaches exploiting Generalized Hypertree Decom-position are proposed in the literature for solving extensional Constraint Satisfaction Problems on finite domains. The most recent one, called FC-GHD, combines the merits of an enumerative search algorithm which is memory efficient with those of the Hypertree Decomposition which is time efficient. Although FC-GHD is proved to be efficient, some large instances could remain unresolved because of the memory fault problem. This present article proposes to enhance the FC-GHD method with the notion of compressed table constraints to deal with memory explosion problems.

Research paper thumbnail of A novel epsilon-dominance Harris Hawks optimizer for multi-objective optimization in engineering design problems

Neural Computing and Applications

Research paper thumbnail of A novel privacy-aware global infrastructure for ecological footprint calculator based on the Internet of things and blockchain

The Journal of Supercomputing, Dec 8, 2023

Research paper thumbnail of A compression algorithm for solving efficiently Non Binary CSP using Generalized Hypertree Decomposition

Research paper thumbnail of Towards Diabetes Mellitus Prediction Based on Machine- Learning

2023 International Conference on Smart Computing and Application (ICSCA), Feb 5, 2023

Research paper thumbnail of Parallel FPTCM$$^+$$: Parallel FP-Tree Based Compression Method for Large Datasets

Lecture notes in networks and systems, 2023

Research paper thumbnail of A novel privacy-aware global infrastructure for ecological footprint calculator (GIEFC) based on internet of things and blockchain

Research Square (Research Square), Mar 8, 2023

Climate change and global warming are the greatest harmful consequences of human activity. Indeed... more Climate change and global warming are the greatest harmful consequences of human activity. Indeed, Human technological development and demographic growth has been accompanied by globalization. In this new era, the logistics revolution has removed borders and industrial value chains have been distributed all over the world. It is becoming difficult to attribute responsibilities for ecological impacts accurately, since consumers are not necessarily in the same area as the countries of manufacture or extraction of raw materials. At the same time, a new paradigm called the Internet of Things has come to reshape our relationship to the world. The smallest everyday objects are connected to the Internet and allow acquisition of large amount of data, interact with cyberspace and in some cases act on the real world in an automated way. On the other hand, the last decade has also seen the rise of a new technology for storing transactions data in a reliable and consented way. Blockchain has changed the way operations are made based on the concept of distributed ledger giving a new breath to the economy. They have also dived into companies business by allowing private implementations with permissioned blockhains. The aim of this work is to take advantage of the power of the two technologies combined-the Internet of Things provides

Research paper thumbnail of Résolution des CSPs par décomposition

Research paper thumbnail of Towards Diabetes Mellitus Prediction Based on Machine- Learning

2023 International Conference on Smart Computing and Application (ICSCA), Feb 5, 2023

Research paper thumbnail of A novel multi-level hybrid load balancing and tasks scheduling algorithm for cloud computing environment

Today cloud computing is at the heart of all information technologies. This prodigious technologi... more Today cloud computing is at the heart of all information technologies. This prodigious technological paradigm relies on a very simple concept defined as the ability to deliver hardware and software resources as service directly over internet. A set of mechanisms cooperate to maintain the cloud reliability and to allow continuous delivery of these services while guaranteeing the same quality of service (QoS) and respecting the service-level agreement (SLA) for each client. Load balancing is one of those mechanisms and it ensures a crucial service, it can be defined as the ability of the system to ensure fairness in the distribution of workload over all servers. The most recent load balancing techniques are hybrid methods involving in major cases the combination between static and dynamic approaches, in other cases it can go further by integrating other mechanisms in order to improve the overall efficiency of the systems. The performance can be evaluated by parameters which generally ...

Research paper thumbnail of Reconnaissance des expressions faciales

Université Abderahmane MIRA de Bejaia, 2019

Research paper thumbnail of HSJ-Solver: a new method based on GHD for answering conjunctive queries and solving constraint satisfaction problems

Research paper thumbnail of Solving hypertree structured CSP : Sequential and parallel approaches

Solving CSP is in general N P-Complete. However, there are various subsets of CSPs that can be so... more Solving CSP is in general N P-Complete. However, there are various subsets of CSPs that can be solved in polynomial time. Some of them can be identified by analyzing their structure. Unfortunately the proposed methods for exploiting these structural proprieties are not efficient in practice. So exploiting these structural properties for solving CSP∫ is a crucial challenge. In this paper, we propose efficient algorithms which exploit these structural proprieties, for both sequential and parallel resolutions. Some experiments done on academic benchmarks show the efficiciency of our approach.

Research paper thumbnail of New Methods for Compressing Table Constraints

Research paper thumbnail of Mise en place d'une solution d'industrie 4.0 Cas d'étude

univ. A/Mira .Bejaia, 2020

Research paper thumbnail of Conception et Réalisation d'une solution Business Intelligence Cas d'étude SPA Tchin-Lait

Université A / Mira Bejaia, 2020

Research paper thumbnail of A new Wrapper Feature Selection model for Anomaly based Intrusion Detection Systems

International Journal of Security and Networks, 2022

Research paper thumbnail of An efficient heuristic approach combining maximal itemsets and area measure for compressing voluminous table constraints

The Journal of Supercomputing

Constraint Programming is a powerful paradigm to model and solve com-binatorial problems. While t... more Constraint Programming is a powerful paradigm to model and solve com-binatorial problems. While there are many kinds of constraints, the table constraint is perhaps the most significant-being the most well-studied and has the ability to encode any other constraints defined on finite variables. However, constraints can be very voluminous and their size can grow exponentially with their arity. To reduce space and the time complexity, researchers have focused on various forms of compression. In this paper we propose a new approach based on maximal frequent itemsets technique and area measure for enumerating the maximal frequent itemsets relevant for compressing table constraints. Our experimental results show the effectiveness and efficiency of this approach on compression and on solving compressed table constraints.

Research paper thumbnail of An efficient heuristic approach combining maximal itemsets and area measure for compressing voluminous table constraints

The Journal of Supercomputing

Constraint Programming is a powerful paradigm to model and solve com-binatorial problems. While t... more Constraint Programming is a powerful paradigm to model and solve com-binatorial problems. While there are many kinds of constraints, the table constraint is perhaps the most significant-being the most well-studied and has the ability to encode any other constraints defined on finite variables. However, constraints can be very voluminous and their size can grow exponentially with their arity. To reduce space and the time complexity, researchers have focused on various forms of compression. In this paper we propose a new approach based on maximal frequent itemsets technique and area measure for enumerating the maximal frequent itemsets relevant for compressing table constraints. Our experimental results show the effectiveness and efficiency of this approach on compression and on solving compressed table constraints.

Research paper thumbnail of HD DBT : Hypertree Décomposition pour la résolution des problèmes de satisfaction de contraintes basée sur un Dual Backtracking

Research paper thumbnail of A compression algorithm to improve generalized hypertree decomposition-based solving approaches for large extensional non binary CSP

ABSTRACT Many approaches exploiting Generalized Hypertree Decom-position are proposed in the lite... more ABSTRACT Many approaches exploiting Generalized Hypertree Decom-position are proposed in the literature for solving extensional Constraint Satisfaction Problems on finite domains. The most recent one, called FC-GHD, combines the merits of an enumerative search algorithm which is memory efficient with those of the Hypertree Decomposition which is time efficient. Although FC-GHD is proved to be efficient, some large instances could remain unresolved because of the memory fault problem. This present article proposes to enhance the FC-GHD method with the notion of compressed table constraints to deal with memory explosion problems.

Research paper thumbnail of A novel epsilon-dominance Harris Hawks optimizer for multi-objective optimization in engineering design problems

Neural Computing and Applications