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

tree-algorithms With Multi-Packet Reception and Successive Interference Cancellation

IEEE TRANSACTIONS ON COMMUNICATIONS 2023年第11期71卷 6287-6300页

作者： Stefanovic, Cedomir Deshpande, Yash Gursu, H. Murat Kellerer, Wolfgang Aalborg Univ Dept Elect Syst DK-9220 Aalborg Denmark Tech Univ Munich Chair Commun Networks D-80333 Munich Germany Nokia Stand D-81541 Munich Germany

In this paper, we study binary tree-algorithms that exploit a combination of multi-packet reception (MPR) and successive interference cancellation (SIC), which so far has not been considered in the literature. Specifically, we assume that the receiver is capable of successfully decoding any collision of up to and including K concurrent packet transmissions and can perform SIC along the tree. We show a number of novel results for this type of tree algorithms. We first derive the basic performance parameters, which are the expected length of the collision resolution interval and the throughput normalized with K, conditioned on the number of contending users. We then analyze their asymptotic behaviour, identifying an oscillatory component that amplifies as K increases. In the next step, we derive the maximum stable throughput (MST) for the gated and windowed access assuming Poisson arrivals. We show that for windowed access, the bound on MST normalized with K increases with K. Finally, we discuss practical issues related to implementation of such scheme, as well as compare it to slotted ALOHA-based schemes that exploit both K-MPR and SIC.

关键词： Random-access protocols tree algorithms multi-packet reception (MPR) successive interference cancellation (SIC) massive IoT communications

来源：评论

学校读者我要写书评

暂无评论

An Efficient Load Balancing Method for tree algorithms 13

An Efficient Load Balancing Method for Tree Algorithms

引用

13th IEEE Int Conf on Ubiquitous Intelligence and Comp/13th IEEE Int Conf on Adv and Trusted Comp/16th IEEE Int Conf on Scalable Comp and Commun/IEEE Int Conf on Cloud and Big Data Comp/IEEE Int Conf on Internet of People/IEEE Smart World Congress

作者： Ibrahim, Osama Talaat El-Mahdy, Ahmed Egypt Japan Univ Sci & Technol Comp Sci & Engn Dept Alexandria Egypt

ISBN: (纸本)9781509027712

Nowadays, multiprocessing is mainstream with exponentially increasing number of processors. Load balancing is, therefore, a critical operation for the efficient execution of parallel algorithms. In this paper we consider the fundamental class of tree-based algorithms that are notoriously irregular, and hard to load-balance with existing static techniques. We propose a hybrid load balancing method using the utility of statistical random sampling in estimating the tree depth and node count distributions to uniformly partition an input tree. To conduct an initial performance study, we implemented the method on an Intel Xeon Phi accelerator system. We considered the tree traversal operation on both regular and irregular unbalanced trees manifested by Fibonacci and unbalanced (biased) randomly generated trees, respectively. The results show scalable performance for up to the 60 physical processors of the accelerator, as well as an extrapolated 128 processors case.

关键词： Load balancing Parallel Processing Statistical Random Sampling tree algorithms

来源：评论

学校读者我要写书评

暂无评论

Search for an Immobile Hider on a Binary tree with Unreliable Locational Information

引用

OPERATIONS RESEARCH 2025年第2期73卷 iii-viii, 583-1150, C2-C3页

作者： Alpern, Steve Lidbetter, Thomas Univ Warwick Warwick Business Sch Coventry CV4 7AL England Rutgers Business Sch Dept Management Sci & Informat Syst Newark NJ 07102 USA

Adversarial search of a network for an immobile Hider (or target) was introduced and solved for rooted trees by Shmuel Gal in 1979. In this zero-sum game, a Hider picks a point to hide on the tree and a Searcher picks a unit speed trajectory starting at the root. The payoff (to the Hider) is the search time. In Gal's model (and many subsequent investigations), the Searcher receives no additional information after the Hider chooses his location. In reality, the Searcher will often receive such locational information. For homeland security, mobile sensors on vehicles have been used to locate radioactive material stashed in an urban environment. In a military setting, mobile sensors can detect chemical signatures from land mines. In predator-prey search, the predator often has specially attuned senses (hearing for wolves, vision for eagles, smell for dogs, sonar for bats, pressure sensors for sharks) that may help it locate the prey. How can such noisy locational information be used by the Searcher to modify her route? We model such information as signals which indicate which of two branches of a binary tree should be searched first, where all signals have a known accuracy p < 1. Our solution calculates which branch (at every branch node) is favored, meaning it should always be searched first when the signal is in that direction. When the signal is in the other direction, we calculate the probability the signal should be followed. Compared with the optimal Hider strategy in the classic search game of Gal, the Hider's optimal distribution for this model is more skewed toward leaf nodes that are further from the root.

关键词： games/group decisions search/surveillance tree algorithms networks/graphs

来源：评论

学校读者我要写书评

暂无评论

Refinable modeling for unbinned SMEFT analyses

引用

