CleanTX Analysis on the Smart Grid

The utility industry in the United States has an opportunity to revolutionize its electric grid system by utilizing emerging software, hardware and wireless technologies and renewable energy sources. As electricity generation in the U.S. increases by over 30% from today’s generation of 4,100 Terawatt hours per year to a production of 5,400 Terawatt hours per year by 2030, a new type of grid is necessary to ensure reliable and quality power. The projected U.S. population increase and economic growth will require a grid that can transmit and distribute significantly more power than it does today. Known as a Smart Grid, this system enables two- way transmission of electrons and information to create a demand-response system that will optimize electricity delivery to consumers. This paper outlines the issues with the current grid infrastructure, discusses the economic advantages of the Smart Grid for both consumers and utilities, and examines the emerging technologies that will enable cleaner, more efficient and cost- effective power transmission and consumption.IC2 Institut

Behavioral types in programming languages

A recent trend in programming language research is to use behav- ioral type theory to ensure various correctness properties of large- scale, communication-intensive systems. Behavioral types encompass concepts such as interfaces, communication protocols, contracts, and choreography. The successful application of behavioral types requires a solid understanding of several practical aspects, from their represen- tation in a concrete programming language, to their integration with other programming constructs such as methods and functions, to de- sign and monitoring methodologies that take behaviors into account. This survey provides an overview of the state of the art of these aspects, which we summarize as the pragmatics of behavioral types

Power, Responsibility, and Accountability: Re-Thinking the Legitimacy of Institutions for Climate Finance

Offers lessons from current mechanisms to finance climate mitigation and adaptation and considerations for legitimacy in new ones: the capacity to determine outcomes, the exercise of power as intended, and standards and systems to ensure accountability

Annual report 1992 - North Pacific Marine Science Organization (PICES). First meeting, Victoria, B.C., Canada, October 12-17, 1992

Document has 52 pages

Monitoring and controlling distributed applications using Lomita (position paper)

Over the last four years, the Meta toolkit was developed for controlling distributed applications. This toolkit has been publicly available as part of the academic ISIS release, and has been used for building various system monitoring and control applications. One major stumbling block with using Meta has been the language (called NPL) it supports. NPL is very low-level and using it is difficult, in the same way it is difficult to write machine language programs or raw Postscript programs. Hence, a higher level language was built along with a runtime environment. The hope is that with this higher-level approach, more complicated Meta applications will be written and thereby concentrate more on the use (and limitations) of Meta as an architecture. The Meta toolkit is reviewed with its intended use. Next, the goals with Lomita and an overview is given of its architecture and language syntax. A detailed example is given of Lomita's use by presenting a complete program for a load-adaptable service

A Fast Compiler for NetKAT

High-level programming languages play a key role in a growing number of networking platforms, streamlining application development and enabling precise formal reasoning about network behavior. Unfortunately, current compilers only handle "local" programs that specify behavior in terms of hop-by-hop forwarding behavior, or modest extensions such as simple paths. To encode richer "global" behaviors, programmers must add extra state -- something that is tricky to get right and makes programs harder to write and maintain. Making matters worse, existing compilers can take tens of minutes to generate the forwarding state for the network, even on relatively small inputs. This forces programmers to waste time working around performance issues or even revert to using hardware-level APIs. This paper presents a new compiler for the NetKAT language that handles rich features including regular paths and virtual networks, and yet is several orders of magnitude faster than previous compilers. The compiler uses symbolic automata to calculate the extra state needed to implement "global" programs, and an intermediate representation based on binary decision diagrams to dramatically improve performance. We describe the design and implementation of three essential compiler stages: from virtual programs (which specify behavior in terms of virtual topologies) to global programs (which specify network-wide behavior in terms of physical topologies), from global programs to local programs (which specify behavior in terms of single-switch behavior), and from local programs to hardware-level forwarding tables. We present results from experiments on real-world benchmarks that quantify performance in terms of compilation time and forwarding table size