Optimum load scheduling of nuclear-hydro-thermal power systems

This paper considers the problem of short-term optimal operation of nuclear-hydro-thermal electric power systems. The solution is obtained by use of a functional analytic optimization technique that employs the minimum norm formulation.A power system with an arbitrary number of generating stations is considered. The limited flexibility exhibited by the thermal nuclear reactors, when operating in a load-following mode, is accounted for by means of a model of the xenon concentration in their cores. The nonlinear effects induced by trapezoidal water reservoirs and the time delay of the water flow between upstream and downstream hydroplants is taken into consideration as well.A two-level iterative scheme of the feasible type is proposed for implementing the optimal solution.This work was supported in part by the National Research Council of Canada, Grant No. A-4146.     

Thapsigargin,constitution of a sesquiterpene lactone histamine liberator from thapsia garganica

The major skin irritating constituent of the root of Thapsia garganica L. has been shown to be a hexaoxygenated-C₆-guaianolide esterificated with four carboxylic acids.     

On the decay of θ mesons in charmonium models

We derive a new formula for the decay rate of the ψ mesons by properly treating the dependence of lowest order electromagnetic annihilation on the quark-antiquark bound state wave function. Results are presented for currently used non-relativistic potentials models for charmonium. In all cases substantial corrections to previous estimates from commonly used formulas occur. Our results are of relevance also for hadronic decay via gluons in QCD and weak decay of pseudoscalar mesons.     

Lower bounds on the cover-index of a graph

In this paper we give some new lower bounds for the cover-index of graphs with multiple edges permitted. The results are analogous to upper bounds for the chromatic index. We show that a simple graph with cover-index different from the minimum degree has at least three vertices of minimum degree. This implies that almost all simple graphs have cover-index equal to the minimum degree.