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

Fifth International Conference on Instrumentation & Measurement, Computer, Communication, and Control (IMCCC)

作者： Fan Jian-Ying Wang Xiao-Dong Wang Yang Fu Yao Harbin Univ Sci & Technol Higher Educ Key Lab Measuring & Control Technol & Inst Measurement Control Technol & Commun Engn Harbin Peoples R China

ISBN: (纸本)9781467377232

In order to realize the energy balance of ZigBee, prolonging the survival time of the network, avoiding the paralysis of the network, this paper improves the tree algorithm. This paper firstly introduces ZigBee and the results of some routing algorithms, and then analyzing and comparing the original tree algorithm and AODVjr algorithm, finding out the inadequacies. The original tree algorithm is improved by routing table, eliminating invalid neighbor nodes and balancing energy. Experiment results of simulation show that: Sending 1000 packets, the improved algorithm is 750 hops less than the original algorithm, and high load nodes 5 less than the original. Therefore, the improved algorithm is effective, it saves the number of hops, that is to save energy.

关键词： ZigBee energy balance tree algorithm neighbor node

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A linear algorithm for the neighbor-component order connectivity of arbitrary trees

引用

DISCRETE MATHEMATICS algorithmS AND APPLICATIONS 2022年第1期16卷

作者： Luttrell, Kristi Seton Hall Univ Math Dept 400 South Orange Ave S Orange NJ 07926 USA

The graph parameter neighbor-connectivity was first investigated by Gunther and Hartnell in 1987 and provides important information on how reliable a network can be when failures of a node may impact its neighbors. In this model, the failure of a node causes the deletion of its closed neighborhood, i.e., the node and its adjacent neighbors as well. The minimum number of closed neighborhoods whose removal results in an empty, complete, or disconnected subgraph is called the neighbor-connectivity of the graph. Since then component order connectivity models have emerged to address inadequacies in the traditional models of connectivity, namely, that in many real-world networks, when disconnecting a graph one may be left with components that are large enough to still be operable. By adapting neighbor-connectivity to a component order model, we introduced neighbor-component order connectivity, defined as the minimum number of closed neighborhoods that must be removed from a network to ensure all remaining components have order less than some given threshold value. Given a threshold value of one, the neighbor-component order connectivity of a graph is equivalent to the well-known parameter domination number of the graph. The problem of computing the domination number of an arbitrary graph is NP-hard, and computing neighbor-component order connectivity of a graph for an arbitrary threshold value is also NP-hard. Here, we present a linear-time algorithm for computing the neighbor-component order connectivity of an arbitrary tree for an arbitrary threshold value, thus generalizing the classic linear algorithm of Cockayne, Goodman, and Hedetniemi for the domination number of the tree.

关键词： Neighbor-component order connectivity domination component order connectivity neighbor-connectivity tree algorithm complexity

来源：评论

学校读者我要写书评

暂无评论

algorithms for the Majority Rule (+) Consensus tree and the Frequency Difference Consensus tree

引用

IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS 2018年第1期15卷 15-26页

作者： Jansson, Jesper Rajaby, Ramesh Shen, Chuanqi Sung, Wing-Kin Kyoto Univ Inst Chem Res Lab Math Bioinformat Akutsu Lab Uji Kyoto 6110011 Japan Natl Univ Singapore NUS Grad Sch Integrat Sci & Engn 28 Med Dr Singapore 117456 Singapore Stanford Univ 450 Serra Mall Stanford CA 94305 USA Natl Univ Singapore Sch Comp 13 Comp Dr Singapore 117417 Singapore Genome Inst Singapore Genome 60 Biopolis St Singapore 138672 Singapore

This article presents two new deterministic algorithms for constructing consensus trees. Given an input of k phylogenetic trees with identical leaf label sets and n leaves each, the first algorithm constructs the majority rule (+) consensus tree in O(kn) time, which is optimal since the input size is Omega(kn), and the second one constructs the frequency difference consensus tree in min {O(kn(2));O(kn(k + log(2) n))} time.

关键词： Phylogenetic tree consensus tree cluster pairwise compatibility tree algorithm

来源：评论

学校读者我要写书评

暂无评论

tree-based Anti-collision algorithm with Single Error Bit Tracking for RFID Systems 18

Tree-based Anti-collision Algorithm with Single Error Bit Tr...

引用

International Seminar on Intelligent Technology and Its Applications (ISITIA)

作者： Annur, Robithoh Jig, Tan Li Nakpeerayuth, Suvit Wuttitsittikulkij, Lunchakorn Univ Tunku Abdul Rahman Dept Comp & Commun Technol Fac Informat & Commun Technol Petaling Jaya Malaysia Chulalongkorn Univ Fac Engn Dept Elect Engn Bangkok Thailand

ISBN: (纸本)9781538627082

