|
|
|
|
| LEADER |
02875nam a22004935i 4500 |
| 001 |
6813 |
| 003 |
DE-He213 |
| 005 |
20130725191822.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100301s2009 gw | s |||| 0|eng d |
| 020 |
# |
# |
|a 9783540959809
|9 978-3-540-95980-9
|
| 024 |
7 |
# |
|a 10.1007/978-3-540-95980-9
|2 doi
|
| 050 |
# |
4 |
|a TJ210.2-211.495
|
| 050 |
# |
4 |
|a TJ163.12
|
| 072 |
# |
7 |
|a TJFM
|2 bicssc
|
| 072 |
# |
7 |
|a TJFD
|2 bicssc
|
| 072 |
# |
7 |
|a TEC004000
|2 bisacsh
|
| 072 |
# |
7 |
|a TEC037000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 629.8
|2 23
|
| 100 |
1 |
# |
|a Jungers, Raphal͡.
|e author.
|
| 245 |
1 |
4 |
|a The Joint Spectral Radius
|b Theory and Applications /
|c by Raphal͡ Jungers.
|h [electronic resource] :
|
| 264 |
# |
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2009.
|
| 300 |
# |
# |
|b online resource.
|
| 336 |
# |
# |
|a text
|b txt
|2 rdacontent
|
| 337 |
# |
# |
|a computer
|b c
|2 rdamedia
|
| 338 |
# |
# |
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
# |
# |
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
# |
|a Lecture Notes in Control and Information Sciences,
|v 385
|x 0170-8643 ;
|
| 505 |
0 |
# |
|a Part I Theory -- Basics -- Classical results and problems -- Nonnegative integer matrices -- In the finiteness property -- Part II Applications -- Continuity of wavelet functions -- Capacity of codes -- Overlap-free words -- Trackable graphs -- Part III Appendices -- Overlap-free words.
|
| 520 |
# |
# |
|a The first part of this monograph is dedicated to theoretical results. The first two chapters present the above mentioned survey on the joint spectral radius. Its minimum growth counterpart, the joint spectral subradius, is also considered. The next two chapters point out two specific theoretical topics, that are important in practical applications: the particular case of nonnegative matrices, and the Finiteness Property. The second part considers applications involving the joint spectral radius. The author first presents the continuity of wavelet. He then studies the problem of the capacity of codes submitted to forbidden difference constraints. The notion of overlap-free words is then discussed, a problem that arises in combinatorics on words. The book then ends with the problem of trackability of sensor networks, and shows how the theoretical results developed in the first part allow to solve this problem efficiently.
|
| 650 |
# |
0 |
|a Engineering.
|
| 650 |
# |
0 |
|a Systems theory.
|
| 650 |
# |
0 |
|a Control engineering systems.
|
| 650 |
1 |
4 |
|a Engineering.
|
| 650 |
2 |
4 |
|a Control , Robotics, Mechatronics.
|
| 650 |
2 |
4 |
|a Systems Theory, Control.
|
| 710 |
2 |
# |
|a SpringerLink (Online service)
|
| 773 |
0 |
# |
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540959793
|
| 830 |
# |
0 |
|a Lecture Notes in Control and Information Sciences,
|v 385
|x 0170-8643 ;
|
| 856 |
4 |
0 |
|u https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-3-540-95980-9
|
| 912 |
# |
# |
|a ZDB-2-ENG
|
| 950 |
# |
# |
|a Engineering (Springer-11647)
|