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

Research on regulation strategy of integrated energy system based on game theory and divide-and-conquer algorithm

ENERGY 2025年 319卷

作者： Wu, Yanjuan Jin, Pengfei Li, Qing Tianjin Univ Technol 391 Binshui Xidao Tianjin 300382 Peoples R China Tianjin Key Lab Control Theory & Applicat Complica Tianjin 300382 Peoples R China Tianjin Key Lab New Energy Power Convers Transmiss & Intelligent Control Tianjin 300382 Peoples R China

Integrated energy system is an energy supply method that enables the complementary and efficient utilization of multiple energy sources. However, integrated energy system involves multiple stakeholders, including the integrated energy operator, energy storage system, and energy user. Their behaviors can lead to reduced system benefits, increased carbon emissions, and even violations. To address the above issues, an integrated energy system hybrid game model with the participation of the regulatory agency is constructed, and a divide-andconquer algorithm is proposed to solve it. Firstly, this study establishes a Stackelberg game model to analyze the interactions among participants within the system and formulates a non-cooperative game model to investigate the relationship between integrated energy system and regulatory agency. Then, game theory is combined with the divide-and-conquer algorithm to solve the hybrid game model, evaluating the optimal strategies for the integrated energy operator as the leader, the energy storage system and energy user as followers under regulatory agency's interventions. Finally, a case study is conducted to analyze the regulatory agency's goal of maximizing overall system benefits and environmental benefits. By analyzing the impacts of various regulatory strategies on the system, this study provides actionable decision support and policy recommendations for the regulatory agency.

关键词： Integrated energy system Non-cooperative game Stackelberg game divide-and-conquer algorithm Electricity market regulation

来源：评论

学校读者我要写书评

暂无评论

divide-and-conquer algorithm for ClustalW-MPI

Divide-and-conquer algorithm for ClustalW-MPI

引用

19th IEEE Canadian Conference on Electrical and Computer Engineering

作者： Rezaei, Siamak Monwar, Md. Maruf Univ Northern British Columbia Prince George BC V2L 5P2 Canada

ISBN: (纸本)9781424400379

Multiple sequence alignment continues to be an active field of research in Computational Biology and the most widely used tool for multiple sequence alignment is ClustalW, which achieves alignment via three steps: pair wise alignment, guide tree generation and progressive alignment. ClustalW-MPI is a parallel implementation of ClustalW. In this paper, a new approach, divide-and-conquer, is implemented which uses ClustalW-MPI for sequence alignment but it gets a better speed up performance than ClustalW-MPI. In this approach, the sequences are first cut down into smaller subsequences by divide-and-conquer technique to minimize the computational space. Then these subsequences are sent to different available processors using Message Passing Interface technique. Those processors align the subsequences by executing ClustalW-MPI simultaneously. After aligning, the results are then sent to the main processor to be concatenated to produce the final alignment. But some quality of the alignment may be compromised in this approach for the introduction of gaps at the start or end of subsequences aligned. Therefore, some heuristic methods for fixing the cut points were suggested for future improvement, such as overlapping alignment and sliding window alignment.

关键词： multiple sequence alignment message passing interface divide-and-conquer algorithm multiple tree alignment

来源：评论

学校读者我要写书评

暂无评论

Performance investigation and constraint stabilization approach for the orthogonal complement-based divide-and-conquer algorithm

引用

MECHANISM AND MACHINE THEORY 2013年 67卷 111-121页

作者： Khan, I. M. Anderson, K. S. Rensselaer Polytech Inst Computat Dynam Lab Dept Mech Aerosp & Nucl Engn Troy NY 12180 USA

The introductory paper on the orthogonal complement-based divide-and-conquer algorithm (ODCA) lacked in properly characterizing the growth rate of the constraint violation error and the singularity handling capabilities of the algorithm [1]. In this paper, we investigate the performance of the ODCA with regards to constraint error growth and singularity handling capabilities. Moreover we introduce a new inverse dynamics-based constraint stabilization approach. The proposed method is applicable to general multibody systems with arbitrary number of closed kinematic loops. We compare the ODCA with augmented [2] and reduction [3] methods. Our results indicate that the error growth rate for the ODCA falls between these two traditional techniques. Moreover, using benchmark numerical problems, we illustrate the effectiveness of the stabilization scheme. (C) 2013 Elsevier Ltd. All rights reserved.