MACHINE LEARNING-SCIENCE AND TECHNOLOGY 2025年第1期6卷

作者： Schoefbeck, Robert Austrian Acad Sci Inst High Energy Phys Dominikanerbastei 16 A-1010 Vienna Austria Tech Univ Wien Karlspl 13 A-1040 Vienna Austria

We present methods to estimate systematic uncertainties in unbinned large hadron collider (LHC) data analyses, focusing on constraining Wilson coefficients in the standard model effective field theory (SMEFT). Our approach also applies to broader parametric models of non-resonant phenomena beyond the standard model. By using machine-learned surrogates of the likelihood ratio, we extend well-established procedures from binned Poisson counting experiments to the unbinned case. This framework handles various theoretical, modeling, and experimental uncertainties, laying the foundation for future unbinned analyses at the LHC. We also introduce a tree-boosting algorithm that learns precise parametrizations of systematic effects, providing a robust, flexible alternative to neural networks for modeling systematics. We demonstrate this approach with an SMEFT analysis of highly energetic top quark pair production in proton-proton collisions.

关键词： systematic uncertainties effective field theory tree algorithms boosting

来源：评论

学校读者我要写书评

暂无评论

Optimizing the impact toughness of PLA materials using machine learning algorithms

引用

MATERIALS TODAY COMMUNICATIONS 2025年 44卷

作者： Chen, Yizhuo Zou, Wei Wang, Guanghong Zhang, Chongtian Zhang, Chenglong Jiangsu Normal Univ JSNU SPBPU Inst Engn Russian Inst 101 Shanghai Rd Xuzhou 221116 Jiangsu Peoples R China Jiangsu Normal Univ Sino Russian Inst 101 Shanghai Rd Xuzhou 221116 Jiangsu Peoples R China Jiangsu Normal Univ Sch Mechatron Engn 101 Shanghai Rd Xuzhou 221116 Jiangsu Peoples R China Harbin Inst Technol Weihai Dept Mech Engn Weihai 264209 Peoples R China

This study investigates the influence of various printing parameters on the impact toughness of PLA products, utilizing small sample data and machine learning algorithms to expedite the identification of optimal toughness. We propose a 3D printing tree algorithm model that focuses on the temporal distribution of impact toughness. The relationships between printing parameters and impact toughness are explored and predicted using three algorithms: Random Forest(RF),Light Gradient Boosting Machine(LightGBM) and Adaptive Boosting(AdaBoost). Experimental results indicate that the LightGBM algorithm yields the highest predictive accuracy, with the optimal parameter combination being a layer height of 0.3 mm, an infill density of 100 %, a printing speed of 60 mm/s, and a nozzle temperature of 200-210 degrees C.

关键词： FDM Polylactic acid (PLA) Impact toughness tree algorithms 3D printing parameters Prediction

来源：评论

学校读者我要写书评

暂无评论

A branching process approach to compute the delay and energy efficiency of tree algorithms with free access

引用

COMPUTER NETWORKS 2014年第0期58卷 13-28页

作者： Block, R. Peeters, G. T. Van Houdt, B. Univ Antwerp iMinds Dept Math & Comp Sci B-2020 Antwerp Belgium

This paper presents a branching process approach to determine the main performance measures of a variety of conflict resolution algorithms known as tree algorithms with free access. In particular we present an efficient approach to calculate the mean delay, number of transmission attempts, collision resolution interval length and energy usage with arbitrary precision. (C) 2013 Elsevier B.V. All rights reserved.

关键词： Conflict resolution tree algorithms Delay Energy usage Branching process

来源：评论

学校读者我要写书评

暂无评论

Projection-tree reduced-order modeling for fast N-body computations

引用

JOURNAL OF COMPUTATIONAL PHYSICS 2022年 459卷 111141-111141页

作者： Rodriguez, Steven N. Iliopoulos, Athanasios P. Carlberg, Kevin T. Brunton, Steven L. Steuben, John C. Michopoulos, John G. US Naval Res Lab Computat Multiphys Syst Lab Washington DC 20375 USA Univ Washington Dept Mech Engn Seattle WA 98195 USA

This work presents a data-driven reduced-order modeling framework to accelerate the computations of nonlocal and N-body methods that model dynamical systems. The proposed framework differs from traditional acceleration methods, like the Barnes-Hut method, which requires online tree building of the state space, or the fast-multipole method, which requires rigorous a priori analysis of governing kernels and online tree building. Our approach combines Barnes-Hut hierarchical decomposition, projection based reduced-order modeling via the least-squares Petrov-Galerkin (LSPG) projection, and hyper-reduction by way of the Gauss-Newton with approximated tensor (GNAT) approach. The resulting projection-tree reduced-order model (PTROM) enables a drastic reduction in operational count complexity by constructing sparse hyper-reduced pairwise interactions of the non-compact N-body dynamical system. As a result, the presented framework is capable of achieving an operational count complexity that is independent of N, the number of bodies in the numerical domain. Capabilities of the PTROM method are demonstrated on the two-dimensional fluid-dynamic Biot-Savart kernel within a parametric and reproductive setting. Results show the PTROM is capable of achieving over 2000x wall-time speed-up with respect to the full-order model, where the speedup increases with N. The resulting solution delivers quantities of interest with errors that are less than 0.1% with respect to full-order model.

