top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.

Biblioteca

MARC Lista (tabellare)
Hybrid systems with constraints [[electronic resource] /] / edited by Jamal Daafouz, Sophie Tarbouriech, Mario Sigalotti
Hybrid systems with constraints [[electronic resource] /] / edited by Jamal Daafouz, Sophie Tarbouriech, Mario Sigalotti
Pubbl/distr/stampa Hoboken, N.J., : ISTE Ltd/John Wiley and Sons Inc., 2013
Descrizione fisica 1 online resource (277 p.)
Disciplina 621
Collana Automation-control and industrial engineering series
Soggetto topico Hybrid systems
Control theory
ISBN 1-118-63991-X
1-118-63985-5
1-118-63973-1
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto CONTENTS; Preface; Chapter 1. Positive Systems: Discretization with Positivityand Constraints; 1.1. Introduction and statement of the problem; 1.2. Discretization of switched positive systemsvia Padé transformations; 1.3. Discretization of positive switched systemswith sparsity constraints; 1.4. Conclusions; 1.5. Bibliography; Chapter 2. Advanced Lyapunov Functions for Lur'e Systems; 2.1. Introduction; 2.2. Motivating example; 2.3. A new Lyapunov Lur'e-type function for discrete-timeLur'e systems; 2.4. Switched discrete-time Lur'e system with arbitraryswitching law
2.5. Switched discrete-time Lur'e system controlledby the switching law2.6. Conclusion; 2.7. Bibliography; Chapter 3. Stability of Switched DAEs; 3.1. Introduction; 3.2. Preliminaries; 3.3. Stability results; 3.4. Conclusion; 3.5. Acknowledgments; 3.6. Bibliography; Chapter 4. Stabilization of Persistently Excited Linear Systems; 4.1. Introduction; 4.2. Finite-dimensional systems; 4.3. Infinite-dimensional systems; 4.4. Further discussion and open problems; 4.5. Bibliography; Chapter 5. Hybrid Coordination of Flow Networks; 5.1. Introduction; 5.2. Flow network model and problem statement
5.3. Self-triggered gossiping control of flow networks5.4. Practical load balancing; 5.5. Load balancing with delayed actuation and skewed clocks; 5.6. Asymptotical load balancing; 5.7. Conclusions; 5.8. Acknowledgments; 5.9. Bibliography; Chapter 6. Control of Hybrid Systems: An Overviewof Recent Advances; 6.1. Introduction; 6.2. Preliminaries; 6.3. Stabilization of hybrid systems; 6.4. Static state feedback stabilizers; 6.5. Passivity-based control; 6.6. Tracking control; 6.7. Conclusions; 6.8. Acknowledgments; 6.9. Bibliography
Chapter 7. Exponential Stability for Hybrid Systemswith Saturations7.1. Introduction; 7.2. Problem statement; 7.3. Set theory and invariance for nonlinear systems:brief overview; 7.4. Quadratic stability for saturated hybrid systems; 7.5. Computational issues; 7.6. Numerical examples; 7.7. Conclusions; 7.8. Bibliography; Chapter 8. Reference Mirroring for Control with Impacts; 8.1. Introduction; 8.2. Hammering a surface; 8.3. Global tracking of a Newton's cradle; 8.4. Global tracking in planar triangles; 8.5. Global state estimation on n-dimensional convex polyhedra
8.6. Proof of the main theorems8.7. Conclusions; 8.8. Acknowledgments; 8.9. Bibliography; List of Authors; Index
Record Nr. UNINA-9910141563103321
Hoboken, N.J., : ISTE Ltd/John Wiley and Sons Inc., 2013
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Hybrid systems with constraints / / edited by Jamal Daafouz, Sophie Tarbouriech, Mario Sigalotti
Hybrid systems with constraints / / edited by Jamal Daafouz, Sophie Tarbouriech, Mario Sigalotti
Edizione [1st ed.]
Pubbl/distr/stampa Hoboken, N.J., : ISTE Ltd/John Wiley and Sons Inc., 2013
Descrizione fisica 1 online resource (277 p.)
Disciplina 621
Collana Automation-control and industrial engineering series
Soggetto topico Hybrid systems
Control theory
ISBN 9781118639917
111863991X
9781118639856
1118639855
9781118639733
1118639731
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto CONTENTS; Preface; Chapter 1. Positive Systems: Discretization with Positivityand Constraints; 1.1. Introduction and statement of the problem; 1.2. Discretization of switched positive systemsvia Padé transformations; 1.3. Discretization of positive switched systemswith sparsity constraints; 1.4. Conclusions; 1.5. Bibliography; Chapter 2. Advanced Lyapunov Functions for Lur'e Systems; 2.1. Introduction; 2.2. Motivating example; 2.3. A new Lyapunov Lur'e-type function for discrete-timeLur'e systems; 2.4. Switched discrete-time Lur'e system with arbitraryswitching law
2.5. Switched discrete-time Lur'e system controlledby the switching law2.6. Conclusion; 2.7. Bibliography; Chapter 3. Stability of Switched DAEs; 3.1. Introduction; 3.2. Preliminaries; 3.3. Stability results; 3.4. Conclusion; 3.5. Acknowledgments; 3.6. Bibliography; Chapter 4. Stabilization of Persistently Excited Linear Systems; 4.1. Introduction; 4.2. Finite-dimensional systems; 4.3. Infinite-dimensional systems; 4.4. Further discussion and open problems; 4.5. Bibliography; Chapter 5. Hybrid Coordination of Flow Networks; 5.1. Introduction; 5.2. Flow network model and problem statement
5.3. Self-triggered gossiping control of flow networks5.4. Practical load balancing; 5.5. Load balancing with delayed actuation and skewed clocks; 5.6. Asymptotical load balancing; 5.7. Conclusions; 5.8. Acknowledgments; 5.9. Bibliography; Chapter 6. Control of Hybrid Systems: An Overviewof Recent Advances; 6.1. Introduction; 6.2. Preliminaries; 6.3. Stabilization of hybrid systems; 6.4. Static state feedback stabilizers; 6.5. Passivity-based control; 6.6. Tracking control; 6.7. Conclusions; 6.8. Acknowledgments; 6.9. Bibliography
Chapter 7. Exponential Stability for Hybrid Systemswith Saturations7.1. Introduction; 7.2. Problem statement; 7.3. Set theory and invariance for nonlinear systems:brief overview; 7.4. Quadratic stability for saturated hybrid systems; 7.5. Computational issues; 7.6. Numerical examples; 7.7. Conclusions; 7.8. Bibliography; Chapter 8. Reference Mirroring for Control with Impacts; 8.1. Introduction; 8.2. Hammering a surface; 8.3. Global tracking of a Newton's cradle; 8.4. Global tracking in planar triangles; 8.5. Global state estimation on n-dimensional convex polyhedra
8.6. Proof of the main theorems8.7. Conclusions; 8.8. Acknowledgments; 8.9. Bibliography; List of Authors; Index
Record Nr. UNINA-9910817534403321
Hoboken, N.J., : ISTE Ltd/John Wiley and Sons Inc., 2013
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Information-centric networks [[electronic resource] ] : a new paradigm for the Internet / / Gabriel M. Brito, Pedro Braconnot Velloso, Igor M. Moraes
Information-centric networks [[electronic resource] ] : a new paradigm for the Internet / / Gabriel M. Brito, Pedro Braconnot Velloso, Igor M. Moraes
Autore Brito Gabriel M
Edizione [1st edition]
Pubbl/distr/stampa Hoboken, N.J., : ISTE Ltd/John Wiley and Sons Inc., 2013
Descrizione fisica 1 online resource (138 p.)
Disciplina 025.042
Altri autori (Persone) VellosoPedro Braconnot
MoraesIgor M
Collana Focus series in networks and telecommunications
Soggetto topico Information networks
Internet
World Wide Web
ISBN 1-118-57989-5
1-118-57984-4
1-118-57990-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto CONTENTS; INTRODUCTION; CHAPTER 1. CONTENT DISTRIBUTION ON THE INTERNET; 1.1. End-to-end concept and limitations; 1.2. Multicast communication; 1.3. Peer-to-peer systems; 1.4. Content distribution networks; 1.5. Publish/subscribe systems; CHAPTER 2. INFORMATION-CENTRIC NETWORKS; 2.1. Content naming; 2.2. Content or name-based routing; 2.3. Content caching; CHAPTER 3. MAIN ICN ARCHITECTURES; 3.1. Content-based networking/combined broadcastand content-based; 3.2. Data-oriented network architecture; 3.3. Content-centric networking/named-datanetworking
3.4. Publish-subscribe Internet routing paradigm/publish-subscribe Internet technologies3.5. Content-centric inter-network architecture; 3.6. Other architectures; 3.7. General comparison; CHAPTER 4. CHALLENGES; 4.1. Naming; 4.2. Routing; 4.3. Caching; 4.4. Security; 4.5. Mobility support in ICN; 4.6. Applications; CHAPTER 5. PRACTICAL ISSUES; 5.1. Economic models; 5.2. Content routers; CONCLUSION; ACKNOWLEDGMENT; BIBLIOGRAPHY; INDEX
Record Nr. UNINA-9910141563503321
Brito Gabriel M  
Hoboken, N.J., : ISTE Ltd/John Wiley and Sons Inc., 2013
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Information-centric networks : a new paradigm for the Internet / / Gabriel M. Brito, Pedro Braconnot Velloso, Igor M. Moraes
Information-centric networks : a new paradigm for the Internet / / Gabriel M. Brito, Pedro Braconnot Velloso, Igor M. Moraes
Autore Brito Gabriel M
Edizione [1st edition]
Pubbl/distr/stampa Hoboken, N.J., : ISTE Ltd/John Wiley and Sons Inc., 2013
Descrizione fisica 1 online resource (138 p.)
Disciplina 025.042
Altri autori (Persone) VellosoPedro Braconnot
MoraesIgor M
Collana Focus series in networks and telecommunications
Soggetto topico Information networks
Internet
World Wide Web
ISBN 9781118579893
1118579895
9781118579848
1118579844
9781118579909
1118579909
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto CONTENTS; INTRODUCTION; CHAPTER 1. CONTENT DISTRIBUTION ON THE INTERNET; 1.1. End-to-end concept and limitations; 1.2. Multicast communication; 1.3. Peer-to-peer systems; 1.4. Content distribution networks; 1.5. Publish/subscribe systems; CHAPTER 2. INFORMATION-CENTRIC NETWORKS; 2.1. Content naming; 2.2. Content or name-based routing; 2.3. Content caching; CHAPTER 3. MAIN ICN ARCHITECTURES; 3.1. Content-based networking/combined broadcastand content-based; 3.2. Data-oriented network architecture; 3.3. Content-centric networking/named-datanetworking
3.4. Publish-subscribe Internet routing paradigm/publish-subscribe Internet technologies3.5. Content-centric inter-network architecture; 3.6. Other architectures; 3.7. General comparison; CHAPTER 4. CHALLENGES; 4.1. Naming; 4.2. Routing; 4.3. Caching; 4.4. Security; 4.5. Mobility support in ICN; 4.6. Applications; CHAPTER 5. PRACTICAL ISSUES; 5.1. Economic models; 5.2. Content routers; CONCLUSION; ACKNOWLEDGMENT; BIBLIOGRAPHY; INDEX
Record Nr. UNINA-9910817534603321
Brito Gabriel M  
Hoboken, N.J., : ISTE Ltd/John Wiley and Sons Inc., 2013
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Optimization in engineering sciences [[electronic resource] ] : exact methods / / Pierre Borne ... [et al.]
Optimization in engineering sciences [[electronic resource] ] : exact methods / / Pierre Borne ... [et al.]
Autore Borne Pierre
Pubbl/distr/stampa Hoboken, N.J., : ISTE Ltd/John Wiley and Sons Inc., 2013
Descrizione fisica 1 online resource (328 p.)
Disciplina 519.92
629.89
Altri autori (Persone) BornePierre
Collana ISTE
Soggetto topico Engineering mathematics
Mathematical optimization
Program transformation (Computer programming)
Algorithms
Systems engineering
ISBN 1-118-57789-2
1-299-14153-6
1-118-57775-2
1-118-57784-1
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Title Page; Contents; Foreword; Preface; List of Acronyms; Chapter 1. Linear Programming; 1.1. Objective of linear programming; 1.2. Stating the problem; 1.3. Lagrange method; 1.4. Simplex algorithm; 1.4.1. Principle; 1.4.2. Simplicial form formulation; 1.4.3. Transition from one simplicial form to another; 1.4.4. Summary of the simplex algorithm; 1.5. Implementation example; 1.6. Linear programming applied to the optimization of resource allocation; 1.6.1. Areas of application; 1.6.2. Resource allocation for advertising; 1.6.3. Optimization of a cut of paper rolls
1.6.4. Structure of linear program of an optimal control problemChapter 2. Nonlinear Programming; 2.1. Problem formulation; 2.2. Karush-Kuhn-Tucker conditions; 2.3. General search algorithm; 2.3.1. Main steps; 2.3.2. Computing the search direction; 2.3.3. Computation of advancement step; 2.4. Monovariable methods; 2.4.1. Coggin's method (of polynomial interpolation); 2.4.2. Golden section method; 2.5. Multivariable methods; 2.5.1. Direct search methods; 2.5.2. Gradient methods; Chapter 3. Dynamic Programming; 3.1. Principle of dynamic programming; 3.1.1. Stating the problem
3.1.2. Decision problem3.2. Recurrence equation of optimality; 3.3. Particular cases; 3.3.1. Infinite horizon stationary problems; 3.3.2. Variable horizon problem; 3.3.3. Random horizon problem; 3.3.4. Taking into account sum-like constraints; 3.3.5. Random evolution law; 3.3.6. Initialization when the final state is imposed; 3.3.7. The case when the necessary information is not always available; 3.4. Examples; 3.4.1. Route optimization; 3.4.2. The smuggler problem; Chapter 4. Hopfield Networks; 4.1. Structure; 4.2. Continuous dynamic Hopfield networks; 4.2.1. General problem
4.2.2. Application to the traveling salesman problem4.3. Optimization by Hopfield networks, based on simulated annealing; 4.3.1. Deterministic method; 4.3.2. Stochastic method; Chapter 5. Optimization in System Identification; 5.1. The optimal identification principle; 5.2. Formulation of optimal identification problems; 5.2.1. General problem; 5.2.2. Formulation based on optimization theory; 5.2.3. Formulation based on estimation theory (statistics); 5.3. Usual identification models; 5.3.1. General model; 5.3.2. Rational input/output (RIO) models
5.3.3. Class of autoregressive models (ARMAX)5.3.4. Class of state space representation models; 5.4. Basic least squares method; 5.4.1. LSM type solution; 5.4.2. Geometric interpretation of the LSM solution; 5.4.3. Consistency of the LSM type solution; 5.4.4. Example of application of the LSM for an ARX model; 5.5. Modified least squares methods; 5.5.1. Recovering lost consistency; 5.5.2. Extended LSM; 5.5.3. Instrumental variables method; 5.6. Minimum prediction error method; 5.6.1. Basic principle and algorithm; 5.6.2. Implementation of the MPEM for ARMAX models
5.6.3. Convergence and consistency of MPEM type estimations
Record Nr. UNINA-9910141493603321
Borne Pierre  
Hoboken, N.J., : ISTE Ltd/John Wiley and Sons Inc., 2013
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Optimization in engineering sciences : exact methods / / Pierre Borne ... [et al.]
Optimization in engineering sciences : exact methods / / Pierre Borne ... [et al.]
Autore Borne Pierre
Edizione [1st ed.]
Pubbl/distr/stampa Hoboken, N.J., : ISTE Ltd/John Wiley and Sons Inc., 2013
Descrizione fisica 1 online resource (328 p.)
Disciplina 519.92
629.89
Altri autori (Persone) BornePierre
Collana ISTE
Soggetto topico Engineering mathematics
Mathematical optimization
Program transformation (Computer programming)
Algorithms
Systems engineering
ISBN 9781118577899
1118577892
9781299141537
1299141536
9781118577752
1118577752
9781118577844
1118577841
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Title Page; Contents; Foreword; Preface; List of Acronyms; Chapter 1. Linear Programming; 1.1. Objective of linear programming; 1.2. Stating the problem; 1.3. Lagrange method; 1.4. Simplex algorithm; 1.4.1. Principle; 1.4.2. Simplicial form formulation; 1.4.3. Transition from one simplicial form to another; 1.4.4. Summary of the simplex algorithm; 1.5. Implementation example; 1.6. Linear programming applied to the optimization of resource allocation; 1.6.1. Areas of application; 1.6.2. Resource allocation for advertising; 1.6.3. Optimization of a cut of paper rolls
1.6.4. Structure of linear program of an optimal control problemChapter 2. Nonlinear Programming; 2.1. Problem formulation; 2.2. Karush-Kuhn-Tucker conditions; 2.3. General search algorithm; 2.3.1. Main steps; 2.3.2. Computing the search direction; 2.3.3. Computation of advancement step; 2.4. Monovariable methods; 2.4.1. Coggin's method (of polynomial interpolation); 2.4.2. Golden section method; 2.5. Multivariable methods; 2.5.1. Direct search methods; 2.5.2. Gradient methods; Chapter 3. Dynamic Programming; 3.1. Principle of dynamic programming; 3.1.1. Stating the problem
3.1.2. Decision problem3.2. Recurrence equation of optimality; 3.3. Particular cases; 3.3.1. Infinite horizon stationary problems; 3.3.2. Variable horizon problem; 3.3.3. Random horizon problem; 3.3.4. Taking into account sum-like constraints; 3.3.5. Random evolution law; 3.3.6. Initialization when the final state is imposed; 3.3.7. The case when the necessary information is not always available; 3.4. Examples; 3.4.1. Route optimization; 3.4.2. The smuggler problem; Chapter 4. Hopfield Networks; 4.1. Structure; 4.2. Continuous dynamic Hopfield networks; 4.2.1. General problem
4.2.2. Application to the traveling salesman problem4.3. Optimization by Hopfield networks, based on simulated annealing; 4.3.1. Deterministic method; 4.3.2. Stochastic method; Chapter 5. Optimization in System Identification; 5.1. The optimal identification principle; 5.2. Formulation of optimal identification problems; 5.2.1. General problem; 5.2.2. Formulation based on optimization theory; 5.2.3. Formulation based on estimation theory (statistics); 5.3. Usual identification models; 5.3.1. General model; 5.3.2. Rational input/output (RIO) models
5.3.3. Class of autoregressive models (ARMAX)5.3.4. Class of state space representation models; 5.4. Basic least squares method; 5.4.1. LSM type solution; 5.4.2. Geometric interpretation of the LSM solution; 5.4.3. Consistency of the LSM type solution; 5.4.4. Example of application of the LSM for an ARX model; 5.5. Modified least squares methods; 5.5.1. Recovering lost consistency; 5.5.2. Extended LSM; 5.5.3. Instrumental variables method; 5.6. Minimum prediction error method; 5.6.1. Basic principle and algorithm; 5.6.2. Implementation of the MPEM for ARMAX models
5.6.3. Convergence and consistency of MPEM type estimations
Record Nr. UNINA-9910806124003321
Borne Pierre  
Hoboken, N.J., : ISTE Ltd/John Wiley and Sons Inc., 2013
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
User-Centered Agile method [[electronic resource] /] / Dominique Deuff, Mathilde Cosquer
User-Centered Agile method [[electronic resource] /] / Dominique Deuff, Mathilde Cosquer
Autore Deuff Dominique
Pubbl/distr/stampa Hoboken, N.J., : ISTE Ltd/John Wiley and Sons Inc., 2013
Descrizione fisica 1 online resource (128 p.)
Disciplina 621.38
Altri autori (Persone) CosquerMathilde
Collana Focus series in networks and telecommunications
Soggetto topico Agile software development
ISBN 1-118-57500-8
1-118-57482-6
1-118-57479-6
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto 5.1.Application of the User-Centered Agile methodon the Cat's Eyes project5.2.Application of the User-Centered Agile methodon the Bind project; 5.3 Balanced evaluation of the case studies; CONCLUSION; BIBLIOGRAPHY; INDEX
Record Nr. UNINA-9910141564203321
Deuff Dominique  
Hoboken, N.J., : ISTE Ltd/John Wiley and Sons Inc., 2013
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
User-Centered Agile method / / Dominique Deuff, Mathilde Cosquer
User-Centered Agile method / / Dominique Deuff, Mathilde Cosquer
Autore Deuff Dominique
Edizione [1st ed.]
Pubbl/distr/stampa Hoboken, N.J., : ISTE Ltd/John Wiley and Sons Inc., 2013
Descrizione fisica 1 online resource (128 p.)
Disciplina 621.38
Altri autori (Persone) CosquerMathilde
Collana Focus series in networks and telecommunications
Soggetto topico Agile software development
ISBN 9781118575000
1118575008
9781118574829
1118574826
9781118574799
1118574796
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto 5.1.Application of the User-Centered Agile methodon the Cat's Eyes project5.2.Application of the User-Centered Agile methodon the Bind project; 5.3 Balanced evaluation of the case studies; CONCLUSION; BIBLIOGRAPHY; INDEX
Record Nr. UNINA-9910811082903321
Deuff Dominique  
Hoboken, N.J., : ISTE Ltd/John Wiley and Sons Inc., 2013
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui