Garuda - Garba Rujukan Digital

Face Detection in a Mixed-Subject Document Lhoussaine Bouhou; Rachid El Ayachi; Mohamed Baslam; Mohamed Oukessou
International Journal of Electrical and Computer Engineering (IJECE) Vol 6, No 6: December 2016
Publisher : Institute of Advanced Engineering and Science

Before you recognize anyone, it is essential to identify various characteristics variations from one person to another. among of this characteristics, we have those relating to the face. Nowadays the detection of skin regions in an image has become an important research topic for the location of a face in the image. In this research study, unlike previous research studies related to this topic which have focused on images inputs data faces, we are more interested to the fields face detection in mixed-subject documents (text + images). The face detection system developed is based on the hybrid method to distinguish two categories of objects from the mixed document. The first category is all that is text or images containing figures having no skin color, and the second category is any figure with the same color as the skin. In the second phase the detection system is based on Template Matching method to distinguish among the figures of the second category only those that contain faces to detect them. To validate this study, the system developed is tested on the various documents which including text and image.

Analysis of Competition Fronting the Popularity of Content in Social Networks Hamid Garmani; Mohamed El Amrani; Mohamed Baslam; Rachid El Ayachi
International Journal of Informatics and Communication Technology (IJ-ICT) Vol 6, No 3: December 2017
Publisher : Institute of Advanced Engineering and Science

In the telecommunications domain they are several providers, but customers seeking those that there are good services. In this paper, a study is seeking on two types of providers: content providers CPs and Internet Service Providers ISPs. In this study, we analyzed the impact of Selfishness of Content Providers and Internet Service Providers on their strategies of Price and QoS on their decision strategies. Yet, we formulate our problem as a non-cooperative game among multiple CPs, multiple ISPs competing for the same market. We prove through a detailed analysis uniqueness of pure Nash Equilibrium (NE). Furthermore, a fully distributed algorithm to converge to the NE point is presented. In order to quantify how efficient is the NE point, a detailed analysis of the Price of Anarchy (PoA) is adopted to ensure the performance of the system at equilibrium. Finally, we provide an extensive numerical study to point out the importance of QoS and credibility in the market and the in-fluence of the existing economic relationship between content providers and Internet service providers.

A Markov Decision Model for Area Coverage in Autonomous Demining Robot Abdelhadi Larach; Cherki Daoui; Mohamed Baslam
International Journal of Informatics and Communication Technology (IJ-ICT) Vol 6, No 2: August 2017
Publisher : Institute of Advanced Engineering and Science

A review of literature shows that there is a variety of works studying coverage path planning in several autonomous robotic applications. In this work, we propose a new approach using Markov Decision Process to plan an optimum path to reach the general goal of exploring an unknown environment containing buried mines. This approach, called Goals to Goals Area Coverage on-line Algorithm, is based on a decomposition of the state space into smaller regions whose states are considered as goals with the same reward value, the reward value is decremented from one region to another according to the desired search mode. The numerical simulations show that our approach is promising for minimizing the necessary cost-energy to cover the entire area.

Customers’ Perception Towards Services of Telecommunications Operators Driss Ait Omar; Mohamed Baslam; Mourad Nachaoui; And Mohamed Fakir
International Journal of Informatics and Communication Technology (IJ-ICT) Vol 6, No 3: December 2017
Publisher : Institute of Advanced Engineering and Science

Currently the operators in the telecommunications market present offers of subscription to the consumers,and given that competition is strong in this area, most of these advertising offers are prepared to attract and / or keep customers.For this reason, customers face problems in choosing operators that meet their needs in terms of price, quality of service (QoS), etc..., while taking into account the margin between what is advertising and what is real. Therefore, we are led to solve a problem of decision support. Mathematical modeling of this problem led to the solution of an inverse problem. Specifi-cally, the inverse problem is to find the real Quality of Service (QoS) function knowing the theoretical QoS. To solve this problem we have reformulated in an optimization problem of minimizing the difference between the real quality of service (QoS) and theoretical (QoS). This model will help customers who seek to know the degree of sincerity of Their operators, as well as it is an opportunity for operators who want to maintain their resources so that they gain the trust of customers. The resulting optimization problem is solved using evolutionary algorithms. The numerical results showed the reliability and credibility of our inverse model and the performance and effectiveness of our approach.

The Competition Between ISPs in Presence of the Net Neutrality Mohamed El Amrani; Hamid Garmani; Mohamed Baslam; Rachid El Ayachi
International Journal of Informatics and Communication Technology (IJ-ICT) Vol 6, No 3: December 2017
Publisher : Institute of Advanced Engineering and Science

In this work, we present an economic model of computer networks that describes the in-teraction between Internet Service Providers (ISP ), customers and content provider. The competition between ISP s may be translated by the prices they require and the qualities of service (QoS) they offer. The customer demand for service from an ISP does not only de-pend on the price and quality of service (QoS) of the ISP , but it is influenced by all those offered by its competitors. This behavior has been extensively analyzed using game the-ory as a decision support tool. We interpret a non-neutral network when a content provider privileges ISP s by offering them more bandwidth to ensure proper QoS to support ap-plications that require more data transport capacity (voice over internet protocol (V OIP ) the live video streaming, online gaming). In addition, our work focuses on the price game analysis and QoS between ISP s in two cases: neutral network and non-neutral network. After showing the existence and uniqueness of equilibrium in terms of quality of service, we analyzed the impact of net neutrality on competition between ISP s. We also validated our theoretical study with numerical results, which show that the game has an equilibrium point which depends on all the parameters of the system.

