Sequential Detection of Transient Changes

This article addresses the transient change detection problem. It is assumed that a change occurs at an unknown (but nonrandom) change-point and the duration of post-change period is finite and known. A latent detection-that is, a detection that occurs after signal disappearance-is considered as a m...

Full description

Saved in:
Bibliographic Details
Published inSequential analysis Vol. 31; no. 4; pp. 528 - 547
Main Authors Guépié, Blaise Kévin, Fillatre, Lionel, Nikiforov, Igor
Format Journal Article
LanguageEnglish
Published Philadelphia Taylor & Francis Group 01.10.2012
Taylor & Francis Ltd
Taylor & Francis
Subjects
Online AccessGet full text

Cover

Loading…
Abstract This article addresses the transient change detection problem. It is assumed that a change occurs at an unknown (but nonrandom) change-point and the duration of post-change period is finite and known. A latent detection-that is, a detection that occurs after signal disappearance-is considered as a missed detection. A new optimality criterion adapted to the detection of transient changes involves the minimization of the worst-case probability of missed detection under constraint on the false alarm rate for a given period. A suboptimal sequential transient change detection algorithm is proposed. It is based on a window-limited cumulative sum (CUSUM) test. An upper bound for the worst-case probability of missed detection and a lower and an upper bound for the false alarm rate are proposed. Based on these bounds, the window-limited CUSUM test is optimized with respect to the proposed criterion. The developed algorithm and theoretical findings are applied to drinking water distribution network monitoring.
AbstractList This article addresses the transient change detection problem. It is assumed that a change occurs at an unknown (but nonrandom) change-point and the duration of post-change period is finite and known. A latent detection-that is, a detection that occurs after signal disappearance-is considered as a missed detection. A new optimality criterion adapted to the detection of transient changes involves the minimization of the worst-case probability of missed detection under constraint on the false alarm rate for a given period. A suboptimal sequential transient change detection algorithm is proposed. It is based on a window-limited cumulative sum (CUSUM) test. An upper bound for the worst-case probability of missed detection and a lower and an upper bound for the false alarm rate are proposed. Based on these bounds, the window-limited CUSUM test is optimized with respect to the proposed criterion. The developed algorithm and theoretical findings are applied to drinking water distribution network monitoring.
This article addresses the transient change detection problem. It is assumed that a change occurs at an unknown (but nonrandom) change-point and the duration of post-change period is finite and known. A latent detection -- that is, a detection that occurs after signal disappearance -- is considered as a missed detection. A new optimality criterion adapted to the detection of transient changes involves the minimization of the worst-case probability of missed detection under constraint on the false alarm rate for a given period. A suboptimal sequential transient change detection algorithm is proposed. It is based on a window-limited cumulative sum (CUSUM) test. An upper bound for the worstcase probability of missed detection and a lower and an upper bound for the false alarm rate are proposed. Based on these bounds, the window-limited CUSUM test is optimized with respect to the proposed criterion. The developed algorithm and theoretical findings are applied to drinking water distribution network monitoring.
Author Nikiforov, Igor
Fillatre, Lionel
Guépié, Blaise Kévin
Author_xml – sequence: 1
  givenname: Blaise Kévin
  surname: Guépié
  fullname: Guépié, Blaise Kévin
  organization: Institut Charles Delaunay, LM2S , Université de technologie de Troyes, UMR STMR-CNRS
– sequence: 2
  givenname: Lionel
  surname: Fillatre
  fullname: Fillatre, Lionel
  organization: Institut Charles Delaunay, LM2S , Université de technologie de Troyes, UMR STMR-CNRS
– sequence: 3
  givenname: Igor
  surname: Nikiforov
  fullname: Nikiforov, Igor
  email: nikiforov@utt.fr
  organization: Institut Charles Delaunay, LM2S , Université de technologie de Troyes, UMR STMR-CNRS
