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

Dispatching of Wind-Photovoltaic Hybrid Power Systems Based on Bilevel programming and Sparse Optimization

IEEE ACCESS 2024年 12卷 164289-164302页

作者： Hu, Yuyang Wei, Xin Yang, Xiao He, Jinglong Yuan, Shangbin Elect Power Dispatching & Control Ctr Guangxi Powe Nanning 530023 Peoples R China

The volatility of renewable energy poses challenges to the stability and economic benefits of the power grid, as the unstable output of wind and solar energy increases the difficulty of supply-demand balance. To address this issue, optimizing the scheduling strategy of wind-photovoltaic hybrid power generation systems to deal with the uncertainty of renewable energy has become an urgent problem to be addressed. This optimization can not only improve the adaptability of the power grid to fluctuations in renewable energy, but also enhance economic efficiency by reducing reliance on expensive energy storage and backup power sources. The study adopted the methods of bilevel programming and sparse optimization, in which system operators optimize operating costs and system efficiency by adjusting the output ratio of wind-photovoltaic power, energy storage system operation, and grid interaction. The power grid operator adjusted the scheduling plan based on upper level decisions to ensure the stability of the power grid. Sparse optimization techniques were applied to improve the sparsity of solutions and the generalization ability of models. The research results showed that the proposed bilevel programming and sparse optimization strategies performed well in simulation experiments. The SOP-MLP model achieved a recall rate of 0.98 and an precision rate that quickly stabilized at over 90% after 400 training cycles, outperforming traditional MLP, Transformer, SVM, and Extra-Trees models. In the case analysis, the SOP-MLP model effectively reduced abandoned electricity and optimized power resource allocation. In the S1 scenario, the comprehensive dispatch response rates of wind-photovoltaic power reached 94% and 91%, while the expected operating cost of the system was 705600 yuan. The cost-benefit ratio considering scenario probability was 79400 yuan. The study provides a new optimization strategy for power system scheduling, which can effectively handle the uncertainty and com

关键词： Optimization Mathematical models programming Biological system modeling Optimal scheduling Power grids Costs Uncertainty Resource management Renewable energy sources Photovoltaic systems Wind power generation Hybrid power systems Wind-photovoltaic hybrid power system bilevel programming sparse optimization system scheduling renewable energy

来源：评论

学校读者我要写书评

暂无评论

Enabling Service-Oriented programming for Multi-User in Polymorphic Network

引用

IEEE COMMUNICATIONS MAGAZINE 2024年

作者： Cui, Zixi Tian, Le Yi, Peng Hu, Yuxiang Wu, Jiangxing Informat Engn Univ Zhengzhou Peoples R China

Polymorphic networking (PINet) aims to support the coexistence and evolution of diverse services for the multi-user in a unified programmable environment. An efficient programming system plays a crucial role in realizing PINet, by which the network programs are deployed on the underlying heterogeneous devices. This article presents PINet's programming environment (PPE), a service- oriented programming environment for PINet with three major goals, that is, incremental, application- level, and coordination programming. PPE provides a one end-to-end service abstraction that allows programmers to express packet processing logic (e.g., forwarding and computing) without concern for the network topology and hardware details. PPE also proposes a network-wide compiler system with hierarchical architecture to deploy out-of-the-box services for the multi-user. We elaborately describe the PPE's goals, workflow, and challenges for our motivation. Some implementation details and open issues are discussed as future research directions.

关键词： Personal protective equipment programming Hardware Runtime Logic Program processors Codes Field programmable gate arrays Switches Protocols

来源：评论

学校读者我要写书评

暂无评论

Utilization of Information Entropy in Training and Evaluation of Students' Abstraction Performance and Algorithm Efficiency in programming

引用

IEEE TRANSACTIONS ON EDUCATION 2024年第2期67卷 266-281页

作者： Wu, Zengqing Liu, Huizhong Xiao, Chuan Kyoto Univ Grad Sch Informat Kyoto 6068501 Japan Osaka Univ Sch Human Sci Osaka 5650871 Japan Univ Hong Kong Fac Business & Econ Hong Kong Peoples R China Osaka Univ Grad Sch Informat Sci & Technol Osaka 5650871 Japan Nagoya Univ Grad Sch Informat Nagoya 4648601 Japan

