2021 International Symposium on Computer Science and Intelligent Controls (ISCSIC)最新文献

{"title":"Function Perturbation Impact on Conjunctive Boolean Networks Under Asynchronous Update","authors":"Liyun Tong, Jinling Liang","doi":"10.1109/ISCSIC54682.2021.00080","DOIUrl":"https://doi.org/10.1109/ISCSIC54682.2021.00080","url":null,"abstract":"In this paper, the function perturbation impact on the conjunctive Boolean network (CBN) under asynchronous update is considered. By resorting to the matrix semi-tensor product, the logical form of the addressed CBN is first transformed into its algebraic form, and some properties are then obtained. In order to globally asymptotic stabilize the considered CBN, a new concept is introduced with maximum probability transition, and the one-bit or multi-bit function perturbations are performed, which are summarized in an algorithm. Finally, a necessary and sufficient condition is presented for the global asymptotic stability of the CBN system. Several illustrative examples are simultaneously given to show validity of the derived results.","PeriodicalId":431036,"journal":{"name":"2021 International Symposium on Computer Science and Intelligent Controls (ISCSIC)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124504861","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Data Mining Techniques to Build A Recommender System","authors":"Alicia Huidobro Espejel, Francisco J. Cantú Ortiz","doi":"10.1109/ISCSIC54682.2021.00047","DOIUrl":"https://doi.org/10.1109/ISCSIC54682.2021.00047","url":null,"abstract":"Recommender systems are not a new topic but they are still current due to their broad applications and the impact that they can have in sales or revenues. There are different approaches to build a system that makes recommendations, the selection of a method depends on several factors. For example, the available data to extract knowledge and the technical resources of the company. In this article, we focus on the use of data mining techniques to build a recommender system. Then, we describe in more detail two methods: communities finding and market basket analysis. Both methods are easy to implement and they are efficient. We present our methodology to implement them as well as the advantages and disadvantages that we found in them. We used a publicly available dataset to test both methods offline. We were interested in evaluating both methods without a ground truth reference because the model selection is one of the challenges when building a new system. For the communities finding method, we used fitness functions that allowed us to compare and select a set of communities. For the market basket analysis, we tested different values for the parameters that can be controlled: support, confidence, and the number of items in transactions. With both methods, we obtained easy to interpret results that can be used to implement a recommender system. The tested methods are suggested when there is only historical data about transactions. When more information is available, there are more robust methods that can be implemented. For example, content-based methods.","PeriodicalId":431036,"journal":{"name":"2021 International Symposium on Computer Science and Intelligent Controls (ISCSIC)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131369804","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A Simulated Annealing Algorithm to Solve the Multi-objective Bike Routing Problem","authors":"P. Nunes, A. Moura, J. Santos, A. Completo","doi":"10.1109/ISCSIC54682.2021.00019","DOIUrl":"https://doi.org/10.1109/ISCSIC54682.2021.00019","url":null,"abstract":"With the increasing concern about sustainable means of transport, the use of bicycle is earning popularity. However, for cyclists, it may be a challenge to use this mean of transportation in an urban context, since there are plenty of route choices available and each of them may represent a different trade-off between multiple objectives, such as safety and travel distance. These trade-offs depend on cyclist's experience and preferences. Thus, while an experienced cyclist may choose the shortest path between the source and destination points, a beginner may prefer to travel longer distances to cycle in dedicated cycling infrastructures or to avoid motorized traffic. In this paper, it is proposed a simulated annealing algorithm, to achieve an approximated Pareto set. One uses the A-Star algorithm to create an initial solution and propose a perturbation method, which uses the A-Star algorithm, to generate a higher diversity of solutions. The methodology was tested in practical use cases and was able to find a set of quality solutions for the bike routing problem (BRP).","PeriodicalId":431036,"journal":{"name":"2021 International Symposium on Computer Science and Intelligent Controls (ISCSIC)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127131018","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Message From the General Chair","authors":"S. Turner","doi":"10.1109/pads.2006.23","DOIUrl":"https://doi.org/10.1109/pads.2006.23","url":null,"abstract":"It is my honor and privilege to welcome you to the 2010 IEEE Symposium on Security and Privacy. It has now been 30 years since the very first symposium in this series was held at the Claremont. While many things in the world of computing and networking have changed since 1980, this conference continues to be the premier forum for researchers to present and discuss the latest developments in computer security and electronic privacy. This year, we reflect on the past 30 years in a special anniversary celebration, and we prepare for the future with a very exciting technical program.","PeriodicalId":431036,"journal":{"name":"2021 International Symposium on Computer Science and Intelligent Controls (ISCSIC)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116668972","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Analysis the Household Activity Chains Based on Utility-Maximizing Model","authors":"Wissam Qassim Al-Salih, D. Esztergár-Kiss","doi":"10.1109/ISCSIC54682.2021.00022","DOIUrl":"https://doi.org/10.1109/ISCSIC54682.2021.00022","url":null,"abstract":"Most activity-based models of transport planning depend on an individual decision-making process modelling daily activity and the activity chains. The dependence on individual decision-making approaches may be partially due to the deficiency of modelling methodologies for group decision-making within the household. Therefore, in this paper, we present a study to analyse the group decision-making among the household members. This paper aims to analyse and estimate the activity allocation and the activity chains between the household members by using the mixed multinomial logit model based on the utility function. The study is using the 2014 Budapest city Travel Survey. This paper presents a model for the activity type and activity chains that household members pursue during the daily activity. The study assumes that the household members allocate their activity type and duration within the activity chains to get a high utility. Besides that, the effects of household and individual socio-demographics, travel and activity variables on the activity allocation are examined. According to the results that indicated that the activity purpose with (3.392 & 2.136) is an essential factor and positively affects the likelihood of choice among the activity types or activity chains. Finally, the implications of the results for travel behaviour and transportation planning are identified.","PeriodicalId":431036,"journal":{"name":"2021 International Symposium on Computer Science and Intelligent Controls (ISCSIC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115102564","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Towards an Approach of Recommendation in Business Processes Using Decision Trees","authors":"Fatima Zohra Trabelsi, A. Khtira, B. E. Asri","doi":"10.1109/ISCSIC54682.2021.00068","DOIUrl":"https://doi.org/10.1109/ISCSIC54682.2021.00068","url":null,"abstract":"A recommender system analyses users' data in order to extract their interests and preferences and suggest them relevant items. The recommendation systems have shown their applicability in many domains, especially in business processes (BP). Business processes are defined as a set of tasks that are performed by an organization to achieve a business goal. Using recommendation techniques in business processes consists of proposing relevant tasks at a certain point, which helps managers making the right decisions. In this paper, we propose an approach of recommending in BPMN-based business processes. The recommendation technique that we considered in this approach is the decision trees.","PeriodicalId":431036,"journal":{"name":"2021 International Symposium on Computer Science and Intelligent Controls (ISCSIC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129951249","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"MTD: Run-time System Call Mapping Randomization","authors":"Takeshi Masumoto, Wai Kyi Kyi Oo, Hiroshi Koide","doi":"10.1109/ISCSIC54682.2021.00054","DOIUrl":"https://doi.org/10.1109/ISCSIC54682.2021.00054","url":null,"abstract":"The purpose of our research is to provide defense against code injection attacks on the system. Code injection attack is one of the most dangerous attacks to a system, which can even give an attacker a chance to fully compromise the system by executing arbitrary code. Moving Target Defense (MTD) can protect the system from attacks by dynamically changing the target area of attacks including vulnerability as well as reduce the reachability of attacks. System call randomization is an MTD technique that disables code injection attacks by randomizing the mapping between system call numbers and the functions called by them. The purpose of system call randomization is to limit the processing and resources that the injected program can perform and access. As system calls are the only way for user applications to access system resources, randomizing system calls can give attackers more difficulty to achieve their goals, even if they can inj ect the program. Existing system call randomization techniques once performed randomization before loading the program, however, such methods only once in advance have no effect when information about randomization is disclosed to attackers. In this paper, we propose a method of re-randomizing multiple times at runtime to solve this problem. We implemented a script that directly edits the ELF executable format. In fact, as a result of running the script on a small program, we succeeded in generating a new executable file to which the method is applied. Our experiments show that run-time system call randomization is effective against code injection attacks, and this technique may also be applied to existing compiled programs. We implemented a script that directly edits the ELF executable format. In fact, as a result of running the script on a small program, we succeeded in generating a new executable file to which the method is applied. Our experiments show that run-time system call randomization is effective against code injection attacks, and this technique may also be applied to existing compiled programs.","PeriodicalId":431036,"journal":{"name":"2021 International Symposium on Computer Science and Intelligent Controls (ISCSIC)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124971453","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Segmented Inverse Kinematics and Trajectory Planning of Quasi-continuous Manipulator","authors":"Longfei Jia, Tingsong Chen, Yaxing Guo, Jing-Kun Chen, Y. Tao, Yuping Huang","doi":"10.1109/ISCSIC54682.2021.00064","DOIUrl":"https://doi.org/10.1109/ISCSIC54682.2021.00064","url":null,"abstract":"In this paper, a method of segmented inverse kinematics is proposed for the complex inverse kinematics of the quasi-continuous manipulator and the trajectory planning of the middle joint and the end effector. According to various obstacles, eight links can be divided into different types of segments and inverse kinematics is performed on each segment, so as to ensure that any position of the manipulator does not touch the obstacle during the process of moving the target. Based on the above method, two examples corresponding to two obstacles are introduced. Through simulation, it is found that the change law of 17 degrees of freedom that meets the structural constraints of the quasi-continuous manipulator can be obtained by utilizing the method of segmented inverse kinematics, which proves the effectiveness and practicability of the method.","PeriodicalId":431036,"journal":{"name":"2021 International Symposium on Computer Science and Intelligent Controls (ISCSIC)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115846445","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"[Copyright notice]","authors":"","doi":"10.1109/iscsic54682.2021.00003","DOIUrl":"https://doi.org/10.1109/iscsic54682.2021.00003","url":null,"abstract":"","PeriodicalId":431036,"journal":{"name":"2021 International Symposium on Computer Science and Intelligent Controls (ISCSIC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134423106","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Model Channel Pruning Method Based on Squeeze-and-Excitation Mechanism and Upper Quartile Truncation","authors":"Z. Ding, Jianyu Zhao, Jiaqi Sun","doi":"10.1109/ISCSIC54682.2021.00031","DOIUrl":"https://doi.org/10.1109/ISCSIC54682.2021.00031","url":null,"abstract":"As the application of neural networks becomes more profound and more widespread, it is common to deepen the network or increase the number of parameters to improve its performance. Nevertheless, the accompanying increase in computational complexity makes the model difficult to implement on resource-limited mobile devices. Pruning connections are one of the main methods used for deep network compression. The existing pruning techniques suffer from disadvantages such as generating additional energy consumption, short practical estimation of channel importance, and leading the network to fall into overfitting. In this paper, we propose a channel pruning method based on the SE mechanism and upper quartile truncation, which uses the SE mechanism to extract the channel feature importance and upper quartile points as truncation factors to accelerate the model and reduce its computational effort, and the effectiveness of the method was demonstrated by experiments.","PeriodicalId":431036,"journal":{"name":"2021 International Symposium on Computer Science and Intelligent Controls (ISCSIC)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131990360","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}