Brown alga, Turbinaria conoides was successively extracted with n-hexane, cyclohexane, methanol and ethanol:water (1:1). The extracts were evaluated for antibacterial and antifungal activities by disc diffusion method. Minimal inhibitory concentration was determined for active extracts by broth dilution method. The antiviral activity and cytotoxicity of the extracts were tested in human embryon...

Initialization of the population in Evolutionary Computation algorithms is an issue of ongoing research. Proper initialization may help the algorithm to explore the search space more efficiently and detect better solutions. In this paper, the Nonlinear Simplex Method is used to initialize the swarm of the Particle Swarm technique. Experiments for several well-known benchmark problems imply that...

We study the asymptotic behaviour of resistance scaling and fluctuation of resistance that give rise to flicker noise in an n-simplex lattice. We propose a simple method to calculate the resistance scaling and give a closed-form formula to calculate the exponent, βL, associated with resistance scaling, for any n. Using current cumulant method we calculate the exact noise exponent for n-simplex ...

By introducing quadratic penalty terms, a convex nonseparable quadratic network program can be reduced to an unconstrained optimization problem whose objective function is a piecewise quadratic and continuously differentiable function. A conjugate gradient method is applied to the reduced problem and its convergence is proved. The computation exploits the special network data structures origina...

An algorithm for solving large-scale nonlinear' programs with linear constraints is presented. The method combines efficient sparse-matrix techniques as in the revised simplex method with stable quasi-Newton methods for handling the nonlinearities. A general-purpose production code (MINOS) is described, along with computational experience on a wide variety of problems.

An improved dual simplex algorithm for the solution of the discrete linear Lj approximation problem is described. In this algorithm certain intermediate iterations are skipped. This method is comparable with an improved simplex method due to Barrodale and Roberts, in both speed and number of iterations. It also has the advantage that in case of ill-conditioned problems, the basis matrix can len...

We present an extension of the Simplex method for solving problems with piecewise-linear functions of individual variables within the constrains of otherwise linear problems. This work generalizes a previous work of Fourer that accommodate piecewise-linear terms in objective functions. The notion of nonbasic variable is extended to a variable fixed at a breakpoint. This new algorithm was implem...

In order to improve the specificity and sensitivity of the techniques for the human anisakidosis diagnosis, a method of affinity chromatography for the purification of species-specific antigens from Anisakis simplex third-stage larvae (L3) has been developed. New Zealand rabbits were immunized with A. simplex or Ascaris suum antigens or inoculated with Toxocara canis embryonated eggs. The IgG s...

We present a parallelization of the revised simplex method for large extensive forms of two-stage stochastic linear programming (LP) problems. These problems have been considered too large to solve with the simplex method; instead, decomposition approaches based on Benders decomposition or, more recently, interiorpoint methods are generally used. However, these approaches do not provide optimal...

This paper gives a general method for the stable evaluation of multivariate simplex splines, based on the well-known recurrence relation of Micchelli [12]. This paper deals with two problems which arise in the implementation of the recurrence relation. First, the coefficients in the recurrence are shown to be efficiently computable via the dual simplex method of linear programminig. Secondly, t...