检索结果-内蒙古大学图书馆

International Workshop on Big Data and Information Security (IWBIS)

作者： Darmatasia Arymurthy, Aniati Murni Univ Indonesia Fac Comp Sci Depok 16424 West Java Indonesia

ISBN: (纸本)9781509034772

Data mining approach can be used to discover knowledge by analyzing the patterns or correlations among of fields in large databases. Data mining approach was used to find the patterns of the data from Tanzania Ministry of Water. It is used to predict current and future status of water pumps in Tanzania. The data mining method proposed is XGBoost (eXtreme Gradient Boosting). XGBoost implement the concept of Gradient tree Boosting which designed to be highly fast, accurate, efficient, flexible, and portable. In addition, Recursive Feature Elimination (RFE) is also proposed to select the important features of the data to obtain an accurate model. The best accuracy achieved with using 27 input factors selected by RFE and XGBoost as a learning model. The achieved result show 80.38% in accuracy. The information or knowledge which is discovered from data mining approach can be used by the government to improve the inspection planning, maintenance, and identify which factor that can cause damage to the water pumps to ensure the availability of potable water in Tanzania. Using data mining approach is cost-effective, less time consuming and faster than manual inspection.

关键词： Data Mining tree algorithm Water Pumps XGBoost

来源：评论

学校读者我要写书评

暂无评论

Mit :: Lcs :: Tr :: Mit-Lcs-Tr-121

引用

2016年

Mit :: Lcs :: Tr :: Mit-Lcs-Tr-121 by published by

关键词： algorithm basic strategy best player bounds comparisons largest largest element lemma lower lower bound lower bounds main theorem minimum number mit-lcs-tr-121 proof theorem third best tournament tree algorithm undefeated undefeated players

来源：评论

学校读者我要写书评

暂无评论

Physical layer network-coded MAC strategy

Physical layer network-coded MAC strategy

引用

International Conference on Cyberspace Technology (CCT 2014)

作者： Yu Zhang Ge Xiong School of Computer and Communication Engineering University of Science and Technology Beijing 100083 China School of Software Beihang University 100191 China

ISBN: (纸本)9781510802704

This paper introduces physical layer network coding into multiple access system and then proposes a physical layer network coded MAC strategy (PNC-MAC). The detail steps of the PNC-MAC are presented. To show the performance of the algorithm, we compare the throughput and average delay induced by the new algorithm with that by modified ALOHA strategy and tree algorithm via simulations. The results showed that when operated with our proposed PNC-MAC, multiple access system can achieve a larger throughput while the frames bear shorter average delay. Besides, in many users case, the throughput increases slightly while the average delay ascends drastically.

关键词： ALOHA strategy Medium access control Physical layer network coding tree algorithm Medium access control mean delay Physical layer Multi access systems hierarchical network Throughput MAXIMUM ACCEPTABLE CONTAMINATION Media Access Protocol

来源：评论

学校读者我要写书评

暂无评论

Performance Comparison of Collision Resolution algorithms with Amount of Feedback Information

Performance Comparison of Collision Resolution Algorithms wi...

引用

International Symposium on Wireless and Pervasive Computing (ISWPC)

作者： Wattanamongkhol, Norrarat Burapha Univ Fac Engn Dept Elect Engn Chon Buri Thailand

ISBN: (纸本)9781479921850

This paper presents the performance comparison of eight collision resolution algorithms. It can be systematically applied for random access protocols under different feedback information which includes binary, ternary and feedback of the number of accessing packets. Each algorithm is derived from the combination of uniform selection algorithm and three effective strategies, including splitting, adaptive frame size, and skipped slot. This paper aims to investigate which one strategy in these three strategies is the best effective to improve the system performance. Based on simulation results, when the information about number of accessing packets is available, significant improvement in mean access delay can be achieved. We found that the splitting strategy is the most effective strategy, following by adaptive frame size and skipped slot.

关键词： Collision resolution algorithm tree algorithm feedback information MAC protocol

