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

International Conference on Perspective Technologies and Methods in MEMS Design

作者： Melnyk, Roman Tushnytskyy, Ruslan Lviv Polytech Natl Univ Comp Sci & Informat Technol Inst Software Dept UA-79013 Lvov Ukraine

In the paper two clustering approaches based on decomposition of item set and space are considered. Some investigation was held to compare the algorithm accuracy and complexity. The test results for some criteria func... 详细信息

ISBN: (纸本)9781424445165

关键词： hierarchical algorithm dataset clustering hypercube decomposition clusters pattern keys

来源：评论

学校读者我要写书评

暂无评论

Partitioning and hierarchical based clustering: a comparative empirical assessment on internal and external indices, accuracy, and time

引用

International Journal of Information Technology (Singapore) 2020年第4期12卷 1377-1384页

作者： Hassan, Syed Imtiyaz Samad, Afreen Ahmad, Omair Alam, Afshar Department of Computer Science and Engineering School of Engineering Sciences and Technology Jamia Hamdard (Deemed to be University) New Delhi India

Clustering is an unsupervised data mining technique where exploration is done with little knowledge of data classes. Its aim is to recognize the hidden information from the data for effective decision-making. Though many clustering algorithms has already been implemented till date, still it is an active topic of research for data mining. Researcher’s attempts to explore, compare, evaluate, and improve the different clustering algorithms available, for specialized situation and context. The purpose of all these efforts are to refine and propose improved version of algorithm after statistical evaluation by different metrices. The present research is an attempt to analysis empirically, the partitioning based clustering algorithms and hierarchical based clustering algorithm;by conducting extensive experiments. Both algorithms effectiveness has been measured through external and internal validity indices and Pearson’s correlation distance function using anatomized experiments. The parameters of evaluation that have been taken into consideration;for Internal Indices: Silhouette Index, Davies-Bouldin Validity Index and Calinski-Harabasz index;for external indices: Jaccard index, Rand Index, Entropy and Normalized Mutual Information. The other parameters of evaluation are accuracy and time of execution. Based on the experiments it may be concluded that K-means algorithm produces more promising result than hierarchical algorithm except in accuracy. © 2019, Bharati Vidyapeeth's Institute of Computer Applications and Management.

关键词： Clustering algorithm Data mining Data science hierarchical algorithm K-means Machine learning Pearson’s correlation distance Validation indices

来源：评论

学校读者我要写书评

暂无评论

A hierarchical computation model for distributed shared-memory machines 9

A hierarchical computation model for distributed shared-memo...

引用

9th Euromicro Workshop on Parallel and Distributed Processing

作者： Rauber, T Rünger, G Univ Halle Wittenberg Inst Informat D-06099 Halle Germany

ISBN: (纸本)0769509886

We present a computation model to describe a clustered memory hierarchy of distributed shared memory machines. The computation model includes the access to shared data stored in different levels of the hierarchy as well as the transfer of entire blocks of data between different levels of the memory. Pure shared memory machines and pure message passing machines can be expressed within the model. As example we use the model to analyze a hierarchical matrix multiplication algorithm.

关键词： shared-memory model distributed shared memory memory hierarchy hierarchical algorithm

来源：评论

学校读者我要写书评

暂无评论

Homogeneous Clusters Allocation of Computational Resources 12

Homogeneous Clusters Allocation of Computational Resources

引用

12th Iberian Conference on Information Systems and Technologies (CISTI)

作者： Senger, Wagner de Gois, Lourival Aparecido Univ Tecnol Fed Parana Ponta Grossa Parana Brazil

ISBN: (纸本)9781509050475

This paper aims to propose a new approach of computational resources clustering, where all of them could be placed in groups with enough conditions to supply some processing demand. This format allows the process result groups to have an equivalent computational power to each other. To allow this, each resource must be evaluated not only by one feature or component, but by a several process relevant elements. This computational power calculation use the concept applied in perceptron neural networks, who use a combination of processed values as a input of a neuron to compile the final value. In a second step, the resources are processed by a farthest hierarchical algorithm, who is in charge to group the elements and balance the total power at the end of the process.

关键词： computational grid cluster load balance hierarchical algorithm perceptron network

来源：评论

学校读者我要写书评

暂无评论

hierarchical Parallel Matrix Multiplication on Large-Scale Distributed Memory Platforms

Hierarchical Parallel Matrix Multiplication on Large-Scale D...

