Abstract: A surgical robotic system is disclosed to include an operating table, a plurality of robotic arms and surgical instruments, a user console, and a control tower. The plurality of robotic arms are mounted on the operating table and can be stowed folded under the table for storage. The user console has one or more user interface devices, which function as master devices to control the plurality of surgical instruments.

Abstract: A handheld computer device is configured to selectively receive a plurality of fluid output values from a paint sprayer and configured to operate in an accessible mode in which the handheld computer device is in a first location where wireless connectivity, via a continuous or near continuous communication path, to at least one of a network server or the paint sprayer is accessible or operate in an inaccessible mode in which the handheld computer device is in a second location out of range of the continuous or near continuous communication path to at least one of the network server or the paint sprayer.

Abstract: A handheld computer device is configured to selectively receive a plurality of fluid output values from a paint sprayer and configured to operate in an accessible mode in which the handheld computer device is in a first location where wireless connectivity, via a continuous or near continuous communication path, to at least one of a network server or the paint sprayer is accessible or operate in an inaccessible mode in which the handheld computer device is in a second location out of range of the continuous or near continuous communication path to at least one of the network server or the paint sprayer.

Abstract: A handheld computer device is configured to selectively receive a plurality of fluid output values from a paint sprayer and configured to operate in an accessible mode in which the handheld computer device is in a first location where wireless connectivity, via a continuous or near continuous communication path, to at least one of a network server or the paint sprayer is accessible or operate in an inaccessible mode in which the handheld computer device is in a second location out of range of the continuous or near continuous communication path to at least one of the network server or the paint sprayer.

Abstract: A blood treatment system with pressure sensors may be configured to control blood flow to and from the patient and use readings of the pressure sensors to determine a change in a pressure drop across a flow restriction in the blood circuit to estimate a condition of the machine or the patient, or outputting data responsive to the estimation. Further embodiments employ measurement of pressure drop to detect abnormal viscosity or viscosity variations in order to detect possible infection.

Abstract: A method is described for operating a refrigerant circuit that includes a compressor with a driveshaft and one or more gas bearings for supporting the driveshaft. The method includes operating the refrigerant circuit in a first mode which includes supplying gaseous working fluid compressed by the compressor to the one or more gas bearings of the compressor, and the one or more gas bearings using the compressed gaseous working fluid to support the driveshaft. The method includes operating the refrigerant circuit in a second mode which includes supplying liquid working fluid to the one or more gas bearings of the compressor, and the one or more gas bearings using the liquid working fluid to support the driveshaft. A refrigerant circuit includes a compressor, a condenser, an expander, an evaporator, and a controller configured to selectively operate the refrigerant circuit in a least a first mode and a second mode.

Abstract: A method of writing to a tiered memory system of a computing device, the tiered memory system including volatile memory and persistent memory (PMEM), includes the steps of: in response to a first write request including first data to write to a first page of the tiered memory system, copying contents of the first page to a second page located in the PMEM; after copying the contents of the first page to the second page, writing the first data to the second page; and after writing the first data to the second page, updating a first mapping of the tiered memory system to reference the second page instead of the first page.

Abstract: A method of writing to a tiered memory system of a computing device, the tiered memory system including volatile memory and persistent memory (PMEM), includes the steps of: in response to a first write request including first data to write to a first page of the tiered memory system, copying contents of the first page to a second page located in the PMEM; after copying the contents of the first page to the second page, writing the first data to the second page; and after writing the first data to the second page, updating a first mapping of the tiered memory system to reference the second page instead of the first page.

Abstract: The disclosure herein describes writing data to a log-structured merge (LSM) tree file system on an object storage platform. Write data instructions indicating data for writing to the LSM tree file system are received. Based on the received instructions, the data is written to the first data cache. Based on an instruction to transfer data in the live data cache to the LSM tree file system, the first data cache is converted to a stable cache. A second data cache configured as a live data cache is then generated based on cloning the first data cache. The data in the first data cache is then written to the LSM tree file system. Use of a stable cache and a cloned live data cache enables parallel writing data to the file system by the stable cache and handling write data instructions by the live data cache.

Abstract: Embodiments described herein are related to a method of scanning a B-tree. For example, a method comprises receiving a scan request to scan a B-tree having a plurality of levels, each level comprising one or more nodes, wherein for each of one or more levels of the plurality of levels, nodes are grouped into groups, where nodes of any given group are stored across sequential disk blocks. The method further comprises generating a queue for each level of the B-tree. For each queue, the method further comprises loading into memory a next group of nodes based upon determining a storage location of a node of the next group of nodes.

Abstract: A wire bundle forming apparatus including a wire bundle form board having a plurality of mounting structure couplings, and at least one wire bundle mounting structure configured to couple with the plurality of mounting structure couplings for removably coupling the at least one wire bundle mounting structure to the wire bundle form board in a predetermined pattern corresponding to a predetermined configuration of a wire bundle. The at least one wire bundle mounting structure has a wire receiving portion. The at least one wire bundle mounting structure is common to both arranging at least one wire in the predetermined configuration for formation of the wire bundle, and, when removed from the wire bundle form board with the wire bundle coupled to the at least one wire bundle mounting structure, a fixture for coupling the wire bundle to a structure.

