Jarkko Hyysalo, Gavin Harper, J. Sauvola, A. Keskinarkaus, I. Juuso, Miikka Salminen, Juha Partala
The architecture of a system specifies how the system should be designed and built. However, shortcomings are identified in current architecture process frameworks concerning evolving domains like healthcare. We claim that an iterative architecture process is required, where the technical concerns are separated from the non-technical ones. Furthermore, a strong guiding vision is required. Based on our experiences from a biobank IT infrastructure process, we present an architecture process that is modular, interoperable, controlled and abstracted, thus being capable of handling complex systems with large uncertainties.
{"title":"Defining an architecture for evolving environments","authors":"Jarkko Hyysalo, Gavin Harper, J. Sauvola, A. Keskinarkaus, I. Juuso, Miikka Salminen, Juha Partala","doi":"10.1145/3019612.3019902","DOIUrl":"https://doi.org/10.1145/3019612.3019902","url":null,"abstract":"The architecture of a system specifies how the system should be designed and built. However, shortcomings are identified in current architecture process frameworks concerning evolving domains like healthcare. We claim that an iterative architecture process is required, where the technical concerns are separated from the non-technical ones. Furthermore, a strong guiding vision is required. Based on our experiences from a biobank IT infrastructure process, we present an architecture process that is modular, interoperable, controlled and abstracted, thus being capable of handling complex systems with large uncertainties.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":"09 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85864027","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}
Modeling correct software-intensive Systems of Systems architectures is a challenging research direction that can be mastered by providing modeling abstractions. For this purpose, we provide an iterative modeling solution for a multi-scale description of software architectures. We provide a visual notation extending the graphical UML notations to represent structural as well as behavioral features of software architectures. We define a step-wise iterative process from a coarse-grain to a fine-grain description. The intermediate iterations provide a description with a given abstraction that allow the validation to be conducted significantly while remaining tractable w.r.t. complexity. The iterative process involves both system-independent structural features ensuring the model correctness, and system-specific features related to the expected behavior of the modeled domain. We apply our approach for a methodological design of an Emergency Response and Crisis Management System (ERCMS).
{"title":"Iterative multi-scale modeling of software-intensive systems of systems architectures","authors":"Ilhem Khlif, M. Kacem, A. Kacem","doi":"10.1145/3019612.3019801","DOIUrl":"https://doi.org/10.1145/3019612.3019801","url":null,"abstract":"Modeling correct software-intensive Systems of Systems architectures is a challenging research direction that can be mastered by providing modeling abstractions. For this purpose, we provide an iterative modeling solution for a multi-scale description of software architectures. We provide a visual notation extending the graphical UML notations to represent structural as well as behavioral features of software architectures. We define a step-wise iterative process from a coarse-grain to a fine-grain description. The intermediate iterations provide a description with a given abstraction that allow the validation to be conducted significantly while remaining tractable w.r.t. complexity. The iterative process involves both system-independent structural features ensuring the model correctness, and system-specific features related to the expected behavior of the modeled domain. We apply our approach for a methodological design of an Emergency Response and Crisis Management System (ERCMS).","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":"71 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85920226","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}
Pikakshi Manchanda, E. Fersini, M. Palmonari, Debora Nozza, E. Messina
Numerous state-of-the-art Named Entity Recognition (NER) systems use different classification schemas/ontologies. Comparisons and integration among NER systems, thus, becomes complex. In this paper, we propose a transfer-learning approach where we use supervised learning methods to automatically learn mappings between ontologies of NER systems, where an input probability distribution over a set of entity types defined in a source ontology is mapped to a target distribution over the entity types defined for a target ontology. Experiments conducted with benchmark data show valuable re-classification performance of entity mentions, suggesting our approach as a promising one for domain adaptation of NER systems.
{"title":"Towards adaptation of named entity classification","authors":"Pikakshi Manchanda, E. Fersini, M. Palmonari, Debora Nozza, E. Messina","doi":"10.1145/3019612.3022188","DOIUrl":"https://doi.org/10.1145/3019612.3022188","url":null,"abstract":"Numerous state-of-the-art Named Entity Recognition (NER) systems use different classification schemas/ontologies. Comparisons and integration among NER systems, thus, becomes complex. In this paper, we propose a transfer-learning approach where we use supervised learning methods to automatically learn mappings between ontologies of NER systems, where an input probability distribution over a set of entity types defined in a source ontology is mapped to a target distribution over the entity types defined for a target ontology. Experiments conducted with benchmark data show valuable re-classification performance of entity mentions, suggesting our approach as a promising one for domain adaptation of NER systems.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":"55 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79427316","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 optimization of similarity queries is often done with specialized data structures known as metric access methods. It has recently been proposed the use of B+trees to index high dimensional data for range and nearest neighbor search in metric spaces. This work1 introduces a new access method called GroupSim and query algorithms for indexing and retrieving complex data by similarity. It employs a single B+tree in order to dynamically index data elements with regard to a set of one-dimensional embeddings. Our strategy uses a new scheme to store distance information, allowing to determine directly if each element lies on the intersection of the embeddings. We compare GroupSim with two related methods, iDistance and OmniB-Forest, and we show empirically the new access method outperforms them with regard to the time required to run similarity queries.
{"title":"Similarity search through one-dimensional embeddings","authors":"H. Razente, Rafael L. Bernardes Lima, M. Barioni","doi":"10.1145/3019612.3019674","DOIUrl":"https://doi.org/10.1145/3019612.3019674","url":null,"abstract":"The optimization of similarity queries is often done with specialized data structures known as metric access methods. It has recently been proposed the use of B+trees to index high dimensional data for range and nearest neighbor search in metric spaces. This work1 introduces a new access method called GroupSim and query algorithms for indexing and retrieving complex data by similarity. It employs a single B+tree in order to dynamically index data elements with regard to a set of one-dimensional embeddings. Our strategy uses a new scheme to store distance information, allowing to determine directly if each element lies on the intersection of the embeddings. We compare GroupSim with two related methods, iDistance and OmniB-Forest, and we show empirically the new access method outperforms them with regard to the time required to run similarity queries.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":"19 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90396480","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":"23 1","pages":""},"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}
Michael Rovatsos, Dimitrios I. Diochnos, Z. Wen, S. Ceppi, Pavlos Andreadis
Web-based collaborative systems, where most computation is performed by human collectives, have distinctly different requirements from traditional workflow orchestration systems, as humans have to be mobilised to perform computations and the system has to adapt to their collective behaviour at runtime. In this paper, we present a social orchestration system called SmartOrch, which has been designed specifically for collective adaptive systems in which human participation is at the core of the overall distributed computation. SmartOrch provides a flexible and customisable workflow composition framework that has multi-level optimisation capabilities. These features allow us to manage the uncertainty that collective adaptive systems need to deal with in a principled way. We demonstrate the benefits of SmartOrch with simulation experiments in a ridesharing domain. Our experiments show that SmartOrch is able to respond flexibly to variation in collective human behaviour, and to adapt to observed behaviour at different levels. This is accomplished by learning how to propose and route human-based tasks, how to allocate computational resources when managing these tasks, and how to adapt the overall interaction model of the platform based on past performance. By proposing novel, solid engineering principles for these kinds of systems, SmartOrch addresses shortcomings of previous work that mostly focused on application-specific, non-adaptive solutions.
{"title":"SmartOrch: an adaptive orchestration system for human-machine collectives","authors":"Michael Rovatsos, Dimitrios I. Diochnos, Z. Wen, S. Ceppi, Pavlos Andreadis","doi":"10.1145/3019612.3019623","DOIUrl":"https://doi.org/10.1145/3019612.3019623","url":null,"abstract":"Web-based collaborative systems, where most computation is performed by human collectives, have distinctly different requirements from traditional workflow orchestration systems, as humans have to be mobilised to perform computations and the system has to adapt to their collective behaviour at runtime. In this paper, we present a social orchestration system called SmartOrch, which has been designed specifically for collective adaptive systems in which human participation is at the core of the overall distributed computation. SmartOrch provides a flexible and customisable workflow composition framework that has multi-level optimisation capabilities. These features allow us to manage the uncertainty that collective adaptive systems need to deal with in a principled way. We demonstrate the benefits of SmartOrch with simulation experiments in a ridesharing domain. Our experiments show that SmartOrch is able to respond flexibly to variation in collective human behaviour, and to adapt to observed behaviour at different levels. This is accomplished by learning how to propose and route human-based tasks, how to allocate computational resources when managing these tasks, and how to adapt the overall interaction model of the platform based on past performance. By proposing novel, solid engineering principles for these kinds of systems, SmartOrch addresses shortcomings of previous work that mostly focused on application-specific, non-adaptive solutions.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":"48 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78854023","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 special track on Intelligent Robotics and Multi-Agent Systems (IRMAS) focuses on all aspects of intelligent robotics and multi-agent systems (MAS) including related areas and applications. Its primary goal is to exploit synergies between robotics and artificial intelligence (AI), more precisely between intelligent robotics and MAS, and bring together researchers from both fields. For many years, robotics and AI researchers have worked separately, both fields have matured enormously, and today there is a growing interest in getting the two research fields together. Many in robotics believe that the focus in the near future should be adding capabilities to robots that lie at the core of AI research. Reciprocally, AI researchers aim at embedding their techniques in physical robots that can perceive, reason and act in real, dynamic environments.
{"title":"Session details: IRMAS - intelligent robotics and multi-agent systems track","authors":"","doi":"10.1145/3243947","DOIUrl":"https://doi.org/10.1145/3243947","url":null,"abstract":"The special track on Intelligent Robotics and Multi-Agent Systems (IRMAS) focuses on all aspects of intelligent robotics and multi-agent systems (MAS) including related areas and applications. Its primary goal is to exploit synergies between robotics and artificial intelligence (AI), more precisely between intelligent robotics and MAS, and bring together researchers from both fields. For many years, robotics and AI researchers have worked separately, both fields have matured enormously, and today there is a growing interest in getting the two research fields together. Many in robotics believe that the focus in the near future should be adding capabilities to robots that lie at the core of AI research. Reciprocally, AI researchers aim at embedding their techniques in physical robots that can perceive, reason and act in real, dynamic environments.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":"20 9-10 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78179260","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}
Self-adaptive systems alter their behavior in response to environmental changes to continually satisfy their requirements. Self-adaptive systems employ an environment model, which should be updated during runtime to maintain consistency with the real environment. Although some techniques have been proposed to learn environment model based on execution traces at the design time, these techniques are time consuming and consequently inappropriate for runtime learning. Herein, a technique using a stochastic gradient descent and the difference in the data acquired during the runtime is proposed as an efficient learning environment model. The computational time and accuracy of our technique are verified through study.
{"title":"Learning environment model at runtime for self-adaptive systems","authors":"Moeka Tanabe, K. Tei, Y. Fukazawa, S. Honiden","doi":"10.1145/3019612.3019776","DOIUrl":"https://doi.org/10.1145/3019612.3019776","url":null,"abstract":"Self-adaptive systems alter their behavior in response to environmental changes to continually satisfy their requirements. Self-adaptive systems employ an environment model, which should be updated during runtime to maintain consistency with the real environment. Although some techniques have been proposed to learn environment model based on execution traces at the design time, these techniques are time consuming and consequently inappropriate for runtime learning. Herein, a technique using a stochastic gradient descent and the difference in the data acquired during the runtime is proposed as an efficient learning environment model. The computational time and accuracy of our technique are verified through study.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":"38 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78962525","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 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":"7 1","pages":""},"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}
Login webpages are the entry points into sensitive parts of web applications, dividing between public access to a website and private, user-specific, access to the website resources. As such, these entry points must be guarded with great care. A vast majority of today's websites relies on text-based user-name/password pairs for user authentication. While much prior research has focused on the strengths and weaknesses of textual passwords, this paper puts a spotlight on the security of the login webpages themselves. We conduct an empirical study of the Alexa top 100,000 pages to identify login pages and scrutinize their security. Our findings show several widely spread vulnerabilities, such as possibilities for password leaks to third parties and password eavesdropping on the network. They also show that only a scarce number of login pages deploy advanced security measures. Our findings on open-source web frameworks and content management systems confirm the lack of support against the login attacker. To ameliorate the problematic state of the art, we discuss measures to improve the security of login pages.
{"title":"Measuring login webpage security","authors":"S. Acker, Daniel Hausknecht, A. Sabelfeld","doi":"10.1145/3019612.3019798","DOIUrl":"https://doi.org/10.1145/3019612.3019798","url":null,"abstract":"Login webpages are the entry points into sensitive parts of web applications, dividing between public access to a website and private, user-specific, access to the website resources. As such, these entry points must be guarded with great care. A vast majority of today's websites relies on text-based user-name/password pairs for user authentication. While much prior research has focused on the strengths and weaknesses of textual passwords, this paper puts a spotlight on the security of the login webpages themselves. We conduct an empirical study of the Alexa top 100,000 pages to identify login pages and scrutinize their security. Our findings show several widely spread vulnerabilities, such as possibilities for password leaks to third parties and password eavesdropping on the network. They also show that only a scarce number of login pages deploy advanced security measures. Our findings on open-source web frameworks and content management systems confirm the lack of support against the login attacker. To ameliorate the problematic state of the art, we discuss measures to improve the security of login pages.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":"14 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88709118","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
扫码关注我们
求助内容：
应助结果提醒方式：