Contribution: This research illuminates information entropy's efficacy as a pivotal educational tool in programming, enabling the precise quantification of algorithmic complexity and student abstraction levels for solving P problems. This approach can provide students quantitative, comparative insights into the differences between optimal and student implemented solution, and allowing educators to offer targeted feedback, thereby optimizing the learning and abstraction processes in algorithm design through deliberate practice. Background: Abstraction is considered one of the most important skills in problem solving. Many studies in programming have shown that higher abstraction capability can significantly simplify problems, reduce program complexity and improve efficiency. However, it is difficult to develop criteria to measure the level of abstraction, and there is still a lack of relevant systematic research. Research Questions: 1) How can students' abstraction ability in programming be effectively measured? 2) How to develop programming education and training methods based on the measurement of abstraction ability? Methodology: Forty-six grade 10 students participated in the experiment, divided into two groups for programming training using information-entropy-based assessment and traditional learning methods. Their level of computational thinking, algorithmic efficiency improvements, and test scores were used to measure performance and to analyze the effectiveness of the training methods. Findings: Through empirical research, this article finds that information-entropy-based assessment can reflect the differences in problem solving among students possessing varying capabilities. Information entropy can be crucial for evaluating and improving students' abstraction performance and algorithm efficiency.

关键词： programming programming profession Training Complexity theory Information entropy Software algorithms Systematics Abstraction complexity information entropy programming software engineering (SE) education

来源：评论

学校读者我要写书评

暂无评论

Two-Dimensional Phase Unwrapping for Topography Reconstruction: A Refined Two-Stage programming Approach

引用

IEEE JOURNAL OF SELECTED TOPICS IN APPLIED EARTH OBSERVATIONS AND REMOTE SENSING 2024年 17卷 20304-20314页

作者： Yan, Yan Yu, Hanwen Yang, Taoli Univ Elect Sci & Technol China Sch Resources & Environm Chengdu 611731 Peoples R China

The interferometric synthetic aperture radar (InSAR) is able to reconstruct the Earth's surface topography with a meter-level accuracy when two-dimensional phase unwrapping (PU) is properly implemented. The two-stage programming approach (TSPA) can convert the ill-posed PU problem into a well-posed problem by integrating perpendicular baseline diversity in multiple (>= 2) interferograms, and is currently among the most commonly used multibaseline (MB) PU algorithms. Nevertheless, TSPA still faces two challenges in real-world applications: first, TSPA cannot ensure exceptional performance for any complex topographic scenarios, and second, the PU error of short-baseline interferometric pair tends to propagate into the PU solution of long-baseline interferometric pair, degrading height accuracy. To overcome these issues, a refined TSPA (R-TSPA) MB PU algorithm is proposed in this article. R-TSPA contains two PU procedures under the framework of TSPA, where procedure 1 unwraps the flattened interferograms with TSPA, and procedure 2 re-estimates and reunwraps the erroneous ambiguity number gradients with TSPA. It is demonstrated that R-TSPA outperforms the conventional single-baseline PU algorithms and TSPA with actual InSAR datasets in western Sichuan Province and Tibet Autonomous Region of China, revealing its potentials in accurately mapping topography and broadening application scopes of InSAR.

关键词： Radar imaging Accuracy Earth Synthetic aperture radar Surface topography programming Image reconstruction Surface reconstruction Remote sensing Radar polarimetry Interferometric synthetic aperture radar (InSAR) multbaseline (MB) refined two-stage programming approach (R-TSPA) topography construction two-dimensional phase unwrapping (PU)

来源：评论

学校读者我要写书评

暂无评论

An Improved Lyapunov Stability Test of Equilibria Under Frictional Unilateral Contact by Sums of Squares programming

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2024年第6期69卷 3808-3821页

作者： Varkonyi, Peter L. Budapest Univ Technol & Econ Dept Mech Mat & Struct H-1111 Budapest Hungary

Reliable quasi-static object manipulation and robotic locomotion require the verification of the stability of equilibria under unilateral contacts and friction. In a recent paper, Posa et al. (2016) demonstrated that sums-of-squares (SOS) programming can be used to verify the Lyapunov stability of planar systems via Lyapunov's direct method if impacts are inelastic. However, this method appears to be too conservative to verify the stability of some remarkably simple examples. In this article, an extension of Lyapunov's direct method is proposed, which makes use of a piecewise smooth Lyapunov function and allows a temporary increase of the Lyapunov function along a motion trajectory. In addition, a modified SOS formulation enables the investigation of planar systems with partially elastic contacts. The proposed method remains compatible with SOS programming techniques. The improved stability test is successfully applied to a point mass on a slope and to a rigid body with two contact points. For the latter, several mechanisms of instability have been demonstrated experimentally, but the exact conditions of Lyapunov stability are unknown.