关键词： Constrained multibody systems Orthogonal complement divide-and-conquer algorithm Logarithmic complexity Constraint stabilization

来源：评论

学校读者我要写书评

暂无评论

A logarithmic complexity divide-and-conquer algorithm for multi-flexible-body dynamics including large deformations

引用

MULTIBODY SYSTEM DYNAMICS 2015年第1期34卷 81-101页

作者： Khan, Imad M. Anderson, Kurt S. Rensselaer Polytech Inst Computat Dynam Lab Dept Mech Aerosp & Nucl Engn Troy NY 12180 USA

A new algorithm is presented for the modeling and simulation of multi-flexible-body systems. This algorithm is built upon a divide-and-conquer-based multibody dynamics framework, and it is capable of handling arbitrary large rotations and deformations in articulated flexible bodies. As such, this work extends the current capabilities of the flexible divide-and-conquer algorithm (Mukherjee and Anderson in Comput. Nonlinear Dyn. 2(1):10-21, 2007), which is limited to the use of assumed modes in a floating frame of reference configuration. The present algorithm utilizes the existing finite element modeling techniques to construct the equations of motion at the element level, as well as at the body level. It is demonstrated that these equations can be assembled and solved using a divide-and-conquer type methodology. In this respect, the new algorithm is applied using the absolute nodal coordinate formulation (ANCF) (Shabana, 1996). The ANCF is selected because of its straightforward implementation and effectiveness in modeling large deformations. It is demonstrated that the present algorithm provides an efficient and robust method for modeling multi-flexible-body systems that employ highly deformable bodies. The new algorithm is tested using three example systems employing deformable bodies in two and three spatial dimensions. The current examples are limited to the ANCF line or cable elements, but the approach may be extended to higher order elements. In its basic form, the divide-and-conquer algorithm is time and processor optimal, yielding logarithmic complexity O(log(N (b) )) when implemented using O(N (b) ) processors, where N (b) is the number of bodies in the system.

关键词： divide-and-conquer algorithm Multi-flexible-body systems Large deformation Large rotation Articulated flexible bodies

来源：评论

学校读者我要写书评

暂无评论

An effective and efficient divide-and-conquer algorithm for energy consumption optimisation problem in long Bernoulli serial lines

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2021年第23期59卷 7018-7036页

作者： Yan, Chao-Bo Zheng, Ziqian Xi An Jiao Tong Univ State Key Lab Mfg Syst Engn Xian 710049 Shaanxi Peoples R China Xi An Jiao Tong Univ Fac Elect & Informat Engn Sch Automat Sci & Engn Xian 710049 Shaanxi Peoples R China Univ Wisconsin Dept Ind & Syst Engn Madison WI USA

Reducing energy consumption in the energy-intensive production systems is of great significance and attracts more and more attention. Although a lot of efforts have been devoted to formulate and solve the energy consumption optimisation problem in the Bernoulli serial lines, existing methods for solving the problem in long Bernoulli lines either cannot obtain the optimal solution or are time-consuming. For this purpose, this paper divides the problem in the long line into a set of problems in two-machine lines and proposes a computationally efficient and globally convergent algorithm to solve it. Extensive numerical experiments show that the proposed algorithm not only can optimally (in the numerical way) solve the energy consumption optimisation problem in long Bernoulli serial lines, but also is orders of magnitude more efficient than existing algorithms.

关键词： Energy reduction continuous improvement divide-and-conquer algorithm computational efficiency production lines

来源：评论

学校读者我要写书评

暂无评论

Exact divide-and-conquer algorithm of multinomial logistic regression for hyperspectral image classification

引用

JOURNAL OF APPLIED REMOTE SENSING 2018年第2期12卷

