{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T03:53:52Z","timestamp":1760586832910},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,12,6]],"date-time":"2016-12-06T00:00:00Z","timestamp":1480982400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s11432-016-0089-7","type":"journal-article","created":{"date-parts":[[2016,12,12]],"date-time":"2016-12-12T02:00:48Z","timestamp":1481508048000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Feature based problem hardness understanding for requirements engineering","\u57fa\u4e8e\u95ee\u9898\u7279\u5f81\u7684\u9700\u6c42\u5de5\u7a0b\u95ee\u9898\u96be\u5ea6\u5206\u6790"],"prefix":"10.1007","volume":"60","author":[{"given":"Zhilei","family":"Ren","sequence":"first","affiliation":[]},{"given":"He","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Jifeng","family":"Xuan","sequence":"additional","affiliation":[]},{"given":"Shuwei","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Zhongxuan","family":"Luo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,12,6]]},"reference":[{"key":"89_CR1","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1109\/TCYB.2014.2334692","volume":"45","author":"W Gong","year":"2015","unstructured":"Gong W, Cai Z, Liang D. Adaptive ranking mutation operator based differential evolution for constrained optimization. IEEE Trans Cybern, 2015, 45: 716\u2013727","journal-title":"IEEE Trans Cybern"},{"key":"89_CR2","doi-asserted-by":"crossref","first-page":"2066","DOI":"10.1109\/TCYB.2013.2239988","volume":"43","author":"W Gong","year":"2013","unstructured":"Gong W, Cai Z. Differential evolution with ranking-based mutation operators. IEEE Trans Cybern, 2013, 43: 2066\u20132081","journal-title":"IEEE Trans Cybern"},{"key":"89_CR3","first-page":"1014","volume":"45","author":"C Luo","year":"2015","unstructured":"Luo C, Cai S, Su K, et al. Clause states based configuration checking in local search for satisfiability. IEEE Trans Cybern, 2015, 45: 1014\u20131027","journal-title":"IEEE Trans Cybern"},{"key":"89_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TSE.2012.17","volume":"39","author":"WN Chen","year":"2013","unstructured":"Chen WN, Zhang J. Ant colony optimization for software project scheduling and staffing with an event-based scheduler. IEEE Trans Softw Eng, 2013, 39: 1\u201317","journal-title":"IEEE Trans Softw Eng"},{"key":"89_CR5","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1109\/TCYB.2014.2360680","volume":"45","author":"S Haeri","year":"2015","unstructured":"Haeri S, Trajkovic L. Intelligent deflection routing in buffer-less networks. IEEE Trans Cybern, 2015, 45: 316\u2013327","journal-title":"IEEE Trans Cybern"},{"key":"89_CR6","unstructured":"Tang K, Yang P, Yao X. Negatively correlated cooperative search. arXiv:1504.04914"},{"key":"89_CR7","doi-asserted-by":"crossref","first-page":"1333","DOI":"10.1145\/1830483.1830730","volume-title":"Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, Portland","author":"H Jiang","year":"2010","unstructured":"Jiang H, Xuan J, Ren Z. Approximate backbone based multilevel algorithm for next release problem. In: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, Portland, 2010. 1333\u20131340"},{"key":"89_CR8","first-page":"6","volume":"41","author":"K A Smith-Miles","year":"2008","unstructured":"Smith-Miles K A. Cross-disciplinary perspectives on meta-learning for algorithm selection. ACM Comput Surv, 2008, 41: 6","journal-title":"ACM Comput Surv"},{"key":"89_CR9","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s10472-011-9230-5","volume":"61","author":"K A Smith-Miles","year":"2011","unstructured":"Smith-Miles K A, van Hemert J I. Discovering the suitability of optimisation algorithms by learning from evolved instances. Ann Math Artif Intell, 2011, 61: 87\u2013104","journal-title":"Ann Math Artif Intell"},{"key":"89_CR10","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/s10472-013-9341-2","volume":"69","author":"O Mersmann","year":"2013","unstructured":"Mersmann O, Bischl B, Trautmann H, et al. A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem. Ann Math Artif Intell, 2013, 69: 151\u2013182","journal-title":"Ann Math Artif Intell"},{"key":"89_CR11","first-page":"4118","volume-title":"Prcoeedings of International Joint Conference on Neural Networks, Hong Kong","author":"K A Smith-Miles","year":"2008","unstructured":"Smith-Miles K A. Towards insightful algorithm selection for optimisation using meta-learning concepts. In: Prcoeedings of International Joint Conference on Neural Networks, Hong Kong, 2008. 4118\u20134124"},{"key":"89_CR12","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1162\/evco.2006.14.4.433","volume":"14","author":"J I Hemert van","year":"2006","unstructured":"van Hemert J I. Evolving combinatorial problem instances that are difficult to solve. Evol Comput, 2006, 14: 433\u2013462","journal-title":"Evol Comput"},{"key":"89_CR13","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1023\/A:1019956318069","volume":"18","author":"R Vilalta","year":"2002","unstructured":"Vilalta R, Drissi Y. A perspective view and survey of meta-learning. Artif Intell Rev, 2002, 18: 77\u201395","journal-title":"Artif Intell Rev"},{"key":"89_CR14","first-page":"1826","volume-title":"Proceedings of the 29th AAAI Conference on Artificial Intelligence, Austin Texas","author":"R J Oentaryo","year":"2015","unstructured":"Oentaryo R J, Handoko S D, Lau H C. Algorithm selection via ranking. In: Proceedings of the 29th AAAI Conference on Artificial Intelligence, Austin Texas, 2015. 1826\u20131832"},{"key":"89_CR15","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/978-3-540-31996-2_12","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"J I Hemert van","year":"2005","unstructured":"van Hemert J I. Property analysis of symmetric travelling salesman problem instances acquired through evolution. In: Evolutionary Computation in Combinatorial Optimization. Berlin: Springer, 2005. 122\u2013131"},{"key":"89_CR16","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1109\/TSE.2011.92","volume":"38","author":"J Xuan","year":"2012","unstructured":"Xuan J, Jiang H, Ren Z, et al. Solving the large scale next release problem with a backbone-based multilevel algorithm. IEEE Trans Softw Eng, 2012, 38: 1195\u20131212","journal-title":"IEEE Trans Softw Eng"},{"key":"89_CR17","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1109\/TSC.2016.2560165","volume":"9","author":"L Nie","year":"2016","unstructured":"Nie L, Jiang H, Ren Z, et al. Query expansion based on crowd knowledge for code search. IEEE Trans Serv Comput, 2016, 9: 771\u2013783","journal-title":"IEEE Trans Serv Comput"},{"key":"89_CR18","doi-asserted-by":"crossref","unstructured":"Xuan J F, Martinez M, DeMarco F, et al. Nopol: automatic repair of conditional statement bugs in java programs. IEEE Trans Softw Eng, in press. doi: 10.1109\/TSE.2016.2560811","DOI":"10.1109\/TSE.2016.2560811"},{"key":"89_CR19","doi-asserted-by":"crossref","first-page":"883","DOI":"10.1016\/S0950-5849(01)00194-X","volume":"43","author":"A J Bagnall","year":"2001","unstructured":"Bagnall A J, Rayward-Smith V J, Whittley I M. The next release problem. Inf Softw Tech, 2001, 43: 883\u2013890","journal-title":"Inf Softw Tech"},{"key":"89_CR20","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/j.infsof.2003.07.002","volume":"46","author":"D Greer","year":"2004","unstructured":"Greer D, Ruhe G. Software release planning: an evolutionary and iterative approach. Inf Softw Tech, 2004, 46: 243\u2013253","journal-title":"Inf Softw Tech"},{"key":"89_CR21","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1145\/2568225.2568306","volume-title":"Proceedings of the 36th International Conference on Software Engineering, Hyderabad","author":"A Ignatiev","year":"2014","unstructured":"Ignatiev A, Janota M, Marques-Silva J. Towards efficient optimization in package management systems. In: Proceedings of the 36th International Conference on Software Engineering, Hyderabad, 2014. 745\u2013755"},{"key":"89_CR22","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1109\/TCYB.2013.2256892","volume":"44","author":"J Sun","year":"2014","unstructured":"Sun J, Zhang Q, Yao X. Meta-heuristic combining prior online and offline information for the quadratic assignment problem. IEEE Trans Cybern, 2014, 44: 429\u2013444","journal-title":"IEEE Trans Cybern"},{"key":"89_CR23","doi-asserted-by":"crossref","first-page":"1747","DOI":"10.1109\/TCYB.2013.2294185","volume":"44","author":"Z Ren","year":"2014","unstructured":"Ren Z, Jiang H, Xuan J, et al. New insights into diversification of hyper-heuristics. IEEE Trans Cybern, 2014, 44: 1747\u20131761","journal-title":"IEEE Trans Cybern"},{"key":"89_CR24","doi-asserted-by":"crossref","first-page":"1011","DOI":"10.1109\/TSMCB.2012.2222373","volume":"43","author":"WF Gao","year":"2013","unstructured":"Gao WF, Liu S Y, Huang L L. A novel artificial bee colony algorithm based on modified search equation and orthogonal learning. IEEE Trans Cybern, 2013, 43: 1011\u20131024","journal-title":"IEEE Trans Cybern"},{"key":"89_CR25","doi-asserted-by":"crossref","first-page":"1127","DOI":"10.1109\/TCYB.2013.2279802","volume":"44","author":"Z Ren","year":"2014","unstructured":"Ren Z, Zhang A, Wen C, et al. A scatter learning particle swarm optimization algorithm for multimodal problems. IEEE Trans Cybern, 2014, 44: 1127\u20131140","journal-title":"IEEE Trans Cybern"},{"key":"89_CR26","first-page":"166","volume-title":"Proceedings of the 2nd International Conference on Software Engineering and Data Mining, Chengdu","author":"J He","year":"2010","unstructured":"He J, Zhang J Y, Xuan J F, et al. A hybrid ACO algorithm for the next release problem. In: Proceedings of the 2nd International Conference on Software Engineering and Data Mining, Chengdu, 2010. 166\u2013171"},{"key":"89_CR27","first-page":"203","volume-title":"Search-Based Software Engineering","author":"J He","year":"2015","unstructured":"He J, Ren Z L, Li X C, et al. Transformed search based software engineering: a new paradigm of sbse. In: Search-Based Software Engineering. Berlin: Springer, 2015. 203\u2013218"},{"key":"89_CR28","first-page":"1267","volume-title":"Proceedings of Congress on Evolutionary Computation, Canberra","author":"J I Hemert van","year":"2003","unstructured":"van Hemert J I. Evolving binary constraint satisfaction problem instances that are difficult to solve. In: Proceedings of Congress on Evolutionary Computation, Canberra, 2003. 1267\u20131273"},{"key":"89_CR29","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1145\/1569901.1569941","volume-title":"Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation, Montreal","author":"B A Julstrom","year":"2009","unstructured":"Julstrom B A. Evolving heuristically difficult instances of combinatorial problems. In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation, Montreal, 2009. 279\u2013286"},{"key":"89_CR30","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1007\/978-3-642-25566-3_41","volume-title":"Proceedings of the 5th International Conference on Learning and Intelligent Optimization, Rome","author":"K A Smith-Miles","year":"2011","unstructured":"Smith-Miles K A, Lopes L. Generalising algorithm performance in instance space: a timetabling case study. In: Proceedings of the 5th International Conference on Learning and Intelligent Optimization, Rome, 2011. 524\u2013538"},{"key":"89_CR31","doi-asserted-by":"crossref","first-page":"1436","DOI":"10.1145\/1276958.1277222","volume-title":"Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation","author":"C D Toledo-Su\u00e1rez","year":"2007","unstructured":"Toledo-Su\u00e1rez C D, Valenzuela-Rend\u00f3n M, Terashima-Mar\u00edn H, et al. On the relativity in the assessment of blind optimization algorithms and the problem-algorithm coevolution. In: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation. New York: ACM, 2007. 1436\u20131443"},{"key":"89_CR32","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1287\/opre.1070.0398","volume":"55","author":"N G Hall","year":"2007","unstructured":"Hall N G, Posner M E. Performance prediction and preselection for optimization and heuristic solution procedures. Oper Res, 2007, 55: 703\u2013716","journal-title":"Oper Res"},{"key":"89_CR33","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/1538902.1538906","volume":"56","author":"K Leyton-Brown","year":"2009","unstructured":"Leyton-Brown K, Nudelman E, Shoham Y. Empirical hardness models: methodology and a case study on combinatorial auctions. J ACM, 2009, 56: 22","journal-title":"J ACM"},{"key":"89_CR34","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/978-3-642-30671-6_16","volume-title":"Hybrid Metaheuristics","author":"K Smith-Miles","year":"2013","unstructured":"Smith-Miles K, Wreford B, Lopes L, et al. Predicting metaheuristic performance on graph coloring problems using data mining. In: Hybrid Metaheuristics. Berlin: Springer, 2013. 417\u2013432"},{"key":"89_CR35","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1145\/2460239.2460253","volume-title":"Proceedings of the 12th Workshop on Foundations of Genetic Algorithms XII","author":"S Nallaperuma","year":"2013","unstructured":"Nallaperuma S, Wagner M, Neumann F, et al. A feature-based comparison of local search and the christofides algorithm for the travelling salesperson problem. In: Proceedings of the 12th Workshop on Foundations of Genetic Algorithms XII. New York: ACM, 2013. 147\u2013160"},{"key":"89_CR36","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.cor.2013.11.015","volume":"45","author":"K Smith-Miles","year":"2014","unstructured":"Smith-Miles K, Baatar D, Wreford B, et al. Towards objective measures of algorithm performance across instance space. Comput Oper Res, 2014, 45: 12\u201324","journal-title":"Comput Oper Res"},{"key":"89_CR37","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1109\/TSE.2008.80","volume":"35","author":"G Ruhe","year":"2009","unstructured":"Ruhe G, Ngo-The A. Optimized resource allocation for software release planning. IEEE Trans Softw Eng, 2009, 35: 109\u2013123","journal-title":"IEEE Trans Softw Eng"},{"key":"89_CR38","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1109\/TSMCB.2009.2020206","volume":"39","author":"L Wen","year":"2009","unstructured":"Wen L, Dromey R, Kirk D. Software engineering and scale-free networks. IEEE Trans Syst Man Cybern, 2009, 39: 845\u2013854","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"89_CR39","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1287\/opre.47.4.570","volume":"47","author":"D Pisinger","year":"1999","unstructured":"Pisinger D. Core problems in knapsack algorithms. Oper Res, 1999, 47: 570\u2013575","journal-title":"Oper Res"},{"key":"89_CR40","doi-asserted-by":"crossref","first-page":"2271","DOI":"10.1016\/j.cor.2004.03.002","volume":"32","author":"D Pisinger","year":"2005","unstructured":"Pisinger D. Where are the hard knapsack problems? Comput Oper Res, 2005, 32: 2271\u20132284","journal-title":"Comput Oper Res"},{"key":"89_CR41","doi-asserted-by":"crossref","first-page":"1130","DOI":"10.1287\/opre.28.5.1130","volume":"28","author":"E Balas","year":"1980","unstructured":"Balas E, Zemel E. An algorithm for large zero-one knapsack problems. Oper Res, 1980, 28: 1130\u20131154","journal-title":"Oper Res"},{"key":"89_CR42","volume-title":"Ridge: Ridge Regression With Automatic Selection of The Penalty Parameter","author":"E Cule","year":"2014","unstructured":"Cule E. Ridge: Ridge Regression With Automatic Selection of The Penalty Parameter, 2014. R package version 2.1-3. https:\/\/cran.r-project.org\/src\/contrib\/Archive\/ridge\/"},{"key":"89_CR43","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1214\/aos\/1176347963","volume":"19","author":"J H Friedman","year":"1991","unstructured":"Friedman J H. Multivariate adaptive regression splines1. Ann Stat, 1991, 19: 1\u2013141","journal-title":"Ann Stat"},{"key":"89_CR44","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman L. Random forests. Mach Learn, 2001, 45: 5\u201332","journal-title":"Mach Learn"},{"key":"89_CR45","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.artint.2013.10.003","volume":"206","author":"F Hutter","year":"2014","unstructured":"Hutter F, Xu L, Hoos H H, et al. Algorithm runtime prediction: methods & evaluation. Artif Intell, 2014, 206: 79\u2013111","journal-title":"Artif Intell"},{"key":"89_CR46","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1002\/gepi.21750","volume":"37","author":"E Cule","year":"2013","unstructured":"Cule E, de Iorio M. Ridge regression in prediction problems: automatic choice of the ridge parameter. Genetic Epidemiol, 2013, 37: 704\u2013714","journal-title":"Genetic Epidemiol"},{"key":"89_CR47","volume-title":"The Irace Package, Iterated Race for Automatic Algorithm Configuration","author":"M L\u00f3pez-Ib\u00e1nez","year":"2011","unstructured":"L\u00f3pez-Ib\u00e1nez M, Dubois-Lacoste J, St\u00fctzle T, et al. The Irace Package, Iterated Race for Automatic Algorithm Configuration. Technical Report Technical Report TR\/IRIDIA\/2011-004, IRIDIA, Universit\u00e9 Libre de Bruxelles, Belgium, 2011"},{"key":"89_CR48","volume-title":"Caret: Classification and Regression Training","author":"M Kuhn","year":"2012","unstructured":"Kuhn M. Caret: Classification and Regression Training, 2012. R package version 5.15-044. https:\/\/cran.r-project.org\/ src\/contrib\/Archive\/caret\/"},{"key":"89_CR49","volume-title":"Earth: Multivariate Adaptive Regression Splines","author":"S Milborrow","year":"2015","unstructured":"Milborrow S. Earth: Multivariate Adaptive Regression Splines, 2015. R package version 4.4.2. https:\/\/cran.r-project. org\/src\/contrib\/Archive\/earth\/"},{"key":"89_CR50","first-page":"18","volume":"2","author":"A Liaw","year":"2002","unstructured":"Liaw A, Wiener M. Classification and regression by randomforest. R News, 2002, 2: 18\u201322","journal-title":"R News"},{"key":"89_CR51","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/978-3-319-13563-2_19","volume-title":"Simulated Evolution and Learning. Berlin: Springer","author":"H Jiang","year":"2014","unstructured":"Jiang H, Sun W, Ren Z, et al. Evolving hard and easy traveling salesman problem instances: a multi-objective approach. In: Simulated Evolution and Learning. Berlin: Springer, 2014. 216\u2013227"},{"key":"89_CR52","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1109\/TSMCB.2012.2214382","volume":"43","author":"X Sun","year":"2013","unstructured":"Sun X, Gong D, Jin Y, et al. A new surrogate-assisted interactive genetic algorithm with weighted semisupervised learning. IEEE Trans Cybern, 2013, 43: 685\u2013698","journal-title":"IEEE Trans Cybern"},{"key":"89_CR53","doi-asserted-by":"crossref","first-page":"746","DOI":"10.1109\/TEVC.2015.2449293","volume":"19","author":"W Gong","year":"2015","unstructured":"Gong W, Zhou A, Cai Z. A multioperator search strategy based on cheap surrogate models for evolutionary optimization. IEEE Trans Evol Comput, 2015, 19: 746\u2013758","journal-title":"IEEE Trans Evol Comput"},{"key":"89_CR54","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1007\/978-3-319-10762-2_10","volume-title":"Parallel Problem Solving from Nature\u2013PPSN XIII","author":"S Nallaperuma","year":"2014","unstructured":"Nallaperuma S, Wagner M, Neumann F. Parameter prediction based on features of evolved instances for ant colony optimization and the traveling salesperson problem. In: Parallel Problem Solving from Nature\u2013PPSN XIII. Berlin: Springer, 2014. 100\u2013109"},{"key":"89_CR55","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.ins.2014.03.105","volume":"279","author":"K Tang","year":"2014","unstructured":"Tang K, Peng F, Chen G, et al. Population-based algorithm portfolios with automated constituent algorithms selection. Inf Sci, 2014, 279: 94\u2013104","journal-title":"Inf Sci"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-016-0089-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-016-0089-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-016-0089-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T03:55:56Z","timestamp":1718942156000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-016-0089-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,6]]},"references-count":55,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["89"],"URL":"https:\/\/doi.org\/10.1007\/s11432-016-0089-7","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,12,6]]},"article-number":"032105"}}