Abstract: A high density correlation system can train a machine-learned model to determine one or more phenotypes of a cell and identify compounds corresponding to a user-queried phenotype. The high density correlation system can generate training data using single-cell images and train the machine-learned model using the generated training data. The machine-learned model can determine phenotypes of cells based on images of the cells. The high density correlation system can generate a database that includes phenotype-compound mappings generated based on the outputs of the machine-learned model. After receiving a query that identifies a phenotype, the high density correlation system can generate a result set of the query using the database for display at a graphical user interface (GUI). The result set can identify compounds corresponding to the identified phenotype. Additionally, the displayed compounds can be ordered based on a score for each compound.

Abstract: A sequence of storage devices of a data store may include one or more stripesets for storing data stripes of different lengths and of different types. Each data stripe may be stored in a prefix or other portion of a stripeset. Each data stripe may be identified by an array of addresses that identify each page of the data stripe on each included storage device. When a first storage device of a stripeset becomes full, the stripeset may be shifted by removing the full storage device from the stripeset, and adding a next storage device of the data store to the stripeset.

Abstract: A sequence of storage devices of a data store may include one or more stripesets for storing data stripes of different lengths and of different types. Each data stripe may be stored in a prefix or other portion of a stripeset. Each data stripe may be identified by an array of addresses that identify each page of the data stripe on each included storage device. When a first storage device of a stripeset becomes full, the stripeset may be shifted by removing the full storage device from the stripeset, and adding a next storage device of the data store to the stripeset.

Abstract: A sequence of storage devices of a data store may include one or more stripesets for storing data stripes of different lengths and of different types. Each data stripe may be stored in a prefix or other portion of a stripeset. Each data stripe may be identified by an array of addresses that identify each page of the data stripe on each included storage device. When a first storage device of a stripeset becomes full, the stripeset may be shifted by removing the full storage device from the stripeset, and adding a next storage device of the data store to the stripeset. A class variable may be associated with storage devices of a stripeset to identify the type of data that the stripeset can store. The class variable may be increased (or otherwise modified) when a computer stores data of a different class in the stripeset.

Abstract: A sequence of storage devices of a data store may include one or more stripesets for storing data stripes of different lengths and of different types. Each data stripe may be stored in a prefix or other portion of a stripeset. Each data stripe may be identified by an array of addresses that identify each page of the data stripe on each included storage device. When a first storage device of a stripeset becomes full, the stripeset may be shifted by removing the full storage device from the stripeset, and adding a next storage device of the data store to the stripeset. A class variable may be associated with storage devices of a stripeset to identify the type of data that the stripeset can store. The class variable may be increased (or otherwise modified) when a computer stores data of a different class in the stripeset.

Abstract: A sequence of storage devices of a data store may include one or more stripesets for storing data stripes of different lengths and of different types. Each data stripe may be stored in a prefix or other portion of a stripeset. Each data stripe may be identified by an array of addresses that identify each page of the data stripe on each included storage device. When a first storage device of a stripeset becomes full, the stripeset may be shifted by removing the full storage device from the stripeset, and adding a next storage device of the data store to the stripeset. A class variable may be associated with storage devices of a stripeset to identify the type of data that the stripeset can store. The class variable may be increased (or otherwise modified) when a computer stores data of a different class in the stripeset.

Abstract: A sequence of storage devices of a data store may include one or more stripesets for storing data stripes of different lengths and of different types. Each data stripe may be stored in a prefix or other portion of a stripeset. Each data stripe may be identified by an array of addresses that identify each page of the data stripe on each included storage device. When a first storage device of a stripeset becomes full, the stripeset may be shifted by removing the full storage device from the stripeset, and adding a next storage device of the data store to the stripeset. A class variable may be associated with storage devices of a stripeset to identify the type of data that the stripeset can store. The class variable may be increased (or otherwise modified) when a computer stores data of a different class in the stripeset.

Abstract: A sequence of storage devices of a data store may include one or more stripesets for storing data stripes of different lengths and of different types. Each data stripe may be stored in a prefix or other portion of a stripeset. Each data stripe may be identified by an array of addresses that identify each page of the data stripe on each included storage device. When a first storage device of a stripeset becomes full, the stripeset may be shifted by removing the full storage device from the stripeset, and adding a next storage device of the data store to the stripeset. A class variable may be associated with storage devices of a stripeset to identify the type of data that the stripeset can store. The class variable may be increased (or otherwise modified) when a computer stores data of a different class in the stripeset.

