|
|
| (15 intermediate revisions by the same user not shown) |
| Line 28: |
Line 28: |
| | Ching-Huei Chen | | Ching-Huei Chen |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes a flying probe, which is a testing device used for printed circuit boards. The flying probe has a test module and a processor. The test module measures the difference in capacitance (delta capacitance) between multiple pairs of vias on the circuit board. The processor then compares these delta capacitances to a predetermined threshold value. If the delta capacitances associated with a specific via are equal to or greater than the threshold value, the processor identifies a potential problem with that via, known as a via stripping issue.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | A flying probe includes a test module and a processor. The test module measures a plurality of delta capacitances associated with a plurality of vias in a printed circuit board. The plurality of vias include first, second, third and fourth vias. Each different delta capacitance is measured between a different pair of the vias. The processor compares all the delta capacitances to a threshold value. In response to multiple delta capacitances associated with the first via being greater than or equal to the threshold value, the processor detects a possible via stripping issue for the first via.
| |
| | | | |
| | ===INFORMATION HANDLING SYSTEM MOUSE WITH HAPTIC SCROLL ([[US Patent Application 17726679. INFORMATION HANDLING SYSTEM MOUSE WITH HAPTIC SCROLL simplified abstract|17726679]])=== | | ===INFORMATION HANDLING SYSTEM MOUSE WITH HAPTIC SCROLL ([[US Patent Application 17726679. INFORMATION HANDLING SYSTEM MOUSE WITH HAPTIC SCROLL simplified abstract|17726679]])=== |
| Line 42: |
Line 36: |
| | Karthikeyan Krishnakumar | | Karthikeyan Krishnakumar |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes an information handling system mouse that has a scroll wheel and a five-way switch. The scroll wheel can be used to scroll up or down, swipe left or right, and click the mouse. There is also a button next to the scroll wheel that allows for precision or fast scrolling. The mouse also includes a vibration device that provides haptic feedback to the user, such as vibrations from below the scroll wheel.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | An information handling system mouse couples a scroll wheel at a scroll wheel position of the mouse upper surface to a five-way switch so that movement of the scroll wheel commands through the five-way switch a scroll up or down, a swipe left or right and a press down mouse click. An adjacent button provides precision or fast scroll through an interaction separate from the scroll wheel. A vibration device interfaced with the scroll wheel provides haptic feedback of end user interactions, such as by providing vibrations with a vertical orientation from a position below the scroll wheel.
| |
| | | | |
| | ===INFORMATION HANDLING SYSTEM MOUSE WITH PUSH BUTTON SCROLL ([[US Patent Application 17726685. INFORMATION HANDLING SYSTEM MOUSE WITH PUSH BUTTON SCROLL simplified abstract|17726685]])=== | | ===INFORMATION HANDLING SYSTEM MOUSE WITH PUSH BUTTON SCROLL ([[US Patent Application 17726685. INFORMATION HANDLING SYSTEM MOUSE WITH PUSH BUTTON SCROLL simplified abstract|17726685]])=== |
| Line 56: |
Line 44: |
| | Wong Hin Loong Justin | | Wong Hin Loong Justin |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes a feature of an information handling system mouse. It explains that the mouse has a precision scroll button located near the scroll wheel. This precision scroll button is connected to a multidirectional switch, which could be a five-way switch. When the precision scroll button is moved, it commands the five-way switch to scroll up or down at a speed determined by the user. This speed is independent of the scroll wheel speed. By moving the five-way switch forward or backward, the user can achieve fast scrolling at different rates.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | An information handling system mouse couples a precision scroll button located proximate a scroll wheel of the mouse upper surface to a multidirectional switch, such as a five-way switch, so that movement of the precision scroll button commands through the five-way switch a scroll up or down at a speed defined by the end user and independent of the scroll wheel speed. For instance, a fast scroll at different scroll rates is commanded by actuating the five-way switch forward or backwards.
| |
| | | | |
| | ===WEAR LEVELING BETWEEN STORAGE DEVICES OF A STORAGE SYSTEM BASED ON INPUT/OUTPUT PATTERNS OF STORAGE OBJECTS ([[US Patent Application 17743860. WEAR LEVELING BETWEEN STORAGE DEVICES OF A STORAGE SYSTEM BASED ON INPUT/OUTPUT PATTERNS OF STORAGE OBJECTS simplified abstract|17743860]])=== | | ===WEAR LEVELING BETWEEN STORAGE DEVICES OF A STORAGE SYSTEM BASED ON INPUT/OUTPUT PATTERNS OF STORAGE OBJECTS ([[US Patent Application 17743860. WEAR LEVELING BETWEEN STORAGE DEVICES OF A STORAGE SYSTEM BASED ON INPUT/OUTPUT PATTERNS OF STORAGE OBJECTS simplified abstract|17743860]])=== |
| Line 70: |
Line 52: |
| | Hailan Dong | | Hailan Dong |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes an apparatus that monitors input/output operations for storage objects on storage devices in a storage system. It identifies patterns in these operations that affect the wear level of the storage devices and determines the wear status of each device. Based on this information, the apparatus selects certain storage objects to be moved from one device to another in order to balance the wear levels across the system.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | An apparatus comprises a processing device configured to monitor input/output (IO) operations for storage objects stored on storage devices of a storage system for a designated period of time, to identify IO patterns associated with the storage objects, wherein the IO patterns are associated with different wear level impacts on the storage devices of the storage system, and to determine a wear status of each storage device of the storage system. The processing device is also configured to select one or more storage objects to move from a first to a second storage device of the storage system based at least in part on the monitored input/output operations, the identified IO patterns, and the determined wear status of each storage device. The processing device is further configured to move the selected storage objects from the first to the second storage device to perform wear level balancing for the storage system.
| |
| | | | |
| | ===LOAD BALANCING USING STORAGE SYSTEM DRIVEN HOST CONNECTIVITY MANAGEMENT ([[US Patent Application 17728606. LOAD BALANCING USING STORAGE SYSTEM DRIVEN HOST CONNECTIVITY MANAGEMENT simplified abstract|17728606]])=== | | ===LOAD BALANCING USING STORAGE SYSTEM DRIVEN HOST CONNECTIVITY MANAGEMENT ([[US Patent Application 17728606. LOAD BALANCING USING STORAGE SYSTEM DRIVEN HOST CONNECTIVITY MANAGEMENT simplified abstract|17728606]])=== |
| Line 84: |
Line 60: |
| | Adnan Sahin | | Adnan Sahin |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes a technique for load balancing in a storage system. It involves monitoring the distribution of input/output workload across the resources of the storage system. If an imbalance is detected, updated connection information is generated for a host system connected to the storage system. A request is then sent to the host system to discover the updated connection information for connecting to the storage system based on the updates.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Techniques are provided for load balancing in a storage system using a storage system-driven host connectivity management process. For example, a load balancing process comprises monitoring a distribution of input/output (I/O) workload across resources of a storage system to detect for an occurrence of an I/O workload imbalance, generating updated connection information for a host system connected to the storage system, in response to detecting the occurrence of an I/O workload imbalance, and sending a request to the host system to discover the updated connection information for connecting to the storage system based on the updated connection information.
| |
| | | | |
| | ===METHOD, ELECTRONIC DEVICE, AND COMPUTER PROGRAM PRODUCT FOR ALLOCATING STORAGE SPACE OF DISKS ([[US Patent Application 17987310. METHOD, ELECTRONIC DEVICE, AND COMPUTER PROGRAM PRODUCT FOR ALLOCATING STORAGE SPACE OF DISKS simplified abstract|17987310]])=== | | ===METHOD, ELECTRONIC DEVICE, AND COMPUTER PROGRAM PRODUCT FOR ALLOCATING STORAGE SPACE OF DISKS ([[US Patent Application 17987310. METHOD, ELECTRONIC DEVICE, AND COMPUTER PROGRAM PRODUCT FOR ALLOCATING STORAGE SPACE OF DISKS simplified abstract|17987310]])=== |
| Line 98: |
Line 68: |
| | Baote Zhuo | | Baote Zhuo |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes techniques for efficiently allocating storage space in a storage system. These techniques involve selecting storage nodes and disks based on previous selections and association relationships. The selected disks are then allocated to a redundant array of independent disks (RAID) stripe. This approach can support distributed storage systems with multiple nodes, reduce allocation time, and improve data recovery success rates.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Techniques for allocating storage space of disks in a storage system involve selecting a current storage node from a plurality of storage nodes according to at least one previously selected storage node and association relationships between the plurality of storage nodes. Such techniques further involve selecting a current disk from a plurality of disks according to at least one previously selected disk, the current storage node, and association relationships between the plurality of disks. Such techniques further involve allocating at least one slice in the current disk to a redundant array of independent disks (RAID) stripe. Such a technique can support a distributed storage system having more storage nodes, can greatly reduce the time for allocating the storage space of disks, and can make a RAID stripe evenly allocated between the storage nodes and the disks in the storage system, thereby greatly improving a success rate of data recovery.
| |
| | | | |
| | ===METHOD, DEVICE AND COMPUTER PROGRAM PRODUCT FOR LOCKING A STORAGE AREA IN A STORAGE SYSTEM ([[US Patent Application 17988979. METHOD, DEVICE AND COMPUTER PROGRAM PRODUCT FOR LOCKING A STORAGE AREA IN A STORAGE SYSTEM simplified abstract|17988979]])=== | | ===METHOD, DEVICE AND COMPUTER PROGRAM PRODUCT FOR LOCKING A STORAGE AREA IN A STORAGE SYSTEM ([[US Patent Application 17988979. METHOD, DEVICE AND COMPUTER PROGRAM PRODUCT FOR LOCKING A STORAGE AREA IN A STORAGE SYSTEM simplified abstract|17988979]])=== |
| Line 112: |
Line 76: |
| | Haiyun Bao | | Haiyun Bao |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes techniques for locking a storage area in a storage system that consists of two storage nodes. When a data access request is received by either of the nodes, the value of a counter at that node is adjusted. If the ratio of the first node's counter value to the second node's counter value exceeds a certain threshold, a lock flag is allocated to the first node, indicating that it has locked the storage area. This helps to reduce the storage resources required by nodes that are accessed more frequently, improving the efficiency of stripe lock reduction.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Techniques lock a storage area in a storage system including a first storage node and a second storage node. Such techniques involve adjusting a value of at least one of a first counter at the first node and a second counter at the second node in response to receiving a data access request for the storage area at at least one of the first node and the second node. Such techniques further involve allocating a lock flag to the first node in response to a ratio of the value of the first counter to the value of the second counter being greater than a first threshold, the lock flag indicating that the storage area is locked by the first node. Accordingly, storage resources required by nodes that are accessed more frequently in statistics are effectively reduced, and the efficiency of applying stripe lock reduction are improved.
| |
| | | | |
| | ===METHOD, ELECTRONIC DEVICE AND COMPUTER PROGRAM PRODUCT FOR PROCESSING DATA ([[US Patent Application 17993263. METHOD, ELECTRONIC DEVICE AND COMPUTER PROGRAM PRODUCT FOR PROCESSING DATA simplified abstract|17993263]])=== | | ===METHOD, ELECTRONIC DEVICE AND COMPUTER PROGRAM PRODUCT FOR PROCESSING DATA ([[US Patent Application 17993263. METHOD, ELECTRONIC DEVICE AND COMPUTER PROGRAM PRODUCT FOR PROCESSING DATA simplified abstract|17993263]])=== |
| Line 126: |
Line 84: |
| | Sheng Wang | | Sheng Wang |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes techniques for processing data more efficiently. When a request is made to access a specific block of data, the system checks if the block is in use. If it is, the system retrieves information about the arrangement of blocks on the storage devices. Based on this information, the system determines the specific block that contains the requested data. This allows for faster processing of the request, saving time and improving the user experience.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Techniques for processing data involve receiving an access request for a logical block used for storing data, the access request including a logical block address for the logical block. Such techniques further involve determining, if it is determined that the logical block address is in a used address space, an index entry corresponding to the logical block address from index entries, the index entry indicating arrangements of logical blocks on a corresponding pool stripe, wherein the pool stripe includes disk blocks from disks in a disk pool, and data blocks form at least one data stripe for a disk array. Such techniques further involve determining a target block corresponding to the logical block based on the index entry. Such techniques further involve processing the access request by using the target block. Accordingly, the processing speed of sequential I/O operations is improved, time is saved, and user experience is improved.
| |
| | | | |
| | ===MANAGING HOST CONNECTIVITY DURING NON-DISRUPTIVE MIGRATION IN A STORAGE SYSTEM ([[US Patent Application 17728488. MANAGING HOST CONNECTIVITY DURING NON-DISRUPTIVE MIGRATION IN A STORAGE SYSTEM simplified abstract|17728488]])=== | | ===MANAGING HOST CONNECTIVITY DURING NON-DISRUPTIVE MIGRATION IN A STORAGE SYSTEM ([[US Patent Application 17728488. MANAGING HOST CONNECTIVITY DURING NON-DISRUPTIVE MIGRATION IN A STORAGE SYSTEM simplified abstract|17728488]])=== |
| Line 140: |
Line 92: |
| | Rivka Mayraz Matosevich | | Rivka Mayraz Matosevich |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes a storage system that can migrate data from one storage system to another without interrupting access to the data by a host system. The first storage system sends requests to the host system to gather information on how to connect to the second storage system and disconnect from the first storage system during the migration process.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | A first storage system receives a request to migrate a volume from the first storage system to a second storage system, and commences a migration process to non-disruptively migrate the volume from the first storage system to the second storage system while the volume is being accessed by a host system. The first storage system sends a first request to the host system to discover information for connecting to the second storage system to allow the host system to access to the volume through the second storage system during the migration process. In addition, the first storage system sends a second request to the host system to discover information for disconnecting from the first storage system during a final stage of the migration process.
| |
| | | | |
| | ===METHOD, ELECTRONIC DEVICE AND COMPUTER PROGRAM PRODUCT FOR DATA PROCESSING ([[US Patent Application 17992542. METHOD, ELECTRONIC DEVICE AND COMPUTER PROGRAM PRODUCT FOR DATA PROCESSING simplified abstract|17992542]])=== | | ===METHOD, ELECTRONIC DEVICE AND COMPUTER PROGRAM PRODUCT FOR DATA PROCESSING ([[US Patent Application 17992542. METHOD, ELECTRONIC DEVICE AND COMPUTER PROGRAM PRODUCT FOR DATA PROCESSING simplified abstract|17992542]])=== |
| Line 154: |
Line 100: |
| | Zhe Yang | | Zhe Yang |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes a technique for processing data that involves creating a group of storage systems, selecting the best-performing storage system from that group, and copying data from one storage system to another. This technique allows for automatic data migration, which improves data security and the availability of storage systems.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Techniques for data processing involve creating a source group including a first storage system and a target group including a plurality of storage systems. Such techniques further involve selecting a second storage system from the plurality of storage systems in the target group based on the performance of the plurality of storage systems in the target group. Such techniques further involve copying data in the first storage system to the second storage system. Accordingly, automatic data migration can be achieved, thus improving the security of data and the availability of storage systems.
| |
| | | | |
| | ===TECHNIQUES FOR CREATING IDENTICAL SNAPSHOTS ON SYSTEMS DURING SYNCHRONOUS REPLICATION ([[US Patent Application 17725874. TECHNIQUES FOR CREATING IDENTICAL SNAPSHOTS ON SYSTEMS DURING SYNCHRONOUS REPLICATION simplified abstract|17725874]])=== | | ===TECHNIQUES FOR CREATING IDENTICAL SNAPSHOTS ON SYSTEMS DURING SYNCHRONOUS REPLICATION ([[US Patent Application 17725874. TECHNIQUES FOR CREATING IDENTICAL SNAPSHOTS ON SYSTEMS DURING SYNCHRONOUS REPLICATION simplified abstract|17725874]])=== |
| Line 168: |
Line 108: |
| | Nagasimha G. Haravu | | Nagasimha G. Haravu |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes a technique for creating identical snapshots of storage objects in two different systems. This is done by synchronously replicating the first storage object to the second system and enabling change tracking for the first storage object. Change tracking records any modifications made to the first storage object. Once change tracking is enabled, a snapshot of the second storage object is created. Then, a snapshot of the first storage object is created. After the snapshot of the first storage object is created, change tracking is disabled. Finally, the modified content of the first storage object is copied to the snapshot of the second storage object based on the recorded changes in the log.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Techniques for creating identical snapshots can include: performing synchronous replication between a first storage object of a first system and a second storage object of a second system; enabling change tracking for the first storage object that records in a log which portions of the first storage object are written or modified; responsive to enabling change tracking, creating a snapshot S of the second storage object of the second system; responsive to creating the snapshot S of the second storage object; creating a snapshot S of the first storage object of the first system; responsive to creating the snapshot S of the first storage object, disabling change tracking for the first storage object; and copying written or modified content of the first storage object as identified in the log to the snapshot S of the second storage object of the second system.
| |
| | | | |
| | ===FAILURE RECOVERY IN A REPLICATION ENVIRONMENT ([[US Patent Application 17813791. FAILURE RECOVERY IN A REPLICATION ENVIRONMENT simplified abstract|17813791]])=== | | ===FAILURE RECOVERY IN A REPLICATION ENVIRONMENT ([[US Patent Application 17813791. FAILURE RECOVERY IN A REPLICATION ENVIRONMENT simplified abstract|17813791]])=== |
| Line 182: |
Line 116: |
| | Keyur B. Desai | | Keyur B. Desai |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes a method for performing replication operations and failure recovery operations in a computing system using matrix clocks and replication controllers. The replication controller has access to vectors of a matrix clock and includes a multiplexer. The multiplexer is configured based on the matrix clock to manage an imbalance of resources. The matrix clock can be updated, which may require reconfiguring the multiplexer.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | One example method includes performing replication operations and/or failure recovery operations for replication operations in a computing system using matrix clocks and replication controllers. The replication controller includes or has access to vectors of a matrix clock. The replication controller also includes a multiplexer. The multiplexer is configured as an m×n multiplexer using the matrix clock to determine m and n. The operation is performed using the configured multiplexer. This allows an imbalance of resources to be managed by the replication controller. The matrix clock can be updated, which may result in the multiplexer being reconfigured.
| |
| | | | |
| | ===STORAGE SYSTEM INTERFACE DISCOVERY WITH LIMITED NUMBER OF PERSISTENT HOST DISCOVERY CONNECTIONS ([[US Patent Application 17726008. STORAGE SYSTEM INTERFACE DISCOVERY WITH LIMITED NUMBER OF PERSISTENT HOST DISCOVERY CONNECTIONS simplified abstract|17726008]])=== | | ===STORAGE SYSTEM INTERFACE DISCOVERY WITH LIMITED NUMBER OF PERSISTENT HOST DISCOVERY CONNECTIONS ([[US Patent Application 17726008. STORAGE SYSTEM INTERFACE DISCOVERY WITH LIMITED NUMBER OF PERSISTENT HOST DISCOVERY CONNECTIONS simplified abstract|17726008]])=== |
| Line 196: |
Line 124: |
| | Rivka Mayraz Matosevich | | Rivka Mayraz Matosevich |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes techniques for discovering storage system interfaces using a limited number of persistent host discovery connections. The method involves receiving a discovery connection request from a host interface, transforming the identifier of the host device to obtain the identifier of a storage system interface, and determining if the identifier matches the receiving storage system interface. If there is a match, the receiving storage system interface establishes a persistent discovery connection with the host interface and provides information about available storage system interfaces.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Techniques are provided for storage system interface discovery with a limited number of persistent host discovery connections. One method comprises receiving, by a receiving storage system interface of multiple storage system interfaces, a discovery connection request from a given host interface; transforming, by the receiving storage system interface, an identifier of a host device associated with the given host interface to obtain an identifier of a given storage system interface; determining, by the receiving storage system interface, whether the identifier of the given storage system interface identifies the receiving storage system interface; and in response to the identifier of the given storage system interface identifying the receiving storage system interface, the receiving storage system interface (i) provides a persistent discovery connection to the given host interface; and (ii) provides discovery information to the given host interface identifying a set of available storage system interfaces.
| |
| | | | |
| | ===CANARY DEPLOYMENTS BASED ON CHANGESET COMPLEXITY IN CONTAINERIZED ENVIRONMENTS ([[US Patent Application 17660123. CANARY DEPLOYMENTS BASED ON CHANGESET COMPLEXITY IN CONTAINERIZED ENVIRONMENTS simplified abstract|17660123]])=== | | ===CANARY DEPLOYMENTS BASED ON CHANGESET COMPLEXITY IN CONTAINERIZED ENVIRONMENTS ([[US Patent Application 17660123. CANARY DEPLOYMENTS BASED ON CHANGESET COMPLEXITY IN CONTAINERIZED ENVIRONMENTS simplified abstract|17660123]])=== |
| Line 210: |
Line 132: |
| | Boris Shpilyuck | | Boris Shpilyuck |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This system is designed to analyze the complexity of changes made to computer code that runs a group of microservices. It then creates a deployment plan that gradually deploys these changes to the microservices. The system also directs traffic to the microservices based on this deployment plan.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | The system can determine complexity data representative of a complexity of changes to computer code that is executable to operate at least one microservice that is part of a group of microservices. The system can generate a progressive deployment plan for the at least one microservice based on the complexity of changes. The system can progressively direct traffic to the at least one microservice based on the progressive deployment plan.
| |
| | | | |
| | ===PATCH UNINSTALLATION USING A SIGNED OPERATING SYSTEM INSTALL PACKAGE ([[US Patent Application 17660347. PATCH UNINSTALLATION USING A SIGNED OPERATING SYSTEM INSTALL PACKAGE simplified abstract|17660347]])=== | | ===PATCH UNINSTALLATION USING A SIGNED OPERATING SYSTEM INSTALL PACKAGE ([[US Patent Application 17660347. PATCH UNINSTALLATION USING A SIGNED OPERATING SYSTEM INSTALL PACKAGE simplified abstract|17660347]])=== |
| Line 224: |
Line 140: |
| | Jared O'Dell | | Jared O'Dell |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes a system that can uninstall a patch from a computer. The system uses cryptographic signatures to verify the authenticity of an operating system image and the package used to install the patch. It identifies the locations of the package and the operating system image, and extracts a file manifest from the package. It then extracts the versions of files listed in the manifest from the operating system image and stores them temporarily. Finally, it moves the extracted file versions back to their original locations in the computer's file system.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | A system can determine to uninstall a patch that is installed on a computer, wherein an image of an operating system of the computer and a package that was used to install the patch are cryptographically signed. The system can further identify a first stored location of the package, and a second stored location of the image of the operating system. The system can further extract a file manifest from the package at the first stored location. The system can further extract versions of files identified on the file manifest from the image of the operating system at the second stored location, resulting in extracted versions of files. The system can further store the extracted versions of files to a temporary storage location. The system can further move the extracted versions of files in the temporary storage location to respective original running locations of the versions of files.
| |
| | | | |
| | ===PROACTIVE PREVENTION OF DATA UNAVAILABILITY AND DATA LOSS ([[US Patent Application 17660737. PROACTIVE PREVENTION OF DATA UNAVAILABILITY AND DATA LOSS simplified abstract|17660737]])=== | | ===PROACTIVE PREVENTION OF DATA UNAVAILABILITY AND DATA LOSS ([[US Patent Application 17660737. PROACTIVE PREVENTION OF DATA UNAVAILABILITY AND DATA LOSS simplified abstract|17660737]])=== |
| Line 238: |
Line 148: |
| | Kaushik Gupta | | Kaushik Gupta |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes a system that can maintain a record of prohibited computer operations. This information is accessible to different computing clusters within a group of clusters, but it is stored separately from them. The system allows a first computing cluster to obtain this information through a service. When a request to perform an operation on a computer within the first cluster is received, the system checks the prohibited operations information. If the operation is prohibited, it prevents it from happening. If the operation is not prohibited, it allows it to occur.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | A system can maintain information indicative of prohibited computer operations, wherein the information is accessible to respective computing clusters of a group of computing clusters, and wherein the information is stored separately from the group of computing clusters. The system can obtain, by a service of a first computing cluster of the group of computing clusters, the information. The system can, in response to receiving, at the first computing cluster, a request to perform an operation on a first computer of the first computing cluster, in response to determining, based on the information, that the operation is prohibited, prevent the operation from occurring; and, in response to determining, based on the information, that the operation is not prohibited, permit the operation to occur.
| |
| | | | |
| | ===AUTOMATED ANALYSIS AND DYNAMIC RESOURCE CONFIGURATION FOR HARD PROVISIONED VIRTUAL MACHINES ([[US Patent Application 17725350. AUTOMATED ANALYSIS AND DYNAMIC RESOURCE CONFIGURATION FOR HARD PROVISIONED VIRTUAL MACHINES simplified abstract|17725350]])=== | | ===AUTOMATED ANALYSIS AND DYNAMIC RESOURCE CONFIGURATION FOR HARD PROVISIONED VIRTUAL MACHINES ([[US Patent Application 17725350. AUTOMATED ANALYSIS AND DYNAMIC RESOURCE CONFIGURATION FOR HARD PROVISIONED VIRTUAL MACHINES simplified abstract|17725350]])=== |
| Line 252: |
Line 156: |
| | JOSEPH B. CAISSE | | JOSEPH B. CAISSE |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes methods and systems for managing the allocation of virtual machines, which are used to host computer applications. These virtual machines are allocated hardware resources through a hypervisor. However, as the workload of the applications changes, the virtual machines may end up with too many or too few resources. To address this, the abstract proposes obtaining resource consumption estimates to determine how to provision the virtual machines more efficiently. This would help reduce or eliminate inefficient allocation of hardware resources for the virtual machines.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Methods and systems for managing provisioning of virtual machines. Virtual machines may host applications that may provide computer implemented services. Various hardware resources may be allocated to the virtual machines via a hypervisor. As the workloads of the applications change, the virtual machines may become over or under provisioned. To manage provisioning of virtual machines, various types of resource consumption estimates may be obtained. The resource consumption estimates may be used to ascertain how to provision various virtual machines to reduce or eliminate inefficient allocations of hardware resources for use by the virtual machines.
| |
| | | | |
| | ===CONTEXT-DRIVEN FRAMEWORK TO MIGRATE THE APPLICATIONS AND ITS DEPENDENCIES BY ANALYZING THE RELATIONSHIPS ([[US Patent Application 17726165. CONTEXT-DRIVEN FRAMEWORK TO MIGRATE THE APPLICATIONS AND ITS DEPENDENCIES BY ANALYZING THE RELATIONSHIPS simplified abstract|17726165]])=== | | ===CONTEXT-DRIVEN FRAMEWORK TO MIGRATE THE APPLICATIONS AND ITS DEPENDENCIES BY ANALYZING THE RELATIONSHIPS ([[US Patent Application 17726165. CONTEXT-DRIVEN FRAMEWORK TO MIGRATE THE APPLICATIONS AND ITS DEPENDENCIES BY ANALYZING THE RELATIONSHIPS simplified abstract|17726165]])=== |
| Line 266: |
Line 164: |
| | Parmnder Singh Sethi | | Parmnder Singh Sethi |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes methods, systems, and computer readable mediums for creating and executing migration workflows to transfer or move data from one device or set of devices to another. The migration process involves obtaining information about the relationships between applications that will be migrated and classifying them based on these relationships. A relationship matrix is then generated to prioritize the migration of each application, and the applications are migrated accordingly.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Embodiments described herein relate to methods, systems, and non-transitory computer readable mediums storing instructions for creating and executing migration workflows to replicate or migrate data (collectively referred to herein as ‘migration’) from one device or set of devices to another device or set of devices (e.g., from one computing environment to another). The method of migration involves obtaining relationship information with regards to the applications that will be migrated from one device to another device or set of devices, and classifying the applications based on their relationships such as HAS-A and IS-A. Based on these classifications, one or more embodiments of the invention generate a relationship matrix in order to assign priority to the migration of each individual application. The applications are then migrated based on the matrix and assigned priorities.
| |
| | | | |
| | ===SYSTEM AND METHOD OF ADAPTATIVE SCALABLE MICROSERVICE ([[US Patent Application 17660145. SYSTEM AND METHOD OF ADAPTATIVE SCALABLE MICROSERVICE simplified abstract|17660145]])=== | | ===SYSTEM AND METHOD OF ADAPTATIVE SCALABLE MICROSERVICE ([[US Patent Application 17660145. SYSTEM AND METHOD OF ADAPTATIVE SCALABLE MICROSERVICE simplified abstract|17660145]])=== |
| Line 280: |
Line 172: |
| | Jayashree Radha | | Jayashree Radha |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes a method for analyzing the workload of actors in a data storage platform. The method involves determining the load factor of the workload and applying certain criteria to the analysis. Based on these criteria, the method determines if additional actors are required to handle the workload. If additional actors are needed, they are spawned and the workload is balanced across the group of existing actors and the newly spawned actors.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | One example method includes analyzing a load factor regarding a workload for one or more actors in a data storage platform, applying one or more criteria to an output of the load factor analyzing, based on the applying a criterion from the one or more criteria, determining whether or not any additional actors are needed to perform the workload, when it is determined that one or more additional actors are needed to perform the workload, spawning the additional actors, and load balance the workload across a group that includes both the one or more actors and the additional actors that have been spawned.
| |
| | | | |
| | ===SYSTEM AND METHOD FOR RESOURCE MANAGEMENT IN DYNAMIC SYSTEMS ([[US Patent Application 17725254. SYSTEM AND METHOD FOR RESOURCE MANAGEMENT IN DYNAMIC SYSTEMS simplified abstract|17725254]])=== | | ===SYSTEM AND METHOD FOR RESOURCE MANAGEMENT IN DYNAMIC SYSTEMS ([[US Patent Application 17725254. SYSTEM AND METHOD FOR RESOURCE MANAGEMENT IN DYNAMIC SYSTEMS simplified abstract|17725254]])=== |
| Line 294: |
Line 180: |
| | HIMABINDU TUMMALA | | HIMABINDU TUMMALA |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes methods and systems for managing services in a distributed system. The system includes various deployments such as edge systems, internet of things devices, and other devices with limited computing capabilities. These deployments offer different computer services. To prevent overloading the deployments, resources for the services are reserved. Changes in the services are implemented by deploying only the necessary applications and features, reducing the amount of reserved resources. Information about the resource reservations is shared to ensure consistent views within the system.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Methods and systems managing services in a distributed system. The distributed system may include any number of deployments. The deployments may include edge systems, internet of things devices, and/or other types of devices that may have limited computing resource capabilities. The deployments may provide various computer implemented services. To reduce the change of the deployments being overloaded, resources for the various services hosted by the deployments may be reserved. To manage resources reservations, changes in services provided by the deployments may be implemented by deploying only those applications and/or features necessary to provide requested features. By doing so, a smaller quantity of resources for the deployed service may be reserved than would be reserved if a quantity of resources necessary for all of the potentially enabled features of the application were enabled. Information regarding the resource reservations may be published to facilitate consistent views within the system.
| |
| | | | |
| | ===SYSTEM AND METHOD OF ADAPTATIVE SCALABLE MICROSERVICE ([[US Patent Application 17804759. SYSTEM AND METHOD OF ADAPTATIVE SCALABLE MICROSERVICE simplified abstract|17804759]])=== | | ===SYSTEM AND METHOD OF ADAPTATIVE SCALABLE MICROSERVICE ([[US Patent Application 17804759. SYSTEM AND METHOD OF ADAPTATIVE SCALABLE MICROSERVICE simplified abstract|17804759]])=== |
| Line 308: |
Line 188: |
| | Jayashree Radha | | Jayashree Radha |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes a method for analyzing the workload of actors and determining the number of actors needed to perform the workload. Once the number of actors is determined, they are spawned and assigned to a pool. The pool is then throttled and the workload is load balanced across the actors in the pool.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | One example method includes analyzing a load factor regarding a workload for one or more actors, applying one or more criteria to an output of the load factor analyzing, based on the applying a criterion from the one or more criteria, determining how many actors are needed to perform the workload, when a number of actors needed to perform the workload is determined, spawning the actors and assigning the actors to a pool, throttling the pool, and based on the throttling, load balancing the workload across the actors in the pool.
| |
| | | | |
| | ===SYSTEM AND METHOD OF ADAPTATIVE SCALABLE MICROSERVICE ([[US Patent Application 17804774. SYSTEM AND METHOD OF ADAPTATIVE SCALABLE MICROSERVICE simplified abstract|17804774]])=== | | ===SYSTEM AND METHOD OF ADAPTATIVE SCALABLE MICROSERVICE ([[US Patent Application 17804774. SYSTEM AND METHOD OF ADAPTATIVE SCALABLE MICROSERVICE simplified abstract|17804774]])=== |
| Line 322: |
Line 196: |
| | Jayashree Radha | | Jayashree Radha |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes a method for analyzing the workload of actors in a data storage platform and determining if additional actors are needed. If additional actors are required, they are spawned and the workload is balanced across the group of actors. The method also includes temporarily deploying reserve actors to handle high priority workloads.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | One example method includes analyzing a load factor regarding a workload for one or more actors in a data storage platform, applying one or more criteria to an output of the load factor analyzing, based on the applying a criterion from the one or more criteria, determining whether or not any additional actors are needed to perform the workload, determining a number of reserve actors, when it is determined that one or more additional actors are needed to perform the workload, spawning the additional actors, and spawning the reserve actors, and load balancing the workload across a group that includes both the one or more actors and the additional actors that have been spawned, and the group does not include the reserve actors. The method also includes temporarily deploying one of the reserve actors to service a high priority workload.
| |
| | | | |
| | ===METHOD FOR RESOURCE RECOVERY, ELECTRONIC DEVICE, AND PROGRAM PRODUCT ([[US Patent Application 18129943. METHOD FOR RESOURCE RECOVERY, ELECTRONIC DEVICE, AND PROGRAM PRODUCT simplified abstract|18129943]])=== | | ===METHOD FOR RESOURCE RECOVERY, ELECTRONIC DEVICE, AND PROGRAM PRODUCT ([[US Patent Application 18129943. METHOD FOR RESOURCE RECOVERY, ELECTRONIC DEVICE, AND PROGRAM PRODUCT simplified abstract|18129943]])=== |
| Line 336: |
Line 204: |
| | Ellie Jiang | | Ellie Jiang |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes a method for resource recovery in a system, along with an electronic device and a program product. The method involves determining the relationship between the quantity of a resource to be used and time, as well as the relationship between the quantity of a resource to be recovered and time based on received resource recovery tasks. The method also includes adjusting the recovery sequence of these tasks to minimize the difference between the two relationships within a specific time period. Finally, the method involves executing the resource recovery tasks based on the adjusted sequence.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Embodiments of the present disclosure provide a method for resource recovery, an electronic device, and a program product. The method may include determining a first association relation between a first quantity of a to-be-used resource in a system and time. The method may further include determining a second association relation between a second quantity of the to-be-recovered resource in the system and time on the basis of a plurality of received resource recovery tasks. In addition, the method may include changing the second association relation by adjusting a recovery sequence of the plurality of resource recovery tasks so as to reduce a difference between the first association relation and the second association relation within a predetermined period. Further, the method may include executing the plurality of resource recovery tasks on the basis of the adjusted recovery sequence.
| |
| | | | |
| | ===LOAD DISTRIBUTION IN A DATA STORAGE SYSTEM ([[US Patent Application 17729219. LOAD DISTRIBUTION IN A DATA STORAGE SYSTEM simplified abstract|17729219]])=== | | ===LOAD DISTRIBUTION IN A DATA STORAGE SYSTEM ([[US Patent Application 17729219. LOAD DISTRIBUTION IN A DATA STORAGE SYSTEM simplified abstract|17729219]])=== |
| Line 350: |
Line 212: |
| | Yosef Shatsky | | Yosef Shatsky |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes techniques for managing load distribution in a data storage system. The system consists of storage server nodes and storage nodes, with each storage server node having one or more distribution targets. These distribution targets are logical processing units responsible for managing input/output operations to access data in the storage nodes.
| |
| − |
| |
| − | The process for managing load distribution involves partitioning the logical address space into multiple distribution items. The logical address space is then mapped to a sequence of distribution templates, where each template contains an ordered list of distribution targets from the storage server nodes. Each distribution template is unique.
| |
| − |
| |
| − | Finally, the distribution templates are used to map the distribution items of the logical address space to the distribution targets of the storage server nodes. This ensures an efficient distribution of the workload across the system.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Techniques are provided for managing load distribution in a data storage system which comprises storage sever nodes and storage nodes, wherein each storage server node comprises one or more distribution targets, wherein each distribution target comprises a logical processing unit that is configured to manage input/output operations for accessing data in the storage nodes. A process for managing the load distribution comprises: partitioning a logical address space into a plurality of distribution items; mapping the logical address space to a sequence of one or more distribution templates, wherein each distribution template comprises an ordered list of the distribution targets of the storage server nodes, which is uniquely different for each of the one or more distribution templates; and utilizing the one or more distribution templates to map the distribution items of the logical address space to the distribution targets of the storage server nodes.
| |
| | | | |
| | ===SYSTEM AND METHOD OF ADAPTATIVE SCALABLE MICROSERVICE ([[US Patent Application 17804746. SYSTEM AND METHOD OF ADAPTATIVE SCALABLE MICROSERVICE simplified abstract|17804746]])=== | | ===SYSTEM AND METHOD OF ADAPTATIVE SCALABLE MICROSERVICE ([[US Patent Application 17804746. SYSTEM AND METHOD OF ADAPTATIVE SCALABLE MICROSERVICE simplified abstract|17804746]])=== |
| Line 368: |
Line 220: |
| | Jayashree Radha | | Jayashree Radha |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes a method for analyzing the workload of actors in a data storage platform. The method involves determining the load factor of the workload and applying certain criteria to the analysis. Based on these criteria, the method determines the number of actors needed to perform the connected jobs and creates a swarm of actors accordingly. The connected jobs are then distributed evenly across the swarm of actors to achieve load balancing.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | One example method includes analyzing a load factor regarding a workload for one or more actors in a data storage platform, wherein the workload includes a group of two or more connected jobs, applying one or more criteria to an output of the load factor analyzing, based on the applying a criterion from the one or more criteria, determining how many actors should be included in a swarm of actors necessary to perform all of the connected jobs, spawning the swarm of actors, and load balancing the connected jobs across the swarm of actors.
| |
| | | | |
| | ===METHOD TO OPTIMIZE STORAGE PARTITION REDISCOVERY ([[US Patent Application 17727641. METHOD TO OPTIMIZE STORAGE PARTITION REDISCOVERY simplified abstract|17727641]])=== | | ===METHOD TO OPTIMIZE STORAGE PARTITION REDISCOVERY ([[US Patent Application 17727641. METHOD TO OPTIMIZE STORAGE PARTITION REDISCOVERY simplified abstract|17727641]])=== |
| Line 382: |
Line 228: |
| | Joel Miller | | Joel Miller |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes a storage management system that includes a user device manager running on an operating system. The user device manager sends a request for partition table data to a block device and receives the first partition data. It then sends a second request for partition data to the operating system's kernel and receives the second partition data, which is cached by the kernel. The system determines if the first and second partition data are identical, and if they are different, it performs a device discovery operation on the block device.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Disclosed is a storage management system comprising: sending, by a user device manager running at a user space of an operating system, a first request for partition table data to a block device; receiving, by the user device manager, first partition data of the block device; sending, by the user device manager, a second request for partition data of the block device to a kernel of the operating system; receiving, by the user device manager, second partition data from the kernel, wherein the second partition data is associated with the block device and cached by the kernel; determining whether the first partition data and the second partition data are identical; and in response to determining that the first partition data is different from the second partition data, performing a device discovery operation on the block device.
| |
| | | | |
| | ===SYSTEM AND METHOD FOR INFERENCE MODEL GENERALIZATION FOR A DISTRIBUTED ENVIRONMENT ([[US Patent Application 17726253. SYSTEM AND METHOD FOR INFERENCE MODEL GENERALIZATION FOR A DISTRIBUTED ENVIRONMENT simplified abstract|17726253]])=== | | ===SYSTEM AND METHOD FOR INFERENCE MODEL GENERALIZATION FOR A DISTRIBUTED ENVIRONMENT ([[US Patent Application 17726253. SYSTEM AND METHOD FOR INFERENCE MODEL GENERALIZATION FOR A DISTRIBUTED ENVIRONMENT simplified abstract|17726253]])=== |
| Line 396: |
Line 236: |
| | Ofir Ezrielev | | Ofir Ezrielev |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes methods and systems for managing the generalization of inference models in a distributed environment. The system includes a data aggregator and data collectors. The data aggregator obtains a similarity graph to understand the relationship between data collected by the data collectors. This similarity graph helps in grouping the data collectors. The data aggregator also trains inference models to assist the data collectors in their data collection tasks.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Methods and systems for managing generalization of inference models throughout a distributed environment are disclosed. To manage generalization of inference models, a system may include a data aggregator and one or more data collectors. The data aggregator may obtain a similarity graph in order to determine the relationship between data obtained by one or more data collectors. The similarity graph may be used to obtain grouping for the data collectors. The data aggregator may train inference models to facilitate data collection by the data collectors included in the grouping.
| |
| | | | |
| | ===AUTOMATED DYNAMIC RESOURCE CONFIGURATION FOR HARD PROVISIONED VIRTUAL MACHINES ([[US Patent Application 17725183. AUTOMATED DYNAMIC RESOURCE CONFIGURATION FOR HARD PROVISIONED VIRTUAL MACHINES simplified abstract|17725183]])=== | | ===AUTOMATED DYNAMIC RESOURCE CONFIGURATION FOR HARD PROVISIONED VIRTUAL MACHINES ([[US Patent Application 17725183. AUTOMATED DYNAMIC RESOURCE CONFIGURATION FOR HARD PROVISIONED VIRTUAL MACHINES simplified abstract|17725183]])=== |
| Line 410: |
Line 244: |
| | JOSEPH B. CAISSE | | JOSEPH B. CAISSE |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes methods and systems for managing the allocation of virtual machines. Virtual machines are used to host applications that provide computer services. These virtual machines are allocated hardware resources through a hypervisor. However, as the workload of the applications changes, the virtual machines may be either over or under provisioned, leading to inefficient use of hardware resources. To address this, the abstract proposes obtaining resource consumption estimates to determine how to provision the virtual machines more effectively, reducing or eliminating inefficient allocations of hardware resources.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Methods and systems for managing provisioning of virtual machines. Virtual machines may host applications that may provide computer implemented services. Various hardware resources may be allocated to the virtual machines via a hypervisor. As the workloads of the applications change, the virtual machines may become over or under provisioned. To manage provisioning of virtual machines, various types of resource consumption estimates may be obtained. The resource consumption estimates may be used to ascertain how to provision various virtual machines to reduce or eliminate inefficient allocations of hardware resources for use by the virtual machines.
| |
| | | | |
| | ===INTELLIGENT LOAD SCHEDULING IN A STORAGE SYSTEM ([[US Patent Application 17726853. INTELLIGENT LOAD SCHEDULING IN A STORAGE SYSTEM simplified abstract|17726853]])=== | | ===INTELLIGENT LOAD SCHEDULING IN A STORAGE SYSTEM ([[US Patent Application 17726853. INTELLIGENT LOAD SCHEDULING IN A STORAGE SYSTEM simplified abstract|17726853]])=== |
| Line 424: |
Line 252: |
| | Irit Brener-Shalem | | Irit Brener-Shalem |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes techniques for implementing intelligent load scheduling in a storage system. The method involves collecting various metrics related to workloads and using a machine learning model to predict the load on one or more servers. The machine learning model takes into account the weights assigned to each metric during its training process. Based on the load predicted by the model, the scheduling of additional processes on the servers is determined.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Techniques are provided for implementing intelligent load scheduling in a storage system. In an illustrative embodiment, a method comprises collecting a plurality of metrics corresponding to one or more workloads, and processing the plurality of metrics using a machine learning model to predict a load on at least one server. The machine learning model predicts the load on the at least one server based, at least in part, on weights for respective ones of the plurality of metrics generated during training of the machine learning model. In the method, execution by the at least one server of one or more processes in addition to the one or more workloads is scheduled based, at least in part, on the load predicted by the machine learning model.
| |
| | | | |
| | ===INTELLIGENT LOAD BALANCING IN A DISTRIBUTED SYSTEM ([[US Patent Application 17727505. INTELLIGENT LOAD BALANCING IN A DISTRIBUTED SYSTEM simplified abstract|17727505]])=== | | ===INTELLIGENT LOAD BALANCING IN A DISTRIBUTED SYSTEM ([[US Patent Application 17727505. INTELLIGENT LOAD BALANCING IN A DISTRIBUTED SYSTEM simplified abstract|17727505]])=== |
| Line 438: |
Line 260: |
| | George Mathew | | George Mathew |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes a method for load balancing in a distributed network filesystem. The network consists of multiple worker nodes that access shared resources controlled by distributed locks. To balance the workload, each worker node is assigned a range of directory entries. The worker nodes provide feedback to a load balancer, which includes information about the resources they have acquired and other parameters. Periodic updates are made to the directory ranges to ensure that complete subtrees of the directory tree fit within a single range assigned to a worker. When a client request is received to access a data asset, the load balancer selects the most suitable worker node based on their internal states and other parameters.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Embodiments for performing load balancing in a filesystem of a distributed network comprising worker nodes accessing shared resources that are controlled by distributed locks to grant and prevent access from clients, by assigning a range of directory entries to each worker node, and providing feedback from each worker node to a load balancer to expose an internal state of acquired resources and other parameters of each worker node. In response to periodic updates of the directory ranges to be collocated, the system maintains directory ranges in each worker so that complete subtrees of the directory tree fit in a single range assigned to a worker. Upon receipt of a client request to access a data asset, the load balancer selects the most optimum worker to satisfy the request based on the worker internal states and other parameters.
| |
| | | | |
| | ===CONTEXT SPECIFIC ORCHESTRATION OF DATA OBJECTS ([[US Patent Application 17726578. CONTEXT SPECIFIC ORCHESTRATION OF DATA OBJECTS simplified abstract|17726578]])=== | | ===CONTEXT SPECIFIC ORCHESTRATION OF DATA OBJECTS ([[US Patent Application 17726578. CONTEXT SPECIFIC ORCHESTRATION OF DATA OBJECTS simplified abstract|17726578]])=== |
| Line 452: |
Line 268: |
| | Srikanth KRISHNAMURTHY | | Srikanth KRISHNAMURTHY |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes a system and method for handling information in a computer system. It involves a background module that runs in the operating system of a client platform. This module evaluates the impact of user context changes, such as rebooting, launching applications, returning from sleep mode, changing network connections, or changing devices. It then takes appropriate action or recommends actions to be taken. The system can also enhance existing communication protocols, like the Server Message Block (SMB) protocol, which allows shared access to files in a distributed system.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Disclosed information handling systems and methods employ a background module running in an operating system of a client platform to evaluate, after defined context-relevant events including, as examples, reboot, application launch, return from sleep/idle mode, change of network connection, and change of device, the impact of the user context change, and to take or recommend appropriate action. Embodied solutions may augment existing communication protocols, such as the Server Message Block (SMB) protocol, that enable and support shared access to files across nodes of a distributed system.
| |
| | | | |
| | ===METHOD, ELECTRONIC DEVICE, AND COMPUTER PROGRAM PRODUCT FOR COLLECTING TRAINING DATA ([[US Patent Application 18137575. METHOD, ELECTRONIC DEVICE, AND COMPUTER PROGRAM PRODUCT FOR COLLECTING TRAINING DATA simplified abstract|18137575]])=== | | ===METHOD, ELECTRONIC DEVICE, AND COMPUTER PROGRAM PRODUCT FOR COLLECTING TRAINING DATA ([[US Patent Application 18137575. METHOD, ELECTRONIC DEVICE, AND COMPUTER PROGRAM PRODUCT FOR COLLECTING TRAINING DATA simplified abstract|18137575]])=== |
| Line 466: |
Line 276: |
| | Spencer Sheng | | Spencer Sheng |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes a method, electronic device, and computer program for collecting training data. The method involves scanning multiple data sources to gather information about the training data to be collected. Based on this information, a collection list is created, which includes identifiers and storage locations of the training data in the data sources. The method then proceeds to collect the training data from the data sources using the collection list.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Embodiments of the present disclosure relate to a method, an electronic device, and a computer program product for collecting training data. The method for collecting training data provided in embodiments of the present disclosure includes: scanning a plurality of data sources to acquire information relating to a plurality of training data to be collected, and creating a collection list based on the information, the collection list including at least a plurality of identifiers of the plurality of training data and a plurality of storage locations of the plurality of training data in the plurality of data sources. The method further includes: collecting the plurality of training data from the plurality of data sources based at least on the collection list.
| |
| | | | |
| | ===INTELLIGENT FILE SYSTEM CRAWLING FOR PROTECTION OPERATION ([[US Patent Application 17724646. INTELLIGENT FILE SYSTEM CRAWLING FOR PROTECTION OPERATION simplified abstract|17724646]])=== | | ===INTELLIGENT FILE SYSTEM CRAWLING FOR PROTECTION OPERATION ([[US Patent Application 17724646. INTELLIGENT FILE SYSTEM CRAWLING FOR PROTECTION OPERATION simplified abstract|17724646]])=== |
| Line 480: |
Line 284: |
| | Aaditya Bansal | | Aaditya Bansal |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The invention described in the abstract is a method for performing incremental backups by only crawling folders that have changed. A file system crawler compares the attributes of a folder with those in a backup's meta-data to determine if the files and sub-folders within the folder have been modified. If changes are detected, the crawler proceeds to crawl the sub-folders. If no changes are found, the crawler moves on to the next folder without crawling its sub-folders. This approach allows for faster crawling of the entire file system, as unchanged folders are not processed.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | One or more embodiments of the invention performs an incremental backup by crawling only those folders which have changed. By comparing a folder's attributes with those in a backup's meta-data, an intelligent file system crawler can determine if the underlying files and sub-folders of the folder have undergone a change. If they have, then the one or more embodiments of the invention proceeds to crawl the underlying sub-folders. If the folder's attributes have not changed, then the intelligent file system crawler of one or more embodiments of the invention proceeds to the next folder and does not crawl the underlying sub-folders. By doing this, one or more embodiments of the invention can crawl the entire file system quicker, since those folders that have not undergone a change since the last backup was performed, do not have their sub-folders crawled.
| |
| | | | |
| | ===TOPOLOGICAL VIEW AND INSIGHTS OF ORGANIZATION INFORMATION TECHNOLOGY ENVIRONMENT BASED ON BARE-METAL RECOVERY AND SYSTEM-STATE RECOVERY DATA AND METADATA ([[US Patent Application 17726873. TOPOLOGICAL VIEW AND INSIGHTS OF ORGANIZATION INFORMATION TECHNOLOGY ENVIRONMENT BASED ON BARE-METAL RECOVERY AND SYSTEM-STATE RECOVERY DATA AND METADATA simplified abstract|17726873]])=== | | ===TOPOLOGICAL VIEW AND INSIGHTS OF ORGANIZATION INFORMATION TECHNOLOGY ENVIRONMENT BASED ON BARE-METAL RECOVERY AND SYSTEM-STATE RECOVERY DATA AND METADATA ([[US Patent Application 17726873. TOPOLOGICAL VIEW AND INSIGHTS OF ORGANIZATION INFORMATION TECHNOLOGY ENVIRONMENT BASED ON BARE-METAL RECOVERY AND SYSTEM-STATE RECOVERY DATA AND METADATA simplified abstract|17726873]])=== |
| Line 494: |
Line 292: |
| | Sunil Yadav | | Sunil Yadav |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes a method and system for creating a visual representation of an organization's IT environment using data and information from bare-metal recovery and system-state recovery processes. The IT environment includes network resources and active directory services that organize and manage these resources. The active directory services gather information that can be used to create a visual representation of the network resources throughout the organization. By leveraging this information and backup operation metadata, an organization metadata tree can be constructed. This metadata tree can then be used to answer queries about file-system object generation, distribution, and usage within the organization.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | A method and system for implementing a topological view and insights of organization information technology (IT) environments based on bare-metal recovery and/or system-state recovery data and metadata. Often, one or many IT environment(s), affiliated with an organization, include various network resources, as well active directory service(s) for organizing, locating, and managing said network resources. Active directory service(s) may further gather and provide information pertinent to modeling a topological view of said network resources throughout the organization. Leveraging said information gleaned from any active directory service(s), as well as backup operation metadata generated during or following backup operations targeting workloads and their respective data, which support bare-metal and/or system-state recoveries, embodiments disclosed herein propose the construction of an organization metadata tree. Once rendered, the organization metadata tree may be leveraged itself to process queries concerning, for example, file-system object generation, distribution, and/or usage respective to any tier or granularity of the organization.
| |
| | | | |
| | ===SHARED WORKLOAD ANOMALY DETECTION ACROSS MULTIPLE HOSTS BASED ON BARE-METAL RECOVERY AND SYSTEM-STATE RECOVERY DATA AND METADATA ([[US Patent Application 17726982. SHARED WORKLOAD ANOMALY DETECTION ACROSS MULTIPLE HOSTS BASED ON BARE-METAL RECOVERY AND SYSTEM-STATE RECOVERY DATA AND METADATA simplified abstract|17726982]])=== | | ===SHARED WORKLOAD ANOMALY DETECTION ACROSS MULTIPLE HOSTS BASED ON BARE-METAL RECOVERY AND SYSTEM-STATE RECOVERY DATA AND METADATA ([[US Patent Application 17726982. SHARED WORKLOAD ANOMALY DETECTION ACROSS MULTIPLE HOSTS BASED ON BARE-METAL RECOVERY AND SYSTEM-STATE RECOVERY DATA AND METADATA simplified abstract|17726982]])=== |
| Line 508: |
Line 300: |
| | Sunil Yadav | | Sunil Yadav |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes a method and system for detecting anomalies in shared workloads across multiple hosts. The system uses data and metadata from bare-metal recovery and system-state recovery to compare the behavior of workloads operating on different hosts. By comparing this metadata, patterns of data generation can be identified. Additionally, metadata generated by shared workload instances should be consistent across all hosts. If there are any discrepancies in the metadata generated by a shared workload instance on one or more hosts compared to a baseline instance, it could indicate unwanted anomalies. These anomalies can then be further analyzed and appropriate actions can be taken. The proposed embodiments aim to compare metadata from non-baseline shared workload instances with metadata from the baseline instance to detect and resolve anomalies related to shared workload behavior and functionality.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | A method and system for shared workload anomaly detection across multiple hosts based on bare-metal recovery and/or system-state recovery data and metadata. Since at least said bare-metal recovery and/or system-state recovery metadata has information about each workload operating on one or many host(s), comparing said metadata across any set of hosts could provide the pattern of data being generated there-across. Further, other metadata generated by any shared workload instance(s), operating on a set of hosts, should be consistent across the set of hosts. Should a shared workload instance on one or more hosts generate metadata not sync with metadata generated from a baseline shared workload instance, such discrepancies could be a sign of unwanted anomalies that may warrant further analyses, alerts, etc. Embodiments disclosed herein, accordingly, propose comparing metadata from non-baseline shared workload instances against metadata from the baseline shared workload instance, in order to detect and/or resolve anomalies concerning shared workload instance behavior and/or functionality.
| |
| | | | |
| | ===METHOD AND APPARATUS FOR DETECTING PRE-ARRIVAL OF DEVICE OR COMPONENT FAILURE ([[US Patent Application 17660236. METHOD AND APPARATUS FOR DETECTING PRE-ARRIVAL OF DEVICE OR COMPONENT FAILURE simplified abstract|17660236]])=== | | ===METHOD AND APPARATUS FOR DETECTING PRE-ARRIVAL OF DEVICE OR COMPONENT FAILURE ([[US Patent Application 17660236. METHOD AND APPARATUS FOR DETECTING PRE-ARRIVAL OF DEVICE OR COMPONENT FAILURE simplified abstract|17660236]])=== |
| Line 522: |
Line 308: |
| | Parminder Singh Sethi | | Parminder Singh Sethi |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This method describes a process for migrating data from one system to another. The migration is divided into several checkpoints. The method checks if any of these checkpoints have been reached and obtains a health score for the source system based on this. If the health score meets a certain condition, an action is taken to prevent any data loss during the migration. If the health score does not meet the condition, no action is taken to prevent data loss.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | A method including: initiating a migration of data from a source system to a destination system, the migration of data being configured to proceed based on a checkpoint set that includes a plurality of checkpoints; detecting whether any of the checkpoints in the checkpoint set is reached; obtaining a health score for the source system, the health score being obtained in response to any of the checkpoints being reached; if the health score satisfies a condition, executing an action to prevent a loss of data that is being migrated; and if the health score does not satisfy the condition, abstaining from executing the action to prevent the loss of data.
| |
| | | | |
| | ===BALANCING OF SLICES WITH CONSOLIDATION AND RE-SLICING ([[US Patent Application 17660773. BALANCING OF SLICES WITH CONSOLIDATION AND RE-SLICING simplified abstract|17660773]])=== | | ===BALANCING OF SLICES WITH CONSOLIDATION AND RE-SLICING ([[US Patent Application 17660773. BALANCING OF SLICES WITH CONSOLIDATION AND RE-SLICING simplified abstract|17660773]])=== |
| Line 536: |
Line 316: |
| | Soumen Acharya | | Soumen Acharya |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes a method used in a network attached storage platform. When a slice of data in the platform exceeds a certain size threshold, it is divided into multiple smaller slices. This process continues until all slices in a share have been evaluated. The result is a list of these new smaller slices.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | One example method includes, in a network attached storage platform, determining a size of a slice of data that is included in a share of the network attached storage platform, when the size of the slice exceeds a threshold, re-slicing the slice to generate multiple new slices, and each of the new slices has a size that is smaller than the threshold, and when all slices in the share have been evaluated in terms of their respective sizes, generating a slice list that includes the new slices.
| |
| | | | |
| | ===CAPACITY-BASED REDIRECTION EFFICIENCY AND RESILIENCY ([[US Patent Application 17725087. CAPACITY-BASED REDIRECTION EFFICIENCY AND RESILIENCY simplified abstract|17725087]])=== | | ===CAPACITY-BASED REDIRECTION EFFICIENCY AND RESILIENCY ([[US Patent Application 17725087. CAPACITY-BASED REDIRECTION EFFICIENCY AND RESILIENCY simplified abstract|17725087]])=== |
| Line 550: |
Line 324: |
| | Viral Mehta | | Viral Mehta |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes a system where a database manager keeps track of storage units and storage appliances. Some of this tracking information is stored in a server cache and client caches. When a client wants to access a storage unit but encounters a problem using its cache, it queries the namespace redirection server for updated information about the storage unit's location. The client also helps manage the server cache.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | A database manager maintains a database including information tracking a set of storage units and a set of storage appliances on which the storage units currently reside. At least a portion of the tracking information is cached in a server cache at a namespace redirection server. Some of the tracking information is cached in a set of client caches at a set of clients. A request to access a storage unit is received at a client. A lookup is made into a client cache at the client to find a storage appliance having the storage unit. A determination is made that there is a problem accessing the storage unit using the client cache. So, the namespace redirection server is queried for updated tracking information concerning a location of the storage unit. The client assists the namespace redirection server with management of the server cache.
| |
| | | | |
| | ===METHOD AND SYSTEM FOR PROTECTING DATA DURING DATA MIGRATION ([[US Patent Application 17725690. METHOD AND SYSTEM FOR PROTECTING DATA DURING DATA MIGRATION simplified abstract|17725690]])=== | | ===METHOD AND SYSTEM FOR PROTECTING DATA DURING DATA MIGRATION ([[US Patent Application 17725690. METHOD AND SYSTEM FOR PROTECTING DATA DURING DATA MIGRATION simplified abstract|17725690]])=== |
| Line 564: |
Line 332: |
| | Upanshu Singhal | | Upanshu Singhal |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes a method for managing data backup. It involves identifying a specific type of asset source and creating a data transfer path for multiple snapshots associated with that asset source. The backup process is then initiated for user data, which is transferred to a target client device. The snapshots are obtained by a data protection system using the data transfer path, while the user data is backed up on the target client device. Once the snapshots are successfully stored in the data protection system, they are deleted from the source client device.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | A method for managing data backup includes: making a determination that an asset source is a first type of asset source, in which a source client device comprises the asset source; generating, based on the determination, a data transfer path for a plurality of snapshots associated with the asset source between the source client device and a data protection system; initiating a backup for user data associated with the asset source to a target client device; obtaining the plurality of snapshots to the data protection system using the data transfer path, in which the user data is backed up in the target client device while at least a portion of the plurality of snapshots is obtained by the data protection system; and deleting the plurality of snapshots from the source client device, upon receipt of confirmation that the plurality of snapshots is successfully stored in the data protection system.
| |
| | | | |
| | ===METHOD, ELECTRONIC DEVICE, AND COMPUTER PROGRAM PRODUCT FOR DELETING BACKUP DATA ([[US Patent Application 17827461. METHOD, ELECTRONIC DEVICE, AND COMPUTER PROGRAM PRODUCT FOR DELETING BACKUP DATA simplified abstract|17827461]])=== | | ===METHOD, ELECTRONIC DEVICE, AND COMPUTER PROGRAM PRODUCT FOR DELETING BACKUP DATA ([[US Patent Application 17827461. METHOD, ELECTRONIC DEVICE, AND COMPUTER PROGRAM PRODUCT FOR DELETING BACKUP DATA simplified abstract|17827461]])=== |
| Line 578: |
Line 340: |
| | Zengjie ZHANG | | Zengjie ZHANG |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes a method, electronic device, and computer program for deleting backup data. The method involves determining non-backup time periods for an object based on backup time periods. A subset of non-backup time periods is selected based on their length, and backup data for the object is deleted during these selected time periods. This approach improves the success rate of deleting unnecessary backup data.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Embodiments of the present disclosure provide a method, an electronic device, and a computer program product for deleting backup data. The method includes determining a set of non-backup time periods for an object based on a set of backup time periods for the object. The method further includes selecting a subset of non-backup time periods from the set of non-backup time periods on the basis of a time length. The method further includes deleting backup data of the object in the subset of non-backup time periods. By the embodiments of the present disclosure, a suitable time period can be selected, and unnecessary backup data is effectively deleted from the selected time period, thus improving the success rate of deletion of backup data.
| |
| | | | |
| | ===CLOUD AWARE FILE SYSTEM RESTORES ([[US Patent Application 17724616. CLOUD AWARE FILE SYSTEM RESTORES simplified abstract|17724616]])=== | | ===CLOUD AWARE FILE SYSTEM RESTORES ([[US Patent Application 17724616. CLOUD AWARE FILE SYSTEM RESTORES simplified abstract|17724616]])=== |
| Line 592: |
Line 348: |
| | Sunil Yadav | | Sunil Yadav |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes a method for restoring data from a backup stored on the cloud. The backup data and metadata are not synchronized with the local metadata. To restore the data, the backup data and metadata are copied to the desired location on the production host. Then, the backup metadata is linked with the backup data to complete the restoration process. This approach helps avoid delays in production workloads and maintains productivity.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | In accordance with one or more embodiments of the invention, when restoring data from a backup that is at least partially stored on the cloud, the meta-data and data forming the backup are not in sync with the local meta-data. When restoring the data, once the backup data and backup data is copied to the desired location on the production host, the backup data and backup meta-data need to be linked back up. Once the backup data and backup meta-data is copied to the target production host, the backup meta-data is linked with the backup data and then the restoration is indicated as having been completed. By performing the linkage during the restoration, prior to the restore being indicated as being complete, delays in production workloads and productivity can be avoided.
| |
| | | | |
| | ===WORKLOAD ANOMALY DETECTION FOR STANDALONE HOSTS BASED ON BARE-METAL RECOVERY AND SYSTEM-STATE RECOVERY DATA AND METADATA ([[US Patent Application 17726973. WORKLOAD ANOMALY DETECTION FOR STANDALONE HOSTS BASED ON BARE-METAL RECOVERY AND SYSTEM-STATE RECOVERY DATA AND METADATA simplified abstract|17726973]])=== | | ===WORKLOAD ANOMALY DETECTION FOR STANDALONE HOSTS BASED ON BARE-METAL RECOVERY AND SYSTEM-STATE RECOVERY DATA AND METADATA ([[US Patent Application 17726973. WORKLOAD ANOMALY DETECTION FOR STANDALONE HOSTS BASED ON BARE-METAL RECOVERY AND SYSTEM-STATE RECOVERY DATA AND METADATA simplified abstract|17726973]])=== |
| Line 606: |
Line 356: |
| | Sunil Yadav | | Sunil Yadav |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes a method and system for detecting abnormal behavior or functionality in workloads running on standalone hosts. Workloads may behave unpredictably when exposed to external factors, and administrators often overlook these factors and their impact on workload behavior. By using data and metadata from bare-metal recovery and system-state recovery operations, this system can identify anomalies in workload behavior on any host.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | A method and system for workload anomaly detection for standalone hosts based on bare-metal recovery and/or state-system recovery data and metadata. In isolated circumstances, workloads tend to operate as expected, however, their behavior and/or functionality may become unpredictable when said workloads are exposed to other factors outside of isolation. Further, most of these other factors, as well as their influence on workload behavior and/or functionality tend to go unnoticed by administrators. Data and/or metadata, pertinent to bare-metal recovery and/or system-state recovery operations, may capture host-relevant information, including which workload(s) is/are installed on a host, which file-system objects maintained thereon belong to which installed workload, and what is the nature and storage location of each file-system object. In leveraging said bare-metal recovery and/or system-state recovery data and/or metadata, embodiments disclosed herein detect behavioral or functional anomalies exhibited by any workload operating on any given host.
| |
| | | | |
| | ===FAILURE RECOVERY IN A REPLICATION ENVIRONMENT ([[US Patent Application 17660528. FAILURE RECOVERY IN A REPLICATION ENVIRONMENT simplified abstract|17660528]])=== | | ===FAILURE RECOVERY IN A REPLICATION ENVIRONMENT ([[US Patent Application 17660528. FAILURE RECOVERY IN A REPLICATION ENVIRONMENT simplified abstract|17660528]])=== |
| Line 620: |
Line 364: |
| | Keyur B. Desai | | Keyur B. Desai |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes a method for performing replication operations and recovering from failures in a computing system using matrix clocks. Each node or process in the system has a matrix clock that keeps track of the streams required and available at the source and destination nodes. During replication, the matrix clocks are updated. If a failure is detected or there are not enough streams available, the nodes may be slowed down until enough streams become available. The matrix clocks help establish a recovery line, allowing replication to resume once sufficient streams are available.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | One example method includes performing replication operations and/or failure recovery operations for replication operations in a computing system using matrix clocks. Each node or process in a computing system is associated with a matrix clock that reflects streams required and/or available at the source and destination nodes. As the replication operation is performed, the matrix clocks are updated. When a failure is detected or when insufficient streams are available, the nodes may be throttled until sufficient streams are available. The matrix clocks facilitate a recovery line such that replication can resume when sufficient streams are available.
| |
| | | | |
| | ===MODULAR TEST SYSTEM ([[US Patent Application 17729052. MODULAR TEST SYSTEM simplified abstract|17729052]])=== | | ===MODULAR TEST SYSTEM ([[US Patent Application 17729052. MODULAR TEST SYSTEM simplified abstract|17729052]])=== |
| Line 634: |
Line 372: |
| | Matthew Borsini | | Matthew Borsini |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes a test system that consists of three modular subsystems: a controller subsystem, a tested subsystem, and an intermediary subsystem. The controller subsystem controls the testing operations, while the intermediary subsystem acts as a communication link between the controller and tested subsystems. It not only transmits communications but also performs additional testing functions that are not available in the controller subsystem.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | A modular test system includes a modular controller subsystem coupled to a modular tested subsystem by a modular intermediary subsystem. The modular intermediary subsystem transmits communications between the modular controller subsystem and the modular tested subsystem during testing operations performed by the modular controller subsystem, and performs at least one testing function that is not available in the modular controller subsystem during the testing operations performed by the modular controller subsystem.
| |
| | | | |
| | ===SYSTEM AND METHOD FOR DYNAMIC SELECTION OF A GARBAGE COLLECTOR FOR JAVA-BASED MICROSERVICES ([[US Patent Application 17834954. SYSTEM AND METHOD FOR DYNAMIC SELECTION OF A GARBAGE COLLECTOR FOR JAVA-BASED MICROSERVICES simplified abstract|17834954]])=== | | ===SYSTEM AND METHOD FOR DYNAMIC SELECTION OF A GARBAGE COLLECTOR FOR JAVA-BASED MICROSERVICES ([[US Patent Application 17834954. SYSTEM AND METHOD FOR DYNAMIC SELECTION OF A GARBAGE COLLECTOR FOR JAVA-BASED MICROSERVICES simplified abstract|17834954]])=== |
| Line 648: |
Line 380: |
| | Min Liu | | Min Liu |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes a process for optimizing the performance of a microservice by analyzing its garbage collection cycles. The log of these cycles includes information about the garbage collection events and the time it takes for each event to pause the microservice. When a certain number of consecutive garbage collection events with pause times exceeding a threshold is reached, a change is made to the microservice's configuration file to reduce the pause times in the next cycle. Once the microservice is idle, a command is generated to restart it so that the changes in the configuration file can take effect.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | A log generated over a time period of garbage collection cycles of a microservice is reviewed. The log includes garbage collection events and pause times for each event. A determination is made that a threshold number of consecutive garbage collection events has been reached where each consecutive event had a pause time exceeding a threshold pause time. Upon the determination, a change is made to a configuration file associated with the microservice to reduce the pause times for a next time period. Once the microservice enters an idle state, a command is generated to restart the microservice for the change in the configuration file to take effect.
| |
| | | | |
| | ===METHODS AND SYSTEMS FOR PROCESSOR AGNOSTIC ENCRYPTION MANAGEMENT ([[US Patent Application 17729706. METHODS AND SYSTEMS FOR PROCESSOR AGNOSTIC ENCRYPTION MANAGEMENT simplified abstract|17729706]])=== | | ===METHODS AND SYSTEMS FOR PROCESSOR AGNOSTIC ENCRYPTION MANAGEMENT ([[US Patent Application 17729706. METHODS AND SYSTEMS FOR PROCESSOR AGNOSTIC ENCRYPTION MANAGEMENT simplified abstract|17729706]])=== |
| Line 662: |
Line 388: |
| | Michael Andrew Bennett | | Michael Andrew Bennett |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes a method for securing memory using an external memory controller. The method involves the following steps:
| |
| − |
| |
| − | 1. The external memory controller receives a request from a processor core to allocate a specific memory region.
| |
| − | 2. In response to the request, the memory controller allocates the requested memory region from the memory.
| |
| − | 3. The memory controller associates the processor core with the allocated memory region, indicating that the core has access to that specific region.
| |
| − | 4. Additionally, the memory controller associates an encryption key and a decryption key with the allocated memory region. These keys are used to encrypt and decrypt the data stored in that region, providing an extra layer of security.
| |
| − |
| |
| − | In summary, the method ensures that memory is allocated securely by associating the processor core, encryption key, and decryption key with the allocated memory region.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | A method for securing memory via an external memory controller, that includes receiving, by the external memory controller, an allocation request to allocate a memory region from a processor core, and in response to receiving the allocation request, allocating the memory region from the memory, associating the processor core with the memory region, and associating an encryption key and a decryption key with the memory region.
| |
| | | | |
| | ===SMART NETWORK INTERFACE CONTROLLER OPERATING SYSTEM DEPLOYMENT ([[US Patent Application 17729217. SMART NETWORK INTERFACE CONTROLLER OPERATING SYSTEM DEPLOYMENT simplified abstract|17729217]])=== | | ===SMART NETWORK INTERFACE CONTROLLER OPERATING SYSTEM DEPLOYMENT ([[US Patent Application 17729217. SMART NETWORK INTERFACE CONTROLLER OPERATING SYSTEM DEPLOYMENT simplified abstract|17729217]])=== |
| Line 683: |
Line 396: |
| | Deepaganesh PAULRAJ | | Deepaganesh PAULRAJ |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes an information handling system that consists of a host system, a management controller, and a network interface. The management controller is responsible for managing the information handling system remotely. The network interface includes a storage resource. The management controller receives information from the host system regarding the installation of a network interface operating system. It then transmits this information to the network interface and instructs it to install the network interface operating system onto its storage resource.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | An information handling system may include a host system, a management controller configured to provide out-of-band management of the information handling system, and a network interface including a network interface storage resource. The management controller may be configured to: receive, from the host system, information relating to installation of a network interface operating system; transmit the information to the network interface; and cause the network interface to install the network interface operating system onto the network interface storage resource.
| |
| | | | |
| | ===SMART NETWORK INTERFACE CONTROLLER OPERATING SYSTEM BINDING ([[US Patent Application 17730076. SMART NETWORK INTERFACE CONTROLLER OPERATING SYSTEM BINDING simplified abstract|17730076]])=== | | ===SMART NETWORK INTERFACE CONTROLLER OPERATING SYSTEM BINDING ([[US Patent Application 17730076. SMART NETWORK INTERFACE CONTROLLER OPERATING SYSTEM BINDING simplified abstract|17730076]])=== |
| Line 697: |
Line 404: |
| | Deepaganesh PAULRAJ | | Deepaganesh PAULRAJ |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes an information handling system that includes a host system and a management controller for out-of-band management. The system also includes a network interface controller with its own storage resource. The management controller is designed to receive an identifier specific to the operating system of the host system and compare it to an identifier provided by the network interface controller. If there is a mismatch between the two identifiers, the management controller will prevent the network interface controller from operating.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | An information handling system may include a host system, a management controller configured to provide out-of-band management of the information handling system, and a network interface controller including a network interface controller storage resource. The management controller may be configured to: receive, from the host system, a first identifier that is specific to an operating system (OS) of the host system; compare the first identifier to a second identifier provided by the network interface controller, wherein the second identifier is specific to an OS of the network interface controller that is stored on the network interface controller storage resource; and in response to a mismatch between the first identifier and the second identifier, prevent the network interface controller from operating.
| |
| | | | |
| | ===ENHANCED EYE-WIDTH MARGIN USING DUTY CYCLE ADJUST ([[US Patent Application 17728191. ENHANCED EYE-WIDTH MARGIN USING DUTY CYCLE ADJUST simplified abstract|17728191]])=== | | ===ENHANCED EYE-WIDTH MARGIN USING DUTY CYCLE ADJUST ([[US Patent Application 17728191. ENHANCED EYE-WIDTH MARGIN USING DUTY CYCLE ADJUST simplified abstract|17728191]])=== |
| Line 711: |
Line 412: |
| | Douglas Winterberg | | Douglas Winterberg |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes a high-speed data communication interface that consists of two lanes. The first lane has a transmitter that sends a data signal to a receiver through a channel, while the second lane has a transmitter that sends a data signal to another receiver through a separate channel. However, the first channel causes interference, known as crosstalk, in the second channel. To mitigate this issue, the second transmitter adjusts the duty cycle of the second data signal using a duty cycle adjuster input, which helps reduce the crosstalk.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | A high-speed data communication interface includes first and second lanes. The first lane includes a first transmitter coupled to send a first data signal to a first receiver via a first channel. The second lane includes a second transmitter coupled to send a second data signal to a second receiver via a second channel. The first channel injects crosstalk into the second channel. The second transmitter sets a duty cycle adjuster input to adjust a duty cycle of the second data signal to reduce the crosstalk.
| |
| | | | |
| | ===SMART NETWORK INTERFACE CONTROLLER SERIAL COMMUNICATION REDIRECTION ([[US Patent Application 17728672. SMART NETWORK INTERFACE CONTROLLER SERIAL COMMUNICATION REDIRECTION simplified abstract|17728672]])=== | | ===SMART NETWORK INTERFACE CONTROLLER SERIAL COMMUNICATION REDIRECTION ([[US Patent Application 17728672. SMART NETWORK INTERFACE CONTROLLER SERIAL COMMUNICATION REDIRECTION simplified abstract|17728672]])=== |
| Line 725: |
Line 420: |
| | Deepaganesh PAULRAJ | | Deepaganesh PAULRAJ |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes an information handling system that has a management controller for out-of-band management. This system also includes a network interface controller. The management controller is designed to receive management data from the network interface controller and then redirect that data to a remote console.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | An information handling system may include a management controller configured to provide out-of-band management of the information handling system. The information handling system may further include a network interface controller. The management controller may be configured to: receive management data from the network interface controller; and redirect the management data to a remote console.
| |
| | | | |
| | ===METHOD, DEVICE, AND COMPUTER PROGRAM PRODUCT FOR ADAPTIVE MATCHING ([[US Patent Application 17865209. METHOD, DEVICE, AND COMPUTER PROGRAM PRODUCT FOR ADAPTIVE MATCHING simplified abstract|17865209]])=== | | ===METHOD, DEVICE, AND COMPUTER PROGRAM PRODUCT FOR ADAPTIVE MATCHING ([[US Patent Application 17865209. METHOD, DEVICE, AND COMPUTER PROGRAM PRODUCT FOR ADAPTIVE MATCHING simplified abstract|17865209]])=== |
| Line 739: |
Line 428: |
| | Ellie Changxu Jiang | | Ellie Changxu Jiang |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes a method for automatically matching the block size of a transactional file system with the input/output (IO) size of a client. The method involves creating a share domain on a first file system with a certain block size. The block size of the share domain is then determined to be different from the block size of the first file system. If a second file system has a block size that matches the determined block size, the share domain is migrated from the first file system to the second file system. This approach simplifies user operations, improves convenience, reduces storage space fragments and indirect blocks, and enhances the performance of a storage system.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Adaptive matching is provided, which is used to automatically match a block size of a transactional file system with an IO size of a client. An example method includes creating a share domain, wherein the share domain is created on a first file system, and a block size of the first file system is a first block size. The method further includes determining a block size of the share domain as a second block size, wherein the second block size is not equal to the first block size. If a block size of a second file system is the second block size, the share domain is migrated from the first file system to the second file system. By implementing the present application, it is possible to simplify user operations, improve operational convenience, and help to reduce storage space fragments and indirect blocks, thereby further improving the performance of a storage system.
| |
| | | | |
| | ===METHOD TO SUPPORT TEMPORARY NAMESPACE IN A DEDUPLICATION FILESYSTEM ([[US Patent Application 17660330. METHOD TO SUPPORT TEMPORARY NAMESPACE IN A DEDUPLICATION FILESYSTEM simplified abstract|17660330]])=== | | ===METHOD TO SUPPORT TEMPORARY NAMESPACE IN A DEDUPLICATION FILESYSTEM ([[US Patent Application 17660330. METHOD TO SUPPORT TEMPORARY NAMESPACE IN A DEDUPLICATION FILESYSTEM simplified abstract|17660330]])=== |
| Line 753: |
Line 436: |
| | Nitin Madan | | Nitin Madan |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes a method for efficiently managing namespaces in a deduplication filesystem. A namespace is a way to organize and store data in the filesystem. The method involves adding a 'temporary' flag to a namespace when it is created, and a 'delete' flag when it needs to be deleted. When the maximum number of namespaces allowed by the filesystem is reached, the method deletes another namespace that has both the 'temporary' and 'delete' flags. This allows for efficient use of the non-volatile random-access memory (NVRAM) and ensures compliance with the filesystem's requirements for the maximum number of namespaces.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | One example method includes creating a namespace of a deduplication filesystem, adding a ‘temporary’ flag to the namespace, adding a ‘delete’ flag to the namespace when the namespace is to be deleted, and when a maximum number of namespaces permitted by the deduplication filesystem has been reached due to the creating of the namespace, deleting another namespace bearing a ‘temporary’ flag and a ‘delete’ flag. In this way, efficient use may be made of the NVRAM, while also maintaining compliance with deduplication filesystem requirements concerning the maximum number of permitted namespaces.
| |
| | | | |
| | ===Methods Make Web and Business Application Data Access Agnostic to Schema Variations and Migrations ([[US Patent Application 17726781. Methods Make Web and Business Application Data Access Agnostic to Schema Variations and Migrations simplified abstract|17726781]])=== | | ===Methods Make Web and Business Application Data Access Agnostic to Schema Variations and Migrations ([[US Patent Application 17726781. Methods Make Web and Business Application Data Access Agnostic to Schema Variations and Migrations simplified abstract|17726781]])=== |
| Line 767: |
Line 444: |
| | Ching-Yun Chao | | Ching-Yun Chao |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes a system, method, and computer-readable medium for performing a data schema mapping operation. The operation involves receiving product information from a product supplier, which is in the form of a document following a specific data schema called the first data schema. The first data schema is in an unspecified JavaScript Object Notation (JSON) format.
| |
| − |
| |
| − | The system then identifies various components within this document, which are essentially JSON data elements. It also identifies a second set of components that adhere to a different data schema called the second data schema. This second data schema is a defined schema and is associated with a data center services provider. Some of the components in the second set are associated with a relational database.
| |
| − |
| |
| − | Finally, the system maps a component from the document following the first data schema to a corresponding component in the second data schema. This mapping allows for the integration and synchronization of data between different schemas, facilitating data management and analysis.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | A system, method, and computer-readable medium are disclosed for performing a data schema mapping operation. The data schema mapping operation includes receiving product information from a product supplier, the product information comprising a first document corresponding to a first data schema, the first data schema comprising an unspecified JavaScript Object Notation (JSON) schema; identifying a plurality of components within the first document corresponding to the first data schema, the plurality of components comprising JSON data elements; identifying a second plurality of components corresponding to a second data schema, the second data schema comprising a defined data schema, the second data schema being associated with a data center services provider, at least some of the second plurality of components being associated with a relational database; and, mapping a component of the document corresponding to the first data schema to a component corresponding to the second data schema.
| |
| | | | |
| | ===AUTOMATIC SEQUENCING OF DATABASE OBJECTS ([[US Patent Application 17725968. AUTOMATIC SEQUENCING OF DATABASE OBJECTS simplified abstract|17725968]])=== | | ===AUTOMATIC SEQUENCING OF DATABASE OBJECTS ([[US Patent Application 17725968. AUTOMATIC SEQUENCING OF DATABASE OBJECTS simplified abstract|17725968]])=== |
| Line 785: |
Line 452: |
| | Jahangeer Pasha Mohammed | | Jahangeer Pasha Mohammed |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes methods, apparatus, and storage media for automatically sequencing database objects. It explains that the system obtains database scripts associated with database objects and parses them to identify object information and dependencies. It then determines the order in which the scripts should be executed based on these dependencies and initiates the execution accordingly.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Methods, apparatus, and processor-readable storage media for automatically sequencing database objects are provided herein. An example computer-implemented method includes obtaining one or more database scripts to be executed on at least one database, wherein each database script is associated with one or more database objects; for each of the database scripts: parsing the database script to identify object information corresponding to the one or more database objects associated with the database script, and determining one or more dependencies of the one or more database objects based at least in part on the object information; automatically determining an order to execute the one or more database scripts based at least in part on the object dependencies of the one or more database objects determined for each of the database scripts; and initiating an execution the one or more database scripts in accordance with the determined order.
| |
| | | | |
| | ===METHOD, ELECTRONIC DEVICE, AND COMPUTER PROGRAM PRODUCT FOR EVALUATING SAMPLES ([[US Patent Application 17745462. METHOD, ELECTRONIC DEVICE, AND COMPUTER PROGRAM PRODUCT FOR EVALUATING SAMPLES simplified abstract|17745462]])=== | | ===METHOD, ELECTRONIC DEVICE, AND COMPUTER PROGRAM PRODUCT FOR EVALUATING SAMPLES ([[US Patent Application 17745462. METHOD, ELECTRONIC DEVICE, AND COMPUTER PROGRAM PRODUCT FOR EVALUATING SAMPLES simplified abstract|17745462]])=== |
| Line 799: |
Line 460: |
| | Zijia Wang | | Zijia Wang |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes a method, electronic device, and computer program for evaluating samples. The method involves receiving a classification model from a cloud server and acquiring a sample distribution for each class in the model. An input sample marked as a certain class is acquired and checked against the corresponding sample distribution. If the input sample conforms to the distribution, it is identified as a trusted sample, indicating that it has been correctly labeled. This method helps recognize noise samples with incorrect labels, preventing model degradation during updates.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Embodiments of the present disclosure provide a method, an electronic device, and a computer program product for evaluating samples. The method includes receiving, at an edge device, a classification model from a cloud server. The method further includes acquiring a sample distribution corresponding to each class in a plurality of classes of the classification model. The method further includes acquiring an input sample which is marked as a first class in the plurality of classes. The method further includes determining whether the input sample conforms to a first sample distribution corresponding to the first class. The method further includes identifying, in response to the input sample conforming to the first sample distribution, the input sample as a trusted sample. The trusted sample indicates that the input sample is correctly marked. By the method, a noise sample with a wrong label can be recognized, thus avoiding model degradation during update.
| |
| | | | |
| | ===SYSTEM AND METHOD FOR REDUCTION OF DATA TRANSMISSION BY INFORMATION CONTROL WITH REINFORCED LEARNING ([[US Patent Application 17726104. SYSTEM AND METHOD FOR REDUCTION OF DATA TRANSMISSION BY INFORMATION CONTROL WITH REINFORCED LEARNING simplified abstract|17726104]])=== | | ===SYSTEM AND METHOD FOR REDUCTION OF DATA TRANSMISSION BY INFORMATION CONTROL WITH REINFORCED LEARNING ([[US Patent Application 17726104. SYSTEM AND METHOD FOR REDUCTION OF DATA TRANSMISSION BY INFORMATION CONTROL WITH REINFORCED LEARNING simplified abstract|17726104]])=== |
| Line 813: |
Line 468: |
| | Ofir Ezrielev | | Ofir Ezrielev |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes methods and systems for managing data collection. A system is designed with a data aggregator and data collectors. The data aggregator uses an inference model to predict how the data collectors will operate in the future. It also uses a pattern selection model to determine when and how often to sample data from the data collectors. The pattern may specify that certain data collectors should not be sampled at certain times. This approach allows the system to transmit less data, use less network bandwidth, and consume less energy while still providing access to aggregated data.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Methods and systems for managing data collection are disclosed. To manage data collection, a system may include a data aggregator and data collectors. The data aggregator may utilize an inference model to predict the future operation of data collectors, and a pattern selection model to sample data from data collectors at a specific frequency and sequence. The pattern may specify that some data collectors are not to be sampled at various points in time. By doing so, the system may be able to transmit less data, consume less network bandwidth, and consume less energy throughout a distributed system while still providing access to aggregated data.
| |
| | | | |
| | ===CLUSTERED VIRTUAL TRUSTED PLATFORM MODULE DOMAIN SERVICES WITH A REDIRECTOR/ROUTER SERVICE SYSTEM ([[US Patent Application 17729094. CLUSTERED VIRTUAL TRUSTED PLATFORM MODULE DOMAIN SERVICES WITH A REDIRECTOR/ROUTER SERVICE SYSTEM simplified abstract|17729094]])=== | | ===CLUSTERED VIRTUAL TRUSTED PLATFORM MODULE DOMAIN SERVICES WITH A REDIRECTOR/ROUTER SERVICE SYSTEM ([[US Patent Application 17729094. CLUSTERED VIRTUAL TRUSTED PLATFORM MODULE DOMAIN SERVICES WITH A REDIRECTOR/ROUTER SERVICE SYSTEM simplified abstract|17729094]])=== |
| Line 827: |
Line 476: |
| | John Henry Terpstra | | John Henry Terpstra |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes a system that validates connection requests from a virtual machine associated with a trusted platform module (TPM)-virtual (vTPM) module. The system checks if the connection request meets certain criteria based on a policy. If the request is valid, the system determines the vTPM domain service associated with the TPM-vTPM module and decides whether to redirect or route the request based on the policy. If redirection is required, the system sends a response to the TPM-vTPM module with information on where to redirect the request. If routing is required, the system directly routes the request to the vTPM domain service.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | An information handling system may validate a connection request received from a trusted platform module (TPM)-virtual (vTPM) module according to a policy, wherein the connection request originated from a virtual machine associated with the TPM-vTPM module which consumes services from a clustered vTPM domain service. In response to determining that the connection request is valid based on the policy, the system may determine the vTPM domain service associated to the TPM-vTPM module, and determine whether to route or redirect the connection request according to policy. In response to determining that the connection request is to be redirected, the system may transmit a response to the TPM-vTPM module, wherein the response includes redirect information to the vTPM domain service. In response to determining that the connection request is to be routed, the system may route the connection request to the vTPM domain service.
| |
| | | | |
| | ===SMART NETWORK INTERFACE CONTROLLER CERTIFICATE MANAGEMENT ([[US Patent Application 17728597. SMART NETWORK INTERFACE CONTROLLER CERTIFICATE MANAGEMENT simplified abstract|17728597]])=== | | ===SMART NETWORK INTERFACE CONTROLLER CERTIFICATE MANAGEMENT ([[US Patent Application 17728597. SMART NETWORK INTERFACE CONTROLLER CERTIFICATE MANAGEMENT simplified abstract|17728597]])=== |
| Line 841: |
Line 484: |
| | Deepaganesh PAULRAJ | | Deepaganesh PAULRAJ |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes an information handling system that includes a management controller and a network interface controller. The management controller is responsible for managing the system, while the network interface controller handles network connections. The management controller receives information from a centralized management platform about a signature associated with the network interface controller's operating system. It then sends this signature to the network interface controller, which uses it to install the operating system to its storage resource.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | An information handling system may include a management controller configured to provide out-of-band management of the information handling system, and a network interface controller comprising a network interface controller storage resource. The management controller may be configured to: receive, from a centralized management platform, information regarding at least one signature associated with a network interface controller operating system (OS) configured to be executed by the network interface controller; and transmit the at least one signature to the network interface controller. The network interface controller may be configured to install the network interface OS to the network interface controller storage resource based on the at least one signature.
| |
| | | | |
| | ===SMART NETWORK INTERFACE CONTROLLER SIGNATURE DATABASE EMULATION ([[US Patent Application 17728636. SMART NETWORK INTERFACE CONTROLLER SIGNATURE DATABASE EMULATION simplified abstract|17728636]])=== | | ===SMART NETWORK INTERFACE CONTROLLER SIGNATURE DATABASE EMULATION ([[US Patent Application 17728636. SMART NETWORK INTERFACE CONTROLLER SIGNATURE DATABASE EMULATION simplified abstract|17728636]])=== |
| Line 855: |
Line 492: |
| | Deepaganesh PAULRAJ | | Deepaganesh PAULRAJ |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes an information handling system that includes a management controller and a network interface controller. The management controller allows for remote management of the system, while the network interface controller handles network connections. The management controller can receive an update bundle that is cryptographically signed by the system's manufacturer. This update bundle includes signatures associated with the network interface controller's operating system. The management controller then transmits these signatures to the network interface controller, which uses them to install the operating system onto its storage resource.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | An information handling system may include a management controller configured to provide out-of-band management of the information handling system, and a network interface controller comprising a network interface controller storage resource. The management controller may be configured to: receive an update bundle cryptographically signed by a manufacturer of the information handling system, wherein the update bundle includes at least one signature associated with a network interface controller operating system (OS) configured to be executed by the network interface controller; and transmit the at least one signature to the network interface controller. The network interface controller may be configured to install the network interface controller OS to the network interface controller storage resource based on the at least one signature.
| |
| | | | |
| | ===Vulnerability Mitigation Resource Running Embedded Operating System on Hybrid Core ([[US Patent Application 17727896. Vulnerability Mitigation Resource Running Embedded Operating System on Hybrid Core simplified abstract|17727896]])=== | | ===Vulnerability Mitigation Resource Running Embedded Operating System on Hybrid Core ([[US Patent Application 17727896. Vulnerability Mitigation Resource Running Embedded Operating System on Hybrid Core simplified abstract|17727896]])=== |
| Line 869: |
Line 500: |
| | Shekar Babu SURYANARAYANA | | Shekar Babu SURYANARAYANA |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes a method for managing vulnerabilities in an information handling system. During the operation of the system, vulnerability information is collected to identify potentially vulnerable resources. A vulnerability determination code (VDC) is then calculated based on this information, which indicates a scan zone that includes different components corresponding to different regions of the vulnerable resources. After a system reset, a vulnerability aware (VA) boot sequence is performed. This sequence determines whether to perform a comprehensive vulnerability detection (CVD) boot, which involves booting a separate operating system dedicated to conducting a targeted vulnerability assessment. This dedicated operating system, known as an embedded OS (EOS), scans the specific scan zone components indicated by the VDC.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | A vulnerability management method acquires, during an OS runtime of an information handling system, vulnerability information indicating potentially vulnerable resources of the system. Disclosed methods calculate a vulnerability determination code (VDC) based on the vulnerability information. The VDC may indicate a scan zone that includes one or more scan zone components. Each component may correspond to a region of a potentially vulnerable resource. After a system reset, disclosed methods may perform a vulnerability aware (VA) boot sequence. The VA boot sequence may include, prior to booting a runtime operating system, determining, in accordance with the vulnerability information, whether to perform a comprehensive vulnerability detection (CVD) boot. A CVD boot refers to a boot sequence configured to boot a distinct operating system dedicated to performing a targeted vulnerability assessment that includes scanning the scan zone components indicated by the VDC. This dedicated OS may be implemented as an embedded OS (EOS).
| |
| | | | |
| | ===GENERATING AND PROCESSING PERSONAL INFORMATION CHAINS USING MACHINE LEARNING TECHNIQUES ([[US Patent Application 17726657. GENERATING AND PROCESSING PERSONAL INFORMATION CHAINS USING MACHINE LEARNING TECHNIQUES simplified abstract|17726657]])=== | | ===GENERATING AND PROCESSING PERSONAL INFORMATION CHAINS USING MACHINE LEARNING TECHNIQUES ([[US Patent Application 17726657. GENERATING AND PROCESSING PERSONAL INFORMATION CHAINS USING MACHINE LEARNING TECHNIQUES simplified abstract|17726657]])=== |
| Line 883: |
Line 508: |
| | Bijan Kumar Mohanty | | Bijan Kumar Mohanty |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes a method, apparatus, and storage media for generating and processing personal information chains using machine learning techniques. The method involves processing data from various sources related to events involving an individual. This processed data is then used to generate a personal information chain for the individual, which is linked based on temporal parameters using cryptographic functions. Anomaly detection is performed on the personal information chain using machine learning techniques. Based on the results of the anomaly detection, automated actions are taken using the personal information chain and anomaly detection results.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Methods, apparatus, and processor-readable storage media for generating and processing personal information chains using machine learning techniques are provided herein. An example computer-implemented method includes processing data, from one or more data sources, pertaining to one or more events involving an individual; generating a personal information chain associated with the individual by processing at least a portion of the processed data using at least one cryptographic function and linking that at least a portion of the processed data in accordance with at least one temporal parameter; performing anomaly detection by processing at least a portion of the personal information chain associated with the individual using one or more machine learning techniques; and performing one or more automated actions based at least in part on one or more of the personal information chain and results from the anomaly detection.
| |
| | | | |
| | ===SECURING SEDS BEHIND A HBA CONTROLLERS WITH A PASSTHROUGH MECHANISM USING BMC ([[US Patent Application 17729732. SECURING SEDS BEHIND A HBA CONTROLLERS WITH A PASSTHROUGH MECHANISM USING BMC simplified abstract|17729732]])=== | | ===SECURING SEDS BEHIND A HBA CONTROLLERS WITH A PASSTHROUGH MECHANISM USING BMC ([[US Patent Application 17729732. SECURING SEDS BEHIND A HBA CONTROLLERS WITH A PASSTHROUGH MECHANISM USING BMC simplified abstract|17729732]])=== |
| Line 897: |
Line 516: |
| | Deepu Syam Sreedhar M | | Deepu Syam Sreedhar M |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes a method and system for managing a storage system. It mentions that in traditional implementations, the host bus adapter (HBA) is unable to secure a self-encrypting drive (SED). Instead, one or more embodiments of the invention propose using a baseboard management controller (BMC) to manage the security of the SEDs and their security life cycle. The HBA acts as a conduit between the SED and BMC.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | In general, embodiments of the invention relate to a method and system for managing a storage system. In many traditional implementations host bus adapter (HBA) manages the storage device, however frequently the HBA cannot implement the necessary methods to secure a self-encrypting drive (SED). One or more embodiments of the invention use a baseboard management controller (BMC) to manage the security of the SEDs as well as the security life cycle of the SEDs, while the HBA acts as a passthrough conduit between the SED and BMC.
| |
| | | | |
| | ===AUTOMATED DOCUMENT PARSING TO DETERMINE COMMON COMPONENT IDENTIFIERS FOR CONSOLIDATION OF COMPONENT ORDERS ([[US Patent Application 17726828. AUTOMATED DOCUMENT PARSING TO DETERMINE COMMON COMPONENT IDENTIFIERS FOR CONSOLIDATION OF COMPONENT ORDERS simplified abstract|17726828]])=== | | ===AUTOMATED DOCUMENT PARSING TO DETERMINE COMMON COMPONENT IDENTIFIERS FOR CONSOLIDATION OF COMPONENT ORDERS ([[US Patent Application 17726828. AUTOMATED DOCUMENT PARSING TO DETERMINE COMMON COMPONENT IDENTIFIERS FOR CONSOLIDATION OF COMPONENT ORDERS simplified abstract|17726828]])=== |
| Line 911: |
Line 524: |
| | Shibi Panikkar | | Shibi Panikkar |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes an apparatus that uses an automated document parser to analyze documents related to component orders in a supply chain. The apparatus identifies specific component identifiers used by different organizations and suppliers. It then determines a common component identifier for a given component by mapping the association between the organization-specific identifiers. This allows for the consolidation of component orders from different organizations into a single order that uses the common identifier. The apparatus also processes this aggregated order using suppliers in the supply chain.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | An apparatus comprises a processing device configured to generate and utilize an automated document parser for parsing documents exchanged as part of fulfillment of historical component orders by a given supplier in a supply chain for first and second organizations to identify first and second organization-specific component identifiers utilized by the first and second organizations and a given supplier-specific component identifier utilized by the given supplier for a given component. The processing device is further configured to determine a common component identifier for the given component based at least in part on mapping an association between the first and second organization-specific component identifiers, to consolidate first and second component orders by the first and second organizations that utilize the first and second organization-specific component identifiers into an aggregated component order that utilizes the common component identifier, and to process the aggregated component order utilizing suppliers in the supply chain.
| |
| | | | |
| | ===USING HEADER MATRICES FOR FEATURE IMPORTANCE ANALYSIS IN MACHINE LEARNING MODELS ([[US Patent Application 17660144. USING HEADER MATRICES FOR FEATURE IMPORTANCE ANALYSIS IN MACHINE LEARNING MODELS simplified abstract|17660144]])=== | | ===USING HEADER MATRICES FOR FEATURE IMPORTANCE ANALYSIS IN MACHINE LEARNING MODELS ([[US Patent Application 17660144. USING HEADER MATRICES FOR FEATURE IMPORTANCE ANALYSIS IN MACHINE LEARNING MODELS simplified abstract|17660144]])=== |
| Line 925: |
Line 532: |
| | Jaumir Valença da Silveira Junior | | Jaumir Valença da Silveira Junior |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes a method to determine the relative importance of features in a dataset using a header matrix and a machine learning model. The header matrix starts as an Identity matrix and stores the gradients from a backpropagation process. These gradients are then accumulated in an accumulation matrix. By analyzing the accumulation matrix, we can determine or infer the importance of each feature in the dataset.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | A header matrix prepended to a machine learning model allows the relative importance of a dataset's features to be determined or inferred. The header matrix begins as an Identity matrix. Gradients associated with a backpropagation are stored in the header matrix and accumulated in an accumulation matrix. The relative importance of each feature of the dataset can be determined or inferred from the accumulation matrix.
| |
| | | | |
| | ===SYSTEM AND METHOD FOR REDUCTION OF DATA TRANSMISSION BY INFERENCE OPTIMIZATION AND DATA RECONSTRUCTION ([[US Patent Application 17726268. SYSTEM AND METHOD FOR REDUCTION OF DATA TRANSMISSION BY INFERENCE OPTIMIZATION AND DATA RECONSTRUCTION simplified abstract|17726268]])=== | | ===SYSTEM AND METHOD FOR REDUCTION OF DATA TRANSMISSION BY INFERENCE OPTIMIZATION AND DATA RECONSTRUCTION ([[US Patent Application 17726268. SYSTEM AND METHOD FOR REDUCTION OF DATA TRANSMISSION BY INFERENCE OPTIMIZATION AND DATA RECONSTRUCTION simplified abstract|17726268]])=== |
| Line 939: |
Line 540: |
| | Ofir Ezrielev | | Ofir Ezrielev |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes methods and systems for managing data collection. The system includes a data aggregator and a data collector. The data aggregator uses complex inference models to predict the future operation of the data collector, while the data collector uses simpler inference models. The data collector can access inferences from the complex models by obtaining the difference between complex and simple inferences from the data aggregator and locally reconstructing the complex differences. To reduce data transmission, the data collector sends a data difference (a smaller representation of a measurement) to the data aggregator using the reconstructed complex inferences. The data aggregator can then reconstruct the data from the data collectors using the data difference from the data collector and inferences from the complex inference model.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Methods and systems for managing data collection are disclosed. To manage data collection, a system may include a data aggregator and a data collector. The data aggregator may utilize complex inference models to predict the future operation of the data collector, while the data collector may host simpler inference models. The data collector may access inferences from the complex models by obtaining a difference between complex and simple inferences from the data aggregator and locally reconstructing the complex differences. To reduce data transmission, the data collector may transmit a data difference (e.g., a reduced-size representation of a measurement) to the data aggregator using the reconstructed complex inferences. The data aggregator may reconstruct data from the data collectors using the data difference from the data collector and inferences from the complex inference model.
| |
| | | | |
| | ===SYSTEM AND METHOD FOR REDUCTION OF DATA TRANSMISSION IN DYNAMIC SYSTEMS ([[US Patent Application 17726182. SYSTEM AND METHOD FOR REDUCTION OF DATA TRANSMISSION IN DYNAMIC SYSTEMS simplified abstract|17726182]])=== | | ===SYSTEM AND METHOD FOR REDUCTION OF DATA TRANSMISSION IN DYNAMIC SYSTEMS ([[US Patent Application 17726182. SYSTEM AND METHOD FOR REDUCTION OF DATA TRANSMISSION IN DYNAMIC SYSTEMS simplified abstract|17726182]])=== |
| Line 953: |
Line 548: |
| | Ofir Ezrielev | | Ofir Ezrielev |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes methods and systems for managing data collection in a distributed system. The system includes a data aggregator and data collectors. The data aggregator uses an inference model to predict data based on future measurements by the data collectors, even without access to the actual measurements. The data collectors are mobile and can be directed by the data aggregator to different locations. The aggregator selects paths for the data collectors based on factors such as the level of uncertainty in predictions, the sensitivities of downstream consumers to the collected data, and other relevant information. The paths selected by the aggregator can vary over time to achieve different goals.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Methods and systems for managing data collection in a distributed system are disclosed. To manage data collection, the system may include a data aggregator and a data collector. The data aggregator and may utilize an inference model to predict data based on future measurements performed by data collectors throughout a distributed system without having access to the measurements. The data collectors may be mobile, and the data aggregator may direct the data collectors to various locations. To select paths for the data collectors to follow, the aggregator may utilize the level of uncertainty in predictions, the sensitivities in ranges of data to downstream consumers of the data collected by the data collectors, and/or other types of information. The data aggregator may select the paths for varying goals over time.
| |
| | | | |
| | ===SYSTEM AND METHOD FOR REDUCTION OF DATA TRANSMISSION BY DATA STATISTIC VALIDATION ([[US Patent Application 17726308. SYSTEM AND METHOD FOR REDUCTION OF DATA TRANSMISSION BY DATA STATISTIC VALIDATION simplified abstract|17726308]])=== | | ===SYSTEM AND METHOD FOR REDUCTION OF DATA TRANSMISSION BY DATA STATISTIC VALIDATION ([[US Patent Application 17726308. SYSTEM AND METHOD FOR REDUCTION OF DATA TRANSMISSION BY DATA STATISTIC VALIDATION simplified abstract|17726308]])=== |
| Line 967: |
Line 556: |
| | Ofir Ezrielev | | Ofir Ezrielev |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes methods and systems for managing data collection. A data aggregator is used to predict the future operation of data collectors by using inference models. To validate these predictions, the data aggregator compares a reduced-size representation of a series of measurements to a complementary data statistic based on the predictions. If the complementary data statistic is accurate, the data aggregator stores the predictions as validated data and operates as if it has access to the actual measurements. This allows the system to transmit less data, consume less network bandwidth, and consume less energy in a distributed system.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Methods and systems for managing data collection are disclosed. To manage data collection, a system may include a data aggregator. The data aggregator may utilize inference models to predict the future operation of data collectors. To validate these inferences, the data aggregator may compare a data statistic (a reduced-size representation of a series of measurements) to a complementary data statistic based on a set of inferences. If the complementary data statistic is determined accurate, the data aggregator may store the inferences as validated data and operate as though it has access to the measurements from the data collector. By doing so, the system may be able to transmit less data, consume less network bandwidth, and consume less energy throughout a distributed system.
| |
| | | | |
| | ===SYSTEM AND METHOD FOR REDUCTION OF DATA TRANSMISSION BY DATA RECONSTRUCTION ([[US Patent Application 17726040. SYSTEM AND METHOD FOR REDUCTION OF DATA TRANSMISSION BY DATA RECONSTRUCTION simplified abstract|17726040]])=== | | ===SYSTEM AND METHOD FOR REDUCTION OF DATA TRANSMISSION BY DATA RECONSTRUCTION ([[US Patent Application 17726040. SYSTEM AND METHOD FOR REDUCTION OF DATA TRANSMISSION BY DATA RECONSTRUCTION simplified abstract|17726040]])=== |
| Line 981: |
Line 564: |
| | Ofir Ezrielev | | Ofir Ezrielev |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes methods and systems for managing data collection. A system is proposed that includes a data aggregator and a data collector. Both the data aggregator and data collector use identical copies of a twin inference model to predict the future operation of the data collector. To reduce the amount of data transmitted, the data collector only sends the difference to the data aggregator. The data aggregator then reconstructs the data using the difference received from the data collector and an inference generated by its own copy of the twin inference model.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Methods and systems for managing data collection are disclosed. To manage data collection, a system may include a data aggregator and a data collector. The data aggregator and data collector may utilize identical copies of a twin inference model to predict the future operation of the data collector. To minimize data transmission, the data collector may transmit a difference to the data aggregator. The data aggregator may reconstruct data from the data collectors using the difference from the data collector, and an inference generated by the copy of the twin inference model hosted by the data aggregator.
| |
| | | | |
| | ===METHOD, ELECTRONIC DEVICE, AND COMPUTER PROGRAM PRODUCT FOR MODEL TRAINING ([[US Patent Application 17828157. METHOD, ELECTRONIC DEVICE, AND COMPUTER PROGRAM PRODUCT FOR MODEL TRAINING simplified abstract|17828157]])=== | | ===METHOD, ELECTRONIC DEVICE, AND COMPUTER PROGRAM PRODUCT FOR MODEL TRAINING ([[US Patent Application 17828157. METHOD, ELECTRONIC DEVICE, AND COMPUTER PROGRAM PRODUCT FOR MODEL TRAINING simplified abstract|17828157]])=== |
| Line 995: |
Line 572: |
| | Jiacheng Ni | | Jiacheng Ni |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes a method, electronic device, and computer program for model training. The method involves receiving a machine learning model and distilled samples from a cloud server on an edge device. The machine learning model is initially trained on the cloud server using initial samples, and the distilled samples are derived from these initial samples. The method also includes acquiring a new input sample on the edge device and retraining the machine learning model using the distilled samples and the new input sample. This approach improves the efficiency of updating the model and ultimately enhances its accuracy.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Embodiments of the present disclosure provide a method, an electronic device, and a computer program product for model training. The method for model training includes: receiving, at an edge device, a machine learning model and distilled samples from a cloud server, wherein the machine learning model is trained on the basis of initial samples at the cloud server, and the distilled samples are obtained by distillation of the initial samples. The method further includes: acquiring, at the edge device, a newly collected input sample, and retraining, by the edge device, the machine learning model by using the distilled samples and the input sample. In this way, by updating a model using a distilled sample set at an edge device, the efficiency of updating the model can be improved, and then the accuracy of the model can be improved.
| |
| | | | |
| | ===INTELLIGENT PREDICTION FOR EQUIPMENT MANUFACTURING MANAGEMENT SYSTEM ([[US Patent Application 17726758. INTELLIGENT PREDICTION FOR EQUIPMENT MANUFACTURING MANAGEMENT SYSTEM simplified abstract|17726758]])=== | | ===INTELLIGENT PREDICTION FOR EQUIPMENT MANUFACTURING MANAGEMENT SYSTEM ([[US Patent Application 17726758. INTELLIGENT PREDICTION FOR EQUIPMENT MANUFACTURING MANAGEMENT SYSTEM simplified abstract|17726758]])=== |
| Line 1,009: |
Line 580: |
| | Ajay Maikhuri | | Ajay Maikhuri |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes intelligent prediction techniques for equipment manufacturing management. The method involves obtaining a structured description of components and processes related to manufacturing equipment, as well as manufacturing-related data from potential manufacturing entities and historical attributes associated with similar equipment. The method then applies prediction models using this data to compute a predicted attribute associated with manufacturing the equipment.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Intelligent prediction techniques for equipment manufacturing management are disclosed. For example, a method comprises obtaining: (i) a structured description of at least one of components and processes associated with manufacturing of equipment in accordance with a given design; (ii) first manufacturing-related data from one or more potential manufacturing entities for the equipment; and (iii) second manufacturing-related data representing at least one of current attributes and historical attributes associated with manufacturing equipment at least similar to the equipment of the given design. The method then applies one or more prediction models based on at least portions of the obtained structured description, the first manufacturing-related data, and the second manufacturing-related data to compute a predicted attribute associated with manufacturing the equipment.
| |
| | | | |
| | ===INTELLIGENT MANUFACTURING DIVISION SYSTEM ([[US Patent Application 17660224. INTELLIGENT MANUFACTURING DIVISION SYSTEM simplified abstract|17660224]])=== | | ===INTELLIGENT MANUFACTURING DIVISION SYSTEM ([[US Patent Application 17660224. INTELLIGENT MANUFACTURING DIVISION SYSTEM simplified abstract|17660224]])=== |
| Line 1,023: |
Line 588: |
| | Shibi Panikkar | | Shibi Panikkar |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The method described in the abstract involves dividing an order for a product into smaller portions and assigning each portion to a different supplier. The order portions are then adjusted based on the capacity of each supplier. This adjustment involves dividing each portion into daily quantities for different days and reducing any quantities that exceed the supplier's daily capacity. The adjusted order portions are then returned.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | A method comprising: identifying an order for a product; dividing the order into order portions and assigning each of the order portions to a different respective supplier; adjusting each of the order portions based on a capacity of the respective supplier to which the order portion is assigned; and returning the order portions after the order portions have been adjusted, wherein adjusting any given one of the order portions includes identifying a term that is associated with the given order portion, dividing the given order portion into a plurality of daily quantities that correspond to different respective days in the term, and reducing any given one of the daily quantities that fails to meet a corresponding daily capacity of the respective supplier to which the given order portion is assigned.
| |
| | | | |
| | ===METHODS AND SYSTEMS FOR ANOMALOUS OPERATION DETECTION ON A CONSUMER DEVICE ([[US Patent Application 17726825. METHODS AND SYSTEMS FOR ANOMALOUS OPERATION DETECTION ON A CONSUMER DEVICE simplified abstract|17726825]])=== | | ===METHODS AND SYSTEMS FOR ANOMALOUS OPERATION DETECTION ON A CONSUMER DEVICE ([[US Patent Application 17726825. METHODS AND SYSTEMS FOR ANOMALOUS OPERATION DETECTION ON A CONSUMER DEVICE simplified abstract|17726825]])=== |
| Line 1,037: |
Line 596: |
| | Vaneeswaran N | | Vaneeswaran N |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes a method for monitoring and controlling privileged operations on a client device. When a request is made to copy or modify data, the method collects various metrics related to the request. These metrics are then used to calculate an anomaly score, which determines if the request is abnormal or suspicious. If the score indicates an anomaly, the method places a hold on the request, preventing it from being executed.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | A method for holding an anomalous privileged operation, that includes receiving, by a privileged operations monitor executing on a client device, a privileged operation request to copy data or modify data, obtaining a plurality of metrics for the privileged operation request, calculating an anomaly score for the privileged operation request, based on the plurality of metrics, making a first determination, based on the anomaly score, that the privileged operation request is anomalous, and based on the first determination, placing a hold on the privileged operation request.
| |
| | | | |
| | ===OPTIMIZED HARDWARE PRODUCT RETURNS FOR SUBSCRIPTION SERVICES ([[US Patent Application 17659904. OPTIMIZED HARDWARE PRODUCT RETURNS FOR SUBSCRIPTION SERVICES simplified abstract|17659904]])=== | | ===OPTIMIZED HARDWARE PRODUCT RETURNS FOR SUBSCRIPTION SERVICES ([[US Patent Application 17659904. OPTIMIZED HARDWARE PRODUCT RETURNS FOR SUBSCRIPTION SERVICES simplified abstract|17659904]])=== |
| Line 1,051: |
Line 604: |
| | Bijan Kumar Mohanty | | Bijan Kumar Mohanty |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes a methodology for a product subscription service. The service receives information about a hardware asset that is being returned at the end of a subscription. It uses a machine learning model to predict whether the hardware asset has reached its end of life (EOL). If it predicts that the asset has reached EOL, it creates a work order to dispatch an eco-partner. If it predicts that the asset has not reached EOL, it uses another machine learning model to predict new subscription orders that match the hardware asset and recommends these as possible fits for the asset.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | In one aspect, an example methodology implementing the disclosed techniques includes, by a product subscription service, receiving information regarding a hardware asset being returned at an end of a subscription and predicting, using a first machine learning (ML) model, whether the hardware asset has reached EOL. The method also includes, responsive to predicting that the hardware asset has reached EOL, creating, by the product subscription service, a work order to dispatch an eco-partner. The method may further include, by the product subscription service, responsive to predicting that the hardware asset has not reached EOL, predicting, using a second ML model, one or more new subscription orders matching the hardware asset and recommending the one or more matching new subscription orders as possible fits for the hardware asset.
| |
| | | | |
| | ===METHOD, ELECTRONIC DEVICE, AND PROGRAM PRODUCT FOR TRAINING ENCODER AND PROCESSING DATA ([[US Patent Application 17740584. METHOD, ELECTRONIC DEVICE, AND PROGRAM PRODUCT FOR TRAINING ENCODER AND PROCESSING DATA simplified abstract|17740584]])=== | | ===METHOD, ELECTRONIC DEVICE, AND PROGRAM PRODUCT FOR TRAINING ENCODER AND PROCESSING DATA ([[US Patent Application 17740584. METHOD, ELECTRONIC DEVICE, AND PROGRAM PRODUCT FOR TRAINING ENCODER AND PROCESSING DATA simplified abstract|17740584]])=== |
| Line 1,065: |
Line 612: |
| | Wenbin Yang | | Wenbin Yang |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes a method, electronic device, and program product for training an encoder and processing data. The method involves inputting sample point cloud data of an object into an encoder to obtain encoded data. The encoded data is then transformed to determine invariant portions (representing unchanging features) and variable portions (representing changing features) of the object. Based on these portions, a similarity loss and spatial loss are determined for the sample data. The parameter of the encoder is adjusted using these losses to obtain a trained encoder.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Embodiments relate to a method, an electronic device, and a program product for training an encoder and processing data. The method includes inputting sample point cloud data for an object to an encoder to obtain encoded data for the object, and determining, by transforming the encoded data, a plurality of invariant portions for the object and a plurality of variable portions for the object, an invariant portion in the plurality of invariant portions indicating an invariant feature of the object and a variable portion in the plurality of variable portions indicating a variable feature of the object. The method further includes determining, based on the plurality of invariant portions and the plurality of variable portions, a similarity loss and a spatial loss for the sample point cloud data, and adjusting, based on the similarity loss and the spatial loss, a parameter of the encoder to obtain a trained encoder.
| |
| | | | |
| | ===AUTOMATICALLY CLASSIFYING IMAGES FOR STORAGE-RELATED DETERMINATIONS USING ARTIFICIAL INTELLIGENCE TECHNIQUES ([[US Patent Application 17724638. AUTOMATICALLY CLASSIFYING IMAGES FOR STORAGE-RELATED DETERMINATIONS USING ARTIFICIAL INTELLIGENCE TECHNIQUES simplified abstract|17724638]])=== | | ===AUTOMATICALLY CLASSIFYING IMAGES FOR STORAGE-RELATED DETERMINATIONS USING ARTIFICIAL INTELLIGENCE TECHNIQUES ([[US Patent Application 17724638. AUTOMATICALLY CLASSIFYING IMAGES FOR STORAGE-RELATED DETERMINATIONS USING ARTIFICIAL INTELLIGENCE TECHNIQUES simplified abstract|17724638]])=== |
| Line 1,079: |
Line 620: |
| | Bijan Kumar Mohanty | | Bijan Kumar Mohanty |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes a technology that uses artificial intelligence to automatically classify images for storage-related purposes. The method involves obtaining an image associated with a company, categorizing different parts of the image using artificial intelligence techniques, and then taking automated actions based on the classification to store the image in various storage options.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Methods, apparatus, and processor-readable storage media for automatically classifying images for storage-related determinations using artificial intelligence techniques are provided herein. An example computer-implemented method includes obtaining at least one image associated with an enterprise; classifying one or more portions of the at least one image into one or more enterprise-related categories by processing at least a portion of the at least one image using one or more artificial intelligence techniques; and performing, based at least in part on the classifying of the one or more portions of the at least one image, one or more automated actions pertaining to storing the at least one image in at least one of multiple storage options.
| |
| | | | |
| | ===METHOD, ELECTRONIC DEVICE, AND COMPUTER PROGRAM PRODUCT FOR IMAGE SEGMENTATION ([[US Patent Application 17829658. METHOD, ELECTRONIC DEVICE, AND COMPUTER PROGRAM PRODUCT FOR IMAGE SEGMENTATION simplified abstract|17829658]])=== | | ===METHOD, ELECTRONIC DEVICE, AND COMPUTER PROGRAM PRODUCT FOR IMAGE SEGMENTATION ([[US Patent Application 17829658. METHOD, ELECTRONIC DEVICE, AND COMPUTER PROGRAM PRODUCT FOR IMAGE SEGMENTATION simplified abstract|17829658]])=== |
| Line 1,093: |
Line 628: |
| | Zijia Wang | | Zijia Wang |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes a method, electronic device, and computer program for image segmentation. The method involves using a trained image segmentation model to process an image containing objects from different categories. The method selects a category to discard based on a pre-determined recall rate for each category. The image is then processed using the remaining categories to obtain a segmented image. This method aims to reduce computing resources, decrease the amount of image data processed, and increase image processing speed.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Embodiments of the present disclosure relate to a method, an electronic device, and a computer program product for image segmentation. The method may be executed by a trained image segmentation model. The method includes: obtaining a to-be-processed image, wherein the to-be-processed image includes objects of a plurality of categories. The method further includes: selecting a to-be-discarded category in the to-be-processed image according to a recall rate of each of the plurality of categories obtained in advance. The method further includes: processing the to-be-processed image based on a plurality of remaining categories in the plurality of categories other than the to-be-discarded category to obtain a segmented image. Through the method, computing resources required for a segmentation processing task can be greatly reduced, a processing amount of image data can be reduced, and an image processing speed can be increased.
| |
| | | | |
| | ===Device and Method for Synchronized Shutter Controls for External Displays ([[US Patent Application 17730133. Device and Method for Synchronized Shutter Controls for External Displays simplified abstract|17730133]])=== | | ===Device and Method for Synchronized Shutter Controls for External Displays ([[US Patent Application 17730133. Device and Method for Synchronized Shutter Controls for External Displays simplified abstract|17730133]])=== |
| Line 1,107: |
Line 636: |
| | Geroncio Ong Tan | | Geroncio Ong Tan |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes a system and methods for synchronizing control of an information handling system, like a notebook computer, with external devices, such as displays. This synchronization is specifically done for similar components on both the information handling system and the external display, like camera shutters. The abstract does not oversell or provide a title.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Described are a system and methods for synchronizing control of an information handling system, such as a notebook computer, with external devices, such as displays, where the synchronizing control is performed for similar components on the information handling and external display, such as camera shutters.
| |
| | | | |
| | ===STORAGE SUBSYSTEM READ VOLTAGE DETERMINATION SYSTEM ([[US Patent Application 17727716. STORAGE SUBSYSTEM READ VOLTAGE DETERMINATION SYSTEM simplified abstract|17727716]])=== | | ===STORAGE SUBSYSTEM READ VOLTAGE DETERMINATION SYSTEM ([[US Patent Application 17727716. STORAGE SUBSYSTEM READ VOLTAGE DETERMINATION SYSTEM simplified abstract|17727716]])=== |
| Line 1,121: |
Line 644: |
| | Frederick K.H. Lee | | Frederick K.H. Lee |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes a system that determines the optimal read voltage for a storage subsystem. It reads data from the subsystem at different voltage levels and calculates the probability of bit errors for each voltage level. It also generates a graph that shows the error correction capability of the system. Based on these calculations, it determines the average rate of errors for each voltage level and identifies the voltage level with the lowest error rate.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | A storage subsystem read voltage determination system coupled to a first storage subsystem may read data from the first storage subsystem at a plurality of different read voltage sets and, for each of the plurality of read voltage sets, generate a respective bit error probability distribution of a number of bit errors per codeword provided by the data read from the first storage subsystem. The storage subsystem read voltage provisioning system also generates an error correction capability graph associated with error correction code used by the first storage subsystem and, based on the bit error probability distributions and the error correction capability graph, generates a respective average codeword error rate for each of the plurality of read voltage sets. The storage subsystem read voltage provisioning system then identifies a first read voltage set for which a minimum average codeword error rate was determined.
| |
| | | | |
| | ===METHOD, ELECTRONIC DEVICE, AND COMPUTER PROGRAM PRODUCT FOR MOLECULAR DOCKING ([[US Patent Application 17749942. METHOD, ELECTRONIC DEVICE, AND COMPUTER PROGRAM PRODUCT FOR MOLECULAR DOCKING simplified abstract|17749942]])=== | | ===METHOD, ELECTRONIC DEVICE, AND COMPUTER PROGRAM PRODUCT FOR MOLECULAR DOCKING ([[US Patent Application 17749942. METHOD, ELECTRONIC DEVICE, AND COMPUTER PROGRAM PRODUCT FOR MOLECULAR DOCKING simplified abstract|17749942]])=== |
| Line 1,135: |
Line 652: |
| | Zijia Wang | | Zijia Wang |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes a method, electronic device, and computer program for molecular docking. Molecular docking is a process used in drug discovery to predict how two molecules will bind together. The method involves determining feature representations for two molecules, identifying a candidate region for docking based on these representations, and then calculating the docking result for each candidate position within this region. This approach allows for a more efficient computation by focusing on a specific area of interest rather than the entire region.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Embodiments of the present disclosure provide a method, an electronic device, and a computer program product for molecular docking. The method includes: determining a first feature representation characterizing a first molecule and a second feature representation characterizing a second molecule; determining a candidate region for the first molecule based at least on the first feature representation and the second feature representation, the candidate region comprising multiple candidate positions for docking the first molecule with the second molecule; and for each candidate position of the multiple candidate positions, determining a result of docking the first molecule with the second molecule at the candidate position. With the solution of the present disclosure, it is possible to calculate the docking result for the candidate region for the first molecule rather than the entire region, thereby reducing the amount of computation.
| |
| | | | |
| | ===CONTROLLED CABLE ATTENUATION ([[US Patent Application 17727754. CONTROLLED CABLE ATTENUATION simplified abstract|17727754]])=== | | ===CONTROLLED CABLE ATTENUATION ([[US Patent Application 17727754. CONTROLLED CABLE ATTENUATION simplified abstract|17727754]])=== |
| Line 1,149: |
Line 660: |
| | Sandor Farkas | | Sandor Farkas |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes a type of cable that has a conductor in the center, surrounded by a dielectric layer, and a resistive coating. The resistive coating is applied to a part of the conductor that is exposed, and it is placed within the dielectric layer. The purpose of the resistive coating is to achieve a specific impedance for the cable when combined with the existing impedance before the resistive coating is applied.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | A cable comprising a conductor in a center of the cable, a dielectric layer surrounding the conductor and a resistive coating may be provided. The resistive coating may be applied to an exposed portion of the conductor and disposed with the dielectric layer. The resistance of the resistive coating when combined with an impedance of the cable prior to application of the resistive coating reaches a target impedance.
| |
| | | | |
| | ===LOSS-CONTROLLED COMPUTING CABLE ([[US Patent Application 17660754. LOSS-CONTROLLED COMPUTING CABLE simplified abstract|17660754]])=== | | ===LOSS-CONTROLLED COMPUTING CABLE ([[US Patent Application 17660754. LOSS-CONTROLLED COMPUTING CABLE simplified abstract|17660754]])=== |
| Line 1,163: |
Line 668: |
| | Bhyrav M. MUTNURY | | Bhyrav M. MUTNURY |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes a type of computing cable that is used to connect different computing components. This cable consists of a trace, which is made up of two segments, and has a specific impedance. Additionally, there is an attenuator that connects these two trace segments. The attenuator includes a resistor with a certain resistance and a conductor with a second impedance. The values of the resistance and the second impedance are determined based on the first impedance of the trace.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | A computing cable that connects computing elements, including: a trace including a first trace segment and a second trace segment, the trace having a first impedance; and an attenuator connecting the first trace segment to the second trace segment, the attenuator including: a resistor having a resistance, and a conductor having a second impedance, wherein the combination of the resistance and the second impedance is based on the first impedance.
| |
| | | | |
| | ===ADJUSTING A CHARGING RATE OF A BATTERY OF AN INFORMATION HANDLING SYSTEM ([[US Patent Application 17660779. ADJUSTING A CHARGING RATE OF A BATTERY OF AN INFORMATION HANDLING SYSTEM simplified abstract|17660779]])=== | | ===ADJUSTING A CHARGING RATE OF A BATTERY OF AN INFORMATION HANDLING SYSTEM ([[US Patent Application 17660779. ADJUSTING A CHARGING RATE OF A BATTERY OF AN INFORMATION HANDLING SYSTEM simplified abstract|17660779]])=== |
| Line 1,177: |
Line 676: |
| | Yan Ning | | Yan Ning |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes a method for adjusting the charging rate of a battery in an information handling system. The method involves determining the amount of time the battery has been fully charged and connected to a power source, comparing this time with a predetermined threshold, and if the time exceeds the threshold, decreasing the charging voltage of the battery and continuing to charge it at the lower voltage level.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Adjusting a charging rate of battery of an information handling system, the method comprising: determining, at a first time, a first accumulation of time over a first time period that i) a state of charge (SOC) of the battery indicates that the battery is fully charged and that ii) the battery is connected to a power source; comparing the first accumulation of time with a time threshold; determining, based on the comparing, that the first accumulation of time is greater than the time threshold, and in response: decreasing a charging voltage of the battery from a nominal level to a first decreased level; charging the battery based on the charging voltage having the first decreased level;
| |
| | | | |
| | ===DIGITAL FRONT END SUPER PATHS ([[US Patent Application 17660341. DIGITAL FRONT END SUPER PATHS simplified abstract|17660341]])=== | | ===DIGITAL FRONT END SUPER PATHS ([[US Patent Application 17660341. DIGITAL FRONT END SUPER PATHS simplified abstract|17660341]])=== |
| Line 1,191: |
Line 684: |
| | Tommy Ivarsson | | Tommy Ivarsson |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes a system that includes a radio unit with multiple antenna branches and digital front ends. Each digital front end processes data from a specific antenna branch. The system also has a digital front end super path that can choose between the antenna branches. The super path has a tap point where the processed data can be accessed.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | A system can comprise a radio unit. The system can further comprise a group of antenna branches of the radio unit. The system can further comprise a group of digital front ends of the radio unit, wherein respective digital front ends of the group of digital front ends are configured to process data of respective antenna branches of the group of antenna branches. The system can further comprise a digital front end super path that is configured to select between the group of antenna branches, wherein the digital front end super path comprises a tap point at which data processed via the digital front end super path is able to be accessed.
| |
| | | | |
| | ===CUSTOM SIGNAL DATA GENERATION IN A RADIO SYSTEM ([[US Patent Application 17660350. CUSTOM SIGNAL DATA GENERATION IN A RADIO SYSTEM simplified abstract|17660350]])=== | | ===CUSTOM SIGNAL DATA GENERATION IN A RADIO SYSTEM ([[US Patent Application 17660350. CUSTOM SIGNAL DATA GENERATION IN A RADIO SYSTEM simplified abstract|17660350]])=== |
| Line 1,205: |
Line 692: |
| | John Bradley Deforge | | John Bradley Deforge |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes a system that includes a memory for storing and retrieving a signal, a generator for generating sub-carrier values, a look up table for storing predetermined sub-carrier values, and a pseudo-random look up table generator for producing pseudo-random data values. The system also includes a component for aligning, buffering, and injecting a second signal into a radio. The second signal can be selected from the memory, generator, look up table, or pseudo-random look up table generator.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | A system can comprise a memory that is configured to store and retrieve a first signal. The system can further comprise a generator that is configured to generate first in-phase, quadrature sub-carrier values. The system can further comprise a look up table that stores predetermined second in-phase, quadrature sub-carrier values. The system can further comprise a pseudo-random look up table generator that is configured to operate on the predetermined second in-phase, quadrature sub-carrier values to produce a pseudo-random symbol of data values. The system can further comprise a component that is configured to time align, buffer, and inject a second signal into a radio used by the system, wherein the second signal is selected from the memory, the generator, the look up table, and the pseudo-random look up table generator.
| |
| | | | |
| | ===CALIBRATION AND TEST OF RADIOS SPANNING DIGITAL AND ANALOG DOMAINS ([[US Patent Application 17660343. CALIBRATION AND TEST OF RADIOS SPANNING DIGITAL AND ANALOG DOMAINS simplified abstract|17660343]])=== | | ===CALIBRATION AND TEST OF RADIOS SPANNING DIGITAL AND ANALOG DOMAINS ([[US Patent Application 17660343. CALIBRATION AND TEST OF RADIOS SPANNING DIGITAL AND ANALOG DOMAINS simplified abstract|17660343]])=== |
| Line 1,219: |
Line 700: |
| | John Bradley Deforge | | John Bradley Deforge |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes a system that includes a radio unit with a transmitter and a receiver. It also includes three hardware components. The first component connects the transmitter and the receiver, the second component transmits an analog signal between them, and the third component evaluates the radio unit's performance based on the received analog signal.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | A system can comprise a radio unit that comprises a transmitter and a receiver. The system can further comprise a first hardware component that communicatively couples the transmitter and the receiver. The system can further comprise a second hardware component that is configured to transmit an analog signal from the transmitter to the receiver via the first hardware component. The system can further comprise a third hardware component that is configured to evaluate operation of the radio unit based on the analog signal received at the receiver.
| |
| | | | |
| | ===ANALOG DOMAIN LOOPBACK MODES ([[US Patent Application 17660353. ANALOG DOMAIN LOOPBACK MODES simplified abstract|17660353]])=== | | ===ANALOG DOMAIN LOOPBACK MODES ([[US Patent Application 17660353. ANALOG DOMAIN LOOPBACK MODES simplified abstract|17660353]])=== |
| Line 1,233: |
Line 708: |
| | Danyi Rong | | Danyi Rong |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes a system that includes a radio unit with a transmitter, receiver, and power amplifier. It also includes a hardware loopback, which connects the transmitter and receiver through an analog section of the radio unit. This loopback is located between the transmitter and power amplifier. The system also includes a hardware component that can transmit a signal from the transmitter to the receiver using the hardware loopback.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | A system can comprise a radio unit comprising a transmitter, a receiver, and a power amplifier. The system can further comprise a hardware loopback that communicatively couples the transmitter and the receiver via an analog section of the radio unit, wherein the hardware loopback is selected at a component disposed between the transmitter and the power amplifier. The system can further comprise a hardware component that is configured to transmit a signal from the transmitter to the receiver via the hardware loopback.
| |
| | | | |
| | ===DISTRIBUTED UNIT-BASED CUSTOM TRAFFIC INSERTION FOR LIVE-AIR AND NON-LIVE-AIR SIGNALS ([[US Patent Application 17660333. DISTRIBUTED UNIT-BASED CUSTOM TRAFFIC INSERTION FOR LIVE-AIR AND NON-LIVE-AIR SIGNALS simplified abstract|17660333]])=== | | ===DISTRIBUTED UNIT-BASED CUSTOM TRAFFIC INSERTION FOR LIVE-AIR AND NON-LIVE-AIR SIGNALS ([[US Patent Application 17660333. DISTRIBUTED UNIT-BASED CUSTOM TRAFFIC INSERTION FOR LIVE-AIR AND NON-LIVE-AIR SIGNALS simplified abstract|17660333]])=== |
| Line 1,247: |
Line 716: |
| | Tommy Ivarsson | | Tommy Ivarsson |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This technology involves scheduling the injection of custom traffic into a radio unit's communications path. A distributed unit coordinates with the radio unit to schedule and synchronize this custom traffic, which can be interleaved with live-air and non-live-air traffic. The radio unit can request unscheduled physical resource blocks for the custom traffic, or the distributed unit can inject it into otherwise unscheduled blocks. The custom traffic is used to perform actions such as antenna calibration and test and measurement operations to obtain performance data. This data can then be used to improve the radio unit's performance by modifying its operating parameters.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | The described technology is generally directed towards scheduling, by a distributed unit, the injection of custom traffic (signals/data) into a radio unit communications path. The distributed unit coordinates with the radio unit to schedule and synchronize such custom traffic in unscheduled (physical resource block), such as interleaved with to live-air and non-live-air traffic. The radio unit can request the unscheduled physical resource blocks for custom traffic to be inserted by the radio unit. Alternatively, the distributed unit can inject the custom traffic in otherwise unscheduled physical resource blocks for sending to the radio unit. The custom traffic is configured to perform some action by the radio unit, such as to perform antenna calibration, to perform test and measurement operations to obtain performance data, and the like. Performance data can be used, for example, to modify operating parameters of the radio unit to improve performance of the radio unit.
| |
| | | | |
| | ===PERSONAL PRIVATE KEY ENCRYPTION DEVICE ([[US Patent Application 17725337. PERSONAL PRIVATE KEY ENCRYPTION DEVICE simplified abstract|17725337]])=== | | ===PERSONAL PRIVATE KEY ENCRYPTION DEVICE ([[US Patent Application 17725337. PERSONAL PRIVATE KEY ENCRYPTION DEVICE simplified abstract|17725337]])=== |
| Line 1,261: |
Line 724: |
| | Bradley K. Goodman | | Bradley K. Goodman |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes methods and systems for managing the security of private keys in a distributed system. In this system, there are insecure data processing systems that use private keys to generate signatures. However, there is a risk that these private keys may be obtained by unauthorized parties through the insecure data processing systems. To enhance the security of the private keys, a security device is used. This security device allows for the review and signing of data structures to obtain signatures, without exposing the private keys to the insecure data processing systems.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Methods and systems for managing the security of private keys in a distributed system are disclosed. The distributed system may include insecure data processing systems that utilize signatures generated using private keys. The private keys may be subject to undesired dissemination if obtained by the insecure data processing systems. To improve the security of the private keys, a security device may be utilized. The security device may facilitate review and signing of data structures to obtain signatures without disclosure of private keys to insecure data processing systems.
| |
| | | | |
| | ===CLUSTERED VIRTUAL TRUSTED PLATFORM MODULE DOMAIN SERVICES SYSTEM ([[US Patent Application 17728579. CLUSTERED VIRTUAL TRUSTED PLATFORM MODULE DOMAIN SERVICES SYSTEM simplified abstract|17728579]])=== | | ===CLUSTERED VIRTUAL TRUSTED PLATFORM MODULE DOMAIN SERVICES SYSTEM ([[US Patent Application 17728579. CLUSTERED VIRTUAL TRUSTED PLATFORM MODULE DOMAIN SERVICES SYSTEM simplified abstract|17728579]])=== |
| Line 1,275: |
Line 732: |
| | Jeroen Mackenbach | | Jeroen Mackenbach |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes an information handling system that includes a virtual trusted platform module (TPM) consumer associated with a virtual machine. The system allows the virtual TPM consumer to access TPM services from a clustered vTPM domain service. The vTPM consumer can determine the connection information of the vTPM domain service and send a connection request for a TPM operation. The connection request includes additional payload information. The vTPM consumer can then receive a response from the vTPM domain service related to the TPM operation request.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | An information handling system includes a virtual trusted platform module (TPM) consumer associated with a virtual machine. The virtual TPM (vTPM) consumer may consume TPM services from a clustered vTPM domain service and determine the connection information of the vTPM domain service. The vTPM consumer transmits a connection request for a TPM operation request to the vTPM domain service, wherein the connection request includes a payload in addition to the connection information. The consumer may also receive a response associated with the TPM operation request from the vTPM domain service.
| |
| | | | |
| | ===CHAINED CRYPTOGRAPHICALLY SIGNED CERTIFICATES TO CONVEY AND DELEGATE TRUST AND AUTHORITY IN A MULTIPLE NODE ENVIRONMENT ([[US Patent Application 17724834. CHAINED CRYPTOGRAPHICALLY SIGNED CERTIFICATES TO CONVEY AND DELEGATE TRUST AND AUTHORITY IN A MULTIPLE NODE ENVIRONMENT simplified abstract|17724834]])=== | | ===CHAINED CRYPTOGRAPHICALLY SIGNED CERTIFICATES TO CONVEY AND DELEGATE TRUST AND AUTHORITY IN A MULTIPLE NODE ENVIRONMENT ([[US Patent Application 17724834. CHAINED CRYPTOGRAPHICALLY SIGNED CERTIFICATES TO CONVEY AND DELEGATE TRUST AND AUTHORITY IN A MULTIPLE NODE ENVIRONMENT simplified abstract|17724834]])=== |
| Line 1,289: |
Line 740: |
| | Bradley Goodman | | Bradley Goodman |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes an information handling system that has a memory and a processor. The memory stores a public key that belongs to the owner of the system. The processor receives a message that is cryptographically signed and includes a chain of certificates. The processor checks if the first certificate in the chain gives authority to a user based on the owner's public key. If it does, the processor then checks if the second certificate gives authority from the first user to a second user. Using these certificates, the processor verifies the cryptographically signed message as a trusted message. If the message is verified, the processor carries out a request that is associated with the message.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | An information handling system includes a memory and a processor. The memory stores an owner public key associated with an owner of the information handling system. The processor receives a cryptographically signed message including a chain of certificates that includes first and second certificates. The processor determines whether the first certificate within the chain of certificates delegates authority to a first user based on the owner public key. In response to the first certificate delegating authority to the first user, the processor determines whether the second certificate delegates authority from the first user to a second user. Based on the first and second certificates, the processor verifies the cryptographically signed message as an authoritative message. In response to the cryptographically signed message being verified as the authoritative message, the processor executes a request associated with the cryptographically signed message.
| |
| | | | |
| | ===DETERMINISTIC CERTIFICATE EXPIRATION IN DISSAGGREGATED ENVIRONMENTS ([[US Patent Application 17725309. DETERMINISTIC CERTIFICATE EXPIRATION IN DISSAGGREGATED ENVIRONMENTS simplified abstract|17725309]])=== | | ===DETERMINISTIC CERTIFICATE EXPIRATION IN DISSAGGREGATED ENVIRONMENTS ([[US Patent Application 17725309. DETERMINISTIC CERTIFICATE EXPIRATION IN DISSAGGREGATED ENVIRONMENTS simplified abstract|17725309]])=== |
| Line 1,303: |
Line 748: |
| | Bradley K. Goodman | | Bradley K. Goodman |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes methods and systems for managing certificates in a distributed system. In this system, data processing systems use certificates issued by a certificate issuer. These data processing systems may not always be connected to the certificate issuer. The certificate issuer has the ability to revoke any issued certificate at any time, but may not inform other entities about the revocation. To determine if a certificate is valid, the data processing systems apply a set of rules to the certificate. These rules take into account the intermittent connectivity to the certificate issuer, which may make it difficult to determine if a certificate has been revoked. However, these rules also aim to minimize the risk of treating a certificate as valid when it has actually been revoked but the revocation is not known.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Methods and systems for certificate management in a distributed system are disclosed. The distributed system may include data processing systems that utilize certificates issued by a certificate issuer. The data processing systems may be intermittently connected to the certificate issuer. The certificate issuer may, at any point in time, revoke any issued certificate. The certificate issuer may not notify other entities of the revocation. To determine whether a certificate should be treated as being valid, the data processing systems may apply a set of rules to the certificate that compensate for intermittent connectivity to the certificate issuer that may prevent determining whether a certificate has been revoked, while limiting risk due to the potential for a certificate to have been revoked but the revocation not being known.
| |
| | | | |
| | ===TOUCHLESS PROVISIONING OF INFORMATION HANDLING SYSTEMS ([[US Patent Application 17727203. TOUCHLESS PROVISIONING OF INFORMATION HANDLING SYSTEMS simplified abstract|17727203]])=== | | ===TOUCHLESS PROVISIONING OF INFORMATION HANDLING SYSTEMS ([[US Patent Application 17727203. TOUCHLESS PROVISIONING OF INFORMATION HANDLING SYSTEMS simplified abstract|17727203]])=== |
| Line 1,317: |
Line 756: |
| | Jon Vernon FRANKLIN | | Jon Vernon FRANKLIN |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes a method for setting up a bare metal server without the need for physical interaction. The method involves configuring a baseboard management controller (BMC) to support multiple network services. These services are used to retrieve a configuration profile locator (CPL), which is a network-accessible file containing the server's configuration profile (SCP). One of the network services can be used to retrieve the CPL and pass it to a provisioning agent process, which then accesses the configuration file and configures the server accordingly. The method is designed to work with servers that require a static IP address, as well as those that do not. It utilizes network services like multicast domain name service (mDNS) for static IP address systems and DHCP service for servers that do not require a static IP address.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | A disclosed touchless provisioning method configures a baseboard management controller (BMC)of a bare metal server to include or support two or more network services for retrieving a configuration profile locator (CPL) identifying a network-accessible configuration file containing a server configuration profile (SCP). At least one of the network services may be invoked to retrieve the CPL and pass the CPL to a provisioning agent process configured to access the configuration file and configure the system in accordance with the SCP. The server may require a static IP address and the two or more network services may include at least one network service, such as a multicast domain name service (mDNS), suitable for use in conjunction with a static IP address system and at least one network service, such as a DHCP service, suitable for use in conjunction with servers that do not require a static IP address.
| |
| | | | |
| | ===SYSTEM AND METHOD FOR DATA REDUCTION BY DATA SEQUENCE ALIGNMENT ([[US Patent Application 17726284. SYSTEM AND METHOD FOR DATA REDUCTION BY DATA SEQUENCE ALIGNMENT simplified abstract|17726284]])=== | | ===SYSTEM AND METHOD FOR DATA REDUCTION BY DATA SEQUENCE ALIGNMENT ([[US Patent Application 17726284. SYSTEM AND METHOD FOR DATA REDUCTION BY DATA SEQUENCE ALIGNMENT simplified abstract|17726284]])=== |
| Line 1,331: |
Line 764: |
| | Ofir Ezrielev | | Ofir Ezrielev |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes methods and systems for managing data collection in a distributed environment. The system includes a data aggregator and a data collector. The data collector uses a consensus sequence, which is a pattern of frequently occurring data, to generate smaller data transmissions. Instead of transmitting full data sets, the data collector replaces segments of data with pointer pairs, which indicate a portion of the consensus sequence that matches the data segment. The data collector then transmits these pointer pairs, along with any additional data segments, to the data aggregator. The data aggregator can reconstruct the data from multiple data collectors using the reduced-size data and the consensus sequence.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Methods and systems for managing data collection throughout a distributed environment are disclosed. To manage data collection, a system may include a data aggregator and a data collector. The data collector may utilize a consensus sequence to generate reduced-size data transmissions. The consensus sequence may be made up of patterns of data that occur frequently in data collected by the data collector. Therefore, data collected by the data collector may be condensed by replacing segments of the data with pointer pairs, pointer pairs being indicators of a portion of the consensus sequence that matches a segments of data. The data collector may transmit these pointer pairs, along with any additional segments of data, to the data aggregator instead of transmitting full data sets. The data aggregator may reconstruct data from the data collectors using the reduced-size data and the consensus sequence.
| |
| | | | |
| | ===Client Browser to Endpoint Peer to Peer Redirection from Cloud Control Pane ([[US Patent Application 17729206. Client Browser to Endpoint Peer to Peer Redirection from Cloud Control Pane simplified abstract|17729206]])=== | | ===Client Browser to Endpoint Peer to Peer Redirection from Cloud Control Pane ([[US Patent Application 17729206. Client Browser to Endpoint Peer to Peer Redirection from Cloud Control Pane simplified abstract|17729206]])=== |
| Line 1,345: |
Line 772: |
| | Christopher Atkinson | | Christopher Atkinson |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes a system, method, and computer-readable medium for managing connectivity in a data center. It involves providing a data center asset with a client module, establishing a connection between an end user device browser and a connectivity management system, submitting a request to establish connectivity with the client module, establishing a connection between the client module and the connectivity management system, and exchanging information between the client module and the connectivity management system via a secure communication channel.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | A system, method, and computer-readable medium are disclosed for performing a data center connectivity management operation. The connectivity management operation includes: providing a data center asset with a data center asset client module; establishing a connection between an end user device browser and a connectivity management system, the connectivity management system comprising a connectivity management system aggregator; submitting a request to the connectivity management system via the end user device browser to establish connectivity with the data center asset client module; establishing a connection between the data center asset client module and the connectivity management system based upon the request; and, exchanging information between the data center asset client module and the data connectivity management system via the secure communication channel between the data center asset client module and the connectivity management system aggregator.
| |
| | | | |
| | ===Secure Certificate Storage When a Connectivity Management System Client is Running on an Operating System ([[US Patent Application 17728362. Secure Certificate Storage When a Connectivity Management System Client is Running on an Operating System simplified abstract|17728362]])=== | | ===Secure Certificate Storage When a Connectivity Management System Client is Running on an Operating System ([[US Patent Application 17728362. Secure Certificate Storage When a Connectivity Management System Client is Running on an Operating System simplified abstract|17728362]])=== |
| Line 1,359: |
Line 780: |
| | Elie A. Jreij | | Elie A. Jreij |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes a system, method, and computer-readable medium for monitoring and managing a data center. The system involves providing a data center asset with a client module, establishing a connection between the client module and a connectivity management system of a monitoring and management console, exchanging information between the client module and the connectivity management system, and establishing a secure communication channel for exchanging information between the client module and the monitoring and management console.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | A system, method, and computer-readable medium for performing a data center monitoring and management operation. The data center monitoring and management operation includes: providing a data center asset with a data center asset client module; establishing a connection between the data center asset client module and a connectivity management system of a data center monitoring and management console, the connectivity management system comprising a connectivity management system aggregator and a connectivity management system service; exchanging attestation and proof of ownership information between the data center asset communication client module and the connectivity management system service of the connectivity management system; establishing a secure communication channel between the data center asset client module and the connectivity management system aggregator based upon the attestation and proof of ownership information; and, exchanging information between the data center asset client module and the data center monitoring and management console via the secure communication channel between the data center asset client module and the connectivity management system aggregator.
| |
| | | | |
| | ===METHOD, ELECTRONIC DEVICE, AND COMPUTER PROGRAM PRODUCT FOR ADDRESS ENCRYPTION ([[US Patent Application 17750529. METHOD, ELECTRONIC DEVICE, AND COMPUTER PROGRAM PRODUCT FOR ADDRESS ENCRYPTION simplified abstract|17750529]])=== | | ===METHOD, ELECTRONIC DEVICE, AND COMPUTER PROGRAM PRODUCT FOR ADDRESS ENCRYPTION ([[US Patent Application 17750529. METHOD, ELECTRONIC DEVICE, AND COMPUTER PROGRAM PRODUCT FOR ADDRESS ENCRYPTION simplified abstract|17750529]])=== |
| Line 1,373: |
Line 788: |
| | Chenxi Hu | | Chenxi Hu |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes a method, electronic device, and computer program that involve address encryption. The method involves extracting an address from a packet received from a source device. This address is then mixed with a random number to generate a mixed address. The mixed address is then encrypted. A second address representing the source device's address is generated based on the encrypted mixed address. This second address includes a prefix field and an interface identifier field. These embodiments aim to improve the security of the source device and reduce computational overhead during address encryption and decryption.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Embodiments of the present disclosure provide a method, an electronic device, and a computer program product that involve address encryption. The method includes: in response to receiving a packet from a source device, extracting a first address representing an address of the source device from the packet. The method further includes: mixing the first address with a random number to generate a mixed address, wherein the number of bits of the first address is the same as the number of bits of the random number. The method further includes: encrypting the mixed address. Moreover, the method further includes: generating a second address representing the address of the source device at least partially based on the encrypted mixed address, wherein the second address includes a prefix field and an interface identifier field. Illustrative embodiments can improve the security of the source device, and reduce computational overhead during address encryption and decryption.
| |
| | | | |
| | ===USER ATTESTATION IN DISTRIBUTED CONTROL PLANE ([[US Patent Application 17725291. USER ATTESTATION IN DISTRIBUTED CONTROL PLANE simplified abstract|17725291]])=== | | ===USER ATTESTATION IN DISTRIBUTED CONTROL PLANE ([[US Patent Application 17725291. USER ATTESTATION IN DISTRIBUTED CONTROL PLANE simplified abstract|17725291]])=== |
| Line 1,387: |
Line 796: |
| | Bradley K. Goodman | | Bradley K. Goodman |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes methods and systems for managing the security of distributed systems that use certificates for command and control purposes. These certificates are used to delegate authority to different entities and verify the public keys associated with them. The system ensures security by only allowing the use of certificates and public keys that have been verified. This helps reduce the risk of attacks through unauthorized use of delegated keys.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Methods and systems for managing the security of distributed systems that utilize certificates for command and control purposes are disclosed. The certificates may be used to delegate authority to various entities and attest public keys associated with the entities. To manage security using the certificates, the system may limit use of certificates and public keys to only those that have been attested. By doing so, the vulnerability to attacks through unauthorized use of keys of delegates may be reduced.
| |
| | | | |
| | ===CONTROL-PLANE PROTOCOL FOR ISOLATED OR DISCONNECTED ENVIRONMENTS OF AN INFORMATION HANDLING SYSTEM ([[US Patent Application 17724880. CONTROL-PLANE PROTOCOL FOR ISOLATED OR DISCONNECTED ENVIRONMENTS OF AN INFORMATION HANDLING SYSTEM simplified abstract|17724880]])=== | | ===CONTROL-PLANE PROTOCOL FOR ISOLATED OR DISCONNECTED ENVIRONMENTS OF AN INFORMATION HANDLING SYSTEM ([[US Patent Application 17724880. CONTROL-PLANE PROTOCOL FOR ISOLATED OR DISCONNECTED ENVIRONMENTS OF AN INFORMATION HANDLING SYSTEM simplified abstract|17724880]])=== |
| Line 1,401: |
Line 804: |
| | Bradley Goodman | | Bradley Goodman |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes an information handling system in a network of multiple nodes. The system has a memory and a processor. The memory stores variables that represent the state of the system. The processor receives a message that has been cryptographically signed. The source of this message is considered untrusted within the network. The processor verifies the message to ensure its authenticity. If the message is verified as authoritative, the processor checks if the state described in the message matches the state stored in the memory. If there is a match, the processor executes a request associated with the message.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | An information handling system of a multiple node environment includes a memory and a processor. The memory stores one or more variables associated with a state of the information handling system. The processor receives a cryptographically signed message. A source of the cryptographically signed message is considered as an untrusted source within the multiple node environment. The processor verifies the cryptographically signed message as an authoritative message. In response to the cryptographically signed message being verified as an authoritative message, the processor determines the state described in the cryptographically signed message matches the state of the information handling system stored in the memory. In response to the state described within the cryptographically signed message matches a current system state, the processor executes a request associated with the cryptographically signed message.
| |
| | | | |
| | ===METHODS AND SYSTEMS FOR ANOMALOUS OPERATION DETECTION ON AN ENTERPRISE SERVER ([[US Patent Application 17726817. METHODS AND SYSTEMS FOR ANOMALOUS OPERATION DETECTION ON AN ENTERPRISE SERVER simplified abstract|17726817]])=== | | ===METHODS AND SYSTEMS FOR ANOMALOUS OPERATION DETECTION ON AN ENTERPRISE SERVER ([[US Patent Application 17726817. METHODS AND SYSTEMS FOR ANOMALOUS OPERATION DETECTION ON AN ENTERPRISE SERVER simplified abstract|17726817]])=== |
| Line 1,415: |
Line 812: |
| | Vaneeswaran N | | Vaneeswaran N |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes a method for handling a special type of operation called a privileged operation. The method involves a privileged operations monitor, which is a program running on a data server. When a client device sends a privileged operation request, the monitor receives it. The monitor then collects various measurements related to the request, such as its size or duration. Using these measurements, it calculates a score that indicates how unusual or abnormal the request is. Based on this score, the monitor determines if the request is anomalous or not. If it is deemed anomalous, the monitor places a hold on the request, meaning it temporarily stops the request from being processed further.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | A method for holding an anomalous privileged operation, that includes receiving, by a privileged operations monitor executing on a data server, a privileged operation request from a client device, obtaining a plurality of metrics for the privileged operation request, calculating an anomaly score for the privileged operation request, based on the plurality of metrics, making a first determination, based on the anomaly score, that the privileged operation request is anomalous, and based on the first determination, placing a hold on the privileged operation request.
| |
| | | | |
| | ===METHODS AND SYSTEMS FOR DYNAMICALLY ADJUSTING DATA CHUNK SIZES COPIED OVER A NETWORK ([[US Patent Application 17724660. METHODS AND SYSTEMS FOR DYNAMICALLY ADJUSTING DATA CHUNK SIZES COPIED OVER A NETWORK simplified abstract|17724660]])=== | | ===METHODS AND SYSTEMS FOR DYNAMICALLY ADJUSTING DATA CHUNK SIZES COPIED OVER A NETWORK ([[US Patent Application 17724660. METHODS AND SYSTEMS FOR DYNAMICALLY ADJUSTING DATA CHUNK SIZES COPIED OVER A NETWORK simplified abstract|17724660]])=== |
| Line 1,429: |
Line 820: |
| | Sunil Yadav | | Sunil Yadav |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes a method for copying data from one server to another. The process involves initiating the copy operation, obtaining resource statistics, and setting the size of the data chunks based on these statistics. The data chunks, which contain portions of the source data, are then copied to a read queue. From the read queue, the data chunks are sent to a network device. Once the copy operation is complete, it is ended.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | A method for copying source data from a source server to a destination server, that includes initiating, by a source copy manager, a copy operation of the source data, where during the copy operation, the method further includes obtaining resource statistics, setting a data chunk size based on the resource statistics, copying a data chunk to a read queue, where the data chunk includes a portion of the source data, and where the data chunk has the data chunk size, and sending, from the read queue, the data chunk to a network device, and ending the copy operation.
| |
| | | | |
| | ===METHOD, ELECTRONIC DEVICE, AND COMPUTER PROGRAM PRODUCT FOR LOOKING UP DATA ([[US Patent Application 17747677. METHOD, ELECTRONIC DEVICE, AND COMPUTER PROGRAM PRODUCT FOR LOOKING UP DATA simplified abstract|17747677]])=== | | ===METHOD, ELECTRONIC DEVICE, AND COMPUTER PROGRAM PRODUCT FOR LOOKING UP DATA ([[US Patent Application 17747677. METHOD, ELECTRONIC DEVICE, AND COMPUTER PROGRAM PRODUCT FOR LOOKING UP DATA simplified abstract|17747677]])=== |
| Line 1,443: |
Line 828: |
| | Zhenzhen Lin | | Zhenzhen Lin |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes a method, electronic device, and computer program for looking up data in a system with a layered structure. The method involves acquiring a data identifier for the data to be looked up, which includes layer information related to a specific layer in the system. The distance between the data identifier and the node identifier for the first node is determined, and based on this distance, a second node is determined to acquire metadata for the data. The metadata is then used to determine a third node that stores the actual data, which can be acquired.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Embodiments of the present disclosure relate to a method, an electronic device, and a computer program product for looking up data. This method includes: acquiring, at a first node, a data identifier for data to be looked up, wherein the first node is located in a system having a layered structure, and the data identifier comprises layer information related to a layer in the layered structure. The method further includes: determining a distance between the data identifier and a node identifier for the first node. The method further includes: determining, based on the distance, a second node that can be used to acquire metadata for the data for acquiring the metadata, wherein the distance is related to positions of the first node and the second node in the layered structure. The method further includes: determining, based on the metadata, a third node storing the data for acquiring the data.
| |
| | | | |
| | ===MODIFYING RADIO UNIT OPERATIONAL PARAMETERS ([[US Patent Application 17660360. MODIFYING RADIO UNIT OPERATIONAL PARAMETERS simplified abstract|17660360]])=== | | ===MODIFYING RADIO UNIT OPERATIONAL PARAMETERS ([[US Patent Application 17660360. MODIFYING RADIO UNIT OPERATIONAL PARAMETERS simplified abstract|17660360]])=== |
| Line 1,457: |
Line 836: |
| | Tommy Ivarsson | | Tommy Ivarsson |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes a system that consists of two units: a distributed unit and a radio unit. The distributed unit processes traffic and schedules the traffic load, resulting in processed traffic. It then communicates this processed traffic and traffic load scheduling to the radio unit. The radio unit, in turn, adjusts its operational parameters based on the information received from the distributed unit.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | A system can comprise a distributed unit that is configured to process traffic and traffic load scheduling to produce processed traffic, and to communicate the processed traffic and traffic load scheduling to the radio unit. The system can further comprise a radio unit that is configured to modify operational parameters of the radio unit based on the processed traffic and traffic load scheduling received from the distributed unit.
| |
| | | | |
| | ===METHOD, ELECTRONIC DEVICE AND COMPUTER PROGRAM PRODUCT FOR DATA TRANSMISSION ([[US Patent Application 17747193. METHOD, ELECTRONIC DEVICE AND COMPUTER PROGRAM PRODUCT FOR DATA TRANSMISSION simplified abstract|17747193]])=== | | ===METHOD, ELECTRONIC DEVICE AND COMPUTER PROGRAM PRODUCT FOR DATA TRANSMISSION ([[US Patent Application 17747193. METHOD, ELECTRONIC DEVICE AND COMPUTER PROGRAM PRODUCT FOR DATA TRANSMISSION simplified abstract|17747193]])=== |
| Line 1,471: |
Line 844: |
| | Zijia Wang | | Zijia Wang |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes a method, electronic device, and computer program for data transmission. The method involves a management node obtaining status data from multiple work nodes that it manages, when a user terminal is moving from one position to another. The status data includes information about the utilization rates of the work nodes. The method also includes determining weights for the work nodes based on their status data and loading content data requested by the user terminal onto one or more work nodes based on these weights.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | Embodiments of the disclosure provide a method, electronic device and computer program product for data transmission. The method may include enabling a management node to obtain status data of a plurality of work nodes from the plurality of work nodes managed by the management node in response to determining that a user terminal is to move from a first position to a second position different from the first position. The status data are at least associated with utilization rates of the plurality of work nodes. The method may further include determining a plurality of weights of the plurality of work nodes at least based on the status data of the plurality of work nodes. Moreover, the method may include loading content data requested by the user terminal to at least one work node in the plurality of work nodes based on the plurality of weights.
| |
| | | | |
| | ===FINE TUNING RADIO UNIT PERFORMANCE ([[US Patent Application 17660356. FINE TUNING RADIO UNIT PERFORMANCE simplified abstract|17660356]])=== | | ===FINE TUNING RADIO UNIT PERFORMANCE ([[US Patent Application 17660356. FINE TUNING RADIO UNIT PERFORMANCE simplified abstract|17660356]])=== |
| Line 1,485: |
Line 852: |
| | Tommy Ivarsson | | Tommy Ivarsson |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes a system that includes a radio unit, a power detector, an actuator, and a hardware component. The power detector is responsible for analyzing the characteristics of the signal data traffic received by the radio unit. The actuator is then used to adjust the operational parameter of the radio unit, which in turn affects the performance of the radio unit. The hardware component is used to analyze the signal data traffic and determine when and how to modify the operational parameter of the radio unit.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | A system can comprise a radio unit. The system can further comprise a power detector that is configured to determine characteristics of incident signal data traffic of the radio unit. The system can further comprise an actuator that is configured to modify an operational parameter of the radio unit, wherein modifying the operational parameter of the radio unit alters performance of the radio unit. The system can further comprise a hardware component that is configured to cause the actuator to modify the operational parameter of the radio unit based on analyzing the incident signal data traffic.
| |
| | | | |
| | ===DISTRIBUTED UNIT SCHEDULING FOR CUSTOM SIGNAL TRAFFIC ([[US Patent Application 17660331. DISTRIBUTED UNIT SCHEDULING FOR CUSTOM SIGNAL TRAFFIC simplified abstract|17660331]])=== | | ===DISTRIBUTED UNIT SCHEDULING FOR CUSTOM SIGNAL TRAFFIC ([[US Patent Application 17660331. DISTRIBUTED UNIT SCHEDULING FOR CUSTOM SIGNAL TRAFFIC simplified abstract|17660331]])=== |
| Line 1,499: |
Line 860: |
| | Tommy Ivarsson | | Tommy Ivarsson |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This technology allows for the scheduling of custom traffic injection into a radio unit's communication path. This custom traffic can be used to improve the performance of the radio unit by performing tasks such as antenna calibration and test and measurement operations. The distributed unit works together with the radio unit to schedule and synchronize this custom traffic alongside live-air and non-live-air traffic. Additionally, the distributed unit can communicate upcoming traffic knowledge to the radio unit, allowing it to adjust its operating state accordingly.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | The described technology is generally directed towards scheduling, by a distributed unit, the injection of custom traffic (signals/data) into a radio unit communications path. The custom traffic can be used to improve the performance of the radio unit, such as to perform antenna calibration, to perform test and measurement operations to obtain performance data, which can be used, for example, to modify operating parameters of the radio unit to improve performance of the radio unit. The distributed unit coordinates with the radio unit to schedule and synchronize such custom traffic in unscheduled (physical resource block), such as interleaved with to live-air and non-live-air traffic. Further, the distributed unit, which has scheduling knowledge of upcoming traffic of the radio unit, can communicate such knowledge to the radio unit for the radio unit to change its operating state based on the upcoming traffic knowledge.
| |
| | | | |
| | ===MINIMIZING IMPEDANCE TOLERANCES DUE TO MISREGISTRATION ([[US Patent Application 17729857. MINIMIZING IMPEDANCE TOLERANCES DUE TO MISREGISTRATION simplified abstract|17729857]])=== | | ===MINIMIZING IMPEDANCE TOLERANCES DUE TO MISREGISTRATION ([[US Patent Application 17729857. MINIMIZING IMPEDANCE TOLERANCES DUE TO MISREGISTRATION simplified abstract|17729857]])=== |
| Line 1,513: |
Line 868: |
| | Sandor Farkas | | Sandor Farkas |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes a printed circuit board used in an information handling system. This circuit board has two signal vias, which are pathways for electrical signals. Each signal via is surrounded by a keepout object, which is a designated area that prevents other components from interfering with the signal via. The circuit board also has two signal traces, which are conductive paths for carrying electrical signals. These signal traces, one positive and one negative, are located between the keepout objects. Additionally, the width of each signal trace is increased, likely to improve the performance and reliability of the circuit board.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | A printed circuit board of an information handling system includes a pair of signal vias including a pair of keepout objects. Each one of the keepout objects surrounds one of the signal vias. The printed circuit board includes a pair of signal traces that includes a positive signal trace and a negative signal trace, wherein the pair of signal traces are between the keepout objects, and wherein a width of each of the signal traces is increased.
| |
| | | | |
| | ===HATCHING GROUND UNDER A PAD IN A PRINTED CIRCUIT BOARD ([[US Patent Application 17728131. HATCHING GROUND UNDER A PAD IN A PRINTED CIRCUIT BOARD simplified abstract|17728131]])=== | | ===HATCHING GROUND UNDER A PAD IN A PRINTED CIRCUIT BOARD ([[US Patent Application 17728131. HATCHING GROUND UNDER A PAD IN A PRINTED CIRCUIT BOARD simplified abstract|17728131]])=== |
| Line 1,527: |
Line 876: |
| | Zhenli Liu | | Zhenli Liu |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes an information handling system that includes a printed circuit board. The circuit board has two sets of pads, one for a differential pair and the other for a ground. The pads for the differential pair are located on the surface of the board, while the ground is routed within the first layer of the board. The traces for the differential pair are located below the pads and the ground within the second layer of the board. The purpose of the ground is to reduce interference between the signals on the traces and the signals on the differential pair pads.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | An information handling system includes a printed circuit board. The printed circuit board includes first and second pads of a first differential pair, a hatched ground, and first and second traces of a second differential pair. The first and second pads of the first differential pair are routed a surface of the printed circuit board. The hatched ground routed within a first layer of the printed circuit board. The first and second traces of the second differential pair are routed below the first and second pads and the hatched ground within a second layer of the printed circuit board. The hatched ground dampens crosstalk between signals on the traces and signals on the differential pair pads.
| |
| | | | |
| | ===DIFFERENTIAL PAIR INNER-SIDE IMPEDANCE COMPENSATION ([[US Patent Application 17746135. DIFFERENTIAL PAIR INNER-SIDE IMPEDANCE COMPENSATION simplified abstract|17746135]])=== | | ===DIFFERENTIAL PAIR INNER-SIDE IMPEDANCE COMPENSATION ([[US Patent Application 17746135. DIFFERENTIAL PAIR INNER-SIDE IMPEDANCE COMPENSATION simplified abstract|17746135]])=== |
| Line 1,541: |
Line 884: |
| | Lingyu Kong | | Lingyu Kong |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes an information handling system that has two differential pairs on a printed circuit board. Each differential pair consists of two traces and two sets of impedance compensation traces. The impedance compensation traces are only routed on the inner side of their respective traces and are aligned with each other. This arrangement helps to maintain the integrity of the signals transmitted through the traces.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | An information handling system includes first and second differential pairs on a printed circuit board. The first differential pair includes first and second traces, and first and second sets of impedance compensation traces. The first impedance compensation traces are routed only on an inner-side of the first trace. The second impedance compensation traces are routed only on an inner-side of the second trace, and the first and second impedance compensation traces are substantially aligned. The second differential pair includes third and fourth traces and third and fourth sets of impedance compensation traces. The third set of impedance compensation traces are routed only on an inner-side of the third trace. The fourth impedance compensation traces are routed only on an inner-side of the fourth trace, and the third and fourth impedance compensation traces are substantially aligned.
| |
| | | | |
| | ===RESETTING DIFFERENT PAIR SKEW OF PRINTED CIRCUIT BOARD TRACES ([[US Patent Application 17726189. RESETTING DIFFERENT PAIR SKEW OF PRINTED CIRCUIT BOARD TRACES simplified abstract|17726189]])=== | | ===RESETTING DIFFERENT PAIR SKEW OF PRINTED CIRCUIT BOARD TRACES ([[US Patent Application 17726189. RESETTING DIFFERENT PAIR SKEW OF PRINTED CIRCUIT BOARD TRACES simplified abstract|17726189]])=== |
| Line 1,555: |
Line 892: |
| | Sandor Farkas | | Sandor Farkas |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes an information handling system that has a printed circuit board. The circuit board includes a differential pair, which consists of two traces. There is also a ground trace that is positioned between the two traces of the differential pair. Additionally, there is a ground via located along the ground trace. The combination of the ground trace and the ground via creates a common mode signal filter. This filter helps to reset the skew, or timing difference, of the differential pair.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | An information handling system includes a printed circuit board, which in turn includes a differential pair, a ground trace, and a ground via. The differential pair includes first and second traces. The ground trace is routed between the first and second traces of the differential pair. The ground via is located along the ground trace. The ground trace and the ground via combine to create a common mode signal filter, which in turn resets a skew of the differential pair.
| |
| | | | |
| | ===PCB STIFFENING STRUCTURE TO PREVENT WARPING ([[US Patent Application 17729800. PCB STIFFENING STRUCTURE TO PREVENT WARPING simplified abstract|17729800]])=== | | ===PCB STIFFENING STRUCTURE TO PREVENT WARPING ([[US Patent Application 17729800. PCB STIFFENING STRUCTURE TO PREVENT WARPING simplified abstract|17729800]])=== |
| Line 1,569: |
Line 900: |
| | Sandor Farkas | | Sandor Farkas |
| | | | |
| − |
| |
| − | '''Brief explanation'''
| |
| − | The abstract describes a printed circuit board (PCB) that has a metal layer and a via. The via is connected to a specific part of the metal layer, which forms a flange of a beam structure within the PCB. The via itself forms a web of the beam structure.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | A printed circuit board (PCB) includes a metal layer and a via. The via is coupled to a portion of the metal layer. The portion of the metal layer forms a flange of a beam structure in the PCB. The via forms a web of the beam structure in the PCB.
| |
| | | | |
| | ===DIFFERENTIAL VIA DESIGN ON A PRINTED CIRCUIT BOARD ([[US Patent Application 17726235. DIFFERENTIAL VIA DESIGN ON A PRINTED CIRCUIT BOARD simplified abstract|17726235]])=== | | ===DIFFERENTIAL VIA DESIGN ON A PRINTED CIRCUIT BOARD ([[US Patent Application 17726235. DIFFERENTIAL VIA DESIGN ON A PRINTED CIRCUIT BOARD simplified abstract|17726235]])=== |
| Line 1,582: |
Line 907: |
| | | | |
| | Chang-Kai Chu | | Chang-Kai Chu |
| − |
| |
| − |
| |
| − | '''Brief explanation'''
| |
| − | This abstract describes an information handling system that has a printed circuit board with a signal via. The signal via is made up of a conductive metal plating and has two parts called via portions. One via portion is connected to a first trace of a differential pair, while the other via portion is connected to a second trace of the differential pair. Both via portions are formed within the conductive metal plating.
| |
| − |
| |
| − | '''Abstract'''
| |
| − | An information handling system includes a printed circuit board having a signal via fabricated through the printed circuit board. The signal via includes a conductive metal plating. The signal via also includes first and second via portions. The first via portion is connected to a first trace of a differential pair. The second via portion is connected to a second trace of the differential pair. The first and second via portions are formed in the conductive metal plating.
| |
