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

Assessing Criteria Weights by the Symmetry Point of Criterion (Novel SPC Method)–Application in the Efficiency Evaluation of the Mineral Deposit Multi-Criteria partitioning algorithm

引用

Computer Modeling in Engineering & Sciences 2023年第7期136卷 955-979页

作者： Zoran Gligoric Milos Gligoric Igor Miljanovic Suzana Lutovac Aleksandar Milutinovic Faculty of Mining and Geology University of BelgradeBelgrade11000Serbia

Information about the relative importance of each criterion or theweights of criteria can have a significant influence on the ultimate rank of ***,assessing the weights of criteria is a very important task in solving multi-criteria decision-making *** methods are commonly used for assessing the weights of criteria:objective,subjective,and integrated *** this study,an objective approach is proposed to assess the weights of criteria,called SPCmethod(Symmetry Point of Criterion).This point enriches the criterion so that it is balanced and easy to implement in the process of the evaluation of its influence on *** SPC methodology is systematically presented and supported by detailed calculations related to an artificial *** validate the developed method,we used our numerical example and calculated the weights of criteria by CRITIC,Entropy,Standard Deviation and MEREC *** analysis between these methods and the SPC method reveals that the developedmethod is a very reliable objective way to determine the weights of ***,in this study,we proposed the application of SPCmethod to evaluate the efficiency of themulti-criteria partitioning *** main idea of the evaluation is based on the following fact:the greater the uniformity of the weights of criteria,the higher the efficiency of the partitioning *** research demonstrates that the SPC method can be applied to solving different multi-criteria problems.

关键词： Multi-criteria decision-making weights of criteria symmetry point of criterion mineral deposit partitioning algorithm performance evaluation

来源：评论

学校读者我要写书评

暂无评论

A Boundary partitioning algorithm for Geometrical Product Deviation Evaluation

引用

Procedia CIRP 2024年 129卷 115-120页

作者： Fan Liu Yanlong Cao Jia Luo Junnan Zhi Jiangxin Yang Key Laboratory of Advanced Manufacturing Technology of Zhejiang Province Zhejiang University Hangzhou 310027 China State Key Laboratory of Fluid Power and Mechatronic Systems School of Mechanical Engineering Zhejiang University Hangzhou 310027 China

partitioning is essential in the smart verification process when measurements are conducted using modern instruments, such as a CT scanner. Numerous partitioning methods are commonly designed for scenes rather than for geometrical products. This paper introduces a novel method to partition geometrical elements from the measured data of the workpiece containing geometrical deviation and refines the points attribution problem at part boundaries. Firstly, a partition algorithm based on the coarse boundaries is presented. Then, a boundary refinement process is proposed to improve the partition result. A measured data set is taken as an example to verify the feasibility of the proposed method.

关键词： partitioning algorithm Deviation evaluation Tolerancing ISO GPS

来源：评论

学校读者我要写书评

暂无评论

An Efficient partitioning algorithm Based on Hypergraph for 3D Network-On-Chip Architecture Floorplanning

引用

JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS 2019年第5期28卷

作者： Tan, Junyan Cai, Chunhua Hohai Univ Coll IOT Changzhou 213022 Peoples R China

Network-on-Chip (NoC) supplies a scalable and fast interconnect for the communication between the different IP cores in the System-on-Chip (SoC). With the growing complexity in consumer embedded systems, the emerging SoC architectures integrate more and more components for the different signal processing tasks. Two dimensional Network-on-Chip (2D NoC) becomes a bottleneck for the development of the SoC architecture because of its limitation on the area of chip and the long latency. In this case, SoC research is forcing on the exploration of three dimensions (3D) technology for developing the next generation of large SoC which integrates three dimensional Network-on-Chip (3D NoC) for the communication architecture. 3D design technology resolves the vertical inter-layer connection issue by Through-Silicon Vias (TSVs). However, TSVs occupy significant silicon area which limits the inter-layer links of the 3D NoC. Therefore, the task partitioning on 3D NoC must be judicious in large SoC design. In this paper, we propose an efficient layer-aware partitioning algorithm based on hypergraph (named ELAP-NoC) for the task partitioning with TSV minimization for 3D NoC architecture floorplanning. ELAP-NoC contains divergence stage and convergence stage. ELAP-NoC supplies firstly a multi-way min-cut partitioning to gradually divide a given design layer by layer in the divergence stage in order to get an initial solution, then this solution is refined in convergence stage. The experiments show that ELAP-NoC performs a better capacity in the partitioning of the different numbers of cores which supplies the first step for the 3D NoC floorplanning.

