{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,14]],"date-time":"2023-07-14T20:47:27Z","timestamp":1689367647190},"reference-count":21,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"8","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. &amp; Syst."],"published-print":{"date-parts":[[2017]]},"DOI":"10.1587\/transinf.2016lop0013","type":"journal-article","created":{"date-parts":[[2017,7,31]],"date-time":"2017-07-31T22:19:49Z","timestamp":1501539589000},"page":"1583-1591","source":"Crossref","is-referenced-by-count":4,"title":["A Balanced Decision Tree Based Heuristic for Linear Decomposition of Index Generation Functions"],"prefix":"10.1587","volume":"E100.D","author":[{"given":"Shinobu","family":"NAGAYAMA","sequence":"first","affiliation":[{"name":"Department of Computer and Network Engineering, Hiroshima City University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsutomu","family":"SASAO","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Meiji University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jon","family":"T. BUTLER","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Naval Postgraduate School"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] S. Aborhey, \u201cBinary decision tree test functions,\u201d IEEE Trans. Comput., vol.37, no.11, pp.1461-1465, Nov 1988. 10.1109\/12.8719","DOI":"10.1109\/12.8719"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] R.J. Lechner, \u201cHarmonic analysis of switching functions,\u201d in A. Mukhopadhyay (ed.), Recent Developments in Switching Theory, Academic Press, New York, Chapter V, pp.121-228, 1971. 10.1016\/b978-0-12-509850-2.50010-5","DOI":"10.1016\/B978-0-12-509850-2.50010-5"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] C. Meinel, F. Somenzi, and T. Theobald, \u201cLinear sifting of decision diagrams and its application in synthesis,\u201d IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.19, no.5, pp.521-533, May 2000. 10.1109\/43.845077","DOI":"10.1109\/43.845077"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] S. Nagayama, T. Sasao, and J.T. Butler, \u201cAn efficient heuristic for linear decomposition of index generation functions,\u201d 46th International Symposium on Multiple-Valued Logic, pp.96-101, May, 2016. 10.1109\/ismvl.2016.52","DOI":"10.1109\/ISMVL.2016.52"},{"key":"5","unstructured":"[5] E.I. Nechiporuk, \u201cOn the synthesis of networks using linear transformations of variables,\u201d Dokl. AN SSSR, vol.123, no.4, pp.610-612, Dec., 1958."},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] T. Sasao, Memory-Based Logic Synthesis, Springer, 2011. 10.1007\/978-1-4419-8104-2","DOI":"10.1007\/978-1-4419-8104-2"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] T. Sasao, \u201cIndex generation functions: recent developments (invited paper),\u201d 41st International Symposium on Multiple-Valued Logic, pp.1-9, May 2011. 10.1109\/ismvl.2011.17","DOI":"10.1109\/ISMVL.2011.17"},{"key":"8","unstructured":"[8] T. Sasao, \u201cLinear transformations for variable reduction,\u201d Reed-Muller Workshop 2011, May 2011."},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] T. Sasao, \u201cLinear decomposition of index generation functions,\u201d 17th Asia and South Pacific Design Automation Conference, pp.781-788, Jan. 2012. 10.1109\/aspdac.2012.6165060","DOI":"10.1109\/ASPDAC.2012.6165060"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] T. Sasao, Y. Urano, and Y. Iguchi, \u201cA lower bound on the number of variables to represent incompletely specified index generation functions,\u201d 44th International Symposium on Multiple-Valued Logic, pp.7-12, May 2014. 10.1109\/ismvl.2014.10","DOI":"10.1109\/ISMVL.2014.10"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] T. Sasao, Y. Urano, and Y. Iguchi, \u201cA method to find linear decompositions for incompletely specified index generation functions using difference matrix,\u201d IEICE Transactions on Fundamentals, vol.E97-A, no.12, pp.2427-2433, Dec. 2014. 10.1587\/transfun.e97.a.2427","DOI":"10.1587\/transfun.E97.A.2427"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] T. Sasao, \u201cA reduction method for the number of variables to represent index generation functions: s-min method,\u201d 45th International Symposium on Multiple-Valued Logic, pp.164-169, May 2015. 10.1109\/ismvl.2015.40","DOI":"10.1109\/ISMVL.2015.40"},{"key":"13","unstructured":"[13] T. Sasao, I. Fumishi, and Y. Iguchi, \u201cOn an exact minimization of variables for incompletely specified index generation functions using SAT,\u201d Note on Multiple-Valued Logic in Japan, vol.38, no.3, pp.1-8, Sept. 2015."},{"key":"14","unstructured":"[14] The Social Security and Tax Number System Cabinet Secretariat, http:\/\/www.cas.go.jp\/jp\/seisaku\/bangoseido\/english.html, Oct. 14, 2015."},{"key":"15","unstructured":"[15] Document on the Social Security and Tax Number System (in Japanese), Office for the Social Security and Tax Number System, Minister&apos;s Secretariat, Cabinet Office and Social Security Reform Office, Cabinet Secretariat, http:\/\/www.cas.go.jp\/jp\/seisaku\/bangoseido\/pdf\/gaiyou_siryou.pdf, Oct. 14, 2015."},{"key":"16","unstructured":"[16] Lows and Regulations for Social Security and Tax Numbers (in Japanese), Ministry of Internal Affairs and Communications, http:\/\/law.e-gov.go.jp\/announce\/H26F11001000085.html, Oct. 14, 2015."},{"key":"17","unstructured":"[17] Lows and Regulations for Residents Identification Numbers (in Japanese), Ministry of Internal Affairs and Communications, http:\/\/law.e-gov.go.jp\/htmldata\/H11\/H11F04301000035.html, Oct. 14, 2015."},{"key":"18","unstructured":"[18] Open Source Bible Data, The King James Version, Internet Sacred Text Archive, http:\/\/www.sacred-texts.com\/bib\/osrc\/, Oct. 27, 2015."},{"key":"19","unstructured":"[19] The Constitution of the United States: A Transcription, U.S. National Archives and Records Administration, http:\/\/www.archives.gov\/exhibits\/charters\/constitution.html, Oct. 13, 2015."},{"key":"20","unstructured":"[20] The U.S. Bill of Rights: A Transcription, U.S. National Archives and Records Administration, http:\/\/www.archives.gov\/exhibits\/charters\/constitution.html, Oct. 14, 2015."},{"key":"21","unstructured":"[21] The Constitution: Amendments 11-27, U.S. National Archives and Records Administration, http:\/\/www.archives.gov\/exhibits\/charters\/constitution.html, Oct. 14, 2015."}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/8\/E100.D_2016LOP0013\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T21:37:28Z","timestamp":1569965848000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/8\/E100.D_2016LOP0013\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":21,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2017]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2016lop0013","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}