Abstract: The present disclosure relates to polymers comprising conjugates of cyclodextrin or derivatives thereof and a linker moiety, methods of preparing the same and their application in the removal of lipids such as cholesterol from cells in treating lipid storage disorders. The present polymers exhibit improved properties including but not limiting to improved biocompatibility, improved retention time, prolonged duration of action in cells, and increased efficacy in removal of cholesterol from cells in treating lipid storage disorders.

Abstract: Presented herein are methods, non-transitory computer readable media, and devices for integrating a hybrid model of fine-grained locking and data-partitioning wherein fine-grained locking is added to existing systems that are based on hierarchical data-partitioning in order in increase parallelism with minimal code re-write.

Abstract: A method of treating a female patient suffering from non-small cell lung cancer includes the step of administering to the patient in need thereof a composition of 2,2?-dithio-bis-ethane sulfonate, or a pharmaceutically-acceptable salt thereof. The method can include other primary line therapies.

Abstract: Presented herein are methods, non-transitory computer readable media, and devices for integrating a hybrid model of fine-grained locking and data-partitioning wherein fine-grained locking is added to existing systems that are based on hierarchical data-partitioning in order in increase parallelism with minimal code re-write.

Abstract: Presented herein are methods, non-transitory computer readable media, and devices for optimizing thread assignment to schedulers, avoid starvation of individual data partitions, and maximize parallelism in the presence of hierarchical data partitioning are disclosed, which include: partitioning, by a network storage server, a scheduler servicing a data partitioned system into a plurality of autonomous schedulers; determining what fraction of thread resources in the data partitioned system at least one of the plurality of autonomous schedulers is to receive; and determining, with minimal synchronization, when it is time to allow the at least one of the plurality of autonomous schedulers servicing a coarse hierarchy to run.

Abstract: Presented herein are methods, non-transitory computer readable media, and devices for efficiently administering locks for shared resources, such as data blocks, stored on a storage system. Methods for stamping a plurality of computer data objects are disclosed which include: accessing at least one of the plurality of computer data objects by a first data thread; assigning, by the first data thread, a stamp to the at least one of the plurality of computer data objects, to signify the at least one of the plurality of computer data objects is associated with the first data thread; preventing subsequent access by a second data thread to the stamped at least one of the plurality of computer data objects; and determining the stamp is no longer active, upon an event, effectively releasing the at least one of the plurality of computer data objects.

Abstract: Presented herein are methods, non-transitory computer readable media, and devices for optimizing thread assignment to schedulers, avoid starvation of individual data partitions, and maximize parallelism in the presence of hierarchical data partitioning are disclosed, which include: partitioning, by a network storage server, a scheduler servicing a data partitioned system into a plurality of autonomous schedulers; determining what fraction of thread resources in the data partitioned system at least one of the plurality of autonomous schedulers is to receive; and determining, with minimal synchronization, when it is time to allow the at least one of the plurality of autonomous schedulers servicing a coarse hierarchy to run.

Abstract: A method includes receiving a plurality of data processing requests and generating a primary processing stack indicating a queue for processing the first data. The primary processing stack comprises a plurality of layers. Each layer comprises a plurality of slices, wherein each slice represents a portion of the first data of at least one data processing request. The plurality of slices are arranged within each layer based at least on the priority indicator corresponding to the first data that each slice represents. The method further includes receiving resource information about a plurality of servers, assigning each slice of the primary processing stack to one of the servers, and sending processing instructions comprising an identification of each slice of the primary processing stack assigned to the respective server.

Abstract: Methods for determining the likelihood that a subject suffering from a solid tumor cancer will benefit from treatment with an illudin are disclosed herein. Further, there are also methods for treatment based on such determination. In several embodiments, markers prostaglandin reductase 1 (PTGR1), Protein Tyrosine Phosphatase Non-Receptor Type 14 (PTPN14), Aspartate Beta-Hydroxylase (ASPH) together with one or more genes or alone may be used to enhance or guide treatment with an illudin. In certain embodiments, the protein or gene may be expressed or methylated.

Abstract: A method includes receiving a plurality of data processing requests and assigning each data processing request to a group based on the source of the data. The method further includes generating a primary processing stack indicating a queue for processing the first data, wherein: the primary processing stack comprises a plurality of layers; each layer comprises a plurality of slices, wherein each slice represents a portion of the first data of at least one data processing request; and the plurality of slices are arranged within each layer based at least on the priority indicator corresponding to the first data that each slice represents. The method further includes receiving resource information about a plurality of servers, assigning each slice of the primary processing stack to one of the servers, and sending processing instructions comprising an identification of each slice of the primary processing stack assigned to the respective server.

