The widespread use of service-oriented and cloud computing is creating a need for a communication-based programming approach to distributed concurrent software systems. Protocols play a central role in the design and development of such systems but mainstream programming languages still give poor support to ensure protocol compatibility. Testing alone is insufficient to ensure it, so there is a pressing need for tools to assist the development of these kind of systems. While there are tools to verify statically object-oriented code equipped with assertions, these mainly help to prevent runtime errors. However, a program can be ill-behaved and still execute without terminating abruptly. It is important to guarantee that the code implements correctly its communication protocol. Our contribution is a tool to analyse source code written in a subset of Java, equipped with assertions, and return it annotated with its respective behavioural types that can be used to verify statically that the code implements the intended protocol of the application. A running example illustrates each step of the tool.
{"title":"From object-oriented code with assertions to behavioural types","authors":"Cláudio Vasconcelos, A. Ravara","doi":"10.1145/3019612.3019733","DOIUrl":"https://doi.org/10.1145/3019612.3019733","url":null,"abstract":"The widespread use of service-oriented and cloud computing is creating a need for a communication-based programming approach to distributed concurrent software systems. Protocols play a central role in the design and development of such systems but mainstream programming languages still give poor support to ensure protocol compatibility. Testing alone is insufficient to ensure it, so there is a pressing need for tools to assist the development of these kind of systems. While there are tools to verify statically object-oriented code equipped with assertions, these mainly help to prevent runtime errors. However, a program can be ill-behaved and still execute without terminating abruptly. It is important to guarantee that the code implements correctly its communication protocol. Our contribution is a tool to analyse source code written in a subset of Java, equipped with assertions, and return it annotated with its respective behavioural types that can be used to verify statically that the code implements the intended protocol of the application. A running example illustrates each step of the tool.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84739431","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}
This paper proposes a computational framework to reason with conflicting and gradual evidence. The framework is a synthesis of Dung's seminal work in argumentation semantics with multi-valued logic. Abstract grounded semantics is used to identify the conditions under which a conclusion can be accepted, while multi-valued logic operators are used to quantify the degree of truth of such conditions. We propose a truth-compositional recursive computation based on the notion of irrelevant arguments, and we discuss examples using the major multi-valued logics: Godel's, Zadeh's and Łukasiewicz's logic.
{"title":"Propagating degrees of truth on an argumentation framework: an abstract account of fuzzy argumentation","authors":"Pierpaolo Dondio","doi":"10.1145/3019612.3019717","DOIUrl":"https://doi.org/10.1145/3019612.3019717","url":null,"abstract":"This paper proposes a computational framework to reason with conflicting and gradual evidence. The framework is a synthesis of Dung's seminal work in argumentation semantics with multi-valued logic. Abstract grounded semantics is used to identify the conditions under which a conclusion can be accepted, while multi-valued logic operators are used to quantify the degree of truth of such conditions. We propose a truth-compositional recursive computation based on the notion of irrelevant arguments, and we discuss examples using the major multi-valued logics: Godel's, Zadeh's and Łukasiewicz's logic.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85087515","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}
Jinghui Toh, Muhammad Hatib, Omer Porzecanski, Y. Elovici
Many printers nowadays support Wi-Fi connectivity. Some organizations opt to disable their printer's wireless connectivity, others are not aware at all that it is enabled and some enable it in an encrypted form. In this paper we demonstrate how an application called "pFaker" running on a mobile device or smart watch can be used to mimic a printer's Wi-Fi connectivity and functionalities in order to harm user privacy by unobtrusively stealing print jobs. To mitigate these risks, we developed a mobile application called "Cyber-Security Patrol". We demonstrate how a mobile phone running Cyber-Security patrol can be placed on a drone or an autonomous vacuum cleaner to search for devices that try to mimic the printer's Wi-Fi connectivity and for printers that expose unsecured wireless connection in the target organization. Cyber-Security Patrol takes photos of the location where unauthorized Wi-Fi enabled printers were detected and sends them to the organization's administrator. For cases that the Wi-Fi enabled printer is legitimate but unsecured, Cyber Security Patrol sends a print job to the printer with detailed instructions on how to secure the specific printer model as identified based on its Service Set Identifier (SSID). A demo that demonstrates one of the use cases can be found here: https://www.youtube.com/watch?v=aJ2ZG04BrjM
{"title":"Cyber security patrol: detecting fake and vulnerable wifi-enabled printers","authors":"Jinghui Toh, Muhammad Hatib, Omer Porzecanski, Y. Elovici","doi":"10.1145/3019612.3019722","DOIUrl":"https://doi.org/10.1145/3019612.3019722","url":null,"abstract":"Many printers nowadays support Wi-Fi connectivity. Some organizations opt to disable their printer's wireless connectivity, others are not aware at all that it is enabled and some enable it in an encrypted form. In this paper we demonstrate how an application called \"pFaker\" running on a mobile device or smart watch can be used to mimic a printer's Wi-Fi connectivity and functionalities in order to harm user privacy by unobtrusively stealing print jobs. To mitigate these risks, we developed a mobile application called \"Cyber-Security Patrol\". We demonstrate how a mobile phone running Cyber-Security patrol can be placed on a drone or an autonomous vacuum cleaner to search for devices that try to mimic the printer's Wi-Fi connectivity and for printers that expose unsecured wireless connection in the target organization. Cyber-Security Patrol takes photos of the location where unauthorized Wi-Fi enabled printers were detected and sends them to the organization's administrator. For cases that the Wi-Fi enabled printer is legitimate but unsecured, Cyber Security Patrol sends a print job to the printer with detailed instructions on how to secure the specific printer model as identified based on its Service Set Identifier (SSID). A demo that demonstrates one of the use cases can be found here: https://www.youtube.com/watch?v=aJ2ZG04BrjM","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90799888","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}
Software clustering is a common technique applied to simplify reverse engineered software models. These algorithms commonly classify similarity between nodes based on their relationships. However little research exists that discusses the importance of the direction of these relationships. In this paper we provide empirical data for how treating direction in entity relationships affect the recovery accuracy of hierarchical clustering algorithms. We test variations of a hierarchical clustering algorithm on several open source systems and compare their results, and conclude that relationship direction does not have a significant impact on recovery accuracy. As such, researchers may opt to implement hierarchical clustering algorithms using only one direction of relations instead of both, and still get similar results for less computational cost.
{"title":"On the significance of relationship directions in clustering algorithms for reverse engineering","authors":"David D. Jensen, Andreas Lundkvist, I. Hammouda","doi":"10.1145/3019612.3019782","DOIUrl":"https://doi.org/10.1145/3019612.3019782","url":null,"abstract":"Software clustering is a common technique applied to simplify reverse engineered software models. These algorithms commonly classify similarity between nodes based on their relationships. However little research exists that discusses the importance of the direction of these relationships. In this paper we provide empirical data for how treating direction in entity relationships affect the recovery accuracy of hierarchical clustering algorithms. We test variations of a hierarchical clustering algorithm on several open source systems and compare their results, and conclude that relationship direction does not have a significant impact on recovery accuracy. As such, researchers may opt to implement hierarchical clustering algorithms using only one direction of relations instead of both, and still get similar results for less computational cost.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90973753","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}
G. Reggio, Maurizio Leotta, Diego Clerissi, F. Ricca
We present Precise Service-Oriented Modelling (Precise SOM) - a novel lightweight method for integrated domain and business process modelling, which follows the service-oriented paradigm, and uses a UML profile as notation - and a detailed workflow to guide the production of the models. In our method the produced UML models are precisely defined by means of a metamodel, a set of constraints, and a limited set of UML constructs to help modellers to avoid common mistakes and to guarantee, by construction, a good quality. Precise SOM has been successfully used in an industry-academic project concerning the modelling of a big harbour.
{"title":"Service-oriented domain and business process modelling","authors":"G. Reggio, Maurizio Leotta, Diego Clerissi, F. Ricca","doi":"10.1145/3019612.3019621","DOIUrl":"https://doi.org/10.1145/3019612.3019621","url":null,"abstract":"We present Precise Service-Oriented Modelling (Precise SOM) - a novel lightweight method for integrated domain and business process modelling, which follows the service-oriented paradigm, and uses a UML profile as notation - and a detailed workflow to guide the production of the models. In our method the produced UML models are precisely defined by means of a metamodel, a set of constraints, and a limited set of UML constructs to help modellers to avoid common mistakes and to guarantee, by construction, a good quality. Precise SOM has been successfully used in an industry-academic project concerning the modelling of a big harbour.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89659577","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}
Default conditionals are statements that express a condition of normality, in the form 'ifφ then normally ψ' and are of primary importance in Knowledge Representation. There exist modal approaches to the construction of conditional logics of normality. Most of them are built on notions of preference among possible worlds, corresponding to the semantic intuition that (φ ⇒ &psi) is true in a situation if in the most preferred (most 'normal') situations in which φ is true, &psi is also true. It has been noticed that there exist natural epistemic readings of a default conditional, but this direction has not been thoroughly explored. A statement of the form 'something known to be a bird, that can be consistently believed to fly, does fly' involves well-known epistemic attitudes and allows the possibility of defining defaults within the rich framework of Epistemic Logic. We pursue this direction here within KBE, a recently introduced S4.2-based modal logic of knowledge, belief and estimation. In this logic, knowledge is a normal S4 operator, belief is a normal KD45 operator and estimation is a non-normal operator interpreted as a 'majority' quantifier over the set of epistemically alternative situations. We define and explore various conditionals using the epistemic operators of KBE, capturing (φ ⇒ &psi) in various ways, including 'it is known that assuming φ allows us to assume φ ∧ &psi' or 'if φ is known and there is no reason to believe ¬ψ then ψ can be plausibly inferred'. Overall, we define here two weak nonmonotonic default conditionals, one monotonic conditional and two stronger nonmonotonic conditionals without axiom ID. Our results provide concrete evidence that the machinery of epistemic logic can be exploited for the study of default conditionals.
默认条件是表示正态性条件的语句，其形式为" ifφ then usually ψ "，在知识表示中是最重要的。存在构造条件正态逻辑的模态方法。它们中的大多数是建立在可能世界之间的偏好概念上的，对应于语义直觉，即(φ⇒&psi)在φ为真的最优选(最“正常”)情况下为真，且&psi也为真。人们注意到默认条件语存在自然的认识论解读，但这一方向尚未深入探讨。"已知某物是鸟，可以一直相信它会飞，它确实会飞"这种形式的陈述包含了众所周知的认知态度，并允许在认知逻辑的丰富框架内定义默认值的可能性。我们在KBE中追求这个方向，KBE是最近引入的基于s4.2的知识、信念和估计模态逻辑。在这个逻辑中，知识是一个正常的S4算子，信念是一个正常的KD45算子，而估计是一个非正常算子，被解释为一组认知可选情况上的“多数”量词。我们使用KBE的认知运算符定义和探索各种条件，以各种方式捕获(φ⇒&psi)，包括“已知假设φ允许我们假设φ∧&psi”或“如果φ已知并且没有理由相信ψ，则可以合理地推断出ψ”。总的来说，我们定义了两个弱非单调默认条件，一个单调条件和两个不带公理ID的强非单调条件。我们的研究结果提供了具体的证据，证明认知逻辑机制可以用于默认条件的研究。
{"title":"A reconstruction of default conditionals within epistemic logic","authors":"Costas D. Koutras, C. Moyzes, Christos Rantsoudis","doi":"10.1145/3019612.3019714","DOIUrl":"https://doi.org/10.1145/3019612.3019714","url":null,"abstract":"Default conditionals are statements that express a condition of normality, in the form 'ifφ then normally ψ' and are of primary importance in Knowledge Representation. There exist modal approaches to the construction of conditional logics of normality. Most of them are built on notions of preference among possible worlds, corresponding to the semantic intuition that (φ ⇒ &psi) is true in a situation if in the most preferred (most 'normal') situations in which φ is true, &psi is also true. It has been noticed that there exist natural epistemic readings of a default conditional, but this direction has not been thoroughly explored. A statement of the form 'something known to be a bird, that can be consistently believed to fly, does fly' involves well-known epistemic attitudes and allows the possibility of defining defaults within the rich framework of Epistemic Logic. We pursue this direction here within KBE, a recently introduced S4.2-based modal logic of knowledge, belief and estimation. In this logic, knowledge is a normal S4 operator, belief is a normal KD45 operator and estimation is a non-normal operator interpreted as a 'majority' quantifier over the set of epistemically alternative situations. We define and explore various conditionals using the epistemic operators of KBE, capturing (φ ⇒ &psi) in various ways, including 'it is known that assuming φ allows us to assume φ ∧ &psi' or 'if φ is known and there is no reason to believe ¬ψ then ψ can be plausibly inferred'. Overall, we define here two weak nonmonotonic default conditionals, one monotonic conditional and two stronger nonmonotonic conditionals without axiom ID. Our results provide concrete evidence that the machinery of epistemic logic can be exploited for the study of default conditionals.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84405960","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}
Nowadays, we are assisting to three continuously demands from companies: (i) developing analytical applications around Data Warehouse systems (DW) from numerous data sources, (ii) the explicitation the semantic of these sources to reduce heterogeneities and (iii) contextualization of sources. By examining the literature, we identify the existence of several efforts attempting to offer solutions merging these three issues. The merging has been performed partially. To be more concrete, we have identified that the two first demands have been merged. Similarly, the second and the third ones gave raise to contextual ontologies. Unfortunately, all three are not well merged. This paper proposes a comprehensive methodology to design multi-contextual semantic DWs. Our approach consists first in merging context and ontologies and then with DWs. Firstly, a connection between ontologies and context model is built at meta model level. Secondly, a formalization of multi-contextual semantic data warehouse is given, followed by a deep description of the most important steps of the data warehouse design. Finally, a case tool and experiments are conducted using a contextualized hospital ontology to show the effectiveness of our approach.
{"title":"Bridging context and data warehouses through ontologies","authors":"Okba Barkat, Selma Khouri, Ladjel Bellatreche, Boustia Narhimene","doi":"10.1145/3019612.3019838","DOIUrl":"https://doi.org/10.1145/3019612.3019838","url":null,"abstract":"Nowadays, we are assisting to three continuously demands from companies: (i) developing analytical applications around Data Warehouse systems (DW) from numerous data sources, (ii) the explicitation the semantic of these sources to reduce heterogeneities and (iii) contextualization of sources. By examining the literature, we identify the existence of several efforts attempting to offer solutions merging these three issues. The merging has been performed partially. To be more concrete, we have identified that the two first demands have been merged. Similarly, the second and the third ones gave raise to contextual ontologies. Unfortunately, all three are not well merged. This paper proposes a comprehensive methodology to design multi-contextual semantic DWs. Our approach consists first in merging context and ontologies and then with DWs. Firstly, a connection between ontologies and context model is built at meta model level. Secondly, a formalization of multi-contextual semantic data warehouse is given, followed by a deep description of the most important steps of the data warehouse design. Finally, a case tool and experiments are conducted using a contextualized hospital ontology to show the effectiveness of our approach.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84412923","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}
Vinícius R. Machado, A. Braga, Natália Rampon, J. L. Bez, F. Boito, Rodrigo Kassick, E. Padoin, J. Diaz, J. Méhaut, P. Navaux
As large-scale parallel platforms are deployed to comply with the increasing performance requirements of scientific applications, a new concern is getting the attention of the HPC community: the power consumption. In this paper, we aim at evaluating the viability of using low-power architectures as file systems servers in HPC environments, since processing power is of less importance for these servers. We present a performance and energy efficiency study of such low-power servers when compared to conventional architectures. Our results indicate that the low-power alternative could be a viable choice to save energy by up to 85+ while not compromising on performance, specially for read-intensive workloads. We show the low-power server provides 7 times more energy efficiency to the system while running a real application from the seismic wave propagation field.
{"title":"Towards energy-efficient storage servers","authors":"Vinícius R. Machado, A. Braga, Natália Rampon, J. L. Bez, F. Boito, Rodrigo Kassick, E. Padoin, J. Diaz, J. Méhaut, P. Navaux","doi":"10.1145/3019612.3019742","DOIUrl":"https://doi.org/10.1145/3019612.3019742","url":null,"abstract":"As large-scale parallel platforms are deployed to comply with the increasing performance requirements of scientific applications, a new concern is getting the attention of the HPC community: the power consumption. In this paper, we aim at evaluating the viability of using low-power architectures as file systems servers in HPC environments, since processing power is of less importance for these servers. We present a performance and energy efficiency study of such low-power servers when compared to conventional architectures. Our results indicate that the low-power alternative could be a viable choice to save energy by up to 85+ while not compromising on performance, specially for read-intensive workloads. We show the low-power server provides 7 times more energy efficiency to the system while running a real application from the seismic wave propagation field.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87894923","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":"Session details: PAPP - practical aspects of high-level parallel programming track","authors":"","doi":"10.1145/3243972","DOIUrl":"https://doi.org/10.1145/3243972","url":null,"abstract":"","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86578995","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}
Fiducial markers have a wide field of applications in robotics, ranging from external localisation of single robots or robotic swarms, over self-localisation in marker-augmented environments, to simplifying perception by tagging objects in a robot's surrounding. We propose a new family of circular markers allowing for a computationally efficient detection, identification and full 3D position estimation. A key concept of our system is the separation of the detection and identification steps, where the first step is based on a computationally efficient circular marker detection, and the identification step is based on an open-ended 'Necklace code', which allows for a theoretically infinite number of individually identifiable markers. The experimental evaluation of the system on a real robot indicates that while the proposed algorithm achieves similar accuracy to other state-of-the-art methods, it is faster by two orders of magnitude and it can detect markers from longer distances.
{"title":"A versatile high-performance visual fiducial marker detection system with scalable identity encoding","authors":"P. Lightbody, T. Krajník, Marc Hanheide","doi":"10.1145/3019612.3019709","DOIUrl":"https://doi.org/10.1145/3019612.3019709","url":null,"abstract":"Fiducial markers have a wide field of applications in robotics, ranging from external localisation of single robots or robotic swarms, over self-localisation in marker-augmented environments, to simplifying perception by tagging objects in a robot's surrounding. We propose a new family of circular markers allowing for a computationally efficient detection, identification and full 3D position estimation. A key concept of our system is the separation of the detection and identification steps, where the first step is based on a computationally efficient circular marker detection, and the identification step is based on an open-ended 'Necklace code', which allows for a theoretically infinite number of individually identifiable markers. The experimental evaluation of the system on a real robot indicates that while the proposed algorithm achieves similar accuracy to other state-of-the-art methods, it is faster by two orders of magnitude and it can detect markers from longer distances.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81565575","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
扫码关注我们
求助内容：
应助结果提醒方式：