Abstract: System and method for optimizing TCP window size in operating systems.

Abstract: A method for constructing an association map between imaging features and biological data is described. The method comprises combining one or more image features relating to a clinical subject with biological data and using an algorithm to make predictions based on the features and data.

Abstract: Many data sets to be sorted consist of a limited number of distinct keys. Sorting such data sets can be thought of as bundling together identical keys and having the bundles placed in order; we therefore denote this as bundle sorting. We describe an efficient algorithm for bundle sorting in external memory that requires at most c(N/B)logM/Bk disk accesses, where N is the number of keys, M is the size of internal memory, k is the number of distinct keys, B is the transfer block size, and 2<c<4. For moderately sized k, this bound circumvents the &THgr;((N/B)logM/B(N/B)) I/O lower bound known for general sorting. We show that our algorithm is optimal by proving a matching lower bound for bundle sorting. The improved nning time of bundle sorting over general sorting can be significant in practice, as demonstrated by experimentation. An important feature of the new algorithm is that it is executed “in-place”, requiring no additional disk space.

Abstract: A method for rendering an animation object, including a plurality of sub-objects, on a display of a client computer under control of a remote server. The method includes transferring from the server to the client, program code which describes a structure of the object, accessing within a local memory associated with the client a program description of at least one of the sub-objects of the object, and displaying the object such that the sub-object is coupled to the structure in accordance with the program code.