Abstract: A synthesis of and use for L-Se-methylselenocysteine as a nutriceutical is described, based upon the knowledge that L-Se-methylselenocysteine is less toxic than L-selenomethionine towards normal cells. The synthesis proceeds by mixing N-(tert-butoxycarbonyl)-L-serine with a dialkyl diazodicarboxylate and at least one of a trialkylphosphine, triarylphosphine, and phosphite to form a first mixture that includes N-(tert-butoxycarbonyl)-L-serine ?-lactone. Methyl selenol or its salt is mixed with the N-(tert-butoxycarbonyl)-L-serine ?-lactone to form a second mixture that includes N-(tert-butoxycarbonyl)-Se-methylselenocysteine. The tert-butoxycarbonyl group is removed from the N-(tert-butoxycarbonyl)-Se-methylselenocysteine to form L-Se-methylselenocysteine. This synthesis significantly improves the manufacturability, manufacturing efficiency, and utility of this naturally occurring rare form of organic-selenium.

Abstract: A general computer-implement method and apparatus to optimize problem layout on a massively parallel supercomputer is described. The method takes as input the communication matrix of an arbitrary problem in the form of an array whose entries C(i, j) are the amount to data communicated from domain i to domain j. Given C(i, j), first implement a heuristic map is implemented which attempts sequentially to map a domain and its communications neighbors either to the same supercomputer node or to near-neighbor nodes on the supercomputer torus while keeping the number of domains mapped to a supercomputer node constant (as much as possible). Next a Markov Chain of maps is generated from the initial map using Monte Carlo simulation with Free Energy (cost function) F=?i,jC(i,j)H(i,j)—where H(i,j) is the smallest number of hops on the supercomputer torus between domain i and domain j.