A rat cell line, RE1, oncogenically transformed by a herpes simplex virus type 2 ts mutant (ts 1), has been demonstrated to contain herpes simplex virus type 2-specific thymidine kinase activity, as have two of four tumors induced in rats by inoculation of these transformed cells. A high proportion of sera from tumor-bearing rats (5 of 11) have detectable antibody against herpes simplex virus t...

Clustering categorical distributions in the probability simplex is a fundamental primitive often met in applications dealing with histograms or mixtures of multinomials. Traditionally, the differentialgeometric structure of the probability simplex has been used either by (i) setting the Riemannian metric tensor to the Fisher information matrix of the categorical distributions, or (ii) defining ...

We review complexity results for minimizing polynomials over the standard simplex and unit hypercube. In addition, we derive new results on the computational complexity of approximating the minimum of some classes of functions (including Lipschitz continuous functions) on the standard simplex. The main tools used in the analysis are Bernstein approximation and Lagrange interpolation on the simp...

An avidin-biotin complex system was compared with three commercially available immunofluorescence kits for serotyping herpes simplex virus isolates from clinical specimens. Sensitivity values showed that the Electro-Nucleonics and Immulok reagents were useful in detecting the presence of virus, whereas the predictive values showed that the Syva and Immulok reagents possessed adequate discrimina...

In this paper, we describe the Simplex architecture, a real-time software technology which supports the safe, reliable introduction of control system upgrades while the system is running. We present the Simplex architecture from a control application point of view. In particular, we discuss the fault-tolerance feature of the technology, introduce its basic structure in control systems, and inve...

in static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. in this paper, the static scheduling problem of automated guided vehicles in container terminal is solved by the network simplex algorithm (nsa). the algorithm is based on graph model and their performances are at least 100 times faster than traditional si...

BACKGROUND Herpesvirus infections often complicate the clinical course of patients with inflammatory bowel disease; however, invasive disease due to herpes simplex virus is distinctly uncommon. METHODS We present a case of herpes simplex virus colitis and hepatitis, review all the previously published cases of herpes simplex virus colitis, and discuss common clinical features and outcomes. We...

We determine the maximal hyperplane sections of regular n-simplex, if distance to centroid is fairly large, i.e. larger than midpoint edges. Similar results for n-cube and l1n-ball were obtained by Moody, Stone, Zach Zvavitch Liu Tkocz. The hyperplanes in these three cases are perpendicular vectors from vertices. For smaller distances -in a well-defined range- we show that at least locally maxi...

Abstract Finite elements with polynomial basis functions on the simplex a symmetric distribution of nodes should have unique representation. Unisolvence not only requires that number equals independent polynomials spanning space given degree, but also Vandermonde matrix controlling their mapping to Lagrange interpolating can be inverted. Here, necessary condition for unisolvence is presented sp...

A lot of research has been done to 1nd a faster (polynomial) algorithm that can solve linear programming (LP) problems. The main branch of this research has been devoted to interior point methods (IPM). The IPM outperforms the Simplex method in large LPs. However, there is still much research being done in order to improve pivoting algorithms. In this paper, we present a new approach to the pro...