Cost-Efficient Mixed-Level Covering Designs for Testing Experiments

A covering design is a traditional class of experimental plans for hardware and software testing purposes. This paper presents a class of size-optimal covering designs for testing experiments with mixed-level factors. Among all the factors of different levels, one or two factors have a high number o...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of statistical theory and practice Ročník 14; číslo 1
Hlavní autoři: Akhtar, Yasmeen, Phoa, Frederick Kin Hing
Médium: Journal Article
Jazyk:angličtina
Vydáno: Cham Springer International Publishing 01.03.2020
Témata:
Algorithms
Analysis and Advanced Methodologies in the Design of Experiments
Mathematics and Statistics
Original Article
Probability Theory and Stochastic Processes
Statistical Theory and Methods
Statistics
Covering designs
Mixed covering array on hypergraph
Near-continuous factors
62K15
Hyperedge coloring
ISSN:1559-8608, 1559-8616
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract A covering design is a traditional class of experimental plans for hardware and software testing purposes. This paper presents a class of size-optimal covering designs for testing experiments with mixed-level factors. Among all the factors of different levels, one or two factors have a high number of levels while other factors form a full factorial so that all level combinations among factor pairs are “covered” at least once and appeared almost equally frequent. We use the coloring techniques for hypergraphs to construct such near-balanced mixed-level covering designs with the minimum run size.
AbstractList A covering design is a traditional class of experimental plans for hardware and software testing purposes. This paper presents a class of size-optimal covering designs for testing experiments with mixed-level factors. Among all the factors of different levels, one or two factors have a high number of levels while other factors form a full factorial so that all level combinations among factor pairs are “covered” at least once and appeared almost equally frequent. We use the coloring techniques for hypergraphs to construct such near-balanced mixed-level covering designs with the minimum run size.
ArticleNumber 6
Author Phoa, Frederick Kin Hing
Akhtar, Yasmeen
Author_xml – sequence: 1
  givenname: Yasmeen
  surname: Akhtar
  fullname: Akhtar, Yasmeen
  organization: School of Computing, Informatics and Decision Systems Engineering, Arizona State University
– sequence: 2
  givenname: Frederick Kin Hing
  surname: Phoa
  fullname: Phoa, Frederick Kin Hing
  email: fredphoa@stat.sinica.edu.tw
  organization: Institute of Statistical Science, Academia Sinica
BookMark eNp9kMFOAyEQhompiW31AbztC6DALstyNOtqTWq89E4oHRqaCg1gU99eNjUePPTwZyYz801m_hma-OABoXtKHigh4jE1jFOJySjSMiyu0JRyLnHX0nbyl5PuBs1S2pUZSup6ivo-pIwHa51x4HP17k6wwUs4wr7qwxGi89vqGZLb-lTZEKsVpDzWhtOhND8Lk27RtdX7BHe_cY5WL8OqX-Dlx-tb_7TEhnVdxlKCbiSlwDlvmqYF2lpZa7HeaKFb2gjD5VpLu7aMCCaB1oYAEM2MNjWX9RzR81oTQ0oRrDqUA3T8VpSo0QR1NkGRUcUEJQoj_jHGZZ1d8Dlqt79IsjOZDqMHENUufEVf_rsA_QDxSnLv
CitedBy_id crossref_primary_10_1007_s00373_024_02813_5
Cites_doi 10.1109/32.605761
10.1002/jcd.10059
10.1214/16-AOS1531
10.1016/j.dam.2017.08.023
10.1016/0095-8956(79)90002-9
10.1198/004017002188618554
10.1017/S0963548300001905
10.1002/qre.1857
10.1002/stvr.393
10.1080/00401706.1992.10484952
10.1002/jcd.20149
10.1214/14-AOS1205
10.1080/00224065.2013.11917916
10.1080/00401706.1998.10485524
10.1016/j.jctb.2005.03.005
10.1109/ICSE.2003.1201186
ContentType Journal Article
Copyright Grace Scientific Publishing 2019
Copyright_xml – notice: Grace Scientific Publishing 2019
DBID AAYXX
CITATION
DOI 10.1007/s42519-019-0062-7
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Statistics
Mathematics
EISSN 1559-8616
ExternalDocumentID 10_1007_s42519_019_0062_7
GrantInformation_xml – fundername: Academia Sinica
  grantid: 103-CDA-M04
  funderid: http://dx.doi.org/10.13039/501100001869
