A survey of advanced battery systems for space applications

The results of a survey on advanced secondary battery systems for space applications are presented. Fifty-five battery experts from government, industry and universities participated in the survey by providing their opinions on the use of several battery types for six space missions, and their predictions of likely technological advances that would impact the development of these batteries. The results of the survey predict that only four battery types are likely to exceed a specific energy of 150 Wh/kg and meet the safety and reliability requirements for space applications within the next 15 years

A survey of advanced battery systems for space applications

The results of a survey on advanced secondary battery systems for space applications are presented. The objectives were: to identify advanced battery systems capable of meeting the requirements of various types of space missions, with significant advantages over currently available batteries, to obtain an accurate estimate of the anticipated improvements of these advanced systems, and to obtain a consensus for the selection of systems most likely to yield the desired improvements. Few advanced systems are likely to exceed a specific energy of 150 Wh/kg and meet the additional requirements of safety and reliability within the next 15 years. The few that have this potential are: (1) regenerative fuel cells, both alkaline and solid polymer electrolyte (SPE) types for large power systems; (2) lithium-intercalatable cathodes, particularly the metal ozides intercalatable cathodes (MnO2 or CoO2), with applications limited to small spacecrafts requiring limited cycle life and low power levels; (3) lithium molten salt systems (e.g., LiAl-FeS2); and (4) Na/beta Alumina/Sulfur or metal chlorides cells. Likely technological advances that would enhance the performance of all the above systems are also identified, in particular: improved bifunctional oxygen electrodes; improved manufacturing technology for thin film lithium electrodes in combination with polymeric electrolytes; improved seals for the lithium molten salt cells; and improved ceramics for sodium/solid electrolyte cells

Automation of Diagrammatic Proofs in Mathematics

Theorems in automated theorem proving are usually proved by logical formal proofs. However, there is a subset of problems which can also be proved in a more informal way by the use of geometric operations on diagrams, so called diagrammatic proofs. Insight is more clearly perceived in these than in the corresponding logical proofs: they capture an intuitive notion of truthfulness that humans find easy to see and understand. The proposed research project is to identify and ultimately automate this diagrammatic reasoning on mathematical theorems. The system that we are in the process of implementing will be given a theorem and will (initially) interactively prove it by the use of geometric manipulations on the diagram that the user chooses to be the appropriate ones. These operations will be the inference steps of the proof. The constructive !-rule will be used as a tool to capture the generality of diagrammatic proofs. In this way, we hope to verify and to show that the diagra..

Searching for a Solution to Program Verification=Equation Solving in CCS

International audienceUnder non-exponential discounting, we develop a dynamic theory for stopping problems in continuous time. Our framework covers discount functions that induce decreasing impatience. Due to the inherent time inconsistency, we look for equilibrium stopping policies, formulated as fixed points of an operator. Under appropriate conditions, fixed-point iterations converge to equilibrium stopping policies. This iterative approach corresponds to the hierarchy of strategic reasoning in game theory and provides “agent-specific” results: it assigns one specific equilibrium stopping policy to each agent according to her initial behavior. In particular, it leads to a precise mathematical connection between the naive behavior and the sophisticated one. Our theory is illustrated in a real options model

Middle-Out Reasoning for Logic Program Synthesis

We propose a novel approach to automating the synthesis of logic programs: Logic programs are synthesized as a by-product of the planning of a verification proof. The approach is a two-level one: At the object level, we prove program verification conjectures in a sorted, first-order theory. The conjectures are of the form 8args \Gamma\Gamma\Gamma\Gamma! : prog(args \Gamma\Gamma\Gamma\Gamma! ) $ spec(args \Gamma\Gamma\Gamma\Gamma! ). At the meta-level, we plan the object-level verification with an unspecified program definition. The definition is represented with a (second-order) meta-level variable, which becomes instantiated in the course of the planning