Abstract: A wedge bonding tool is provided. The wedge bonding tool includes a body portion including a tip portion, the tip portion terminating at a working end of the wedge bonding tool. The tip portion includes (i) two opposing walls, and (ii) an adjoining surface between the two opposing walls. The adjoining surface includes a flat area. The two opposing walls and the flat area define a groove configured to receive a wire. The flat area has a width of at least 20% of a width of the groove at the working end.

Abstract: Disclosed herein are system, method, and computer program product embodiments for implementing global rate limiting of an API cluster capable of dynamically implementing updates without a restart of any instantiation within the API cluster. A local service includes an envoy and a customer resource definition. When an update is received, the customer resource definition identifies changes to be made to a global rate limiting service and dynamically injects those changes into the global rate limiting service. The changes can be instance-specific, with multiple different versions stored for the various instantiations within the cluster. The envoy also extracts and converts header information from a received request into one or more descriptor keys. The global rate limiting service determine global rate limiting based on a set of rules applied to the descriptor keys.

Abstract: A system and method for an estimation of error bounds for file size calculations using MinHash in deduplication systems. The system includes one or more processors to determine a similarity score between the first file and the second file. The one or more processors are further to determine a size estimation of a combination of the first and second files based on the similarity score. Finally, the one or more processors are to determine a maximum error for the size estimation of the combination of the first and second files, wherein the first and second file are to be combined via deduplication and have at least one shared data segment.

Abstract: Exemplary scope systems and methods involve a cannula assembly, a sheath assembly, and a tubing set. A cannula assembly, which may be a non-magnetic scope cap assembly, can include a cannula body, a proximal housing having a strap, an optical window, and a luer for suction or flushing. A cannula body may include a first lumen or scope channel for receiving a visualization device such as an endoscope or laparoscope, a distal end having suction or flushing flush apertures, and a second lumen for providing fluid communication between the apertures and the luer. Exemplary magnetic introducer systems and methods involve a cannula assembly, a sheath assembly, a tubing set. In some cases, the cannula assembly of a magnetic introducer system can be a magnetic scope cap assembly. In addition to cannula and sheath assemblies, magnetic introducer systems can include a magnetic introducer tubing assembly and a stylet assembly.

Abstract: Embodiments herein relate to prediction, based on previous usage of a cloud-based computing resource by a user of one or more users of the cloud-based computing resource, future usage of the cloud-based computing resource. Based on the predicted future usage, embodiments relate to identifying that throttling of access to the cloud-based computing resource is to occur, and notifying the user of the throttling. Other embodiments may be described and/or claimed.

Abstract: Methods and systems for managing data in a distributed system are disclosed. The distributed system may include devices used by users (e.g., clients) and devices in which data is stored for future accessibility (e.g., storage providers). A data storage system may manage the data for the clients. To manage the data efficiently, the data storage system may perform an integrated process of both verifying that segments of files believed to be stored are actually stored and segments of files that no longer need to be stored are removed. The process may not be performed in real-time as files that no longer need to be stored are identified (e.g., as deletion requests are received). Rather, the integrated process may employ a garbage collection process where deletion conditions for segments are checked intermittently over time, and files are verified.

Abstract: Techniques and structures to facilitate anomaly detection within a networking system, including receiving a plurality of performance metric messages at a database system, extracting a plurality of anomaly detection messages included in the performance metric messages, storing the plurality of anomaly detection messages in an in-memory database and executing a machine learning model to process the plurality of anomaly detection messages in the in-memory database to detect whether anomalous usage of the networking system has been detected.

Abstract: A method, apparatus, and system for redistributing files in a multi-node storage system to improve global deduplication storage savings is disclosed. A plurality of file cluster candidates are generated for a plurality of files stored at a multi-node storage system comprising a plurality of data nodes. A similarity index is determined for each of the plurality of file cluster candidates based on similarity of the files comprised in the file cluster candidate. A ranked recipe list comprising a plurality of recipes is generated. Each recipe is associated with one of the plurality of file cluster candidates, comprises a destination data node for the associated file cluster candidate, and is associated with a deduplication space savings. At least some of the plurality of files are moved between the plurality of data nodes based on the recipes in the ranked recipe list to improve deduplication space savings in the multi-node storage system.

Abstract: Systems and methods for verifying files in bulk in a file system. When files are represented by a segment tree, the levels of the segment trees are walked by level such that that multiple files are verified at the same time in order to identify missing segments. Then, a bottom up scan is performed using the missing segments to identify the files corresponding to the missing segments. The missing files can then be handled by the file system.

Abstract: Techniques and structures to prevent exhaustion of a database connection pool, including receiving a plurality of events from a plurality of application servers operating as a database connection pool, categorizing each of the plurality of events, including generating a categorization message for each of the plurality events, wherein each categorization message includes one or more fields having contextual information to identify an event type to which an event is associated, analyzing the categorization messages to generate an event record; and generating a report based on the event record including one or more performance measurements to indicate an effectiveness of management of the database connection pool.

