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

Machine Learning and Water Economy: a New Approach to Predicting Dams Water Sales Revenue

WATER RESOURCES MANAGEMENT 2020年第6期34卷 1893-1911页

作者： Zounemat-Kermani, Mohammad Ramezani-Charmahineh, Abdollah Razavi, Reza Alizamir, Meysam Ouarda, Taha B. M. J. Shahid Bahonar Univ Kerman Dept Water Engn Kerman Iran Shahrekord Univ Dept Water Engn Shahrekord Iran IAU Univ Dept Civil Engn Sirjan Branch Sirjan Iran Islamic Azad Univ Dept Civil Engn Hamedan Branch Hamadan Hamadan Iran INRS ETE Canada Res Chair Stat Hydroclimatol 490 Rue Coumnne Quebec City PQ G1K 9A9 Canada

The proper prediction of water sales revenue allows for pricing policies with a specified trend for the optimized use of water resources. The present work focuses on the prediction of the economic status of water sales revenue in a semi-arid environment. To meet this objective, evaporation data (E), dam input water volume (I), and dam output water volume (O) are used as independent factors to estimate water revenue (R) in the case study of Jiroft Dam, Iran. Different machine learning models are used, including classification and regression tree (CART), Chi-squared automatic interaction detector (CHAID), multi-layer perceptron neural network (MLP), and radial basis function neural network (RBF). The data are obtained daily from 20 March 2012 to 20 March 2015 and defined in six input combinations to the models using multicollinearity analyses. To compare these models, the Nash-Sutcliffe efficiency coefficient (NSEC), the root mean square error (RMSE), and the coefficient of correlation (CC) criteria are employed. All the models act better when records of water sales revenue are incorporated as additional input factors to the machine learning models. The MLP neural-based model indicates the best predicted values for daily water sales revenue (RMSE = 638.3 $ and CC = 0.798) followed by the RBF neural model (RMSE = 655.1 $ and CC = 0.786).

关键词： Water revenue planning tree algorithm Artificial neural network Jiroft Dam Data-driven model

来源：评论

学校读者我要写书评

暂无评论

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)

来源：评论

学校读者我要写书评

暂无评论

High Performance Evaluation of Helmholtz Potentials Using the Multi-Level Fast Multipole algorithm

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2022年第12期33卷 3651-3666页

作者： Lingg, Michael P. Hughey, Stephen M. Shanker, Balasubramaniam Aktulga, Hasan Metin Michigan State Univ Dept Comp Sci & Engn E Lansing MI 48824 USA Michigan State Univ Dept Elect & Comp Engn E Lansing MI 48824 USA

Evaluation of pair potentials is critical in a number of areas of physics. The classical N-body problem has its root in evaluating the Laplace potential, and has spawned tree-algorithms, the fast multipole method (FMM), as well as kernel independent approaches. Over the years, FMM for Laplace potential has had a profound impact on a number of disciplines as it has been possible to develop highly scalable parallel versions of these algorithms. This is in stark contrast to parallel algorithms for oscillatory potentials such as the Helmholtz potential. The principal bottlenecks to scalable parallelism are the computation and communication costs of operations necessary to traverse up, across, and down the tree. In this article, we analyze asymptotic costs for both computation and communication in a parallel implementation, and describe techniques to overcome bottlenecks and achieve high performance evaluation of the Helmholtz potential for different distributions of particles. We demonstrate that the resulting implementation has a load balancing effect that significantly reduces the time-to-solution and enhances the scale of problems that can be treated using full wave physics.

关键词： Helmholtz equation multilevel fast multipole method tree algorithm electromagnetic interaction global interpolation

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

The Effects of an Eco-Driving Assistance System for a City Bus on Driving Style

引用

IFAC-PapersOnLine 2018年第31期51卷 331-336页

作者： Xiong, Shuo Xie, Hui Tong, Qiang State Key Laboratory of Engines Tianjin University Tianjin China

Fuel consumption of a city bus is greatly influenced by driving style, and driving assistance systems (DAS) is a key technology to encourage driving style improvement. In the research reported here, we construct a real-time DAS for a city bus based on a decision tree algorithm. The DAS aims to reduce fuel consumption by encouraging three behaviors: reduced rates of acceleration, reduced depth of acceleration pedal and early upshifting through the gears. Using the proposed DAS, we establish a driver experiment platform with a driving simulator. Then, we design an experiment for 4 non-professional drivers with various driving experience to determine the effects of DAS on their driving style. The driving simulator experiment results show that all the drivers exhibited an observable change in acceleration pedal depth distribution, acceleration pedal positive gradient distribution, and shift timing. These findings indicated that through the real-time guidance on the manipulation of the accelerator pedal position and gear, the drivers could obey the devices from DAS to a certain extent, so the eco-driving device can help drivers change their driving style. © 2018

