9th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing最新文献

筛选
英文 中文
Designing for self-configuration and self-adaptation in the Internet of Things 物联网自配置自适应设计
9th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing Pub Date : 2013-12-12 DOI: 10.4108/ICST.COLLABORATECOM.2013.254091
A. Athreya, Bruce DeBruhl, P. Tague
{"title":"Designing for self-configuration and self-adaptation in the Internet of Things","authors":"A. Athreya, Bruce DeBruhl, P. Tague","doi":"10.4108/ICST.COLLABORATECOM.2013.254091","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2013.254091","url":null,"abstract":"The Internet of Things (IoT) paradigm comprises a heterogenous mix of connected devices connected to the Internet. This promises a a wealth of opportunity for a large collection of distributed applications and services. However, the IoT introduces significant changes to the Internet model, largely in the form of billions to trillions of embedded devices that most likely will not be able to be managed centrally by cloud services due to lack of scalability. We suggest that the natural direction for IoT devices is to manage themselves, both in terms of their software/hardware configuration and their resource utilization. In this work, we describe the underlying framework for self-managing devices, comprising measurement-based learning and adaptation to changing system context and application demands. In addition, we describe several upcoming research challenges in order to realize this self-management vision.","PeriodicalId":222111,"journal":{"name":"9th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125152536","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}
引用次数: 41
Towards comprehensive and collaborative forensics on email evidence 迈向电子邮件证据的综合和协作取证
9th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing Pub Date : 2013-12-12 DOI: 10.4108/ICST.COLLABORATECOM.2013.254125
Justin Paglierani, Mike Mabey, Gail-Joon Ahn
{"title":"Towards comprehensive and collaborative forensics on email evidence","authors":"Justin Paglierani, Mike Mabey, Gail-Joon Ahn","doi":"10.4108/ICST.COLLABORATECOM.2013.254125","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2013.254125","url":null,"abstract":"The digital forensics community has neglected email forensics as a process, despite the fact that email remains an important tool in the commission of crime. At present, there exists little support for discovering, acquiring, and analyzing web-based email, despite its widespread use. In this paper we present a systematic process for email forensics which we integrate into the normal forensic analysis workflow, and which accommodates the distinct characteristics of email evidence. Our process focuses on detecting the presence of non-obvious artifacts related to email accounts, retrieving the data from the service provider, and representing email in a well-structured format based on existing standards. As a result, developers and organizations can collaboratively create and use analysis tools that can analyze email evidence from any source in the same fashion and the examiner can access additional data relevant to their forensic cases.","PeriodicalId":222111,"journal":{"name":"9th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125181023","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}
引用次数: 16
Analysis of heuristic based access pattern obfuscation 基于启发式的访问模式混淆分析
9th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing Pub Date : 2013-12-12 DOI: 10.4108/ICST.COLLABORATECOM.2013.254199
Huseyin Ulusoy, Murat Kantarcioglu, B. Thuraisingham, E. Cankaya, Erman Pattuk
{"title":"Analysis of heuristic based access pattern obfuscation","authors":"Huseyin Ulusoy, Murat Kantarcioglu, B. Thuraisingham, E. Cankaya, Erman Pattuk","doi":"10.4108/ICST.COLLABORATECOM.2013.254199","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2013.254199","url":null,"abstract":"As cloud computing becomes popular, the security and privacy issues emerge as important hindrances to more widespread adoption of cloud computing. In particular, outsourcing sensitive data to untrusted cloud service providers creates important security and regulatory compliance challenges. Encryption of the outsourced data has been introduced as an alternative to protect privacy and security. In the context of searchable symmetric encryption, many solutions have been proposed to perform efficient search on the encrypted outsourced data. Some of them achieve protecting privacy of outsourced data, but may disclose the access patterns (i.e., they disclose which data items are retrieved based on the query execution). Recently, it has been shown that such access pattern disclosures could be exploited even further to infer sensitive information about underlying data, even if the data is stored in encrypted form. To address the access pattern disclosures, oblivious RAM and heuristic based techniques are proposed. However, the overhead of oblivious RAM based solutions is too high in many cases, and the security and scalability of heuristic based techniques have not been carefully analyzed yet. In this paper, we provide the first framework to analyze and compare the security and efficiency of such heuristics (e.g., caching, fake data access, and data duplication). In addition, we provide extensive empirical analysis that yields important insights into how to use such heuristics effectively in practice; and we discuss how such heuristics can be combined to improve security and efficiency.","PeriodicalId":222111,"journal":{"name":"9th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125591541","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
Supporting adaptable granularity of changes for massive-scale collaborative editing 支持可调整粒度的更改,用于大规模协同编辑
9th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing Pub Date : 2013-12-12 DOI: 10.4108/ICST.COLLABORATECOM.2013.254123
Luc André, Stéphane Martin, G. Oster, C. Ignat
{"title":"Supporting adaptable granularity of changes for massive-scale collaborative editing","authors":"Luc André, Stéphane Martin, G. Oster, C. Ignat","doi":"10.4108/ICST.COLLABORATECOM.2013.254123","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2013.254123","url":null,"abstract":"Since the Web 2.0 era, the Internet is a huge content editing place in which users contribute to the content they browse. Users do not just edit the content but they collaborate on this content. Such shared content can be edited by thousands of people. However, current consistency maintenance algorithms seem not to be adapted to massive collaborative updating. Shared data is usually fragmented into smaller atomic elements that can only be added or removed. Coarse-grained data leads to the possibility of conflicting updates while fine-grained data requires more metadata. In this paper we offer a solution for handling an adaptable granularity for shared data that overcomes the limitations of fixed-grained data approaches. Our approach defines data at a coarse granularity when it is created and refines its granularity only for facing possible conflicting updates on this data. We exhibit three implementations of our algorithm and compare their performances with other algorithms in various scenarios.","PeriodicalId":222111,"journal":{"name":"9th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114482657","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}
引用次数: 40
A linked fusion of things, services, and data to support a collaborative data management facility 支持协作数据管理设施的事物、服务和数据的链接融合
9th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing Pub Date : 2013-12-12 DOI: 10.4108/ICST.COLLABORATECOM.2013.254158
E. Stephan, T. Elsethagen, A. Wynne, C. Sivaraman, M. Macduff, L. Berg, W. Shaw
{"title":"A linked fusion of things, services, and data to support a collaborative data management facility","authors":"E. Stephan, T. Elsethagen, A. Wynne, C. Sivaraman, M. Macduff, L. Berg, W. Shaw","doi":"10.4108/ICST.COLLABORATECOM.2013.254158","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2013.254158","url":null,"abstract":"The purpose of this paper is to illustrate the use of semantic technologies and approaches to seamlessly link things, services, and data in the proposed design of a scientific offshore wind energy research for the U.S. Department of Energy Wind and Water Technology Office of the Office of Energy Efficiency and Renewable Energy (EERE). By adapting linked community best practices, we were able to design a collaborative facility supporting both operational staff and end users that incorporates off-the-shelf components and overcome traditional barriers between devices, resulting data, and processing services. This was made largely possible through complementary advances in the Internet of Things (IoT), semantic web, Linked Services, and Linked Data communities, which provide the foundation for our design.","PeriodicalId":222111,"journal":{"name":"9th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122228223","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
SmartMart: IoT-based In-store mapping for mobile devices SmartMart:基于物联网的移动设备店内映射
9th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing Pub Date : 2013-12-12 DOI: 10.4108/ICST.COLLABORATECOM.2013.254116
Dylan Hicks, Kevin Mannix, Hannah M. Bowles, Byron J. Gao
{"title":"SmartMart: IoT-based In-store mapping for mobile devices","authors":"Dylan Hicks, Kevin Mannix, Hannah M. Bowles, Byron J. Gao","doi":"10.4108/ICST.COLLABORATECOM.2013.254116","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2013.254116","url":null,"abstract":"Quite often, when shopping in a supermarket (e.g. Walmart), shoppers are frustrated at locating the items on the shopping list and no assistance is available. On the other hand, retailers also lose a large volume of sales as a result. In this paper, we present a feasibility study that leverages the Internet of Things (IoT) technology to make store items “smart” so that they can automatically register and update their location information in an information retrieval system, allowing shoppers to search, locate, and map them on the store floor plan using mobile devices. A free-accessible Android-based mobile app SmartMart has been developed to demonstrate the promise of this preliminary work. Continuous development of this research could lead to a complete change in our day-to-day shopping experience.","PeriodicalId":222111,"journal":{"name":"9th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114352530","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}
引用次数: 12
Autonomic swarms for regenerative and collaborative networking 用于再生和协作网络的自主群
9th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing Pub Date : 2013-12-12 DOI: 10.4108/ICST.COLLABORATECOM.2013.254108
Rui-ping Lua, W. Ng
{"title":"Autonomic swarms for regenerative and collaborative networking","authors":"Rui-ping Lua, W. Ng","doi":"10.4108/ICST.COLLABORATECOM.2013.254108","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2013.254108","url":null,"abstract":"The exponential growth of web services have necessitate the evolution of network infrastructures to meet this challenge. We envision the myriad of Internet connected devices coming together to provide a robust and reliable service network. We propose an Autonomous Swarm Network to provide autonomic capabilities to achieve our service quality goals while coping with complex and changing requirements of today's web services particularly cost-effectiveness versus service assurance. To create a high-resilient network, we incorporated features of self-management, self-configuration, self-optimization and self-healing strategies. Using a combination of fast-flux service networks, autonomic management and swarm algorithms, it becomes possible to build cost effective assurance for existing web services. We demonstrate the feasibility of our solution using the Nanyang Analytics Supercomputer with more than 20,000 agents against varying loads. We've also simulated algorithms and reconfiguration strategies. We subsequently developed a prototype swarm network of up to 500 machines.","PeriodicalId":222111,"journal":{"name":"9th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128169169","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
Towards multi-policy support for IaaS clouds to secure data sharing 为IaaS云提供多策略支持,以确保数据共享
9th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing Pub Date : 2013-12-12 DOI: 10.4108/ICST.COLLABORATECOM.2013.254127
Ying Fairweather, Dongwan Shin
{"title":"Towards multi-policy support for IaaS clouds to secure data sharing","authors":"Ying Fairweather, Dongwan Shin","doi":"10.4108/ICST.COLLABORATECOM.2013.254127","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2013.254127","url":null,"abstract":"Infrastructure as a service (IaaS) is a cloud service model that provides storage and computation services for users at a low price. A recent report from Gartner indicates that IaaS will be the fastest growing area among all of the cloud service models in the near future, and thus it is strongly envisioned that multiple companies will use IaaS clouds to share information among them. However, the current access control mechanisms in IaaS platforms do not have the ability to enable flexible data sharing among companies while addressing security problems such as information and privacy leaking. In this paper, we propose two IaaS cloud reference architectures that enforce cloud-level Chinese Wall security (CWS) policy to prevent information leaking among companies. The new architectures are also able to support customized domain level access control policies such as role-based access control (RBAC), privacy-preserving information retrieval, and single sign on (SSO). The reference architectures were implemented using Eucalyptus and its data storage service called Walrus; therefore, our approach can also be applied to commercial clouds like Amazon S3. The result of performance analysis has shown that our architectures are feasible, scalable, and efficient.","PeriodicalId":222111,"journal":{"name":"9th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133136563","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}
引用次数: 7
Enterprise 2.0 in action: Potentials for improvement of awareness support in enterprises 企业2.0在行动:企业意识支持改进的潜力
9th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing Pub Date : 2013-12-12 DOI: 10.4108/ICST.COLLABORATECOM.2013.254066
H. Tellioglu, Simon Diesenreiter
{"title":"Enterprise 2.0 in action: Potentials for improvement of awareness support in enterprises","authors":"H. Tellioglu, Simon Diesenreiter","doi":"10.4108/ICST.COLLABORATECOM.2013.254066","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2013.254066","url":null,"abstract":"In this paper we investigate conceptually and empirically in a software development company whether Enterprise 2.0 components contain awareness mechanisms. As a result, we introduce additional mechanisms to take the first step to improve awareness in complex cooperative work environments. After a short introduction to the concepts awareness, awareness mechanisms, and Enterprise 2.0 we describe a case study to find out patterns of awareness in collaborative work processes and the missing awareness support. We approach the problem by trying to understand which Enterprise 2.0 components are related to which awareness mechanisms, and to which degree Enterprise 2.0 fulfills awareness requirements of complex collaborative work. Our study results in the identification of two different categories: system- and user-related awareness mechanisms. Search, extensions, and signals - supporting system-related mechanisms - are the most common components that are already established by different tools. Authoring, links, and tags - assisting user-related mechanisms - on the other hand, have not been utilized yet. They are very powerful to create context and capture collective knowledge. To support this, we introduce additional awareness mechanisms like enter, annotate, rate, share, reference, select, mark, and label, to show how these three components can be implemented in enterprises. By doing so, we present the potential of Enterprise 2.0 to support awareness in cooperative work. The new map of awareness mechanisms to Enterprise 2.0 inform not only the developers of tools supporting (aware) collaboration but also practitioners working in teams to define their requirements to such tools.","PeriodicalId":222111,"journal":{"name":"9th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130631279","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
Influence maximization for Big Data through entropy ranking and min-cut 通过熵排序和最小切割实现大数据影响最大化
9th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing Pub Date : 2013-12-12 DOI: 10.4108/ICST.COLLABORATECOM.2013.254119
Agustin Sancen-Plaza, Andres Mendez-Vazquez
{"title":"Influence maximization for Big Data through entropy ranking and min-cut","authors":"Agustin Sancen-Plaza, Andres Mendez-Vazquez","doi":"10.4108/ICST.COLLABORATECOM.2013.254119","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2013.254119","url":null,"abstract":"As Big Data becomes prevalent, the traditional models from Data Mining or Data Analysis, although very efficient, lack the speed necessary to process problems with data sets in the range of million samples. Therefore, the need for designing more efficient and faster algorithms for these new types of problems. Specifically, from the field of social network analysis, we have the influence maximization problem. This is a problem with many possible applications in advertising, marketing, social studies, etc, where we have representations of influences by large scale graphs. Even though, the optimal solution of this problem, the minimum set of graph nodes which can influence a maximum set of nodes, is a NP-Hard problem, it is possible to devise an approximated solution to the problem. In this paper, we have proposed a novel algorithm for influence maximization analysis. This algorithm consist in two phases: the first one is an entropy based node ranking where entropy ranking is used to determine node importance in a directed weighted influence graph. The second phase computes the minimum cut using a novel metric. To test the propose algorithm, experiments were performed in several popular data sets to evaluate performance and the seed quality over the influences.","PeriodicalId":222111,"journal":{"name":"9th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130431965","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学术文献互助群
群 号:604180095
Book学术官方微信