Papers by El Mehdi STOUTI
Information system development is a result of a complex mix of forces that are controlled by tech... more Information system development is a result of a complex mix of forces that are controlled by technological issues as well as social, organizational and economic issues. Starting from the need to compare the long term effect of the centralized and decentralized systems and more particularly, the utility of the swarm executable choreographies, the present paper comes up with a method of analyzing the effects which the information system may have over society. Our analysis is not meant to predict some precise values over some indicators but rather to predict the value of some comparative measures among indicators. The events taken into account will be the Black Swan events and sequences of complex events whose effects are difficult to be estimated without software methods.
À ma très chère et douce mère et mon très cher père À tous ceux qui me sont chers...
Application of the FDTD Method to Identification of Detected Objects in Archaeology
Geological radars or GPR (Ground Penetrating Radar), are electromagnetic systems used for the non... more Geological radars or GPR (Ground Penetrating Radar), are electromagnetic systems used for the non-destructive study of subsoil. They are based on the transmission by an antenna coupled to the ground, of electromagnetic pulses with short duration or infrequent of harmonic waves sweeping a certain frequency band. The goal of the paper is to study the temporal and spatial discretization of Maxwell’s equations and the formulation of iterative terms, which calculate numerically the electromagnetic fields. For this, we have written a code in FORTRAN 90 based on the FDTD numerical method that we have applied to some electromagnetic problems and also a model, which is interesting in archeology, the wall in this study.
International Journal of Advanced Computer Science and Applications, 2013
Probabilistic algorithms are designed to handle problems that do not admit deterministic effectiv... more Probabilistic algorithms are designed to handle problems that do not admit deterministic effective solutions. In the case of the election problem, many algorithms are available and applicable under appropriate assumptions, for example: the uniform election in trees, k−trees and polyominoids. In this paper, first, we introduce a probabilistic algorithm for the uniform election in the triangular grid graphs, then, we expose the set of rules that generate the class of the triangular grid graphs. The main of this paper is devoted to the analysis of our algorithm. We show that our algorithm is totally fair in so far as it gives the same probability to any vertex of the given graph to be elected.
In this paper we introduce and analyze a probabilistic distributed algorithm for minimum spanning... more In this paper we introduce and analyze a probabilistic distributed algorithm for minimum spanning tree construction. Our algorithm is based firstly on the handshake algorithm that produces firstly k sub-spanning trees, where k is the size of the maximal matching produced. Secondly, the merged step of our algorithm is executed in a distributed manner and following some roles to reduce the total number of those sub-spanning from k to 1. We proof that the residual graph is acyclic and all vertices belong to it. A detailed analysis of the number of exchanged messages is carried on to validate the effectiveness of our algorithm.
Uploads
Papers by El Mehdi STOUTI