2014 13th International Symposium on Distributed Computing and Applications to Business, Engineering and Science最新文献

筛选
英文 中文
Non-iteration Parallel Algorithm for Frequent Pattern Discovery 频繁模式发现的非迭代并行算法
Chun Liu, Yuqiang Li
{"title":"Non-iteration Parallel Algorithm for Frequent Pattern Discovery","authors":"Chun Liu, Yuqiang Li","doi":"10.1109/DCABES.2014.73","DOIUrl":"https://doi.org/10.1109/DCABES.2014.73","url":null,"abstract":"For the high time overhead problems of Apriori algorithm while solving for the long length frequent patterns, using the MapReduce distributed programming ideas, the paper breaks the original idea of Aproiri which discovers the frequent item sets through gradually increasing the element numbers in the frequent item sets. It proposes a new non-iteration parallel algorithm about frequent pattern discovery, which can get arbitrary length frequent pattern at random. The experimental results show that the proposed algorithm has better time performance than such parallel algorithms which are under the ideas of traditional Apriori algorithm.","PeriodicalId":202802,"journal":{"name":"2014 13th International Symposium on Distributed Computing and Applications to Business, Engineering and Science","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115589042","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
Performance Issues and Query Optimization in Big Multidimensional Data 大多维数据中的性能问题和查询优化
J. Kiruthika, S. Khaddaj
{"title":"Performance Issues and Query Optimization in Big Multidimensional Data","authors":"J. Kiruthika, S. Khaddaj","doi":"10.1109/DCABES.2014.8","DOIUrl":"https://doi.org/10.1109/DCABES.2014.8","url":null,"abstract":"SQL queries for big-data and multidimensional data need to be carefully coded to get maximum benefit of optimization and to improve the performance of the system and the applications involved. This is especially true for online applications where there is a race against time in populating the results set. Valuable time and cost can be saved by optimizing query statements during their design process especially when they are required to perform complex process involving relationships with the other tables. The relationships with the tables vary from complex joins to sorting order which has direct impact on system performance. Transactions SQL (TSQL), stored procedures, triggers etc. Can be efficiently coded to optimize a query. Queries involved in 3D databases depend on user interaction have a human element added in the optimization process. This paper addresses few of the issues using a number of potential applications.","PeriodicalId":202802,"journal":{"name":"2014 13th International Symposium on Distributed Computing and Applications to Business, Engineering and Science","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122333249","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
Portfolio Pricing Models under Different Collecting Methods in the Green Supply Chain for Home Appliances Industry 家电行业绿色供应链中不同收费方式下的投资组合定价模型
A. Xu, Shufeng Gao
{"title":"Portfolio Pricing Models under Different Collecting Methods in the Green Supply Chain for Home Appliances Industry","authors":"A. Xu, Shufeng Gao","doi":"10.1109/DCABES.2014.50","DOIUrl":"https://doi.org/10.1109/DCABES.2014.50","url":null,"abstract":"From the perspectives of the operational objectives of the green supply chain management and in consideration of its economic efficiency, social and environmental impact as well as its unique characteristics, this paper examines the pricing issues of the green supply chain for home appliances industry by using game theory. Considering the influences of the effective recycle behavior of the used home appliances on the whole supply chain, the paper proposes three game models for the portfolio pricing for the wholesale, retail and recycle price under three different collection methods respectively. The three collection methods are 1) manufacturer collection (Model M), 2) retailer collection (Model R) and 3) third-party collection (Model 3P). Then the paper analyzes how the wholesale price, the retail price for green home appliances, the recycle price for the used home appliances, and the total channel profits are affected by the choice of the collection methods. The pricing models presented in this paper provide a practical and theoretical guidance for home appliances enterprises in making pricing decisions.","PeriodicalId":202802,"journal":{"name":"2014 13th International Symposium on Distributed Computing and Applications to Business, Engineering and Science","volume":"404 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127596277","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
Associate Task Scheduling Algorithm Based on Delay-Bound Constraint in Cloud Computing 云计算中基于延迟约束的关联任务调度算法
Yingchi Mao, Lili Zhu, X. Chen, Qing Jie
{"title":"Associate Task Scheduling Algorithm Based on Delay-Bound Constraint in Cloud Computing","authors":"Yingchi Mao, Lili Zhu, X. Chen, Qing Jie","doi":"10.1109/DCABES.2014.22","DOIUrl":"https://doi.org/10.1109/DCABES.2014.22","url":null,"abstract":"Task scheduling is one of the most important issues in the cloud computing environments. In the cloud systems, the main goal of the task scheduling algorithms is to balance the workload among the computing nodes and maximize the utilization while meeting the bound of the total execution time. Concerning the delay of the associated tasks scheduling in cloud computing, a hierarchical task model was discussed and the associated task scheduling algorithm based on delay-bound constraint (ATS-DB) was proposed. The associated tasks and the task execution order were represented by one directed acyclic graph (DAG). The proposed hierarchical task model can improve the task execution concurrency. The independent tasks in each layer was grouped into the corresponding task set belonging to the task layer. Through the calculation of the total tasks execution time bound in each task layer, the associated task was dispatched to the resources with the minimum execution time. Extensive experimental results demonstrated that the proposed ATS-DB algorithm can achieve better performance than HEFT algorithm in the terms of the total execution time and resource utilization.","PeriodicalId":202802,"journal":{"name":"2014 13th International Symposium on Distributed Computing and Applications to Business, Engineering and Science","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132029550","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
Low Energy-Consuming Cluster-Based Algorithm to Enforce Integrity and Preserve Privacy in Data Aggregation 基于低能耗聚类的数据聚合完整性保护算法
Zhengwei Guo, Xiucai Ding
{"title":"Low Energy-Consuming Cluster-Based Algorithm to Enforce Integrity and Preserve Privacy in Data Aggregation","authors":"Zhengwei Guo, Xiucai Ding","doi":"10.1109/DCABES.2014.32","DOIUrl":"https://doi.org/10.1109/DCABES.2014.32","url":null,"abstract":"This paper proposes a low energy-consuming cluster-based algorithm to protect data integrity and privacy named ILCCPDA, which can dynamically elect cluster head by LEACH clustering protocol and take the simple cluster fusion approach to reduce the data transmission, thus reducing energy consumption. ILCCPDA can detect data integrity by adding homomorphic message authentication code and take the random key distribution mechanism for data encryption. It can solve the problem of the integrity, privacy and energy consumption in the wireless transmission of sensor data.","PeriodicalId":202802,"journal":{"name":"2014 13th International Symposium on Distributed Computing and Applications to Business, Engineering and Science","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121782514","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
Research and Application of NetEye Network Traffic Monitoring System NetEye网络流量监控系统的研究与应用
Xi Liya, Mei Wenjun
{"title":"Research and Application of NetEye Network Traffic Monitoring System","authors":"Xi Liya, Mei Wenjun","doi":"10.1109/DCABES.2014.43","DOIUrl":"https://doi.org/10.1109/DCABES.2014.43","url":null,"abstract":"Through the analysis and study of common traffic monitoring methods, Net Eye(referring to the name of the model put forward in the context) traffic monitoring model is put forward. The article expounds its function and the key algorithm, and system implementation by technologies such as WinPcap and so on.","PeriodicalId":202802,"journal":{"name":"2014 13th International Symposium on Distributed Computing and Applications to Business, Engineering and Science","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114746764","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 Cloud Gaming System Based on NVIDIA GRID GPU 基于NVIDIA GRID GPU的云游戏系统
Qingdong Hou, Chu Qiu, Kaihui Mu, Quan Qi, Yongquan Lu
{"title":"A Cloud Gaming System Based on NVIDIA GRID GPU","authors":"Qingdong Hou, Chu Qiu, Kaihui Mu, Quan Qi, Yongquan Lu","doi":"10.1109/DCABES.2014.19","DOIUrl":"https://doi.org/10.1109/DCABES.2014.19","url":null,"abstract":"Like Internet sweeping the world 20 years ago, cloud gaming, today, is gaining in popularity with unimaginable speed. However, many technical issues must be solved through its exploring process. Among all of these problems, bandwidth limitation and support for multi-client concurrent access become the bottleneck for further development of cloud gaming. Cloud gaming is based on real-time audio and video stream, therefore, it will be a great contribution to cloud gaming on research how to encode the stream with minimum time and maximum compression radio. So we are committed to improve the ways of encoding and multi-client concurrent access in the server of cloud gaming. In order to reduce the delay in limited bandwidth and improve multi-client concurrent access efficiency, a concurrent server is built up based on the integration of NVIDIA GRID GPU and the open source cloud gaming platform Gaming Anywhere. As the results show, the latency is reduced and the concurrency is improved in this system.","PeriodicalId":202802,"journal":{"name":"2014 13th International Symposium on Distributed Computing and Applications to Business, Engineering and Science","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124036041","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
TwigMRR: Distributed XML Twig Query Processing TwigMRR:分布式XML小枝查询处理
Zhixue He, Husheng Liao, Hang Su
{"title":"TwigMRR: Distributed XML Twig Query Processing","authors":"Zhixue He, Husheng Liao, Hang Su","doi":"10.1109/DCABES.2014.36","DOIUrl":"https://doi.org/10.1109/DCABES.2014.36","url":null,"abstract":"Twig query is considered the core query pattern in most XML query language. With the XML document size becoming larger, single site cannot deal with such volume data in storage capacity and compute ability. Partitioning the large data and distributed parallel processing query is an efficient and effective way. This paper proposes Twig MRR algorithm for evaluating XML twig query over large XML data that is encoded by Dewey, partitioned horizontally and distributed storage in a cluster. Twig MRR is based on MapReduce and extended a new model Map-Reduce-Reduce to get the final results for twig query. The experimental results show that our approach is scalable and efficient on this problem.","PeriodicalId":202802,"journal":{"name":"2014 13th International Symposium on Distributed Computing and Applications to Business, Engineering and Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130504928","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
Multi-index Evaluation Algorithm Based on Locally Linear Embedding for the Node Importance in Complex Networks 基于局部线性嵌入的复杂网络节点重要性多指标评价算法
Fang Hu, Yuhua Liu, Jianzhi Jin
{"title":"Multi-index Evaluation Algorithm Based on Locally Linear Embedding for the Node Importance in Complex Networks","authors":"Fang Hu, Yuhua Liu, Jianzhi Jin","doi":"10.1109/DCABES.2014.30","DOIUrl":"https://doi.org/10.1109/DCABES.2014.30","url":null,"abstract":"Evaluation of node importance in complex network is significant, so it is important to seek and protect important node, which is ensure the security and stability of the entire network. At present, most algorithms of important node evaluation are according to the single-index, which can't reflect the whole condition of complex network. In this paper, synthesizing multi-index factors of node importance, including degree centrality, betweenness centrality, closeness centrality, eigenvector centrality, mutual-information, etc., a new multi-index evaluation algorithm based on Locally Linear Embedding (LLE) for the node importance in complex network is proposed. In order to verify the validity of this algorithm, a series of simulation experiments have been done. Through comprehensive analysis, the simulation results represent that the new algorithm is rational, effective, integral and accurate.","PeriodicalId":202802,"journal":{"name":"2014 13th International Symposium on Distributed Computing and Applications to Business, Engineering and Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126296085","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
Parallel Computer Technology Study on Hydrodynamic and Sediment Transport Mathematical Model in Estuaries Based on MPI 基于MPI的河口水动力输沙数学模型并行计算机研究
Chen Wenlong, Shi Yingbiao, Wu Xiuguang, L. Zhiyong, Wang Rongsheng
{"title":"Parallel Computer Technology Study on Hydrodynamic and Sediment Transport Mathematical Model in Estuaries Based on MPI","authors":"Chen Wenlong, Shi Yingbiao, Wu Xiuguang, L. Zhiyong, Wang Rongsheng","doi":"10.1109/DCABES.2014.12","DOIUrl":"https://doi.org/10.1109/DCABES.2014.12","url":null,"abstract":"Serial estuarine hydrodynamic and sediment transport model is parallelized by MPI method based on domain decomposition techniques, the parallel model is applied to a hydrodynamic example of tidal current and sediment transport in the estuary and offshore area of Zhejiang in China. The benchmark result shows that MPI method has good parallel effect, whose speedup is accessible to 41 by 80 processors. Simulations of the annual sediment transport by tidal currents in local region have been reduced to less than one day of compute time.","PeriodicalId":202802,"journal":{"name":"2014 13th International Symposium on Distributed Computing and Applications to Business, Engineering and Science","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127990840","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学术官方微信
小红书