Abstract: Methods and systems for managing data in a distributed system are disclosed. The distributed system may include devices used by users (e.g., clients) and devices in which data is stored for future accessibility (e.g., storage providers). A data storage system may manage the data for the clients. To manage the data efficiently, the data storage system may perform an integrated process of both verifying that segments of files believed to be stored are actually stored and segments of files that no longer need to be stored are removed. The process may not be performed in real-time as files that no longer need to be stored are identified (e.g., as deletion requests are received). Rather, the integrated process may employ a garbage collection process where deletion conditions for segments are checked intermittently over time, and files are verified.

Abstract: Embodiments for allocating and reclaiming memory using dynamic buffer allocation for a slab memory allocator. The method keeps track of a count of a total number of worker threads and a count of a total number of quiesced threads, and determines if there is any free slab memory. If there is no free slab memory, the method triggers an out of memory event and increments the count of the total number of quiesced threads. It reclaims all objects currently allocated in an object pool, and allocates a buffer of a next smaller size than an original buffer until a sufficient amount of slab memory is freed.

Abstract: Exemplary scope systems and methods involve a cannula assembly, a sheath assembly, and a tubing set. A cannula assembly, which may be a non-magnetic scope cap assembly, can include a cannula body, a proximal housing having a strap, an optical window, and a luer for suction or flushing. A cannula body may include a first lumen or scope channel for receiving a visualization device such as an endoscope or laparoscope, a distal end having suction or flushing flush apertures, and a second lumen for providing fluid communication between the apertures and the luer. Exemplary magnetic introducer systems and methods involve a cannula assembly, a sheath assembly, a tubing set. In some cases, the cannula assembly of a magnetic introducer system can be a magnetic scope cap assembly. In addition to cannula and sheath assemblies, magnetic introducer systems can include a magnetic introducer tubing assembly and a stylet assembly.

Abstract: A method, apparatus, and system for redistributing files in a multi-node storage system to improve global deduplication storage savings is disclosed. A plurality of file cluster candidates are generated for a plurality of files stored at a multi-node storage system comprising a plurality of data nodes. A similarity index is determined for each of the plurality of file cluster candidates based on similarity of the files comprised in the file cluster candidate. A ranked recipe list comprising a plurality of recipes is generated. Each recipe is associated with one of the plurality of file cluster candidates, comprises a destination data node for the associated file cluster candidate, and is associated with a deduplication space savings. At least some of the plurality of files are moved between the plurality of data nodes based on the recipes in the ranked recipe list to improve deduplication space savings in the multi-node storage system.

Abstract: Embodiments for a mostly unique file selection process for a deduplication backup system are described. The process assigns tags to files. A tag serves as a hint about the similarity of files in a deduplication file system. It is expected that files from the same client machine will be assigned the same tag. The tag is the smallest unit of migration and serves as a hint of the similarity of the files. The MUFS process measures the uniqueness using a u-index that is a function of the total unique size of a tag relative to the total size of the tag. A load balancer then selects the most unique tags for migration to free the maximum space. It uses the u-index to measure the uniqueness percentage of a tag, so that tags with the highest u-index are selected for migration to free up maximum space on the source node.

Abstract: Methods and systems are described for creating and/or processing a definition for a dashboard with manually input code and user selections in a graphical user interface. In some implementations, user interface elements are displayed and selections from a user accepted. Responsive to the selections, definitions for one or more visualizations and datasources are automatically generated and displayed in a user interface element that accepts manually input customizations and code from the user. The resulting combination of code and definitions is stored as a definition for the dashboard, which when processed will transform data received from the at least one of the datasources, combine the transformed data with data from another of the datasources, and cause the display of a visualization based on the combined data.

Abstract: Systems and methods for verifying files in bulk in a file system. When files are represented by a segment tree, the levels of the segment trees are walked by level such that that multiple files are verified at the same time in order to identify missing segments. Then, a bottom up scan is performed using the missing segments to identify the files corresponding to the missing segments. The missing files can then be handled by the file system.

Abstract: Systems and methods for verifying files in bulk in a file system. When files are represented by a segment tree, the levels of the segment trees are walked by level such that that multiple files are verified at the same time in order to identify missing segments. Then, a bottom up scan is performed using the missing segments to identify the files corresponding to the missing segments. The missing files can then be handled by the file system.

Abstract: Embodiments for a memory efficient perfect hashing for large records. A container ID set is divided into multiple fixed range sizes. These ranges are then mapped into perfect hash buckets until each bucket is filled to uniformly distribute the container IDs across different perfect hash buckets so that the number of CIDs in every perfect hash bucket is the same or nearly the same. Individual perfect hash functions are created for each perfect hash bucket. With container IDs as keys, the process maps n keys to n positions to reduce any extra memory overhead. The perfect hash function is implemented using a compress, hash, displace (CHD) algorithm using two levels of hash functions. The level 1 hash functions divides the keys into multiple internal buckets with a defined average number of keys per bucket. The CHD algorithm iteratively tries different level 2 hash variables to achieve collision-free mapping.

Abstract: Methods and systems are described for creating and/or processing a definition for a dashboard with manually input code and user selections in a graphical user interface. In some implementations, user interface elements are displayed and selections from a user accepted. Responsive to the selections, definitions for one or more visualizations and datasources are automatically generated and displayed in a user interface element that accepts manually input customizations and code from the user. The resulting combination of code and definitions is stored as a definition for the dashboard, which when processed will transform data received from the at least one of the datasources, combine the transformed data with data from another of the datasources, and cause the display of a visualization based on the combined data.