关键词： 3D NoC partitioning algorithm TSV hypergraph

来源：评论

学校读者我要写书评

暂无评论

User-aware partitioning algorithm for mobile cloud computing based on maximum graph cuts

引用

COMPUTER NETWORKS 2017年第Part1期129卷 193-206页

作者： Niu, Jianwei Wang, Shihao Niu, Wei Atiquzzaman, Mohammed Beihang Univ State Key Lab Software Dev Environm Sch Comp Sci & Engn Beijing 100191 Peoples R China Univ Oklahoma Sch Comp Sci Norman OK 73019 USA

partitioning and offloading of mobile applications have been demonstrated as a promising approach that not only enhances the performance but also extends the battery life of Smart Mobile Devices (SMDs) effectively. Researchers have proposed four factors that affect the partitioning decision: device (hardware), application (software), developer and user. However, most existing research efforts focus on the first three factors and pay little attention to the influence of user preferences on the partitioning decision. Among these factors, user preference usually affects user experience most. Moreover, previous work which took into account the other factors cannot generate adaptive partitioning results. In this work, we propose a user-aware partitioning algorithm to offer a personalized and precise partitioning plan for better user experience. Based on machine learning methods, we first propose a user profile model for characterizing the preferences of different phone users. In addition, a novel cost evaluation model (called CMET model) is proposed to evaluate the comprehensive offloading costs in terms of CPU & memory utilization, time cost and energy consumption. Finally, we propose a Max-Cuts partitioning algorithm based on Branch-and-Bound search to obtain the optimal partitioning plan. Experimental results demonstrate that for different types of phone users, our partitioning algorithm could effectively improve corresponding performances that they concern about, and achieve the most satisfactory user experience compared with state-of-the-art approaches. (C) 2017 Elsevier B.V. All rights reserved.

关键词： Mobile cloud computing partitioning algorithm Graph-based model Maximum graph cuts User profile

来源：评论

学校读者我要写书评

暂无评论

Voltage equalization of an ultracapacitor module by cell grouping using number partitioning algorithm

引用

JOURNAL OF POWER SOURCES 2016年 301卷 113-121页

作者： Oyarbide, E. Bernal, C. Molina, P. Jimenez, L. A. Galvez, R. Martinez, A. Univ Zaragoza Aragon Inst Engn Res Zaragoza 50018 Spain Epic Power Converters Zaragoza 50018 Spain

Ultracapacitors are low voltage devices and therefore, for practical applications, they need to be used in modules of series-connected cells. Because of the inherent manufacturing tolerance of the capacitance parameter of each cell, and as the maximum voltage value cannot be exceeded, the module requires inter-cell voltage equalization. If the intended application suffers repeated fast charging/discharging cycles, active equalization circuits must be rated to full power, and thus the module becomes expensive. Previous work shows that a series connection of several sets of paralleled ultracapacitors minimizes the dispersion of equivalent capacitance values, and also the voltage differences between capacitors. Thus the overall life expectancy is improved. This paper proposes a method to distribute ultracapacitors with a number partitioning-based strategy to reduce the dispersion between equivalent submodule capacitances. Thereafter, the total amount of stored energy and/or the life expectancy of the device can be considerably improved. (C) 2015 Elsevier B.V. All rights reserved.

关键词： Ultracapacitor module Storage system Voltage balancing partitioning algorithm Parallel-series connection Ageing

来源：评论

学校读者我要写书评

暂无评论

A robust and fast partitioning algorithm for extended target tracking using a Gaussian inverse Wishart PHD filter

引用

KNOWLEDGE-BASED SYSTEMS 2016年 95卷 125-141页

作者： Zhang, Yongquan Ji, Hongbing Xidian Univ Sch Elect Engn POB 229 Xian 710071 Peoples R China

