Abstract: This invention is in the field of neurology. Specifically, the invention relates to the discovery and characterization of molecular components that play a role in neuronal demyelination or remyelination. In addition, the invention relates to the generation of an animal model that exhibits hypomyelination. The compositions and methods embodied in the present invention are particularly useful for drug screening and/or treatment of demyelination disorders.

Abstract: Photomask patterns are represented using contours defined by level-set functions. Given target pattern, contours are optimized such that defined photomask, when used in photolithographic process, prints wafer pattern faithful to target pattern. Optimization utilizes “merit function” for encoding aspects of photolithographic process, preferences relating to resulting pattern (e.g. restriction to rectilinear patterns), robustness against process variations, as well as restrictions imposed relating to practical and economic manufacturability of photomasks.

Abstract: Cephalad and caudal vertebral facet joint prostheses and methods of use are provided. The prostheses provide an artificial facet joint structure including an artificial articular configuration unlike the preexisting articular configuration. The radii and material stress values of the prostheses are configured to sustain contact stress. The cephalad prosthesis provides for posterior-anterior adjustment. Both prostheses permit lateral adjustment and adjustment to accomodate interpedicle distance. Further, the prostheses may be customized to provide a pre-defined lordotic angle and a pre-defined pedicle entry angle.

Abstract: A caching method to greatly reduce the time to calculate routes based on the well known Dijkstra routing algorithm. A first embodiment is suitable for use in applications where only a single class of call is in use. A second embodiment is suitable for use where multiple classes of calls are is simultaneous use. A sequential number field and a global variable holding a sequential count are maintained by each node. When a node is put on the PATH list, the global sequential count variable is copied to the sequential number field for that particular node descriptor. Subsequently, when a route to destination node is to be calculated, for each node marked as a destination, the global sequential count variable and the node descriptor sequential number field are checked if they are equal. If they are, it means that a route has already been calculated to the destination which was already determined to be optimum.