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

Compute最新文献

筛选
英文 中文
Scalable and Optimal Load Generation for AWS Clients 为AWS客户端生成可扩展和最优负载
Compute Pub Date : 2015-10-29 DOI: 10.1145/2835043.2835045
A. Rodge, S. K. Soni, L. Chinnaga, P. Johari, Joy Bose, C. Pramanik, A. Bhide
{"title":"Scalable and Optimal Load Generation for AWS Clients","authors":"A. Rodge, S. K. Soni, L. Chinnaga, P. Johari, Joy Bose, C. Pramanik, A. Bhide","doi":"10.1145/2835043.2835045","DOIUrl":"https://doi.org/10.1145/2835043.2835045","url":null,"abstract":"In this paper we describe techniques to use SPDY and HTTP network resources optimally for testing purposes with limited resources such as RAM. We demonstrate how to overcome the system limitations of network analysis tools such as the 64K limit on connections. Our enhancements include modifications to the spdycat SPDY tool to generate the loads for a higher number of users. For HTTP, we describe tweaks in system settings to improve the throughput of the system. Using our techniques, the user can perform scalability testing or load testing optimally. We have performed tests on an AWS system to measure the throughput, and have obtained 1 million concurrent connections over SPDY. We also describe the experimental setup for HTTP.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122548598","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
Parallel Framework for Efficient k-means Clustering 高效k-均值聚类的并行框架
Compute Pub Date : 2015-10-29 DOI: 10.1145/2835043.2835060
S. Kumari, A. Maheshwari, Poonam Goyal, Navneet Goyal
{"title":"Parallel Framework for Efficient k-means Clustering","authors":"S. Kumari, A. Maheshwari, Poonam Goyal, Navneet Goyal","doi":"10.1145/2835043.2835060","DOIUrl":"https://doi.org/10.1145/2835043.2835060","url":null,"abstract":"Handling and processing of larger volume of data requires efficient data mining algorithms. k-means is a very popular clustering algorithm for data mining, but its performance suffers because of initial seeding problem. The computation time of k-means algorithm is directly proportional to the number of data-points, number of dimensions, and number of iterations, therefore, it is very expensive to process large data-points sequentially. We proposed an efficient parallel framework which includes dimensionality-reduction as well as data-size reduction techniques to improve k-means processing time and initial seeding problem. Our proposed parallel framework leverages the multi-node and multi-core architectures of a typical commodity cluster. We have validated our proposed approaches with real and synthetic datasets in parallel environment setup. The experimental results clearly show the significant improvements in k-means performance.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121079805","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
Efficient Video Streaming for Interactive Session 交互式会话的高效视频流
Compute Pub Date : 2015-10-29 DOI: 10.1145/2835043.2835044
Soumen Kanrar, N. Mandal
{"title":"Efficient Video Streaming for Interactive Session","authors":"Soumen Kanrar, N. Mandal","doi":"10.1145/2835043.2835044","DOIUrl":"https://doi.org/10.1145/2835043.2835044","url":null,"abstract":"Over the decades, researchers are trying to find an effective methodology for smooth uninterrupted multimedia data streaming through the broad band network in video on demand system. The problem is directly related to the efficiently use of methodology in the next generation network. The performance of the data streaming is largely depended upon the adaptability of the methodology to the user dynamic requirement for bandwidth in any interactive session. The users are largely interested to use interactive operation during the real-time video watching at user ends. The bandwidth utilization be good, if the data stream is served from the local site, if the local site cannot serve, then that will be served from the remotely distributed storage architecture. The submitted requests are exponentially increased with respect to the geographic location for any interactive session. In this work, we have presented the multimedia storage architecture in the distributed system environment, i.e. local proxy servers, remote data storages clusters and the role of a cluster switch. The proposed methodology is working for proxy server with a total bandwidth capacity divided into the number of sections.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115025271","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
Knowledge Networks and Knowledge Adjacencies 知识网络与知识邻接
Compute Pub Date : 2015-10-29 DOI: 10.1145/2835043.2835053
V. Avasthi, S. Dey, Shankar Venkatagiri, K. Jain, Rajhans Mishra
{"title":"Knowledge Networks and Knowledge Adjacencies","authors":"V. Avasthi, S. Dey, Shankar Venkatagiri, K. Jain, Rajhans Mishra","doi":"10.1145/2835043.2835053","DOIUrl":"https://doi.org/10.1145/2835043.2835053","url":null,"abstract":"The modern enterprise is becoming larger and geographically distributed. The structure of companies is also becoming more complicated. Oraganizations are depending on knowledge within the enterprise and outside the enterprise. More and more individuals within organizations are parts of communities of practice which at times extend the boundaries of organizations. This necessitates people in the enterprise to have access to other individuals based on their roles and expertise [12]. Individuals within teams are constantly looking for sources of expertise that they don't have. In larger organizations, it becomes extremely difficult to identify the individuals that have the relevant expertise and get in touch with the individuals.\u0000 Organizations and communities of practice have deployed knowledge management system to solve this problem with the belief that better implementation of information technologies [4] would result in more knowledge sharing and this would benefit the organizations. This has resulted in knowledge management research community being too focused on IT. A significant amount of knowledge is generated within the enterprise in communities of practice that consist of individuals both from within the enterprise and external to enterprise.\u0000 There is no standard way to represent and access knowledge in the enterprise. Most of the knowledge within the enterprise resides in the form of documents, communications and in the mind of people. In this paper we define a way to represent the knowledge in the form of knowledge ontology. We also define system for generating knowledge networks that exist within the organization.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117265614","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 Novel Approach for Classification of E-Commerce Data 一种新的电子商务数据分类方法
Compute Pub Date : 2015-10-29 DOI: 10.1145/2835043.2835049
K. Chaitanya, D. Somayajulu, P. R. Krishna
{"title":"A Novel Approach for Classification of E-Commerce Data","authors":"K. Chaitanya, D. Somayajulu, P. R. Krishna","doi":"10.1145/2835043.2835049","DOIUrl":"https://doi.org/10.1145/2835043.2835049","url":null,"abstract":"Classification is one of the most interesting problems in the fast evolving fields such as e-commerce and web-based businesses where the data is growing exponentially. Existing classification techniques over e-commerce data are mainly based on the users' purchasing patterns. However, gender preferences significantly improve in recommending various products, targeting customers for branding products, providing customized suggestions to the users etc. In this paper, we propose a two-phase approach for gender based classification to classify e-commerce data by exploiting hierarchical relationships among products. The first phase reduces the dimensionality of the data by identifying the features that well describes the browsing pattern of the users. The second phase classifies the data based on these features. Experiments are carried out on clickstream data (provided by FPT group) consisting of browsing logs (with list of products formed as a hierarchy), session start time and session end time. We compared our results with standard Bayesian classification model, which shows the applicability of our classification approach for e-commerce data.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123125718","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
Comparing Performance of Parallelizing Frameworks for Grid-Based Fluid Simulation on the CPU 基于CPU的网格流体仿真并行化框架性能比较
Compute Pub Date : 2015-10-29 DOI: 10.1145/2835043.2835063
A. Prakash, P. Chaudhuri
{"title":"Comparing Performance of Parallelizing Frameworks for Grid-Based Fluid Simulation on the CPU","authors":"A. Prakash, P. Chaudhuri","doi":"10.1145/2835043.2835063","DOIUrl":"https://doi.org/10.1145/2835043.2835063","url":null,"abstract":"In this paper we present a comparison study of two widely used parallelizing frameworks on the CPU, namely, OpenMP and Intel Threading Building Blocks (TBB). The particular problem domain we apply to is a grid-based fluid simulation solver. The standard Eulerian grid-based fluid solver discretizes the Navier-Stokes equation on a staggered but regular grid and computes the fluid parameters like velocity and pressure in each grid cell. We use OpenMP and TBB to parallelize this computation, and study the behaviour of our implementation on each framework, while working with different number of threads and CPU cores. We provide arguments in support of implementing a mixed solution strategy using both the parallelizing frameworks together, thus improving performance over when either is used in isolation.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126000341","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
Reliability on Top of Best Effort Delivery: Maximal Connectivity Test on NoC Interconnects 基于最大努力交付的可靠性:NoC互连的最大连接性测试
Compute Pub Date : 2015-10-29 DOI: 10.1145/2835043.2835059
B. Bhowmik, J. Deka, S. Biswas
{"title":"Reliability on Top of Best Effort Delivery: Maximal Connectivity Test on NoC Interconnects","authors":"B. Bhowmik, J. Deka, S. Biswas","doi":"10.1145/2835043.2835059","DOIUrl":"https://doi.org/10.1145/2835043.2835059","url":null,"abstract":"A scalable, packet address driven strategy that tests an open fault on network-on-chip (NoC) interconnects and maximal connectivity between neighbor routers in presence of a short fault is proposed. The open faults and maximal connectivity are tested for data, control, and handshake interconnects by the proposed method using finite test sequence. Experiments ensure the state of faultiness/non-faultiness of an interconnect with/without an open fault and possibility of connectivity over faulty interconnects for a channel. Evaluation is done in terms of test time, testing criteria, and performance metrics. Results achieve 100% test and fault coverages when interconnects possess open faults only but nearly 100% when shorts are injected on faulty interconnects to make connectivity.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"179 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116173342","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}
引用次数: 14
Pipette: a virtual content transporter 移液管:一个虚拟的内容传输器
Compute Pub Date : 2014-10-09 DOI: 10.1145/2675744.2675751
Amit Sarkar
{"title":"Pipette: a virtual content transporter","authors":"Amit Sarkar","doi":"10.1145/2675744.2675751","DOIUrl":"https://doi.org/10.1145/2675744.2675751","url":null,"abstract":"This paper presents the design and evaluation of Pipette, a new framework that provides a stylus-based interactive and animated user interface (UI) for digital content transfer. The pipette detects stylus gestures when performed on touch-based devices and uses the gesture to trigger content copy and paste operation Along with gesture, it uses the context or scenario in which user is present to differentiate between copy or paste action. Pipette creates a visual illusion of actual content transfer into the stylus by showing suction animation to represent copy action. We propose the use of mass-spring model for animating content deformation. A mass propagation suction algorithm is presented to simulate absorption of content into the stylus. Pipette also proposes showing a pouring animation to represent paste action. We analyze the utility of pipette via a mobile application and benchmark with existing state of the art systems. Results show the effectiveness of pipette compared to presently known techniques for copy and paste operation.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116468531","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
Privacy preserving content disclosure for enabling sharing of electronic health records in cloud computing 保护隐私的内容披露，以便在云计算中共享电子健康记录
Compute Pub Date : 2014-10-09 DOI: 10.1145/2675744.2675753
Anju Mohandas, S. Sabitha
{"title":"Privacy preserving content disclosure for enabling sharing of electronic health records in cloud computing","authors":"Anju Mohandas, S. Sabitha","doi":"10.1145/2675744.2675753","DOIUrl":"https://doi.org/10.1145/2675744.2675753","url":null,"abstract":"Cloud computing has been gaining acceptance in various scenarios ranging from storing user's personal data to managing PHRs(Personal Health Records) as it facilitates data sharing. The major threat that hinders its wide deployment even today is the fear of losing privacy of the data stored on the cloud. Thus privacy preserving data sharing becomes an important concern for cloud users. The conventional encryption schemes cannot be directly applied in this scenario. A promising approach is to use ABE(Attribute Based Encryption) for the same. CP-ABE, a variant of ABE, can provide fine grained access control but one draw back of CP-ABE is that it focuses only on who accesses the data. To address this concern, we combine CP-ABE with Anonymization to enforce fine grained privacy preserved access control and data sharing among a group of cloud users. Although, this paper discusses on sharing EHRs, the concepts can be generalized and applied to other scenarios as well.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116228437","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
SemMovieRec: extraction of semantic features of DBpedia for recommender system SemMovieRec:为推荐系统提取DBpedia的语义特征
Compute Pub Date : 2014-10-09 DOI: 10.1145/2675744.2675759
Nidhi Kushwaha, O. Vyas
{"title":"SemMovieRec: extraction of semantic features of DBpedia for recommender system","authors":"Nidhi Kushwaha, O. Vyas","doi":"10.1145/2675744.2675759","DOIUrl":"https://doi.org/10.1145/2675744.2675759","url":null,"abstract":"Recommendation System has been developed with the growth of Word Wide Web. Recently, Web3.0 or Semantic Web has changed the traditional way of its related approaches, by leveraging knowledge of Linked Open data Cloud which consist of domain specific and cross domain interconnected datasets. It fabricates thousands of RDF triples and millions of links (external/internal) to connect this open source data. As per our literature survey we have found that the Recommender System based on Linked Open data Cloud does not deal with this Knowledge Base in an efficient manner because of the problem of data sparsity and inconsistency, which results due to automatic generation of Resource Description Format data from unstructured documents that leads to garbage data have no sense in recommending. This paper aims to explore a hybrid recommender which can be used as a rating predictor as well as movie recommender of RDF datasets. Also, we present a new model for Recommender System that not only utilizes DBpedia Knowledge Base but also remove the former problems in Recommender System by using a preprocessing technique for sparsity removal. To prove the correctness and accuracy of our model we have implemented and tested it over other previous methodologies. In order to make our algorithm efficient, we also used different data structure for storing and processing.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122330928","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}
引用次数: 14
首页 上一页 下一页 尾页
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学术官方微信
小红书