– fundername: Ministry of Science and Technology, Taiwan
  grantid: 107-2118-M-001-011-MY3; 107-2321-B-001-038
  funderid: http://dx.doi.org/10.13039/501100004663
– fundername: Ministry of Science and Technology, Taiwan
  grantid: 108-2321-B-001-016
  funderid: http://dx.doi.org/10.13039/501100004663
GroupedDBID -EM
.7F
0R~
4.4
406
8UJ
AACDK
AAHNG
AAJBT
AASML
AATNV
AAUYE
ABAKF
ABECU
ABFIM
ABFTV
ABJNI
ABKCH
ABMQK
ABPEM
ABTAI
ABTEG
ABTKH
ABTMW
ABXPI
ACAOD
ACDTI
ACGFS
ACHSB
ACMLO
ACOKC
ACPIV
ACTIO
ACZOJ
ADCVX
ADKNI
ADTPH
ADURQ
ADYFF
AEFQL
AEJRE
AEMSY
AESKC
AFBBN
AFQWF
AGDGC
AGJBK
AGMZJ
AGQEE
AIGIU
AIJEM
AILAN
AITGF
AJZVZ
ALMA_UNASSIGNED_HOLDINGS
AMKLP
AMXSW
AMYLF
AQRUH
AVBZW
AXYYD
BGNMA
CCCUG
CSCUP
DKSSO
DPUIP
EBLON
EBS
EJD
E~A
E~B
F5P
FIGPU
FINBP
FNLPD
FSGXE
GGCAI
GTTXZ
H13
HZ~
H~P
IKXTQ
IWAJR
J9A
JZLTJ
J~4
KOV
LLZTM
M4Y
M4Z
NPVJJ
NQJWS
NU0
O9-
P2P
PT4
ROL
RSV
S-T
SJN
SJYHP
SNE
SNPRN
SOHCF
SOJ
SRMVM
SSLCW
STPWE
TDBHL
TFL
TFT
TFW
TSG
UOJIU
UT5
UTJUX
UU3
VEKWB
VFIZW
ZMTXR
AAYXX
ABBRH
ABDBE
ABFSG
ABRTQ
ACSTC
AEZWR
AFDZB
AFFHD
AFHIU
AFKRA
AFOHR
AHPBZ
AHWEU
AIXLP
ATHPR
AYFIA
AZQEC
BENPR
CCPQU
CITATION
DWQXO
GNUQQ
GUQSH
HCIFZ
M2O
M2P
PHGZM
PHGZT
ID FETCH-LOGICAL-c288t-99ea4911e5554446e16f93a7bda7a6147c59ba9fbf20729e13c0ee0a2cac3593
IEDL.DBID RSV
ISICitedReferencesCount 2
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000511595300001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1559-8608
IngestDate Tue Nov 18 22:43:41 EST 2025
Sat Nov 29 01:41:36 EST 2025
Fri Feb 21 02:31:16 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 1
Keywords Covering designs
Mixed covering array on hypergraph
Near-continuous factors
62K15
Hyperedge coloring
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c288t-99ea4911e5554446e16f93a7bda7a6147c59ba9fbf20729e13c0ee0a2cac3593
ParticipantIDs crossref_primary_10_1007_s42519_019_0062_7
crossref_citationtrail_10_1007_s42519_019_0062_7
springer_journals_10_1007_s42519_019_0062_7
PublicationCentury 2000
PublicationDate 20200300
PublicationDateYYYYMMDD 2020-03-01
PublicationDate_xml – month: 3
  year: 2020
  text: 20200300
