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

COMPUTER NETWORKS AND ISDN SYSTEMS 1989年第3期17卷 201-221页

作者： OIE, Y NISHIO, S HASEGAWA, T OSAKA UNIV FAC ENGN SCIDEPT INFORMAT & COMP SCITOYONAKAOSAKA 560JAPAN KYOTO UNIV FAC ENGNDEPT APPL MATH & PHYSKYOTO 606JAPAN SASEBO COLL TECHNOL DEPT ELECT ENGNSASEBO 85711JAPAN

The tree-based collision resolution algorithms have been extensively studied because of their stable behavior. Some of these studies have employed control mini-slots in order to improve the performance of tree-based algorithms. This paper analyzes the maximum stable throughput of two Q -ary blocked access tree algorithms with mini-slots: one (TA/M-BF) assumes that something/nothing binary feedback information is available in a mini-slot, and the other (TA/M-TF) assumes ternary feedback information in a mini-slot. Both algorithms allow all users having new packets to transmit them in the slot immediately after the previously collided packets are resolved (i.e., blocked access algorithms). The stability of these algorithms is affected by two critical values of the throughpuut; the lower critical value is called the maximum stable throughput. We offer a way to derived those values exactly. The effect of mini-slot length on the maximum stable throughput is also evaluated. Furthermore, the performance of the above two algorithms is compared on the basis of numerical results drawn from our analysis.

关键词： Random Access Collision Resolution algorithm tree algorithm Stability Maximum Throughput Mini-slots

来源：评论

学校读者我要写书评

暂无评论

Collision-Slots Skipping Based Binary tree Anti-Collision algorithm for RFID 17

Collision-Slots Skipping Based Binary Tree Anti-Collision Al...

引用

17th IEEE Student Conference on Research and Development (SCOReD)

作者： Annur, Robithoh Jalil, Norazira A. Nakpeerayuth, Suvit Wuttisittikulkij, Lunchakorn Univ Tunku Abdul Rahman Fac Informat & Commun Technol Kampar Malaysia Chulalongkorn Univ Dept Elect Engn Bangkok Thailand

ISBN: (纸本)9781728126135

Collision is a crucial issue to be addressed for an efficient identification process in radio frequency identification (RFID) systems. This paper presents an efficient collision arbitration algorithm based on binary tree algorithm to improve the performance of the RFID system. In the proposed algorithm, collision-slots skipping is applied. For a collision, binary splitting is firstly applied until the leftmost node of the binary tree contains idle or a success. From the outcome from the left-hand side node, we can expect the number of tags in the right-hand nodes. If the left-hand node is a collided slot, the binary tree will skip the right-hand node as it is expected as a collision node. The simulation results show that the proposed improved binary tree algorithm outperforms the existing algorithms.

关键词： RFID tree algorithm collision slot-skipping

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A Faster algorithm for Constructing the Frequency Difference Consensus tree 41

A Faster Algorithm for Constructing the Frequency Difference...

引用

41st International Symposium on Theoretical Aspects of Computer Science (STACS)

作者： Jansson, Jesper Sung, Wing-Kin Tabatabaee, Seyed Ali Yang, Yutong Kyoto Univ Kyoto Japan Chinese Univ Hong Kong Hong Kong Peoples R China Hong Kong Genome Inst Hong Kong Sci Pk Hong Kong Peoples R China Univ British Columbia Dept Comp Sci Vancouver BC Canada

ISBN: (纸本)9783959773119

A consensus tree is a phylogenetic tree that summarizes the evolutionary relationships inferred from a collection of phylogenetic trees with the same set of leaf labels. Among the many types of consensus trees that have been proposed in the last 50 years, the frequency difference consensus tree is one of the more finely resolved types that retains a large amount of information. This paper presents a new deterministic algorithm for constructing the frequency difference consensus tree. Given k phylogenetic trees with identical sets of n leaf labels, it runs in O( kn log n) time, improving the best previously known solution.

关键词： phylogenetic tree frequency difference consensus tree tree algorithm centroid path decomposition max-Manhattan Skyline Problem

来源：评论

学校读者我要写书评

暂无评论

A tree-based link protection algorithm

A tree-based link protection algorithm

引用

15th IEEE Canadian Conference on Electrical and Computer Engineering

作者： Liu, HM Yang, O Shah-Heydari, S Univ Ottawa SITE CCNR Lab Ottawa ON K1N 6N5 Canada

ISBN: (纸本)0780377818

High-speed network needs efficient protection scheme. This paper studies the tree-based link protection and restoration method in optical mesh network. Two logical trees can be overlain on a physical network for protection of the physical links and nodes. The non-tree links are protected by either of the trees, while the tree links can be protected by one or both trees. A new algorithm is presented here on how to build two trees on a physical network. These two trees can share the same edge if their directions are different, thus reducing the overall restoration capacity, and minimizing the network total cost. Performance analysis of the algorithm executed in some existing network is presented We can show that with this scheme the time complexity will reduce compared with the two-stage P-cycle optimization method. Also, in the best case, this scheme can get the optimization restorability result.

关键词： network protection trees survivable network tree algorithm

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Light and normal weight concretes shear strength estimation using tree-based tunned frameworks

引用

CONSTRUCTION AND BUILDING MATERIALS 2024年 452卷

