{"title":"从n个可能条件中考虑m个期望条件的编程技术","authors":"Surapon Riyana, N. Homdoung, Kittikorn Sasujit","doi":"10.54963/dtra.v1i2.81","DOIUrl":null,"url":null,"abstract":"The performance of computer programs (or the hardware that can be programmed such as IoTs, embedded computers, and PLCs) is generally based on the complexity of the particular program development technique. High complexity often uses more execution times and system resources. For this reason, the computer program is less computational complexity to be desired. The conditional statements tell computers what certain information is a major cause of computer program complexities, e.g., considering m desired conditions from n possible conditions. To achieve this aim in computer programs, the data combination is often utilized. However, it is high complexity. Moreover, they cannot give that one condition takes precedence over others. To rid these vulnerabilities of combined conditions, a simple programming technique for considering m desired conditions from n possible conditions is proposed in this work, which is based on the summation of the condition weights. It only has the complexity of search spaces and data constructions to be O(n) and each condition can be set to be different precedence from the others. Furthermore, the proposed technique is evaluated by extensive experiments. From the experimental results, they indicate that the proposed technique is more effective and efficient than the comparative technique.","PeriodicalId":209676,"journal":{"name":"Digital Technologies Research and Applications","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Programming Techniques for Considering m Desired Conditions from n Possible Conditions\",\"authors\":\"Surapon Riyana, N. Homdoung, Kittikorn Sasujit\",\"doi\":\"10.54963/dtra.v1i2.81\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The performance of computer programs (or the hardware that can be programmed such as IoTs, embedded computers, and PLCs) is generally based on the complexity of the particular program development technique. High complexity often uses more execution times and system resources. For this reason, the computer program is less computational complexity to be desired. The conditional statements tell computers what certain information is a major cause of computer program complexities, e.g., considering m desired conditions from n possible conditions. To achieve this aim in computer programs, the data combination is often utilized. However, it is high complexity. Moreover, they cannot give that one condition takes precedence over others. To rid these vulnerabilities of combined conditions, a simple programming technique for considering m desired conditions from n possible conditions is proposed in this work, which is based on the summation of the condition weights. It only has the complexity of search spaces and data constructions to be O(n) and each condition can be set to be different precedence from the others. Furthermore, the proposed technique is evaluated by extensive experiments. From the experimental results, they indicate that the proposed technique is more effective and efficient than the comparative technique.\",\"PeriodicalId\":209676,\"journal\":{\"name\":\"Digital Technologies Research and Applications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-09-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Digital Technologies Research and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.54963/dtra.v1i2.81\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Digital Technologies Research and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.54963/dtra.v1i2.81","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Programming Techniques for Considering m Desired Conditions from n Possible Conditions
The performance of computer programs (or the hardware that can be programmed such as IoTs, embedded computers, and PLCs) is generally based on the complexity of the particular program development technique. High complexity often uses more execution times and system resources. For this reason, the computer program is less computational complexity to be desired. The conditional statements tell computers what certain information is a major cause of computer program complexities, e.g., considering m desired conditions from n possible conditions. To achieve this aim in computer programs, the data combination is often utilized. However, it is high complexity. Moreover, they cannot give that one condition takes precedence over others. To rid these vulnerabilities of combined conditions, a simple programming technique for considering m desired conditions from n possible conditions is proposed in this work, which is based on the summation of the condition weights. It only has the complexity of search spaces and data constructions to be O(n) and each condition can be set to be different precedence from the others. Furthermore, the proposed technique is evaluated by extensive experiments. From the experimental results, they indicate that the proposed technique is more effective and efficient than the comparative technique.