Abstract: A Fragment Context Preserver has two components, a Fragmented Request Preserver and a Request Context Helper. The Fragmented Request Preserver program runs on a surrogate attached to a client computer and distributed computer environment, and a Request Context Helper runs on each application server on the distributed computer environment. Working together, these two programs ensure that independently dispatched fragments of a request execute with the required context.

Abstract: Disclosed herein is a method and apparatus of immobilizing a biocatalyst on a microfluidic biochip for conducting reactions in the presence of electroosmotic flow. The biochip includes a polymer on its microfluidic flow surfaces, wherein the polymer includes a first substituent selected from ionic groups of the same polarity or precursors thereof, a second substituent that is a hydrophobic group, and a third substituent comprising an immobilized biocatalyst-or precursor thereof. The biochip can be used to conduct multiple sequential biocatalyzed reactions in the presence of electroosmotic flow.

Abstract: Disclosed herein is a method and apparatus of immobilizing a biocatalyst on a microfluidic biochip for conducting reactions in the presence of electroosmotic flow. The biochip includes a polymer on its microfluidic flow surfaces, wherein the polymer includes a first substituent selected from ionic groups of the same polarity or precursors thereof, a second substituent that is a hydrophobic group, and a third substituent comprising an immobilized biocatalyst-or precursor thereof. The biochip can be used to conduct multiple sequential biocatalyzed reactions in the presence of electroosmotic flow.

Abstract: Disclosed herein is a method and apparatus of immobilizing a biocatalyst on a microfluidic biochip for conducting reactions in the presence of electroosmotic flow. The biochip includes a polymer on its microfluidic flow surfaces, wherein the polymer includes a first substituent selected from ionic groups of the same polarity or precursors thereof, a second substituent that is a hydrophobic group, and a third substituent comprising an immobilized biocatalyst- or precursor thereof. The biochip can be used to conduct multiple sequential biocatalyzed reactions in the presence of electroosmotic flow.

Abstract: The invention relates, in part, to the improved analysis of carbohydrates. In particular, the invention relates to the analysis of carbohydrates, such as N-glycans and O-glycans found on proteins and saccharides attached to lipids. Improved methods, therefore, for the study of glycosylation patterns on cells, tissue and body fluids are also provided. Information from the analysis of glycans, such as the glycosylation patterns on cells, tissues and in body fluids, can be used in diagnostic and treatment methods as well as for facilitating the study of the effects of glycosylation/altered glycosylation. Such methods are also provided. Methods are further provided to assess production processes, to assess the purity of samples containing glycoconjugates, and to select glycoconjugates with the desired glycosylation.

Abstract: Session state affinity is maintained in a workload balancing system that includes a hypertext transfer protocol (HTTP) routing server and a plurality of application servers. The application servers maintain backup session state information for a first session to a first server of the plurality of application servers at fewer than all of the plurality of application servers, detect the unavailability of the first application server at an application server of the plurality of application servers other than the first application and determine a second server that continues the first session. An identification of the second server and the first session is sent from an application server of the plurality of application servers to a HTTP routing server responsive to detecting the unavailability of the first server.

Abstract: A scalable system and method for locating a closest server in response to a client request via an interactive distribution network, such as the Internet, are provided. A closest content server is defined as having the least round trip time for responding to a client request. The system including a plurality of content servers; and a local server in communication with a plurality of clients, the local server acting as a proxy for communicating client requests from clients to a redirection server. Client network distance and load information is periodically collected at each content server in the network from clients communicating with each of the respective content servers. The redirection server periodically aggregates the network distance and load information from each content server to create client clusters from both current and previously aggregated network distance and load information. Each client cluster represents a division or partition of the total IP address space.