A Game theoretic approach for competition over visibility in social networks Khadija Touya; Mohamed Baslam; Rachid El Ayachi; Mostafa Jourhmane
Bulletin of Electrical Engineering and Informatics Vol 8, No 2: June 2019
Publisher : Institute of Advanced Engineering and Science

Social Networks have known an important evolution in the last few years. These structures, made up of individuals who are tied by one or more specific types of interdependency, constitute the window for members to express their opinions and thoughts by sending posts to their own walls or others' timelines. Actually, when a content arrives, it's located on the top of the timeline pushing away older messages. This situation causes a permanent competition over visibility among subscribers who jump on opponents to promote conflict. Our study presents this competition as a non-cooperative game; each source has to choose frequencies which assure its visibility. We model it, exploring the theory of concave games, to reach a situation of equilibrium; a situation where no player has the ultimate ability to deviate from its current strategy. We formulate the named game, then we analyze it and prove that there is exactly one Nash equilibrium which is the convergence of all players' best responses. We finally provide some numerical results, taking into consideration a system of two sources with a specific frequency space, and analyze the effect of different parameters on sources' visibility on the walls of social networks.

A Game theoretic approach for competition over visibility in social networks Khadija Touya; Mohamed Baslam; Rachid El Ayachi; Mostafa Jourhmane
Bulletin of Electrical Engineering and Informatics Vol 8, No 2: June 2019
Publisher : Institute of Advanced Engineering and Science

Social Networks have known an important evolution in the last few years. These structures, made up of individuals who are tied by one or more specific types of interdependency, constitute the window for members to express their opinions and thoughts by sending posts to their own walls or others' timelines. Actually, when a content arrives, it's located on the top of the timeline pushing away older messages. This situation causes a permanent competition over visibility among subscribers who jump on opponents to promote conflict. Our study presents this competition as a non-cooperative game; each source has to choose frequencies which assure its visibility. We model it, exploring the theory of concave games, to reach a situation of equilibrium; a situation where no player has the ultimate ability to deviate from its current strategy. We formulate the named game, then we analyze it and prove that there is exactly one Nash equilibrium which is the convergence of all players' best responses. We finally provide some numerical results, taking into consideration a system of two sources with a specific frequency space, and analyze the effect of different parameters on sources' visibility on the walls of social networks.

A Game theoretic approach for competition over visibility in social networks Khadija Touya; Mohamed Baslam; Rachid El Ayachi; Mostafa Jourhmane
Bulletin of Electrical Engineering and Informatics Vol 8, No 2: June 2019
Publisher : Institute of Advanced Engineering and Science

Social Networks have known an important evolution in the last few years. These structures, made up of individuals who are tied by one or more specific types of interdependency, constitute the window for members to express their opinions and thoughts by sending posts to their own walls or others' timelines. Actually, when a content arrives, it's located on the top of the timeline pushing away older messages. This situation causes a permanent competition over visibility among subscribers who jump on opponents to promote conflict. Our study presents this competition as a non-cooperative game; each source has to choose frequencies which assure its visibility. We model it, exploring the theory of concave games, to reach a situation of equilibrium; a situation where no player has the ultimate ability to deviate from its current strategy. We formulate the named game, then we analyze it and prove that there is exactly one Nash equilibrium which is the convergence of all players' best responses. We finally provide some numerical results, taking into consideration a system of two sources with a specific frequency space, and analyze the effect of different parameters on sources' visibility on the walls of social networks.

Improved uplink throughput and energy efficiency of LoRaWAN using 2-hop LEACH protocol Yassine Oukessou; Mohamed Baslam; Mohamed Oukessou
Indonesian Journal of Electrical Engineering and Computer Science Vol 24, No 3: December 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v24.i3.pp1557-1563

The low power wide area networks (LPWAN) is the new connectivity technology that is geared towards energy constrained internet of things (IoT) devices, is starting to become one of the drivers of the re-accelerating IoT market and has one goal: ensure the wide range distance while reducing the battery energy consumption. We focus in this paper on the evaluation of the uplink throughput of the long-range wide area networks (LoRaWAN) then we attempt optimize the throughput and power dissipation using low energy adaptive clustering hierarchy (LEACH) protocol. Therefore, we exploit a novel module developed in NS-3 simulator for obtaining the first measurements scenario, then the LEACH algorithm for the second optimization case. As result, the simulation analysis will help us to add a new LoRaWAN routing protocol feature.

Optimisation of LEACH protocol based on a game theory clustering approach for wireless sensor networks Yassine Oukessou; Mohamed Baslam; Mohamed Oukessou
Indonesian Journal of Electrical Engineering and Computer Science Vol 21, No 2: February 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v21.i2.pp938-944

The wireless sensor network clustering routing mechanism is the best multi-hop algorithm used to aggregate data from sensors to the base station. Therefore the elected nodes refuse to be a clusters heads CH and have a selfish and non cooperative behaviours in each group cluster. All that due to the high electric energy consumption, and especially that the most existing sensors are powered by batteries. In this paper, we will analyse the selfishness behaviour by using the most knowing mathematical model Game theory to improve the interaction decision making for the CH selection, and make a comparison with LEACH protocol.

Title

Found 10 Documents
Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title Search

Found 10 Documents Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title

Found 10 Documents
Search