Abstract: Systems and methods of determining file-access patterns in at least one computer network, the network comprising a file-access server, including training a first machine learning (ML) algorithm with a first training dataset comprising vectors representing network traffic such that the first ML algorithm learns to determine network characteristics associated with file-access traffic, determining, using the first ML algorithm, network characteristics based on highest interaction of traffic with the file-access server compared to other interactions in the at least one computer network, and determining file-access patterns in the at least one computer network based on the network characteristics associated with file-access traffic.

Abstract: Systems and methods of determining file-access patterns in at least one computer network, the network comprising a file-access server, including training a first machine learning (ML) algorithm with a first training dataset comprising vectors representing network traffic such that the first ML algorithm learns to determine network characteristics associated with file-access traffic, determining, using the first ML algorithm, network characteristics based on highest interaction of traffic with the file-access server compared to other interactions in the at least one computer network, and determining file-access patterns in the at least one computer network based on the network characteristics associated with file-access traffic.

Abstract: Systems and methods of determining a network performance property in at least one computer network, including: sampling traffic in active communication with the at least one computer network, analyzing the sampled traffic to group communication packets to flows, and predicting at least one network property of the at least one network based on the grouped communication packets and based on at least one traffic parameter in the at least one network, where the at least one traffic parameter is selected from the group consisting of: union of packet streams, intersection of packet streams, and differences of packet streams, and where the predicted at least one network property is selected from the group consisting of: total number of flows, number of flows with a predefined characteristic, number of packets, and volume of packets.

Abstract: Systems and methods of detecting communication anomalies in a computer network, including: applying a machine learning (ML) algorithm on sampled network traffic, wherein the ML algorithm is trained with a training dataset comprising vectors to identify an anomaly when the ML algorithm receives a new input vector representing sampled network traffic, normalizing a loss determined by the ML algorithm based on the output of the ML algorithm for the new input vector being different from the output of the ML algorithm for the training dataset, and applying the ML algorithm to analyze the normalized loss to identify an anomaly based on at least one communication pattern in the sampled network traffic, allowing a model trained in one installation to serve as a base model in another installation by normalizing the loss vectors of each installation.

Abstract: Systems and methods of determining file-access patterns in at least one computer network, the network comprising a file-access server, including training a first machine learning (ML) algorithm with a first training dataset comprising vectors representing network traffic such that the first ML algorithm learns to determine network characteristics associated with file-access traffic, determining, using the first ML algorithm, network characteristics based on highest interaction of traffic with the file-access server compared to other interactions in the at least one computer network, and determining file-access patterns in the at least one computer network based on the network characteristics associated with file-access traffic.

Abstract: Systems and methods of determining a network performance property in at least one computer network, including: sampling traffic in active communication with the at least one computer network, analyzing the sampled traffic to group communication packets to flows, and predicting at least one network property of the at least one network based on the grouped communication packets and based on at least one traffic parameter in the at least one network, where the at least one traffic parameter is selected from the group consisting of: union of packet streams, intersection of packet streams, and differences of packet streams, and where the predicted at least one network property is selected from the group consisting of: total number of flows, number of flows with a predefined characteristic, number of packets, and volume of packets.

Abstract: The systems and methods described herein relate to nucleic acid probes comprising a pattern of universal and designate nucleotides (or analogs thereof), or ‘gapped’ probes, and the use of sets of gapped probes in sequencing by hybridization to determine the sequence of nucleic acid sequences. The inclusion of universal nucleotides in the probes allows for efficient and rapid sequencing of longer nucleotide sequences than can be sequenced using traditional probes. The systems and methods described herein also relate to apparatus for sequencing nucleic acids which include gapped probes, as well as computer systems capable of analyzing data generated using gapped probes in such apparatus.

Abstract: The systems and methods described herein relate to nucleic acid probes comprising a a pattern of universal and designate nucleotides, or ‘gapped’ probes, and the use of sets of gapped probes in sequencing by hybridization to determine the sequence of nucleic acid sequences. The inclusion of universal nucleotides in the probes allows for efficient and rapid sequencing of longer nucleotide sequences than can be sequenced using traditional probes. The systems and methods described herein also relate to apparatus for sequencing nucleic acids which include gapped probes, as well as computer systems capable of analyzing data generated using gapped probes in such apparatus.

Abstract: In a multiprocessing system, access to a shared resource is arbitrated among multiple computing nodes. The shared resources has a membership view resulting from a predetermined membership protocol performed by the shared resource and the computing nodes. Preferably, this membership protocol includes a termination condition guaranteeing asymmetric safety among all members of the multiprocessing system. The shared resource arbitrates access to itself by fencing computing nodes outside shared resource's membership view. In one embodiment, the shared resource may comprise a data storage facility, such as a disk drive. Illustratively, computation of the shared resource's membership view may employ a procedure where each computing node subscribes to the resource during prescribed membership intervals.

