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

tree algorithms in wavelet approximations by Helmholtz potential operators

NUMERICAL FUNCTIONAL ANALYSIS AND OPTIMIZATION 2003年第7-8期24卷 747-782页

作者： Freeden, W Mayer, C Schreiner, M Univ Kaiserslautern Geomath Grp D-67653 Kaiserslautern Germany Univ Appl Sci Technol Lab Ind Math Buchs Switzerland

By means of the limit and jump relations of classical potential theory with respect to the Helmholtz equation a wavelet approach is established on a regular surface. The multiscale procedure is constructed in such a way that the emerging potential kernels act as scaling functions, wavelets are defined via a canonical refinement equation. A tree algorithm for fast computation of a function discretely given on a regular surface is developed based on numerical integration rules. By virtue of the tree algorithm, an efficient numerical method for the solution of Fredholm integral equations involving boundary-value problems of the Helmholtz equation corresponding to (general) regular (boundary) surfaces is discussed in more detail.

关键词： regular surface Helmholtz layer potential operators wavelets tree algorithms integral equations

来源：评论

学校读者我要写书评

暂无评论

Interference Cancellation tree algorithms with k-Signal Memory Locations

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2010年第11期58卷 3056-3061页

作者： Peeters, G. T. van Houdt, B. Univ Antwerp IBBT B-2020 Antwerp Belgium

Recently, tree algorithms have been combined with successive interference cancellation to achieve a substantially higher maximum stable throughput (MST). All previous work assumed either a single or an unbounded number of signal memory locations, with MSTs of 0.662 and 0.693, respectively. In this paper, we address the gap between these two algorithms by designing and analyzing two novel general k-signal memory location algorithms.

关键词： Multiple access signal interference cancellation tree algorithms maximum stable throughput

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

COMPUTATIONAL EXPERIENCE WITH MINIMUM SPANNING tree algorithms

引用

OPERATIONS RESEARCH LETTERS 1983年第1期2卷 36-41页

作者： JARVIS, JP WHITED, DE CLEMSON UNIV DEPT MATH SCI CLEMSON SC 29631 USA

The empirical performance of the algorithms of Kruskal, Prim, and Sollin for determining a minimum spanning tree is examined and found to be considerably better than suggested by worst case analysis. Kruskal's algorithm is generally slowest, with the Prim algorithm being preferred for dense networks and the Sollin algorithm for sparse networks. A simple criterion in terms of the number of vertices and edges of a network is given which indicates which of the Prim or Sollin algorithms as implemented is faster for a particular problem.

关键词： Networks/graphs tree algorithms minimum spanning tree

来源：评论

学校读者我要写书评

暂无评论

Forest FIRE and FIRE Wood: Tools for tree Automata and tree algorithms

Forest FIRE and FIRE Wood: Tools for Tree Automata and Tree ...

引用

7th International Workshop on Finite-State Methods and Natural Language Processing

作者： Cleophas, Lock Eindhoven Univ Technol Dept Math & Comp Sci Software Engn & Technol Grp NL-5600 MB Eindhoven Netherlands

ISBN: (纸本)9781586039752

Pattern matching, acceptance, and parsing algorithms on node-labeled, ordered, ranked trees (live algorithms') are important for applications such as instruction selection and tree transformation/term rewriting. Many such algorithms have been developed. They often are based on results from such algorithms on words or generalizations thereof using finite (tree) automata. Regrettably no coherent, extensive toolkit of such algorithms and automata existed, complicating their use. Our toolkit FOREST FIRE contains many such algorithms and automata constructions. It is accompanied by the graphical user interface (GUI) FIRE WOOD. The toolkit and GUI provide a useful environment for experimenting with and comparing the algorithms. In this tool paper we give an overview of the toolkit and GUI, their context and design rationale, and mention some results obtained with them.

关键词： tree automata tree algorithms toolkit GUI instruction selection

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：