Heat output as a bio-marker of the dimethyl sulfoxide-induced decrease in rat hepatoma cell metabolism in vitro

Dimethyl sulfoxide (DMSO) is widely and routinely used as a vehicle in various investigations, especially within the pharmaceutical industry. It has been used for the evaluation of the effects of hydrophobic xenobiotics on cells, as well as for the cryopreservation of biological material. Isothermal microcalorimetry is a powerful tool for monitoring heat production, which is a function of general cellular metabolic activity. Employing this microcalorimetric technique, a low concentration of DMSO routinely used for the addition of hydrophobic substances to, e.g., cell cultures, was shown to decrease heat production (per unit DNA) by the rat hepatoma cell lines FAO, Morris 7800C1 and H4IIE by 32–38%. However, such low concentrations of DMSO did not influence the cell cycle or the degree of apoptosis in these cell populations. Caution is thus advisable when utilizing DMSO as a vehicle in cell culture experiments.     

A new branching strategy for time constrained routing problems with application to backhauling

In this paper, we explore a new branching strategy for branch-and-bound approaches based on column generation for the vehicle routing problems with time windows. This strategy involves branching on resource variables (time or capacity) rather than on network flow variables. We also examine criteria for selecting network nodes for branching. To test the effectiveness of the branching strategy, we conduct computational experiments on time window constrained vehicle routing problems where backhauling is permitted only after all the shipments to clients have been made. The branching method proved very effective. In cases where time was the more binding constraint, time-based branching succeeded in decreasing the number of nodes explored by two thirds and the total computation time by more than half when compared to flow-based branching. The computational results also show that the overall algorithm was successful in optimally solving problems with up to 100 customers. It produced an average cost decrease of almost 7% when backhauling was permitted as compared to the cost involved when the client and the distributor routes were distinct.     

The adjacency relation on the traveling salesman polytope is NP-Complete

We consider the problem of determining whether two traveling salesman tours correspond to non-adjacent vertices of the convex polytope associated with the traveling salesman problem. This problem is shown to be NP-Complete for both the symmetric and nonsymmetric traveling salesman problem. Several implications are discussed.This Research was supported by NSF Grant GK-420488, the U.S. Army Research Office-Durham under Grant DAHC04-75-G0192, and an IBM Fellowship.     

WDM网络中的一个改进的最优半光通道路由算法

本文在一个限定的条件下，提出了一个WDM网络中的寻找最优半光通道算法，使时间复杂度从O（k^2n km knlog(kn))提高到O（k^2n km nlogn)。     

A note on solution of large sparse maximum entropy problems with linear equality constraints

This paper describes a method to solve large sparse maximum entropy problems with linear equality constraints using Newtons and the conjugate gradient method. A numerical example is given to introduce the reader to possible applications of entropy models and this method. Some experience from large scale problems is also reported.     

Mild Integrated C-existence Families and Abstract Cauchy Problems

in this paper, we first give a Hille-Yosida type sufficient and necessary conditionfor n-times integrated mild C-existence families. Then, we present a Laplace type sufficientand necessary condition for exponentially bounded n-times integrated C-semigrougs, andstudy the relationship between integrated regularized semigroups and general regularizedsemigroups. Finally, we offer a characterization of integrated C-semigroups in terms of thesolvability of abstract Cauchy problems.     

A General Gordan Alternative Theorem with Weakened Convexity and Its Application

In this paper, we present a general Gordan alternative theorem for presubconvexlike functions in a Hausdorff topological linear space. This is then applied to discuss the saddle point theorem, concave-convex condition and minimax theorem for vector extremum problems.     

Augmented Lagrangian technique applied to a spatially periodic,harmonic Navier-Stokes problem

An application and an extension (to complex variables) of the classical augmented Lagrangian method is performed. Finite element computations are realized in the two-dimensional case of an harmonic Navier-Stokes problem with periodic boundary conditions. A formulation (extended from the traditional Stokes problem) involving a simple Lagrangian, solved by the Uzawa algorithim, was previously used.¹ This treatment proved unsatisfactory for large frequencies. The efficient and well-known augmented Lagrangian technique solved by the Uzawa algorithm is used to overcome these shortcomings. Other, better techniques could be used. Nevertheless the simple method used here is efficient. Moreover the numerical implementation needs little memory storage, which is an important factor in this particular case. The well-known conditioning technique employed is shown to be well-adapted in this case, a fact which emerges from the study of the non-symmetric problem involved. Finally, many tests, computations and experimental data are presented.     

A NOTE ON QUASI-P RADICAL OF ASSOCIATIVE RINGS

Let P be an arbitrary property of rings and homomorphlcally closed. For an arbitraryring A we construct quasi-P radical O.P(A) with transfinite induction, and give another character-ization of quasi-P radical;     

Effect of model uncertainty on some optimal routing problems

We study the effect of model uncertainties on optimal routing in a system of parallel queues. The uncertainty arises in modeling the service time distribution for the customers (jobs, packets) to be served. For a Poisson arrival process and Bernoulli routing, the optimal mean system delay generally depends on the variance of this distribution. However, as the input traffic load approaches the system capacity, the optimal routing assignment and corresponding mean system delay are shown to converge to a variance-invariant point. The implications of these results are examined in the context of gradient-based routing algorithms. An example of a model-independent algorithm using on-line gradient estimation is also included and its performance compared with that of model-based algorithms.This work was supported in part by the National Science Foundation under Grant ECS-88-01912, by the Office of Naval Research under Contract N00014-87-K-0304, and by NASA under Contract NAG 2-595.