关键词： Lyapunov methods Mathematical models Nickel Friction Stability criteria Standards programming Hybrid dynamics Lyapunov stability semidefinite programming sums-of-squares (SOS) polynomials unilateral contact

来源：评论

学校读者我要写书评

暂无评论

Deep Reinforcement Learning-Assisted Convex programming for AC Unit Commitment and Its Variants

引用

IEEE TRANSACTIONS ON POWER SYSTEMS 2024年第4期39卷 5561-5574页

作者： Sayed, Ahmed Rabee Zhang, Xian Wang, Guibin Wang, Yi Shaaban, Mostafa Shahidehpour, Mohammad Harbin Inst Technol Sch Mech Engn & Automat Shenzhen 518055 Peoples R China Khalifa Univ Dept Elect Engn & Comp Sci Abu Dhabi 127788 U Arab Emirates Cairo Univ Fac Engn Giza 12613 Egypt Shenzhen Univ Coll Mechatron & Control Engn Shenzhen 518060 Peoples R China Amer Univ Sharjah Dept Elect Engn Sharjah 26666 U Arab Emirates IIT ECE Dept Chicago IL 60616 USA

Unit commitment (UC) is one of the core decisions in electricity markets and system planning. Existing optimization methods either use DC approximation of network constraints or decompose and relax them into subproblems, which may lead to suboptimal/infeasible decisions or require execution times longer than those for the industry. Recent advances in machine learning techniques have proven their ability to find fast near-optimal UC decisions. However, they suffer from the curses of dimensionality and/or lack feasibility guarantees. This paper proposes a new hybrid deep reinforcement learning algorithm for the UC problem with AC network constraints (AC-UC). The problem is formulated as a modified-action Markov decision process model and the fundamental soft actor-critic (SAC) algorithm is enhanced to deal with hybrid action spaces. To ensure the solution feasibility, two action filters are designed based on logic constraints of generation units and sequential convex programming for the discrete and continuous actions, respectively. The hybrid SAC is improved by embedding the two filters and a prioritized experience buffer for fast convergence and stable learning. Simulation results on four test systems verify the effectiveness of the proposed approach and the superiority over traditional methods in computational efficiency and feasibility. Moreover, the presented method is extended to solve stochastic UC and security-constraint UC problems.

关键词： Load flow Generators Uncertainty programming Power systems Computational modeling Mathematical models Reinforcement learning convex programming unit commitment optimal power flow uncertainty

来源：评论

学校读者我要写书评

暂无评论

Augmented Reality Creation Platform Based on Graphical programming

引用

IEEE ACCESS 2024年 12卷 14455-14465页

作者： Li, Jinfang Liu, Yongxi Xiao, Libao Cai, Jiahong He, Hanwu Zhang, Xiaowei Guangdong Univ Technol Sch Electromech Engn Guangzhou 510000 Peoples R China Guangdong Polytech Ind & Commerce Guangzhou 510000 Peoples R China

The development of conventional augmented reality (AR) works typically involves complex environment setup, programming development, high costs, and long development cycles, requiring developers to possess certain technical expertise and facing a high entry barrier. To address these challenges and reduce the difficulty of AR work development, this paper proposes a method for creating AR works based on graphical programming. A prototype system is developed to facilitate visual creation. The proposed method involves importing models and AR markers to construct the elements of the work. Subsequently, model parameter variables are designed to enable graphical programming and establish data associations between the work's elements and the logic function algorithm. Additionally, the front-end page layout of the work can be conducted, and the binding of front-end buttons to back-end graphical programming trigger events can be realized. The prototype system is developed using the AR-Foundation and Unity3D engine. Several case studies are presented to demonstrate the feasibility and versatility of this AR creation method.

关键词： programming Image recognition programming profession Feature extraction Visualization Rendering (computer graphics) Engines Augmented reality creation platform graphical programming visual creation

来源：评论

学校读者我要写书评

暂无评论

Propagation and Masking Characteristics of Errors During Software Testing in Synchronous programming

引用

IEEE ACCESS 2024年 12卷 146009-146021页

作者： Kim, Young-Mi Choi, Jin-Young Yoo, Seunghoon Park, Myunghwan Korea Univ Dept Comp & Radio Commun Engn Seoul 02841 South Korea Korea Univ Sch Cybersecur Seoul 02841 South Korea Republ Korea Air Force Acad Dept Comp Sci Cheongju 28187 South Korea

