Abstract: An antibody or fragment thereof, against presenilin, and more specifically against the luminal loop 1 of presenilin, for use in the treatment of cancer, by way of administrating a therapeutically effective quantity of the antibody or a fragment thereof, or a pharmaceutical composition comprising thereof, to a subject who suffers from cancer.

Abstract: A database management system maintains a collection of data using a log-based storage structure. In response to a request to store data items (key-value pairs), the database management system stores mapping information to a data item in an in-memory data structure while the data items are stored on the log-based storage structure. The hash of the key includes information to identify an index entry that comprises information that maps to the location of the data item stored on the log-based storage structure.

Abstract: A device and method for reading a machine-readable code printed on an object, the device includes a reading device intended for reading a machine-readable code printed on an object; a detection device intended for detecting whether the printed code read with the reading device has been altered; an alteration device for altering the printed code, which are configured and arranged for acting while using the reading device to perform a first reading of the printed code; and a control device including a processing system with a memory intended for storing information about read printed codes. The method includes altering the printed code during a first reading thereof or during operations associated therewith and storing information about read printed codes. The system includes the device and a remote control center for validating the printed codes read by the device.

Abstract: A system and method for solving the weak membership problem in a system of nodes that might include redundancies. Each node is given the same random seed. Each node uses a link state protocol to determine the current system topography, and then an optimization such as simulated annealing is run on the topography at each node, independently of the other nodes, to determine the optimum weak membership for use thereof in subsequent system operations. Since each node starts with the same random seed, the nodes all arrive at the same solution without having to communicate a common solution between nodes.

Abstract: A state management system preserves a state for a cluster of file servers in a cluster file system in the presence of load balancing, failover, and fail-back events. The system provides a file and record locking solution for a clustered network attached storage system running on top of a cluster file system. The system employs a lock ownership scheme in which ownership identifiers are guaranteed to be unique across clustered servers and across various protocols the clustered servers may be exporting. The system supports multi-protocol clustered NAS gateways, NAS gateway server failover and fail-back, and load-balancing architectures. The system further eliminates a need for a lock migration protocol, resulting in improved efficiency and simplicity.

Abstract: A cluster computer system capable of filtering stale messages resulting from changes in a cluster membership. The system has interconnected nodes each hosting one or more applications and having a node filter for filtering messages to and from other nodes based on a membership identification and information about source nodes and destination nodes of the messages. Each application of a hosting node includes multiple application filters corresponding to other nodes in the system for filtering messages to and from the application based on the membership identification and an application view of the cluster membership. Each node further includes a communication agent for detecting when another node is disconnected from the membership and for updating its filters with the membership identification that reflects the node disconnection.

Abstract: A cluster computer system capable of filtering stale messages resulting from changes in a cluster membership. The system has interconnected nodes each hosting one or more applications and having a node filter for filtering messages to and from other nodes based on a membership identification and information about source nodes and destination nodes of the messages. Each application of a hosting node includes multiple application filters corresponding to other nodes in the system for filtering messages to and from the application based on the membership identification and an application view of the cluster membership. Each node further includes a communication agent for detecting when another node is disconnected from the membership and for updating its filters with the membership identification that reflects the node disconnection.

Abstract: A system and method for solving the weak membership problem in a system of nodes that might include redundancies. Each node is given the same random seed. Each node uses a link state protocol to determine the current system topography, and then an optimization such as simulated annealing is run on the topography at each node, independently of the other nodes, to determine the optimum weak membership for use thereof in subsequent system operations. Since each node starts with the same random seed, the nodes all arrive at the same solution without having to communicate a common solution between nodes.