中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

13716 records (took 0.053 seconds)

    Distributing Certificate Bundles According To Distribution Schedules
    51.
    发明申请
    Distributing Certificate Bundles According To Distribution Schedules 有权

    公开(公告)号：US20250088499A1

    公开(公告)日：2025-03-13

    申请号：US18466474

    申请日：2023-09-13

    Applicant: Oracle International Corporation

    Inventor： Sneha Sudhakaran Nair ,  Tony Long ,  Mauruthi Geetha Mohan ,  Akshay Krishnath Dagade ,  Jakub Wojciak

    IPC: H04L9/40

    Abstract: Operations of a certificate bundle distribution service may include: detecting a trigger condition to distribute a certificate bundle that includes a set of one or more certificate authority certificates; partitioning each particular network entity of a plurality of network entities associated with a computer network into one of a plurality of certificate distribution groups based on a network address of the particular network entity, in which each particular certificate distribution group includes a particular subset of network entities from the plurality of network entities; selecting a particular certificate distribution group, of the plurality of certificate distribution groups, for distribution of the certificate bundle; and transmitting the certificate bundle to the particular subset of network entities in the particular certificate distribution group.

    PREPARING DATA FOR HIGH-PRECISION ABSOLUTE LOCALIZATION OF A MOVING OBJECT ALONG A TRAJECTORY
    52.
    发明申请
    PREPARING DATA FOR HIGH-PRECISION ABSOLUTE LOCALIZATION OF A MOVING OBJECT ALONG A TRAJECTORY 有权

    公开(公告)号：US20250086810A1

    公开(公告)日：2025-03-13

    申请号：US18367415

    申请日：2023-09-12

    Applicant: Oracle International Corporation

    Inventor： Oleg Gennadievich Shevelev ,  Sahil Malhotra ,  Sergio Aldea Lopez ,  Matthew Charles Rowe ,  Alberto Polleri

    IPC: G06T7/292 ,  G06F17/12

    Abstract: Techniques for preparing data for high-precision absolute localization of a moving object along a trajectory are provided. In one technique, a sliding window of a set of adjacent points along a trajectory of a moving object is identified, along with a midpoint in the sliding window. Based on the set of adjacent points, a first polynomial equation is generated for a first dimension and a second polynomial equation is generated for a second dimension. A first derivative at a particular timestamp associated with the midpoint is a first velocity along the first dimension, while a particular first derivative at the particular timestamp is a second velocity along the second dimension. A velocity in direction of yaw is generated based on the first velocity, the second velocity, and a slip angle associated with the midpoint. A yaw angle is generated based on the velocity in direction of yaw.

    Large Language Machine Learning Model Query Management
    53.
    发明申请
    Large Language Machine Learning Model Query Management 有权

    公开(公告)号：US20250086235A1

    公开(公告)日：2025-03-13

    申请号：US18812123

    申请日：2024-08-22

    Applicant: Oracle International Corporation

    Inventor： Vivek Kumar

    IPC: G06F16/9032 ,  G06N3/0475

    Abstract: Techniques for filtering queries to a large language model (LLM) based on their relevance to an enterprise domain associated with the LLM involve training a machine learning model using historical LLM query data and associated relevance scores. These scores indicate how closely a query relates to the enterprise's operations. The trained model is then applied to new input queries, generating relevance scores for the input queries. Queries meeting a predetermined relevance threshold are passed to the LLM for processing. For queries falling below this threshold, remedial actions are taken instead of processing by the LLM. The techniques optimize computational resource allocation by prioritizing queries relevant to the enterprise while filtering out less pertinent ones. The techniques create a relevance-based gatekeeping mechanism for LLM query processing, enhancing efficiency and focusing the LLM's capabilities on enterprise-specific tasks.

    COMPILING JUST THE BEST BITS: FINDING THE MAXIMUM BENEFIT SHARED SUBEXPRESSIONS IN A QUERY WORKLOAD
    54.
    发明申请
    COMPILING JUST THE BEST BITS: FINDING THE MAXIMUM BENEFIT SHARED SUBEXPRESSIONS IN A QUERY WORKLOAD 有权

    公开(公告)号：US20250086176A1

    公开(公告)日：2025-03-13

    申请号：US18638931

    申请日：2024-04-18

    Applicant: Oracle International Corporation

    Inventor： Lawrence Lim ,  Laleh Aghababaie Beni ,  Garret F. Swart

    IPC: G06F16/2453 ,  G06F11/34 ,  G06F16/2452

    Abstract: In a computer, each of many statement plan trees respectively represents a distinct database statement in a database workload. Each statement plan tree contains a distinct set of tree nodes. A first statement plan tree contains a first subtree and represents a first statement. A second statement plan tree contains a second subtree, and a third statement plan tree contains a third subtree. By agglomeration, a first cluster subplan is generated that represents the first subtree of the first statement plan tree and the second subtree of the second statement plan tree. By subsequent agglomeration, a second cluster subplan is generated that represents the third subtree of the third statement plan tree and the first cluster subplan. Execution of the first database statement uses the second cluster subplan for acceleration. Agglomeration may be decided based on novel net benefit estimation, novel inter-cluster distance, and a novel and tunable compilation cost.

    Systems and Methods for Performing Concurrency Restriction and Throttling over Contended Locks
    59.
    发明申请
    Systems and Methods for Performing Concurrency Restriction and Throttling over Contended Locks 有权

    公开(公告)号：US20250077309A1

    公开(公告)日：2025-03-06

    申请号：US18954407

    申请日：2024-11-20

    Applicant: Oracle International Corporation

    Inventor： David Dice

    IPC: G06F9/52

    Abstract: A concurrency-restricting lock may divide a set of threads waiting to acquire the lock into an active circulating set (ACS) that contends for the lock, and a passive set (PS) that awaits an opportunity to contend for the lock. The lock, which may include multiple constituent lock types, lists, or queues, may be unfair over the short term, but improve throughput of the underlying multithreaded application. Culling and long-term fairness policies may be applied to the lock to move excess threads from the ACS to the PS or promote threads from the PS to the ACS. These policies may constraint the size or distribution of threads in the ACS (which may be NUMA-aware). A waiting policy may avoid aggressive promotion from the PS to the ACS, and a short-term fairness policy may move a thread from the tail of a list or queue to its head.

    STATEFULSETS GRACEFUL TERMINATION FOR CLOUD COMPUTING PLATFORMS
    60.
    发明申请
    STATEFULSETS GRACEFUL TERMINATION FOR CLOUD COMPUTING PLATFORMS 有权

    公开(公告)号：US20250077301A1

    公开(公告)日：2025-03-06

    申请号：US18542335

    申请日：2023-12-15

    Applicant: Oracle International Corporation

    Inventor： Chandrashekar Arunachalam ,  David Edward DiFranco

    IPC: G06F9/50 ,  G06F9/455

    Abstract: A pod hosted on a node is generated via the cloud orchestration platform. The pod is to be assigned to managing the one or more task processes corresponding to the data set. The pod is designated as a master pod. E ach of one or more worker pods replicates data from the master pod. Each of the one or more worker pods is hosted on another node. An input that triggers an upgrade for the corresponding virtual machines is detected. Execution of a custom script is initiated, which triggers: polling the microservice for status information of the pod and the set of replicas; and determining whether a condition for iteration advancement for the upgrade is satisfied based on the status upgrade. An incremental advancement of the upgrade to a next virtual machine is initiated upon determining that the condition for iteration advancement for the upgrade is satisfied.

Patent Agency Ranking