#### Filter Results:

#### Publication Year

1995

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- R. Ahl laamara, M. Ait Ben Haddou, E. H Saidi
- 2008

In this paper, we provide a general classification of supersymmeric QFT4s into three basic sets: ordinary, affine and indefinite classes. The last class, which has not been enough explored in literature , is shown to share most of properties of ordinary and affine super QFT4s. This includes, amongst others, its embedding in type II string on local… (More)

- R. Abounasr, M. Ait Ben Haddou
- 2008

Using Iqbal-Netzike-Vafa dictionary giving the correspondence between the H2 homology of del Pezzo surfaces and p-branes, we develop a new way to approach system of brane bounds in M-theory on S 1. We first review the structure of ten dimensional quantum Hall soliton (QHS) from the view of M-theory on S 1. Then, we show how the D0 dissolution in D2-brane is… (More)

Using geometric engineering method of 4D N = 2 quiver gauge theories and results on the classification of Kac-Moody (KM) algebras, we show on explicit examples that there exist three sectors of N = 2 infrared CFT4s. Since the geometric engineering of these CFT4s involve type II strings on K3 fibered CY3 singularities, we conjecture the existence of three… (More)

- M. Ait Ben Haddou, A. Belhajand, E. H. Saidi
- 2008

Using Katz, Klemm and Vafa geometric engineering method of N = 2 supersymmetric QFT4s and results on the classification of generalized Cartan matrices of Kac-Moody (KM) algebras, we study the un-explored class of N = 2 CFT4s based on indefinite singularities. We show that the vanishing condition for the general expression of holomorphic beta function of N =… (More)

- M. Haddou
- 2008

A class of smoothing methods is proposed for solving mathematical programs with equimibrium constraints. We introduce new and very simple regularizations of the complementarity constraints. Some estimate distance to optimal solution and expansions of the optimal value function are presented. Limited numerical experiments using SNOPT algorithm are presented… (More)

This paper is devoted to the study of a routing problem in telecommunication networks, when the cost function is the average delay. We establish asymptotic expansions for the value function and solutions in the vicinity of a congested nominal problem. The study is strongly related to the one of a partial inverse barrier method for linear programming.… (More)