作者： Kou, Honggang Quan, Juanjuan Guo, Shaoqiang Hassankhani, Ebrahim Xijing Univ Civil Engn Coll Xian 710000 Shaanxi Peoples R China Shaanxi Key Lab Safety & Durabil Concrete Struct Xian 710000 Shaanxi Peoples R China Univ Tabriz Fac Geotech Engn Dept Civil Engn Tabriz *** Iran

Concrete component shear strength is a complex phenomenon that depends on a number of governing bodies and regulatory mechanisms. Moreover, the addition of new concrete variations like fibered concrete and light-weight concrete increases the complexity of the topic. Consequently, in order to estimate the shear resistance (Vu) of normal-weight concrete (NWC) and light-weight concrete (LWC) components, three machine learning-based methods were developed. The work gives researchers significant tools to predict concrete structural integrity. This helps design safer, more efficient buildings by accounting for complicated material qualities and concrete variants like fibered or lightweight concrete in real-world construction settings. Extreme gradient boosting (XGB) was taken into consideration for this aim. The Chaos Game Optimization (CGO), Giant Trevally Optimizer (GTO), and Mountain Gazelle Optimizer (MGO) algorithms were used in order to identify the hyperparameters effectively (abbreviated as XGBMGO, XGBGTO, and XGBCGO). The collected big data was divided into three subsets: training (75%: 1194), validating (15%: 256), and testing (15 %: 256). The XGBGTO, XGBMGO and XGBCGO algorithms have a considerable capacity to precisely forecast the Vuof NWC and LWC. The R2 values for the XGBCGO net were determined to be 0.9959, 0.9957, and 0.9961, respectively, throughout the training, verification, and testing phases. The reasons put forward generally suggest that the XGBCGO analysis can achieve more than the XGBGTO, and XGBMGO frameworks.

关键词： Light and Normal Weight Concrete Shear Strength tree algorithm Tunning

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Acceleration of fast multipole method using special-purpose computer GRAPE

引用

INTERNATIONAL JOURNAL OF HIGH PERFORMANCE COMPUTING APPLICATIONS 2008年第2期22卷 194-205页

作者： Chau, Nguyen Hai Kawai, Atsushi Ebisuzaki, Toshikazu Vietnam Natl Univ Coll Technol Hanoi Vietnam K&F Comp Res Co Tokyo 1820026 Japan RIKEN Computat Astrophys Lab Wako Saitama 3510198 Japan

We have implemented the fast multipole method (FMM) on a special-purpose computer GRAPE (GRAvity piPE). The FMM is one of the fastest approximate algorithms to calculate forces among particles. Its calculation cost scales as O(N), while the naive algorithm scales as O(N-2). Here, N is the number of particles in the system. GRAPE is hardware dedicated to the calculation of Coulombic or gravitational forces among particles. GRAPE's calculation speed is 100-1000 times faster than that of conventional computers of the same price, though it cannot handle anything but force calculation. We can expect significant speedup by the combination of the fast algorithm and the fast hardware. However, a straightforward implementation of the algorithm actually runs on GRAPE at rather modest speed. This is because of the limited functionality of the hardware. Since GRAPE can handle particle forces only, just a small fraction of the overall calculation procedure can be put on it. The remaining part must be performed on a conventional computer connected to GRAPE. In order to take full advantage of the dedicated hardware, we modified the FMM using the pseudoparticle multipole method and Anderson's method. In the modified algorithm, multipole and local expansions are expressed by distribution of a small number of imaginary particles (pseudoparticles), and thus they can be evaluated by GRAPE. Results of numerical experiments on ordinary GRAPE systems show that, for large-N systems (N >= 10(5)), GRAPE accelerates the FMM by a factor ranging from 3 for low accuracy (RMS relative force error similar to 10(-2)) to 60 for high accuracy (RMS relative force error similar to 10(-5)). Performance of the FMM on GRAPE exceeds that of Barnes-Hut treecode on GRAPE at high accuracy, in case of close-to-uniform distribution of particles. However, in the same experimental environment the treecode outperforms the FMM for inhomogeneous distribution of particles.

关键词： molecular dynamics numerical simulation fast multipole method tree algorithm Anderson's method pseudoparticle multipole method special-purpose computer

来源：评论

学校读者我要写书评

暂无评论

Modeling tangential vector fields on regular surfaces by means of mie potentials

引用

INTERNATIONAL JOURNAL OF WAVELETS MULTIRESOLUTION AND INFORMATION PROCESSING 2007年第3期5卷 417-449页

作者： Freeden, Willi Mayer, Carsten Univ Kaiserslautern Geomath Grp D-67653 Kaiserslautern Germany

By means of the limit and jump relations of classical potential theory with respect to the vectorial Helmholtz equation, a wavelet approach is established on a regular surface. The multiscale procedure is constructed in such a way that the emerging scalar, vectorial and tensorial potential kernels act as scaling functions. Corresponding wavelets are defined via a canonical refinement equation. A tree algorithm for fast decomposition of a tangential complex-valued vector field given on a regular surface is developed based on numerical integration rules. Some numerical test examples conclude the paper.

关键词： regular surface potential operators limit and jump relations scaling functions and wavelets tree algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：