The conversion of isocitric acid to alpha-ketoglutarate has been demonstrated both in animal tissues (Martius, 1937; Krebs and Johnson, 1937; Adler et al., 1939; Ochoa, 1948) and in yeast (Kornberg and Pricer, 1951; Foulkes, 1951). Triphosphopyridine nucleotide was first implicated as a specific coenzyme for this reaction by Adler et al. (1939). Recently Kornberg and Pricer (1951) found in yeas...

Nonlipophilic corynebacteria associated with clinical and subclinical mastitis in dairy cows were found to belong to four species: Corynebacterium amycolatum, Corynebacterium ulcerans, Corynebacterium pseudotuberculosis, and Corynebacterium minutissimum. These species may easily be confused. However, clear-cut differences between C. ulcerans and C. pseudotuberculosis were found in their acid pr...

A rapid ELISA test for detection, characterization and quantification of human paraproteins was developed. The proposed method is a sandwich ELISA, where the capture antibody is specific for a given heavy chain (gamma, alpha or mu) and the labelled antibody is specific either for kappa or for lambda light chain. Both standard and patient sera are tested with all six possible antibody combinatio...

max (k, n − k)-cut (resp., min (k, n − k)-cut) is a constrained version of max-cut (resp., min-cut) where one has to find a bipartition of the vertex set into two subsets with respectively k and n − k vertices (n being the total number of vertices of the input graph) which maximizes (resp., minimizes) the number of edges going from one subset to the other. In this paper, we investigate the para...

Field-Programmable Gate Arrays (FPGAs) are flexible and reusable circuits that can be easily reconfigured by the designer. One of the steps involved in the logic design with FPGA circuits is placement. In this step, the logic functions are assigned to specific cells of the circuit. In this paper we present a placement algorithm for FPGA circuits. In traditional min-cut based placement algorithm...

The well-known Max Cut problem asks for the largest bipartite subgraph of a graph G. This problem has been the subject of extensive research, both from the algorithmic perspective in computer science and the extremal perspective in combinatorics. Let n be the number of vertices and e be the number edges of G and let b(G) denote the size of the largest bipartite subgraph of G. The extremal part ...

We analyze the addition of a simple local improvement step to various known ran-domized approximation algorithms. Let ' 0:87856 denote the best approximation ratio currently known for the Max Cut problem on general graphs GW95]. We consider a semideenite relaxation of the Max Cut problem, round it using the random hyperplane rounding technique of ((GW95]), and then add a local improvement step....

This paper studies the existence of eecient (small size) ampliiers for proving explicit inaproximability results for bounded degree and bounded occurrence combinatorial optimization problems, and gives an explicit construction for such ampliiers. We use this construction to improve the currently best known approximation lower bounds for bounded occurrence instances of linear equations mod 2, an...

Metric MAX-CUT is the problem of dividing a set of points in metric space into two parts so as to maximize the sum of the distances between points belonging to distinct parts. We show that metric MAX-CUT has a polynomial time randomized approximation scheme.