PublicationDecade 2020
PublicationPlace Cham
PublicationPlace_xml – name: Cham
PublicationTitle Journal of statistical theory and practice
PublicationTitleAbbrev J Stat Theory Pract
PublicationYear 2020
Publisher Springer International Publishing
Publisher_xml – name: Springer International Publishing
References Baranyai (CR5) 1979; 26
Lin, Phoa, Kao (CR18) 2017; 45
CR19
Berge (CR6) 1989
CR15
Dalal, Mallows (CR10) 1998; 40
Li, Nachtsheim, Wang, Reul, Albrecht (CR17) 2013; 45
Akhtar, Maity (CR1) 2017; 232
Moura, Stardom, Stevens, Williams (CR21) 2003; 11
Bryce, Colbourn (CR7) 2009; 19
Meagher, Moura, Zekaoui (CR20) 2007; 15
Xu (CR26) 2003; 13
Hedayat, Sloane, Stufken (CR13) 1999
CR2
CR4
Cohen, Dalal, Fredman, Patton (CR8) 1997; 23
Xu (CR25) 2002; 44
CR3
Kim, Jang, Anderson-Cook (CR14) 2016; 32
CR9
Kuhn, Kacker, Lei (CR16) 2013
CR22
Gromping, Xu (CR12) 2014; 42
Wang, Wu (CR23) 1992; 34
Wu, Hamada (CR24) 2009
Godbole, Skipper, Sunley (CR11) 1996; 5
H Xu (62_CR25) 2002; 44
62_CR19
YL Lin (62_CR18) 2017; 45
L Moura (62_CR21) 2003; 11
AP Godbole (62_CR11) 1996; 5
62_CR15
U Gromping (62_CR12) 2014; 42
Y Akhtar (62_CR1) 2017; 232
J Wang (62_CR23) 1992; 34
DM Cohen (62_CR8) 1997; 23
SR Dalal (62_CR10) 1998; 40
DR Kuhn (62_CR16) 2013
Y Kim (62_CR14) 2016; 32
K Meagher (62_CR20) 2007; 15
62_CR22
62_CR4
Z Baranyai (62_CR5) 1979; 26
W Li (62_CR17) 2013; 45
H Xu (62_CR26) 2003; 13
62_CR2
62_CR3
CFJ Wu (62_CR24) 2009
62_CR9
AS Hedayat (62_CR13) 1999
C Berge (62_CR6) 1989
RC Bryce (62_CR7) 2009; 19
References_xml – ident: CR22
– volume: 23
  start-page: 437
  issue: 7
  year: 1997
  end-page: 444
  ident: CR8
  article-title: The AETG system: an approach to testing based on combinatorial design
  publication-title: IEEE Trans Softw Eng
  doi: 10.1109/32.605761
– year: 2009
  ident: CR24
  publication-title: Experiments: planning, analysis and optimization
– ident: CR4
– ident: CR2
– volume: 11
  start-page: 413
  year: 2003
  end-page: 432
  ident: CR21
  article-title: Covering arrays with mixed alphabet sizes
  publication-title: J Comb Des
  doi: 10.1002/jcd.10059
– volume: 45
  start-page: 2483
  year: 2017
  end-page: 2510
  ident: CR18
  article-title: Optimal design of fMRI experiments using circulant (almost-)orthogonal arrays
  publication-title: Ann Stat
  doi: 10.1214/16-AOS1531
– year: 2013
  ident: CR16
  publication-title: Introduction to combinatorial testing
– volume: 232
  start-page: 8
  year: 2017
  end-page: 22
  ident: CR1
  article-title: Mixed covering arrays on 3-uniform hypergraphs
  publication-title: Discrete Appl Math
  doi: 10.1016/j.dam.2017.08.023
– volume: 26
  start-page: 276
  year: 1979
  end-page: 294
  ident: CR5
  article-title: The edge-coloring of complete hypergraphs I
  publication-title: J Comb Theory Ser B
  doi: 10.1016/0095-8956(79)90002-9
