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

Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services最新文献

筛选
英文 中文
A Web Service Architecture for Social Micro-Learning 面向社交微学习的Web服务体系结构
Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services Pub Date : 2019-12-02 DOI: 10.1145/3366030.3366066
Bernhard Göschlberger, Gabriele Anderst-Kotsis
{"title":"A Web Service Architecture for Social Micro-Learning","authors":"Bernhard Göschlberger, Gabriele Anderst-Kotsis","doi":"10.1145/3366030.3366066","DOIUrl":"https://doi.org/10.1145/3366030.3366066","url":null,"abstract":"In knowledge organizations or a knowledge society learning processes are inherently social and distributed. To enable these processes knowledge artifacts need to be created, updated, and consumed decentralized. Social Micro-Learning is an example for an approach following that paradigm. By proposing a flexible service architecture, this paper addresses the diverse demands that Social Micro-Learners have throughout their learning process. It allows integrating information retrieval, recommender systems, workflow engines and spaced repetition algorithms through a single stream data model. Consequently, we can reuse user interface implementations and provide a consistent, recognizable view. Our evaluations show a good system usability, and stable results across different services. We conclude that our service design can serve as a blueprint for social e-learning systems.","PeriodicalId":446280,"journal":{"name":"Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129849961","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
Weighted Load Balancing in Distributed Hash Tables 分布式哈希表的加权负载均衡
Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services Pub Date : 2019-12-02 DOI: 10.1145/3366030.3366069
R. Lösch, Jan Schmidt, N. Felde
{"title":"Weighted Load Balancing in Distributed Hash Tables","authors":"R. Lösch, Jan Schmidt, N. Felde","doi":"10.1145/3366030.3366069","DOIUrl":"https://doi.org/10.1145/3366030.3366069","url":null,"abstract":"The rising amount of data in Internet of Things (IoT) and Wireless Sensor Network (WSN) scenarios motivates new computing paradigms like fog or edge computing. To reduce the amount of data sent upstream, in-network (pre-)processing is widely used, which demands for both compute and distributed storage capacities in highly constrained environments. This paper introduces a new way of using Distributed Hash Tables (DHTs) to create a distributed storage in P2P-networks. The main design goals are to introduce the lowest overheads possible and allowing for fair load balancing, even if nodes contributing storage capacities of arbitrary/different sizes form the network. A combination of an optimized bootstrap mechanism and a virtual node scheme that deploys a variable number of virtual nodes depending on a node's storage capacity yields success. An evaluation and comparison with state of the art work shows that the new method performs well in terms of load balancing while minimizing overheads introduced by newly introduced virtual nodes.","PeriodicalId":446280,"journal":{"name":"Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129168936","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
Outsourced Private Set Union on Multi-Attribute Datasets for Search Protocol using Fully Homomorphic Encryption 全同态加密搜索协议中多属性数据集的外包私有集联合
Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services Pub Date : 2019-12-02 DOI: 10.1145/3366030.3366059
Rumi Shakya, Yoshiko Yasumura, Takuya Suzuki, Yu Ishimaki, H. Yamana
{"title":"Outsourced Private Set Union on Multi-Attribute Datasets for Search Protocol using Fully Homomorphic Encryption","authors":"Rumi Shakya, Yoshiko Yasumura, Takuya Suzuki, Yu Ishimaki, H. Yamana","doi":"10.1145/3366030.3366059","DOIUrl":"https://doi.org/10.1145/3366030.3366059","url":null,"abstract":"In the era of big data and cloud computing, outsourcing data storage to the cloud poses the risk of its abuse or leakage. Thus, we address the problem of delegating computation on outsourced private datasets while maintaining privacy. In this study, we consider a scenario involving two data owners outsourcing their datasets to a cloud service. The cloud performs a set union computation, after which the querier sends a query to obtain information from both datasets. We propose a protocol that uses fully homomorphic encryption (FHE) and Cartesian-join of Bloom filters (CBF) as proposed by Wang et al. The protocol obtains information on the existence of a particular set of elements without learning about the residing source. To the best of our knowledge, our protocol, by using the FHE and CBF matrix, is a novel approach to ensuring the security of outsourced set union operations.","PeriodicalId":446280,"journal":{"name":"Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121202892","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
Combining a Gamified Civic Engagement Platform with a Digital Game in a Loosely Way to Increase Retention 将游戏化的公民参与平台与数字游戏结合起来以提高留存率
Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services Pub Date : 2019-12-02 DOI: 10.1145/3366030.3366117
Renny S. N. Lindberg, J. Maushagen, Olga De Troyer
{"title":"Combining a Gamified Civic Engagement Platform with a Digital Game in a Loosely Way to Increase Retention","authors":"Renny S. N. Lindberg, J. Maushagen, Olga De Troyer","doi":"10.1145/3366030.3366117","DOIUrl":"https://doi.org/10.1145/3366030.3366117","url":null,"abstract":"In this article we discuss an innovative approach to tackle the retention problem in civic engagement systems, more in particular in the context of care taking of elderly. The proposed solution is to complement a gamified civic engagement platform with an entertainment game but in such a way that the two are only loosely coupled. The civic engagement platform is a location-based card environment that allows to connect people who might be in need of assistance (i.e. elderly) with people willing to spend their time to help (i.e. volunteers). By helping people the volunteers collect cards, which can be used in the game to play. Special is that we do not expect that the volunteers will be the one playing the game. On the contrary, the aim is to create a self-feeding network between two groups of users: on the one hand the volunteers and on the other hand gamers. We hope that the gamers will stimulate the volunteers to collect cards and that in this way we can retain the volunteers for longer periods. Currently, the approach is being implemented for the case of assisting elderly, but the principle is also applicable in other domains of civic engagement. The paper discusses the research goals and problems, the research approach, as well as the current state and future work.","PeriodicalId":446280,"journal":{"name":"Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128402654","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}
引用次数: 1
A Method to Estimate Entity Performance from Mentions to Related Entities in Texts on the Web 一种基于Web文本中提及到相关实体的实体性能评估方法
Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services Pub Date : 2019-12-02 DOI: 10.1145/3366030.3366079
V. Sampaio, Renato Fileto, D. D. J. D. Macedo
{"title":"A Method to Estimate Entity Performance from Mentions to Related Entities in Texts on the Web","authors":"V. Sampaio, Renato Fileto, D. D. J. D. Macedo","doi":"10.1145/3366030.3366079","DOIUrl":"https://doi.org/10.1145/3366030.3366079","url":null,"abstract":"Publications on the Web can influence the public opinion about certain entities (e.g., politicians, institutions). At the same time, a variety of indicators can be extracted from these publications and used to estimate entity performance (e.g., popularity, votes share). This work proposes an automatic method that employs state-of-the-art natural language processing tools to extract indicators about entities mentioned in texts, for estimating the performance of these entities or semantically related ones. Our method calculates performance metrics from performance indicators consolidated for semantically related entities, assess correlations of these consolidated metrics with ground true performance, and uses these metrics to predict certain fluctuations in entity performance. Experimental results in a case study on politics show that consolidated metrics for several interrelated entities are better correlated to observed real performance measures of some target entities and lead to better predictions, than metrics for just one entity.","PeriodicalId":446280,"journal":{"name":"Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134287126","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}
引用次数: 1
Personality Estimation using Demographic Data in a Personality-based Recommender System: A Proposal 在基于个性的推荐系统中使用人口统计数据进行个性估计:一个建议
Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services Pub Date : 2019-12-02 DOI: 10.1145/3366030.3366098
Iman Paryudi, A. Ashari, A. Tjoa
{"title":"Personality Estimation using Demographic Data in a Personality-based Recommender System: A Proposal","authors":"Iman Paryudi, A. Ashari, A. Tjoa","doi":"10.1145/3366030.3366098","DOIUrl":"https://doi.org/10.1145/3366030.3366098","url":null,"abstract":"Collaborative filtering in a recommender system has a weakness called cold start problem. One way to resolve this problem is by using personality traits that can be automatically predicted from the status that the users write in social media like Facebook and Twitter. The problem with this method is that a user of such system must have at least one account in at least one social media and must write at least one status with certain length. We propose to use the combination of personality traits and demographic data to overcome this problem. Previous studies reveal that personality traits are influenced by age and gender. By using these findings, we will build models to predict personality traits from such demographic data. The modeling will be conducted by means of classification and association rule methods. Novel domains will be used in the proposed system, namely sports and hobbies.","PeriodicalId":446280,"journal":{"name":"Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132706453","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}
引用次数: 2
Improving Findability of Open Data Beyond Data Catalogs 提高开放数据在数据目录之外的可查找性
Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services Pub Date : 2019-12-02 DOI: 10.1145/3366030.3366095
T. Skopal, Jakub Klímek, M. Nečaský
{"title":"Improving Findability of Open Data Beyond Data Catalogs","authors":"T. Skopal, Jakub Klímek, M. Nečaský","doi":"10.1145/3366030.3366095","DOIUrl":"https://doi.org/10.1145/3366030.3366095","url":null,"abstract":"There is a vast amount of datasets available as Open Data on the Web. However, it is challenging for consumers to find datasets relevant to their goals. This is because the available metadata in catalogs is not descriptive enough. Nevertheless, datasets exist in various types of contexts not expressed in the metadata. These may include information about the data publisher, the legislation related to dataset publication, etc. In this paper we describe an idea of a data model that enables consumers to better understand the data. We propose to define a formal model for representation of the datasets and their contexts, and we propose to apply existing similarity techniques, adjust them to fit each identified dataset context type and combine them together to measure similarity of datasets in new ways, improving their findability.","PeriodicalId":446280,"journal":{"name":"Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115458904","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
Fast RankCIus Algorithm via Dynamic Rank Score Tracking on Bi-type Information Networks 基于动态排名分数跟踪的双类型信息网络快速RankCIus算法
Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services Pub Date : 2019-12-02 DOI: 10.1145/3366030.3366051
Kotaro Yamazaki, Shohei Matsugu, Hiroaki Shiokawa, H. Kitagawa
{"title":"Fast RankCIus Algorithm via Dynamic Rank Score Tracking on Bi-type Information Networks","authors":"Kotaro Yamazaki, Shohei Matsugu, Hiroaki Shiokawa, H. Kitagawa","doi":"10.1145/3366030.3366051","DOIUrl":"https://doi.org/10.1145/3366030.3366051","url":null,"abstract":"Given a bi-type information network, which is an extended model of well-known bipartite graphs, how can clusters be efficiently found in graphs? Graph clustering is now a fundamental tool to understand overviews from graph-structured data. The RankClus framework accurately performs clustering for bi-type information networks using ranking-based graph clustering techniques. It integrates a graph ranking algorithms such as PageRank or HITS into graph clustering procedures to improve the clustering quality. However, this integration incurs a high computational cost to handle large bi-type information networks since RankClus repeatedly computes the ranking algorithm for all nodes and edges until the clustering procedure converges. To overcome this runtime limitation, herein we present a novel RankClus algorithm that reduces the running time for large bi-type information networks. Our proposed method employs dynamic graph processing techniques into the ranking procedures included in RankClus. By dynamically updating ranking results, our proposal reduces the number of computed nodes and edges during repeated ranking procedures. We experimentally verify using real-world datasets that our proposed method successfully reduces the running time while maintaining the clustering quality of RankClus.","PeriodicalId":446280,"journal":{"name":"Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123918292","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
Social Media Copyright Management using Semantic Web and Blockchain 使用语义网和区块链的社交媒体版权管理
Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services Pub Date : 2019-12-02 DOI: 10.1145/3366030.3366128
Roberto García, R. Gil
{"title":"Social Media Copyright Management using Semantic Web and Blockchain","authors":"Roberto García, R. Gil","doi":"10.1145/3366030.3366128","DOIUrl":"https://doi.org/10.1145/3366030.3366128","url":null,"abstract":"Solutions based on distributed ledgers require sophisticated tools for data modelling and integration that can be overcome using semantic and Linked Data technologies. One example is copyright management, where we attempt to adapt the Copyright Ontology so it can be used to build applications that benefit from both worlds, rich information modelling and reasoning together with immutable and accountable information storage that provides trust and confidence on the modelled rights statements. This approach has been applied in the context of an application for the management of social media re-use for journalistic purposes.","PeriodicalId":446280,"journal":{"name":"Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services","volume":"216 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122340880","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}
引用次数: 6
Towards a social learning environment 走向社会化的学习环境
Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services Pub Date : 2019-12-02 DOI: 10.1145/3366030.3366120
Hajar Zankadi, Imane Hilal, N. Daoudi, A. Idrissi
{"title":"Towards a social learning environment","authors":"Hajar Zankadi, Imane Hilal, N. Daoudi, A. Idrissi","doi":"10.1145/3366030.3366120","DOIUrl":"https://doi.org/10.1145/3366030.3366120","url":null,"abstract":"Nowadays, e-learning environments have proved a prominent success among the learners as they provide them with open access to educational resources. Despite their benefits, many learners decide to stop their online learning due to the lack of interaction and satisfaction. The missing of appropriate course design encourages learners to be inactive and then take the decision to dropout. Redesigned e-learning environments' courses is essential in order to respond to learners' personal needs vis-à-vis their online courses.","PeriodicalId":446280,"journal":{"name":"Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124760337","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}
引用次数: 1
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信