作者： Wang, Xiaotao Liu, Fang Xidian Univ Sch Comp Sci & Technol Xian Shaanxi Peoples R China

Multinomial logistic regression (MLR) is an effective classifier in spatial-spectral-based hyperspectral image (HSI) classification. However, in some typical scenarios, such as Gaussian regularized MLR (GSMLR) and Laplacian graph regularized MLR (LPMLR), it hits a large (cd) x (cd) linear system during the regressors learning procedure that is unbearable in both space and time complexity (c is the number of classes and d is the length of feature). Even if using middle-sized features, it often runs out of memory. To this end, we propose two exact divide-and-conquer (DC) algorithms, DC-GSMLR and DC-LPMLR, to reduce the computation complexity. Both decompose the regressors learning problem into a series of equivalent smaller subproblems, each of which can be solved in closed form. Unlike the approximation ones available, they provide exact merged solutions instead. With the same accuracy, DC-LPMLR and DC-GSMLR only need to solve c + 1 and 2 d x d linear systems, respectively, significantly reducing the peak memory usage by almost O(c) and O(c(2)/2) times. For time, experiments on two popular HSI datasets indicate considerable speedup ratio as high as one or two orders of magnitude, showing the practicability in real applications. (C) 2018 Society of Photo-Optical Instrumentation Engineers (SPIE)

关键词： divide-and-conquer algorithm hyperspectral image classification fast multinomial logistic regression

来源：评论

学校读者我要写书评

暂无评论

Extension of the divide-and-conquer algorithm for the efficient inverse dynamics analysis of multibody systems

引用

MULTIBODY SYSTEM DYNAMICS 2018年第2期42卷 145-167页

作者： Kingsley, Cameron Poursina, Mohammad Univ Arizona Computat Dynam Complex Syst Lab Dept Aerosp & Mech Engn Tucson AZ 85721 USA

This paper presents a new mathematical framework to extend the Generalized divide-and-conquer algorithm (GDCA) for the inverse dynamics analysis of fully actuated constrained multibody systems. Inverse-GDCA (iGDCA) is a highly parallelizable method which does not create the mass and Jacobian matrices of the entire system. In this technique, generalized driving forces and constraint loads due to kinematic pairs are clearly and separately differentiated from each other in the equations of motion. As such, it can be easily used for control scheme purposes. iGDCA works based on a series of recursive assembly and disassembly passes to form and solve the equations governing the inverse dynamics of the system. Herein, the mathematical formulations to efficiently combine the dynamics of consecutive bodies in the assembly pass for the purpose of inverse dynamics analysis are presented. This is followed by generating the disassembly pass algorithm to efficiently compute generalized actuating forces. Furthermore, this paper presents necessary mathematical formulations to efficiently treat the inverse dynamics of multibody systems involving kinematic loops with various active and passive boundary conditions. This is followed by the design of a new strategy to efficiently perform the assembly-disassembly pass in these complex systems while avoiding unnecessary computations. Finally, the presented method is applied to selected open-chain and closed-chain multibody systems.

关键词： Constrained multibody system divide-and-conquer algorithm Inverse dynamics Control Fully actuated systems Generalized driving force

来源：评论

学校读者我要写书评

暂无评论

Index-3 divide-and-conquer algorithm for efficient multibody system dynamics simulations: theory and parallel implementation

引用

NONLINEAR DYNAMICS 2019年第1期95卷 727-747页

作者： Malczyk, Pawel Fraczek, Janusz Gonzalez, Francisco Cuadrado, Javier Warsaw Univ Technol Inst Aeronaut & Appl Mech Fac Power & Aeronaut Engn Nowowiejska 24 PL-00665 Warsaw Poland Univ A Coruna Lab Ingn Mecan Escuela Politecn Super Mendizabal S-N Ferrol 15403 Spain

