发布求助
文献互助 智能选刊 最新文献

Proceedings of the Symposium on Applied Computing最新文献

筛选
英文 中文
Leveraging the adoption of electronic identities and electronic-signature solutions in Europe 利用欧洲采用的电子身份和电子签名解决方案
Proceedings of the Symposium on Applied Computing Pub Date : 2017-04-03 DOI: 10.1145/3019612.3019885
Alexander Marsalek, Thomas Zefferer, Florian Reimair, Ç. Karabat, Elif Ustundag Soykan
{"title":"Leveraging the adoption of electronic identities and electronic-signature solutions in Europe","authors":"Alexander Marsalek, Thomas Zefferer, Florian Reimair, Ç. Karabat, Elif Ustundag Soykan","doi":"10.1145/3019612.3019885","DOIUrl":"https://doi.org/10.1145/3019612.3019885","url":null,"abstract":"The concepts of electronic identity (eID) and electronic signature (e-Signature) are crucial enablers of e-government solutions in Europe. The present heterogeneity of national e-government infrastructures in Europe raises serious challenges. The country-specific nature of infrastructure components prevents an easy reuse of country-specific components in other countries. We propose a solution, that facilitates the deployment and integration or third-party components into existing national e-government infrastructures. We demonstrate the feasibility of our proposal by means of a concrete implementation. Evaluation results obtained are promising and show the proposed solution's potential to leverage the adoption of eID and e-Signature solutions in Europe.","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":"74390877","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}
引用次数: 4
Distributed algorithm for traffic dissemination in manhattan networks with optimal routing-time 具有最优路由时间的曼哈顿网络流量传播的分布式算法
Proceedings of the Symposium on Applied Computing Pub Date : 2017-04-03 DOI: 10.1145/3019612.3019702
Sayan Sen Sarma, K. Sinha, G. Chakraborty, B. Sinha
{"title":"Distributed algorithm for traffic dissemination in manhattan networks with optimal routing-time","authors":"Sayan Sen Sarma, K. Sinha, G. Chakraborty, B. Sinha","doi":"10.1145/3019612.3019702","DOIUrl":"https://doi.org/10.1145/3019612.3019702","url":null,"abstract":"We consider the problem of traffic routing in a road network in the event of a disaster, when there is a surge in vehicle movement from dense residential areas to designated safe-shelters. We address the problem with multiple sources and a fixed sink in a k × k Manhattan grid road network to find a traffic distribution over the network such that the average time of travel from sources to sink is minimized. We consider queuing delay at each grid point of the Manhattan network when multiple grid points can become potential sources of new traffic generation, and then propose an optimal traffic distribution algorithm to minimize the total queuing delay of all vehicles to reach the given destination point. We then extend our technique to consider variable link delay (as a function of the volume of traffic flow through a link) along the links of the network.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":"70 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74674626","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}
引用次数: 3
APR: architectural pattern recommender APR:架构模式推荐器
Proceedings of the Symposium on Applied Computing Pub Date : 2017-04-03 DOI: 10.1145/3019612.3019780
Shipra Sharma, B. Sodhi
{"title":"APR: architectural pattern recommender","authors":"Shipra Sharma, B. Sodhi","doi":"10.1145/3019612.3019780","DOIUrl":"https://doi.org/10.1145/3019612.3019780","url":null,"abstract":"This paper proposes Architectural Pattern Recommender (APR) system which helps in such architecture selection process. Main contribution of this work is in replacing the manual effort required to identify and analyse relevant architectural patterns in context of a particular set of software requirements. Key input to APR is a set of architecturally significant use cases concerning the application being developed. Central idea of APR's design is two folds: a) transform the unstructured information about software architecture design into a structured form which is suitable for recognizing textual entailment between a requirement scenario and a potential architectural pattern, b) leverage the rich experiential knowledge embedded in discussions on professional developer support forums such as Stackoverflow to check the sentiment about a design decision. APR makes use of both the above elements to identify a suitable architectural pattern and assess its suitability for a given set of requirements. Efficacy of APR has been evaluated by comparing its recommendations for \"ground truth\" scenarios (comprising of applications whose architecture is well known).","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":"629 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77095788","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}
引用次数: 24
Efficient scene encoding for programmable matter self-reconfiguration algorithms 可编程物质自重构算法的高效场景编码
Proceedings of the Symposium on Applied Computing Pub Date : 2017-04-03 DOI: 10.1145/3019612.3019706
Thadeu Tucci, Benoît Piranda, J. Bourgeois
{"title":"Efficient scene encoding for programmable matter self-reconfiguration algorithms","authors":"Thadeu Tucci, Benoît Piranda, J. Bourgeois","doi":"10.1145/3019612.3019706","DOIUrl":"https://doi.org/10.1145/3019612.3019706","url":null,"abstract":"Programmable matter can be seen as a huge modular robot in which each module can communicate to its connected neighbors and work all together to achieve a common goal, more likely changing the shape of the whole robot. However, when the number of modules increases, the memory used in each module to store the target shape or the computation time to recreate this shape increases too. This article studies different approaches to describe the shape of any object for huge modular robots. The use of a good method for coding scene is a critical aspect that can reduce the memory, the time of transfer and the energy used in many distributed algorithms like self-reconfiguration. This paper proposes a method called Constructive Solid Geometry for Programmable Matter (CSG4PM), a compact description of an object and all the associated algorithms pre-processing and runtime. CSG4PM is compared to three existing solutions to describe a scene.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":"29 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76550574","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}
引用次数: 15
From IoT big data to IoT big services 从物联网大数据到物联网大服务
Proceedings of the Symposium on Applied Computing Pub Date : 2017-04-03 DOI: 10.1145/3019612.3019700
Amirhosein Taherkordi, F. Eliassen, G. Horn
{"title":"From IoT big data to IoT big services","authors":"Amirhosein Taherkordi, F. Eliassen, G. Horn","doi":"10.1145/3019612.3019700","DOIUrl":"https://doi.org/10.1145/3019612.3019700","url":null,"abstract":"The large-scale deployments of Internet of Things (IoT) systems have introduced several new challenges in terms of processing their data. The massive amount of IoT-generated data requires design solutions to speed up data processing, scale up with the data volume and improve data adaptability and extensibility. Beyond existing techniques for IoT data collection, filtering, and analytics, innovative service computing technologies are required for provisioning data-centric and scalable IoT services. This paper presents a service-oriented design model and framework for realizing scalable and efficient acquisition, processing and integration of data-centric IoT services. In this approach, data-centric IoT services are organized in a service integrating tree structure, adhering to the architecture of many large-scale IoT systems, including recent fog-based IoT computing models. A service node in the tree is called a Big Service and acts as an integrator, collecting data from lower level Big Services, processing them, and delivering the result to higher level IoT Big Services. The service tree thereby encapsulates required data processing functions in a hierarchical manner in order to achieve scalable and real-time data collection and processing. We have implemented the IoT Big Services framework leveraging a popular cloud-based service and data platform called Firebase, and evaluated its performance in terms of real-time requirements.","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":"76730533","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}
引用次数: 29
Processing skyline queries in temporal databases 处理时间数据库中的天际线查询
Proceedings of the Symposium on Applied Computing Pub Date : 2017-04-03 DOI: 10.1145/3019612.3019677
Christos Kalyvas, T. Tzouramanis, Y. Manolopoulos
{"title":"Processing skyline queries in temporal databases","authors":"Christos Kalyvas, T. Tzouramanis, Y. Manolopoulos","doi":"10.1145/3019612.3019677","DOIUrl":"https://doi.org/10.1145/3019612.3019677","url":null,"abstract":"The skyline query aims to filter out a set of eligible points on the basis of a set of evaluation criteria and out of a potentially large dataset of points. The computation of this decision support problem has been studied across a wide range of environments and of types of data. A field of research that has remained unexplored in the context of this problem, and which would also greatly benefit from the study of the computation of the skyline query, is that of temporal databases. A solution for computing skyline queries and some of its variants over temporal data is put forward here. An experimental study indicates the promising effectiveness and practicability of the proposed extension of the skyline query processing in real-life temporal data applications.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":"6 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80106572","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}
引用次数: 8
Session details: MCA - mobile computing and applications track 会议细节:MCA -移动计算和应用程序跟踪
Proceedings of the Symposium on Applied Computing Pub Date : 2017-04-03 DOI: 10.1145/3243952
{"title":"Session details: MCA - mobile computing and applications track","authors":"","doi":"10.1145/3243952","DOIUrl":"https://doi.org/10.1145/3243952","url":null,"abstract":"Riding on the success of previous Mobile Computing and Applications Tracks spanning from 2003 to 2016, we are delighted to celebrate the 15th anniversary of the Mobile Computing and Applications Track this year with a truly inter-continental track chair composition with further PC diversity. The track features research papers drawn from a highly diversified spectrum of mobile computing, with a collection of papers relevant to the up-surging security measures. We have been receiving a good number of submissions throughout the years. According to the nature of the papers collected in this track, the accepted regular papers are organized into two sessions, covering very much on the security issues as well as system and application aspects: Security in Mobile Systems and Mobile Platforms and Applications. The track is dedicated to draw upon research efforts and expertise from different areas of research, so as to promote better synergy and to bring forth not only core communications and security protocols for application development and data management, but also important and upcoming research applications to realize the benefits of anywhere, any place and anytime pervasive and ubiquitous computing.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":"39 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80352770","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}
引用次数: 0
A gamification requirements catalog for educational software: results from a systematic literature review and a survey with experts 教育软件的游戏化需求目录:来自系统文献回顾和专家调查的结果
Proceedings of the Symposium on Applied Computing Pub Date : 2017-04-03 DOI: 10.1145/3019612.3019752
M. Peixoto, Carla Schuenemann
{"title":"A gamification requirements catalog for educational software: results from a systematic literature review and a survey with experts","authors":"M. Peixoto, Carla Schuenemann","doi":"10.1145/3019612.3019752","DOIUrl":"https://doi.org/10.1145/3019612.3019752","url":null,"abstract":"Gamification is an emerging phenomenon for using in educational software in order to engage, motivate and improve the performance of students inside the learning context. However, despite its importance, the identification of significant gamification requirements for educational software is not trivial and a consensus of such requirements has not been reached. Motivated by this situation, the objective of this paper is to present a gamification requirements catalog for educational software. The requirements were identified from a systematic literature review, subsequently prioritized and validated through a survey conducted with 64 experts in the field. The results suggest that the requirements of the catalog are important to be applied in educational software.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":"21 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80958681","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}
引用次数: 18
Feature ranking in hoeffding algorithms for regression 回归hoeffding算法中的特征排序
Proceedings of the Symposium on Applied Computing Pub Date : 2017-04-03 DOI: 10.1145/3019612.3019670
J. Duarte, João Gama
{"title":"Feature ranking in hoeffding algorithms for regression","authors":"J. Duarte, João Gama","doi":"10.1145/3019612.3019670","DOIUrl":"https://doi.org/10.1145/3019612.3019670","url":null,"abstract":"Feature selection and feature ranking are two aspects of the same learning task. They are well studied in batch scenarios, but not in the streaming setting. This paper presents a study on feature ranking from data streams in online learning regression models. The main challenge here is the relevance of features might change over time: features relevant in the past might be irrelevant now and vice-versa. We propose three new online feature ranking algorithms designed for Hoeffding algorithms. We have implemented the three methods in AMRules, a streaming regression algorithm to learn model rules. We compare their behaviour experimentally and present the pros and cons of each method.","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":"81882728","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}
引用次数: 5
An end-to-end voting-system based on bitcoin 基于比特币的端到端投票系统
Proceedings of the Symposium on Applied Computing Pub Date : 2017-04-03 DOI: 10.1145/3019612.3019841
Stefano Bistarelli, Marco Mantilacci, Paolo Santancini, Francesco Santini
{"title":"An end-to-end voting-system based on bitcoin","authors":"Stefano Bistarelli, Marco Mantilacci, Paolo Santancini, Francesco Santini","doi":"10.1145/3019612.3019841","DOIUrl":"https://doi.org/10.1145/3019612.3019841","url":null,"abstract":"In this work we re-adapt the Bitcoin e-payment system and propose it as a decentralised end-to-end voting platform (from voters to candidates). We describe the main architectural choices behind the implementation, which consists of the pre-voting, voting, and post-voting phases. The resulting implementation is completely decentralised: it is possible to directly cast a vote in the block-chain without any collecting intermediate-level. All the votes can be verified by anyone reading such a public ledger. We also exploit digital asset coins to directly keep track of votes (through the Open Asset Protocol), and we show the election cost for n voters.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":"470 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83037564","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}
引用次数: 50
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信