乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T05:19:52Z","timestamp":1726463992804},"reference-count":25,"publisher":"Elsevier BV","issue":"3-4","license":[{"start":{"date-parts":[[2006,2,1]],"date-time":"2006-02-01T00:00:00Z","timestamp":1138752000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":2723,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Mathematics with Applications"],"published-print":{"date-parts":[[2006,2]]},"DOI":"10.1016\/j.camwa.2005.07.012","type":"journal-article","created":{"date-parts":[[2006,5,23]],"date-time":"2006-05-23T16:50:00Z","timestamp":1148403000000},"page":"527-536","source":"Crossref","is-referenced-by-count":9,"title":["Determining the number of real roots of polynomials through neural networks"],"prefix":"10.1016","volume":"51","author":[{"given":"B.","family":"Mourrain","sequence":"first","affiliation":[]},{"given":"N.G.","family":"Pavlidis","sequence":"additional","affiliation":[]},{"given":"D.K.","family":"Tasoulis","sequence":"additional","affiliation":[]},{"given":"M.N.","family":"Vrahatis","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"8","key":"10.1016\/j.camwa.2005.07.012_bib1","doi-asserted-by":"crossref","first-page":"1721","DOI":"10.1162\/089976604774201668","article-title":"A neural root finder of polynomials based on root moments","volume":"16","author":"Huang","year":"2004","journal-title":"Neural Computation"},{"key":"10.1016\/j.camwa.2005.07.012_bib2","series-title":"Proceedings of the International Joint Conference on Neural Networks 2001 (IJCNN'01)","first-page":"25","article-title":"Neural networks with problem decomposition for finding real roots of polynomials","author":"Huang","year":"2001"},{"key":"10.1016\/j.camwa.2005.07.012_bib3","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1009655902122","article-title":"Constrained learning in neural networks: Application to stable factorization of 2-D polynomials","volume":"7","author":"Perantonis","year":"1998","journal-title":"Neural Processing Letters"},{"issue":"2","key":"10.1016\/j.camwa.2005.07.012_bib4","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1109\/TNN.2004.824424","article-title":"A constructive approach for finding arbitrary roots of polynomials by neural networks","volume":"15","author":"Huang","year":"2004","journal-title":"IEEE Transactions on Neural Networks"},{"key":"10.1016\/j.camwa.2005.07.012_bib5","doi-asserted-by":"crossref","first-page":"1420","DOI":"10.1109\/72.471365","article-title":"An efficient constrained learning algorithm for feedforward networks","volume":"6","author":"Karras","year":"1995","journal-title":"IEEE Transactions on Neural Networks"},{"key":"10.1016\/j.camwa.2005.07.012_bib6","series-title":"Proc. IEEE Region 10 Tech. Conf. on Computers, Communications, Control and Power Engineering","first-page":"1516","article-title":"Constrained learning algorithms for finding the roots of polynomials: A case study","author":"Huang","year":"2002"},{"year":"1999","series-title":"Neural Networks: A Comprehensive Foundation","author":"Haykin","key":"10.1016\/j.camwa.2005.07.012_bib7"},{"key":"10.1016\/j.camwa.2005.07.012_bib8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.346","article-title":"Improved heterogeneous distance functions","volume":"6","author":"Wilson","year":"1997","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"6","key":"10.1016\/j.camwa.2005.07.012_bib9","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1109\/72.329697","article-title":"Training feedforward networks with the marquardt algorithm","volume":"5","author":"Hagan","year":"1994","journal-title":"IEEE Transactions on Neural Network"},{"key":"10.1016\/j.camwa.2005.07.012_bib10","series-title":"Proceedings of the Second International ICSC Symposium on Neural Computation (NC 2000)","first-page":"115","article-title":"Improving the Rprop learning algorithm","author":"Igel","year":"2000"},{"key":"10.1016\/j.camwa.2005.07.012_bib11","doi-asserted-by":"crossref","first-page":"3425","DOI":"10.1016\/S0362-546X(01)00458-8","article-title":"Adaptive stepsize algorithms for on-line training of neural networks","volume":"47","author":"Magoulas","year":"2001","journal-title":"Nonlinear Analysis, Theory, Methods and Applications"},{"issue":"1","key":"10.1016\/j.camwa.2005.07.012_bib12","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0893-6080(96)00052-4","article-title":"Effective backpropagation training with variable stepsize","volume":"10","author":"Magoulas","year":"1997","journal-title":"Neural Networks"},{"issue":"7","key":"10.1016\/j.camwa.2005.07.012_bib13","doi-asserted-by":"crossref","first-page":"1769","DOI":"10.1162\/089976699300016223","article-title":"Increasing the convergence rate of the error backpropagation algorithm by learning rate adaptation methods","volume":"11","author":"Magoulas","year":"1999","journal-title":"Neural Computation"},{"key":"10.1016\/j.camwa.2005.07.012_bib14","series-title":"Proceedings of the IEEE International Conference on Neural Networks","first-page":"586","article-title":"A direct adaptive method for faster backpropagation learning: The rprop algorithm","author":"Riedmiller","year":"1993"},{"issue":"2","key":"10.1016\/j.camwa.2005.07.012_bib15","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/S0377-0427(99)00276-9","article-title":"A class of gradient unconstrained minimization algorithms with adaptive stepsize","volume":"114","author":"Vrahatis","year":"2000","journal-title":"J. Comput. Appl. Math."},{"key":"10.1016\/j.camwa.2005.07.012_bib16","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1023\/A:1009661729970","article-title":"Globally convergent modification of the quickprop method","volume":"12","author":"Vrahatis","year":"2000","journal-title":"Neural Processing Letters"},{"issue":"1","key":"10.1016\/j.camwa.2005.07.012_bib17","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/S0168-9274(02)00235-0","article-title":"From linear to nonlinear iterative methods","volume":"45","author":"Vrahatis","year":"2003","journal-title":"Applied Numerical Mathematics"},{"key":"10.1016\/j.camwa.2005.07.012_bib18","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1016\/S0893-6080(05)80056-5","article-title":"A scaled conjugate gradient algorithm for fast supervised learning","volume":"6","author":"M\u00f8ller","year":"1993","journal-title":"Neural Networks"},{"key":"10.1016\/j.camwa.2005.07.012_bib19","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF02551274","article-title":"Approximations by superpositions of sigmoidal functions","volume":"2","author":"Cybenko","year":"1989","journal-title":"Mathematics of Control, Signals, and Systems"},{"key":"10.1016\/j.camwa.2005.07.012_bib20","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0893-6080(89)90020-8","article-title":"Multilayer feedforward networks are universal approximators","volume":"2","author":"Hornik","year":"1989","journal-title":"Neural Networks"},{"key":"10.1016\/j.camwa.2005.07.012_bib21","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1016\/0893-6080(90)90004-5","article-title":"Connectionist nonparametric regression: Multilayer feedforward networks can learn arbitrary mappings","volume":"3","author":"White","year":"1990","journal-title":"Neural Networks"},{"key":"10.1016\/j.camwa.2005.07.012_bib22","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1017\/S0962492900002919","article-title":"Approximation theory of the mlp model in neural networks","author":"Pinkus","year":"1999","journal-title":"Acta Numerica"},{"key":"10.1016\/j.camwa.2005.07.012_bib23","doi-asserted-by":"crossref","DOI":"10.1142\/9789812777171_0024","article-title":"An environment for symbolic and numeric computation","author":"Dos Reis","year":"2002"},{"issue":"2","key":"10.1016\/j.camwa.2005.07.012_bib24","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1006\/jcom.2001.0636","article-title":"On the complexity of isolating real roots and computing with certainty the topological degree","volume":"18","author":"Mourrain","year":"2002","journal-title":"Journal of Complexity"},{"key":"10.1016\/j.camwa.2005.07.012_bib25","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF02207694","article-title":"Numerical computation of polynomial zeros by means of Aberth's method","volume":"13","author":"Bini","year":"1996","journal-title":"Numerical Algorithms"}],"container-title":["Computers & Mathematics with Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0898122105005195?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0898122105005195?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T20:15:38Z","timestamp":1555618538000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0898122105005195"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,2]]},"references-count":25,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2006,2]]}},"alternative-id":["S0898122105005195"],"URL":"https:\/\/doi.org\/10.1016\/j.camwa.2005.07.012","relation":{},"ISSN":["0898-1221"],"issn-type":[{"type":"print","value":"0898-1221"}],"subject":[],"published":{"date-parts":[[2006,2]]}}}