BackLink https://hal.science/hal-01303042$$DView record in HAL
BookMark eNqFkT1PHDEQhq0IJI6Pf5DiJBoo9uLxx3pNE6EjfEgnUQC1NevzBqM9m9h7IP59vNqQggIaW_I872jm8T7ZCTE4Qr4DXQBt6A-qhBJa1AtGgS0UaCH4NzIDyVklQNU7ZDYi1cjskf2cnyiFBqiakdM792frwuCxn1-4wdnBxzCP3fw-Yci-VObLRwy_XT4kux322R39uw_Iw-Wv--V1tbq9ulmeryrLORsq2dq60cq1bdNoCY3CrowjtXWIbcfbNVitOmVbLZFroSkKqqy1a1ZOwSw_IKdT30fszXPyG0xvJqI31-crM75R4JRTwV6gsCcT-5xiWSMPZuOzdX2PwcVtNiAlUAmKNQU9_oA-xW0KZRMDtZJaq5qJQomJsinmnFz3fwKgZnRt3l2b0bWZXJfY2YeY9QOOKoeEvv8q_HMK-9DFtMHXmPq1GfCtj6krv2B9NvzTDn8BvxGWfw
CitedBy_id crossref_primary_10_1002_nav_22034
crossref_primary_10_1016_j_ifacol_2022_07_155
crossref_primary_10_1080_07474946_2023_2171056
crossref_primary_10_1109_TSP_2017_2788416
crossref_primary_10_1080_07474946_2014_916927
crossref_primary_10_3390_e21030219
crossref_primary_10_1109_TSP_2022_3231521
crossref_primary_10_1080_02664763_2023_2174257
crossref_primary_10_1109_TSP_2019_2939080
crossref_primary_10_1016_j_nucengdes_2020_110733
crossref_primary_10_1109_TIT_2017_2679057
crossref_primary_10_1016_j_anucene_2020_107357
crossref_primary_10_1109_TIT_2021_3104601
crossref_primary_10_1109_ACCESS_2018_2792838
crossref_primary_10_1016_j_ifacol_2022_07_640
crossref_primary_10_1109_JSAIT_2021_3072962
crossref_primary_10_1016_j_ifacol_2015_09_616
crossref_primary_10_1109_TIT_2018_2877972
crossref_primary_10_1080_07474946_2023_2211126
crossref_primary_10_1080_03610926_2023_2220922
crossref_primary_10_1016_j_dsp_2018_02_012
crossref_primary_10_1109_TSP_2021_3071016
crossref_primary_10_1109_MAES_2017_160047
crossref_primary_10_1109_TIFS_2019_2899247
crossref_primary_10_1109_TSP_2022_3158008
crossref_primary_10_1016_j_jfranklin_2024_107199
Cites_doi 10.1007/978-1-4899-0142-2
10.1023/A:1020313202331
10.1109/CDC.2005.1582175
10.1214/aos/1176346587
10.1109/18.119748
10.2307/2333009
10.1080/07474941003740997
10.1137/S0040585X97981202
10.1214/aoms/1177729489
10.1109/78.774747
10.1109/10.212067
10.1080/07474940600609597
10.1109/29.21680
10.1109/78.960393
10.21236/ADA309568
10.1007/978-1-4757-3863-6
10.1214/aos/1176347761
10.1109/18.259642
10.1109/TSP.2005.857060
10.1109/7.892673
10.1214/aos/1176342619
10.1109/18.737522
10.1109/18.661537
10.21236/ADA230068
10.1137/1108002
10.1214/aos/1176350164
10.1214/aoms/1177693055
10.1134/S0032946009020070
10.1109/78.863080
10.1109/9.763211
10.1109/18.119729
10.1111/j.2517-6161.1995.tb02052.x
10.1080/07474940802446046
10.1023/A:1010447726739
10.1109/78.611202
10.1109/78.771032
10.1002/1099-1115(200011)14:7<683::AID-ACS616>3.0.CO;2-Z
10.1109/TIT.1986.1057160
ContentType Journal Article
Copyright Copyright Taylor & Francis Group, LLC 2012
Copyright Taylor & Francis Ltd. 2012
Distributed under a Creative Commons Attribution 4.0 International License
Copyright_xml – notice: Copyright Taylor & Francis Group, LLC 2012
– notice: Copyright Taylor & Francis Ltd. 2012
– notice: Distributed under a Creative Commons Attribution 4.0 International License
DBID AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
1XC
DOI 10.1080/07474946.2012.719443
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
Hyper Article en Ligne (HAL)
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts
Computer and Information Systems Abstracts

DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Computer Science
EISSN 1532-4176
EndPage 547
ExternalDocumentID oai_HAL_hal_01303042v1
3666840571
10_1080_07474946_2012_719443
719443
Genre Feature
GroupedDBID .7F
.QJ
0BK
0R~
123
30N
4.4
5VS
AAENE
AAJMT
AALDU
AAMIU
AAPUL
AAQRR
ABCCY
ABFIM
ABHAV
ABJNI
ABLIJ
ABPAQ
ABPEM
ABTAI
ABXUL
ABXYU
ACGEJ
ACGFS
ACIWK
ACTIO
ADCVX
ADGTB
ADXPE
ADYSH
AEISY
AEOZL
AEPSL
AEYOC
AFKVX
AFRVT
AGDLA
AGMYJ
AIJEM
AIYEW
AJWEG
AKBVH
AKOOK
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AMPGV
AQRUH
AVBZW
AWYRJ
BLEHA
CCCUG
CE4
CS3
DGEBU
DKSSO
EBS
EJD
E~A
E~B
F5P
GTTXZ
H13
HF~
HZ~
H~P
IPNFZ
J.P
KYCEM
M4Z
NA5
NY~
O9-
P2P
PQQKQ
RIG
RNANH
ROSJB
RTWRZ
S-T
SNACF
TBQAZ
TEJ
TFL
TFT
TFW
TN5
TTHFI
TUROJ
TWF
UT5
UU3
ZGOLN
~S~
07G
1TA
AAGDL
AAHIA
AAIKQ
AAKBW
AAYXX
ACAGQ
ACGEE
AEUMN
AFFNX
AGCQS
AGLEN
AGROQ
AHMOU
ALCKM
AMEWO
AMVHM
AMXXU
BCCOT
BPLKW
C06
CAG
CITATION
COF
CRFIH
DMQIW
DWIFK
IVXBP
LJTGL
NUSFT
QCRFL
TAQ
TFMCV
TOXWX
UB9
UU8
V3K
V4Q
XOL
7SC
8FD
JQ2
L7M
L~C
L~D
TASJS
1XC
ACTCW
ID FETCH-LOGICAL-c332t-5bc6897ebb8895187af94459ceaabf3bd1c97f7cb95a39490a407cccd27cc42c3
ISSN 0747-4946
IngestDate Sun Aug 24 06:10:44 EDT 2025
Fri Jul 11 00:07:52 EDT 2025
Wed Aug 13 10:05:39 EDT 2025
Tue Jul 01 03:56:56 EDT 2025
Thu Apr 24 23:03:51 EDT 2025
Tue May 20 10:47:44 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 4
Language English
License Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c332t-5bc6897ebb8895187af94459ceaabf3bd1c97f7cb95a39490a407cccd27cc42c3
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ORCID 0000-0002-0241-7315
0000-0001-7051-9308
0000-0002-8152-1769
PQID 1675997624
PQPubID 216170
PageCount 20
ParticipantIDs informaworld_taylorfrancis_310_1080_07474946_2012_719443
crossref_primary_10_1080_07474946_2012_719443
hal_primary_oai_HAL_hal_01303042v1
proquest_miscellaneous_1551051728
proquest_journals_1675997624
crossref_citationtrail_10_1080_07474946_2012_719443
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 20121001
PublicationDateYYYYMMDD 2012-10-01
PublicationDate_xml – month: 10
  year: 2012
  text: 20121001
  day: 01
