Combined heat and power (CHP) production is an increasingly important energy production technology. CHP production is usually applied in back pressure plants, where the heat and power generation follows a joint characteristic. A CHP system may also comprise separate heat and power production facilities. Cost-efficient operation of a CHP system can be planned using an optimisation model based on...

The role of cell-mediated protection to herpes simplex infection was studied in vivo and in vitro. Sensitized spleen cells, obtained from syngeneic mice immunized with herpes simplex virus, protected recipient mice against lethal chal lenge with herpes simplex virus. Survival was signifivantly greater in challenged mice that received washed spleen cells from donor animals immunized with herpes ...

The maximum flow problem (MFP) is a fundamental model in operations research. The network simplex algorithm is one of the most efficient solution methods for MFP in practice. The theoretical properties of established pivot algorithms for MFP is less understood. Variants of the primal simplex and dual simplex methods for MFP have been proven strongly polynomial, but no similar result exists for ...

Maximum 200 words) As an emerging effective approach to nonlinear robust control, simplex sliding mode control demonstrates some attractive features not possessed by the conventional sliding mode control method, from both theoretical and practical points of view. However, no systematic approach is currently available for computing the simplex control vectors in nonlinear sliding mode control. I...

This article first presents three-level simplex designs of k+1 runs for k factors. Each simplex design is composed of k treatment combinations from a two-level factorial design, plus an additional base run that represents a third level for each factor. These orthogonal, first-order designs are simple to construct. Furthermore, simplex designs can be augmented to construct second-order simplex s...

Mixed-Initiative Systems (MIS) are hybrid decision systems where collaboration is possible between humans and machines. However, current systems sometimes override user preferences when provided with new ones. We studied linear optimization problems, where the decision maker is specifying preferences for variable values through an iterative process. We proposed a goal programming framework to d...

Parallelizing sparse simplex algorithms is one of the most challenging problems. Because of very sparse matrices and very heavy communication, the ratio of computation to communication is extremely low. It becomes necessary to carefully select parallel algorithms , partitioning patterns, and communication optimization to achieve a speedup. Two implementations on Intel hypercubes are presented i...

In this paper, we examine the effect of dissecting an n-dimensional simplex using cevians (cross-sections passing through n&1 of the vertices of the simplex). We describe a formula for the number of pieces the simplex is dissected into using a polynomial involving only the number of each type of cevian. The polynomial in question involves terms involving the edges of the simplex, but discarding...