引用

42nd Annual International Conference on Parallel Processing (ICPP)

作者： Quintin, Jean-Noel Hasanov, Khalid Lastovetsky, Alexey Extrem Computing R and D Bull France University College Dublin Dublin 4 Belfield Ireland

ISBN: (纸本)9780769551173

Matrix multiplication is a very important computation kernel both in its own right as a building block of many scientific applications and as a popular representative for other scientific applications. Cannon's algorithm which dates back to 1969 was the first efficient algorithm for parallel matrix multiplication providing theoretically optimal communication cost. However this algorithm requires a square number of processors. In the mid-1990s, the SUMMA algorithm was introduced. SUMMA overcomes the shortcomings of Cannon's algorithm as it can be used on a non-square number of processors as well. Since then the number of processors in HPC platforms has increased by two orders of magnitude making the contribution of communication in the overall execution time more significant. Therefore, the state of the art parallel matrix multiplication algorithms should be revisited to reduce the communication cost further. This paper introduces a new parallel matrix multiplication algorithm, hierarchical SUMMA (HSUMMA), which is a redesign of SUMMA. Our algorithm reduces the communication cost of SUMMA by introducing a two-level virtual hierarchy into the two-dimensional arrangement of processors. Experiments on an IBM BlueGene/P demonstrate the reduction of communication cost up to 2.08 times on 2048 cores and up to 5.89 times on 16384 cores.

关键词： BlueGene Communication Exascale Grid5000 hierarchical algorithm Matrix multiplication Parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

hierarchical Composite Synchronization 12

Hierarchical Composite Synchronization

引用

ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation (PADS)

作者： Liu, Jason Rong, Rong Florida Int Univ Sch Comp & Informat Sci Miami FL 33199 USA

ISBN: (纸本)9780769547145;9781467317979

This paper presents a hierarchical composite synchronization algorithm for parallel discrete-event simulation. The composite approach combines an asynchronous CMB-style channel scanning method with a synchronous window-based method to avoid pathological situations where neither synchronization algorithms would perform optimally. The hierarchical approach addresses the discrepancy in the communication and synchronization cost for shared-memory multiprocessor multi-core machines and for distributed-memory machines. The paper describes a performance model for the hierarchical composite algorithm and proposes a method for predicting the runtime empirically using linear regression. Experiment results show that the model can predict the overall performance of the hierarchical composite algorithm. A significant performance improvement has been observed over different combinations of the traditional asynchronous and synchronous approaches used separately for distributed-memory machines and on shared-memory multiprocessor multicore machines.

关键词： Parallel discrete-event simulation conservative synchronization protocol composite synchronization hierarchical algorithm

来源：评论

学校读者我要写书评

暂无评论

An Efficient Feature Selection Method for Activity Classification 10

An Efficient Feature Selection Method for Activity Classific...

引用

10th International Conference on Intelligent Environments (IE)

作者： Zhang, Shumei McCullagh, Paul Callaghan, Vic Shijiazhuang Univ Dept Comp Sci Shijiazhuang Hebei Peoples R China Univ Ulster Coleraine BT52 1SA Londonderry North Ireland Univ Essex Colchester CO4 3SQ Essex England

ISBN: (纸本)9781479929474

Feature selection is a key step for activity classification applications. Feature selection selects the most relevant features and considers how to use each of the selected features in the most suitable format. This paper proposes an efficient feature selection method that organizes multiple subsets of features in a multilayer, rather than utilizing all selected features together as one large feature set. The proposed method was evaluated by 13 subjects (aged from 23 to 50) in a lab environment. The experimental results illustrate that the large number of features (3 vs. 7 features) are not associated with high classification accuracy using a single Support Vector Machine (SVM) model (61.3% vs. 44.7%). However, the accuracy was improved significantly (83.1% vs. 44.7%), when the selected 7 features were organized as 3 subsets and used to classify 10 postures (9 motionless with 1 motion) in 3 layers via a hierarchical algorithm, which combined a rule-based algorithm with 3 independent SVM models.

关键词： feature selection signal analysis hierarchical algorithm activity classification smart phone

来源：评论

学校读者我要写书评

暂无评论

AN algorithm FOR REAL-TIME DETECTION OF MINEFIELDS IN MONOCHROMATIC AIRBORNE IMAGERY

AN ALGORITHM FOR REAL-TIME DETECTION OF MINEFIELDS IN MONOCH...

