Synthetic Heparanase Inhibitors Can Prevent Herpes Simplex Viral Spread

Herpes simplex virus (HSV-1) employs heparan sulfate (HS) as receptor for cell attachment and entry. During late-stage infection, the virus induces the upregulation of human heparanase (Hpse) to remove cell surface HS allowing viral spread. We hypothesized that inhibition of Hpse will prevent viral release thereby representing a new therapeutic strategy for HSV-1. A range of HS-oligosaccharides was prepared to examine the importance of chain length and 2-O-sulfation of iduronic moieties for Hpse inhibition. It was found that hexa- and octasaccharides potently inhibited the enzyme and that 2-O-sulfation of iduronic acid is tolerated. Computational studies provided a rationale for the observed structure–activity relationship. Treatment of human corneal epithelial cells (HCEs) infected with HSV-1 with the hexa- and octasaccharide blocked viral induced shedding of HS which significantly reduced spread of virions. The compounds also inhibited migration and proliferation of immortalized HCEs thereby providing additional therapeutic properties.     

Statistical mixture design development of digestion methods for Oyster tissue using inductively coupled plasma optical emission spectrometry for the determination of metallic ions

The quantitative determination of chemical elements in organic or biological samples is an important analytical problem. Normally the elements to be determined in the organic matrix must be transformed into a simple inorganic form. A digestion method by heating on a block digestor has been developed for the determination of Al, As, Ba, Ca, Cd, Co, Cu, Fe, Mg, Mn, V and Zn in Oyster tissue by ICP OES. A simplex centroid statistical mixture design has been used to study the effects of changing HNO₃, HCl and H₂O₂ reagent proportions on the digestion of these samples. Response surface and principal component analyses show that the species Ca, Cd, Cu, Fe, Mg, Mn and Zn have very similar analytical tendencies under this experiment. By means of mixture modeling maximum recoveries for these ions were predicted using 19%, 18% and 63% of the HCl, HNO₃ and H₂O₂ pseudocomponent mixtures, respectively. This corresponds to 21.4%, 30.8% and 47.8% of the HCl, HNO₃ and H₂O₂ commercial solutions. Furthermore the As, Co and V ions present large recoveries for these mixtures as well. The Al and Ba ion recoveries are seen to be independent of the mixture proportions. The analysis of Oyster tissue reference material (SRM 1566b - NIST) under optimized conditions at the selected wavelengths resulted in ion recoveries between 90% and 100%.     

Statistical mixture design investigation of fractionated and total extracts from Erythrina speciosa Andrews leaves

The simplex centroid mixture design for the ethanol, dichloromethane, hexane and acetone solvents has been applied to the extraction of crude mass and the fiber, organic, neutral and basic fractions as well as the fractionation residues of Erythrina speciosa Andrews leaves. Binary and ternary synergic solvent interactions are seen to provide dominant contributions to the extraction of both crude mass and all the fractions. Quadratic and special cubic mixture models precisely predict the extracted quantities of each fraction and the residue as a function of the proportions of the four solvents. Different solvent mixtures are found to be the most efficient extractors for the different fractions: binary dichloromethane‐hexane mixtures for the fiber fraction, ternary ethanol‐dichloromethane‐acetone mixtures for the neutral fraction, binary ethanol‐dichloromethane mixtures for the organic fraction, crude extract and residue values and ternary ethanol‐dichloromethane‐hexane mixtures for the basic fraction. Principal component analysis shows that the ethanol‐dichloromethane mixtures are important for extracting large quantities of the basic and organic fractions as well as of the residue and crude masses.     

Solving Bilevel Linear Programs Using Multiple Objective Linear Programming

We present an algorithm for solving bilevel linear programs that uses simplex pivots on an expanded tableau. The algorithm uses the relationship between multiple objective linear programs and bilevel linear programs along with results for minimizing a linear objective over the efficient set for a multiple objective problem. Results in multiple objective programming needed are presented. We report computational experience demonstrating that this approach is more effective than a standard branch-and-bound algorithm when the number of leader variables is small.     

Eppstein's bound on intersecting triangles revisited

Let S be a set of n points in the plane, and let T be a set of m triangles with vertices in S. Then there exists a point in the plane contained in Ω(m³/(n⁶log²n)) triangles of T. Eppstein [D. Eppstein, Improved bounds for intersecting triangles and halving planes, J. Combin. Theory Ser. A 62 (1993) 176-182] gave a proof of this claim, but there is a problem with his proof. Here we provide a correct proof by slightly modifying Eppstein's argument.     

A simple direct cosine simplex algorithm

Linear programming (LP) is the core model of constrained optimization. The Simplex method (Simplex in short) has been proven in practice to perform very well in small- or medium-sized LP problems. A new algorithm called the direct cosine Simplex algorithm (DCA) is presented here to improve upon Simplex and to solve LP problems. The proposed DCA implements a specific cosine criterion to choose the entering variable instead of the traditional most negative rule used in Simplex. Three examples are given to illustrate the implementation of the proposed DCA to improve Simplex and to serve as the optimization tool. The utility of the proposed approach is evident from the extensive computational results on test problems adapted from NETLIB. DCA reduced the number of iterations of Simplex in most cases in our computational experiment. Preliminary results for medium-sized problems are encouraging.     

A NEW PERTURBATION SIMPLEX ALGORITHM FOR LINEARPROGRAMMING

1.IntroductionThedualsimplexalgorithm[1,91andtheprimal-dualsimplealgorithm[6]arewellknownandefficientsimplexvariants.However,bothofthemneedaninitialdualfeasiblebasistogetstarted,andthereforecannotbedirectlyappliedtosolvingproblemsthatdonothavesuchane...     

An overview on the simplex algorithm

In this paper, the simplex algorithm and its variants are investigated. First, we define a new concept called formal tableau, which leads to derive easily the dual solution from the latest primal table; without any distinction between the original variables and the slack ones. Second, we propose a new method for initializing the simplex algorithm. Unlike the two-phase and the big-M methods, our technique does not involve artificial variables. The computational results reveal that this new method is very favorable especially when the number of artificial variables is significant. Finally, this method will be combined with the notion of formal tableau leading naturally to a second new approach.     

用线性回归与单纯形优化法研究配合物的组成

本文讨论了用线性回归和单纯形最优化法确定配合物实际组成的两种方法。这两种方法简单方便,既适用于水溶液也适用于非水溶液。