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

Robust regional low-carbon electricity system planning with energy-water nexus under uncertainties and complex policy guidelines

引用

JOURNAL OF CLEANER PRODUCTION 2020年 252卷 119800-119800页

作者： Ji, Ling Zhang, Beibei Huang, Guohe Cai, Yanpeng Yin, Jianguang Beijing Univ Technol Sch Econ & Management 100 Ping Le Yuan Beijing 100124 Peoples R China Beijing Univ Technol Coll Econ & Management Res Base Beijing Modern Mfg Dev Beijing 100124 Peoples R China Univ Regina Environm Syst Engn Program Fac Engn Regina SK S4S 0A2 Canada Guangdong Univ Technol Sch Environm Environm & Ecol Engn Inst Guangzhou 510006 Guangdong Peoples R China State Grid Shandong Elect Power Res Inst Jinan 25002 Shandong Peoples R China

This paper develops an interval multi-stage robust programming model for regional low-carbon electric power system planning with energy-water nexus. The model integrates interval programming and multi-stage stochastic programming to handle uncertainties with different probability distribution information. In addition, under the framework of robust programming, the optimal solutions could provide tradeoff information between system cost and decision maker's risk preference. The hybrid programming method is tailored for a case study of Shandong Province, China to validate its applicability and provide useful managerial insights, where energy-water interactions are gain great concerns. The model helps to make robust strategies associated with risk control for capacity expansion, carbon capture and storage (CCS) technology retrofitting, power generation, imported electricity, and water allocation for electricity generation, with the goal of minimizing total cost. Besides, considering the variation of water resource conditions and environmental policies under climate change, the impacts of water resource availability and carbon emission caps on regional electric power system planning are explored and discussed. It is found that stricter carbon emission cap policy would facilitate the investment on CCS devices but have little impact on the installed capacity structure, meanwhile it would increase water consumption per power generation. However, scarcer water resource situation would promote the development of renewable energy generation, and limit the investment on CCS technology. (C) 2019 Elsevier Ltd. All rights reserved.

关键词： Energy-water nexus Power system planning multi-stage programming Uncertainties Robust

来源：评论

学校读者我要写书评

暂无评论

Development and application of a multi-stage CCUS source-sink matching model

引用

APPLIED ENERGY 2017年 185卷 1424-1432页

作者： Sun, Liang Chen, Wenying Tsinghua Univ Inst Nucl & New Energy Technol Inst Energy Environm & Econ Beijing 100084 Peoples R China Civil Aviat Management Inst China Dept Gen Aviat Beijing Peoples R China

To achieve the targets in the Paris Climate Change Agreement, carbon capture, utilization and storage (CCUS) will be one of the critical carbon mitigation technologies. For China, the biggest carbon emitter with coal-dominated energy structure, CCUS is expected to play more and more important roles for carbon emissions reduction. This paper looks at a method for designing a pipeline network system for large-scale CO2 capture, utilization, and storage (CCUS) in China. On the basis of performing a moderately significant literature review of past papers and models dating back to the early 2000's, a updated multi-stage mixed integer programming (MIP) model for carbon source and sink matching (SSM) in ChinaCCUS DSS (Decision Support System) is developed. The Jing-Jin-Ji (Beijing-Tianjin-Hebei) region suffering from increasingly serious air pollution is chose as a case study to address the SSM issue with application of the updated model. The modeling results show that around 2200 km pipeline with investment of around $1.6 billion needed to be built to transport the cumulative sequestrated emissions of 1620 Mt CO2 in the planning period of 2020-2050. Compared to the single-stage programming, the multi-stage programming could result to better pipeline connectivity. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： Carbon capture Utilization and storage Source-sink matching Pipeline network Decision support system multi-stage programming

来源：评论

学校读者我要写书评

暂无评论

Scenario-based probabilistic multi-stage optimization for transmission expansion planning incorporating wind generation integration

引用

ELECTRIC POWER SYSTEMS RESEARCH 2020年 189卷 106601-106601页

作者： Taherkhani, Morteza Hosseini, Seyed Hamid Javadi, Mohammad Sadegh Catalao, Joao P. S. Islamic Azad Univ Dept Elect Engn West Tehran Branch Tehran Iran Sharif Univ Technol Dept Elect Engn Tehran Iran Inst Syst & Comp Engn Technol & Sci INESC TEC Porto Portugal Univ Porto FEUP Fac Engn Porto Portugal

