{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T00:18:29Z","timestamp":1721002709616},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2014,8,15]],"date-time":"2014-08-15T00:00:00Z","timestamp":1408060800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1007\/s00500-014-1419-1","type":"journal-article","created":{"date-parts":[[2014,8,14]],"date-time":"2014-08-14T07:44:01Z","timestamp":1408002241000},"page":"2287-2303","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A novel optimization hardness indicator based on the relationship between optimization hardness and frequency features of real-parameter problems"],"prefix":"10.1007","volume":"19","author":[{"given":"Kun","family":"Li","sequence":"first","affiliation":[]},{"given":"Ming","family":"Li","sequence":"additional","affiliation":[]},{"given":"Hao","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,8,15]]},"reference":[{"key":"1419_CR1","doi-asserted-by":"crossref","unstructured":"Auger A, Teytaud O (2007) Continuous Lunches are Free! Gecco 2007: genetic and evolutionary computation conference, vol 1 and 2, pp 916\u2013922","DOI":"10.1145\/1276958.1277145"},{"key":"1419_CR2","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.neucom.2013.01.027","volume":"117","author":"Y Bao","year":"2013","unstructured":"Bao Y, Hu Z, Xiong T (2013) A PSO and pattern search based memetic algorithm for SVMs parameters optimization. Neurocomputing 117:98\u2013106","journal-title":"Neurocomputing"},{"issue":"2\u20134","key":"1419_CR3","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/S0045-7825(99)00386-2","volume":"186","author":"H-G Beyer","year":"2000","unstructured":"Beyer H-G (2000) Evolutionary algorithms in noisy environments: theoretical issues and guidelines for practice. Computer Methods Appl Mech Eng 186(2\u20134):239\u2013267","journal-title":"Computer Methods Appl Mech Eng"},{"key":"1419_CR4","doi-asserted-by":"crossref","unstructured":"Borenstein Y, Poli R (2005) Information landscapes. In: Proceedings of the 2005 conference on genetic and evolutionary computation. ACM, Washington, DC, pp 1515\u20131522","DOI":"10.1145\/1068009.1068248"},{"key":"1419_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ins.2013.12.044","volume":"265","author":"F Caraffini","year":"2014","unstructured":"Caraffini F, Neri F, Picinali L (2014) An analysis on separability for memetic computing automatic design. Inf Sci 265:1\u201322","journal-title":"Inf Sci"},{"key":"1419_CR6","unstructured":"Chan KY, Aydin ME, Fogarty TC (2003) An epistasis measure based on the analysis of variance for the realcoded representation in genetic algorithms. In: Cec: 2003 Congress on evolutionary computation, vol 1\u20134, proceedings, pp 297\u2013304"},{"issue":"3","key":"1419_CR7","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1109\/TSMCA.2009.2012436","volume":"39","author":"J Chen","year":"2009","unstructured":"Chen J, Xin B, Peng Z, Dou L, Zhang J (2009) Optimal contraction theorem for exploration\u2013exploitation tradeoff in search and optimization. IEEE Trans Syst Man Cybernet Part A\u2014Syst Hum 39(3):680\u2013691","journal-title":"IEEE Trans Syst Man Cybernet Part A\u2014Syst Hum"},{"key":"1419_CR8","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.jtbi.2013.01.022","volume":"323","author":"Z Cook","year":"2013","unstructured":"Cook Z, Franks DW, Robinson EJH (2013) Exploration versus exploitation in polydomous ant colonies. J Theor Biol 323:49\u201356","journal-title":"J Theor Biol"},{"key":"1419_CR9","doi-asserted-by":"crossref","unstructured":"Corne D, Oates M, Kell D (2003) Landscape state machines: tools for evolutionary algorithm performance analyses and landscape\/algorithm mapping. In: Raidl G, Coimbra CS (eds) Applications of evolutionary computing, vol 2611. Springer, Portugal, pp 187\u2013198","DOI":"10.1007\/3-540-36605-9_18"},{"issue":"3","key":"1419_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2480741.2480752","volume":"45","author":"M Crepinsek","year":"2013","unstructured":"Crepinsek M, Liu SH, Mernik M (2013) Exploration and exploitation in evolutionary algorithms: a survey. ACM Comput Surv 45(3):1\u201333","journal-title":"ACM Comput Surv"},{"key":"1419_CR11","volume-title":"Epistasis variance: a viewpoint on GA-hardness In foundations of genetic algorithms","author":"Y Davidor","year":"1991","unstructured":"Davidor Y, Schwefel HP, Manner R (1991) Epistasis variance: a viewpoint on GA-hardness In foundations of genetic algorithms. Morgan Kauffman, San Mateo"},{"issue":"4","key":"1419_CR12","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1080\/0305215X.2010.491547","volume":"43","author":"MS Gibbs","year":"2011","unstructured":"Gibbs MS, Maier HR, Dandy GC (2011) Relationship between problem characteristics and the optimal number of genetic algorithm generations. Eng Optim 43(4):349\u2013376","journal-title":"Eng Optim"},{"key":"1419_CR13","volume-title":"Digital image processing","author":"RC Gonz\u00e1lez","year":"2002","unstructured":"Gonz\u00e1lez RC, Woods RE (2002) Digital image processing, 2nd edn. Prentice Hall, Upper Saddle River","edition":"2"},{"issue":"1","key":"1419_CR14","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0004-3702(01)00058-3","volume":"127","author":"J He","year":"2001","unstructured":"He J, Yao X (2001) Drift analysis and average time complexity of evolutionary algorithms. Artif Intell 127(1):57\u201385","journal-title":"Artif Intell"},{"key":"1419_CR15","unstructured":"He J, Yao X (2003) An analysis of evolutionary algorithms for finding approximation solutions to hard optimisation problems. In: Cec: 2003 Congress on evolutionary computation, vol 1\u20134, proceedings, pp 2004\u20132010"},{"issue":"1\u20132","key":"1419_CR16","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/S0004-3702(02)00381-8","volume":"145","author":"J He","year":"2003","unstructured":"He J, Yao X (2003) Towards an analytic framework for analysing the computation time of evolutionary algorithms. Artif Intell 145(1\u20132):59\u201397","journal-title":"Artif Intell"},{"issue":"1","key":"1419_CR17","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s10791-012-9197-9","volume":"16","author":"K Hofmann","year":"2013","unstructured":"Hofmann K, Whiteson S, De Rijke M (2013) Balancing exploration and exploitation in listwise and pairwise online learning to rank for information retrieval. Inf Retrieval 16(1):63\u201390","journal-title":"Inf Retrieval"},{"key":"1419_CR18","unstructured":"Horn J, Goldberg DE (1994) Genetic algorithm difficulty and the modality of fitness landscapes. In: Foundations of genetic algorithms. Morgan Kaufmann, pp 243\u2013269"},{"key":"1419_CR19","doi-asserted-by":"crossref","unstructured":"Igel C, Toussaint M (2004) A No-Free-Lunch theorem for non-uniform distributions of target functions. J Math Model Alg 3:313\u2013 322","DOI":"10.1023\/B:JMMA.0000049381.24625.f7"},{"key":"1419_CR20","doi-asserted-by":"crossref","unstructured":"Jin Y, Branke H (2005) Evolutionary optimization in uncertain environments\u2014a survey. IEEE Trans Evol Comput 9(3):303\u2013 317","DOI":"10.1109\/TEVC.2005.846356"},{"key":"1419_CR21","unstructured":"Jones T (1996) One Operator one landscape, vol 15. Technical Reports 95-02-025, Santa Fe Institute"},{"key":"1419_CR22","unstructured":"Jones T, Forrest S (1995) Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In: Proceedings of the 6th International Conference on genetic algorithms. Morgan Kaufmann, San Mateo, pp 184\u2013192"},{"key":"1419_CR23","doi-asserted-by":"crossref","unstructured":"Kallel L, Naudts B, Reeves CR (2001) Properties of fitness functions and search landscapes. In: Kallel L, Naudts B, Rogers A (eds) Theoretical aspects of evolutionary computing. Springer, Berlin, pp 175\u2013 206","DOI":"10.1007\/978-3-662-04448-3_8"},{"issue":"1","key":"1419_CR24","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/S0022-5193(87)80029-2","volume":"128","author":"S Kauffman","year":"1987","unstructured":"Kauffman S, Levin S (1987) Towards a general theory of adaptive walks on rugged landscapes. J Theor Biol 128(1):11\u201345","journal-title":"J Theor Biol"},{"key":"1419_CR25","doi-asserted-by":"crossref","unstructured":"Khor S (2009) Exploring the influence of problem structural characteristics on evolutionary algorithm performance. In: 2009 IEEE Congress on evolutionary computation, vol 1\u20135. IEEE, Trondheim, pp 3345\u20133352","DOI":"10.1109\/CEC.2009.4983369"},{"issue":"1","key":"1419_CR26","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF01715809","volume":"1","author":"B Levitan","year":"1995","unstructured":"Levitan B, Kauffman S (1995) Adaptive walks with noisy fitness measurements. Mol Divers 1(1):53\u201368","journal-title":"Mol Divers"},{"key":"1419_CR27","unstructured":"Li J (2003) Research on fitness landscapes of genetic algorithms and GA-hardness. Tianjin University, Tian Jin"},{"key":"1419_CR28","doi-asserted-by":"crossref","unstructured":"Li K, Li M, Chen H (2013) An estimation method of optimal feature factor based on the balance of exploration and exploitation. In: Information and automation (ICIA), IEEE International Conference on 2013","DOI":"10.1109\/ICInfA.2013.6720318"},{"key":"1419_CR29","unstructured":"Lipsitch M (1991) Adaptation on rugged landscapes generated by local interactions of neighboring genes. In: Belew RK, Booker LB (eds) Proceedings of the 4th International Conference on genetic algorithms. Morgan Kaufmann, San Diego, pp 128\u2013135"},{"key":"1419_CR30","doi-asserted-by":"crossref","unstructured":"Malan KM, Engelbrecht AP (2009) Quantifying ruggedness of continuous landscapes using entropy. In: 2009 IEEE Congress on evolutionary computation, vol 1\u20135. Trondheim, Norway, pp 1440\u2013 1447","DOI":"10.1109\/CEC.2009.4983112"},{"key":"1419_CR31","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/j.ins.2013.04.015","volume":"241","author":"KM Malan","year":"2013","unstructured":"Malan KM, Engelbrecht AP (2013) A survey of techniques for characterising fitness landscapes and some possible ways forward. Inf Sci 241:148\u2013163","journal-title":"Inf Sci"},{"issue":"4","key":"1419_CR32","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/4235.887234","volume":"4","author":"P Merz","year":"2000","unstructured":"Merz P, Freisleben B (2000) Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Trans Evol Comput 4(4):337\u2013352","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"1419_CR33","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1162\/106365600568103","volume":"8","author":"P Merz","year":"2000","unstructured":"Merz P, Freisleben B (2000) Fitness landscapes, memetic algorithms, and Greedy operators for graph bipartitioning. Evol Comput 8(1):61\u201391","journal-title":"Evol Comput"},{"key":"1419_CR34","unstructured":"Merz P, Freisleben B (2001) Memetic algorithms for the traveling salesman problem. Complex Syst 13(4):279\u2013345"},{"key":"1419_CR35","doi-asserted-by":"crossref","unstructured":"Molina D, Herrera F, Lozano M (2005) Adaptive local search parameters for real-coded memetic algorithms. In: Evolutionary computation, 2005. The 2005 IEEE Congress","DOI":"10.1109\/CEC.2005.1554777"},{"issue":"1","key":"1419_CR36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/4235.843491","volume":"4","author":"B Naudts","year":"2000","unstructured":"Naudts B, Kallel L (2000) A comparison of predictive measures of problem difficulty in evolutionary algorithms. IEEE Trans Evol Comput 4(1):1\u201315","journal-title":"IEEE Trans Evol Comput"},{"key":"1419_CR37","unstructured":"Naudts B, Suys D, Verschoren A (1997) Epistasis as a basic concept in formal landscape analysis. In: Proceedings of the 7th International Conference on genetic algorithms. Morgan Kaufmann, pp 65\u201372"},{"key":"1419_CR38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.swevo.2011.11.003","volume":"2","author":"F Neri","year":"2012","unstructured":"Neri F, Cotta C (2012) Memetic algorithms and memetic computing optimization: a literature review. Swarm Evol Comput 2:1\u201314","journal-title":"Swarm Evol Comput"},{"key":"1419_CR39","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-23247-3","volume-title":"Handbook of memetic algorithm","author":"F Neri","year":"2012","unstructured":"Neri F, Cotta C, Moscato P (2012) Handbook of memetic algorithm. Springer, Berlin, Heidelberg"},{"key":"1419_CR40","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.ins.2013.03.026","volume":"239","author":"F Neri","year":"2013","unstructured":"Neri F, Mininno E, Lacca G (2013) Compact particle swarm optimization. Inf Sci 239:96\u2013121","journal-title":"Inf Sci"},{"key":"1419_CR41","doi-asserted-by":"crossref","unstructured":"Nguyen QH, Ong YS, Krasnogor N (2007) A study on the design issues of memetic algorithm. In: Evolutionary computation, 2007. CEC 2007. IEEE Congress","DOI":"10.1109\/CEC.2007.4424770"},{"issue":"2","key":"1419_CR42","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/MCI.2010.936309","volume":"5","author":"Y-S Ong","year":"2010","unstructured":"Ong Y-S, Lim M-H, Chen X (2010) Memetic computation: past, present and future (Research Frontier). Comput Intell Mag IEEE 5(2):24\u201331","journal-title":"Comput Intell Mag IEEE"},{"issue":"1","key":"1419_CR43","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1109\/TSMCB.2005.856143","volume":"36","author":"Y-S Ong","year":"2006","unstructured":"Ong Y-S, Lim M-H, Zhu N, Wong K-W (2006) Classification of adaptive memetic algorithms: a comparative study. Syst Man Cybernet Part B: Cybernet IEEE Trans 36(1):141\u2013152","journal-title":"Syst Man Cybernet Part B: Cybernet IEEE Trans"},{"key":"1419_CR44","unstructured":"Oppenheim AV, Willsky AS, Hamid S (1996) Signals and systems. Prentice Hall, Upper Saddle River, New Jersey, US"},{"key":"1419_CR45","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/j.ins.2013.03.060","volume":"241","author":"AP Piotrowski","year":"2013","unstructured":"Piotrowski AP (2013) Adaptive memetic differential evolution with global and local neighborhood-based mutation operators. Inf Sci 241:164\u2013194","journal-title":"Inf Sci"},{"key":"1419_CR46","unstructured":"Reeves CR, Wright CC (1995) Epistasis in genetic algorithms: an experimental design perspective. In: Proceedings of the 6th International Conference on genetic algorithms. Morgan Kaufmann, San Mateo, pp 217\u2013224"},{"issue":"2\u20133","key":"1419_CR47","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/S0096-3003(99)00166-6","volume":"117","author":"CM Reidys","year":"2001","unstructured":"Reidys CM, Stadler PF (2001) Neutrality in fitness landscapes. Appl Math Comput 117(2\u20133):321\u2013350","journal-title":"Appl Math Comput"},{"key":"1419_CR48","doi-asserted-by":"crossref","unstructured":"Rowe W, Corne D, Knowles J (2006) Predicting stochastic search algorithm performance using landscape state machines. In: 2006 IEEE Congress on evolutionary computation, vol 1\u20136, pp 2929\u20132936","DOI":"10.1109\/CEC.2006.1688679"},{"key":"1419_CR49","doi-asserted-by":"crossref","unstructured":"Seo DI, Choi SS, Moon BR (2004) New epistasis measures for detecting independently optimizable partitions of variables. In: Kalyanmoy D, Harman M, Holland O (eds) Genetic and evolutionary computation Conference 2004. Seattle, pp 26\u201330","DOI":"10.1007\/978-3-540-24855-2_14"},{"key":"1419_CR50","doi-asserted-by":"crossref","first-page":"1345","DOI":"10.1007\/3-540-45110-2_9","volume":"2724","author":"DI Seo","year":"2003","unstructured":"Seo DI, Kim Y-H, Moon B-R (2003) New entropy-based measures of gene significance and epistasis. Genetic Evol Comput\u2014Gecco 2003 Pt Ii Proc E CantuPaz FJA 2724:1345\u20131356","journal-title":"Genetic Evol Comput\u2014Gecco 2003 Pt Ii Proc E CantuPaz FJA"},{"key":"1419_CR51","doi-asserted-by":"crossref","unstructured":"Seo DI, Moon BR (2005) Computing the epistasis variance of large-scale traveling salesman problems. In: Beyer HG (ed) Gecco 2005: genetic and evolutionary computation Conference, vols 1 and 2. Assoc Computing Machinery, New York, pp 1169\u20131176","DOI":"10.1145\/1068009.1068203"},{"issue":"1","key":"1419_CR52","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1162\/106365602317301754","volume":"10","author":"T Smith","year":"2002","unstructured":"Smith T, Husbands P, Layzell P, O\u2019shea M (2002) Fitness landscapes and evolvability. Evol Comput 10(1):1\u201334","journal-title":"Evol Comput"},{"key":"1419_CR53","doi-asserted-by":"crossref","unstructured":"Stadler P, Institute S (1995) Towards a theory of landscapes. In: L\u00f3pez-Pe\u00f1a R, Waelbroeck H, Capovilla R, Garc\u00eda-Pelayo R, Zertuche F (eds) Complex systems and binary networks, vol 461\u2013461. Springer, Berlin, Heidelberg, pp 78\u2013163","DOI":"10.1007\/BFb0103571"},{"issue":"1","key":"1419_CR54","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01165154","volume":"20","author":"PF Stadler","year":"1996","unstructured":"Stadler PF (1996) Landscapes and their correlation functions. J Math Chem 20(1):1\u201345","journal-title":"J Math Chem"},{"key":"1419_CR55","unstructured":"Suganthan PN, Hansen N, Liang JJ, Deb K, Chen Y-P, Auger A, Tiwari S (2005) Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization. Singapore"},{"key":"1419_CR56","doi-asserted-by":"crossref","unstructured":"Sutton AM, Whitley D, Lunacek M, Howe A (2006) PSO and multi-funnel landscapes: how cooperation might limit exploration. In: Proceedings of the 8th annual conference on Genetic and evolutionary computation. ACM, Seattle, Washington, pp 75\u201382","DOI":"10.1145\/1143997.1144008"},{"key":"1419_CR57","doi-asserted-by":"crossref","unstructured":"Vassilev V, Fogarty T, Miller J (2003) Smoothness, ruggedness and neutrality of fitness landscapes: from theory to application. In: Ghosh A, Tsutsui S (eds) Advances in evolutionary computing. Springer, Berlin, Heidelberg, pp 3\u201344","DOI":"10.1007\/978-3-642-18965-4_1"},{"issue":"1","key":"1419_CR58","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1162\/106365600568095","volume":"8","author":"VK Vassilev","year":"2000","unstructured":"Vassilev VK, Fogarty TC, Miller JF (2000) Information characteristics and the structure of landscapes. Evol Comput 8(1):31\u201360","journal-title":"Evol Comput"},{"issue":"85","key":"1419_CR59","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1098\/rsif.2013.0352","volume":"10","author":"D Volchenkov","year":"2013","unstructured":"Volchenkov D, Helbach J, Tscherepanow M, Kuehnel S (2013) Exploration\u2013exploitation trade-off features a saltatory search behaviour. J R Soc Interface 10(85):1\u201312","journal-title":"J R Soc Interface"},{"issue":"5","key":"1419_CR60","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF00202749","volume":"63","author":"E Weinberger","year":"1990","unstructured":"Weinberger E (1990) Correlated and uncorrelated fitness landscapes and how to tell the difference. Biol Cybernet 63(5):325\u2013336","journal-title":"Biol Cybernet"},{"issue":"1","key":"1419_CR61","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1(1):67\u201382","journal-title":"IEEE Trans Evol Comput"},{"key":"1419_CR62","volume-title":"Evolutionary algorithms: schema, emergence and hardness","author":"H Yang","year":"2012","unstructured":"Yang H, Li J, Li M (2012) Evolutionary algorithms: schema, emergence and hardness. Science Press, Beijing"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-014-1419-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-014-1419-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-014-1419-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,15]],"date-time":"2023-07-15T23:08:40Z","timestamp":1689462520000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-014-1419-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,15]]},"references-count":62,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["1419"],"URL":"https:\/\/doi.org\/10.1007\/s00500-014-1419-1","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,15]]}}}