Abstract: A fluid interface port in a microfluidic system and a method of forming the fluid interface port is provided. The fluid interface port comprises an opening formed in the side wall of a microchannel sized and dimensioned to form a virtual wall when the microchannel is filled with a first liquid. The fluid interface port is utilized to perform a labeling operation on a sample.

Abstract: A method and apparatus for sorting particles moving through a closed channel system of capillary size comprises a bubble valve for selectively generating a pressure pulse to separate a particle having a predetermined characteristic from a stream of particles. The particle sorting system may further include a buffer for absorbing the pressure pulse. The particle sorting system may include a plurality of closely coupled sorting modules which are combined to further increase the sorting rate. The particle sorting system may comprise a multi-stage sorting device for serially sorting streams of particles, in order to decrease the error rate.

Abstract: The invention relates to a method of high throughput chemical analysis comprising the steps of combining one test compound with a solution comprising m enzyme(s) and n substrate(s), wherein m is an integer equal to one or greater, n is an integer equal to one or greater, and m+n≧3, incubating for a period of time said test compound within said solution, separating the chemical species in said combined solution by a chromatography step after said incubating step, and measuring the relative amounts of substrates and separately identifiable products produced therefrom by a chemical reaction catalyzed by said enzymes. The present SMSBEA assays are particularly well suited to enzyme-substrate systems in which both the substrate(s) and product(s) have mobilities such that they can be separated on short chromatography columns. The method of the invention is also particularly well suited to HTS applications in which an enzyme agonist or antagonist is sought.

Abstract: A data structure, called an ordered sparse accumulator (Ordered SPA), permits sequencing in numeric order by index and dynamic alteration of the nonzero structure of the active column in sparse matrix computations during the sequencing operation.

Abstract: To generate computationally efficient computer program code for carrying out computer computations on matrix organized input data, a program first is written in a relatively high-level language which includes programmer specifiable constructs for manipulating matrices and parts thereof; and which permits certain of the constructs to be annotated to specify programmer selected data structures and programmer selected operations on those data structures. This high-level program then is translated into a relatively high-level program into a relatively low-level language using low-level language routines that provide a compilable representation of the program, including all programmer selected data structures and all programmer selected operations on said data structures then the low-level representation of the program is compiled to generate computer executable code for implementing the program, including all programmer selected data structures and all programmer selected operations on said data structures.

Abstract: A transgenic mouse that expresses the human Apo E isoforms Apo E2, Apo E3 or Apo E4 but is essentially incapable of expressing endogenous Apo E. Additionally, mice that express more than one of these isoforms are produced by selectively breeding the transgenic mice expressing the different Apo E isoforms disclosed herein. Thus, the present invention allows, among other things, the study of the effects of different combinations of human Apo E isoform expression on normal brain biology, development, function, aging and injury.

Abstract: When a data-parallel language like Fortran 90 is compiled for a distributed-memory machine, aggregate data objects (such as arrays) are distributed across the processor memories. The mapping determines the amount of residual communication needed to bring operands of parallel operations into alignment with each other. A common approach is to break the mapping into two stages: first, an alignment that maps all the objects to an abstract template, and then a distribution that maps the template to the processors. This disclosure deals with two facets of the problem of finding alignments that reduce residual communication; namely, alignments that vary in loops, and objects that permit of replicated alignments. It is shown that loop-dependent dynamic alignment is sometimes necessary for optimum performance, and algorithms are provided so that a compiler can determine good dynamic alignments for objects within "do" loops.

Abstract: An optimizing compilation process generates executable code which defines the computation and communication actions that are to be taken by each individual processor of a computer having a distributed memory, parallel processor architecture to run a program written in a data-parallel language. To this end, local memory layouts of the one-dimensional and multidimensional arrays that are used in the program are derived from one-level and two-level data mappings consisting of alignment and distribution, so that array elements are laid out in canonical order and local memory space is conserved.