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

Compute最新文献

筛选
英文 中文
An Empirical evaluation of CostBoost Extensions for Cost-Sensitive Classification 成本敏感分类中CostBoost扩展的实证评价
Compute Pub Date : 2015-10-29 DOI: 10.1145/2835043.2835048
Ankit Desai, Kaushik Jadav, S. Chaudhary
{"title":"An Empirical evaluation of CostBoost Extensions for Cost-Sensitive Classification","authors":"Ankit Desai, Kaushik Jadav, S. Chaudhary","doi":"10.1145/2835043.2835048","DOIUrl":"https://doi.org/10.1145/2835043.2835048","url":null,"abstract":"Data Mining Technique, namely Classification, is used to predict group membership for data samples. Ensemble learning, combining multiple classifiers using bagging, boosting or stacking, are proven data-mining methods, we have used boosting in this paper for combining multiple classifiers. Cost-sensitive classification is used for classification tasks under the Cost-Based Model (CBM), unlike the Error-Based Model (EBM). EBM does not incorporate the cost of misclassifying a sample in a model building phase, while CBM does. CBM techniques usually modify the weight update equation to incorporate the misclassification cost from cost-matrix. Cost-sensitive boosters are studied and three new extensions of CostBoost algorithm CBE1, CBE2 and CBE3 are proposed and compared with existing cost based boosting classifiers. CSE1, CSE2 and CSE3 outperformed the original CostBoost by 5%, 4% and 4% respectively, in terms of misclassification cost.","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":"129732023","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}
引用次数: 4
Data Provenance for Historical Queries in Relational Database 关系型数据库中历史查询的数据来源
Compute Pub Date : 2015-10-29 DOI: 10.1145/2835043.2835047
A. Rani, Navneet Goyal, S. Gadia
{"title":"Data Provenance for Historical Queries in Relational Database","authors":"A. Rani, Navneet Goyal, S. Gadia","doi":"10.1145/2835043.2835047","DOIUrl":"https://doi.org/10.1145/2835043.2835047","url":null,"abstract":"Capturing, modeling, and querying data provenance in databases has gained considerable importance in the last decade. All kinds of applications developed on top of databases, now a days collect provenance for various purposes like trustworthiness of data, update management, quality measurement etc. For these purposes, there is a need to efficiently capture, store, and query provenance information for current as well as historical queries executed on the database. Most of the existing provenance models like DBNotes, MONDRIAN, Perm, Orchestra, TRIO, and GProM are suitable for capturing and querying provenance in relational databases. All these models can capture provenance only for currently executing queries, except for TRIO and GProM, which can capture and query provenance for historical queries also. But, the time and space complexity of these two models is very high. In this paper, we propose a framework, Data Provenance for Historical Queries (DPHQ), which is capable of efficiently capturing and querying provenance for queries, including that of historical queries. The proposed model also supports provenance for updates. In our model, we have used Zero Information Loss Database [2] to execute historical queries at any point of time, using the concept of nested relations. A graph database is used for storing and subsequent querying of provenance information.","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":"130032053","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}
引用次数: 9
Trust Aware Resilient Geographic Routing in Wireless Ad Hoc and Sensor Networks 无线自组织和传感器网络中的信任感知弹性地理路由
Compute Pub Date : 2015-10-29 DOI: 10.1145/2835043.2835058
P. Raghuvamsi, K. Kant
{"title":"Trust Aware Resilient Geographic Routing in Wireless Ad Hoc and Sensor Networks","authors":"P. Raghuvamsi, K. Kant","doi":"10.1145/2835043.2835058","DOIUrl":"https://doi.org/10.1145/2835043.2835058","url":null,"abstract":"The objective of the paper is to propose trust aware routing method for cooperative and resilient geographic routing in Wireless Ad-hoc and Sensor Networks (WASNs). The proposed method calculates the trust value on the basis of node behavior in routing the packets. The proposed method is designed to have the features such as self-adaptability, low overhead, and dependability which are missing in the existing trust models. With the trust values, the proposed method detects and isolates the malicious nodes dynamically during the routing process. The simulation results obtained using the network simulator ns-2 shows the efficiency of the proposed trust model.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"27 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":"126763557","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 Lightweight Stemmer for Devanagari Script 一个轻量级的Devanagari脚本
Compute Pub Date : 2015-10-29 DOI: 10.1145/2835043.2835061
Shruti R. Dangui, Nitesh Naik
{"title":"A Lightweight Stemmer for Devanagari Script","authors":"Shruti R. Dangui, Nitesh Naik","doi":"10.1145/2835043.2835061","DOIUrl":"https://doi.org/10.1145/2835043.2835061","url":null,"abstract":"Stemming is an operation that reduces morphological variants of words to its stem. Stemming is a pre-processing tool which is used in various natural language processing applications such as text summarization, information retrieval, word sense disambiguation, and document clustering. It improves the performance of Information Retrieval systems by increasing recall and reducing index size. The recall of the system is increased by stemming as the words present in the query are matched with their linguistic variants in the documents. It also reduces the index size which in turn leads to increase in speed and reduction in memory requirements. The different languages in Devanagari script are Hindi, Marathi, Konkani etc. The proposed idea is to develop a common stemmer for languages in Devanagari script by using supervised approach and to evaluate stemmer to measure the performance of stemmer.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"355 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":"131880454","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
Lifetime Optimization for Target Coverage in Wireless Sensor Networks 无线传感器网络目标覆盖的生命周期优化
Compute Pub Date : 2015-10-29 DOI: 10.1145/2835043.2835056
Pooja Chaturvedi, A. K. Daniel
{"title":"Lifetime Optimization for Target Coverage in Wireless Sensor Networks","authors":"Pooja Chaturvedi, A. K. Daniel","doi":"10.1145/2835043.2835056","DOIUrl":"https://doi.org/10.1145/2835043.2835056","url":null,"abstract":"Maintaining the desired coverage level and reliability is a major challenge in the field of wireless sensor networks (WSNs). WSN consists of number of resource constrained and unreliable sensors. In this paper we have proposed a node scheduling protocol based on trust model, which reduces the energy consumption by putting the sensor nodes in the sleep mode. To improve the lifetime we have compared the performance of proposed protocol with Trust Based Probabilistic Coverage Algorithm (TBCA). The proposed Energy Efficient Coverage Protocol (EECP) provides the performance improvement in terms of network lifetime and reliability of the data transmitted to the base station.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"57 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":"127975999","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
A Detection Algorithm for DoS Attack in the Cloud Environment 一种云环境下DoS攻击检测算法
Compute Pub Date : 2015-10-29 DOI: 10.1145/2835043.2835052
Priyanka Sharma, Rachana Sharma, E. Pilli, A. K. Mishra
{"title":"A Detection Algorithm for DoS Attack in the Cloud Environment","authors":"Priyanka Sharma, Rachana Sharma, E. Pilli, A. K. Mishra","doi":"10.1145/2835043.2835052","DOIUrl":"https://doi.org/10.1145/2835043.2835052","url":null,"abstract":"Cloud Computing provides an easy access to the end users i.e. users can access the services from wherever they want to without concerning about the storage, management, and cost and so on. With an increase in its number of users per day, threat for protecting the data residing in the Cloud is also increasing. The more information about individuals and companies is placed in the Cloud; more concerns are arising about how secure an environment it is. This paper focuses on security perspective of Cloud Computing. We discuss about the DoS attack in the cloud environment and propose a detection algorithm for the attack.","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":"128276185","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
Recommendations for Achieving Service Levels within Large-scale Resolution Service Networks 在大规模分辨率服务网络中实现服务水平的建议
Compute Pub Date : 2015-10-29 DOI: 10.1145/2835043.2835057
Kayhan Moharreri, J. Ramanathan, R. Ramnath
{"title":"Recommendations for Achieving Service Levels within Large-scale Resolution Service Networks","authors":"Kayhan Moharreri, J. Ramanathan, R. Ramnath","doi":"10.1145/2835043.2835057","DOIUrl":"https://doi.org/10.1145/2835043.2835057","url":null,"abstract":"A new recommendation framework that addresses the correct and quick resolution of incidents that occur within the complex systems of an enterprise is introduced here. It uses statistical learning to mediate problem solving by large-scale Resolution Service Networks (with nodes as technical expert groups) that collectively resolve the incidents logged as tickets. Within the enterprise a key challenge is to resolve the tickets arising from operational big data (1) to the customers' satisfaction, and (2) within a time constraint. That is, meet the service level (SL) goals. The challenge in meeting SL is the lack of a global understanding of the types of needed problem solving expertise. Consequently, this often leads to ticket misrouting to experts that are inappropriate for solving the next increment of the problem. The solution here proposes a general two-level classification framework to recommend a SL-efficient sequence of expert groups that jointly can resolve an incoming ticket. The experimental validation shows 34% accuracy improvement over existing locally applied generative models. Additionally, recommended sequences are above 96% likely to meet the enterprise SL goals, which reduces the SL violation rate by 29%. Recommendations are suppressed in the case of non-routine content which is automatically flagged for special attention by humans, since here the humans outperform statistical models.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"14 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":"115139309","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
SQMMA: Software Quality Model for Maintainability Analysis 用于可维护性分析的软件质量模型
Compute Pub Date : 2015-10-29 DOI: 10.1145/2835043.2835062
Mandeep K. Chawla, I. Chhabra
{"title":"SQMMA: Software Quality Model for Maintainability Analysis","authors":"Mandeep K. Chawla, I. Chhabra","doi":"10.1145/2835043.2835062","DOIUrl":"https://doi.org/10.1145/2835043.2835062","url":null,"abstract":"Software Quality is generally characterized by several factors which reveal the degree of success of the software developed and its future maintainability. Although many existing models provide frameworks of huge potential pertaining to quality analysis, yet offer little support to make them operational and handy to use. Nonetheless, by taking ideas from existing models, new metrics, their relationships with external quality factors and associated weights can be defined and evaluated. Keeping these views in mind, this paper proposes a new quality model (SQMMA) which offers ready-to-use mathematical formulas to quantify four quality attributes namely Analyzability, Changeability, Stability and Testability as weighted sum of a set of software code metrics. These attributes further act as determinants to evaluate `Maintainability' characteristic of a software, according to ISO 9126 definition. A revised formula to compute Maintainability, according to ISO 25010, has also been derived. The designed model is then implemented on four versions of Apache tomcat and results are presented. Finally results have been validated through their trend analysis and comparison with bugs/change metrics drawn additionally.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"26 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":"128460163","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}
引用次数: 9
A concurrent k-NN search algorithm for R-tree r树的并发k-NN搜索算法
Compute Pub Date : 2015-10-29 DOI: 10.1145/2835043.2835050
Jagat Sesh Challa, Poonam Goyal, S. Nikhil, S. Balasubramaniam, Navneet Goyal
{"title":"A concurrent k-NN search algorithm for R-tree","authors":"Jagat Sesh Challa, Poonam Goyal, S. Nikhil, S. Balasubramaniam, Navneet Goyal","doi":"10.1145/2835043.2835050","DOIUrl":"https://doi.org/10.1145/2835043.2835050","url":null,"abstract":"k-nearest neighbor (k-NN) search is one of the commonly used query in database systems. It has its application in various domains like data mining, decision support systems, information retrieval, multimedia and spatial databases, etc. When k-NN search is performed over large data sets, spatial data indexing structures such as R-trees are commonly used to improve query efficiency. The best-first k-NN (BF-kNN) algorithm is the fastest known k-NN over R-trees. We present CBF-kNN, a concurrent BF-kNN for R-trees, which is the first concurrent version of k-NN we know of for R-trees. CBF-kNN uses one of the most efficient concurrent priority queues known as mound. CBF-kNN overcomes the concurrency limitations of priority queues by using a tree-parallel mode of execution. CBF-kNN has an estimated speedup of O(p/k) for p threads. Experimental results on various real datasets show that the speedup in practice is close to this estimate.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"143 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":"124889321","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}
引用次数: 4
Computing Modular Exponentiation for Fixed-Exponent 固定指数的模幂计算
Compute Pub Date : 2015-10-29 DOI: 10.1145/2835043.2835046
S. Dwivedi
{"title":"Computing Modular Exponentiation for Fixed-Exponent","authors":"S. Dwivedi","doi":"10.1145/2835043.2835046","DOIUrl":"https://doi.org/10.1145/2835043.2835046","url":null,"abstract":"Exponentiation is computing ge, where g is an element of a group G and e is a positive integer. In modular exponentiation the underlying group is Zn or Z*n. This paper describe the methods to compute exponentiation where a fixed-exponent e is raised to several bases g of a group G. We describe modular exponentiation based on Bernstein's algorithm for multiplication by constant. We also present a modified approach to modular exponentiation based on k-ary String Replacement (SR(k)) representation.","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":"128824267","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学术官方微信
小红书