The D-decomposition technique for linear matrix inequalities
Abstract In the framework of the theory of linear matrix inequalities, a method is proposed for determining all the domains in the parameter space having the property that an affine family of symmetric matrices has the same fixed number of like-sign eigenvalues inside each of the domains. The approa...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Polyak, B. T. [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2006 |
|---|
| Anmerkung: |
© Pleiades Publishing, Inc. 2006 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Automation and remote control - Nauka/Interperiodica, 1957, 67(2006), 11 vom: Nov., Seite 1847-1861 |
|---|---|
| Übergeordnetes Werk: |
volume:67 ; year:2006 ; number:11 ; month:11 ; pages:1847-1861 |
| Links: |
|---|
| DOI / URN: |
10.1134/S0005117906110063 |
|---|
| Katalog-ID: |
OLC2060891558 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2060891558 | ||
| 003 | DE-627 | ||
| 005 | 20230502214828.0 | ||
| 007 | tu | ||
| 008 | 200820s2006 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1134/S0005117906110063 |2 doi | |
| 035 | |a (DE-627)OLC2060891558 | ||
| 035 | |a (DE-He213)S0005117906110063-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 000 |a 620 |q VZ |
| 100 | 1 | |a Polyak, B. T. |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a The D-decomposition technique for linear matrix inequalities |
| 264 | 1 | |c 2006 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Pleiades Publishing, Inc. 2006 | ||
| 520 | |a Abstract In the framework of the theory of linear matrix inequalities, a method is proposed for determining all the domains in the parameter space having the property that an affine family of symmetric matrices has the same fixed number of like-sign eigenvalues inside each of the domains. The approach leans on the ideas of D-decomposition; it is particularly efficient in the problems involving few parameters. Generalizations of the method are considered along with its modifications to the presence of uncertainty. | ||
| 700 | 1 | |a Shcherbakov, P. S. |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Automation and remote control |d Nauka/Interperiodica, 1957 |g 67(2006), 11 vom: Nov., Seite 1847-1861 |w (DE-627)129603481 |w (DE-600)241725-X |w (DE-576)015097315 |x 0005-1179 |7 nnns |
| 773 | 1 | 8 | |g volume:67 |g year:2006 |g number:11 |g month:11 |g pages:1847-1861 |
| 856 | 4 | 1 | |u https://doi.org/10.1134/S0005117906110063 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-TEC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_4700 | ||
| 951 | |a AR | ||
| 952 | |d 67 |j 2006 |e 11 |c 11 |h 1847-1861 | ||
| author_variant |
b t p bt btp p s s ps pss |
|---|---|
| matchkey_str |
article:00051179:2006----::hdeopstotcnqeolnamt |
| hierarchy_sort_str |
2006 |
| publishDate |
2006 |
| allfields |
10.1134/S0005117906110063 doi (DE-627)OLC2060891558 (DE-He213)S0005117906110063-p DE-627 ger DE-627 rakwb eng 000 620 VZ Polyak, B. T. verfasserin aut The D-decomposition technique for linear matrix inequalities 2006 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Pleiades Publishing, Inc. 2006 Abstract In the framework of the theory of linear matrix inequalities, a method is proposed for determining all the domains in the parameter space having the property that an affine family of symmetric matrices has the same fixed number of like-sign eigenvalues inside each of the domains. The approach leans on the ideas of D-decomposition; it is particularly efficient in the problems involving few parameters. Generalizations of the method are considered along with its modifications to the presence of uncertainty. Shcherbakov, P. S. aut Enthalten in Automation and remote control Nauka/Interperiodica, 1957 67(2006), 11 vom: Nov., Seite 1847-1861 (DE-627)129603481 (DE-600)241725-X (DE-576)015097315 0005-1179 nnns volume:67 year:2006 number:11 month:11 pages:1847-1861 https://doi.org/10.1134/S0005117906110063 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_4700 AR 67 2006 11 11 1847-1861 |
| spelling |
10.1134/S0005117906110063 doi (DE-627)OLC2060891558 (DE-He213)S0005117906110063-p DE-627 ger DE-627 rakwb eng 000 620 VZ Polyak, B. T. verfasserin aut The D-decomposition technique for linear matrix inequalities 2006 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Pleiades Publishing, Inc. 2006 Abstract In the framework of the theory of linear matrix inequalities, a method is proposed for determining all the domains in the parameter space having the property that an affine family of symmetric matrices has the same fixed number of like-sign eigenvalues inside each of the domains. The approach leans on the ideas of D-decomposition; it is particularly efficient in the problems involving few parameters. Generalizations of the method are considered along with its modifications to the presence of uncertainty. Shcherbakov, P. S. aut Enthalten in Automation and remote control Nauka/Interperiodica, 1957 67(2006), 11 vom: Nov., Seite 1847-1861 (DE-627)129603481 (DE-600)241725-X (DE-576)015097315 0005-1179 nnns volume:67 year:2006 number:11 month:11 pages:1847-1861 https://doi.org/10.1134/S0005117906110063 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_4700 AR 67 2006 11 11 1847-1861 |
| allfields_unstemmed |
10.1134/S0005117906110063 doi (DE-627)OLC2060891558 (DE-He213)S0005117906110063-p DE-627 ger DE-627 rakwb eng 000 620 VZ Polyak, B. T. verfasserin aut The D-decomposition technique for linear matrix inequalities 2006 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Pleiades Publishing, Inc. 2006 Abstract In the framework of the theory of linear matrix inequalities, a method is proposed for determining all the domains in the parameter space having the property that an affine family of symmetric matrices has the same fixed number of like-sign eigenvalues inside each of the domains. The approach leans on the ideas of D-decomposition; it is particularly efficient in the problems involving few parameters. Generalizations of the method are considered along with its modifications to the presence of uncertainty. Shcherbakov, P. S. aut Enthalten in Automation and remote control Nauka/Interperiodica, 1957 67(2006), 11 vom: Nov., Seite 1847-1861 (DE-627)129603481 (DE-600)241725-X (DE-576)015097315 0005-1179 nnns volume:67 year:2006 number:11 month:11 pages:1847-1861 https://doi.org/10.1134/S0005117906110063 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_4700 AR 67 2006 11 11 1847-1861 |
| allfieldsGer |
10.1134/S0005117906110063 doi (DE-627)OLC2060891558 (DE-He213)S0005117906110063-p DE-627 ger DE-627 rakwb eng 000 620 VZ Polyak, B. T. verfasserin aut The D-decomposition technique for linear matrix inequalities 2006 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Pleiades Publishing, Inc. 2006 Abstract In the framework of the theory of linear matrix inequalities, a method is proposed for determining all the domains in the parameter space having the property that an affine family of symmetric matrices has the same fixed number of like-sign eigenvalues inside each of the domains. The approach leans on the ideas of D-decomposition; it is particularly efficient in the problems involving few parameters. Generalizations of the method are considered along with its modifications to the presence of uncertainty. Shcherbakov, P. S. aut Enthalten in Automation and remote control Nauka/Interperiodica, 1957 67(2006), 11 vom: Nov., Seite 1847-1861 (DE-627)129603481 (DE-600)241725-X (DE-576)015097315 0005-1179 nnns volume:67 year:2006 number:11 month:11 pages:1847-1861 https://doi.org/10.1134/S0005117906110063 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_4700 AR 67 2006 11 11 1847-1861 |
| allfieldsSound |
10.1134/S0005117906110063 doi (DE-627)OLC2060891558 (DE-He213)S0005117906110063-p DE-627 ger DE-627 rakwb eng 000 620 VZ Polyak, B. T. verfasserin aut The D-decomposition technique for linear matrix inequalities 2006 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Pleiades Publishing, Inc. 2006 Abstract In the framework of the theory of linear matrix inequalities, a method is proposed for determining all the domains in the parameter space having the property that an affine family of symmetric matrices has the same fixed number of like-sign eigenvalues inside each of the domains. The approach leans on the ideas of D-decomposition; it is particularly efficient in the problems involving few parameters. Generalizations of the method are considered along with its modifications to the presence of uncertainty. Shcherbakov, P. S. aut Enthalten in Automation and remote control Nauka/Interperiodica, 1957 67(2006), 11 vom: Nov., Seite 1847-1861 (DE-627)129603481 (DE-600)241725-X (DE-576)015097315 0005-1179 nnns volume:67 year:2006 number:11 month:11 pages:1847-1861 https://doi.org/10.1134/S0005117906110063 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_4700 AR 67 2006 11 11 1847-1861 |
| language |
English |
| source |
Enthalten in Automation and remote control 67(2006), 11 vom: Nov., Seite 1847-1861 volume:67 year:2006 number:11 month:11 pages:1847-1861 |
| sourceStr |
Enthalten in Automation and remote control 67(2006), 11 vom: Nov., Seite 1847-1861 volume:67 year:2006 number:11 month:11 pages:1847-1861 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| dewey-raw |
000 |
| isfreeaccess_bool |
false |
| container_title |
Automation and remote control |
| authorswithroles_txt_mv |
Polyak, B. T. @@aut@@ Shcherbakov, P. S. @@aut@@ |
| publishDateDaySort_date |
2006-11-01T00:00:00Z |
| hierarchy_top_id |
129603481 |
| dewey-sort |
0 |
| id |
OLC2060891558 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2060891558</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502214828.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2006 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1134/S0005117906110063</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2060891558</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)S0005117906110063-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">000</subfield><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Polyak, B. T.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The D-decomposition technique for linear matrix inequalities</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2006</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Pleiades Publishing, Inc. 2006</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract In the framework of the theory of linear matrix inequalities, a method is proposed for determining all the domains in the parameter space having the property that an affine family of symmetric matrices has the same fixed number of like-sign eigenvalues inside each of the domains. The approach leans on the ideas of D-decomposition; it is particularly efficient in the problems involving few parameters. Generalizations of the method are considered along with its modifications to the presence of uncertainty.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shcherbakov, P. S.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Automation and remote control</subfield><subfield code="d">Nauka/Interperiodica, 1957</subfield><subfield code="g">67(2006), 11 vom: Nov., Seite 1847-1861</subfield><subfield code="w">(DE-627)129603481</subfield><subfield code="w">(DE-600)241725-X</subfield><subfield code="w">(DE-576)015097315</subfield><subfield code="x">0005-1179</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:67</subfield><subfield code="g">year:2006</subfield><subfield code="g">number:11</subfield><subfield code="g">month:11</subfield><subfield code="g">pages:1847-1861</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1134/S0005117906110063</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">67</subfield><subfield code="j">2006</subfield><subfield code="e">11</subfield><subfield code="c">11</subfield><subfield code="h">1847-1861</subfield></datafield></record></collection>
|
| author |
Polyak, B. T. |
| spellingShingle |
Polyak, B. T. ddc 000 The D-decomposition technique for linear matrix inequalities |
| authorStr |
Polyak, B. T. |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)129603481 |
| format |
Article |
| dewey-ones |
000 - Computer science, information & general works 620 - Engineering & allied operations |
| delete_txt_mv |
keep |
| author_role |
aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0005-1179 |
| topic_title |
000 620 VZ The D-decomposition technique for linear matrix inequalities |
| topic |
ddc 000 |
| topic_unstemmed |
ddc 000 |
| topic_browse |
ddc 000 |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Automation and remote control |
| hierarchy_parent_id |
129603481 |
| dewey-tens |
000 - Computer science, knowledge & systems 620 - Engineering |
| hierarchy_top_title |
Automation and remote control |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)129603481 (DE-600)241725-X (DE-576)015097315 |
| title |
The D-decomposition technique for linear matrix inequalities |
| ctrlnum |
(DE-627)OLC2060891558 (DE-He213)S0005117906110063-p |
| title_full |
The D-decomposition technique for linear matrix inequalities |
| author_sort |
Polyak, B. T. |
| journal |
Automation and remote control |
| journalStr |
Automation and remote control |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works 600 - Technology |
| recordtype |
marc |
| publishDateSort |
2006 |
| contenttype_str_mv |
txt |
| container_start_page |
1847 |
| author_browse |
Polyak, B. T. Shcherbakov, P. S. |
| container_volume |
67 |
| class |
000 620 VZ |
| format_se |
Aufsätze |
| author-letter |
Polyak, B. T. |
| doi_str_mv |
10.1134/S0005117906110063 |
| dewey-full |
000 620 |
| title_sort |
the d-decomposition technique for linear matrix inequalities |
| title_auth |
The D-decomposition technique for linear matrix inequalities |
| abstract |
Abstract In the framework of the theory of linear matrix inequalities, a method is proposed for determining all the domains in the parameter space having the property that an affine family of symmetric matrices has the same fixed number of like-sign eigenvalues inside each of the domains. The approach leans on the ideas of D-decomposition; it is particularly efficient in the problems involving few parameters. Generalizations of the method are considered along with its modifications to the presence of uncertainty. © Pleiades Publishing, Inc. 2006 |
| abstractGer |
Abstract In the framework of the theory of linear matrix inequalities, a method is proposed for determining all the domains in the parameter space having the property that an affine family of symmetric matrices has the same fixed number of like-sign eigenvalues inside each of the domains. The approach leans on the ideas of D-decomposition; it is particularly efficient in the problems involving few parameters. Generalizations of the method are considered along with its modifications to the presence of uncertainty. © Pleiades Publishing, Inc. 2006 |
| abstract_unstemmed |
Abstract In the framework of the theory of linear matrix inequalities, a method is proposed for determining all the domains in the parameter space having the property that an affine family of symmetric matrices has the same fixed number of like-sign eigenvalues inside each of the domains. The approach leans on the ideas of D-decomposition; it is particularly efficient in the problems involving few parameters. Generalizations of the method are considered along with its modifications to the presence of uncertainty. © Pleiades Publishing, Inc. 2006 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_4700 |
| container_issue |
11 |
| title_short |
The D-decomposition technique for linear matrix inequalities |
| url |
https://doi.org/10.1134/S0005117906110063 |
| remote_bool |
false |
| author2 |
Shcherbakov, P. S. |
| author2Str |
Shcherbakov, P. S. |
| ppnlink |
129603481 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1134/S0005117906110063 |
| up_date |
2024-07-04T02:23:43.033Z |
| _version_ |
1803613448996651008 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2060891558</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502214828.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2006 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1134/S0005117906110063</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2060891558</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)S0005117906110063-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">000</subfield><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Polyak, B. T.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The D-decomposition technique for linear matrix inequalities</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2006</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Pleiades Publishing, Inc. 2006</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract In the framework of the theory of linear matrix inequalities, a method is proposed for determining all the domains in the parameter space having the property that an affine family of symmetric matrices has the same fixed number of like-sign eigenvalues inside each of the domains. The approach leans on the ideas of D-decomposition; it is particularly efficient in the problems involving few parameters. Generalizations of the method are considered along with its modifications to the presence of uncertainty.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shcherbakov, P. S.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Automation and remote control</subfield><subfield code="d">Nauka/Interperiodica, 1957</subfield><subfield code="g">67(2006), 11 vom: Nov., Seite 1847-1861</subfield><subfield code="w">(DE-627)129603481</subfield><subfield code="w">(DE-600)241725-X</subfield><subfield code="w">(DE-576)015097315</subfield><subfield code="x">0005-1179</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:67</subfield><subfield code="g">year:2006</subfield><subfield code="g">number:11</subfield><subfield code="g">month:11</subfield><subfield code="g">pages:1847-1861</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1134/S0005117906110063</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">67</subfield><subfield code="j">2006</subfield><subfield code="e">11</subfield><subfield code="c">11</subfield><subfield code="h">1847-1861</subfield></datafield></record></collection>
|
| score |
7.400098 |