Abstract: A sequence of storage devices of a data store may include one or more stripesets for storing data stripes of different lengths and of different types. Each data stripe may be stored in a prefix or other portion of a stripeset. Each data stripe may be identified by an array of addresses that identify each page of the data stripe on each included storage device. When a first storage device of a stripeset becomes full, the stripeset may be shifted by removing the full storage device from the stripeset, and adding a next storage device of the data store to the stripeset. A class variable may be associated with storage devices of a stripeset to identify the type of data that the stripeset can store. The class variable may be increased (or otherwise modified) when a computer stores data of a different class in the stripeset.

Abstract: A sequence of storage devices of a data store may include one or more stripesets for storing data stripes of different lengths and of different types. Each data stripe may be stored in a prefix or other portion of a stripeset. Each data stripe may be identified by an array of addresses that identify each page of the data stripe on each included storage device. When a first storage device of a stripeset becomes full, the stripeset may be shifted by removing the full storage device from the stripeset, and adding a next storage device of the data store to the stripeset. A class variable may be associated with storage devices of a stripeset to identify the type of data that the stripeset can store. The class variable may be increased (or otherwise modified) when a computer stores data of a different class in the stripeset.

Abstract: A sequence of storage devices of a data store may include one or more stripesets for storing data stripes of different lengths and of different types. Each data stripe may be stored in a prefix or other portion of a stripeset. Each data stripe may be identified by an array of addresses that identify each page of the data stripe on each included storage device. When a first storage device of a stripeset becomes full, the stripeset may be shifted by removing the full storage device from the stripeset, and adding a next storage device of the data store to the stripeset. A class variable may be associated with storage devices of a stripeset to identify the type of data that the stripeset can store. The class variable may be increased (or otherwise modified) when a computer stores data of a different class in the stripeset.

Abstract: A system and method that automatically executes orders that a user enters into an entry screen at a global trade workstation. The order is routed to an order processing server, which opens a transaction record in a database. If the order is executable on an automated exchange, then the order is forwarded to that exchange. If the order is not executable on an automated exchange, then the order is sent to a front-end processor for non-automated exchanges. The front-end processor forwards the order electronically to the appropriate exchange. After execution of the transaction, the order processing server receives execution information from either the automated exchange or the front-end processor. The front-end processor matches this information to the order, stores the execution information and then forwards this information to the global trade workstation.

Abstract: A method and apparatus for improving the utility of speech recognition is described. The method involves capturing a spoken word, passing the spoken word to a speech recognition algorithm, receiving at least one text representation of the spoken word from the speech recognition algorithm, and passing a text representation of the spoken word to a display telephone to permit the user to select the correct representation of the voice response. The apparatus is an access server which communicates with a display telephone, a speech recognition algorithm which responds to queries from the access server and one or more databases which likewise respond to queries from the access server. The method and apparatus are particularly useful in automating such functions as telephone directory services using display telephones.

Abstract: A lance assembly for insertion into a steam generator chamber includes a hinged support for guiding the lance within the chamber which may be stored easily in a smaller space outside the chamber when not in use. One embodiment of the support has left and right side support guides formed from multiple hinged segments that surround the lance when inside the chamber. The hinges are axially offset from one another along a length of the assembly and pivot in opposite directions so that the guide is rigid inside the chamber yet allowing the lance to move therein. In an alternate embodiment, a single guide is used having multiple hinged segments. The hinged segments are locked in place immediately prior to being fed into the chamber. The segments may be folded over each other for storage in a smaller space.

Abstract: A method, apparatus and system for dynamically routing selected calls through an intelligent switched telephone network are described. The method leverages the resident switching power in the Public Switched Telephone Network by departing from the Advanced Intelligent Network (AIN) call model while adhering to the basic principles of ISUP common channel signaling to introduce new flexibility in call routing. Using the method, calls can be efficiently routed and rerouted through the network. Control of a call can be effected by either the called party or the calling party. The method can be practised using either a virtual switching point (VSP) or an ISTP. The VSP is a physical mode in the signaling plane of the network and a virtual node in the switching plane. Calls are routed to the VSP using dedicated trunk groups which may be loop-back ISUP trunks or inter-switch ISUP trunks. Calls are routed to the dedicated trunk groups using standard routing translation tables and methods.

Abstract: A method and a system for completing a voice connection between a first and second voice terminal in a switched telephone network (STN) are disclosed. The system includes a Virtual Switching Point (VSP) in a switched telephone network having a connection to a data network such as the Internet. Call requests are received by the VSP from the data network and processed by the VSP to establish a voice connection between a calling party which initiates the call requests and a called party number indicated in each call request message. The call request message may include a plurality of called party numbers and the VSP completes calls to each number in sequence without terminating the voice connection with the calling party, until an attempt to connect with each of the called numbers has been made or a call control option is exercised by the calling party. The call connections are established and controlled by the VSP using common channel signaling (CCS) messages.