{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,20]],"date-time":"2023-08-20T23:31:57Z","timestamp":1692574317801},"reference-count":70,"publisher":"Hindawi Limited","issue":"2","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":2800,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Intell. Syst."],"published-print":{"date-parts":[[2008,2]]},"DOI":"10.1002\/int.20258","type":"journal-article","created":{"date-parts":[[2008,1,14]],"date-time":"2008-01-14T17:54:24Z","timestamp":1200333264000},"page":"246-268","source":"Crossref","is-referenced-by-count":7,"title":["Real-parameter crossover operators with multiple descendents: An experimental study"],"prefix":"10.1155","volume":"23","author":[{"given":"A. M.","family":"S\u00e1nchez","sequence":"first","affiliation":[]},{"given":"M.","family":"Lozano","sequence":"additional","affiliation":[]},{"given":"C.","family":"Garc\u00eda-Mart\u00ednez","sequence":"additional","affiliation":[]},{"given":"D.","family":"Molina","sequence":"additional","affiliation":[]},{"given":"F.","family":"Herrera","sequence":"additional","affiliation":[]}],"member":"98","published-online":{"date-parts":[[2008]]},"reference":[{"key":"10.1002\/int.20258-BIB1","volume-title":"Adaptation in natural and artificial systems","author":"Holland","year":"1975","unstructured":"Adaptation in natural and artificial systems. Ann Arbor, MI: The University of Michigan Press; 1975. (London: The MIT Press; 1992)."},{"key":"10.1002\/int.20258-BIB2","volume-title":"Genetic algorithms in search, optimization, and machine learning","author":"Goldberg","year":"1989","unstructured":"Genetic algorithms in search, optimization, and machine learning. Reading, MA: Addison-Wesley; 1989."},{"key":"10.1002\/int.20258-BIB3","volume-title":"Handbook of genetic algorithms","author":"Davis","year":"1991","unstructured":"Handbook of genetic algorithms. New York: Van Nostrand Reinhold; 1991."},{"key":"10.1002\/int.20258-BIB4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02830-8","volume-title":"Genetic algorithms + data structures = Evolutionary programs","author":"Michalewicz","year":"1992","unstructured":"Genetic algorithms + data structures = Evolutionary programs. Berlin: Springer-Verlag; 1992."},{"key":"10.1002\/int.20258-BIB5","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1023\/A:1006504901164","volume":"12","author":"Herrera","year":"1998","journal-title":"Artif Intell Rev"},{"key":"10.1002\/int.20258-BIB6","volume-title":"Multi-objective optimization using evolutionary algorithms","author":"Deb","year":"2001","unstructured":"Multi-objective optimization using evolutionary algorithms. Chichester, UK: Wiley; 2001."},{"key":"10.1002\/int.20258-BIB7","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1007\/s00500-004-0377-4","volume":"9","author":"Deb","year":"2005","journal-title":"Soft Comput"},{"key":"10.1002\/int.20258-BIB8","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1023\/A:1009626110229","volume":"6","author":"Chelouah","year":"2000","journal-title":"J Heuristics"},{"key":"10.1002\/int.20258-BIB9","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s005000000045","volume":"4","author":"Yang","year":"2000","journal-title":"Soft Comput"},{"key":"10.1002\/int.20258-BIB10","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s00500-004-0376-5","volume":"9","author":"Hart","year":"2005","journal-title":"Soft Comput"},{"key":"10.1002\/int.20258-BIB11","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/s00500-004-0380-9","volume":"9","author":"Herrera","year":"2005","journal-title":"Soft Comput"},{"key":"10.1002\/int.20258-BIB12","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1007\/s00500-004-0379-2","volume":"9","author":"Herv\u00e1s-Mart\u00ednez","year":"2005","journal-title":"Soft Comput"},{"key":"10.1002\/int.20258-BIB13","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1007\/s00500-004-0378-3","volume":"9","author":"Someya","year":"2005","journal-title":"Soft Comput"},{"key":"10.1002\/int.20258-BIB14","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s00500-004-0381-8","volume":"9","author":"Winter","year":"2005","journal-title":"Soft Comput"},{"key":"10.1002\/int.20258-BIB15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01530777","volume":"5","author":"De Jong","year":"1992","journal-title":"Ann Math Artif Intell"},{"key":"10.1002\/int.20258-BIB16","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01530778","volume":"5","author":"Liepins","year":"1992","journal-title":"Ann Math Artif Intell"},{"key":"10.1002\/int.20258-BIB17","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1162\/106365601750190415","volume":"9","author":"Kita","year":"2001","journal-title":"Evol Comput"},{"key":"10.1002\/int.20258-BIB18","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1002\/int.10091","volume":"18","author":"Herrera","year":"2003","journal-title":"Int J Intell Syst"},{"key":"10.1002\/int.20258-BIB19","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1109\/4235.843494","volume":"4","author":"Herrera","year":"2000","journal-title":"IEEE Trans. Evol Comput"},{"key":"10.1002\/int.20258-BIB20","first-page":"3","volume-title":"natural automata and useful simulations","author":"Bremermann","year":"1966","unstructured":", . Global properties of evolution processes. In: , , , editors. natural automata and useful simulations. Washington, DC: Spartan; 1966. pp 3\u201341."},{"key":"10.1002\/int.20258-BIB21","first-page":"187","volume-title":"Foundations of genetic algorithms","volume":"2","author":"Eshelman","year":"1993","unstructured":". Real-coded genetic algorithms and interval-schemata. In: editor. Foundations of genetic algorithms 2. San Mateo, CA: Morgan Kaufmann; 1993. pp 187\u2013202."},{"key":"10.1002\/int.20258-BIB22","author":"Ballester","year":"2004","unstructured":". An effective real-parameter genetic algorithm with parent centric normal crossover for multimodal optimisation. In: Proc Genetic and Evolutionary Computation Conf. 2004. Lecture Notes in Computer Science 3102; Berlin: Springer-Verlag; 2004. pp 901\u2013913."},{"key":"10.1002\/int.20258-BIB23","first-page":"104","volume-title":"Fuzzy recombination for the breeder genetic algorithm","author":"Voigt","year":"1995","unstructured":", . Fuzzy recombination for the breeder genetic algorithm. In: editor. Proc Sixth Int. Conf. on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann; 1995. pp 104\u2013111."},{"key":"10.1002\/int.20258-BIB24","first-page":"205","volume-title":"Foundations of genetic algorithms","volume":"1","author":"Wright","year":"1991","unstructured":"Genetic algorithms for real parameter optimization. In: editor. Foundations of genetic algorithms 1. San Mateo, CA: Morgan Kaufmann; 1991. pp 205\u2013218."},{"key":"10.1002\/int.20258-BIB25","first-page":"47","volume-title":"Advances in genetic programming","author":"Altenberg","year":"1994","unstructured":"The evolution of evoluability in genetic programming. In: editor. Advances in genetic programming. Cambridge, MA MIT Press; 1994. pp 47\u201374."},{"key":"10.1002\/int.20258-BIB26","first-page":"271","volume-title":"Foundations of genetic algorithms","volume":"3","author":"Tackett","year":"1994","unstructured":"Greedy recombination and genetic search on the space of computer programs. In: Foundations of genetic algorithms 3. San Francisco, CA: Morgan Kaufmann; 1994. pp 271\u2013297."},{"key":"10.1002\/int.20258-BIB27","author":"Satoh","year":"1996","unstructured":", . Minimal generation gap model for GAs considering both exploration and exploitation. In: Proc. Methodologies for the Conception, Design and Application of Intelligent Systems (IIZUKA'96); 1996. pp 494\u2013497."},{"key":"10.1002\/int.20258-BIB28","first-page":"103","volume-title":"Multiple crossover per couple in genetic algorithms","author":"Esquivel","year":"1997","unstructured":", . Multiple crossover per couple in genetic algorithms. In: Proc 4th IEEE Int. Conf. on Evolutionary Computation (ICEC'97). Piscataway, NJ: IEEE Press; 1997. pp 103\u2013106."},{"key":"10.1002\/int.20258-BIB29","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0165-0114(96)00179-0","volume":"92","author":"Herrera","year":"1997","journal-title":"Fuzzy set Syst"},{"key":"10.1002\/int.20258-BIB30","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1162\/106365602760972767","volume":"10","author":"Deb","year":"2002","journal-title":"Evol Comput J"},{"key":"10.1002\/int.20258-BIB31","series-title":"Lecture Notes","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1007\/3-540-36131-6_40","volume-title":"Advances in artificial intelligence\u2014IBERAMIA 2002","volume":"2527","author":"Herrera","year":"2002","unstructured":", , , . Multiple crossover per couple with crossover selection of the two best offspring: An experimental study with the BLX- operator for real-coded genetic algorithms. In: , , editors. Advances in artificial intelligence\u2014IBERAMIA 2002. Lecture Notes in Artificial Intelligence, vol 2527. Berlin: Springer-Verlag; 2002. pp 392-401."},{"key":"10.1002\/int.20258-BIB32","series-title":"Lecture Notes","first-page":"706","volume-title":"Real-parameter genetic algorithms for finding multiple optimal solutions in multi-modal optimization","volume":"2723","author":"Ballester","year":"2003","unstructured":". Real-parameter genetic algorithms for finding multiple optimal solutions in multi-modal optimization. In: , editors. Proc. of the Genetic and Evolutionary Computation Conference. Lecture Notes in Computer Science, vol 2723; Berlin: Springer-Verlag 2003. pp 706\u2013717."},{"key":"10.1002\/int.20258-BIB33","author":"Ballester","year":"2005","unstructured":", , . Real-parameter optimization performance study on the CEC-2005 benchmark with SPC-PNX. In: Proc 2005 IEEE Congress on Evolutionary Computation. Piscataway, NJ: IEEE Press; 2005. pp. 498\u2013505."},{"key":"10.1002\/int.20258-BIB34","author":"Sinha","year":"2005","unstructured":", . A population-based, steady-state procedure for real-parameter optimization evolutionary computation, 2005. In: Proc 2005 IEEE Congress on Evolutionary Computation. Piscataway, NJ: IEEE Press; 2005. pp 514\u2013521."},{"key":"10.1002\/int.20258-BIB35","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1162\/1063656041774983","volume":"12","author":"Lozano","year":"2004","journal-title":"Evol Comput J"},{"key":"10.1002\/int.20258-BIB36","first-page":"219","volume-title":"New ideas in optimization","author":"Moscato","year":"1999","unstructured":"Memetic algorithms: A short introduction. In: , , editors. New ideas in optimization. London: McGraw-Hill; 1999. pp. 219\u2013234."},{"key":"10.1002\/int.20258-BIB37","first-page":"573","volume-title":"Hybridized crossover-based search techniques for program discovery","author":"O'Reilly","year":"1995","unstructured":". Hybridized crossover-based search techniques for program discovery. In: IEEE Int Conf on Evolutionary Computation 1995. Piscataway, NJ: IEEE Press; 1995. pp 573\u2013578."},{"key":"10.1002\/int.20258-BIB38","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1007\/3-211-27389-1_52","volume-title":"Adaptive and natural computing algorithms","author":"Affenzeller","year":"2005","unstructured":". Offspring selection: A new self-adaptive selection scheme for genetic algorithms. In: Adaptive and natural computing algorithms. Berlin: Springer-Verlag: 2005. pp 218\u2013221."},{"key":"10.1002\/int.20258-BIB39","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1162\/106365601750406000","volume":"9","author":"Nomura","year":"2001","journal-title":"Evol Comput J"},{"key":"10.1002\/int.20258-BIB40","doi-asserted-by":"crossref","first-page":"1088","DOI":"10.1016\/j.ejor.2006.06.043","volume":"185","author":"Garc\u00eda-Mart\u00ednez","year":"2008","journal-title":"Eur J Oper Res."},{"key":"10.1002\/int.20258-BIB41","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1109\/4235.930314","volume":"5","author":"Beyer","year":"2001","journal-title":"IEEE Trans Evol Comput"},{"key":"10.1002\/int.20258-BIB42","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/4235.918435","volume":"5","author":"Herrera","year":"2001","journal-title":"IEEE Trans Evol Comput"},{"key":"10.1002\/int.20258-BIB43","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1162\/106365601750190406","volume":"9","author":"Deb","year":"2001","journal-title":"Evol Comput J"},{"key":"10.1002\/int.20258-BIB44","volume-title":"Genetic Programming","author":"Koza","year":"1992","unstructured":"Genetic Programming. Cambridge, MA: MIT Press; 1992."},{"key":"10.1002\/int.20258-BIB45","first-page":"141","volume-title":"Actas del Primer Congreso de Ciencias de la Computaci\u00f3n","author":"Esquivel","year":"1995","unstructured":", . MPC: Another approach to crossover in genetic algorithms. In: Actas del Primer Congreso de Ciencias de la Computaci\u00f3n; 1995. pp 141\u2013150."},{"key":"10.1002\/int.20258-BIB46","first-page":"1589","volume-title":"Multiple crossovers between multiple parents to improve search in evolutionary algorithms","author":"Esquivel","year":"1999","unstructured":", . Multiple crossovers between multiple parents to improve search in evolutionary algorithms. In: Proc 1999 Cong. on Evolutionary computation. Piscataway, NJ: IEEE Press; 1999. pp 1589\u20131594."},{"key":"10.1002\/int.20258-BIB47","first-page":"85","volume-title":"Multiplicity in genetic algorithms to face multicriteria optimization","author":"Esquivel","year":"1999","unstructured":", . Multiplicity in genetic algorithms to face multicriteria optimization. In: Proc 1999 Cong. on Evolutionary Computation. Piscataway, NJ: IEEE Press; 1999. pp 85\u201390."},{"key":"10.1002\/int.20258-BIB48","first-page":"7","volume-title":"Multiplicity and local search in evolutionary algorithms to build the Pareto front","author":"Leiva","year":"2000","unstructured":", . Multiplicity and local search in evolutionary algorithms to build the Pareto front. In: Proc XX Int Conf. of the Chilean Computer Science Society. Piscataway, NJ: IEEE Press; 2000. pp. 7\u201313."},{"key":"10.1002\/int.20258-BIB49","first-page":"12","volume":"15","author":"Esquivel","year":"2002","journal-title":"J Know Based Syst"},{"key":"10.1002\/int.20258-BIB50","series-title":"Lecture Notes","first-page":"813","volume-title":"Proc Parallel problem solving from nature","volume":"V1498","author":"Walters","year":"1998","unstructured":"Repair and brood selection in the traveling salesman problem. In: , , , editors. Proc Parallel problem solving from nature, vol V. Berlin: Springer-Verlag. Lecture Notes in Computer Science vol 1498; 1998. pp 813\u2013822."},{"key":"10.1002\/int.20258-BIB51","first-page":"646","volume-title":"Multi-parental extension of the unimodal normal distribution crossover for real-coded genetic algorithms","author":"Kita","year":"1999","unstructured":". Multi-parental extension of the unimodal normal distribution crossover for real-coded genetic algorithms. In: Proc Int Conf. on Evolutionary Computation'99. Piscataway, NJ: IEEE Press; 1999. pp 646\u2013651."},{"key":"10.1002\/int.20258-BIB52","first-page":"619","volume-title":"A distance alternation model on real-coded genetic algorithms","author":"Takahashi","year":"1999","unstructured":", . A distance alternation model on real-coded genetic algorithms. In: Proc 1999 IEEE Int Conf on Systems, Man, and Cybernetics. Piscataway, NJ: IEEE Press; 1999. pp 619\u2013624."},{"key":"10.1002\/int.20258-BIB53","first-page":"657","volume-title":"Multi-parent recombination with simplex crossover in real-coded genetic algorithms","author":"Tsutsui","year":"1999","unstructured":", . Multi-parent recombination with simplex crossover in real-coded genetic algorithms. In: Proc Genetic and Evolutionary Computation Conf (GECCO-99). San Mateo, CA: Morgan Kaufmann, 1999. pp 657\u2013664."},{"key":"10.1002\/int.20258-BIB54","first-page":"1","volume-title":"Multi-objective and MGG evolutionary algorithm for constrained optimization","author":"Zhou","year":"2003","unstructured":", , . Multi-objective and MGG evolutionary algorithm for constrained optimization. In: Congress on evolutionary computation 2003. Piscataway, NJ: IEEE Press; 2003. pp. 1\u20135."},{"key":"10.1002\/int.20258-BIB55","author":"Takahashi","year":"2004","unstructured":". An angular distance dependent alternation model for real-coded genetic algorithms. In: Proc Congress on Evolutionary Computation 2004. Piscataway, NJ: IEEE Press; 2004. pp 2159\u20132165."},{"key":"10.1002\/int.20258-BIB56","first-page":"101","volume-title":"Adaptative selection methods for genetic algorithms","author":"Baker","year":"1985","unstructured":"Adaptative selection methods for genetic algorithms. In: editor. Proc. First Int Conf on Genetic Algorithms and Their Applications. Hillsdale, MA: Lawrence Erlbraum Associates; 1985, pp 101\u2013111."},{"key":"10.1002\/int.20258-BIB57","first-page":"14","volume-title":"Reducing bias and inefficiency in the selection algorithm","author":"Baker","year":"1987","unstructured":"Reducing bias and inefficiency in the selection algorithm. In: editor. Proc Second Int Conf on Genetic Algorithms and Their Applications. Hillsdale, MA: Lawrence Erlbraum Associates; 1987. pp 14\u201321."},{"key":"10.1002\/int.20258-BIB58","author":"De Jong","year":"1975","unstructured":"An analysis of the behavior of a class of genetic adaptive systems. PhD dissertation, University of Michigan, 1975."},{"key":"10.1002\/int.20258-BIB59","first-page":"246","volume-title":"A real-coded genetic algorithm for function optimization using unimodal normal distribution crossover","author":"Ono","year":"1997","unstructured":". A real-coded genetic algorithm for function optimization using unimodal normal distribution crossover. In: editors. Proc Seventh Int Conf on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann; 1997. pp. 246\u2013253."},{"key":"10.1002\/int.20258-BIB60","author":"Ortiz","year":"2001","unstructured":", Mu\u00f1oz J. Genetic algorithm with crossover based on confidence intervals as an alternative to least squares estimation for nonlinear models. In: Fourth Metaheuristics International Conference; 2001. pp 343\u2013347."},{"key":"10.1002\/int.20258-BIB61","first-page":"933","volume-title":"Genetic algorithm with search area adaptation for the function optimization and its experimental analysis","author":"Someya","year":"2001","unstructured":". Genetic algorithm with search area adaptation for the function optimization and its experimental analysis. In: Proc 2001 Cong. on Evolutionary Computation. Piscataway, NJ: IEEE Press; 2001. pp. 933\u2013940."},{"key":"10.1002\/int.20258-BIB62","volume-title":"Numerical optimization of computer models","author":"Schwefel","year":"1981","unstructured":"Numerical optimization of computer models. Chichester, UK: Wiley; 1981."},{"key":"10.1002\/int.20258-BIB63","series-title":"Lecture Notes","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-50871-6","volume-title":"Global optimization","volume":"350","author":"T\u00f6rn","year":"1989","unstructured":". Global optimization. Lecture Notes in Computer Science, Vol 350. Berlin: Springer-Verlag; 1989."},{"key":"10.1002\/int.20258-BIB64","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF00933356","volume":"34","author":"Griewangk","year":"1981","journal-title":"J Optim Theory Appl"},{"key":"10.1002\/int.20258-BIB65","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF02430367","volume":"1","author":"Whitley","year":"1995","journal-title":"J Heuristicss"},{"key":"10.1002\/int.20258-BIB66","first-page":"203","volume-title":"Foundations of genetic algorithms","volume":"4","author":"Eshelman","year":"1997","unstructured":", . Convergence controlled variation. In: , editors. Foundations of genetic algorithms 4. San Mateo, CA: Morgan Kaufmann; 1997. pp 203\u2013224."},{"key":"10.1002\/int.20258-BIB67","first-page":"206","volume-title":"Forking genetic algorithm with blocking and shrinking modes","author":"Tsutsui","year":"1993","unstructured":". Forking genetic algorithm with blocking and shrinking modes. In: editor. Proc Fifth Int Conf on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann; 1993. pp 206\u2013213."},{"key":"10.1002\/int.20258-BIB68","author":"Storn","year":"1995","unstructured":". Differential evolution\u2014A simple and efficient adaptive scheme for global optimization over continuous spaces. Technical Report TR-95-012, International Computer Science Institute, Berkeley, CA; 1995."},{"key":"10.1002\/int.20258-BIB69","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-1997-9","volume-title":"A Connectionist machine for genetic hillclimbing","author":"Ackley","year":"1987","unstructured":"A Connectionist machine for genetic hillclimbing. Boston, MA: Kluwer Academic Publishers; 1987."},{"key":"10.1002\/int.20258-BIB70","first-page":"71","volume-title":"Knowledge-based self-adaptation in evolutionary programming Using Cultural Algorithms","author":"Reynolds","year":"1997","unstructured":". Knowledge-based self-adaptation in evolutionary programming Using Cultural Algorithms. In: Proc 1997 International Conference on Evolutionary Computation. Piscataway, NJ: IEEE Press; 1997. pp 71\u201376."}],"container-title":["International Journal of Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fint.20258","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/int.20258","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T15:34:42Z","timestamp":1675956882000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/int.20258"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"references-count":70,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,2]]}},"URL":"https:\/\/doi.org\/10.1002\/int.20258","relation":{},"ISSN":["0884-8173","1098-111X"],"issn-type":[{"value":"0884-8173","type":"print"},{"value":"1098-111X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}