{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T05:22:52Z","timestamp":1672464172744},"reference-count":39,"publisher":"Association for Computing Machinery (ACM)","issue":"3\/4","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Commun. Comput. Algebra"],"published-print":{"date-parts":[[2014,1,28]]},"abstract":"\n Many computer algebra systems have more than 1000 built-in functions, making expertise difficult. Using mock dialog boxes, this article describes a proposed interactive general-purpose wizard for organizing optional transformations and allowing easy fine grain control over the form of the result -- even by amateurs. This wizard integrates ideas including:\n \n \n flexible subexpression selection;<\/jats:p>\n <\/jats:list-item>\n \n complete control over the ordering of variables and commutative operands, with wellchosen defaults;<\/jats:p>\n <\/jats:list-item>\n \n interleaving the choice of successively less main variables with applicable function choices to provide detailed control without incurring a combinatorial number of applicable alternatives at any one level;<\/jats:p>\n <\/jats:list-item>\n \n quick applicability tests to reduce the listing of inapplicable transformations;<\/jats:p>\n <\/jats:list-item>\n \n using an organizing principle to order the alternatives in a helpful manner;<\/jats:p>\n <\/jats:list-item>\n \n labeling quickly-computed alternatives in dialog boxes with a preview of their results, using ellipsis elisions if necessary or helpful;<\/jats:p>\n <\/jats:list-item>\n \n allowing the user to retreat from a sequence of choices to explore other branches of the tree of alternatives -- or to return quickly to branches already visited;<\/jats:p>\n <\/jats:list-item>\n \n allowing the user to accumulate more than one of the alternative forms;<\/jats:p>\n <\/jats:list-item>\n \n integrating direct manipulation into the wizard; and<\/jats:p>\n <\/jats:list-item>\n \n supporting not only the usual input-result pair mode, but also the useful alternative derivational and in situ replacement modes in a unified window.<\/jats:p>\n <\/jats:list-item>\n <\/jats:list>\n <\/jats:p>","DOI":"10.1145\/2576802.2576827","type":"journal-article","created":{"date-parts":[[2014,2,4]],"date-time":"2014-02-04T14:16:21Z","timestamp":1391523381000},"page":"130-165","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A computer algebra user interface manifesto"],"prefix":"10.1145","volume":"47","author":[{"given":"David R.","family":"Stoutemyer","sequence":"first","affiliation":[{"name":"dstout at hawaii dot edu"}]}],"member":"320","published-online":{"date-parts":[[2014,1,28]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Acton F.S. Numerical Methods that Work Chapter 11 Harper and Row 1970 or The Mathematical Association of America 1990. Acton F.S. Numerical Methods that Work Chapter 11 Harper and Row 1970 or The Mathematical Association of America 1990.","DOI":"10.1090\/spec\/002"},{"key":"e_1_2_1_2_1","volume-title":"Paracomp Inc.","author":"Avitzur R.","year":"1988"},{"key":"e_1_2_1_3_1","unstructured":"Avitzur R. The Graphing Calculator Story http:\/\/www.pacifict.com\/Story\/ Avitzur R. The Graphing Calculator Story http:\/\/www.pacifict.com\/Story\/"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2007.10.009"},{"key":"e_1_2_1_5_1","unstructured":"Bailey D. and Borwein J. Inverse Symbolic Calculator http:\/\/isc.carma.newcastle.edu.au\/advanced Bailey D. and Borwein J. Inverse Symbolic Calculator http:\/\/isc.carma.newcastle.edu.au\/advanced"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/15.4.362"},{"key":"e_1_2_1_7_1","unstructured":"Bonadio A. Theorist (a computer program) Prescience Corporation 1989. Bonadio A. Theorist (a computer program) Prescience Corporation 1989."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/980175.980179"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-27357-3_9"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0168-9274(83)90006-5"},{"key":"e_1_2_1_11_1","unstructured":"Fateman R.J. Notes on Chebyshev series and computer algebra 2011 http:\/\/www.cs.berkeley.edu\/~fateman\/papers\/cheby.pdf Fateman R.J. Notes on Chebyshev series and computer algebra 2011 http:\/\/www.cs.berkeley.edu\/~fateman\/papers\/cheby.pdf"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1576702.1576732"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/780506.780519"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/220346.220359"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.2002.0529"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1997.0170"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(89)80027-6"},{"issue":"3","key":"e_1_2_1_18_1","first-page":"3","article-title":"A better user interface for Symbolics Lisp Machine Macsyma","volume":"5","author":"Krausz F.","year":"1988","journal-title":"Macsyma Newsletter"},{"key":"e_1_2_1_19_1","unstructured":"MathMonkeys LLC LiveMath formerly known as Theorist MathView MathPlus and Live Math Maker. http:\/\/www.livemath.com\/ MathMonkeys LLC LiveMath formerly known as Theorist MathView MathPlus and Live Math Maker. http:\/\/www.livemath.com\/"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/800204.806298"},{"key":"e_1_2_1_21_1","unstructured":"Powers V. and W\u00f6rmann T. An algorithm for sums of squares of real polynomials http:\/\/www.mathcs.emory.edu\/~vicki\/pub\/sos.pdf Powers V. and W\u00f6rmann T. An algorithm for sums of squares of real polynomials http:\/\/www.mathcs.emory.edu\/~vicki\/pub\/sos.pdf"},{"key":"e_1_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Reznick B.E. Sums of Even Powers of Real Linear Forms Memoirs of the American Mathematical Society 1992 and http:\/\/www.math.uiuc.edu\/~reznick\/memoir.html Reznick B.E. Sums of Even Powers of Real Linear Forms Memoirs of the American Mathematical Society 1992 and http:\/\/www.math.uiuc.edu\/~reznick\/memoir.html","DOI":"10.1090\/memo\/0463"},{"key":"e_1_2_1_23_1","first-page":"367","volume-title":"Pearson Addison Wesley","author":"Shneiderman B.","year":"2004"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2010.08.017"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1823931.1823934"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1504341.1504346"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1358190.1358192"},{"key":"e_1_2_1_28_1","unstructured":"Sturmfels B. Algorithms in invariant theory 2nd edition Springer 2008. Sturmfels B. Algorithms in invariant theory 2nd edition Springer 2008."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/142882.143760"},{"key":"e_1_2_1_30_1","unstructured":"Trefethen L.N. and others Chebfun Version 4.2 The Chebfun Development Team 2011 http:\/\/www.maths.ox.ac.uk\/chebfun\/ Trefethen L.N. and others Chebfun Version 4.2 The Chebfun Development Team 2011 http:\/\/www.maths.ox.ac.uk\/chebfun\/"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/1038003"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80054-5"},{"issue":"1","key":"e_1_2_1_33_1","first-page":"11","volume":"14","author":"von zur Gathen J.","year":"2003","journal-title":"Communication and Computing"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1995.1024"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/1446299.1446790"},{"key":"e_1_2_1_36_1","unstructured":"Wikipedia Model-view-controller http:\/\/en.wikipedia.org\/wiki\/Model%E2%80%93view%E2%80%93controller#References Wikipedia Model-view-controller http:\/\/en.wikipedia.org\/wiki\/Model%E2%80%93view%E2%80%93controller#References"},{"key":"e_1_2_1_37_1","unstructured":"UITP User Interfaces for Theorem Provers http:\/\/www.informatik.uni-bremen.de\/uitp\/ UITP User Interfaces for Theorem Provers http:\/\/www.informatik.uni-bremen.de\/uitp\/"},{"key":"e_1_2_1_38_1","unstructured":"Wolfram|alpha http:\/\/www.wolframalpha.com\/ Wolfram|alpha http:\/\/www.wolframalpha.com\/"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/120694.120695"}],"container-title":["ACM Communications in Computer Algebra"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2576802.2576827","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T21:10:15Z","timestamp":1672434615000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2576802.2576827"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,28]]},"references-count":39,"journal-issue":{"issue":"3\/4","published-print":{"date-parts":[[2014,1,28]]}},"alternative-id":["10.1145\/2576802.2576827"],"URL":"https:\/\/doi.org\/10.1145\/2576802.2576827","relation":{},"ISSN":["1932-2240"],"issn-type":[{"value":"1932-2240","type":"print"}],"subject":[],"published":{"date-parts":[[2014,1,28]]},"assertion":[{"value":"2014-01-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}