Abstract: The systems and methods described herein relate to nucleic acid probes comprising a a pattern of universal and designate nucleotides, or ‘gapped’ probes, and the use of sets of gapped probes in sequencing by hybridization to determine the sequence of nucleic acid sequences. The inclusion of universal nucleotides in the probes allows for efficient and rapid sequencing of longer nucleotide sequences than can be sequenced using traditional probes. The systems and methods described herein also relate to apparatus for sequencing nucleic acids which include gapped probes, as well as computer systems capable of analyzing data generated using gapped probes in such apparatus.

Abstract: The systems and methods described herein relate to nucleic acid probes comprising a pattern of universal and designate nucleotides (or analogs thereof), or ‘gapped’ probes, and the use of sets of gapped probes in sequencing by hybridization to determine the sequence of nucleic acid sequences. The inclusion of universal nucleotides in the probes allows for efficient and rapid sequencing of longer nucleotide sequences than can be sequenced using traditional probes. The systems and methods described herein also relate to apparatus for sequencing nucleic acids which include gapped probes, as well as computer systems capable of analyzing data generated using gapped probes in such apparatus.

Abstract: In a multiprocessing system, access to a shared resource is arbitrated among multiple computing nodes. The shared resources has a membership view resulting from a predetermined membership protocol performed by the shared resource and the computing nodes. Preferably, this membership protocol includes a termination condition guaranteeing asymmetric safety among all members of the multiprocessing system. The shared resource arbitrates access to itself by fencing computing nodes outside shared resource's membership view. In one embodiment, the shared resource may comprise a data storage facility, such as a disk drive. Illustratively, computation of the shared resource's membership view may employ a procedure where each computing node subscribes to the resource during prescribed membership intervals.

Abstract: The systems and methods described herein relate to nucleic acid probes comprising a a pattern of universal and designate nucleotides, or ‘gapped’ probes, and the use of sets of gapped probes in sequencing by hybridization to determine the sequence of nucleic acid sequences. The inclusion of universal nucleotides in the probes allows for efficient and rapid sequencing of longer nucleotide sequences than can be sequenced using traditional probes. The systems and methods described herein also relate to apparatus for sequencing nucleic acids which include gapped probes, as well as computer systems capable of analyzing data generated using gapped probes in such apparatus.

Abstract: Ordered machine-readable messages are reliably delivered among processing members in a multiprocessing computer system. The system includes multiple processing nodes, each having a unique source-ID and a membership view including one or more of the processing nodes with which it can nominally exchange messages. When a stimulus message is received by a first processing node, the node increments a coordinated local counter (CC). The node also sends a multicast message to all processing nodes in the first node's membership group. The multicast message includes the received stimulus message, the incremented CC value, and the first node's source-ID. The node further sets a timer, exclusively associated with the incremented CC value. When a multicast message is received at a processing node, the node performs a multicast input processing routine. The node sets its CC equal to the greater of its current value or the received multicast message's CC value.

Abstract: A method is disclosed for coordinating membership subject to an asymmetric safety condition from multiple processes in a distributed system. Each is callable by a distributed application for system status or for executing tasks of the application. Initially, each process sends the other processes its view on their status, where the view includes the names of a group of the processes. It then waits for similar views from other processors except those regarded as failed in its own view, up to a predetermined timeout. Each process then generates a resulting view by intersecting its local view with the names of those processes from which it has received views. The local views are updated based on the resulting views and again exchanged until a termination condition occurs.

Abstract: A computer-implemented database search method includes arranging data points in a tree structure, with upper nodes being labeled by respective randomly selected representative data point and with the distance between each data point which is related to a first node and the label of the first node being less than the distance between the data point and the label of nodes in other branches. When a query is received, the distance between the query and the label of each node in the upper-most level is determined, and the nodes arranged in sequence, shortest distance first. Then, the process is repeated for the first "f" nodes in the sequence, and so on, until a sequence of leaves (i.e., data points having no dependent nodes or leaves) is obtained. The first "k" leaves are returned as the "k" closest database matches to the query.

Abstract: The present invention addresses the limitations of prior art ALLNODE switches by including dual priority, adaptive, path seeking, and flash-flood functionalities in a single ALLNODE switch. The switch of the present invention further includes a selection device responsive to a selection signal for enabling the selection of the mode of switch operation from any one of the foregoing functionalities. The selection signal is applied to the switch in a number of different ways including: the transmission of a command over the data path interface to the switch; the transmission of a command over special purpose serial or parallel control lines; or via hardwiring. Thus, the selection of functionality for the switch is capable of being made in either a dynamic or static fashion. The present invention further comprises two new high performance networks utilizing the selectable function ALLNODE switch.

Abstract: A class of switching networks is comprised of expansive logical clusters and/or dispersive logical clusters. These clusters are of low degree. The class of networks include multibutterfly networks as well as multi-Benes networks. These networks provide for fault tolerance and routing and for efficient routing. Moreover, routing is provided in a non-blocking fashion.