来源：评论

学校读者我要写书评

暂无评论

A multiaccess tree algorithm with free access, interference cancellation and single signal memory requirements

引用

PERFORMANCE EVALUATION 2007年第9-12期64卷 1041-1052页

作者： Peeters, G. T. Van Houdt, B. Blondia, C. Univ Antwerp Dept Math & Comp Sci Performance Anal Telecommun Syst Res Grp IBBT B-2020 Antwerp Belgium

tree algorithms are a well studied class of collision resolution algorithms for solving multiple access control problems. Successive interference cancellation, which allows one to recover additional information from otherwise lost collision signals, has recently been combined with tree algorithms with blocked access [Y. Yu, G.B. Giannakis, SICTA: A 0.693 contention tree algorithm using successive interference cancellation, in: INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, Miami, USA, 2005, pp. 1908-1916], providing a substantially higher maximum stable throughput (MST): 0.693 for Poisson arrivals, given an infinite number of memory locations for storing signals. We propose a novel tree algorithm for a similar problem, but with two relaxed model assumptions: free access is supported and a single signal memory location suffices. A study of the maximal stable throughput of this algorithm is provided using matrix analytical methods;as a result, an MST of 0.5698 for Poisson arrivals is achieved. Our methodology also allows us to investigate the MST when the multiple access channel is subject to Markovian arrival processes. (c) 2007 Published by Elsevier B.V.

关键词： multiple access tree algorithm successive interference cancellation

来源：评论

学校读者我要写书评

暂无评论

A robust high-throughput tree algorithm using successive interference cancellation

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2007年第12期55卷 2253-2256页

作者： Wang, Xin Yu, Yingqun Giannakis, Georgios B. Florida Atlantic Univ Dept Elect Engn Boca Raton FL 33431 USA Qualcomm Inc San Diego CA 92108 USA Univ Minnesota Dept Elect & Comp Engn Minneapolis MN 55455 USA

A novel random access protocol combining a tree algorithm (TA) with successive interference cancellation (SIC) has been introduced recently. To mitigate the deadlock problem of SICTA arising in error-prone wireless networks, we put forth a SICTA with first success (SICTA/FS) protocol, which is capable of high throughput while requiring limited-sensing and gaining robustness to errors relative to SICTA.

关键词： random access successive interference cancellation (SIC) tree algorithm

来源：评论

学校读者我要写书评

暂无评论

Power-Controlled FCFS Splitting algorithm for Wireless Networks

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2010年第2期59卷 842-856页

作者： Gore, Ashutosh Deepak Karandikar, Abhay Marvell India Private Ltd Pune 411006 Maharashtra India Indian Inst Technol Dept Elect Engn Mumbai 400076 Maharashtra India

We consider random access in wireless networks under a physical interference model, wherein a receiver is capable of power-based capture, i. e., a packet can be correctly decoded in the presence of multiple transmissions if the received signal-to-interference- plus-noise ratio (SINR) exceeds a threshold. We propose a splitting algorithm that varies the transmission power of users on the basis of quaternary channel feedback (idle, success, capture, and collision). We show that our algorithm achieves a maximum stable throughput of 0.5518. Simulation results demonstrate that our algorithm achieves higher throughput and lower delay than those of first-come-first-serve and residual-energy-based splitting algorithms with uniform transmission power

关键词： Collision resolution Markov chain random access tree algorithm wireless medium access control (MAC)

来源：评论

学校读者我要写书评

暂无评论

Bames-Hut treecode on GPU

Bames-Hut Treecode on GPU

引用

The 2010 IEEE International Conference on Progress in Informatics and Computing

作者： Hu Jiang,Qianni Deng Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai,China

General-purpose computation on graphics processing units(GPGPU) has become a popular field of *** to its high computing capacity and relatively low price,GPU has been an ideal processing unit for many scientific applications,among which is N-body *** to the published papers,a simple O(N 2) algorithm of N-body simulation has achieved some enhancements,but tree-algorithm doesn't work well on GPU. This paper proposes a new implementation of tree-algorithm on GPU using CUDA,which has obtained more than 100X speedup when computing forces between *** paper also rises up a new method to build tree in this algorithm,making the performance even better.

