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

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

筛选
英文 中文
Prediction of importance of figures in scholarly papers 预测学术论文中数字的重要性
2017 Twelfth International Conference on Digital Information Management (ICDIM) Pub Date : 2017-09-01 DOI: 10.1109/ICDIM.2017.8244648
Yui Kita, J. Rekimoto
{"title":"Prediction of importance of figures in scholarly papers","authors":"Yui Kita, J. Rekimoto","doi":"10.1109/ICDIM.2017.8244648","DOIUrl":"https://doi.org/10.1109/ICDIM.2017.8244648","url":null,"abstract":"This paper shows that the importance of a figure in scholarly papers can be predicted by a machine learning technique. The growing number of scholarly papers makes it difficult to keep pace with researches. The current scholarly paper format of the ACM / IEEE long paper contains eight pages. These eight pages include details that may not be necessary for most readers. In fact, even before we read the details, we try to obtain a vague understanding of the entire content by browsing through the eight pages. To address this issue, summarization techniques have been explored. However, these techniques are focused on texts, thus there is room for research to make the paper easier to read by summarizing the figure of the paper. A wide variety of figures can be found in scholarly papers. They include figures that depict the overview of a paper or highly contextualized figures that can be understood only after reading the detailed text. Therefore, selecting important figures is a key issue in the summarization of scholarly papers. This paper shows that a figure that should be presented first to the readers can be selected based on a comparison of the sizes, page numbers or color features of the figures. We also described how our result can be applied in more practical cases on searching, exploring and serendipitious encounter of digital documents.","PeriodicalId":144953,"journal":{"name":"2017 Twelfth International Conference on Digital Information Management (ICDIM)","volume":"31 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":"121921968","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
Analysis and compliance evaluation of cookies-setting websites with privacy protection laws 设置cookie的网站与隐私保护法的合规性分析与评估
2017 Twelfth International Conference on Digital Information Management (ICDIM) Pub Date : 2017-09-01 DOI: 10.1109/ICDIM.2017.8244646
Adeyemi Aladeokin, P. Zavarsky, Neelam Memon
{"title":"Analysis and compliance evaluation of cookies-setting websites with privacy protection laws","authors":"Adeyemi Aladeokin, P. Zavarsky, Neelam Memon","doi":"10.1109/ICDIM.2017.8244646","DOIUrl":"https://doi.org/10.1109/ICDIM.2017.8244646","url":null,"abstract":"The use of cookies to profile individuals has been raising serious privacy protection concerns. Many countries have already enacted privacy protection laws to create legal framework to mitigate these concerns. This paper presents an analysis of setting of cookies on users' computers by websites in a sample of Commonwealth countries, and evaluates compliance of the cookies-setting websites with privacy protection laws of the countries where the websites are hosted. Also, the rate at which third-party cookies are being set was monitored and the findings were used to estimate probability of a user's Internet activities being tracked on the websites in the Commonwealth countries.","PeriodicalId":144953,"journal":{"name":"2017 Twelfth International Conference on Digital Information Management (ICDIM)","volume":"45 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":"132179074","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
Shortest path deliveries using density-based clustering 使用基于密度的聚类的最短路径交付
2017 Twelfth International Conference on Digital Information Management (ICDIM) Pub Date : 2017-09-01 DOI: 10.1109/ICDIM.2017.8244657
Lixin Fu
{"title":"Shortest path deliveries using density-based clustering","authors":"Lixin Fu","doi":"10.1109/ICDIM.2017.8244657","DOIUrl":"https://doi.org/10.1109/ICDIM.2017.8244657","url":null,"abstract":"In e-commerce customers put orders online and goods are delivered to their destinations. The shortest path deliveries problem (SPD) is to compute a schedule for delivering the goods to all the destinations so that the total distance is minimal. In this paper we developed a new efficient delivery algorithm called DenCluSPD (Density-based Clustering for Shortest Path Deliveries). More specifically, we form a grid to hold the locations of the destinations and then create the clusters of various densities. By visiting the densest clusters first we speedup the performance and achieve the approximately optimal schedule. Our comprehensive experimentation results show that the new algorithm is indeed faster than the popular nearest neighbor first (NNF) algorithm and covers a shorter distance per destination initially.","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":"127915014","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 informatics in general education 日本大学计算机教育的全国调查:通识教育中的信息学分析
2017 Twelfth International Conference on Digital Information Management (ICDIM) Pub Date : 2017-09-01 DOI: 10.1109/ICDIM.2017.8244672
N. Takahashi, T. Kakeshita
{"title":"National survey of Japanese universities on computing education: Analysis of informatics in general education","authors":"N. Takahashi, T. Kakeshita","doi":"10.1109/ICDIM.2017.8244672","DOIUrl":"https://doi.org/10.1109/ICDIM.2017.8244672","url":null,"abstract":"We conducted the first nationwide survey of computing education at Japanese universities in 2016. In this paper, we report the survey result of Informatics in General education for all students at a university or a faculty. The survey covers various aspects including program organization, quality and quantity of educational achievement, students, teaching staff and computing environment. 739 answers are collected from 530 universities in response to the survey. The answers cover 70.5% of the Japanese universities, and approximately 81.6% of the 649 universities that responded to the survey. The information processing society of Japan (IPSJ) and the Japanese Ministry of Education (MEXT) will utilize the survey result to develop a new computing curriculum standard and national policy of computing education respectively.","PeriodicalId":144953,"journal":{"name":"2017 Twelfth International Conference on Digital Information Management (ICDIM)","volume":"133 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":"121400049","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
Message content in the life of rumors: Comparing three rumor types 生活中谣言的信息内容:比较三种谣言类型
2017 Twelfth International Conference on Digital Information Management (ICDIM) Pub Date : 2017-09-01 DOI: 10.1109/ICDIM.2017.8244643
A. Chua, Rajiv George Aricat, D. Goh
{"title":"Message content in the life of rumors: Comparing three rumor types","authors":"A. Chua, Rajiv George Aricat, D. Goh","doi":"10.1109/ICDIM.2017.8244643","DOIUrl":"https://doi.org/10.1109/ICDIM.2017.8244643","url":null,"abstract":"This study seeks to examine variations in message content in the life of rumors on Twitter. Three types of rumors were considered, namely, wish, dread and wedge-driving. Using content analysis, four broad categories of messages were identified, namely, information-related, emotion-related, deliberation, and call-to-action. The results showed the four message categories to differ in the life of rumors. The proportions of information- and emotion-related messages showed a decreasing trend with progress in the life of rumors. The proportion of deliberation messages showed an increasing trend with progress in the life of rumors. The proportion of call-to-action messages showed an increasing trend during the first half of the life of rumors, and a decreasing trend thereafter. According to the results, the four message categories were also found to differ across rumor types. Information- and emotion-related messages were most common for dread rumors. Deliberation and call for action messages are most common for wedge-driving rumors.","PeriodicalId":144953,"journal":{"name":"2017 Twelfth International Conference on Digital Information Management (ICDIM)","volume":"17 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":"116814382","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}
引用次数: 11
Minimum node weight spanning trees searching algorithm for broadcast transmission in sensor networks 传感器网络中广播传输最小节点权值生成树搜索算法
2017 Twelfth International Conference on Digital Information Management (ICDIM) Pub Date : 2017-09-01 DOI: 10.1109/ICDIM.2017.8244691
Z. Lipinski
{"title":"Minimum node weight spanning trees searching algorithm for broadcast transmission in sensor networks","authors":"Z. Lipinski","doi":"10.1109/ICDIM.2017.8244691","DOIUrl":"https://doi.org/10.1109/ICDIM.2017.8244691","url":null,"abstract":"A minimum node weight spanning tree in a weighted, directed graph is a tree whose node with maximum out-weight is minimal among all spanning trees. This type of trees are important because they appear in the solutions of the maximum lifetime broadcasting problem in wireless sensor networks. In a complete graph build of N nodes there are NN−2 spanning trees and to find such trees it is necessary to perform more than O(NN−2) operations. In this paper we propose an algorithm for searching the minimum node weight spanning trees in the graph. In the proposed algorithm, instead of calculating the symbolic determinant of the generalized Laplacian matrix, numerical operations on its exponents are performed. This allows to reduce the best case complexity of the minimum node weight spanning trees searching problem to the complexity of calculating the determinant of a numeric N × N matrix.","PeriodicalId":144953,"journal":{"name":"2017 Twelfth International Conference on Digital Information Management (ICDIM)","volume":"20 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":"127225386","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
A HTTP botnet detection system based on ranking mechanism 基于排序机制的HTTP僵尸网络检测系统
2017 Twelfth International Conference on Digital Information Management (ICDIM) Pub Date : 2017-09-01 DOI: 10.1109/ICDIM.2017.8244664
Yuan-Chin Lee, Chuan-Mu Tseng, Tzong-Jye Liu
{"title":"A HTTP botnet detection system based on ranking mechanism","authors":"Yuan-Chin Lee, Chuan-Mu Tseng, Tzong-Jye Liu","doi":"10.1109/ICDIM.2017.8244664","DOIUrl":"https://doi.org/10.1109/ICDIM.2017.8244664","url":null,"abstract":"Recently, the development of Internet technology makes network users more convenience. However, it also induces many security issues. The attackers usually distribute e-mail attached the malicious programs. After the users download the attached files and execute the malicious programs, the host has been invaded and becomes the bot. At the same time, attackers constantly update botnet to avoid them been detected. Therefore, an efficient botnet detection system is necessary. In this paper, a botnet detection system based on the network behavior ranking mechanism is proposed. The detection system has two parts. For the complete connection flows, the system aggregates flows with similar network features into same cluster. Then the system classifies the flows by the botnet sample in each cluster. After the suspicious flows are collected, the system puts all suspicious flows into bot ranking system to find the bot hosts. Finally, the system will find out the bot hosts satisfied all suspicious behaviors.","PeriodicalId":144953,"journal":{"name":"2017 Twelfth International Conference on Digital Information Management (ICDIM)","volume":"23 15","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120818541","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
Modelling swarm-intelligent systems for medical applications 为医疗应用建模群智能系统
2017 Twelfth International Conference on Digital Information Management (ICDIM) Pub Date : 2017-09-01 DOI: 10.1109/ICDIM.2017.8244702
Jolanta Mizera-Pietraszko
{"title":"Modelling swarm-intelligent systems for medical applications","authors":"Jolanta Mizera-Pietraszko","doi":"10.1109/ICDIM.2017.8244702","DOIUrl":"https://doi.org/10.1109/ICDIM.2017.8244702","url":null,"abstract":"Modeling swarm intelligent systems has attracted attention of researchers over the last decade, as the attributes such as self-organization, self-regulation or collective behavior exhibited by the system entities while following a certain set of rules, can be implemented with the aim at investigating complexity of the problems that an individual would be unable to tackle in real world. In this keynote paper, meta-heuristics and paradigms of modeling swarm-intelligent systems will be discussed with respect to their application areas for medical purposes.","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":"130713703","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
Privacy-preserved conference key distribution protocol 保密会议密钥分发协议
2017 Twelfth International Conference on Digital Information Management (ICDIM) Pub Date : 2017-09-01 DOI: 10.1109/ICDIM.2017.8244668
Chien-Lung Hsu, Tzu-Wei Lin, Huang-Chia Lu, Tzu-Hsien Chuang, Yu-Han Chen
{"title":"Privacy-preserved conference key distribution protocol","authors":"Chien-Lung Hsu, Tzu-Wei Lin, Huang-Chia Lu, Tzu-Hsien Chuang, Yu-Han Chen","doi":"10.1109/ICDIM.2017.8244668","DOIUrl":"https://doi.org/10.1109/ICDIM.2017.8244668","url":null,"abstract":"With the progress of information technology, the computer crimes are emerging in an endless stream. User's privacy should be protected. When a user submits a service request to a service provider, both should check the identity of each other and build a shared key to accomplish the service request. Furthermore, when a conference is held, the chairman must verify the identities of all participants. Afterwards, the chairman chooses a conference key and distributes it to legitimate participants. Besides, the participants should know who is in the conference. These manners prevent the malicious adversary from eavesdropping or impersonating to get some benefits. From mentioned above, we adopt identity-based cryptosystem and elliptic curve cryptosystem to propose a privacy-preserved conference key distribution protocol.","PeriodicalId":144953,"journal":{"name":"2017 Twelfth International Conference on Digital Information Management (ICDIM)","volume":"56 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":"134470360","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
National survey of Japanese universities on computing education: Analysis of non-IT departments and courses 日本大学计算机教育的全国调查:非it部门和课程的分析
2017 Twelfth International Conference on Digital Information Management (ICDIM) Pub Date : 2017-09-01 DOI: 10.1109/ICDIM.2017.8244653
T. Kakeshita
{"title":"National survey of Japanese universities on computing education: Analysis of non-IT departments and courses","authors":"T. Kakeshita","doi":"10.1109/ICDIM.2017.8244653","DOIUrl":"https://doi.org/10.1109/ICDIM.2017.8244653","url":null,"abstract":"We conducted the first national survey of computing education at Japanese universities in 2016. In this paper, we report the survey result of the computing education at non-IT departments and faculties whose major subject is not computing. The survey covers various aspects of computing education including program organization, quality and quantity of educational achievement, students, teaching staff and computing environment. We collected 998 answers through the survey. At least 87,000 non-ICT students are taking computing education in Japan. Although computing education is carried out at every major academic discipline, teaching effort greatly differs depending on the academic discipline. We also find shortage of teaching staff for computing education. The analysis result will be an essential input to develop reasonable curriculum guidelines and accreditation criteria to improve computing education at non-IT departments.","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":"114309026","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
首页 上一页 下一页 尾页
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学术官方微信