Abstract: Methods of detecting immunogenic endogenous retroviruses and treating cancer are disclosed herein. In some embodiments, the methods include detecting increased expression of endogenous retroviruses in a tumor sample.

Abstract: This application provides a method to identify genetic markers associated with increased sensitivity or resistance to hormonal therapies using an outlier analysis. More specifically, this application discloses that amplifications on chromosomes 8 and 17 are associated with increased proliferation and poor outcome in ER-positive breast cancer, and amplicons 17q21.33-q25.1, 8p11.2 and 8q24.3 may be responsible for higher proliferation and poor outcome in the setting of antiestrogen, in particular Tamoxifen, treatment clinically observed in a subset of ER-positive, HER2-negative breast cancers. The invention also provides use of the identified genetic markers in the development of targeted treatments for antiestrogen-resistant ER-positive breast cancers as well as in improving current methods of drug response prediction.

Abstract: Methods for generating a prognostic signature for a subject with clear cell renal cell carcinoma (ccRCC) are disclosed. The methods include determining expression levels for three or more genes disclosed in ccRCC cells obtained from the subject, wherein the determining provides a prognostic signature for the subject. Also provided are methods for assessing risk of an adverse outcome of a subject clear cell renal cell carcinoma (ccRCC), method for predicting a clinical outcome of a treatment in a subject diagnosed with clear cell renal cell carcinoma (ccRCC), and arrays that include polynucleotides that hybridize to at least three genes disclosed or that include specific peptide or polypeptide gene products of at least three of the genes disclosed.

Abstract: This application provides a method to identify genetic markers associated with increased sensitivity or resistance to hormonal therapies using an outlier analysis. More specifically, this application discloses that amplifications on chromosomes 8 and 17 are associated with increased proliferation and poor outcome in ER-positive breast cancer, and amplicons 17q21.33-q25.1, 8p11.2 and 8q24.3 may be responsible for higher proliferation and poor outcome in the setting of antiestrogen, in particular Tamoxifen, treatment clinically observed in a subset of ER-positive, HER2-negative breast cancers. The invention also provides use of the identified genetic markers in the development of targeted treatments for antiestrogen-resistant ER-positive breast cancers as well as in improving current methods of drug response prediction.

Abstract: Class network routing is implemented in a network such as a computer network comprising a plurality of parallel compute processors at nodes thereof. Class network routing allows a compute processor to broadcast a message to a range (one or more) of other compute processors in the computer network, such as processors in a column or a row. Normally this type of operation requires a separate message to be sent to each processor. With class network routing pursuant to the invention, a single message is sufficient, which generally reduces the total number of messages in the network as well as the latency to do a broadcast. Class network routing is also applied to dense matrix inversion algorithms on distributed memory parallel supercomputers with hardware class function (multicast) capability. This is achieved by exploiting the fact that the communication patterns of dense matrix inversion can be served by hardware class functions, which results in faster execution times.

Abstract: Methods and systems for performing arithmetic functions. In accordance with a first aspect of the invention, methods and apparatus are provided, working in conjunction of software algorithms and hardware implementation of class network routing, to achieve a very significant reduction in the time required for global arithmetic operation on the torus. Therefore, it leads to greater scalability of applications running on large parallel machines. The invention involves three steps in improving the efficiency and accuracy of global operations: (1) Ensuring, when necessary, that all the nodes do the global operation on the data in the same order and so obtain a unique answer, independent of roundoff error; (2) Using the topology of the torus to minimize the number of hops and the bidirectional capabilities of the network to reduce the number of time steps in the data transfer operation to an absolute minimum; and (3) Using class function routing to reduce latency in the data transfer.

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.

Abstract: Methods and systems for performing arithmetic functions. In accordance with a first aspect of the invention, methods and apparatus are provided, working in conjunction of software algorithms and hardware implementation of class network routing, to achieve a very significant reduction in the time required for global arithmetic operation on the torus. Therefore, it leads to greater scalability of applications running on large parallel machines. The invention involves three steps in improving the efficiency and accuracy of global operations: (1) Ensuring, when necessary, that all the nodes do the global operation on the data in the same order and so obtain a unique answer, independent of roundoff error; (2) Using the topology of the torus to minimize the number of hops and the bidirectional capabilities of the network to reduce the number of time steps in the data transfer operation to an absolute minimum; and (3) Using class function routing to reduce latency in the data transfer.