关键词： GPGPU N-body simulation tree algorithm

来源：评论

学校读者我要写书评

暂无评论

A novelmultiple-walk parallel algorithm for the Barnes-Hut treecode on GPUs - towards cost effective, high performance N-body simulation

引用

COMPUTER SCIENCE-RESEARCH AND DEVELOPMENT 2009年第1-2期24卷 21-31页

作者： Hamada, Tsuyoshi Nitadori, Keigo Benkrid, Khaled Ohno, Yousuke Morimoto, Gentaro Masada, Tomonari Shibata, Yuichiro Oguri, Kiyoshi Taiji, Makoto Nagasaki Univ Fac Engn Dept Comp & Informat Sci Nagasaki 8528521 Japan Univ Tokyo Dept Astron Bunkyo Ku Tokyo 1130033 Japan Univ Edinburgh Sch Engn Edinburgh EH9 3JL Midlothian Scotland RIKEN Inst Phys & Chem Res Kanagawa 2300046 Japan

Recently, general-purpose computation on graphics processing units (GPGPU) has become an increasingly popular field of study as graphics processing units (GPUs) continue to be proposed as high performance and relatively low cost implementation platforms for scientific computing applications. Among these applications figure astrophysical N-body simulations, which form one of the most challenging problems in computational science. However, in most reported studies, a simple O(N-2) algorithm was used for GPGPUs, and the resulting performances were not observed to be better than those of conventional CPUs that were based on more optimized O(N log N) algorithms such as the tree algorithm or the particle-particle particle-mesh algorithm. Because of the difficulty in getting efficient implementations of such algorithms on GPUs, a GPU cluster had no practical advantage over general-purpose PC clusters for N-body simulations. In this paper, we report a new method for efficient parallel implementation of the tree algorithm on GPUs. Our novel tree code allows the realization of an N-body simulation on a GPU cluster at a much higher performance than that on general PC clusters. We practically performed a cosmological simulation with 562 million particles on a GPU cluster using 128 NVIDIA GeForce 8800GTS GPUs at an overall cost of 168 172 $. We obtained a sustained performance of 20.1 Tflops, which when normalized against a general-purpose CPU implementation leads to a performance of 8.50 Tflops. The achieved cost/performance was hence a mere $19.8 /Gflops which shows the high competitiveness of GPGPUs.

关键词： GPU N-body simulation tree algorithm

来源：评论

学校读者我要写书评

暂无评论

Design and analysis of cross-layer tree algorithms for wireless random access

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2008年第3期7卷 909-919页

作者： Wang, Xin Yu, Yingqun Giannakis, Georgios B. Florida Atlantic Univ Dept Elect Engn Boca Raton FL 33431 USA Qualcomm Inc San Diego CA USA Univ Minnesota Dept Elect & Comp Engn Minneapolis MN 55455 USA

In this paper, we develop a random access scheme which combines the widely used binary exponential backoff (BEB) algorithm with a cross-layer tree algorithm (TA) that relies on successive interference cancellation (SIC) with first success (FS). BEB and SICTA/FS complement each other nicely in enabling the novel protocol to attain a maximum stable throughput (MST) as high as 0.6 without packet loss. Although BEB-SICTA/FS avoids the deadlock problem caused by the error propagation commonly present in successive interference cancellation (SIC) algorithms, it may still suffer from deadlock effects induced by the "level skipping" caused by harsh wireless fading effects. We further develop a novel BEB-SICTAXI protocol, which is a modified version of BEB-SICTA/FS. Analysis and simulations demonstrate that this simple modification leads to high-throughput random access while completely avoiding deadlock problems.

关键词： random access successive interference cancellation tree algorithm binary exponential backoff

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：