Les Inscriptions à la Bibliothèque sont ouvertes en
ligne via le site: https://biblio.enp.edu.dz
Les Réinscriptions se font à :
• La Bibliothèque Annexe pour les étudiants en
2ème Année CPST
• La Bibliothèque Centrale pour les étudiants en Spécialités
A partir de cette page vous pouvez :
Retourner au premier écran avec les recherches... |
Détail de l'éditeur
Éditeur University of Sussex
localisé à
Documents disponibles chez cet éditeur
Affiner la rechercheBranch and bound for the mixed integer linear program / Arezki, Yazid
Titre : Branch and bound for the mixed integer linear program Type de document : texte imprimé Auteurs : Arezki, Yazid, Auteur ; Corner, Lewis J., Directeur de thèse Editeur : University of Sussex Année de publication : 1983 Importance : 83 f. Présentation : ill. Format : 30 cm. Note générale : Mémoire de Magister : Informatique : Leeds, Univrsity of Sussex : 1983
Annexe f. 83 - 130. Bibliogr. [2] fLangues : Anglais (eng) Mots-clés : Mixed ; Integer -- linear Index. décimale : M005983 Résumé : The aim of this project is to reviex the theory and practice of the branch and bound techniques employed for solving mixed (pure) integer problems.
A computer program has been developed on the pet to solve restricted set of problems by the branch and bound method. the user is required to load the program and specify its problem coefficients.
the program will follow an automatic excution if wanted.
If not the user has to input the node and the branching variable wanted.Branch and bound for the mixed integer linear program [texte imprimé] / Arezki, Yazid, Auteur ; Corner, Lewis J., Directeur de thèse . - [S.l.] : University of Sussex, 1983 . - 83 f. : ill. ; 30 cm.
Mémoire de Magister : Informatique : Leeds, Univrsity of Sussex : 1983
Annexe f. 83 - 130. Bibliogr. [2] f
Langues : Anglais (eng)
Mots-clés : Mixed ; Integer -- linear Index. décimale : M005983 Résumé : The aim of this project is to reviex the theory and practice of the branch and bound techniques employed for solving mixed (pure) integer problems.
A computer program has been developed on the pet to solve restricted set of problems by the branch and bound method. the user is required to load the program and specify its problem coefficients.
the program will follow an automatic excution if wanted.
If not the user has to input the node and the branching variable wanted.Exemplaires
Code-barres Cote Support Localisation Section Disponibilité Spécialité Etat_Exemplaire M005983 M005983 Papier Bibliothèque centrale Mémoire de Magister Disponible
Titre : Limit cycles in discrete systems Type de document : texte imprimé Auteurs : Ali Goucem, Auteur ; D. P. Atherton, Directeur de thèse Editeur : University of Sussex Année de publication : 1984 Importance : 51 f. Présentation : ill. Format : 27 cm. Note générale : Mémoire de Master : Automatique : Angleterre, University of Sussex : 1984
Annexe f. 52 - 86 . Bibliogr. f. 87Langues : Anglais (eng) Mots-clés : Nonlinear sampled data systems
Continuous systems
Limit cycles
Continuous describing function
Z-transform describing function
A-loci
CAD softwareIndex. décimale : Ms00384 Résumé : Instabilities usually of interest in typical nonlinear sampled data systems, as with continuous systems, are those which occur as limit cycles.
Methods which allow the detrmination of the values of certain system parameters for which limit cycles cease are therefore particularly useful.
The problem is more difficult than the continuous case since even relatively simple nonlinear sampled-data systems may have several possible stable limit cycles.
Three methods have been compared here.
The first two, based on the describing function approach, namely the continuous describing function and the z-transform describing function have also been extended to systems containing nonlinearities represented by polynomials (i.e. continuous nonliearities) where it has been shown that the derivation of the D.F expression is more straightforward than in the case of a discontinuous nonlinearity such as a relay or an ideal saturation.
The third method is an exact method using A-loci and the CAD software has been extended for systems containing a quantizer and a discrete controller, thus allowing the complete digital control system to be analysed.
Also the ability to calculate the phase and gain margins for each of the exisiting limit cycles enables stable systems to be designed with given phase and gain margins.Limit cycles in discrete systems [texte imprimé] / Ali Goucem, Auteur ; D. P. Atherton, Directeur de thèse . - [S.l.] : University of Sussex, 1984 . - 51 f. : ill. ; 27 cm.
Mémoire de Master : Automatique : Angleterre, University of Sussex : 1984
Annexe f. 52 - 86 . Bibliogr. f. 87
Langues : Anglais (eng)
Mots-clés : Nonlinear sampled data systems
Continuous systems
Limit cycles
Continuous describing function
Z-transform describing function
A-loci
CAD softwareIndex. décimale : Ms00384 Résumé : Instabilities usually of interest in typical nonlinear sampled data systems, as with continuous systems, are those which occur as limit cycles.
Methods which allow the detrmination of the values of certain system parameters for which limit cycles cease are therefore particularly useful.
The problem is more difficult than the continuous case since even relatively simple nonlinear sampled-data systems may have several possible stable limit cycles.
Three methods have been compared here.
The first two, based on the describing function approach, namely the continuous describing function and the z-transform describing function have also been extended to systems containing nonlinearities represented by polynomials (i.e. continuous nonliearities) where it has been shown that the derivation of the D.F expression is more straightforward than in the case of a discontinuous nonlinearity such as a relay or an ideal saturation.
The third method is an exact method using A-loci and the CAD software has been extended for systems containing a quantizer and a discrete controller, thus allowing the complete digital control system to be analysed.
Also the ability to calculate the phase and gain margins for each of the exisiting limit cycles enables stable systems to be designed with given phase and gain margins.Exemplaires
Code-barres Cote Support Localisation Section Disponibilité Spécialité Etat_Exemplaire Ms00384 Ms00384 Papier Bibliothèque centrale Mémoire de Master Disponible Documents numériques
GOUCEM.Ali.pdfURL
Titre : Cascade self-tuning control Type de document : texte imprimé Auteurs : Mohamed Kharbouch, Auteur ; J. Peter, Directeur de thèse Editeur : University of Sussex Année de publication : 1986 Importance : 122 f. Présentation : ill. Format : 27 cm. Note générale : Mémoire Master : Automatique : Angleterre, University of Sussex : 1986
Bibliogr. f. 123 - 128 . Annexe f. 129 - 143Langues : Anglais (eng) Mots-clés : Self-tuning control
Control algorithm
Control design
Relative degreeIndex. décimale : Ms00386 Résumé : During the last two decades adaptive control has been a very active area of research.
Self-tuning control has reached the age of maturity to be widely used in industrial applications.
Most self-tuning applications to date have been concerned with single-loop configurations.
In contrast this disertation consideres a two-loop cascade self-tuning configuration.
A description of destributed computer control systems is given through Conic language.
The continuous-time self tuning control algorithm version of Gawthrop is used.
Robustness theory for single loop is discussed using frequency domain loci.
This theory is used to predict the stability of two-loop self-tuning control in cascade.
Some simulation examples for cascade configuration are given and compared with the previous predictions.
The simulations are made using Conic language.
Finally a real plant consisting of two tanks in cascade is controlled this is then compared to the predictions and simulations.Cascade self-tuning control [texte imprimé] / Mohamed Kharbouch, Auteur ; J. Peter, Directeur de thèse . - [S.l.] : University of Sussex, 1986 . - 122 f. : ill. ; 27 cm.
Mémoire Master : Automatique : Angleterre, University of Sussex : 1986
Bibliogr. f. 123 - 128 . Annexe f. 129 - 143
Langues : Anglais (eng)
Mots-clés : Self-tuning control
Control algorithm
Control design
Relative degreeIndex. décimale : Ms00386 Résumé : During the last two decades adaptive control has been a very active area of research.
Self-tuning control has reached the age of maturity to be widely used in industrial applications.
Most self-tuning applications to date have been concerned with single-loop configurations.
In contrast this disertation consideres a two-loop cascade self-tuning configuration.
A description of destributed computer control systems is given through Conic language.
The continuous-time self tuning control algorithm version of Gawthrop is used.
Robustness theory for single loop is discussed using frequency domain loci.
This theory is used to predict the stability of two-loop self-tuning control in cascade.
Some simulation examples for cascade configuration are given and compared with the previous predictions.
The simulations are made using Conic language.
Finally a real plant consisting of two tanks in cascade is controlled this is then compared to the predictions and simulations.Exemplaires
Code-barres Cote Support Localisation Section Disponibilité Spécialité Etat_Exemplaire Ms00386 Ms00386 Papier Bibliothèque centrale Mémoire de Master Disponible Documents numériques
KARBOUCH.Mohamed.pdfURL