Christoph Czepa, Huy Tran, Uwe Zdun, T. Tran, E. Weiss, C. Ruhsam
Case models in Adaptive Case Management (ACM) are business process models ranging from unstructured over semi-structured to structured process models. Due to this versatility, both industry and academia show growing interest in this approach. This paper discusses a model checking approach for the behavioral verification of ACM case models. To counteract the high computational demands of model checking techniques, our approach includes state space reduction techniques as a preprocessing step before state-transition system generation. Consequently, the problem size is decreased, which decreases the computational demands needed by the subsequent model checking as well. An evaluation of the approach with a large set of LTL specifications on two real-world case models, which are representative for semi-structured and structured process models and realistic in size, shows an acceptable performance of the proposed approach.
{"title":"Reduction techniques for efficient behavioral model checking in adaptive case management","authors":"Christoph Czepa, Huy Tran, Uwe Zdun, T. Tran, E. Weiss, C. Ruhsam","doi":"10.1145/3019612.3019617","DOIUrl":"https://doi.org/10.1145/3019612.3019617","url":null,"abstract":"Case models in Adaptive Case Management (ACM) are business process models ranging from unstructured over semi-structured to structured process models. Due to this versatility, both industry and academia show growing interest in this approach. This paper discusses a model checking approach for the behavioral verification of ACM case models. To counteract the high computational demands of model checking techniques, our approach includes state space reduction techniques as a preprocessing step before state-transition system generation. Consequently, the problem size is decreased, which decreases the computational demands needed by the subsequent model checking as well. An evaluation of the approach with a large set of LTL specifications on two real-world case models, which are representative for semi-structured and structured process models and realistic in size, shows an acceptable performance of the proposed approach.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81335994","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}
Internet of Things (IoT) plays a major role in connecting the physical world with the cyber world through new services and seamless interconnection between heterogeneous devices. Such heterogeneous devices tend to generate a massive volume of Big Data. However, exploiting green schemes for IoT is still a challenge since IoT attains a large scale and becomes more multifaceted, the current trends of analyzing Big Data are not directly applicable to it. Similarly, achieving green IoT through the use of 5G also poses new challenges when it comes to transferring huge volume of data in an efficient way. To address the challenges above, this paper presents a scheme for human- enabled green IoT in 5G network. Green IoT is achieved by grouping mobile nodes in a cluster. Also, a mobility management model is designed that helps in triggering efficient handover and selecting optimal networks based on multi-criteria decision modeling. Afterward, we design a network architecture that integrates green IoT with 5G network. Moreover, the 5G network architecture is supported by proposed protocol stack, which maps Internet Protocol (IP), Medium Access Protocol (MAC), and Location identifiers (LOC). The proposed scheme is also implemented using C programming language to validate mobility model in 5G, regarding cost, energy, and Quality of Service.
{"title":"Human enabled green IoT in 5G networks","authors":"Sadia Din, Awais Ahmad, Anand Paul","doi":"10.1145/3019612.3019689","DOIUrl":"https://doi.org/10.1145/3019612.3019689","url":null,"abstract":"Internet of Things (IoT) plays a major role in connecting the physical world with the cyber world through new services and seamless interconnection between heterogeneous devices. Such heterogeneous devices tend to generate a massive volume of Big Data. However, exploiting green schemes for IoT is still a challenge since IoT attains a large scale and becomes more multifaceted, the current trends of analyzing Big Data are not directly applicable to it. Similarly, achieving green IoT through the use of 5G also poses new challenges when it comes to transferring huge volume of data in an efficient way. To address the challenges above, this paper presents a scheme for human- enabled green IoT in 5G network. Green IoT is achieved by grouping mobile nodes in a cluster. Also, a mobility management model is designed that helps in triggering efficient handover and selecting optimal networks based on multi-criteria decision modeling. Afterward, we design a network architecture that integrates green IoT with 5G network. Moreover, the 5G network architecture is supported by proposed protocol stack, which maps Internet Protocol (IP), Medium Access Protocol (MAC), and Location identifiers (LOC). The proposed scheme is also implemented using C programming language to validate mobility model in 5G, regarding cost, energy, and Quality of Service.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":"18 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80986446","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}
On behalf of the Organizing Committee, we welcome you to the 32nd Annual ACM Symposium on Applied Computing (SAC 2017). This international forum has been dedicated to computer scientists, engineers and practitioners for the purpose of presenting their findings and research outputs in numerous areas of computer applications. The organizing committee is grateful for your participation in this exiting international event. We hope that this conference proves interesting and beneficial. The Symposium is sponsored by the ACM Special Interest Group on Applied Computing (SIGAPP), whose mission is to further the interests of computing professionals engaged in the design and development of new computing applications, interdisciplinary applications areas, and applied research. This conference is dedicated to the study of applied research of real-world problems. This event provides an opportunity to discuss and exchange new ideas in the wide spectrum of application areas. We all recognize the importance of keeping up with the latest developments in our current areas of expertise.
{"title":"Proceedings of the Symposium on Applied Computing","authors":"Sung Y. Shin, Dongwan Shin, Maria Lencastre","doi":"10.1145/3019612","DOIUrl":"https://doi.org/10.1145/3019612","url":null,"abstract":"On behalf of the Organizing Committee, we welcome you to the 32nd Annual ACM Symposium on Applied Computing (SAC 2017). This international forum has been dedicated to computer scientists, engineers and practitioners for the purpose of presenting their findings and research outputs in numerous areas of computer applications. The organizing committee is grateful for your participation in this exiting international event. We hope that this conference proves interesting and beneficial. \u0000 \u0000The Symposium is sponsored by the ACM Special Interest Group on Applied Computing (SIGAPP), whose mission is to further the interests of computing professionals engaged in the design and development of new computing applications, interdisciplinary applications areas, and applied research. This conference is dedicated to the study of applied research of real-world problems. This event provides an opportunity to discuss and exchange new ideas in the wide spectrum of application areas. We all recognize the importance of keeping up with the latest developments in our current areas of expertise.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":"25 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81032014","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}
One of the major advantages of communication middleware is its independence from the underlying hardware platform. This improves portability and interoperability, whereas following the mainstream trend of favoring abstraction over performance or execution optimization. However, for time sensitive applications, this lack of integration with the hardware may fall short as performance is lowered and attention to priority requests is not sufficiently differentiated. In this paper, we propose a middleware that has a higher degree of integration with the underlying hardware platform; it uses the mechanisms of the operating system to control the use of the processing cores, reserving them as needed for supporting differentiated service to higher priority invoking nodes or clients. Results show that our middleware improves the service time of high priority clients and it offers stable communication times.
{"title":"Improving service time with a multicore aware middleware","authors":"M. García-Valls, Christian Calva-Urrego","doi":"10.1145/3019612.3019741","DOIUrl":"https://doi.org/10.1145/3019612.3019741","url":null,"abstract":"One of the major advantages of communication middleware is its independence from the underlying hardware platform. This improves portability and interoperability, whereas following the mainstream trend of favoring abstraction over performance or execution optimization. However, for time sensitive applications, this lack of integration with the hardware may fall short as performance is lowered and attention to priority requests is not sufficiently differentiated. In this paper, we propose a middleware that has a higher degree of integration with the underlying hardware platform; it uses the mechanisms of the operating system to control the use of the processing cores, reserving them as needed for supporting differentiated service to higher priority invoking nodes or clients. Results show that our middleware improves the service time of high priority clients and it offers stable communication times.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":"22 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81040799","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}
Smart spammers and telemarketers circumvent the standalone spam detection systems by making low rate spam-ming activity to a large number of recipients distributed across many telecommunication operators. The collaboration among multiple telecommunication operators (OPs) will allow operators to get rid of unwanted callers at the early stage of their spamming activity. The challenge in the design of collaborative spam detection system is that OPs are not willing to share certain information about behaviour of their users/customers because of privacy concerns. Ideally, operators agree to share certain aggregated statistical information if collaboration process ensures complete privacy protection of users and their network data. To address this challenge and convince OPs for the collaboration, this paper proposes a decentralized reputation aggregation protocol that enables OPs to take part in a collaboration process without use of a trusted third party centralized system and without developing a predefined trust relationship with other OPs. To this extent, the collaboration among operators is achieved through the exchange of cryptographic reputation scores among OPs thus fully protects relationship network and reputation scores of users even in the presence of colluders. We evaluate the performance of proposed protocol over the simulated data consisting of five collaborators. Experimental results revealed that proposed approach outperforms standalone systems in terms of true positive rate and false positive rate.
{"title":"Decentralized privacy-aware collaborative filtering of smart spammers in a telecommunication network","authors":"M. A. Azad, Samiran Bag","doi":"10.1145/3019612.3019792","DOIUrl":"https://doi.org/10.1145/3019612.3019792","url":null,"abstract":"Smart spammers and telemarketers circumvent the standalone spam detection systems by making low rate spam-ming activity to a large number of recipients distributed across many telecommunication operators. The collaboration among multiple telecommunication operators (OPs) will allow operators to get rid of unwanted callers at the early stage of their spamming activity. The challenge in the design of collaborative spam detection system is that OPs are not willing to share certain information about behaviour of their users/customers because of privacy concerns. Ideally, operators agree to share certain aggregated statistical information if collaboration process ensures complete privacy protection of users and their network data. To address this challenge and convince OPs for the collaboration, this paper proposes a decentralized reputation aggregation protocol that enables OPs to take part in a collaboration process without use of a trusted third party centralized system and without developing a predefined trust relationship with other OPs. To this extent, the collaboration among operators is achieved through the exchange of cryptographic reputation scores among OPs thus fully protects relationship network and reputation scores of users even in the presence of colluders. We evaluate the performance of proposed protocol over the simulated data consisting of five collaborators. Experimental results revealed that proposed approach outperforms standalone systems in terms of true positive rate and false positive rate.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":"13 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83346779","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}
According to Comscore1, Android users in the U.S spend an average of 2.8 hours per day using mobile media. On the other hand, according to Statista reports2, Android users were able to choose between 2.2 million applications on June 2016. Among these applications, there are ones reported by Google Android Security Service3 as malware, virus, or illegal theft. Many tools such as Dex2Jar4, apktool5, and jd-gui6 analyze and reverse engineer Android applications and can be used to illegally copy or transform the applications as well. In order to protect applications from piracy or illegal theft, it is necessary to detect theft by measuring application similarity. In the literature, previous studies on theft detection have measured application similarity at two levels, source or executable code level, which have some limitations. Source codes are not available if the codes are legacy one or are developed by upstream suppliers. In the case of the executable codes, application similarity is measured 1) using the source codes decompiled from the executables, or 2) using the characteristics extracted from the executables (i.e., birthmark). For example, DroidMoss [5] applied a fuzzy hashing technique to effectively localize and detect the changes from app-repackaging behavior. Reference [4] proposed software birthmarks to show the unique characteristics of a program and detected software theft based on the birthmarks.
{"title":"On computing similarity of android executables using text mining: student research abstract","authors":"Gyoosik Kim","doi":"10.1145/3019612.3019926","DOIUrl":"https://doi.org/10.1145/3019612.3019926","url":null,"abstract":"According to Comscore1, Android users in the U.S spend an average of 2.8 hours per day using mobile media. On the other hand, according to Statista reports2, Android users were able to choose between 2.2 million applications on June 2016. Among these applications, there are ones reported by Google Android Security Service3 as malware, virus, or illegal theft. Many tools such as Dex2Jar4, apktool5, and jd-gui6 analyze and reverse engineer Android applications and can be used to illegally copy or transform the applications as well. In order to protect applications from piracy or illegal theft, it is necessary to detect theft by measuring application similarity. In the literature, previous studies on theft detection have measured application similarity at two levels, source or executable code level, which have some limitations. Source codes are not available if the codes are legacy one or are developed by upstream suppliers. In the case of the executable codes, application similarity is measured 1) using the source codes decompiled from the executables, or 2) using the characteristics extracted from the executables (i.e., birthmark). For example, DroidMoss [5] applied a fuzzy hashing technique to effectively localize and detect the changes from app-repackaging behavior. Reference [4] proposed software birthmarks to show the unique characteristics of a program and detected software theft based on the birthmarks.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":"58 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90811866","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}
Trust in Social Internet of Things has allowed to open new horizons in collaborative networking, particularly by allowing objects to communicate with their service providers, based on their relationships analogy to human world. However, strengthening trust is a challenging task as it involves identifying several influential factors in each domain of social-cyber-physical systems in order to build a reliable system. In this paper, we address the issue of understanding and evaluating honesty that is an important trust metric in trustworthiness evaluation process in social networks. First, we identify and define several trust attributes, which affect directly to the honesty. Then, a subjective computational model is derived based on experiences of objects and opinions from friendly objects with respect to identified attributes. Based on the outputs of this model a final honest level is predicted using regression analysis. Finally, the effectiveness of our model is tested using simulations.
{"title":"A computational model to evaluate honesty in social internet of things","authors":"Upul Jayasinghe, Hyun-Woo Lee, G. Lee","doi":"10.1145/3019612.3019840","DOIUrl":"https://doi.org/10.1145/3019612.3019840","url":null,"abstract":"Trust in Social Internet of Things has allowed to open new horizons in collaborative networking, particularly by allowing objects to communicate with their service providers, based on their relationships analogy to human world. However, strengthening trust is a challenging task as it involves identifying several influential factors in each domain of social-cyber-physical systems in order to build a reliable system. In this paper, we address the issue of understanding and evaluating honesty that is an important trust metric in trustworthiness evaluation process in social networks. First, we identify and define several trust attributes, which affect directly to the honesty. Then, a subjective computational model is derived based on experiences of objects and opinions from friendly objects with respect to identified attributes. Based on the outputs of this model a final honest level is predicted using regression analysis. Finally, the effectiveness of our model is tested using simulations.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":"66 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89945860","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}
The world nowadays revolves around dealing with extreme large amount of data presented in various formats. So it is inevitable that researchers focus on advancing the state of managing information. From here, the importance of database technology ranks amongst the hottest areas of research, taking into account the consistent need for faster query processing as well as for managing huge amounts of data. This year the track has received many papers covering different areas of databases.
{"title":"Session details: DTTA - database theory, technology and applications track","authors":"","doi":"10.1145/3243959","DOIUrl":"https://doi.org/10.1145/3243959","url":null,"abstract":"The world nowadays revolves around dealing with extreme large amount of data presented in various formats. So it is inevitable that researchers focus on advancing the state of managing information. From here, the importance of database technology ranks amongst the hottest areas of research, taking into account the consistent need for faster query processing as well as for managing huge amounts of data. This year the track has received many papers covering different areas of databases.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":"3860 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86687657","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}
Ahmed Halioui, Tomas Martin, Petko Valtchev, Abdoulaye Baniré Diallo
Workflow platforms enable the construction of solutions to complex problems as step-wise processes made of components including methods, tools, data formats, parameters, etc. Successful workflow solutions require a mastering of the different components paving the way to automated acquisition of problem solving expertise. Thus, process mining could be applied to discover workflow patterns. Due to the combinatorics of component instances in rich domains such as bioinformatics, generalized patterns could be a relevant way of abstraction. Here, we propose an approach for mining workflow patterns, defined on the top of a domain ontology which categorizes workflow elements and their interactions. While original workflows are doubly-labelled DAGs, the underlying problem is transformed into a mining of generalized sequential patterns with links between their items. The proposed mining method traverses the ensuing pattern space using five refinement primitives that exploit the is-a links from the ontology. To assess the prediction power of the approach, we applied the generated patterns as templates in a recommendation platform to complete partial workflows under construction. The analyses of recommendations vs. actual content of a real-world dataset reveals that non trivial patterns can be found and further used to provide plausible recommendations with high accuracies (fMeasure >75+).
{"title":"Ontology-based workflow pattern mining: application to bioinformatics expertise acquisition","authors":"Ahmed Halioui, Tomas Martin, Petko Valtchev, Abdoulaye Baniré Diallo","doi":"10.1145/3019612.3019866","DOIUrl":"https://doi.org/10.1145/3019612.3019866","url":null,"abstract":"Workflow platforms enable the construction of solutions to complex problems as step-wise processes made of components including methods, tools, data formats, parameters, etc. Successful workflow solutions require a mastering of the different components paving the way to automated acquisition of problem solving expertise. Thus, process mining could be applied to discover workflow patterns. Due to the combinatorics of component instances in rich domains such as bioinformatics, generalized patterns could be a relevant way of abstraction. Here, we propose an approach for mining workflow patterns, defined on the top of a domain ontology which categorizes workflow elements and their interactions. While original workflows are doubly-labelled DAGs, the underlying problem is transformed into a mining of generalized sequential patterns with links between their items. The proposed mining method traverses the ensuing pattern space using five refinement primitives that exploit the is-a links from the ontology. To assess the prediction power of the approach, we applied the generated patterns as templates in a recommendation platform to complete partial workflows under construction. The analyses of recommendations vs. actual content of a real-world dataset reveals that non trivial patterns can be found and further used to provide plausible recommendations with high accuracies (fMeasure >75+).","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":"2015 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87775512","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}
In this paper we analyze hybrid scan matching algorithms and we test their performances in typical mobile applications. Since the genetic algorithm is robust but not very accurate, and ICP is accurate but not very robust, it is natural to use the two algorithms in a cascade fashion: first we run a genetic optimization to find an approximate but robust matching solution and then we run the Iterative Closest Point (ICP) algorithm to increase the accuracy. The proposed genetic algorithm is very fast due to a look-up table formulation and very robust against large errors in both distance and angle during scan data acquisition. It is worth mentioning that large scan errors arise very commonly in mobile object applications due, for instance, to wheel slippage or when closing loops. We show experimentally that the proposed algorithm successfully copes with large localization errors.
{"title":"An effective and efficient hybrid scan matching algorithm for mobile object applications","authors":"K. Lenac, A. Cuzzocrea, E. Mumolo","doi":"10.1145/3019612.3019720","DOIUrl":"https://doi.org/10.1145/3019612.3019720","url":null,"abstract":"In this paper we analyze hybrid scan matching algorithms and we test their performances in typical mobile applications. Since the genetic algorithm is robust but not very accurate, and ICP is accurate but not very robust, it is natural to use the two algorithms in a cascade fashion: first we run a genetic optimization to find an approximate but robust matching solution and then we run the Iterative Closest Point (ICP) algorithm to increase the accuracy. The proposed genetic algorithm is very fast due to a look-up table formulation and very robust against large errors in both distance and angle during scan data acquisition. It is worth mentioning that large scan errors arise very commonly in mobile object applications due, for instance, to wheel slippage or when closing loops. We show experimentally that the proposed algorithm successfully copes with large localization errors.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":"122 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88110666","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：