{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:30:46Z","timestamp":1725553846732},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540343851"},{"type":"electronic","value":"9783540343868"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11758549_80","type":"book-chapter","created":{"date-parts":[[2006,5,10]],"date-time":"2006-05-10T00:50:25Z","timestamp":1147222225000},"page":"582-590","source":"Crossref","is-referenced-by-count":4,"title":["Hybrid Static\/Dynamic Activity Analysis"],"prefix":"10.1007","author":[{"given":"Barbara","family":"Kreaseck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luis","family":"Ramos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Scott","family":"Easterday","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michelle","family":"Strout","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Hovland","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"80_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-1997-9","volume-title":"A connectionist machine for hillclimbing","author":"D.H. Ackley","year":"1987","unstructured":"Ackley, D.H.: A connectionist machine for hillclimbing. Kluwer Academic Publishers, Boston (1987)"},{"key":"80_CR2","unstructured":"Addis, B., Leyffer, S.: A trust-region algorithm for global optimization. Technical Report ANL\/MCS-P1190-0804, Argonne National Laboratory (August 2004)"},{"key":"80_CR3","unstructured":"ADIC Webpage, \n                    \n                      http:\/\/www-fp.mcs.anl.gov\/adic\/"},{"key":"80_CR4","unstructured":"Benson, S.J., McInnes, L.C., Mor\u00e9, J., Sarich, J.: TAO user manual (revision 1.8). Technical Report ANL\/MCS-TM-242, Mathematics and Computer Science Division, Argonne National Laboratory (2005), \n                    \n                      http:\/\/www.mcs.anl.gov\/tao"},{"issue":"3","key":"80_CR5","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1109\/99.537089","volume":"3","author":"C. Bischof","year":"1996","unstructured":"Bischof, C., Khademi, P., Mauer, A., Carle, A.: Adifor 2.0: Automatic differentiation of Fortran 77 programs. IEEE Comput. Sci. Eng.\u00a03(3), 18\u201332 (1996)","journal-title":"IEEE Comput. Sci. Eng."},{"issue":"12","key":"80_CR6","doi-asserted-by":"publisher","first-page":"1427","DOI":"10.1002\/(SICI)1097-024X(199712)27:12<1427::AID-SPE138>3.0.CO;2-Q","volume":"27","author":"C. Bischof","year":"1997","unstructured":"Bischof, C., Roh, L., Mauer-Oats, A.J.: ADIC: An extensible automatic differentiation tool for ANSI-C. Software: Practice and Experience\u00a027(12), 1427\u20131456 (1997)","journal-title":"Software: Practice and Experience"},{"key":"80_CR7","unstructured":"Bischof, C.H., Hovland, P.D., Norris, B.: On the implementation of automatic differentiation tools. Higher-Order and Symbolic Computation (2004)"},{"key":"80_CR8","unstructured":"Fagan, M., Carle, A.: Activity analysis in Adifor: Algorithms and effectiveness. Technical Report TR04-21, Rice University, Dept. of Computation and Applied Mathematics (2004)"},{"key":"80_CR9","unstructured":"Global Optimization Functions, \n                    \n                      http:\/\/www2.imm.dtu.dk\/~km\/GlobOpt\/testex\/"},{"issue":"8","key":"80_CR10","doi-asserted-by":"publisher","first-page":"1401","DOI":"10.1016\/j.future.2004.11.009","volume":"21","author":"L. Hascoet","year":"2005","unstructured":"Hascoet, L., Naumann, U., Pascual, V.: To be recorded analysis in reverse-mode automatic differentiation. Future Generation Computer Systems\u00a021(8), 1401\u20131417 (2005)","journal-title":"Future Generation Computer Systems"},{"key":"80_CR11","unstructured":"MINPACK-2 webpage, \n                    \n                      http:\/\/www-fp.mcs.anl.gov\/otc\/minpack\/sectionstar3_1.html"},{"key":"80_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1007\/3-540-46080-2_109","volume-title":"Computational Science - ICCS 2002","author":"U. Naumann","year":"2002","unstructured":"Naumann, U.: Reducing the memory requirement in reverse mode automatic differentiation by solving TBR flow equations. In: Sloot, P.M.A., Tan, C.J.K., Dongarra, J., Hoekstra, A.G. (eds.) ICCS-ComputSci 2002. LNCS, vol.\u00a02330, pp. 1039\u20131048. Springer, Heidelberg (2002)"},{"key":"80_CR13","unstructured":"OpenAD Webpage, \n                    \n                      http:\/\/www-unix.mcs.anl.gov\/openad\/"},{"key":"80_CR14","unstructured":"OpenAnalysis Webpage, \n                    \n                      http:\/\/www-unix.mcs.anl.gov\/OpenAnalysisWiki\/moin.cgi"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11758549_80","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T00:10:58Z","timestamp":1552522258000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11758549_80"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540343851","9783540343868"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11758549_80","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}