– volume: 44
  start-page: 356
  year: 2002
  end-page: 368
  ident: CR25
  article-title: An algorithm for constructing orthogonal and nearly-orthogonal arrays with mixed levels and small runs
  publication-title: Technometrics
  doi: 10.1198/004017002188618554
– year: 1989
  ident: CR6
  publication-title: Hypergraphs-combinatorics of finite sets
– volume: 5
  start-page: 105
  year: 1996
  end-page: 118
  ident: CR11
  article-title: -covering arrays: upper bounds and Poisson approximations
  publication-title: Comb Probab Comput
  doi: 10.1017/S0963548300001905
– volume: 32
  start-page: 1467
  year: 2016
  end-page: 1481
  ident: CR14
  article-title: Graphical methods for evaluating covering arrays
  publication-title: Qual Reliab Eng Int
  doi: 10.1002/qre.1857
– volume: 13
  start-page: 691
  year: 2003
  end-page: 708
  ident: CR26
  article-title: Minimum moment aberration for nonregular designs and supersaturated designs
  publication-title: Stat Sin
– ident: CR19
– volume: 19
  start-page: 37
  issue: 1
  year: 2009
  end-page: 53
  ident: CR7
  article-title: A density-based greedy algorithm for higher strength covering arrays
  publication-title: Softw Test Verif Reliab
  doi: 10.1002/stvr.393
– volume: 34
  start-page: 409
  issue: 4
  year: 1992
  end-page: 422
  ident: CR23
  article-title: Nearly orthogonal arrays with mixed levels and small runs
  publication-title: Technometrics
  doi: 10.1080/00401706.1992.10484952
– ident: CR3
– ident: CR15
– ident: CR9
– volume: 15
  start-page: 393
  year: 2007
  end-page: 404
  ident: CR20
  article-title: Mixed covering arrays on graphs
  publication-title: J Comb Des
  doi: 10.1002/jcd.20149
– volume: 42
  start-page: 918
  year: 2014
  end-page: 939
  ident: CR12
  article-title: Generalized resolution for orthogonal arrays
  publication-title: Ann Stat
  doi: 10.1214/14-AOS1205
– year: 1999
  ident: CR13
  publication-title: Orthogonal arrays, theory and applications, springer series in statistics
– volume: 45
  start-page: 74
  year: 2013
  end-page: 99
  ident: CR17
  article-title: Conjoint analysis and discrete choice experiments for quality improvement
  publication-title: J Qual Technol
  doi: 10.1080/00224065.2013.11917916
– volume: 40
  start-page: 234
  issue: 3
  year: 1998
  end-page: 243
  ident: CR10
  article-title: Factor-covering designs for testing software
  publication-title: Technometrics
  doi: 10.1080/00401706.1998.10485524
– volume: 19
  start-page: 37
  issue: 1
  year: 2009
  ident: 62_CR7
  publication-title: Softw Test Verif Reliab
  doi: 10.1002/stvr.393
– ident: 62_CR4
– volume: 26
  start-page: 276
  year: 1979
  ident: 62_CR5
  publication-title: J Comb Theory Ser B
  doi: 10.1016/0095-8956(79)90002-9
– volume: 232
  start-page: 8
  year: 2017
  ident: 62_CR1
  publication-title: Discrete Appl Math
  doi: 10.1016/j.dam.2017.08.023
– volume: 23
  start-page: 437
  issue: 7
  year: 1997
  ident: 62_CR8
  publication-title: IEEE Trans Softw Eng
  doi: 10.1109/32.605761
– volume: 15
  start-page: 393
  year: 2007
  ident: 62_CR20
  publication-title: J Comb Des
  doi: 10.1002/jcd.20149
– ident: 62_CR2
– ident: 62_CR19
  doi: 10.1016/j.jctb.2005.03.005
– volume: 5
  start-page: 105
  year: 1996
  ident: 62_CR11
  publication-title: Comb Probab Comput
  doi: 10.1017/S0963548300001905
