{"title":"非耦合二进制输入输出CNN模板分解方法的改进","authors":"L. Kék","doi":"10.1109/CNNA.2002.1035084","DOIUrl":null,"url":null,"abstract":"This paper proposes an improved method for systematic decomposition of Boolean operators into a sequence of simpler ones. The improvement has two main components: (i) a sufficient condition for decreasing the number of possible child-templates during decomposition; (ii) pointing out the template element, the elimination of which results in the possibly maximum increment of the robustness value of the template. Examples are presented to demonstrate the effectiveness of the proposed method, whose advantages and limitations are also discussed.","PeriodicalId":387716,"journal":{"name":"Proceedings of the 2002 7th IEEE International Workshop on Cellular Neural Networks and Their Applications","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2002-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Improvement of the method for uncoupled binary input-output CNN template decomposition\",\"authors\":\"L. Kék\",\"doi\":\"10.1109/CNNA.2002.1035084\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes an improved method for systematic decomposition of Boolean operators into a sequence of simpler ones. The improvement has two main components: (i) a sufficient condition for decreasing the number of possible child-templates during decomposition; (ii) pointing out the template element, the elimination of which results in the possibly maximum increment of the robustness value of the template. Examples are presented to demonstrate the effectiveness of the proposed method, whose advantages and limitations are also discussed.\",\"PeriodicalId\":387716,\"journal\":{\"name\":\"Proceedings of the 2002 7th IEEE International Workshop on Cellular Neural Networks and Their Applications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-07-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2002 7th IEEE International Workshop on Cellular Neural Networks and Their Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CNNA.2002.1035084\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2002 7th IEEE International Workshop on Cellular Neural Networks and Their Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CNNA.2002.1035084","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Improvement of the method for uncoupled binary input-output CNN template decomposition
This paper proposes an improved method for systematic decomposition of Boolean operators into a sequence of simpler ones. The improvement has two main components: (i) a sufficient condition for decreasing the number of possible child-templates during decomposition; (ii) pointing out the template element, the elimination of which results in the possibly maximum increment of the robustness value of the template. Examples are presented to demonstrate the effectiveness of the proposed method, whose advantages and limitations are also discussed.