A sliding window-based false-negative approach for ubiquitous data stream analysis
SUMMARY Ubiquitous data stream mining (UDSM) is the process of performing data analysis on mobile, embedded and ubiquitous devices. In many cases, a large volume of data can be mined for interesting and relevant information in a wide variety of applications. Data stream mining requires computational...
Saved in:
Published in | International journal of communication systems Vol. 25; no. 6; pp. 691 - 716 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
Chichester, UK
John Wiley & Sons, Ltd
01.06.2012
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | SUMMARY
Ubiquitous data stream mining (UDSM) is the process of performing data analysis on mobile, embedded and ubiquitous devices. In many cases, a large volume of data can be mined for interesting and relevant information in a wide variety of applications. Data stream mining requires computationally intensive mining techniques to be applied in mobile environments constrained by analysis of a real‐time single pass with limited computational resources. Therefore, we have to ensure that the result is within the error tolerance range. In this paper, we suggest a method for a false‐negative approach based on the Chernoff bound for efficient analysis of the data stream. Hence, we consider the problem of approximating frequency counts for space‐efficient computation over data stream sliding windows. We show that a false‐negative approach allowing a controlled number of frequent itemsets to be missing from the output is a more promising solution for mining frequent itemsets from a ubiquitous data stream. These are simple to implement, and have provable quality, space, and time guarantees. The experimental results have shown that the proposed algorithms achieve a high accuracy of at least 99% and require a small execution time. Copyright © 2011 John Wiley & Sons, Ltd.
In this paper, we propose the problem of approximate frequency counts for space efficient computation over data stream sliding windows. Our proposed method can be controlled by a predefined parameter so that a desired recall rate of frequent itemsets can be guaranteed. Also our method is for dynamically maintain potential frequent itemsets with high probability in a potential table and have provable quality, space and time guarantees. Copyright © 2011 John Wiley & Sons, Ltd. |
---|---|
AbstractList | SUMMARY
Ubiquitous data stream mining (UDSM) is the process of performing data analysis on mobile, embedded and ubiquitous devices. In many cases, a large volume of data can be mined for interesting and relevant information in a wide variety of applications. Data stream mining requires computationally intensive mining techniques to be applied in mobile environments constrained by analysis of a real‐time single pass with limited computational resources. Therefore, we have to ensure that the result is within the error tolerance range. In this paper, we suggest a method for a false‐negative approach based on the Chernoff bound for efficient analysis of the data stream. Hence, we consider the problem of approximating frequency counts for space‐efficient computation over data stream sliding windows. We show that a false‐negative approach allowing a controlled number of frequent itemsets to be missing from the output is a more promising solution for mining frequent itemsets from a ubiquitous data stream. These are simple to implement, and have provable quality, space, and time guarantees. The experimental results have shown that the proposed algorithms achieve a high accuracy of at least 99% and require a small execution time. Copyright © 2011 John Wiley & Sons, Ltd. SUMMARY Ubiquitous data stream mining (UDSM) is the process of performing data analysis on mobile, embedded and ubiquitous devices. In many cases, a large volume of data can be mined for interesting and relevant information in a wide variety of applications. Data stream mining requires computationally intensive mining techniques to be applied in mobile environments constrained by analysis of a real‐time single pass with limited computational resources. Therefore, we have to ensure that the result is within the error tolerance range. In this paper, we suggest a method for a false‐negative approach based on the Chernoff bound for efficient analysis of the data stream. Hence, we consider the problem of approximating frequency counts for space‐efficient computation over data stream sliding windows. We show that a false‐negative approach allowing a controlled number of frequent itemsets to be missing from the output is a more promising solution for mining frequent itemsets from a ubiquitous data stream. These are simple to implement, and have provable quality, space, and time guarantees. The experimental results have shown that the proposed algorithms achieve a high accuracy of at least 99% and require a small execution time. Copyright © 2011 John Wiley & Sons, Ltd. In this paper, we propose the problem of approximate frequency counts for space efficient computation over data stream sliding windows. Our proposed method can be controlled by a predefined parameter so that a desired recall rate of frequent itemsets can be guaranteed. Also our method is for dynamically maintain potential frequent itemsets with high probability in a potential table and have provable quality, space and time guarantees. Copyright © 2011 John Wiley & Sons, Ltd. |
Author | Kim, Ungmo Park, Doo-soon Kim, Heewan Kim, Younghee |
Author_xml | – sequence: 1 givenname: Younghee surname: Kim fullname: Kim, Younghee email: younghees@gmail.com organization: School of Information and Communication Engineering, University of Sungkyunkwan, Korea – sequence: 2 givenname: Doo-soon surname: Park fullname: Park, Doo-soon organization: Division of Computer Science and Engineering, University of Soonchunhyang, Korea – sequence: 3 givenname: Heewan surname: Kim fullname: Kim, Heewan organization: Division of Computer, University of Sahmyook, Korea – sequence: 4 givenname: Ungmo surname: Kim fullname: Kim, Ungmo organization: School of Information and Communication Engineering, University of Sungkyunkwan, Korea |
BookMark | eNp1kEFPwjAYhhuDiYAm_oQevRTbdd3WIwGdJgQjQTk239oOq2PDdoj8e0GMiQfzHd7v8Lzv4emhTt3UFqFLRgeM0ujagB6wiLET1GVUSsIYZ53Dn8ZEcMHOUC-EV0ppFiWii2ZDHCpnXL3EW1ebZksKCNbgEqpgSW2X0LoPi2G99g3oF1w2Hm8K975xbbMJ2EALOLTewgpDDdUuuHCOTr_bFz_ZR0-3N_PRHZk85Pej4YRoTjkjUnMrRZzQSMooKUBqqU20v0SkhZA0E0ZwzqSNEwkyi4sioXHKjNAaoqw0vI-ujrvaNyF4W6q1dyvwO8WoOrhQexfq4GKPkiO6dZXd_cup8XD0l3ehtZ-_PPg3laQ8FWoxzdUkfxzPnqdzteBfNhNxAg |
CitedBy_id | crossref_primary_10_1002_dac_2522 crossref_primary_10_1002_dac_2778 crossref_primary_10_1002_dac_2888 crossref_primary_10_1002_dac_2681 |
Cites_doi | 10.1145/543613.543615 10.1145/776985.776986 10.1016/B978-155860869-6/50038-X 10.1145/762471.762473 10.1145/1458082.1458326 10.1561/0400000002 10.1137/S0097539701398363 10.1007/978-3-540-71703-4_89 10.1007/s10618-006-0042-x 10.1109/ICSMC.2006.385267 10.1109/CIBEC.2008.4786099 10.1016/B978-012088469-8/50021-8 10.1016/j.is.2004.02.001 10.1016/j.eswa.2007.11.061 10.1145/956750.956807 10.1145/1083784.1083789 |
ContentType | Journal Article |
Copyright | Copyright © 2011 John Wiley & Sons, Ltd. |
Copyright_xml | – notice: Copyright © 2011 John Wiley & Sons, Ltd. |
DBID | BSCLL AAYXX CITATION |
DOI | 10.1002/dac.1211 |
DatabaseName | Istex CrossRef |
DatabaseTitle | CrossRef |
DatabaseTitleList | CrossRef |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Engineering |
EISSN | 1099-1131 |
EndPage | 716 |
ExternalDocumentID | 10_1002_dac_1211 DAC1211 ark_67375_WNG_LGQDRVNT_W |
Genre | article |
GroupedDBID | .3N .GA .Y3 05W 0R~ 10A 1L6 1OB 1OC 31~ 33P 3SF 3WU 4.4 50Y 50Z 51W 51X 52M 52N 52O 52P 52S 52T 52U 52W 52X 5GY 5VS 66C 702 7PT 8-0 8-1 8-3 8-4 8-5 8UM 930 A03 AAESR AAEVG AAHHS AANLZ AAONW AASGY AAXRX AAZKR ABCQN ABCUV ABDBF ABEML ABHUG ABIJN ABPTK ABPVW ACAHQ ACBWZ ACCFJ ACCZN ACGFS ACIWK ACPOU ACSCC ACXBN ACXME ACXQS ADAWD ADBBV ADDAD ADEOM ADIZJ ADKYN ADMGS ADOZA ADXAS ADZMN ADZOD AEEZP AEIGN AEIMD AENEX AEQDE AEUQT AEUYR AFBPY AFFPM AFGKR AFPWT AFVGU AFZJQ AGJLS AHBTC AIURR AIWBW AJBDE AJXKR ALAGY ALMA_UNASSIGNED_HOLDINGS ALUQN AMBMR AMYDB ASPBG ATUGU AUFTA AVWKF AZBYB AZFZN AZVAB BAFTC BDRZF BFHJK BHBCM BMNLL BMXJE BNHUX BROTX BRXPI BSCLL BY8 CMOOK CS3 D-E D-F DCZOG DPXWK DR2 DRFUL DRSTM DU5 EBS EJD ESX F00 F01 F04 FEDTE G-S G.N GNP GODZA H.T H.X HF~ HHY HVGLF HZ~ I-F IX1 J0M JPC KQQ LATKE LAW LC2 LC3 LEEKS LITHE LOXES LP6 LP7 LUTES LYRES MEWTI MK4 MK~ ML~ MRFUL MRSTM MSFUL MSSTM MXFUL MXSTM N04 N05 N9A NF~ O66 O9- P2W P2X P4D PALCI Q.N Q11 QB0 QRW R.K RIWAO ROL RWI RX1 RYL SAMSI SUPJJ TUS UB1 V2E W8V W99 WBKPD WIH WIK WLBEL WOHZO WQJ WRC WWI WXSBR WYISQ XG1 XV2 ZZTAW ~IA ~WT AITYG HGLYW OIG AAYXX CITATION |
ID | FETCH-LOGICAL-c3031-9c3e9546029926ba9c9cd2d2d657b59085d53319e469a984bb60471d5cca28fd3 |
IEDL.DBID | DR2 |
ISSN | 1074-5351 |
IngestDate | Fri Aug 23 01:46:40 EDT 2024 Sat Aug 24 00:57:29 EDT 2024 Wed Jan 17 05:02:15 EST 2024 |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 6 |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-c3031-9c3e9546029926ba9c9cd2d2d657b59085d53319e469a984bb60471d5cca28fd3 |
Notes | ArticleID:DAC1211 ark:/67375/WNG-LGQDRVNT-W istex:8268654217EEF31A36EB7948319239365067D217 |
PageCount | 26 |
ParticipantIDs | crossref_primary_10_1002_dac_1211 wiley_primary_10_1002_dac_1211_DAC1211 istex_primary_ark_67375_WNG_LGQDRVNT_W |
PublicationCentury | 2000 |
PublicationDate | 2012-06 June 2012 2012-06-00 |
PublicationDateYYYYMMDD | 2012-06-01 |
PublicationDate_xml | – month: 06 year: 2012 text: 2012-06 |
PublicationDecade | 2010 |
PublicationPlace | Chichester, UK |
PublicationPlace_xml | – name: Chichester, UK |
PublicationTitle | International journal of communication systems |
PublicationTitleAlternate | Int. J. Commun. Syst |
PublicationYear | 2012 |
Publisher | John Wiley & Sons, Ltd |
Publisher_xml | – name: John Wiley & Sons, Ltd |
References | Karp RM, Shenker S. A simple algorithm for finding frequent elements in streams and bags. ACM Transactions on Database Systems 2003; 28(1):51-55. Lee CH, Lin CR, Chen MS. Sliding window filtering: an efficient method for incremental mining on a time-variant database. Information Systems 2005; 30:227-244. Golab L, Ozsu MT. Issue in data stream management. SIGMOD Record, vol. 32(2), 2003; 5-14. Li HF, Lee SY. Mining frequent itemsets over data streams using efficient window sliding techniques. Expert Systems with Applications 2009; 36(2). Gaber MM, Zaslavsky A, Krishnaswamy S. Mining Data Streams: a review. ACM SIGMOD Record, vol. 342, 2005; 18-26. Raymond CH, Ada WF. Mining top-k frequent itemsets from data streams. Data Mining and Knowledge Discovery 2006; 13(2):193-217. Gaber MM, Krishnaswamy M, Zaslavsky A. On-board Mining of Data Streams in Sensor Networks. Springer: Berlin, 2006; 307-335. Datar M, Gionis A, Indyk P, Motwani R. Maintaining stream statistics over sliding windows. SIAM Journal on Computing 2002; 31(6):1794-1813. Muthukrishnan S. Data Streams: algorithms and applications. Foundations and Trends in Theoretical Computer Science 2005; 1(2). Chang JH, Lee WS. A sliding window method for finding recently frequent itemsets over online data streams. Journal of Information Science and Engineering 2004; 20(4):753-762. 2009; 36 2004; 20 2005; 342 2002; 31 2006; 13 1998 2005; 30 2007 2006 2005; 1 2003; 28 2004 2003 2002 2003; 32 e_1_2_8_28_2 e_1_2_8_23_2 Gaber MM (e_1_2_8_8_2) 2006 e_1_2_8_24_2 e_1_2_8_25_2 e_1_2_8_26_2 e_1_2_8_9_2 Giannella C (e_1_2_8_27_2) 2004 e_1_2_8_2_2 e_1_2_8_4_2 e_1_2_8_3_2 e_1_2_8_6_2 e_1_2_8_5_2 e_1_2_8_7_2 e_1_2_8_20_2 Karp RM (e_1_2_8_18_2) 2003; 28 e_1_2_8_21_2 e_1_2_8_22_2 e_1_2_8_16_2 e_1_2_8_17_2 Chang JH (e_1_2_8_15_2) 2004; 20 e_1_2_8_19_2 e_1_2_8_12_2 e_1_2_8_13_2 e_1_2_8_14_2 e_1_2_8_10_2 e_1_2_8_11_2 |
References_xml | – start-page: 346 end-page: 357 – start-page: 487 year: 2003 end-page: 492 – start-page: 152 end-page: 160 – start-page: 210 end-page: 217 – volume: 28 start-page: 51 issue: 1 year: 2003 end-page: 55 article-title: A simple algorithm for finding frequent elements in streams and bags publication-title: ACM Transactions on Database Systems – volume: 342 start-page: 18 year: 2005 end-page: 26 article-title: Mining Data Streams: a review publication-title: ACM SIGMOD Record – volume: 31 start-page: 1794 issue: 6 year: 2002 end-page: 1813 article-title: Maintaining stream statistics over sliding windows publication-title: SIAM Journal on Computing – start-page: 747 end-page: 754 – start-page: 1 end-page: 8 – volume: 30 start-page: 227 year: 2005 end-page: 244 article-title: Sliding window filtering: an efficient method for incremental mining on a time‐variant database publication-title: Information Systems – volume: 13 start-page: 193 issue: 2 year: 2006 end-page: 217 article-title: Mining top‐k frequent itemsets from data streams publication-title: Data Mining and Knowledge Discovery – year: 2006 – start-page: 1 year: 2002 end-page: 16 – start-page: 1 end-page: 6 – start-page: 191 year: 2004 end-page: 212 – volume: 32 start-page: 5 issue: 2 year: 2003 end-page: 14 article-title: Issue in data stream management publication-title: SIGMOD Record – start-page: 204 year: 2004 end-page: 215 – volume: 1 issue: 2 year: 2005 article-title: Data Streams: algorithms and applications publication-title: Foundations and Trends in Theoretical Computer Science – start-page: 1447 end-page: 1448 – start-page: 981 year: 2007 end-page: 987 – volume: 36 issue: 2 year: 2009 article-title: Mining frequent itemsets over data streams using efficient window sliding techniques publication-title: Expert Systems with Applications – volume: 20 start-page: 753 issue: 4 year: 2004 end-page: 762 article-title: A sliding window method for finding recently frequent itemsets over online data streams publication-title: Journal of Information Science and Engineering – year: 1998 – start-page: 307 year: 2006 end-page: 335 – volume: 20 start-page: 753 issue: 4 year: 2004 ident: e_1_2_8_15_2 article-title: A sliding window method for finding recently frequent itemsets over online data streams publication-title: Journal of Information Science and Engineering contributor: fullname: Chang JH – ident: e_1_2_8_3_2 doi: 10.1145/543613.543615 – ident: e_1_2_8_5_2 doi: 10.1145/776985.776986 – ident: e_1_2_8_12_2 doi: 10.1016/B978-155860869-6/50038-X – volume: 28 start-page: 51 issue: 1 year: 2003 ident: e_1_2_8_18_2 article-title: A simple algorithm for finding frequent elements in streams and bags publication-title: ACM Transactions on Database Systems doi: 10.1145/762471.762473 contributor: fullname: Karp RM – ident: e_1_2_8_19_2 – start-page: 307 volume-title: On‐board Mining of Data Streams in Sensor Networks year: 2006 ident: e_1_2_8_8_2 contributor: fullname: Gaber MM – ident: e_1_2_8_26_2 doi: 10.1145/1458082.1458326 – ident: e_1_2_8_6_2 doi: 10.1561/0400000002 – ident: e_1_2_8_9_2 – ident: e_1_2_8_4_2 doi: 10.1137/S0097539701398363 – ident: e_1_2_8_21_2 doi: 10.1007/978-3-540-71703-4_89 – ident: e_1_2_8_22_2 doi: 10.1007/s10618-006-0042-x – ident: e_1_2_8_25_2 doi: 10.1109/ICSMC.2006.385267 – ident: e_1_2_8_10_2 doi: 10.1109/CIBEC.2008.4786099 – ident: e_1_2_8_11_2 – ident: e_1_2_8_20_2 – ident: e_1_2_8_13_2 doi: 10.1016/B978-012088469-8/50021-8 – start-page: 191 volume-title: Data Mining, Next Generation Challenges and Futures Directions year: 2004 ident: e_1_2_8_27_2 contributor: fullname: Giannella C – ident: e_1_2_8_17_2 – ident: e_1_2_8_14_2 – ident: e_1_2_8_7_2 – ident: e_1_2_8_23_2 doi: 10.1016/j.is.2004.02.001 – ident: e_1_2_8_24_2 doi: 10.1016/j.eswa.2007.11.061 – ident: e_1_2_8_28_2 – ident: e_1_2_8_16_2 doi: 10.1145/956750.956807 – ident: e_1_2_8_2_2 doi: 10.1145/1083784.1083789 |
SSID | ssj0008265 |
Score | 1.9631436 |
Snippet | SUMMARY
Ubiquitous data stream mining (UDSM) is the process of performing data analysis on mobile, embedded and ubiquitous devices. In many cases, a large... |
SourceID | crossref wiley istex |
SourceType | Aggregation Database Publisher |
StartPage | 691 |
SubjectTerms | approximate counts Chernoff bound false negative frequent itemsets ubiquitous data stream mining |
Title | A sliding window-based false-negative approach for ubiquitous data stream analysis |
URI | https://api.istex.fr/ark:/67375/WNG-LGQDRVNT-W/fulltext.pdf https://onlinelibrary.wiley.com/doi/abs/10.1002%2Fdac.1211 |
Volume | 25 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEF6kXvTgW6wvVhBvafPaNHssrW0RLVj6Ag9hN9mIFFNtGyqe_An-Rn-JM3lYKwgiOYTAJllmZ-f7Jsx8IeTcNOzQAuDUQoiQml3RFTYrQ7KiXMtXIVeuwm7km7bT6tlXQzbMqiqxFybVh_j64IY7I4nXuMGFnJYXoqEBvA_1ySD8oo4e8qHOQjkKWDPLyw2ZxYxcd1Y3y_mNS0i0ikZ9WWaoCcQ0NsldPrm0smRUimey5L_-0G383-y3yEbGPGk1dZVtsqKiHbL-TY9wl_SrFGgnohmdQ64-nn-8vSPMBTQEL1VwFan7RCmc5lrkFEgvjeXDcwyhIZ5SrDil2IAiHqnIBE_2SK9x2a21tOzHC5oPiGZo3LcUZ7ajA1aZjhTc535gwuGwisSfpLMAWKLBFeTWgru2lI4OIBcwcAfTDQNrnxSicaQOCBVcCV3okgtgZlwaEhIkm-vMtx1X-K5VJGf5InhPqb6Glyopmx7YyEMbFclFsjpfA8RkhPVoFeYN2k3vunlb7_TbXW8AAxOb__okr16t4fnwrwOPyBowJDOtDTsmhdkkVifAQmbyNPG3Tyet2ZU |
link.rule.ids | 315,786,790,1382,27955,27956,46327,46751 |
linkProvider | Wiley-Blackwell |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1bS8MwFD54eVAfvIt3I4hvdb2la_BpON3UreDY5h6EkLSpiDhvK4pP_gR_o7_Ek3bdnCCI9KEU0jacnOT7TjjnC8Cebbmxg8BpxLhCGm7RVLpYGYMV5Tuhipnyla5GrgdeteWedWhnDA7zWphMH2Kw4aZnRrpe6wmuN6QLQ9XQCH-oBcrGYRJnO9WzstwYakchb6Z5wiF1qJUrz5p2IX9zBIsmtVlfRzlqCjInc3CVdy_LLbk9SHryIHz7odz4z_7Pw2yffJJS5i0LMKa6izDzTZJwCdolgsxTAxp5wXD9_uXz_UMjXURidFSFT111nYqFk1yOnCDvJYm8eUxwdUieiU46JboGRdwR0dc8WYbWyXHzqGr0z14wQgQ1y2Choxh1PRPhyvakYCELIxsvjxalPiedRkgULaYwvBbMd6X0TMS5iKJH2H4cOSsw0b3vqlUggilhClMygeSMSUtijOQyk4au54vQd9ZgNx8F_pBJbPBMTNnmaCOubbQG--nwDBqIp1udklak_DKo8FrlotxoB01-iQ1To__6JV4uHen7-l8b7sBUtVmv8dppcL4B00iY7CxVbBMmek-J2kJS0pPbqfN9Ac9a3bU |
linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1bS8MwFA66geiDd3FeI4hvnb2lax7H5jZ1Dh27gQ8haVOR4TbnysQnf4K_0V_iSbtuThBE-lAKaRtOTvJ9J5zzBaFT07ADC4BTC2CF1OycLlWxMgQr0rU8GVDpSlWNfFNzKk37qkM6k6xKVQsT60NMN9zUzIjWazXBB35wPhMN9eF_Sp9sEaVtxzJV4FWsz6SjgDaTJN-QWMRIhGd18zx5cw6K0sqqr_MUNcKY0hq6T3oXp5Z0s-FIZL23H8KN_-v-OlqdUE-cj31lAy3I3iZa-SZIuIVaeQy8U8EZHkOw3h9_vn8onPNxAG4q4aknHyKpcJyIkWNgvTgUj88hrA3hC1Ypp1hVoPAnzCeKJ9uoWbpoFCra5OQFzQNIMzTqWZIS29EBrExHcOpRzzfhckhOqFPSiQ800aASgmtOXVsIRweU8wn4g-kGvrWDUr1-T-4izKnkOtcF5UDNqDAEREg21YlnOy73XCuDTpJBYINYYIPFUsomAxsxZaMMOotGZ9qAD7sqIS1HWLtWZtXyXbHeqjVYGxpGNv_1S6yYL6j73l8bHqOl22KJVS9r1_toGdiSGeeJHaDUaBjKQ2AkI3EUud4XXJLcZA |
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=A+sliding+window%E2%80%90based+false%E2%80%90negative+approach+for+ubiquitous+data+stream+analysis&rft.jtitle=International+journal+of+communication+systems&rft.au=Kim%2C+Younghee&rft.au=Park%2C+Doo%E2%80%90soon&rft.au=Kim%2C+Heewan&rft.au=Kim%2C+Ungmo&rft.date=2012-06-01&rft.pub=John+Wiley+%26+Sons%2C+Ltd&rft.issn=1074-5351&rft.eissn=1099-1131&rft.volume=25&rft.issue=6&rft.spage=691&rft.epage=716&rft_id=info:doi/10.1002%2Fdac.1211&rft.externalDBID=10.1002%252Fdac.1211&rft.externalDocID=DAC1211 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1074-5351&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1074-5351&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1074-5351&client=summon |