Integrated transmission expansion planning (TEP) and generation expansion planning (GEP) with Wind Farms (WFs) is addressed in this paper. The optimal number of expanded lines, the optimal capacity of WFs installed capacity, and the optimal capacity of wind farms lines (WFLs) are determined through a new TEP optimization model. Furthermore, the optimum capacity additions including conventional generating units is obtained in the proposed model. The Benders decomposition approach is used for solving the optimization problem, including a master problem and two sub-problems with internal scenario analysis. In order to reduce the computational burden of the multi-year and multi-objective expansion planning problem, a multi-stage framework is presented in this paper. The uncertainties of wind speed and system demand along with contingency scenarios lead to a probabilistic optimization problem. Moreover, in the proposed model, the planning time horizon is divided into three predefined stages. This multi-stage approach is used to increase the proposed model accuracy in a power system with a high level of wind power penetration. Hence, in this paper a scenario-based probabilistic multistage model for transmission expansion planning is proposed, incorporating optimal WFs integration. It is recognized that high wind penetration increases the transmission expansion investment cost, but based on the reduction of the investment cost of conventional units, the total system cost will be smaller. This result emphasizes the main advantage of wind generating system over the conventional generating system. This planning methodology is applied to the modified IEEE 24-bus test system and simplified Iran 400-kV real system to show the feasibility of the proposed algorithm.

关键词： Benders decomposition multi-objective optimization multi-stage programming Transmission expansion planning Wind farm integration

来源：评论

学校读者我要写书评

暂无评论

Coordination of Distribution Network Reinforcement and DER Planning in Competitive Market

引用

IEEE TRANSACTIONS ON SMART GRID 2021年第3期12卷 2261-2271页

作者： Xiao, Xuanyi Wang, Feng Shahidehpour, Mohammad Li, Zhiyi Yan, Mingyu Hunan Univ Coll Elect & Informat Engn Changsha 410082 Hunan Peoples R China IIT Robert W Galvin Ctr Elect Innovat Chicago IL 60616 USA Zhejiang Univ Coll Elect Engn Hangzhou 310027 Peoples R China

Since distributed energy resources (DERs) can provide capacity in distribution system, distribution network reinforcement interacts with DER planning (DERP) for meeting load growth. This article proposes the coordination of distribution network reinforcement and DER planning in competitive market. The model is formulated as a multi-stage programming. In first stage, distribution companies (DISCOs) and DER aggregators (DERAs) make bidding plans for network reinforcements and DERP. In second stage, DSO checks the network security. If the check fails, DSO sends capacity signals to DISCOs and DERAs for more capacities. In third stage, the distributed market is cleared by DSO's optimal operation problem and distribution locational marginal price (DLMP) is returned to DERAs as price signal. An iterative algorithm is proposed to solve the multi-stage model. The algorithm embodies the process of information interaction among DISCOs, DERAs, and DSO, where DISCOs and DERAs compete in capacity market under DSO's supervision. Numerical results on IEEE 33-system and an actual 141-bus system demonstrate that the proposed model coordinates distribution network reinforcement and DERP in competitive market.

关键词： Planning Investment Load modeling Distributed power generation Capacity planning Security programming Distribution network network reinforcement distributed energy resource (DER) competitive electricity market multi-stage programming

来源：评论

学校读者我要写书评

暂无评论

Combinators for impure yet hygienic code generation

引用

SCIENCE OF COMPUTER programming 2015年第Part2期112卷 120-144页

作者： Kameyama, Yukiyoshi Kiselyov, Oleg Shan, Chung-chieh [a] Tsukuba Japan[b] Sendai Japan[c] Bloomington IN USA

Code generation is the leading approach to making high-performance software reusable. Effects are indispensable in code generators, whether to report failures or to insert let-statements and if-guards. Extensive painful experience shows that unrestricted effects interact with generated binders in undesirable ways to produce unexpectedly unbound variables, or worse, unexpectedly bound ones. These subtleties hinder domain experts in using and extending the generator. A pressing problem is thus to express the desired effects while regulating them so that the generated code is correct, or at least correctly scoped, by construction. We present a code-combinator framework that lets us express arbitrary monadic effects, including mutable references and delimited control, that move open code across generated binders. The static types of our generator expressions not only ensure that a well-typed generator produces well-typed and well-scoped code. They also express the lexical scopes of generated binders and prevent mixing up variables with different scopes. For the first time ever we demonstrate statically safe and well-scoped loop interchange and constant factoring from arbitrarily nested loops. Our framework is implemented as a Haskell library that embeds an extensible typed higher-order domain-specific language. It may be regarded as 'staged Haskell.' To become practical, the library relies on higher-order abstract syntax and polymorphism over generated type environments, and is written in a mature language. (C) 2015 Elsevier B.V. All rights reserved.