PublicationDecade 2010
PublicationPlace Philadelphia
PublicationPlace_xml – name: Philadelphia
PublicationTitle Sequential analysis
PublicationYear 2012
Publisher Taylor & Francis Group
Taylor & Francis Ltd
Taylor & Francis
Publisher_xml – name: Taylor & Francis Group
– name: Taylor & Francis Ltd
– name: Taylor & Francis
References CIT0010
CIT0032
Basseville M. (CIT0004) 1993
CIT0031
CIT0012
CIT0034
Castro P. (CIT0008) 2003; 2
CIT0011
CIT0014
CIT0036
CIT0013
Repin V. G. (CIT0030) 1991; 27
CIT0035
CIT0016
CIT0015
CIT0018
CIT0039
Tartakovsky A. G. (CIT0037) 1987; 23
CIT0041
CIT0040
CIT0021
CIT0043
CIT0020
CIT0042
CIT0001
CIT0023
CIT0045
CIT0022
CIT0044
Tartakovsky A. G. (CIT0038) 1988; 24
Lai T. L. (CIT0017) 1995; 57
Shiryaev A. N. (CIT0033) 1961; 138
CIT0003
CIT0025
CIT0047
CIT0002
CIT0024
CIT0046
CIT0005
Lai T. L. (CIT0019) 2001; 11
CIT0027
CIT0026
CIT0048
CIT0007
CIT0029
CIT0006
Poor H. V. (CIT0028) 2009
CIT0009
References_xml – ident: CIT0032
  doi: 10.1007/978-1-4899-0142-2
– volume-title: Quickest Detection
  year: 2009
  ident: CIT0028
– volume-title: Detection of Abrupt Changes: Theory and Application
  year: 1993
  ident: CIT0004
– ident: CIT0045
  doi: 10.1023/A:1020313202331
– ident: CIT0039
  doi: 10.1109/CDC.2005.1582175
– ident: CIT0026
  doi: 10.1214/aos/1176346587
– ident: CIT0012
  doi: 10.1109/18.119748
– ident: CIT0025
  doi: 10.2307/2333009
– volume: 23
  start-page: 203
  year: 1987
  ident: CIT0037
  publication-title: Problems of Information Transmission
– ident: CIT0041
  doi: 10.1080/07474941003740997
– ident: CIT0042
  doi: 10.1137/S0040585X97981202
– ident: CIT0013
  doi: 10.1214/aoms/1177729489
– ident: CIT0014
  doi: 10.1109/78.774747
– ident: CIT0006
  doi: 10.1109/10.212067
– ident: CIT0029
– ident: CIT0003
  doi: 10.1080/07474940600609597
– ident: CIT0023
– volume: 138
  start-page: 799
  year: 1961
  ident: CIT0033
  publication-title: Soviet Mathematics-Doklady 2: 740–743. Translation from Doklady Akademii Nauk SSSR
– ident: CIT0010
  doi: 10.1109/29.21680
– ident: CIT0047
  doi: 10.1109/78.960393
– ident: CIT0024
  doi: 10.21236/ADA309568
– ident: CIT0027
  doi: 10.1007/978-1-4757-3863-6
– ident: CIT0031
  doi: 10.1214/aos/1176347761
– ident: CIT0005
  doi: 10.1109/18.259642
– ident: CIT0048
  doi: 10.1109/TSP.2005.857060
– volume: 11
  start-page: 303
  year: 2001
  ident: CIT0019
  publication-title: Statistica Sinica
– ident: CIT0009
  doi: 10.1109/7.892673
– ident: CIT0016
  doi: 10.1214/aos/1176342619
– ident: CIT0018
  doi: 10.1109/18.737522
– ident: CIT0015
  doi: 10.1109/18.661537
– ident: CIT0007
  doi: 10.21236/ADA230068
– ident: CIT0034
  doi: 10.1137/1108002
– ident: CIT0022
  doi: 10.1214/aos/1176350164
– ident: CIT0021
  doi: 10.1214/aoms/1177693055