Abstract: The present disclosure relates to polymers comprising conjugates of cyclodextrin or derivatives thereof and a linker moiety, methods of preparing the same and their application in the removal of lipids such as cholesterol from cells in treating lipid storage disorders. The present polymers exhibit improved properties including but not limiting to improved biocompatibility, improved retention time, prolonged duration of action in cells, and increased efficacy in removal of cholesterol from cells in treating lipid storage disorders.

Abstract: Methods, non-transitory computer readable media, and computing devices that accelerate data access requests. With this technology, a hierarchy of a plurality of objects is inserted into a location database. Each of at least a subset of the plurality of objects comprises a physical storage location for data stored in a filesystem. One or more of the plurality of objects includes an object version number and a parent version number of a parent one of the plurality of objects. A determination is made when an invalidation event has occurred in the filesystem. The invalidation event is associated with one of the plurality of objects. The object version number for the one of the plurality of objects is modified to invalidate one or more of the subset of the objects, when the determining indicates that the invalidation event has occurred in the filesystem.

Abstract: The present disclosure relates to polymers comprising conjugates of cyclodextrin or derivatives thereof and a linker moiety, and their application in treating lipid storage disorders by the removal of lipids such as cholesterol from cells. The polymers having the following structure: Formula (I), wherein CD, L, and n are defined herein, exhibit improved properties including but not limited to improved biocompatibility, improved retention time, prolonged duration of action in cells, and increased efficacy in treating a variety of kidney diseases and associated conditions.

Abstract: A method includes receiving a plurality of data processing requests and assigning each data processing request to a group based on the source of the data. The method further includes generating a primary processing stack indicating a queue for processing the first data, wherein: the primary processing stack comprises a plurality of layers; each layer comprises a plurality of slices, wherein each slice represents a portion of the first data of at least one data processing request; and the plurality of slices are arranged within each layer based at least on the priority indicator corresponding to the first data that each slice represents. The method further includes receiving resource information about a plurality of servers, assigning each slice of the primary processing stack to one of the servers, and sending processing instructions comprising an identification of each slice of the primary processing stack assigned to the respective server.

Abstract: Various embodiments of the present invention are directed to polyrotaxanes comprising a poloxamer core and at least one cyclodextrin and methods for treating Niemann-Pick type C (NPC) and imaging (e.g., MRI) using the polyrotaxanes various embodiments of the present invention.

Abstract: Presented herein are methods, non-transitory computer readable media, and devices for optimizing thread assignment to schedulers, avoid starvation of individual data partitions, and maximize parallelism in the presence of hierarchical data partitioning are disclosed, which include: partitioning, by a network storage server, a scheduler servicing a data partitioned system into a plurality of autonomous schedulers; determining what fraction of thread resources in the data partitioned system at least one of the plurality of autonomous schedulers is to receive; and determining, with minimal synchronization, when it is time to allow the at least one of the plurality of autonomous schedulers servicing a coarse hierarchy to run.

Abstract: Presented herein are methods, non-transitory computer readable media, and devices for optimizing thread assignment to schedulers, avoid starvation of individual data partitions, and maximize parallelism in the presence of hierarchical data partitioning are disclosed, which include: partitioning, by a network storage server, a scheduler servicing a data partitioned system into a plurality of autonomous schedulers; determining what fraction of thread resources in the data partitioned system at least one of the plurality of autonomous schedulers is to receive; and determining, with minimal synchronization, when it is time to allow the at least one of the plurality of autonomous schedulers servicing a coarse hierarchy to run.

Abstract: Presented herein are methods, non-transitory computer readable media, and devices for integrating a hybrid model of fine-grained locking and data-partitioning wherein fine-grained locking is added to existing systems that are based on hierarchical data-partitioning in order in increase parallelism with minimal code re-write.

Abstract: A configuration mapping system and method increase the effectiveness of mapping of information from an established product line to a new product offering. In at least one embodiment, the configuration mapping system herein uses configuration mapping rules to map individual product features and entire configurations from established products to a new product offering. The configuration mapping system also provides a way to appropriately map, for example, demand and sales information for the purpose of demand estimation and sales prediction. Conventionally, mapping can be ineffective because the configuration mapping rules usually focus on one part of the product at a time, and, if applied in isolation, the impact on other parts is missed. The systems and method herein provide a way to integrate configuration mapping rules across feature parts, time periods, and product lines into a unified, holistic view, allowing for new insights.

Abstract: Presented herein are methods, non-transitory computer readable media, and devices for efficiently administering locks for shared resources, such as data blocks, stored on a storage system. Methods for stamping a plurality of computer data objects are disclosed which include: accessing at least one of the plurality of computer data objects by a first data thread; assigning, by the first data thread, a stamp to the at least one of the plurality of computer data objects, to signify the at least one of the plurality of computer data objects is associated with the first data thread; preventing subsequent access by a second data thread to the stamped at least one of the plurality of computer data objects; and determining the stamp is no longer active, upon an event, effectively releasing the at least one of the plurality of computer data objects.