Extended target Gaussian inverse Wishart probability hypothesis density (ET-GIW-PHD) filter is a promising filter. However, the exact filter requires all possible partitions of the current measurement set for updating, which is computationally intractable. In order to limit the number of partitions, we propose a robust and fast partitioning algorithm, called modified Bayesian adaptive resonance theory (MB-ART) partition, based on Bayesian ART neural network architecture. In MB-ART partition, the alternative partitions approximating all possible partitions of the measurement set are generated by the different vigilance parameters, and these parameters are obtained by the bisection method. In addition, MB-ART partition can also solve the cardinality underestimation problem caused by the separating tracks scenario which was investigated by Granstrom et al. [1], since it takes into account the shape information of the different sized extended targets by iteratively updating variance. Simulation results show that our proposed partitioning algorithm can well handle the cardinality underestimation problem caused by the separating tracks scenario and reduce computational burden without losing tracking performance. For a four-target tracking scenario, the ET-GIW-PHD filter using MB-ART partition only requires 8.391 s on average for one Monte Carlo run, while the ET-GIW-PHD filter using combination partition requires 14.834 s. It implies that the proposed MB-ART partition has good application prospects for the real-time extended target tracking (ETT) system. (C) 2015 Elsevier B.V. All rights reserved.

关键词： Extended target tracking Fuzzy adaptive resonance theory partitioning algorithm Cardinality underestimation problem Gaussian inverse Wishart probability hypothesis density filter

来源：评论

学校读者我要写书评

暂无评论

An EFG-SBM based partitioning algorithm for two-dimensional elastic analysis of cyclically symmetrical structures

引用

ENGINEERING COMPUTATIONS 2015年第2期32卷 452-472页

作者： Guo, Xiaofeng He, Yiqian Yang, Haitian Dalian Univ Technol Dept Engn Mech State Key Lab Struct Anal Ind Equipment Dalian Peoples R China Dalian Jiaotong Univ Sch Civil & Safety Engn Dalian Peoples R China

Purpose - The purpose of this paper is to exploit the cyclic symmetry to reduce the computational expense of scaled boundary method (SBM) which may cumber its further application. Design/methodology/approach - A partitioning EFG-SB (Element-free Galerkin-SB) algorithm is proposed for the two-dimensional elastic analysis of cyclically symmetric structures. Findings - By utilizing the cyclic symmetry and partitioning algorithm, the whole computational cost can be significantly reduced. Three numerical examples are given to illustrate the advantages of the proposed algorithm. Originality/value - It is proved that the matrices of eigenvalue and system equations of EFG-SBM for cyclically symmetric structures are block-circulant so long as a kind of symmetry-adapted reference coordinate system is adopted. No matter whether displacement constraints are cyclically symmetric or not, the partition is available for the eigenvalue equations. Therefore the major computational cost can be saved via the proposed partitioning algorithm. This paper provides an efficient algorithm for the two-dimensional elastic analysis of cyclically symmetric structures using EFG-SBM. A higher computing efficiency can be expected since the proposed partitioning algorithm facilitates parallel processing.

关键词： Elasticity Block-circulant Cyclic symmetry Element-free Galerkin scaled boundary method partitioning algorithm

来源：评论

学校读者我要写书评

暂无评论

An EFG-SBM based partitioning algorithm for heat transfer analysis of cyclically symmetrical structures

引用

FINITE ELEMENTS IN ANALYSIS AND DESIGN 2015年第Jan.期93卷 42-49页

作者： Yang, Haitian Guo, Xiaofeng He, Yiqian Dalian Univ Technol Dept Engn Mech State Key Lab Struct Anal Ind Equipment Dalian 116024 Peoples R China Dalian Jiaotong Univ Sch Civil & Safety Engn Dalian 116028 Peoples R China

An Element-free Galerkin scaled boundary method (EFG-SBM) based partitioning algorithm is proposed for the 2D steady-state heat transfer analysis of cyclically symmetrical structures. The eigenvalue matrices of EFG-SBM for the rotationally periodic system are proved to be block-circulant under a symmetry-adapted reference coordinate system. Furthermore, both the eigenvalue and system equations can be partitioned into a number of smaller independent problems which are solved by a partitioning algorithm. Numerical examples are given to verify the proposed algorithm in term of computing accuracy and efficiency. (C) 2014 Elsevier B.V. All rights reserved.