There has been a growing attention to efficient simulations of multibody systems, which is apparently seen in many areas of computer-aided engineering and design both in academia and in industry. The need for efficient or real-time simulations requires high-fidelity techniques and formulations that should significantly minimize computational time. Parallel computing is one of the approaches to achieve this objective. This paper presents a novel index-3 divide-and-conquer algorithm for efficient multibody dynamics simulations that elegantly handles multibody systems in generalized topologies through the application of the augmented Lagrangian method. The proposed algorithm exploits a redundant set of absolute coordinates. The trapezoidal integration rule is embedded into the formulation and a set of nonlinear equations need to be solved every time instant. Consequently, the Newton-Raphson iterative scheme is applied to find the system coordinates and joint constraint loads in an efficient and highly parallelizable manner. Two divide-and-conquer-based mass-orthogonal projections are performed then to circumvent the effect of constraint violation errors at the velocity and acceleration level. Sample open- and closed-loop multibody system test cases are investigated in the paper to confirm the validity of the approach. Challenging simulations of multibody systems featuring long kinematic chains are also performed in the work to demonstrate the robustness of the algorithm. The details of OpenMP-based parallel implementation on an eight-core shared memory computer are presented in the text and the parallel performance results are extensively discussed. Significant speedups are obtained for the simulations of small- to large-scale multibody open-loop systems. The mentioned features make the proposed algorithm a good general purpose approach for high-fidelity, efficient or real-time multibody dynamics simulations.

关键词： divide-and-conquer algorithm Multibody dynamics Real-time simulations Mass-orthogonal projections Trapezoidal rule Parallel computing Long chain simulations

来源：评论

学校读者我要写书评

暂无评论

AN ACCELERATED divide-and-conquer algorithm FOR THE BIDIAGONAL SVD PROBLEM

引用

SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS 2014年第3期35卷 1038-1057页

作者： Li, Shengguo Gu, Ming Cheng, Lizhi Chi, Xuebin Sun, Meng Natl Univ Def Technol State Key Lab High Performance Computat Coll Comp Sci Changsha 410073 Hunan Peoples R China Univ Calif Berkeley Dept Math Berkeley CA 94720 USA Natl Univ Def Technol Coll Sci State Key Lab High Performance Computat Changsha 410073 Hunan Peoples R China Chinese Acad Sci Comp Network Informat Ctr Supercomp Ctr Beijing 100190 Peoples R China PLA Univ Sci & Technol Coll Command Informat & Syst Nanjing 210007 Jiangsu Peoples R China

In this paper, aiming at solving the bidiagonal SVD problem, a classical divide-and-conquer (DC) algorithm is modified, which needs to compute the SVD of broken arrow matrices by solving secular equations. The main cost of DC lies in the updating of singular vectors, which involves two matrix-matrix multiplications. We find that the singular vector matrices of a broken arrow matrix are Cauchy-like matrices and have an off-diagonal low-rank property, so they can be approximated efficiently by hierarchically semiseparable (HSS) matrices. Hereby, by using the HSS techniques, the complexity of computing singular vectors can be reduced significantly. An accelerated DC algorithm is proposed, denoted by ADC. Furthermore, we use a structured low-rank approximation method to construct these HSS approximations. Numerous experiments show ADC is both fast and numerically stable. When dealing with large matrices with few deflations, ADC can be 3x faster than DC in the optimized LAPACK libraries such as Intel MKL without any degradation in accuracy. These techniques can be used to similarly solve the symmetric tridiagonal eigenvalue problem.

关键词： divide-and-conquer algorithm bidiagonal matrices HSS matrices Cauchy-like matrices Schur complements

来源：评论

学校读者我要写书评

暂无评论

A divide-and-conquer algorithm FOR CONSTRUCTING RELATIVE NEIGHBORHOOD GRAPH

引用

BIT 1990年第2期30卷 196-206页

作者： HUANG, NF NATL TSING HUA UNIV INST COMP SCIHSINCHU 30043TAIWAN

AnO(n logn) divide-and-conquer algorithm for finding the relative neighborhood graph RNG(V) of a set V ofn points in Euclidean space is presented. If implemented in parallel, its time complexity isO(n) and it requires... 详细信息

关键词： F.2.2 Computational geometry divide-and-conquer algorithm Relative Neighborhood Graph

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：