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

2017 Twelfth International Conference on Digital Information Management (ICDIM)最新文献

筛选
英文 中文
Improving the trust of end users in enterprise SOA using combinatorial group testing methods 使用组合组测试方法提高最终用户对企业SOA的信任
2017 Twelfth International Conference on Digital Information Management (ICDIM) Pub Date : 2017-09-01 DOI: 10.1109/ICDIM.2017.8244689
S. Mishra, C. Kumar
{"title":"Improving the trust of end users in enterprise SOA using combinatorial group testing methods","authors":"S. Mishra, C. Kumar","doi":"10.1109/ICDIM.2017.8244689","DOIUrl":"https://doi.org/10.1109/ICDIM.2017.8244689","url":null,"abstract":"Over the last decade, Service-Oriented Architecture (SOA) is widely accepted for building large-scale, complex and heterogeneous business process enterprise applications. The SOA systems are developed by composing loosely coupled services that are shared across the organizations. Nowadays, the procreation of SOA is baffled by the presence of faulty business processes (services), which severely influence the experience of end users and causes significant frustrations leading to create a barrier between the service providers and the end users. In this paper, we inspect an abstract formulation of the problem to identify faulty business processes (services) for improving the trust of end users in enterprise SOA systems. In SOA, the faulty business processes are integrated with some erroneous operations and that should be identified during the early stage of testing for increasing the trust between the service providers and end users. Thus, we develop an abstract model of this problem which primarily aimed to improve the desired level of trust in the end users. The trust is assured through the formal correspondence of well-established literature of combinatorial group testing (CGT). Furthermore, we apply a sequential group testing method to the problem of SOA system testing to identify the erroneous services. Lastly, some limitations of the used approach with some future directions, that can lead to new solutions are highlighted.","PeriodicalId":144953,"journal":{"name":"2017 Twelfth International Conference on Digital Information Management (ICDIM)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123218683","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
National survey of Japanese universities on computing education: Analysis of educational computer system 日本大学计算机教育全国调查:教育计算机系统分析
2017 Twelfth International Conference on Digital Information Management (ICDIM) Pub Date : 2017-09-01 DOI: 10.1109/ICDIM.2017.8244671
Mika Ohtsuki, T. Kakeshita, M. Takasaki
{"title":"National survey of Japanese universities on computing education: Analysis of educational computer system","authors":"Mika Ohtsuki, T. Kakeshita, M. Takasaki","doi":"10.1109/ICDIM.2017.8244671","DOIUrl":"https://doi.org/10.1109/ICDIM.2017.8244671","url":null,"abstract":"We carried out the first national survey to understand the actual situation of computing education at Japanese universities in 2016. In this paper, we report the survey result of educational computer system. The survey question contains various aspects of the computer system such as rental fee, rental period, the number of terminals, educational software and contents, maintenance staff, committee. We obtained 569 answers from 449 universities (69.0% of the registered universities). 40.4% of the system is equipped by purchase so that these systems will not be updated. Average number of terminals/PCs is 503.4. 65% of the terminals are installed at computer training rooms. Learning management system is commonly introduced at more than 50% of the universities. Administrative and maintenance tasks are increasingly outsourced due to insufficient number of staffs within the university.","PeriodicalId":144953,"journal":{"name":"2017 Twelfth International Conference on Digital Information Management (ICDIM)","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131681412","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
DIO: Efficient interactive outlier analysis over dynamic datasets DIO:动态数据集的高效交互式离群分析
2017 Twelfth International Conference on Digital Information Management (ICDIM) Pub Date : 2017-09-01 DOI: 10.1109/ICDIM.2017.8244652
Chihiro Sakazume, H. Kitagawa, T. Amagasa
{"title":"DIO: Efficient interactive outlier analysis over dynamic datasets","authors":"Chihiro Sakazume, H. Kitagawa, T. Amagasa","doi":"10.1109/ICDIM.2017.8244652","DOIUrl":"https://doi.org/10.1109/ICDIM.2017.8244652","url":null,"abstract":"Outlier detection is an important data mining topic, and distance-based outlier detection is one of the representative methods. However, it is known that selecting parameter values suited for detecting outliers matching the user intent is not easy. To address this problem, an interactive outlier analysis framework named ONION was proposed. ONION analyzes datasets in advance and constructs index structures, which support several types of interactive outlier analysis and help users choose appropriate parameter values. However, ONION assumes static datasets, and updates to the datasets are not considered. In this work, we propose a novel scheme named DIO (Dynamic and Interactive Outlier analysis) to make ONION-like interactive outlier analysis applicable to dynamic datasets. DIO provides a grid structure for data objects and neighboring object counters to avoid expensive distance recomputations and enables efficient updates of the index structures. Intensive experiments prove that DIO achieves remarkable performance improvements.","PeriodicalId":144953,"journal":{"name":"2017 Twelfth International Conference on Digital Information Management (ICDIM)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127956104","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 migration-oriented partial adaptation architecture for IoT-empowered city platform as a service 面向迁移的部分适应架构，用于物联网城市平台即服务
2017 Twelfth International Conference on Digital Information Management (ICDIM) Pub Date : 2017-09-01 DOI: 10.1109/ICDIM.2017.8244667
T. Yamakami
{"title":"A migration-oriented partial adaptation architecture for IoT-empowered city platform as a service","authors":"T. Yamakami","doi":"10.1109/ICDIM.2017.8244667","DOIUrl":"https://doi.org/10.1109/ICDIM.2017.8244667","url":null,"abstract":"Evolution of IoT-empowered city-scale platform leads to migration requirements. All successful IoT systems need to address migration of existing or external systems. The author discusses the challenges of phased migration of heterogeneous IoT systems. Then, the author presents approaches of migratable architecture. Finally, the author proposes a partial adaptation migration architecture to cope with the challenges. The mapping architecture can provide a framework of accommodating evolution of heterogeneous IoT systems.","PeriodicalId":144953,"journal":{"name":"2017 Twelfth International Conference on Digital Information Management (ICDIM)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130200311","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
Measurement and analysis of citizens requests to government for non-emergency services 公民对政府非紧急服务请求的测量和分析
2017 Twelfth International Conference on Digital Information Management (ICDIM) Pub Date : 2017-09-01 DOI: 10.1109/ICDIM.2017.8244654
Rami Ibrahim, M. O. Shafiq
{"title":"Measurement and analysis of citizens requests to government for non-emergency services","authors":"Rami Ibrahim, M. O. Shafiq","doi":"10.1109/ICDIM.2017.8244654","DOIUrl":"https://doi.org/10.1109/ICDIM.2017.8244654","url":null,"abstract":"311 has been the largest and one of the most important customer service bridge between citizens and government, being actively operated in multiple cities in North America. It enables accessibility for citizens to non-emergency city services and increases efficiency and effectiveness of relevant government authorities in responding to public inquiries. Reporting service requests are easy and fast since they are available online, or can be downloaded on mobile devices as well as via telephone. The high accessible reporting process generated a huge amount of data during the past few years. In this paper, we present a comprehensive analysis of the 311 services for New York state, i.e., NYC 311 services. The NYC 311 dataset is a publicly accessible dataset that contains approximately 15 million records from 2010 to present. We have analyzed multiple features including the number of created requests in terms of responding agency, complaint type, city and time of the day. We also analyzed the completion period and delay period for requests in terms of agency, complaint type, city, years, months and weekdays.","PeriodicalId":144953,"journal":{"name":"2017 Twelfth International Conference on Digital Information Management (ICDIM)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127725979","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
Can you trust the user?: Collaborative trust estimation model for recommendations 你能信任用户吗?:推荐的协同信任估计模型
2017 Twelfth International Conference on Digital Information Management (ICDIM) Pub Date : 2017-06-28 DOI: 10.1109/ICDIM.2017.8244681
Daichi Minami, Taketoshi Ushiama
{"title":"Can you trust the user?: Collaborative trust estimation model for recommendations","authors":"Daichi Minami, Taketoshi Ushiama","doi":"10.1109/ICDIM.2017.8244681","DOIUrl":"https://doi.org/10.1109/ICDIM.2017.8244681","url":null,"abstract":"The explosive popularity of social networking services such as Twitter and Facebook has made it common to communicate with unknown people via the Internet. Further, services based on a “sharing economy” such as Airbnb and Uber have gained popularity and increased opportunities to connect with strangers. Users would like to determine whether the opinions of other users can be trusted. However, it is sometimes difficult to do so, and the judgment of other users is not necessarily correct. We propose a model for predicting the trust of unknown users by using information of users known to a target user. We predicted the trust of reviewers on an online review site based on the proposed model and recommended items based on collaborative filtering (CF) using the obtained trust of the reviewers. The experimental results showed that the recommendation accuracy with the trust was higher than that with general CF.","PeriodicalId":144953,"journal":{"name":"2017 Twelfth International Conference on Digital Information Management (ICDIM)","volume":"54 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116346991","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
Fast plagiarism detection based on simple document similarity 基于简单文档相似度的快速抄袭检测
2017 Twelfth International Conference on Digital Information Management (ICDIM) Pub Date : 2017-06-28 DOI: 10.1109/ICDIM.2017.8244662
K. Baba
{"title":"Fast plagiarism detection based on simple document similarity","authors":"K. Baba","doi":"10.1109/ICDIM.2017.8244662","DOIUrl":"https://doi.org/10.1109/ICDIM.2017.8244662","url":null,"abstract":"Plagiarism detection in a large number of documents requires efficient methods. This paper proposes a plagiarism detection algorithm based on approximate string matching to be specified in “copy and paste”-type plagiarisms, and a speed improvement to an implementation of the algorithm. Most of the computations required in the algorithm are omitted by two kinds of approximations of the output used for plagiarism detection, while the decrease of accuracy caused by the approximations is acceptable. The effect of the improvement on the processing time and accuracy of the algorithm is evaluated by conducting experiments with a data set. The experimental results show that the improvement can reduce the processing time to approximately one-twentieth for a 6.4% decrease of the accuracy from those for the normal implementation of the algorithm.","PeriodicalId":144953,"journal":{"name":"2017 Twelfth International Conference on Digital Information Management (ICDIM)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116949721","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
A collaborative filtering method for interactive platforms 一种面向交互平台的协同过滤方法
2017 Twelfth International Conference on Digital Information Management (ICDIM) Pub Date : 2017-06-28 DOI: 10.1109/ICDIM.2017.8244679
Yan Zhou, Taketoshi Ushiama
{"title":"A collaborative filtering method for interactive platforms","authors":"Yan Zhou, Taketoshi Ushiama","doi":"10.1109/ICDIM.2017.8244679","DOIUrl":"https://doi.org/10.1109/ICDIM.2017.8244679","url":null,"abstract":"Interactive platforms such as Last.fm and Steam are currently playing an increasingly important role in ecommerce. The most important feature in an interactive platform is streaming data, which contain an enormous amount of information regarding a user's interests at any time. However, previous recommender systems have been unable to deal with streaming data well. Therefore, we propose a collaborative filtering approach that uses the sliding window technique. Furthermore, we found that sliding only on interaction time results in a better performance. Moreover, we propose a method called equal ratio filling to handle suboptimal streaming data and other optimization strategies. Finally, we evaluated our approach using the stream dataset. As the results indicate, our approach performs better than other conventional approaches.","PeriodicalId":144953,"journal":{"name":"2017 Twelfth International Conference on Digital Information Management (ICDIM)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125512203","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
Copyright page 版权页
2017 Twelfth International Conference on Digital Information Management (ICDIM) Pub Date : 1981-12-01 DOI: 10.1002/smj.2920
{"title":"Copyright page","authors":"","doi":"10.1002/smj.2920","DOIUrl":"https://doi.org/10.1002/smj.2920","url":null,"abstract":"","PeriodicalId":144953,"journal":{"name":"2017 Twelfth International Conference on Digital Information Management (ICDIM)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1981-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127456331","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
Program committee 项目委员会
2017 Twelfth International Conference on Digital Information Management (ICDIM) Pub Date : 1900-01-01 DOI: 10.23919/wons.2018.8311651
A. Davoudi
{"title":"Program committee","authors":"A. Davoudi","doi":"10.23919/wons.2018.8311651","DOIUrl":"https://doi.org/10.23919/wons.2018.8311651","url":null,"abstract":"","PeriodicalId":144953,"journal":{"name":"2017 Twelfth International Conference on Digital Information Management (ICDIM)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121442946","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
首页 上一页 下一页 尾页
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学术官方微信