– volume-title: Hypergraphs-combinatorics of finite sets
  year: 1989
  ident: 62_CR6
– volume: 34
  start-page: 409
  issue: 4
  year: 1992
  ident: 62_CR23
  publication-title: Technometrics
  doi: 10.1080/00401706.1992.10484952
– volume: 11
  start-page: 413
  year: 2003
  ident: 62_CR21
  publication-title: J Comb Des
  doi: 10.1002/jcd.10059
– volume-title: Orthogonal arrays, theory and applications, springer series in statistics
  year: 1999
  ident: 62_CR13
– volume: 45
  start-page: 2483
  year: 2017
  ident: 62_CR18
  publication-title: Ann Stat
  doi: 10.1214/16-AOS1531
– volume: 42
  start-page: 918
  year: 2014
  ident: 62_CR12
  publication-title: Ann Stat
  doi: 10.1214/14-AOS1205
– ident: 62_CR9
  doi: 10.1109/ICSE.2003.1201186
– volume: 45
  start-page: 74
  year: 2013
  ident: 62_CR17
  publication-title: J Qual Technol
  doi: 10.1080/00224065.2013.11917916
– volume: 40
  start-page: 234
  issue: 3
  year: 1998
  ident: 62_CR10
  publication-title: Technometrics
  doi: 10.1080/00401706.1998.10485524
– volume-title: Introduction to combinatorial testing
  year: 2013
  ident: 62_CR16
– volume: 44
  start-page: 356
  year: 2002
  ident: 62_CR25
  publication-title: Technometrics
  doi: 10.1198/004017002188618554
– ident: 62_CR3
– ident: 62_CR22
– ident: 62_CR15
– volume-title: Experiments: planning, analysis and optimization
  year: 2009
  ident: 62_CR24
– volume: 13
  start-page: 691
  year: 2003
  ident: 62_CR26
  publication-title: Stat Sin
– volume: 32
  start-page: 1467
  year: 2016
  ident: 62_CR14
  publication-title: Qual Reliab Eng Int
  doi: 10.1002/qre.1857
