Advanced Nuclear Energy Systems: Heat Transfer Issues and Trends

Almost 450 nuclear power plants are currently operating throughout the world and supplying about 17% of the world’s electricity. These plants perform safely, reliably, and have no free-release of byproducts to the environment. Given the current rate of growth in electricity demand and the ever growing concerns for the environment, the US consumer will favor energy sources that can satisfy the need for electricity and other energy-intensive products (1) on a sustainable basis with minimal environmental impact, (2) with enhanced reliability and safety and (3) competitive economics. Given that advances are made to fully apply the potential benefits of nuclear energy systems, the next generation of nuclear systems can provide a vital part of a long-term, diversified energy supply. The Department of Energy has begun research on such a new generation of nuclear energy systems that can be made available to the market by 2030 or earlier, and that can offer significant advances toward these challenging goals [1]. These future nuclear power systems will require advances in materials, reactor physics as well as heat transfer to realize their full potential. In this paper, a summary of these advanced nuclear power systems is presented along with a short synopsis of the important heat transfer issues. Given the nature of research and the dynamics of these conceptual designs, key aspects of the physics will be provided, with details left for the presentation.

Incremental Verification of Timing Constraints for Real-Time Systems

Testing constraints for real-time systems are usually verified through the satisfiability of propositional formulae. In this paper, we propose an alternative where the verification of timing constraints can be done by counting the number of truth assignments instead of boolean satisfiability. This number can also tell us how “far away” is a given specification from satisfying its safety assertion. Furthermore, specifications and safety assertions are often modified in an incremental fashion, where problematic bugs are fixed one at a time. To support this development, we propose an incremental algorithm for counting satisfiability. Our proposed incremental algorithm is optimal as no unnecessary nodes are created during each counting. This works for the class of path RTL. To illustrate this application, we show how incremental satisfiability counting can be applied to a well-known rail-road crossing example, particularly when its specification is still being refined.

The Complexity of Safety Stock Placement in General-Network Supply Chains

We consider the optimization problem of safety stock placement in a supply chain, as formulated in [1]. We prove that this problem is NP-Hard for supply chains modeled as general acyclic networks. Thus, we do not expect to find a polynomial-time algorithm for safety stock placement for a general-network supply chain.