引用

Conference on Detection Technologies for Mines and Minelike Targets

作者： MCFEE, JE RUSSELL, KL ITO, MR VU, RQ DEF RES ESTAB SUFFIELD THREAT DETECT GRPMEDICINE HATAB T1A 8K6CANADA

ISBN: (纸本)0819418528

An algorithm for real-time minefield detection from monochromatic airborne imagery must analyse the shape and spatial inter-relationship between compact, several pixel wide, regions that contrast with background. The regions are sparsely distributed over large areas and input data rates are very high. A hierarchical algorithm is described which meets these severe requirements. In progressing from lower to higher levels, computational operations become more complex but the volume of data to be analyzed decreases. At the lowest level of the hierarchy, non-suspect regions are rejected to drastically reduce the data rate. At increasingly higher levels, suspect regions are segmented into homogeneous sub-regions, morphological features of the sub-regions are extracted and sub-regions are classified based on extracted features. At the top level, spatial relationships between "mine-like" regions are determined and are used by statistical and knowledge-based methods to classify the imaged area as being a minefield with an estimated likelihood. An expert system performs syntactic pattern recognition, coordinates the algorithm and integrates external information. The algorithm is being implemented on a distributed computing system consisting of a workstation, vector processors and transputers. Processor requirements, data rates, estimated probability of detection and false alarm rates and expected system performance are discussed. © 1995 SPIE.

关键词： REMOTE MINEFIELD DETECTION hierarchical algorithm TRANSPUTERS IMAGE ANALYSIS REAL-TIME EXPERT SYSTEMS

来源：评论

学校读者我要写书评

暂无评论

Combined algorithmic and GPU acceleration for ultra-fast circular conebeam backprojection

Combined algorithmic and GPU acceleration for ultra-fast cir...

引用

Conference on Medical Imaging - Physics of Medical Imaging

作者： Brokish, Jeffrey Sack, Paul Bresler, Yoram InstaRecon Inc Champaign IL 61820 USA

ISBN: (纸本)9780819480231

In this paper, we describe the first implementation and performance of a fast O(N(3)logN) hierarchical backprojection algorithm for cone beam CT with a circular trajectory(1), developed on a modern Graphics Processing Unit (GPU). The resulting tomographic backprojection system for 3D cone beam geometry combines speedup through algorithmic improvements provided by the hierarchical backprojection algorithm with speedup from a massively parallel hardware accelerator. For data parameters typical in diagnostic CT and using a mid-range GPU card, we report reconstruction speeds of up to 360 frames per second, and relative speedup of almost 6x compared to conventional backprojection on the same hardware. The significance of these results is twofold. First, they demonstrate that the reduction in operation counts demonstrated previously for the FHBP algorithm can be translated to a comparable run-time improvement in a massively parallel hardware implementation, while preserving stringent diagnostic image quality. Second, the dramatic speedup and throughput numbers achieved indicate the feasibility of systems based on this technology, which achieve real-time 3D reconstruction for state-of-the art diagnostic CT scanners with small footprint, high-reliability, and affordable cost.

关键词： Tomography Circular Cone-Beam Fast Backprojection hierarchical algorithm

来源：评论

学校读者我要写书评

暂无评论

hierarchical ZRP's Performance vs ZRP's Performance in MANET

Hierarchical ZRP's Performance vs ZRP's Performance in MANET

引用

IEEE International Conference on Communication Software and Networks (ICCSN)

作者： Zhang Xijie Xu Chunxiu Xu Jiaqi Beijing Univ Posts & Telecommun Sch Informat & Commun Engn Beijing Peoples R China

ISBN: (纸本)9781479919840

The mobile ad hoc network (MANET) has a dynamic nature that makes the network topology change frequently. As a consequence, routing protocol plays an important role in MANET. Zone Routing Protocol (ZRP) is a typical hybrid routing protocol in MANET. It combines proactive with reactive techniques. It applies a proactive technique in the zone and a reactive technique out of the zone. In this paper we propose a hierarchical routing protocol H-ZRP based on ZRP to avoid redundant or duplicate route requests. We demonstrate the performance of H-ZRP with various performance metrics. We compare the performance of H-ZRP and ZRP in End-to-End Delay, overhead, route discovery time and packet delivery ratio.

关键词： ZRP Hybrid Routing Protocol Proactive Reactive hierarchical algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：