During testing, an error in software can either propagate to the output variables or be masked before it reaches them. Error propagation and masking characteristics are crucial in software testing because they directly influence testing effectiveness. The testing community has hence focused on developing test mechanisms to promote the propagation and reduce masking of errors in software under test. However, little is known about how severely the errors propagate and are masked during software execution. Moreover, little is known about what influences software's propagation and masking characteristics. Thus, in this study, we performed experiments to investigate the behavior of errors during software execution. We chose six case examples and created mutants per case example by seeding an error into each one. We then executed the mutants with randomly selected test cases and investigated how many errors were propagated and masked. If an error was masked, we examined the cause. In addition, we investigated what percentage of errors in the mutants reached the output variables. This study provides insight into the characteristics of errors in terms of propagation and masking, which will help testers design test inputs and choose monitoring variables to properly handle the masking of errors during testing.

关键词： Software Testing Measurement uncertainty programming Monitoring Software measurement Computer languages Software testing Java Sensitivity analysis Error masking error propagation synchronous programming Lustre language mutant generation test cases

来源：评论

学校读者我要写书评

暂无评论

A Second-Order Cone programming (SOCP) Based Optimal Power Flow (OPF) Model With Cyclic Constraints for Power Transmission Systems

引用

IEEE TRANSACTIONS ON POWER SYSTEMS 2024年第1期39卷 1032-1043页

作者： Chowdhury, Md Mahmud-Ul-Tarik Kamalasadan, Sukumar Paudyal, Sumit Univ North Carolina Charlotte Dept Elect Engn Charlotte NC 28262 USA Florida Int Univ Dept Elect Engn Miami FL 33174 USA

For meshed power networks, even though the conic relaxation is shown to be exact, the relaxation of angles may not be exact using the existing Second-Order Cone programming (SOCP) based optimal power flow (OPF) models. Power transmission networks generally have meshed orientation, and the cyclic angle constraints are not satisfied with the existing SOCP-OPF models. This work proposes a SOCP-OPF model for power transmission networks that satisfies the cyclic angle constraints for any mesh in the network. The novelty of the proposed OPF model is that it defines a convex envelope to represent the relative bus voltage angles that satisfy the cyclic constraint criteria for a meshed network. The proposed SOCP-OPF model is tested on the IEEE 14-bus, 57-bus, 118-bus, 500-bus, and 2736-bus networks. The case studies demonstrate that the proposed model is computationally efficient and scalable for large transmission networks compared to the Nonlinear programming (NLP) and semi-definite programming (SDP) counterparts.

关键词： Voltage Mathematical models Load flow Computational modeling programming Reactive power Load modeling Optimal power flow (OPF) convex relaxation second-order conic programming (SOCP) cyclic constraints transmission networks

来源：评论

学校读者我要写书评

暂无评论

Warm Start of Interior-Point Methods Applied to Sequential Convex programming

引用

IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS 2024年第4期60卷 3837-3846页

作者： Morelli, Andrea Carlo Hofmann, Christian Topputo, Francesco Politecn Milan Dept Aerosp Sci & Technol I-20158 Milan Italy MIT Dept Aeronaut & Astronaut Cambridge MA 02139 USA

Sequential convex programming (SCP) is an iterative technique that solves nonconvex optimization problems by considering a sequence of convex subproblems whose solutions eventually converge, under certain conditions, to the solution of the original problem. The most common convex solvers divide in interior-point, first-order, and active-set methods. In particular, the former have shown good performance. Even though SCP is quite efficient in terms of required computational time with respect to standard nonlinear optimization solvers, its potential is still not completely exploited when interior-point convex solvers are used as no information on the solution of a previous convex subproblem is used to construct the initial guess for the strictly related following one. This is because interior-point methods are notoriously difficult to warm start. In this article, a technique to warm start interior-point methods that solve second-order cone programs (SOCP) is developed and integrated within the SCP. The strategy can be used independently of the specific problem as long as it is expressed as a standard SOCP. The low-thrust space trajectory optimization problem is considered to assess the efficacy of the proposed strategy through extensive numerical simulations. It is shown that the warm-start algorithm outperforms the standard algorithm in terms of computational time and overall convergence when the widely used solver ECOS is used.

关键词： programming Vectors Aerospace and electronic systems Trajectory optimization Convex functions Task analysis Standards

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：