关键词： multi-stage programming Mutable state and control effects CPS Higher-order abstract syntax Lexical scope

来源：评论

学校读者我要写书评

暂无评论

MetaOCaml server pages: Web publishing as staged computation

引用

SCIENCE OF COMPUTER programming 2006年第1期62卷 66-84页

作者： League, Christopher Long Isl Univ Brooklyn NY 11201 USA

Modem dynamic web services are really computer programs. Some parts of these programs run off-line, others run server-side on each request, and still others run within the browser. In other words, web publishing is staged computation, either for better performance, or because certain resources are available in one stage but not another. Unfortunately, the various web programming languages make it difficult to spread computation over more than one stage. This is a tremendous opportunity for multi-stage languages in general, and for MetaOCaml in particular. We present the design of MetaOCan-fl Server Pages. Unlike other languages in its genre, the embedded MetaOCaml code blocks may be annotated with staging information, so that the programmer may safely and precisely control which computation occurs in which stage. A prototype web server, written in OCaml, supports web sites with both static and dynamic content. We provide several sample programs and demonstrate the performance gains won using multi-stage programming. (c) 2006 Elsevier B.V. All rights reserved.

关键词： multi-stage programming web services

来源：评论

学校读者我要写书评

暂无评论

In search of a program generator to implement generic transformations for high-performance computing

引用

SCIENCE OF COMPUTER programming 2006年第1期62卷 25-46页

作者： Cohen, Albert Donadio, Sebastien Garzaran, Maria-Jesus Herrmann, Christoph Kiselyov, Oleg Padua, David INRIA Futurs ALCHEMY Grp Orsay France Univ Versailles PRiSM F-78000 Versailles France Univ Illinois DCS Urbana IL 61801 USA Univ Passau FMI D-8390 Passau Germany FNMOC Monterey CA USA

The quality of compiler-optimized code for high-performance applications is far behind what optimization and domain experts can achieve by hand. Although it may seem surprising at first glance, the performance gap has been widening over time, due to the tremendous complexity increase in microprocessor and memory architectures, and to the rising level of abstraction of popular programming languages and styles. This paper explores in-between solutions, neither fully automatic nor fully manual ways to adapt a computationally intensive application to the target architecture. By mimicking complex sequences of transformations useful to optimize real codes, we show that generative programming is a practical means to implement architecture-aware optimizations for high-performance applications. This work explores the promises of generative programming languages and techniques for the high-performance computing expert. We show that complex, architecture-specific optimizations can be implemented in a type-safe, purely generative framework. Peak performance is achievable through the careful combination of a high-level, multi-stage evaluation language - MetaOCaml with low-level code generation techniques. Nevertheless, our results also show that generative approaches for high-performance computing do not come without technical caveats and implementation barriers concerning productivity and reuse. We describe these difficulties and identify ways to hide or overcome them, from abstract syntaxes to heterogeneous generators of code generators, combining high-level and type-safe multi-stage programming with a back-end generator of imperative code. (c) 2006 Elsevier B.V. All rights reserved.

关键词： multi-stage programming loop transformations adaptive libraries application-specific program generators

来源：评论

学校读者我要写书评

暂无评论

flap: A Deterministic Parser with Fused Lexing

引用

PROCEEDINGS OF THE ACM ON programming LANGUAGES-PACMPL 2023年第PLDI期7卷 1194-1217页

作者： Yallop, Jeremy Xie, Ningning Krishnaswami, Neel Univ Cambridge Cambridge England Univ Toronto Toronto ON Canada

