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

partitioning algorithm FOR THE SOLUTION OF LONG-TERM POWER-PLANT MIX PROBLEMS

PROCEEDINGS OF THE INSTITUTION OF ELECTRICAL ENGINEERS-LONDON 1979年第9期126卷 837-839页

作者： HAMAM, YM RENDERS, M TRECAT, J FAC POLYTECHMONS DEPT ELECT B-7000 MONS BELGIUM UNERG CHARLEROI BELGIUM

A partitioning algorithm based on Benders's method1 is described. This algorithm makes possible the solution of a large problem in a limited computer memory. The special properties of the partial problems of the partitioned problem are exploited to reduce further memory requirements and computation time. This method has been implemented on the SEL 32/55 computer of the UNERG at Charleroi in Belgium.

关键词： computation time Benders's method Optimisation power plants memory requirements Production management electricity supply industry Power engineering computing partitioning algorithm long term power plant mix problems Public utilities linear programming Optimisation techniques Power system planning and layout Systems theory applications in industry Systems theory applications planning partial problems management computer memory power system analysis computing

来源：评论

学校读者我要写书评

暂无评论

partitioning algorithm for PON Network Design

Partitioning Algorithm for PON Network Design

引用

International Conference on Applied Informatics and Communication (ICAIC 2011)

作者： Xiong, Weicheng Wu, Chanle Wu, Libing Guo, Xiaojun Chen, Yibo Xie, Ming Wuhan Univ Sch Comp Wuhan 430072 Peoples R China

ISBN: (纸本)9783642232251

Optical access technology has quickly got a worldwide development. Currently, the deployment of equipment and fiber lines in the optical access network need professionals to design. But, because the lack of a unified standard, it is difficult to make the network reasonable. By analyzing the PON architecture model, this article talks about an improved partitioning algorithm for PON network design. By entering some parameters, it can automatically calculate the number and configuration of OLT, which can help to optimize the network layout, and save the network construction costs.

关键词： PON Network design partitioning algorithm

来源：评论

学校读者我要写书评

暂无评论

An efficient partitioning algorithm for distributed virtual environment systems

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2002年第3期13卷 193-211页

作者： Lui, JCS Chan, MF Chinese Univ Hong Kong Dept Comp Sci & Engn Sha Tin Hong Kong Peoples R China Poly Asia Comuter Inc Kowloon Hong Kong Peoples R China

Distributed virtual environment (DVE) systems model and simulate the activities of thousands of entities interacting in a virtual world over a wide area network. Possible applications for DVE systems are multiplayer video games, military and industrial trainings, and collaborative engineering. In general, a DVE system is composed of many servers and each server is responsible to manage multiple clients who want to participate in the virtual world. Each server receives updates from different clients (such as the current position and orientation of each client) and then delivers this information to other clients in the virtual world. The server also needs to perform other tasks, such as object collision detection and synchronization control. A large scale DVE system needs to support many clients and this imposes a heavy requirement on networking resources and computational resources. Therefore, how to meet the growing requirement of bandwidth and computational resources is one of the major challenges in designing a scalable and cost-effective DVE system. In this paper, we propose an efficient partitioning algorithm that addresses the scalability issue of designing a large scale DVE system. The main idea is to dynamically divide the virtual world into different partitions and then efficiently assign these partitions to different servers. This way, each server will process approximately the same amount of workload. Another objective of the partitioning algorithm is to reduce the server-to-server communication overhead. The theoretical foundation of our dynamic partitioning algorithm is based on the linear optimization principle. We also illustrate how one can parallelize the proposed partitioning algorithm so that it can efficiently partition a very large scale DVE system. Lastly, experiments are carried out to illustrate the effectiveness of the proposed partitioning algorithm under various settings of the virtual world.

关键词： distributed virtual environment scalability issue partitioning algorithm load balancing communication reduction linear optimization

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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 heat transfer analysis of cyclically symmetrical structures

引用

FINITE ELEMENTS IN ANALYSIS AND DESIGN 2015年第C期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 Multiway Design-driven partitioning algorithm for Distributed Verilog Simulation

引用

SIMULATION-TRANSACTIONS OF THE SOCIETY FOR MODELING AND SIMULATION INTERNATIONAL 2009年第4期85卷 257-270页

作者： Li, Lijun Tropper, Carl McGill Univ Sch Comp Sci Montreal PQ Canada

Many partitioning algorithms have been proposed for distributed Very-large-scale integration (VLSI) simulation. Typically, they make use of a gate level netlist and attempt to achieve a minimal cutsize subject to a load balance constraint. The algorithm executes on a hypergraph which represents the netlist. We propose a design-driven iterative partitioning algorithm for Verilog based on module instances instead of gates. We do this in order to take advantage of the design hierarchy information contained in the modules and their instances. A Verilog instance represents one vertex in the circuit hypergraph. The vertex can be flattened into multiple vertices in the event that a load balance is not achieved by instance-based partitioning. In this case, the algorithm flattens the largest instance and moves gates between the partitions in order to improve the load balance. Our experiments show that this partitioning algorithm produces a smaller cutsize than is produced by hMetis on a gate-level netlist. It produces better speedup for the simulation because it takes advantage of the design hierarchy.

关键词： Parallel simulation VLSI distributed gate level verilog simulation partitioning algorithm load balance cutsize

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：