Abstract: A method of forming a wire bundle, the method includes removably coupling a plurality of wire bundle mounting structures to a wire bundle form board, the plurality of wire bundles mounting structures being coupled to the wire bundle form board in a predetermined pattern corresponding to a configuration of the wire bundle. The method also includes inserting one or more wires, of the wire bundle, into the plurality of wire bundle mounting structures, coupling the one or more wires to the plurality of wire bundle mounting structures with a respective wire bundle retention strap of each of the plurality of wire bundle mounting structures so as to form the wire bundle, and removing the one or more wires and the plurality of wire bundle mounting structures from the wire bundle form board as a singular unit.

Abstract: The disclosure herein describes synchronizing a data cache and an LSM tree file system on an object storage platform. Instructions to send a cached data set from the data cache to the LSM tree file system are received. An updated metadata catalog is generated. If the LSM tree structure is out of shape, compaction is performed on the LSM tree file system which may be on a different system or server. When an unmerged compacted metadata catalog is identified, a merged metadata catalog is generated, based on the compacted metadata catalog and the cached data set, and associated with the cached data set. The cached data set and the associated metadata catalog are sent to the LSM tree file system, whereby the data cache and the LSM tree file system are synchronized. Synchronization is enabled without the data cache or file system being locked and/or waiting for the other entity.

Abstract: The disclosure herein describes providing and accessing data on an object storage platform using a log-structured merge (LSM) tree file system. The LSM tree file system on the object storage platform includes sorted data tables, each sorted data table including a payload portion and an index portion. Data is written to the LSM tree file system in at least one new sorted data table. Data is ready by identifying a data location of the data based on index portions of the sorted data tables and reading the data from a sorted data table associated with the identified data location. The use of the LSM tree file system on the object storage platform provides an efficient means for interacting with the data stored thereon.

Abstract: A B?-tree associated with a file system on a storage volume includes a hierarchy of nodes. Each node includes a buffer portion to store key-value pairs as messages in the buffer. Each node can be characterized by having a maximum allowable size that is periodically updated at run time. The buffers in the nodes of the B?-tree are therefore characterized by having a maximum allowed size that can vary over time.

Abstract: Embodiments herein are directed towards systems and methods for performing range lookups in B?-trees. One example method involves receiving a request to return key-value pairs within a range of keys from the B?-tree. The B?-tree includes a plurality of nodes, each node being associated with a buffer that stores key-value pairs. The method further involves determining a fractional size of the range of keys. The method further involves, for each level of the B?-tree, obtaining from within one or more buffers of one or more nodes of the level, a set of key-value pairs within the range of keys up to a size equal to the fractional size and transferring the set of key-value pairs to a result data structure. The method further involves sorting and merging all key-value pairs in the result data structure and returning the result data structure in response to the request.

Abstract: The disclosure herein describes synchronizing cached index copies at a first site with indexes of a log-structured merge (LSM) tree file system on an object storage platform at a second site. An indication that the LSM tree file system has been compacted based on a compaction process is received. A cached metadata catalog of the included parent catalog version at the first site is accessed. A set of cached index copies is identified at the first site based on the metadata of the cached metadata catalog. The compaction process is applied to the identified set of cached index copies and a compacted set of cached index copies is generated at the first site, whereby the compacted set of cached index copies is synchronized with a respective set of indexes of the plurality of sorted data tables of the LSM tree file system at the second site.

Abstract: An electrical connector includes conductive male and female contacts and insulating inner and outer sleeves, and connects first and second electrical wires end-to-end. The contacts can be attached to corresponding conductors of the first and second wires. The male contact includes an elongated pin; the female contact includes a receptacle. Inserting the pin into the receptacle results in mechanical engagement of, and electrical continuity between, the assembled contacts. The assembled contacts can be positioned within the compressible inner sleeve, which extends beyond the ends of the assembled contacts. The inner sleeve, with the assembled contacts therein, can be positioned within the rigid outer sleeve, which extends at least as far as the inner sleeve. Compression of the inner sleeve by the ends of the outer sleeve frictionally engages the ends of the inner sleeve with the corresponding wires.

Abstract: A buffer tree structure includes, at each internal node, a buffer having a compacted portion and an uncompacted portion. Insertion of data elements to the buffer tree can occur units called packets. A packet is initially stored in the uncompacted portion of a receiving node's buffer. When a compaction trigger condition exists, packet compaction is performed including a data element compaction operation. A buffer-emptying (flush) operation pushes the compacted packets to children nodes.

Abstract: Embodiments described herein are related to bulk loading data into a B-tree. Embodiments include generating a first leaf node of a B-tree by allocating a first page for the first leaf node from a leaf page queue comprising a first plurality of sequential pages; and writing one or more tuples to the first page allocated for the first leaf node. Embodiments further include generating an parent node for the first leaf node and a second leaf node of the B-tree by allocating a third page for the parent node from an parent page queue comprising a second plurality of sequential pages, the parent node comprising a first indication of the first leaf node and a second indication of the second leaf node, the first indication and the second indication stored in the third page allocated for the parent.