Lexers and parsers are typically defined separately and connected by a token stream. This separate definition is important for modularity and reduces the potential for parsing ambiguity. However, materializing tokens as data structures and case-switching on tokens comes with a cost. We show how to fuse separately-defined lexers and parsers, drastically improving performance without compromising modularity or increasing ambiguity. We propose a deterministic variant of Greibach Normal Form that ensures deterministic parsing with a single token of lookahead and makes fusion strikingly simple, and prove that normalizing context free expressions into the deterministic normal form is semantics-preserving. Our staged parser combinator library, flap, provides a standard interface, but generates specialized token-free code that runs two to six times faster than ocamlyacc on a range of benchmarks.

关键词： parsing lexing multi-stage programming optimization fusion

来源：评论

学校读者我要写书评

暂无评论

Compiling Symbolic Execution with Staging and Algebraic Effects

引用

PROCEEDINGS OF THE ACM ON programming LANGUAGES-PACMPL 2020年第OOPSLA期4卷 1–33页

作者： Wei, Guannan Bracevac, Oliver Tan, Shangyin Rompf, Tiark Purdue Univ Dept Comp Sci 610 Purdue Mall W Lafayette IN 47907 USA

Building effective symbolic execution engines poses challenges in multiple dimensions: an engine must correctly model the program semantics, provide flexibility in symbolic execution strategies, and execute them efficiently. This paper proposes a principled approach to building correct, flexible, and efficient symbolic execution engines, directly rooted in the semantics of the underlying language in terms of a high-level definitional interpreter. The definitional interpreter induces algebraic effects to abstract over semantic variants of symbolic execution, e.g., collecting path conditions as a state effect and path exploration as a nondeterminism effect. Different handlers of these effects give rise to different symbolic execution strategies, making execution strategies orthogonal to the symbolic execution semantics, thus improving flexibility. Furthermore, by annotating the symbolic definitional interpreter with binding-times and specialising it to the input program via the first Futamura projection, we obtain a "symbolic compiler", generating efficient instrumented code having the symbolic execution semantics. Our work reconciles the interpretation- and instrumentation-based approaches to building symbolic execution engines in a uniform framework. We illustrate our approach on a simple imperative language step-by-step and then scale up to a significant subset of LLVM IR. We also show effect handlers for common path selection strategies. Evaluating our prototype's performance shows speedups of 10 similar to 30x over the unstaged counterpart, and 2x over KLEE, a state-of-the-art symbolic interpreter for LLVM IR.

关键词： symbolic execution definitional interpreters multi-stage programming algebraic effects

来源：评论

学校读者我要写书评

暂无评论

Static stages for Heterogeneous programming

引用

PROCEEDINGS OF THE ACM ON programming LANGUAGES-PACMPL 2017年第OOPSLA期1卷 1-27页

作者： Sampson, Adrian McKinley, Kathryn S. Mytkowicz, Todd Cornell Univ Dept Comp Sci Gates Hall Ithaca NY 14853 USA Google 1600 Amphitheatre Pkwy Mountain View CA 94043 USA Microsoft Res 1 Microsoft Way Redmond WA 98052 USA

Heterogeneous hardware is central to modern advances in performance and efficiency. Mainstream programming models for heterogeneous architectures, however, sacrifice safety and expressiveness in favor of low-level control over performance details. The interfaces between hardware units consist of verbose, unsafe APIs;hardware-specific languages make it difficult to move code between units;and brittle preprocessor macros complicate the task of specializing general code for efficient accelerated execution. We propose a unified low-level programming model for heterogeneous systems that offers control over performance, safe communication constructs, cross-device code portability, and hygienic metaprogramming for specialization. The language extends constructs from multi-stage programming to separate code for different hardware units, to communicate between them, and to express compile-time code optimization. We introduce static staging, a different take on multi-stage programming that lets the compiler generate all code and communication constructs ahead of time. To demonstrate our approach, we use static staging to implement BraidGL, a real-time graphics programming language for CPU-GPU systems. Current real-time graphics software in OpenGL uses stringly-typed APIs for communication and unsafe preprocessing to generate specialized GPU code variants. In BraidGL, programmers instead write hybrid CPU-GPU software in a unified language. The compiler statically generates target-specific code and guarantees safe communication between the CPU and the graphics pipeline stages. Example scenes demonstrate the language's productivity advantages: BraidGL eliminates the safety and expressiveness pitfalls of OpenGL and makes common specialization techniques easy to apply. The case study demonstrates how static staging can express core placement and specialization in general heterogeneous programming.

关键词： multi-stage programming heterogeneous programming graphics programming OpenGL

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：