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

THE GENERATION OF RANDOM ULTRAMETRIC MATRICES REPRESENTING DENDROGRAMS

JOURNAL OF CLASSIFICATION 1991年第2期8卷 177-200页

作者： LAPOINTE, FJ LEGENDRE, P UNIV MONTREAL DEPT SCI BIOL CP 6128 SUCCURSALE A MONTREAL H3C 3J7 QUEBEC CANADA

Many methods and algorithms to generate random trees of many kinds have been proposed in the literature. No procedure exists however for the generation of dendrograms with randomized fusion levels. Randomized dendrograms can be obtained by randomizing the associated cophenetic matrix. Two algorithms are described. The first one generates completely random dendrograms, i.e., trees with a random topology, random fusion level values, and random assignment of the labels. The second algorithm uses a double-permutation procedure to randomize a given dendrogram;it proceeds by randomization of the fixed fusion levels, instead of using random fusion level values. A proof is presented that the double-permutation procedure is a Uniform Random Generation algorithm sensu Furnas (1984), and a complete example is given.

关键词： Random dendrograms Random matrices Uniform sampling tree algorithm Monte Carlo studies Clustering methodology

来源：评论

学校读者我要写书评

暂无评论

A graphical approach to tracking and reporting target status in structural genomics

引用

Journal of Structural and Functional Genomics 2007年第4期8卷 209-216页

作者： Pan, Xiaokang Wesenberg, Gary E. Markley, John L. Fox, Brian G. Phillips Jr., George N. Bingman, Craig A. Center for Eukaryotic Structural Genomics Department of Biochemistry University of Wisconsin-Madison Madison WI 53706 433 Babcock Drive United States

Determination of a protein structure requires a series of decisions and processes, starting with target selection, through cloning, expression, purification, and finally structure determination. Structural genomics projects may distribute these steps among several different groups of researchers. Although this division may achieve a lower cost per solved structure, it creates a unique set of challenges for integrating and passing information on the progress of a given target across several functional divisions. Laboratory information management systems (LIMS) are essential for gathering this information, but may not display the progress of a given target in an intuitive way. In addition, structural genomics projects funded by the Protein Structure Initiative (PSI) are obliged to disseminate data regularly to the TargetDB and PepcDB data repositories, and this requires the creation of specialized views of the data. We report here how the flow of a target through a structural genomics pipeline and reports to TargetDB and PepcDB can be abstracted as directed acyclic graphs or trees. To implement this kind of display, we created software that tracks the flow of activity leading toward protein structure determination and prepares XML reports as input to TargetDB and PepcDB. The target tracing software consists of a set of Perl CGI scripts that integrate with the Graphviz visualization system to provide a graphical, user-friendly Web interface. The database reporting software, also coded in Perl, transfers large-scale genomics data from our LIMS into a PepcDB reportable XML file. This software package has facilitated inter-group communication, improved the quality and accuracy of information in our LIMS, and increased the efficiency and accuracy of our reports to PepcDB. © 2008 Springer Science+Business Media B.V.

关键词： Graphviz ORF target PepcDB Protein structure tree algorithm

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Mit :: Lcs :: Tr :: Mit-Lcs-Tr-121

引用

2016年

Mit :: Lcs :: Tr :: Mit-Lcs-Tr-121 by published by

关键词： algorithm basic strategy best player bounds comparisons largest largest element lemma lower lower bound lower bounds main theorem minimum number mit-lcs-tr-121 proof theorem third best tournament tree algorithm undefeated undefeated players

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

BANDWIDTH ALLOCATION IN MULTICAST treeS WITH QoS CONSTRAINTS

引用

International Journal of Information Technology & Decision Making 2003年第4期2卷 619-627页

作者： M. KODIALAM V. VENKATESWARAN Bell Laboratories Lucent Technologies 101 Crawfords Corner Road Holmdel New Jersey USA Room D5-3D38 AT&T Labs. 200 Laurel Avenue Middletown NJ 07748 USA

Growth in continuous media applications and group communications highlight the need for efficient multicast support. In multicast tree construction and resource reservation a central problem is ensuring that the determined multicast tree can support specified QoS requirements economically. In this paper, we focus on this specific problem under a typical QoS requirement that end-to-end delays must not exceed a specified limit. For the resulting optimization problem, we develop a fast and efficient algorithm that is suitable for implementing a router to perform real time provisioning for multicast sessions.

关键词： Sizing links of a multicast tree network tree algorithm

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A multimedia wireless multiple access protocol for mobile terminals

引用

ELECTRONICS AND COMMUNICATIONS IN JAPAN PART I-COMMUNICATIONS 1999年第8期82卷 1-12页

作者： Iida, N Watanabe, T Ueno, Y Mizuno, T Mitsubishi Elect Co Kamakura Kanagawa 2478520 Japan Shizuoka Univ Fac Informat Shizuoka 4228017 Japan

A wireless multiple access protocol for multimedia traffic (MWMA) is discussed. MWMA is used when a large number of users dynamically migrating to/from a private network communicate multimedia messages with mobile terminals. The protocol uses a stable continual tree algorithm to reserve slots of a channel. MWMA assigns slots to real-time messages at high priority up to an upper limit in order to preserve a constant bandwidth for the messages, allocating the rest of the slots to non-real-time messages. Though the frame length is basically fixed, the protocol divides a frame into smaller frames after the assignment if several free slots are still available in order to decrease undesirable delay of non-real-time messages. The protocol uses a central control, which enables it to reduce energy restrictions on mobile terminals and to handle dynamic migration of mobile terminals and hidden terminals. (C) 1999 Scripta Technica.

关键词： multiple access tree algorithm wireless networks mobile computing multimedia communications

来源：评论

学校读者我要写书评

暂无评论

Bames-Hut treecode on GPU

Bames-Hut Treecode on GPU

引用

The 2010 IEEE International Conference on Progress in Informatics and Computing

作者： Hu Jiang,Qianni Deng Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai,China

General-purpose computation on graphics processing units(GPGPU) has become a popular field of *** to its high computing capacity and relatively low price,GPU has been an ideal processing unit for many scientific applications,among which is N-body *** to the published papers,a simple O(N 2) algorithm of N-body simulation has achieved some enhancements,but tree-algorithm doesn't work well on GPU. This paper proposes a new implementation of tree-algorithm on GPU using CUDA,which has obtained more than 100X speedup when computing forces between *** paper also rises up a new method to build tree in this algorithm,making the performance even better.

关键词： GPGPU N-body simulation tree algorithm

来源：评论

学校读者我要写书评

暂无评论

Physical layer network-coded MAC strategy

Physical layer network-coded MAC strategy

引用

International Conference on Cyberspace Technology (CCT 2014)

作者： Yu Zhang Ge Xiong School of Computer and Communication Engineering University of Science and Technology Beijing 100083 China School of Software Beihang University 100191 China

ISBN: (纸本)9781510802704

This paper introduces physical layer network coding into multiple access system and then proposes a physical layer network coded MAC strategy (PNC-MAC). The detail steps of the PNC-MAC are presented. To show the performance of the algorithm, we compare the throughput and average delay induced by the new algorithm with that by modified ALOHA strategy and tree algorithm via simulations. The results showed that when operated with our proposed PNC-MAC, multiple access system can achieve a larger throughput while the frames bear shorter average delay. Besides, in many users case, the throughput increases slightly while the average delay ascends drastically.

关键词： ALOHA strategy Medium access control Physical layer network coding tree algorithm Medium access control mean delay Physical layer Multi access systems hierarchical network Throughput MAXIMUM ACCEPTABLE CONTAMINATION Media Access Protocol

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：