Abstract: The invention relates, in part, to the improved analysis of carbohydrates. In particular, the invention relates to the analysis of carbohydrates, such as N-glycans and O-glycans found on proteins. Improved methods, therefore, for the study of glycosylation patterns on cells, tissue and body fluids are also provided. Information regarding the analysis of glycans, such as the glycosylation patterns on cells, tissues and in body fluids, can be used in diagnostic and treatment methods as well as for facilitating the study of the effects of glycosylation/altered glycosylation on protein function. Such methods are also provided. Methods are also provided to assess protein production processes, to assess the purity of proteins produced, and to select proteins with the desired glycosylation.

Abstract: A system and method for searching a bytestream or other string in a case insensitive manner. In a preferred embodiment, the present invention includes an ASCII tree that associated both upper and lower case letters of an incoming header key (or other symbols) with nodes. When enough nodes are gathered, a target word is found.

Abstract: A mechanism by which URLs are progressively hashed character by character and clauses of the URL are used to traverse a tree data structure for matching of the URL to resources/rules is provided. The hash code for a single character is appended to a prior hash code for a preceding character in the URL portion. At the time that the entire portion of the URL is hashed, as determined based on the presence of a delimiter character, the particular node in a tree data structure associated with the resulting hash code is identifiable within a hash table of a current node of the tree data structure. Each node in the tree data structure includes a multidimensional hash table for a portion of a URL. The multidimensional hash table is established and grown in a manner that ensures there are no hash collisions.

Abstract: Disclosed herein is a microfluidics device that can be used to prepare natural products and their analogs. The device comprises the enzymes of a biosynthetic pathway immobilized thereon and a means for sequentially directing a starting material and each ensuing reaction product to the enzymes of the biosynthetic pathway in the order corresponding to the steps of the biosynthetic pathway. The device can thus be used to prepare the natural product using the natural starting material of the biosynthetic pathway or analogs of the natural product using an unnatural starting material. Alternatively, artificial pathways can be created by immobilizing an appropriate selection of enzymes on the device in an order whereby each subsequent enzyme can catalyze a reaction with the product of the prior enzyme. Novel chemical entities can be prepared from these artificial pathways.

Abstract: A method is disclosed for designing a signaling network of call coordinators (CCs) for internet telephony. The new method can be used to design a CC network of arbitrary size that satisfies, with high probability, limitations on the maximum number of sockets per CC and on the maximum number of hops between an arbitrary pair of switches in the network. According to the disclosed method, the network of CCs is treated initially as a collection of isolated points, one point for each CC. Then, links are added between pairs of CCs, excluding pairs lying within the same switch. The links are added randomly, but with a particular probability p, which may be different for different pairs. Thus, whether a given link is added depends, in effect, upon the outcome of a loaded coin toss in which the probability of a positive outcome is p.

Abstract: Broadly, techniques for solving network routing within a predetermined error are disclosed. These techniques may be applied to networks supporting dedicated reserve capacity, where reserved capacity on links in the network is dedicated for a particular commodity (generally, a source and sink pair of computers), and shared recovery, where reserved capacity on links is shared amongst two or more commodities. These techniques use an iterative process to determine flows on each of the links in a network. Costs are set for each commodity, and primary and secondary (i.e., backup) flows are initialized. A commodity is selected and demand for the commodity is routed through the shortest path. Costs are updated for each potential failure mode. For each commodity, the flows and costs are updated. Once all flows and costs are updated, then it is determined if a function is less than a predetermined value.

Abstract: A scalable system and method for locating a closest server in response to a client request via an interactive distribution network, such as the Internet, are provided. A closest content server is defined as having the least round trip time for responding to a client request. The system including a plurality of content servers; and a local server in communication with a plurality of clients, the local server acting as a proxy for communicating client requests from clients to a redirection server. Client network distance and load information is periodically collected at each content server in the network from clients communicating with each of the respective content servers. The redirection server periodically aggregates the network distance and load information from each content server to create client clusters from both current and previously aggregated network distance and load information. Each client cluster represents a division or partition of the total IP address space.