– ident: CIT0044
  doi: 10.1134/S0032946009020070
– ident: CIT0046
  doi: 10.1109/78.863080
– ident: CIT0020
  doi: 10.1109/9.763211
– ident: CIT0011
  doi: 10.1109/18.119729
– volume: 24
  start-page: 39
  year: 1988
  ident: CIT0038
  publication-title: Problems of Information Transmission
– volume: 57
  start-page: 613
  year: 1995
  ident: CIT0017
  publication-title: Journal of Royal Statistical Society, Series B
  doi: 10.1111/j.2517-6161.1995.tb02052.x
– ident: CIT0040
  doi: 10.1080/07474940802446046
– ident: CIT0043
  doi: 10.1023/A:1010447726739
– volume: 2
  start-page: 261
  year: 2003
  ident: CIT0008
  publication-title: Electronic Journal of Environmental, Agricultural and Food Chemistry
– ident: CIT0035
  doi: 10.1109/78.611202
– ident: CIT0036
  doi: 10.1109/78.771032
– ident: CIT0001
  doi: 10.1002/1099-1115(200011)14:7<683::AID-ACS616>3.0.CO;2-Z
– ident: CIT0002
  doi: 10.1109/TIT.1986.1057160
– volume: 27
  start-page: 61
  year: 1991
  ident: CIT0030
  publication-title: Problems of Information Transmission
