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

On the performance of the free-access tree algorithm with MPR, SIC, and single-slot memory

AD HOC NETWORKS 2024年 156卷

作者： Stefanovic, Cedomir Beko, Marko Vukobratovic, Dejan Aalborg Univ Dept Elect Syst Frederikskaj 12 DK-2450 Copenhagen Denmark Univ Lisbon Inst Telecomunicacoes Inst Super Tecn P-1049 Lisbon Portugal Univ Lusofona COPELABS P-1749 Lisbon Portugal Univ Novi Sad Trg Dositeja Obradov Novi Sad 21000 Serbia

In this paper, we investigate performance of a random access scheme that exploits binary-tree algorithm (BTA) with the free access. We assume a scenario where the receiver is capable to perform both multi-packet reception (MPR) and successive interference cancellation (SIC), where for the purpose of the latter only the last received and undecoded signal can be stored. We distinguish between two variants of the algorithm, where in the first the SIC can be triggered by a decoding event but also executed blindly among yet undecoded slots, while in the second the receiver can only execute the SIC after the decoding event. We analytically derive the maximum stable throughput (MST) of the scheme assuming Poisson arrivals. The evaluation shows that the scheme is able of achieving a favorable performance in comparison to the scenarios when only either MPR or SIC with single-slot memory is used, making it a suitable candidate for an access solution in applications that are characterized with a massive number of users and sporadic traffic arrivals. We also compare the performance of the scheme with the best performing BTA scheme that also exploits K-MPR and SIC and does not have memory limitations, showing that the relative difference in the MST's of the two schemes diminishes with K.

关键词： Random access tree algorithm Maximum stable throughput Successive interference cancellation Multi-packet reception

来源：评论

学校读者我要写书评

暂无评论

A Fast tree algorithm for Electric Field Calculation in Electrical Discharge Simulations

引用

IEEE TRANSACTIONS ON MAGNETICS 2018年第3期54卷 1-4页

作者： Zhuang, Chijie Zhang, Yong Zhou, Xin Zeng, Rong He, Jinliang Liu, Lei Tsinghua Univ Dept Elect Engn Beijing 100084 Peoples R China NYU Courant Inst Math Sci New York NY 10011 USA China Southern Grid Elect Power Res Inst Guangzhou 510663 Guangdong Peoples R China

The simulation of electrical discharges has been attracting a great deal of attention. In such simulations, the electric field computation dominates the computational time. In this paper, we propose a fast tree algorithm that helps to reduce the time complexity from O(N-2) (from using direct summation) to O(N log N). The implementation details are discussed and the time complexity is analyzed. A rigorous error estimation shows the error of the tree algorithm decays exponentially with the number of truncation terms and can be controlled adaptively. Numerical examples are presented to validate the accuracy and efficiency of the algorithm.

关键词： Disc model electric field electrical discharge error estimation tree algorithm

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Enhancing the Performance of tree algorithm using Re-split Mechanism 12

Enhancing the Performance of Tree Algorithm using Re-split M...

引用

IEEE 12th International Symposium on Autonomous Decentralized Systems (ISADS)

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

ISBN: (纸本)9781479982615

In shared wireless communication channel, the collision occurs when multiple users transmit the packet simultaneously. tree algorithm has been proposed to resolve the collision. However, tree algorithm may suffer from high delay when the number of users gets large due to the collisions cause by too many users attempting to access the limited slots. To enhance the system delay of the tree algorithm, in this paper we introduce a Re-split mechanism that can be utilized in conjunction with the tree algorithm. As can be seen from the results that under heavy loads, the proposed mechanism offers better performance compared to the existing tree algorithm in terms of average delay, which signifies that the Re-split mechanism can be used to enhance the efficiency of the tree algorithm.

关键词： tree algorithm Re-Split Delay performance

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Locating disparities in machine learning

Locating disparities in machine learning

引用

2023 IEEE International Conference on Big Data, BigData 2023

作者： Zahn, Moritz Von Hinz, Oliver Feuerriegel, Stefan Goethe University Frankfurt Faculty of Economics and Business Frankfurt am Main Germany Munich Center for Machine Learning Lmu Munich Munich Germany

ISBN: (纸本)9798350324457

Machine learning can provide predictions with disparate outcomes, in which subgroups of the population (e.g., defined by age, gender, or other sensitive attributes) are systematically disadvantaged. In order to comply with upcoming legislation, practitioners need to locate such disparate outcomes. However, previous literature typically detects disparities through statistical procedures for when the sensitive attribute is specified a priori. This limits applicability in real-world settings where datasets are high dimensional and, on top of that, sensitive attributes may be unknown. As a remedy, we propose a data-driven framework called Automatic Location of Disparities (ALD) which aims at locating disparities in machine learning. ALD meets several demands from industry: ALD (1) is applicable to arbitrary machine learning classifiers;(2) operates on different definitions of disparities (e.g., statistical parity or equalized odds);(3) deals with both categorical and continuous predictors even if disparities arise from complex and multi-way interactions known as intersectionality (e.g., age above 60 and female). ALD produces interpretable audit reports as output. We demonstrate the effectiveness of ALD based on both synthetic and real-world datasets. As a result, we empower practitioners to effectively locate and mitigate disparities in machine learning algorithms, conduct algorithmic audits, and protect individuals from discrimination. © 2023 IEEE.

关键词： algorithmic bias algorithmic fairness machine learning recursive partitioning tree algorithm

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Data-driven approach for investigating and predicting rutting depth of asphalt concrete containing reclaimed asphalt pavement

引用

CONSTRUCTION AND BUILDING MATERIALS 2023年第1期377卷

作者： Nguyen, Hoang Long Tran, Van Quan Univ Transport Technol 54 Trieu Khuc St Hanoi Vietnam

The aim of this paper is to investigate and predict the rutting depth of asphalt concrete containing Reclaimed Asphalt Pavement (RAP) content by the data-driven approach with aid of 6 six tree algorithm including Random Forest (RF), Gradient Boosting (GB), Adaptive Boosting (AdaB), Extreme Gradient Boosting (XGB), Light Gradient Boosting (LightGB) and Categorial Gradient Boosting (CatB) using default hyperparameters. A database containing 396 data samples derived from Hamburg Wheel Tracking Test (HWTT) and consisting of 11 input variables such as Corrected Optimum Asphalt Content (COAC), Reclaimed Asphalt Pavement, Nominal Maximum Aggregate Size (NMAS), Flashpoint, m-Value, Mass loss, Specific gravity, Viscosity, Creep stiffness, Temperature, and Number of wheels and 1 output Rutting depth are created. 10 times of 10-Fold CV and four metrics such as R2, RMSE, MAE and MAPE are used to verify the robustness of ML models. XGB model has highest performance with the mean value of R2, RMSE, MAE and MAPE to be equal to 0.9792, 1.0767 mm, 0.7085 mm, 0.1034% respectively. Comparing with other factors like the number of load cycles (number of wheels) and mix design considerations, temperature has a dominant impact on the rutting depth of asphalt pavement (type of binder, NMAS, RAP content). The rutting depth value rises with increasing temperature and COAC. NMAS has a negligible impact on asphalt pavement's resistance to rutting. To increase the rutting resistance when building the asphalt pavement, the chosen asphalt binder has high Viscosity and Flashpoint values. The local interpretation clearly demonstrates each factor's contribution to the rutting depth value in each unique scenario. Engineers can design the rutting resistance of asphalt pavement in advance thanks to the mapping produced by the Partial Dependence Plot 2D under grid contour.

关键词： Reclaimed asphalt pavement Rutting depth Machine learning Prediction Hamburg wheel tracking test tree algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：