关键词： Cyclic symmetry Element-free Galerkin scaled boundary method Heat transfer Block-circulant partitioning algorithm

来源：评论

学校读者我要写书评

暂无评论

A novel Raft consensus algorithm combining comprehensive evaluation partitioning and Byzantine fault tolerance

引用

JOURNAL OF SUPERCOMPUTING 2024年第18期80卷 26363-26393页

作者： Deng, Xiaohong Yu, Zhiwei Xiong, Weizhi Li, Kangting Liu, Huiwen Jiangxi Univ Sci & Technol Sch Informat Engn Ganzhou 341000 Jiangxi Peoples R China Jiangxi Univ Sci & Technol Sch Informat Engn Ganzhou 341000 Jiangxi Peoples R China Ganzhou Cloud Comp & Big Data Key Lab Ganzhou 341000 Jiangxi Peoples R China

Currently, Raft, as an mainstream consensus mechanism, has received widespread attention. Partition consensus can reduce the number of nodes involved in a single consensus and improve consensus efficiency. However, existing algorithms suffer from unreasonable partitioning and intolerance of Byzantine nodes. To address these problems, this paper proposes a novel Raft consensus algorithm combining comprehensive evaluation partitioning and Byzantine fault tolerance, CB-Raft. First, a comprehensive evaluation of nodes is conducted from the perspectives of consensus behavior and location, and the nodes are evenly divided based on the parity of the comprehensive ranking. Second, the leader is selected from the nodes with the top rankings in the comprehensive evaluation, and the nodes communicate with each other based on BLS signatures. Finally, a fast response mechanism based on cross-partition leader-follower communication is proposed to avoid the continued evil behavior of the leader, and a pipeline mechanism based on changeable signature thresholds is proposed to solve consensus blocking. The experimental results show that compared with the existing partitioning methods, the proposed partitioning scheme has significant advantages in terms of consensus latency, throughput, and the probability of partition success. Compared with the similar Raft algorithms, CB-Raft has high consensus performance and good resistance to Byzantine nodes.

关键词： Blockchain Consensus mechanism partitioning algorithm Byzantine fault tolerance Raft

来源：评论

学校读者我要写书评

暂无评论

A scaled boundary finite element partitioning based reduced order algorithm for the elastic analysis of cyclically symmetric structures

引用

INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING 2023年第5期124卷 1146-1167页

作者： Wang, Chongshuai Peng, Ruifei He, Yiqian Yang, Haitian Han, Xu Hebei Univ Technol Sch Elect Engn State Key Lab Reliabil & Intelligence Elect Equipm Tianjin Peoples R China Chinese Acad Sci Shenyang Inst Automat Inst Robot & Intelligent Mfg Key Lab Networked Control Syst Shenyang Peoples R China Dalian Univ Technol Int Res Ctr Computat Mech Dept Engn Mech State Key Lab Struct Anal Ind Equipment Dalian Peoples R China Dalian Univ Technol Int Res Ctr Computat Mech Dept Engn Mech State Key Lab Struct Anal Ind Equipment Dalian 116024 Peoples R China Hebei Univ Technol Sch Elect Engn State Key Lab Reliabil & Intelligence Elect Equipm Tianjin 300401 Peoples R China

An efficient reduced order algorithm is proposed for the elastic SBFE analysis for 2-D cyclic symmetric structures with or without a common node. The general stiffness matrices of scaled boundary finite element (SBFE) is proved to be block-circulant, and can be constructed via the basic region, instead of the whole computing domain. Thus, the expense on eigenvalue analysis required in generating stiffness matrix can be significantly reduced, and the solution scale can be reduced by partitioning the system equation into a series of small independent subproblems. Furthermore, the presented algorithm is combined with the Woodbury formula to reduce the computational cost on the analysis of incomplete cyclically symmetric structures, the original system equation is transformed into the equations with block-circulant coefficient matrices, which is efficiently solved by partitioning algorithm. Four numerical examples are provided to demonstrate the effectiveness and advantages of the proposed approach.

关键词： computational cost cyclically symmetric partitioning algorithm SBFE woodbury formula

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：