{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T06:43:31Z","timestamp":1742798611208,"version":"3.28.0"},"reference-count":7,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ijcnn.2003.1223844","type":"proceedings-article","created":{"date-parts":[[2004,3,22]],"date-time":"2004-03-22T14:34:28Z","timestamp":1079966068000},"page":"1098-1103","source":"Crossref","is-referenced-by-count":1,"title":["Finding the ordered roots of arbitrary polynomials using constrained partitioning neural networks"],"prefix":"10.1109","volume":"2","author":[{"family":"De-Shuang Huang","sequence":"first","affiliation":[]},{"given":"H.H.S.","family":"Ip","sequence":"additional","affiliation":[]},{"given":"C.K.","family":"Law Ken","sequence":"additional","affiliation":[]},{"given":"H.S.","family":"Wong","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","article-title":"Neural networks with problem decomposition for finding real roots of polynomials","volume":"addendum","author":"huang","year":"2001","journal-title":"2001 Int Joint Conf On Neural Networks (IJCNN2001)"},{"key":"ref3","article-title":"Finding the maximum Modulus roots of polynomials based on constrained neural networks","author":"huang","year":"0","journal-title":"ICASSP"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009655902122"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1049\/ip-vis:19982148","article-title":"root moments: a digital signal-processing perspective","volume":"145","author":"stathaki","year":"1998","journal-title":"Vision Image and Signal Processing IEE Proceedings-"},{"key":"ref7","article-title":"Finding complex roots of polynomials by feedforward neural networks","volume":"addendum","author":"huang","year":"2001","journal-title":"2001 Int Joint Conf On Neural Networks (IJCNN2001)"},{"key":"ref2","first-page":"3315","article-title":"FFT-based fast polynomial rooting","volume":"6","author":"hoteit","year":"2000","journal-title":"Signal Processing Proceedings 2000"},{"journal-title":"Nemerical Recipes in C The Art of Scientific Computing","year":"1988","author":"press","key":"ref1"}],"event":{"name":"2003 International Joint Conference on Neural Networks","acronym":"IJCNN-03","location":"Portland, OR, USA"},"container-title":["Proceedings of the International Joint Conference on Neural Networks, 2003."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8672\/27486\/01223844.pdf?arnumber=1223844","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T04:26:26Z","timestamp":1497587186000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1223844\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":7,"URL":"https:\/\/doi.org\/10.1109\/ijcnn.2003.1223844","relation":{},"subject":[]}}