关键词： Acceleration control Acceleration Automobile simulators Buses Data mining Decision trees Intelligent vehicle highway systems Man machine systems trees (mathematics) Decision tree algorithm Driving assistance systems Driving simulator Driving styles Eco driving Experiment platforms Gradient distributions Professional drivers

来源：评论

学校读者我要写书评

暂无评论

ON A FUNCTIONAL-EQUATION ARISING IN THE ANALYSIS OF A PROTOCOL FOR A MULTIACCESS BROADCAST CHANNEL

引用

ADVANCES IN APPLIED PROBABILITY 1986年第2期18卷 441-472页

作者： FAYOLLE, G FLAJOLET, P HOFRI, M TECHNION ISRAEL INST TECHNOL DEPT COMP SCIIL-32000 HAIFAISRAEL

We analyse a stack protocol of the Capetanakis–Tsybakov–Mikhailov type for resolving collisions in a random multiple-access channel. We obtain a functional equation for the generating function of the expected collision resolution interval (CRI) durations, which is non-local with a non-commutative iteration semigroup. Using Mellin transform techniques and geometric properties of the iteration semigroup we show that for arrival rates smaller than a fixed threshold, the mean CRI duration for n initial colliders is asymptotically proportional to n. Ergodicity conditions are also demonstrated.

关键词： ASYMPTOTIC ANALYSIS FUNCTIONAL EQUATION MELLIN TRANSFORM PROTOCOL RANDOM ACCESS tree algorithm

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Predicting the Status of Water Pumps Using Data Mining Approach

Predicting the Status of Water Pumps Using Data Mining Appro...

引用

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

来源：评论

学校读者我要写书评

暂无评论

Explicit Hopcroft's Trick in Categorical Partition Refinement 17th

Explicit Hopcroft's Trick in Categorical Partition Refinemen...

引用

17th IFIP WG 1.3 International Workshop on Coalgebraic Methods in Computer Science (CMCS)

作者： Sanada, Takahiro Kojima, Ryota Komorida, Yuichi Muroya, Koko Hasuo, Ichiro Fukui Prefectural Univ Fukui Japan Kyoto Univ Rims Kyoto Japan Natl Inst Informat Tokyo Japan SOKENDAI Tokyo Japan

ISBN: (纸本)9783031664373;9783031664380

algorithms for partition refinement are actively studied for a variety of systems, often with the optimisation called Hopcroft's trick. However, the low-level description of those algorithms in the literature often obscures the essence of Hopcroft's trick. Our contribution is twofold. Firstly, we present a novel formulation of Hopcroft's trick in terms of general trees with weights. This clean and explicit formulation-we call it Hopcroft's inequality-is crucially used in our second contribution, namely a general partition refinement algorithm that is functorgeneric (i.e. it works for a variety of systems such as (non-)deterministic automata and Markov chains). Here we build on recent works on coalgebraic partition refinement but depart from them with the use of fibrations. In particular, our fibrational notion of R-partitioning exposes a concrete tree structure to which Hopcroft's inequality readily applies. It is notable that our fibrational framework accommodates such algorithmic analysis on the categorical level of abstraction.

关键词： Partition refinement Category theory Coalgebra Fibration tree algorithm

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of Medium Access Control using Appropriate Permission Probability algorithm 8

Performance Analysis of Medium Access Control using Appropri...

引用

International Conference on Information and Communication Technology Convergence (ICTC)

作者： Srichavengsup, Warakorn Thai Nichi Inst Technol Fac Engn Dept Comp Engn Comp Engn Robot & Technol Res Lab Bangkok Thailand

ISBN: (纸本)9781509040322

This paper presents a mathematical analysis of the delay performance of the Appropriate Permission Probability algorithm in term of average delay time. The system performance is derived as a function of the number of users. The numerical results reveal that the Appropriate Permission Probability algorithm provides superior performance compared to the Binary tree, Ternary tree and IEEE 802.11 DCF algorithms.

关键词： Appropriate Permission Probability tree algorithm IEEE 802.11 DCF algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：