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 ...
详细信息
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.
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 fo...
详细信息
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.
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 ...
详细信息
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.
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. Re...
详细信息
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.
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 paramete...
详细信息
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.
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...
详细信息
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.
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 parti...
详细信息
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.
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-SB...
详细信息
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.
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, ex...
详细信息
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.
作者:
Wang, ChongshuaiPeng, RuifeiHe, YiqianYang, HaitianHan, XuHebei 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)...
详细信息
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.
暂无评论