SSID ssj0061033
Score 2.1353574
Snippet A covering design is a traditional class of experimental plans for hardware and software testing purposes. This paper presents a class of size-optimal covering...
SourceID crossref
springer
SourceType Enrichment Source
Index Database
Publisher
SubjectTerms Algorithms
Analysis and Advanced Methodologies in the Design of Experiments
Mathematics and Statistics
Original Article
Probability Theory and Stochastic Processes
Statistical Theory and Methods
Statistics
Title Cost-Efficient Mixed-Level Covering Designs for Testing Experiments
URI https://link.springer.com/article/10.1007/s42519-019-0062-7
Volume 14
WOSCitedRecordID wos000511595300001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAVX
  databaseName: SpringerLINK Contemporary 1997-Present
  customDbUrl:
  eissn: 1559-8616
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0061033
  issn: 1559-8608
  databaseCode: RSV
  dateStart: 20070301
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
– providerCode: PRVAWR
  databaseName: Taylor and Francis Online Journals
  customDbUrl:
  eissn: 1559-8616
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0061033
  issn: 1559-8608
  databaseCode: TFW
  dateStart: 20070301
  isFulltext: true
  titleUrlDefault: https://www.tandfonline.com
  providerName: Taylor & Francis
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEB60etCDj6pYX-TgSVnYvHePEls82CJapLewTxCklaaKP9_ZbRIoqKCHvYTJg9nNzDfMzDcAl1SnYR5rQcJYRCRRXBEZh4q4rs5MCUszav2wiXw0YpMJf6j7uKum2r1JSXpL3Ta7Ja7JEkNfXDRDWLgOG-jtmJvX8Pj03JhfhAN-frxLtxGWUdakMr97xKozWs2Eegcz2P3Xp-3BTo0ng5vlAdiHNTPtwvawJWOturDlAOWSj_kAimJWLUjfE0egvwmGL59Gk3tXOhQUrpwT3xvc-rKOKkBAG4wdDQde67ejAKpDGA_64-KO1IMUiIoYWxDOjUjQqpkUwQPGfybMLI9FLrXIBfrnXKVcCm6ljRyRuAljRY2hIlJCxSmPj6AznU3NMQTGSqk0lVSEOtHCMmoSFWZUIUyw1LIe0EahpapJxt2si9eypUf2uiqpW6irMu_BVXvL25Jh4zfh62YHyvpnq36WPvmT9ClsRS6Y9gVmZ9BZzN_NOWyqD9yi-YU_ZF8OZ8sk
linkProvider Springer Nature
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEB60CtaDb7E-c_CkLOzmvUeJLRXbIhqkt7DZ7IIgrTRV_PnObpNAQQU97CVMHsxuZr5hZr4BuKRFwCKvEIR5wiW-5JLkHpPEdHWGUmgaUm2HTUSjUTwe84eqj7usq93rlKS11E2zm2-aLDH0xUVDhIWrsOajwzKE-Y9Pz7X5RThg58ebdBuJQxrXqczvHrHsjJYzodbB9Lb_9Wk7sFXhSedmcQB2YUVN9mBz2JCxlnvQNoBywce8D0kyLeeka4kj0N84w5dPVZCBKR1yElPOie91bm1ZR-kgoHVSQ8OB17rNKIDyANJeN036pBqkQKQbx3PCuRI-WjUVIHjA-E-xUHNPRHkhIoH-OZIBzwXXuXYNkbhinqRKUeFKIb2Ae4fQmkwn6ggcpfNcFjSnghV-IXRMlS9ZSCXCBE113AFaKzSTFcm4mXXxmjX0yFZXGTULdZVFHbhqbnlbMGz8Jnxd70BW_Wzlz9LHf5K-gI1-Ohxkg7vR_Qm0XRNY22KzU2jNZ-_qDNblB27X7NweuC-eVc4I
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LSwMxEB60itSDj6pYn3vwpIRm35ujbFsU21KwSG9LNg8QZFu6q_jzTbIPKKggHnJZJrthks18w8x8A3CDuW-HLqfIdqmDPEYYSl2bIV3VGTAqcYClaTYRTibRfE6mVZ_TvM52r0OSZU2DZmnKit6Sy15T-ObpgkvlBquBAwURN2HL03n02l1_fqmvYgUNTC95HXpDUYCjOqz53SvWDdN6VNQYm-H-v5d5AHsVzrTuy4NxCBsi68DuuCFpzTvQ1kCz5Gk-gjhe5AUaGEIJ9QFr_PopOBrplCIr1mmeag1W36R75JYCutZM03OoZ4OmRUB-DLPhYBY_oKrBAmJOFBWIEEE9ddsJX4EK5RcKO5DEpWHKaUiV3Q6ZT1JKZCodTTAubJdhITB1GGWuT9wTaGWLTJyCJWSaMo5TTG3ucSojLDxmB5gp-CCxjLqAa-UmrCIf1z0w3pKGNtnoKsF6KF0lYRdumynLknnjN-G7ejeS6ifMf5Y--5P0NexM-8Nk9Dh5Ooe2o_1tk4N2Aa1i9S4uYZt9qN1aXZmz9wUnqtbs
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=Cost-Efficient+Mixed-Level+Covering+Designs+for+Testing+Experiments&rft.jtitle=Journal+of+statistical+theory+and+practice&rft.au=Akhtar%2C+Yasmeen&rft.au=Phoa%2C+Frederick+Kin+Hing&rft.date=2020-03-01&rft.pub=Springer+International+Publishing&rft.issn=1559-8608&rft.eissn=1559-8616&rft.volume=14&rft.issue=1&rft_id=info:doi/10.1007%2Fs42519-019-0062-7&rft.externalDocID=10_1007_s42519_019_0062_7
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1559-8608&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1559-8608&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1559-8608&client=summon