关键词： Reduced-order modeling LSPG GNAT tree algorithms Barnes-Hut Hyper-reduction

来源：评论

学校读者我要写书评

暂无评论

Logical rules characterization of online consumer trust

引用

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH 2021年第3期28卷 1393-1416页

作者： Andrade, Ana A. Cardoso, Margarida G. M. S. Lopes, Vitor V. Directorate Gen Energy & Geol DGEG Res Studies & Renewables Div Lisbon Portugal Inst Univ Lisboa ISCTE IUL Business Res Unit BRU IUL Lisbon Portugal Univ Lisbon CMAF CIO Fac Ciencias Lisbon Portugal

In this study, we address the discriminant factors of website trust. We specifically build sets of propositional rules that can be used to predict the level of trustworthiness of a site. Focusing on initial trust, a survey was designed to assess site characteristics observed by the respondent and his/her perceptions around appearance, reputation, fulfillment, and security. By exploring data, we look for the most favorable rules classifiers among decision trees as well as classical and dominance-based rough sets. A heuristic aiming to derive simpler classifiers is also proposed. The experimental setup considers diverse groups of attributes (predictors) for the extraction of rules. Results obtained are compared by taking into account predictive ability and parsimony of rules' sets. Finally, the selected sets help bring light on how consumers process site information and suggest specific recommendations for e-commerce vendors.

关键词： trust e‐ commerce B2C information theory rough sets tree algorithms knowledge‐ based systems

来源：评论

学校读者我要写书评

暂无评论

Towards Optimal Deterministic LOCAL algorithms on trees 25

Towards Optimal Deterministic LOCAL Algorithms on Trees

引用

Proceedings of the ACM Symposium on Principles of Distributed Computing

作者： Sebastian Brandt Ananth Narayanan CISPA Helmholtz Center for Information Security Saarbrücken Germany

ISBN: (纸本)9798400718854

While obtaining optimal algorithms for the most important problems in the LOCAL model has been one of the central goals in the area of distributed algorithms since its infancy, tight complexity bounds are elusive for many problems even when considering deterministic complexities on trees. We take a step towards remedying this issue by providing a way to relate the complexity of a problem Π on trees to its truly local complexity, which is the (asymptotically) smallest function f such that Π can be solved in O(f(Δ) + log* n) rounds. More specifically, we develop a transformation that takes an algorithm A for Π with a runtime of O(f(Δ) + log* n) rounds as input and transforms it into an O(f(g(n)) +log* n)-round algorithm A′ on trees, where g is the function that satisfies g(n)f(g(n)) = n. If f is the truly local complexity of Π (i.e., if A is asymptotically optimal), then A′ is an asymptotically optimal algorithm on trees, conditioned on a natural assumption on the nature of the worst-case instances of Π.Our transformation works for any member of a wide class of problems, including the most important symmetry-breaking problems. As an example of our transformation we obtain the first strongly sublogarithmic algorithm for (edge-degree + 1)-edge coloring (and therefore also (2Δ - 1)-edge coloring) on trees, exhibiting a runtime of O(log12/13 n) rounds. This breaks through the Ω(log n/log log n)-barrier that is a fundamental lower bound for other symmetry-breaking problems such as maximal independent set or maximal matching (that already holds on trees), and proves a separation between these problems and the aforementioned edge coloring problems on *** extend a subset of our results to graphs of bounded arboricity, obtaining, for instance, the aforementioned upper bound for edge colorings also on planar graphs.

关键词： tree algorithms

来源：评论

学校读者我要写书评

暂无评论

Spot Welding Parameter Tuning for Weld Defect Prevention in Automotive Production Lines: An ML-Based Approach

引用

INFORMATION 2023年第1期14卷 50-50页

作者： Bayir, Musa Yucel, Ertugrul Kaya, Tolga Yildirim, Nihan Istanbul Tech Univ Management Fac TR-36626 Istanbul Turkiye

Spot welding is a critical joining process which presents specific challenges in early defect detection, has high rework costs, and consumes excessive amounts of materials, hindering effective, sustainable production. Especially in automotive manufacturing, the welding source's quality needs to be controlled to increase the efficiency and sustainable performance of the production lines. Using data analytics, manufacturing companies can control and predict the welding parameters causing problems related to resource quality and process performance. In this study, we aimed to define the root cause of welding defects and solve the welding input value range problem using machine learning algorithms. In an automotive production line application, we analyzed real-time IoT data and created variables regarding the best working range of welding input parameters required in the inference analysis for expulsion reduction. The results will help to provide guidelines and parameter selection approaches to model ML-based solutions for the optimization problems associated with welding.

关键词： spot welding machine learning tree algorithms expulsion reduction welding parameters

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：