SSID ssj0018107
Score 2.1078038
Snippet This article addresses the transient change detection problem. It is assumed that a change occurs at an unknown (but nonrandom) change-point and the duration...
SourceID hal
proquest
crossref
informaworld
SourceType Open Access Repository
Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 528
SubjectTerms Algorithms
Change detection
Computer Science
Criteria
Decision theory
Detection algorithms
Drinking water
Environmental monitoring
Failure detection
False alarms
Mathematical analysis
Monitoring
Optimization
Probability
Signal and Image Processing
Signal detection
Signaling
Statistical analysis
Transient signals
Upper bounds
Water pollution
Title Sequential Detection of Transient Changes
URI https://www.tandfonline.com/doi/abs/10.1080/07474946.2012.719443
https://www.proquest.com/docview/1675997624
https://www.proquest.com/docview/1551051728
https://hal.science/hal-01303042
Volume 31
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LbxMxELagXOCAeIpAQQvigpCr2Pv0sYJGEaThwEbqzVo7No2okqrZ5MCvZ8b2uhulKo-LE3m91q7n2_HMeB6EvGe61HOjSzo01tBs3uRUADSosCAf5BnjhcDg5NNpMZ5lX87y3kG7iy5p1ZH-dWNcyf9QFfqArhgl-w-UjZNCB_wH-kILFIb2r2j83flBt2j0_mxaozvpz21AGOgYggfWfRG0d1MTMpJEJ5yNPze_XPhfR_wLPFz6-NX3bBcRTCOsV9R6E_YE8x1FX43p4ifGe622jgH9WF31TQuMRyc1D4Z6r8pHz9Vo7XJdlzQTwYRoOgbKacZ8TZeOwwY-v-ibDxy7zH1g-B4bD36PMD9Ojw54_KhkIvMZnXazZk-_ydFsMpH1yVm9e9Xv0qCfVSiVgop8j4MugWUu0uE0HjVVzMfUdy_TxVdiAvYbHmBHfrl77rxn-zlu9_Z0J6jUj8jDoGEkxx4uj8kds3xCHpzG9Lzrp-TDNQaSCJxkZZMInCQA5xmZjU7qT2MaamZQnaa8pbnSRSVKo1RVgfBclY2Fp86FNk2jbKrmTIvSllqJvElFJoYNaPRa6zmHNuM6fU4OlgCZFyTRvNDacpvaEq0AuQDuzpSeo0jIq0INSNqthNQhoTzWNbmQrMs7G9ZP4vpJv34DQuNdlz6hyh_Gv4NFjkMxG_r4eCKxDw_d0Rq3ZQNS9WkgW4dc60Er09vnP-zoJcOnvZYM1GgBgjrPBuRtvAyMF0_TmqVZbWBMjroJlnd7efsUr8j964_rkBy0VxvzGiTZVr1xSPwNBpOSGA
linkProvider Taylor & Francis
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwEB7RcoAeeKMubSEgLhy8XdtxHB8rSrXA7l5oJW5WPLGFRJVFbJYDvx5PnEQtCJDgkkP8kl_jGfubbwBectRYe9Rs5oNneV0pZuLSYCZE_UDlXBSGnJOXq2J-kb_7qAY04aaHVZINHRJRRCeraXPTZfQAiTsm0vfc5IQw4GKqox2eyx24qUyhKYiBnK3Gh4SSJ4_pWIJRkcF77je1XDuddj512MirDKa_SOzuGDq7C27oQEKffJ5uWzfF7z9xO_5XD-_BnV5JzU7SqroPN3zzAPaWI8Pr5iG8-tBhsKN8uMxOfdsBuppsHbLu8CMnyyw5LmwewcXZm_PXc9aHXWAopWiZcliURnvnyjLqX6WuQmxeGfRV5YJ0NUejg0ZnVCVNbmZVNAoRsRbxmwuUj2G3WTd-HzIUBWIQQQZNhqQyUUBwhzVpFaIs3ATkMNwWe05yCo1xaflAXdoPhKWBsGkgJsDGUl8SJ8df8r-IMzlmJULt-cnC0j96t6ULnW98AuXVibZtd2ESUnQTK_9c_-GwKGwvATaWR0vMRF1P5BN4PibHvUsPMlXj19uYR5F6SxHCnvx768_g1vx8ubCLt6v3B3CbUhLY8BB2269bfxSVptY97bbFD5WWBZ8
linkToPdf http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwEB61RUJwoLwqlhZIUS8cvKwfefhYUVZbaFeVoFJvVjyxhdRVtmKzHPj1eOIkWkAUCS45xK9k7BnP2DPfABxxzLFymLOJ846pqkyZDkuDaR_0g1RxkWkKTj6fZ7NL9eEqvdqI4ie3SrKhfQSKaGU1MfdN5XuPuLeE-a60IgcDLsZ5MMOV3IY7GWGHUxDHZD7cIxQ8BkyHFoya9MFzf-jlp81p-0vrGrkJYPqbwG53oekulP33R-eT6_G6sWP8_gu04__84EN40KmoyXFcU49gy9WP4f75gO-6egJvPrUe2EE6LJIT17TuXHWy9Em79VGIZRLDFlZP4XL6_vO7GeuSLjCUUjQstZgVOnfWFkXQvoq89GH4VKMrS-ulrTjq3OdodVpKrfSkDCYhIlYiPJVAuQc79bJ2zyBBkSF64aXPyYxMdRAP3GJFOoUoMjsC2VPbYIdITokxFob3wKUdIQwRwkRCjIANrW4iIsdf6r8OEzlUJTjt2fGZoXd0a0vHOd_4CIrNeTZNe1ziY24TI2_v_6BfE6bj_5XhwQ7TQdMTagSHQ3HgXLqOKWu3XIc6KSm3lB_s-b-P_gruXpxMzdnp_OM-3KOC6Gl4ADvN17V7ETSmxr5smeIHRwkEQw
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Sequential+Detection+of+Transient+Changes&rft.jtitle=Sequential+analysis&rft.au=Gu%C3%A9pi%C3%A9%2C+Blaise+K%C3%A9vin&rft.au=Fillatre%2C+Lionel&rft.au=Nikiforov%2C+Igor&rft.date=2012-10-01&rft.pub=Taylor+%26+Francis+Ltd&rft.issn=0747-4946&rft.eissn=1532-4176&rft.volume=31&rft.issue=4&rft.spage=528&rft_id=info:doi/10.1080%2F07474946.2012.719443&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=3666840571
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0747-4946&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0747-4946&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0747-4946&client=summon