In this paper we give the optimum parameters for the Accelerated Overrelaxation (AOR) method in the special case where the matrix coefficient of the linear system, which is solved, is consistently ordered with nonvanishing diagonal elements. Under certain assumptions, concerning the eigenvalues of the corresponding Jacobi matrix, it is shown that the optimum AOR method gives better convergence ...

A method for finding an optimum n-dimensional commutative group code of a given order M is presented. The approach explores the structure of lattices related to these codes and provides a significant reduction in the number of non-isometric cases to be analyzed. The classical factorization of matrices into Hermite and Smith normal forms and also basis reduction of lattices are used to character...

In this paper we solve the following problem: Given a positive integer f and L weights (real numbers), nd a partition with f classes of the multiset of weights such that the sum of the costs of the optimum m-ary Hu man trees built for every class of is minimum. An application to the optimal extendibility problem for pre x codes is proposed.

finding the optimum overrelaxation parameter o¡¡, is an important and often a difficult part of the problem [1, p. 257]. When A is a 2-cyclic, consistently ordered, real symmetric, positive-definite matrix (this will be assumed in the rest of the paper), only the spectral radius p(£i) of the associated Gauss-Seidel iteration matrix £i is needed to determine the optimum parameter co¡, [2, p. 109...

We describe a modiication of the Hu{Tucker algorithm for constructing an optimal alphabetic tree that runs in O(n) time for several classes of inputs. These classes can be described in simple terms and can be detected in linear time. We also give simple conditions and a linear algorithm for determining, in some cases, if two adjacent nodes will be combined in the optimal alphabetic tree.

A novel alkaline bound invertase (ITab) was purified 116 fold from crude extract of rice suspension cells (Oryza sativa L. cv. Tainong 67). The enzyme can be released by treating the cell wall and membrane fragments with 1.0 M NaCl and purified to homogeneity through the steps of ammonium sulfate precipitation, Con A-Sepharose affinity (non-retained), Sepharose CL-6B, and DEAE-Sepharose chromat...

To establish the substrate specificity o f the thioglucoside glucohydrolase myrosinase (EC 3.2.3.1), this enzyme was purified to homogeneity from light-grown cress (Lepidium sativum L.) seedlings by Sephadex gel filtration. Red Dye and anion exchange (FPLC M ono Q) chro­ matography, and preparative isoelectric focusing. Hydrolytic activity was shown toward only 4 o f the 29 synthetic and natura...

In this paper, we study the link capacity assignment problem in packet-switched networks (CA problem) focusing on the case where link cost function is a piecewise linear concave function. This type of cost function arises in many communication network design problems such as those arising from developments in communication transmission technologies. It is already known that the method of link s...

The standard management for previously untreated advanced-stage epithelial ovarian cancer is optimum cytoreductive surgery followed by aggressive cytotoxic chemotherapy. This approach is based on a retrospective review of a single-institution experience published more than 30 years ago and has yet to be confirmed in a prospective randomized trial. Many subsequent studies have supported the obse...

Optimized separation of a mixture of 16 priority pollutant polycyclic aromatic hydrocarbons (PAHs) by high performance liquid chromatography (HPLC) using the sequential simplex optimization method was accomplished by varying the starting and ending compositions of acetonitrile and water, linear gradient time, mobile phase flow rate, column temperature and holding time of the final mobile phase ...