In this paper, we focus on the problem of collision in tags identification in RFID systems. We propose tree algorithm with single error bit tracking that utilizes Manchester coding to know the position of collision bit among the ID of the tags. The reader broadcasts the Query bit that is updated in every collision. The update is done according to the position of the collision bit that allows to reduce the idle slots. Based on the comparison results, the proposed algorithm provides improvements to the existing tree algorithms.

关键词： anti-collision tag identification RFID tree algorithm Manchester code

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A fast tag identification anti-collision algorithm for RFID systems

引用

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS 2019年第15期32卷 e4108-e4108页

作者： Wijayasekara, Sanika Krishnamali Nakpeerayuth, Suvit Annur, Robithoh Hsieh, Hung-Yun Sanguankotchakorn, Teerapat Sandrasegaran, Kumbesan Srichavengsup, Warakorn Phromsa-ard, Tharathorn Wuttisittikulkij, Lunchakorn Chulalongkom Univ Dept Elect Engn Smart Wireless Commun Ecosyst Res Grp Bangkok Thailand Univ Tunku Abdul Rahman Dept Comp & Commun Technol Perak Campus Kampar Malaysia Natl Taiwan Univ Dept Elect Engn Taipei Taiwan Natl Taiwan Univ Grad Inst Commun Engn Taipei Taiwan Asian Inst Technol Sch Engn & Technol Bangkok Thailand Univ Technol Sydney Elect & Data Engn Sydney NSW Australia Thai Nichi Inst Technol Comp Engn Robot & Technol Res Lab Bangkok Thailand

In this work, we propose a highly efficient binary tree-based anti-collision algorithm for radio frequency identification (RFID) tag identification. The proposed binary splitting modified dynamic tree (BS-MDT) algorithm employs a binary splitting tree to achieve accurate tag estimation and a modified dynamic tree algorithm for rapid tag identification. We mathematically evaluate the performance of the BS-MDT algorithm in terms of the system efficiency and the time system efficiency based on the ISO/IEC 18000-6 Type B standard. The derived mathematical model is validated using computer simulations. Numerical results show that the proposed BS-MDT algorithm can provide the system efficiency of 46% and time system efficiency of 74%, outperforming all other well-performed algorithms.

关键词： ALOHA anti-collision reader RFID tag 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

来源：评论

学校读者我要写书评

暂无评论

Plant Breeding Evaluation with Rank Entropy-based Decision tree

引用

IFAC-PapersOnLine 2016年第16期49卷 336-340页

作者： Zhao, Xiangyu Liu, Zhongqiang Dan, Fang Wang, Kaiyi Beijing Research Center for Information Technology in Agriculture Beijing China National Engineering Research Center for Information Technology in Agriculture Beijing China Key Laboratory of Agri-informatics Ministry of Agriculture Beijing China Beijing Engineering Research Center of Agricultural Internet of Things Beijing China

With the rapid development of breeding equipments, large scale breeding becomes possible, massive data evaluation has to be done by software automatically. In this circumstance, this paper tries to evaluate variety with the collected informative data through data mining technologies. According to the characteristics, plant breeding evaluation is considered as an ordinal classification task, and a rank entropy-based decision tree algorithm is proposed to do this classification. The algorithm uses historical trait phenotype and evaluation data to construct decision trees, which are then used to generate evaluations for future cultivars with their trait phenotype. To demonstrate the effectiveness, experiments are carried out on three groups of soybean variety comparison tests (early-maturity, medium-maturity, and green soybean). This work can free breeders from a large number of basic work while increase the efficiency of plant breeding. © 2016

关键词： Data mining Agriculture Artificial intelligence Decision support systems Decision trees Entropy trees (mathematics) Breeding Evaluation Comparison test Data mining technology Decision tree algorithm Entropy based Massive data Ordinal classification Plant breeding

来源：评论

学校读者我要写书评

暂无评论

A Practical tree algorithm with Successive Interference Cancellation for Delay Reduction in IEEE 802.16 Networks

引用

18th International Conference on Analytical and Stochastic Modelling and Applications (ASMTA)

作者： Andreev, Sergey Pustovalov, Eugeny Turlikov, Andrey Tampere Univ Technol FIN-33101 Tampere Finland SUAI St Petersburg Russia

ISBN: (纸本)9783642217135

This paper thoroughly studies a modification of tree algorithm with successive interference cancellation. In particular, we focus on the algorithm throughput and account for a single signal memory location, as well as cancellation errors of three types. The resulting scheme is robust to imperfect interference cancellation and is tailored to the up-link bandwidth request collision resolution in an IEEE 802.16 cellular network. The mean packet delay is shown to be considerably reduced when using the proposed approach.

关键词： tree algorithm successive interference cancellation throughput mean packet delay

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：