Microsoft Technology Licensing, LLC patent applications published on November 30th, 2023

Patent applications for Microsoft Technology Licensing, LLC on November 30th, 2023

Enhanced Eye Tracking Using Lens Inverse Transform (17824663)

Main Inventor

Navid POULAD

Brief explanation

The patent application describes a method for eye tracking using a head mounted display device and a vision correcting lens. Here are the key points:

• The method involves capturing images of an eye through a camera in a head mounted display device.
• These images are then processed using an inverse transform corresponding to the vision correcting lens.
• The inverse transform helps obtain uncorrected images of the eye, which can provide more accurate eye tracking data.
• Eye tracking is performed based on the uncorrected images of the eye, allowing for precise tracking of eye movements.
• This technology can be useful in various applications such as virtual reality, augmented reality, and medical diagnostics.

Abstract

A computer implemented method includes receiving images of an eye through a vision correcting lens via a camera in a head mounted display device, obtaining an inverse transform corresponding to the vision correcting lens, applying the inverse transform to the received images to obtain uncorrected images of the eye, and performing eye tracking based on the uncorrected images of the eye.

ENABLING LOCAL SPLIT-SCREEN MULTIPLAYER EXPERIENCES USING REMOTE MULTIPLAYER GAME SUPPORT (18247626)

Main Inventor

Nikita TSYTSARKIN

Brief explanation

The patent application describes a system for a multiplayer game that allows both local and remote multiplayer experiences. 

• The system establishes multiple game streams, each corresponding to a different instance of the multiplayer game.
• Each game stream is associated with a different user identifier, allowing multiple users to join a single multiplayer session remotely.
• Gaming interface devices are connected to the system and associated with specific game streams.
• The system outputs a composite stream that displays all game streams simultaneously in a split-screen format on a single display device.
• Input signals from each gaming interface device are routed to the corresponding game stream, allowing players to control their individual game instances.

Abstract

Presenting a local multiplayer experience for a multiplayer game that includes remote multiplayer support. A computer system establishes a plurality of game streams, each corresponding to a different instance of the multiplayer game. Each game stream corresponds to a different user identifier of a plurality of user identifiers that are joined to a single multiplayer session using the remote multiplayer support of the multiplayer game. The computer system associates each of a plurality of gaming interface devices with a different game stream. The computer system outputs a composite stream of the plurality of game streams, which simultaneously presents each game stream in a split-screen display format for display at a single display device. While outputting the composite stream of the plurality of game streams, the computer system causes input signals received from each gaming interface device to be routed to its associated game stream.

SYSTEMS AND METHODS FOR RICH PERSONALIZATION OF COMPUTER GAME EXPERIENCES (17828926)

Main Inventor

Gershom PAYZER

Brief explanation

- This patent application describes a method for recommending unplayed game applications to users based on their game history.

- The method involves obtaining the game history associated with a user profile, which includes records of games the user has played. - The game history is then evaluated to identify game events associated with a specific game application. - A table of tags associated with these game events is accessed, and a tag list is created in the user profile based on these tags and game events. - Finally, a recommendation of an unplayed game application is presented to the user based on the tags in the tag list. - The goal of this method is to provide personalized game recommendations to users based on their past gaming experiences.

Abstract

A method of recommending an unplayed game application to a user includes obtaining a game history associated with a user profile, wherein the game history includes at least one game record of a game application the user profile has been used to play, and evaluating the game history to obtain a plurality of game events associated with a game application of the game history. The method further includes accessing a table of tags associated with the plurality of game events associated with the game application, aggregating a plurality of tags in a tag list in the user profile based at least partially on the table of tags and the plurality of game events, and presenting to the user a recommendation of an unplayed game application based at least partially on the plurality of tags.

IMPORTING AGENT PERSONALIZATION DATA TO INSTANTIATE A PERSONALIZED AGENT IN A USER GAME SESSION (17855389)

Main Inventor

Gabriel A. DESGARENNES

Brief explanation

The patent application is for a personalized agent service that creates customized agents for users to play with in a video game. These agents are controlled by machine learning models that are trained to interact with the game environment and the user during gameplay. 

• The personalized agent service generates and evolves customized agents for users to play with in a video game.
• Machine learning models are trained to control the agent's interactions with the game environment and the user during gameplay.
• Users can request a personalized agent to join their gameplay session.
• The user's device sends a request for the personalized agent to a game platform.
• The game platform checks if the user has a license to run a second instance of the game.
• If the user has a license, a second instance of the game is executed on the user's device.
• Information from the personalized agent service is used to create a personalized agent in the second instance of the game.

Abstract

Aspects of the present disclosure relate to a personalized agent service that generates and evolves customized agents that can be instantiated in-game to play with users. Machine learning models are trained to control the agent's interactions with the game environment and the user during gameplay. A user may request that a personalized agent join the user's gameplay session. The user device sends a request for the personalized agent to a game platform. The game platform determines whether the user has a license to execute a second instance of the game. When the user has a license to execute a second instance of the game, the second instance of the game may be executed on the user device. Information received from a personalized agent service is used to instantiate a personalized agent in the second instance of the game.

IMPORTING AGENT PERSONALIZATION DATA TO POSSESS IN-GAME NON-PLAYER CHARACTERS (17855417)

Main Inventor

William B. DOLAN

Brief explanation

The patent application describes a personalized agent service that creates customized agents for users to play with in a game. These agents are controlled by machine learning models that learn from the user's gameplay and adapt to their preferred playstyle and strategies. The service stores the personalized data generated during gameplay and provides an API for games to import this data and customize in-game non-player characters (NPCs) according to the user's preferences.

• Personalized agent service generates customized agents for users to play with in a game.
• Machine learning models control the agent's interactions with the game environment and the user during gameplay.
• The models learn from the user's gameplay and develop gameplay styles that match the user's preferences.
• The agent personalization data generated during gameplay is stored by the service.
• An API is provided for games to import this data and customize in-game NPCs according to the user's preferences.

Abstract

Aspects of the present disclosure relate to a personalized agent service that generates and evolves customized agents that can be instantiated in-game to play with users. Machine learning models are trained to control the agent's interactions with the game environment and the user during gameplay. As the user continues to play with the agent, the one or more machine learning models develop gameplay styles for the agent that complement the user's preferred playstyle, incorporate the user's preferred strategies, and is generally customized for interaction with the user. The agent personalization data generated during gameplay is stored by the service. An application programming interface is provided by the personalized agent service. Using the API, games can import agent personalization data in order to customize in-game non-player characters (NPCs), thereby customizing the in-game NPCs in accordance with the user's preferences.

PIEZOELECTRICALLY-ACTUATED RESONANT SCANNING MIRROR (17804296)

Main Inventor

Xiao Chuan ONG

Brief explanation

The abstract describes a scanning mirror system for display devices.

• The system includes a mirror portion, a flexure arm, and a piezoelectric actuator support portion.
• The piezoelectric actuator is made of a piezoelectric film.
• A transmission arm is used to transmit motion from the piezoelectric film to the flexure arm.
• The transmission arm is separated from the piezoelectric actuator support portion by a first gap.
• An anchor portion is included to anchor the scanning mirror system to another structure.
• The anchor portion is separated from the piezoelectric actuator support portion by a second gap.

Abstract

Examples are disclosed that relate to scanning mirror systems for display devices. One example provides a scanning mirror system comprising a mirror portion, a flexure arm extending from the mirror portion, and a piezoelectric actuator support portion supporting a piezoelectric actuator comprising a piezoelectric film. The scanning mirror system further comprises a transmission arm extending between the flexure arm and the piezoelectric actuator support portion to transmit motion of the piezoelectric film to the flexure arm, the transmission arm separated at least partially from the piezoelectric actuator support portion by a first gap. The scanning mirror system further comprises an anchor portion separated at least partially from the piezoelectric actuator support portion by a second gap, the anchor portion configured to anchor the scanning mirror system to another structure.

MICROMIRROR RESONANCE SUPRESSION USING CONFIGURABLE FILTER (17827413)

Main Inventor

Wenjun LIAO

Brief explanation

The patent application describes a method for configuring a micromirror to suppress its resonance.

• The micromirror is subjected to different actuation frequencies and its response is measured.
• The resonant frequency of the micromirror is determined based on these measurements.
• Notch filter parameters are selected based on the determined resonant frequency.
• The notch filter is then configured with the selected parameters to suppress the resonance of the micromirror.

Abstract

The configuring of a micromirror to suppress a resonance of the micromirror. As part of the configuring process, the micromirror is subjected to multiple actuation frequencies, and the micromirror response is measured in response to at least some of these actuation frequencies. A resonant frequency of the micromirror is then determined using at least some of the measured mechanical responses. Then, depending on this determined resonant frequency of the micromirror, notch filter parameters are selected. There is more than one possibility for notch filter parameters, where the selected possibility depends on the determined resonant frequency. The notch filter is then configured with the selected notch filter parameters.

TIME TO DIGITAL CONVERTER (TDC) CIRCUIT WITH SELF-ADAPTIVE TIME GRANULARITY AND RELATED METHODS (17828538)

Main Inventor

Ping LU

Brief explanation

The abstract describes a time-to-digital converter (TDC) circuit that generates a digital output indicating the phase difference between a generated signal and a reference signal. This digital output is used to synchronize the generated signal with the reference signal using a digitally controlled oscillator (DCO).

• The TDC circuit operates in two modes: coarse mode and fine mode.
• In the coarse mode, the TDC circuit generates a first digital indication when the offset time (phase difference) is above a threshold.
• In the fine mode, the TDC circuit generates a second digital indication when the offset time is below the threshold.
• Both the first and second digital indications have the same number of bits.
• The first digital indication is normalized to the second digital indication to provide the digital output of the adaptive TDC circuit.
• A fractional bit is used to compensate for any quantization error in the digital output.

Abstract

A time-to-digital converter (TDC) circuit generates a digital output indicating a time, known as a phase difference, from a phase of the generated signal to a corresponding phase of a reference signal. The digital output is used by the digitally controlled oscillator (DCO) to correct for the phase/frequency difference to synchronize the generated signal with the reference signal. In an aspect, an adaptive TDC circuit generates a first digital indication in a coarse mode when the offset time is above a threshold and generates a second digital indication in a fine mode when the offset time is below the threshold. The first digital indication and the second digital indication each comprise a same number of bits, and the first digital indication is normalized to the second digital indication for the digital output of the adaptive TDC circuit. A fractional bit may be employed to compensate for a quantization error.

GESTURE RECOGNITION, ADAPTATION, AND MANAGEMENT IN A HEAD-WEARABLE AUDIO DEVICE (17752120)

Main Inventor

Eran CHENCINSKI

Brief explanation

The patent application describes a head-wearable audio device with a motion sensor and capacitive touch sensor.

• The motion sensor detects motion gestures and outputs motion parameter values.
• The gesture type is recognized by comparing the motion parameter values with recognition parameter values.
• An action is selected based on the recognized gesture type and executed by the device or a remote application.
• The device also includes a capacitive touch sensor that detects touch events and outputs touch parameter values.
• Gesture types can be recognized by comparing both motion and touch parameter values with recognition parameter values.
• The recognition parameter values are improved over time using machine learning and historical data.
• This innovation allows for hands-free control of the audio device through motion and touch gestures.

Abstract

A head-wearable audio device has a motion sensor that outputs motion parameter values based on a detected motion gesture. A gesture type is recognized by comparing the motion parameter values and per-user per-gesture-type recognition parameter values. An action is selected based on the selected gesture type and is executed by the head-wearable audio device or an application in a remote computing device. The head-wearable audio device may also include a capacitive touch sensor that detects capacitive touch events and outputs capacitive touch parameter values. A gesture type may be recognized by comparing both of detected motion parameter values and detected capacitive touch parameter values with per-user per-gesture-type recognition parameter values. The per-user per-gesture-type recognition parameter values are improved over time using machine learning and/or automated logic based on historical detected motion or capacitive touch parameters and corresponding selected gestures, or user profile data.

END-USER CREATED CROPPED APPLICATION WINDOW (18325636)

Main Inventor

Kevin Guo

Brief explanation

- This patent application describes systems and methods for cropping an application window to display only the desired portion.

- The technology allows users to crop specific parts of an application window, such as play controls or chat windows, and place them in a visible or accessible area of the display. - It can be used for various scenarios, including web pages, document pages, applications, and more. - The technology is particularly useful for multi-window scenarios on small screen devices where screen space is limited. - It improves the ease of working across different windows and applications and enhances the composition of each window.

Abstract

Systems and methods for providing a cropped application window of an application window. The systems include a window cropping application that performs a method that allows a user to crop just the portion of an application window the user is interested in (e.g., play controls for a music app, chat window in a gaming app) and place it in an area of the display with enduring visibility or accessibility (e.g., widget dashboard, desktop). The present technology may also be used for web pages (e.g., tutorial articles, reference images), document pages (e.g., reference pages), applications (e.g., calculators), and other scenarios. For example, the present technology described herein improves multi-window scenarios, particularly on small screen devices where screen space is further limited. The present technology makes it easier for users to work across different windows and applications and improve the ease of composing each window.

AUTOMATION OF PERMISSION CONTROLS FOR GROUP MESSAGES (17829309)

Main Inventor

Amer Aref HASSAN

Brief explanation

- The patent application describes a system that allows users with accessibility needs to control group messages.

- Users with accessibility issues can indicate their needs through a permissions system. - The system can grant these users the right to prevent others from sending messages in a thread. - This allows the user to give a presentation without interruptions from others. - Once the user is done with their presentation, the system unlocks the thread for others to send messages. - This system enables users with special needs to participate as meeting presenters.

Abstract

A system provides permission controls for group messages. A system can support user accessibility by the use of a permissions that indicates that a user has accessibility needs with respect to a voice input. When a user is known to have accessibility issue with providing a voice input, a system data structure, such as a Teams directory, can indicate when specific users have special needs. The system can grant them with rights to prevent others from providing messages to a message thread. This allows that person to become a presenter of a meeting while using a message thread to give their presentation without interruption from others. The system can unlock the thread and allow others to provide messages when the user is done with their presentation. By controlling a message thread in this manner, a system can allow users having special needs to participate as a meeting presenter.

MEETING ACCESSIBILITY STAGING SYSTEM (18168988)

Main Inventor

Toby Jonathan FITCH

Brief explanation

- This patent application describes an accessibility manager that allows users to have a persistent floating secondary stage during video conferencing meetings.

- The primary stage of the video conferencing meeting includes a roster of attendees and an area for displaying shared content. - Users can create customizable settings that will be applied to every meeting, generating a personalized secondary stage. - The secondary stage is an overlay that remains visible on the user interface even if the primary stage is minimized, allowing users to multitask during the meeting. - The secondary stage displays video feeds of selected meeting attendees, such as interpreters. - When an interpreter speaks on behalf of the user, the user receives the active speaker attribution. - The configurable settings give users control over various aspects of the secondary stage, including video feed quality, sizing, aspect ratio, display location, captioning, role designation, and active speaker designation.

Abstract

Examples provide an accessibility manager enabling a persistent floating secondary stage for presentation of user-configurable content during a video conferencing meeting. A primary stage is provided during each video conferencing meeting. The primary stage includes a roster of meeting attendees and an area for displaying shared content. The user creates configurable settings which are used at every meeting to generate a customized secondary stage. The secondary stage is an overlay which persists on the user interface even if the primary stage is minimized as the user multi-tasks during the meeting. The secondary stage displays video feed for one or more selected meeting attendees, such as an interpreter. When an interpreter speaks on behalf of the user, the user receives the active speaker attribution. The configurable settings permit the user to control the secondary stage video feed quality, sizing, aspect ratio, display location, captioning, role designation and active speaker designation.

AUDIO COMMUNICATION DEVICE WITH NOVEL VISUAL INDICATIONS AND ADJUSTABLE MUTING (17752478)

Main Inventor

David Justin RAPPAPORT

Brief explanation

The patent application describes an audio communication device with unique visual indicators and adjustable muting capabilities.

• The audio communication device has a processor and memory that stores instructions for performing various operations.
• One operation is generating a first visual indicator that represents the audio of one or more users. This indicator reflects the quality of the audio.
• The device also receives user input and can mute the microphone region based on this input.
• When the microphone region is muted, a second visual indicator is generated, replacing part of the first indicator. This second indicator represents the muted region.
• The purpose of these visual indicators is to provide users with a clear understanding of the audio status and quality during communication.

Abstract

Aspects of the present disclosure relate to an audio communication device with novel visual indications and adjustable muting. In examples, an audio communication device is provided. The audio communication device includes at least one processor, and memory storing instructions that, when executed by the at least one processor, cause the audio communication device to perform a set of operations. The set of operations include generating a first visual indicator. The first visual indicator corresponds to audio of one or more users. The set of operations further include receiving a user-input, muting a microphone region of the audio communication device, based on the user-input, and generating a second visual indicator. The second visual indicator replaces at least a portion of the first visual indicator. The second visual indicator corresponds to the muted region. The first visual indicator is indicative of a quality of the audio.

CODE GENERATION TOOL FOR CLOUD-NATIVE HIGH-PERFORMANCE COMPUTING (18333517)

Main Inventor

Philipp Andre WITTE

Brief explanation

The patent application describes methods and systems for translating a software expression from a user application programming interface (API) call to an API call of a software development kit (SDK) in a cloud-native high-performance computing environment.

• The innovation involves receiving a tagged expression indicating the need for translation from a user API call to an SDK API call.
• An abstract syntax tree associated with the software expression is processed, where symbols are replaced with variables and a return statement is replaced with a serialization instruction to write the result to local storage.
• The processed abstract syntax tree is serialized and provided, along with resource files, to the cloud-native high-performance computing environment for execution.

Abstract

Methods, storage media, and systems for translating a software expression from a user application programming interface (API) call to an API call of a software development kit (SDK) are disclosed. Some examples may include: receiving a tagged expression indicating that a translation of the software expression from a user API call to an API call of an SDK is to be performed, the SDK being associated with a cloud-native high-performance computing environment, processing an abstract syntax tree associated with the software expression, the processing including replacing symbols in the abstract syntax tree with respective variables, replacing a return statement in the abstract syntax tree with a serialization instruction to write a result to local storage, and serializing the processed abstract syntax tree and providing the serialized abstract syntax tree and one or more resource files to the cloud-native high-performance computing environment for execution.

SOFTWARE DEVELOPMENT IMPROVEMENT STAGE OPTIMIZATION (17825257)

Main Inventor

German David OBANDO CHACON

Brief explanation

The patent application describes a system that automatically detects stages in software development where code improvements can be made. 

• The system uses computational events from development tools like testing tools, debuggers, and performance profilers to identify these improvement stages.
• Artificial intelligence-driven program analysis tools are then used to suggest code improvement options.
• These options can include edits to the source code, changes in configuration, or improvements in test coverage.
• The system presents these analysis results and improvement options to developers through a user interface.
• This helps developers prioritize program performance, accuracy, security, and programming style over code creation and integration.
• By optimizing the code improvement stage, the system improves the quality of programs under development and during quality reviews.

Abstract

Some embodiments automatically detect a software development code improvement stage. Improvement stage detection may be based on computational events involving a development tool, such as a testing tool, a debugger, or a performance profiler. Program analysis tools driven by artificial intelligence functionality may then be automatically invoked to provide code improvement options, which may be presented to a developer in a tool user interface. Options may include source code edits, configuration changes, or test coverage changes, for example. Analysis results and corresponding code improvement options are thus presented when the developer is prioritizing program performance, program behavior accuracy, program security, or programming style, as opposed to prioritizing code creation or code integration. Programs under development, as well as quality reviews of such programs, may accordingly be optimized by performing performance and security analysis, testing, and coding style analysis during the code improvement stage.

IMPLEMENTING CHANGES MADE TO SOURCE CODE OF RELOADABLE TYPES AT RUNTIME (18232679)

Main Inventor

Tomas MATOUSEK

Brief explanation

This patent application describes a system and method for implementing changes to source code of a program while it is running. Here are the key points:

• The system allows for changes to be made to the source code of a program while it is running in a runtime environment.
• The computing device executing the program detects these changes in real-time.
• The system determines if the changes were made to a specific type in the source code that is identified as reloadable.
• If the changes were made to the reloadable type, the system creates a new version of that type.
• The system then applies the changes to the source code at runtime using the new version of the type.
• This allows for dynamic updates to the program without the need to stop and restart it.
• The system enables developers to make changes and test them immediately without interrupting the program's execution.
• This technology can be useful for debugging, testing, and implementing new features in software applications.

Abstract

Systems and methods for implementing changes made to source code of a program at runtime are provided. In particular, a computing device may execute the source code in a runtime environment and detect changes made to the source code at runtime in the runtime environment. In response to detecting the changes, the computing device may determine if the changes were made to a type in the source code identified as reloadable. In response to determining that the changes were made to the type in the source code identified as reloadable, the computing device may create a new version of the type and perform implementation of the changes to the source code at runtime using the new version of the type.

SOFTWARE PRODUCT UPGRADE WITH TRANSPARENT DATA MIGRATION (17825328)

Main Inventor

Steven J. BALL

Brief explanation

- The patent application discusses devices, systems, and methods for transparency and control in a user data migration process.

- The method involves displaying a user interface (UI) on a display device, which includes information about replacing a legacy application with an upgraded application. - The UI allows the user to select which data from the legacy application should be transferred to the upgraded application. - The user provides input indicating the portion of data they want to be ported over to the upgraded application. - Only the data indicated by the user is then transferred from the legacy application to the upgraded application.

Abstract

Generally discussed herein are devices, systems, and methods for transparency and control in a user data migration process. A method can include displaying, by a display device, a user interface (UI) including a first display region including text indicating that a legacy application is being replaced by an upgraded application and that a user can select what data from the legacy application is ported over to the upgraded application, receiving, by the UI and from the user, data indicating what portion of data from the legacy application is to be ported over to the upgraded application, and porting over only the portion of the data from the legacy application indicated by the user.

RENDERING GRAPHICAL ELEMENTS ON AN INTERFACE (17829151)

Main Inventor

Iris Mano OLIVER

Brief explanation

The patent application describes a method for rendering graphic elements on a user interface.

• The user interface initially includes content presented on different layers.
• When a user inputs a command, the user interface enters an edit view.
• In the edit view, a menu with selectable graphic elements is presented.
• The user can select a graphic element from the menu.
• After making changes, the user can exit the edit view and see an updated version of the original view.
• The updated view includes the original content and the selected graphic element presented on a specific layer.

Abstract

Graphic elements may be rendered on an interface. An original view of a user interface is presented on at least one display. The user interface initially includes content presented on one or more of a first layer, a second layer, and a third layer. In response to receiving a first input, the user interface in presented in an edit view that includes presenting a menu that includes a plurality of selectable graphic elements. A second input is received that selects a graphic element of the plurality of selectable graphic elements, and third input is received to exit the edit view and present an updated version of the original view. The updated view includes the content presented on the one or more of the first layer, the second layer, and the third layer and the selected graphic element presented on the second layer.

MANAGING UPDATES ON VIRTUAL MACHINE SYSTEMS (17752782)

Main Inventor

Govind RAMASWAMY

Brief explanation

The present disclosure is about a system that determines the best way to update virtual machines in a cloud computing system, even when the virtual machines are not currently in use.

• The system intelligently manages updates of virtual machines in an offline manner.
• It prevents updates from interfering with the deallocation of virtual machines.
• The system uses operating system disk image snapshots to ensure that updates do not degrade the performance of virtual machines.
• In case of an update failure, the system restores virtual machines to their previous state without data loss.

Abstract

The present disclosure relates to systems, methods, and computer-readable media for determining optimal index configurations for intelligently managing updates of virtual machines in an offline manner in a cloud computing system. For instance, a virtual machine (VM) update system can efficiently determine when to apply updates to virtual machines in an intelligent manner that prevents the updates from interfering with the deallocation of virtual machines. In addition, the VM update system can utilize the operating system (OS) disk image snapshots to automatically provide safeguards and ensure that updates do not degrade the performance of the virtual machines, or in the case of an update failure, that the virtual machines are restored to their previous state without the data loss.

ENFORCE CHANGES IN SESSION BEHAVIOR BASED ON UPDATED MACHINE LEARNING MODEL WITH DETECTED RISK BEHAVIOR DURING SESSION (18231631)

Main Inventor

Alexander ESIBOV

Brief explanation

- This patent application describes systems and methods for managing access to computer resources.

- The focus is on evaluating and re-evaluating dynamic conditions and changes associated with user sessions. - The systems and methods automatically determine if additional authentication credentials are needed for a user already authorized to access resources. - This determination is triggered by events like the identification of a new or changed condition in the user session.

Abstract

Systems and methods are provided for managing dynamic controls over access to computer resources and, even more particularly, for evaluating and re-evaluating dynamic conditions and changes associated with user sessions. The systems and methods are configured to automatically make a determination as to whether new or additional authentication credentials are required for a user that is already authorized for accessing resources in a user session, in response to triggering events such as the identification of a new or changed condition associated with the user session.

POLICY-BASED DEPLOYMENT WITH SCOPING AND VALIDATION (17828721)

Main Inventor

Nidhi VERMA

Brief explanation

The patent application describes a system and method for creating and deploying jobs in a cloud-based service.

• The system receives a job definition that includes attributes of a job to be deployed in the cloud-based service.
• The job definition is processed to check if it complies with predefined rules for job creation in the cloud-based service.
• Based on the compliance determination, the job may be validated or not validated in the cloud-based service.
• For validated jobs, deployment policies are determined based on the job definition.

Abstract

Systems and methods for creating and deploying jobs in a cloud-based service include receiving a job definition defining job attributes pertaining to a job to be deployed in a cloud-based service. The job definition is processed to determine whether the job definition complies with predefined rules for job creation in the cloud-based service. Based on the determination of whether the job definition complies with the predefined rules for job creation in the cloud-based server, the job may be validated or not validated in the cloud-based service. Deployment policies are determined for validated jobs based on the job definition for the validated job.

PACKET PROCESSING COMPUTATIONS UTILIZING A PRE-ALLOCATED MEMORY FUNCTION (17752790)

Main Inventor

Janardhana Reddy NAREDULA

Brief explanation

- The patent application is about a new memory allocation function library called PmemMalloc.

- PmemMalloc library allocates pre-allocated, partitioned, and fixed shared memory blocks. - It overcomes problems with persistence and enumeration that existing malloc libraries have. - PmemMalloc enables parallel computation across multiple CPU cores/threads and equal distribution of computation among threads. - It prioritizes servicing and provides major constructs like persistence, enumeration, and debuggability. - PmemMalloc migrates computations from application-based packet processing to memory block-based deferred enumeration. - This improves both packet processing and efficient use of CPU cores on a computing device.

Abstract

The present disclosure relates to systems, methods, and computer-readable media for utilizing a new memory allocation function library called PmemMalloc. For example, the PmemMalloc library allocates pre-allocated, partitioned, and fixed shared memory blocks. In addition, by utilizing the PmemMalloc library, the memory allocation system described herein overcomes problems with persistence and enumeration that encumber existing malloc libraries. Indeed, the PmemMalloc library enables the memory allocation system to perform servicing computation in parallel across multiple CPU cores/threads, distribute computation equally among threads, prioritize servicing, among other improvements. Notably, the PmemMalloc library provides major constructs (e.g., persistence, enumeration, and debuggability) not available existing malloc libraries. Additionally, as detailed in this disclosure, the PmemMalloc library migrates various computations out of application-based packet processing to memory block-based deferred enumeration, which improves both packet processing and efficient use of CPU cores on a computing device.

Progress Monitoring Service (17873093)

Main Inventor

Max DYMOND

Brief explanation

The abstract describes a progress monitoring service that tracks the progress of a task.

• The service receives a request for a task identifier from a process manager.
• It returns an identifier to the process manager.
• The service then receives progress data about the task from a system carrying out the task.
• It updates a web page with the progress data.
• The web page is made available to the end user of the process manager.

Abstract

A progress monitoring service for monitoring progress of a task. The method comprises receiving, from a process manager managing the task, a request for a task identifier. The progress monitoring service returns an identifier to the process manager. The progress monitoring service receives, from a system used to carry out at least part of the task, the identifier and progress data about progress of the task. The progress monitoring service updates a web page with the progress data and makes the web page available to an end user of the process manager.

SELECTIVE EXECUTION OF WORKLOADS USING HARDWARE ACCELERATORS (18324646)

Main Inventor

John Allen TARDIF

Brief explanation

The patent application describes systems and methods for selectively executing workloads using hardware accelerators.

• The method involves a client application submitting a command to a hardware accelerator for workload execution.
• The command includes an indication of the performance expectation from the hardware accelerator.
• The workload can be executed either by a compute core accessible to the client application or by the hardware accelerator.
• If the hardware accelerator is unable to meet the performance expectation and sends a retry response, the client application executes the workload using the compute core.
• The hardware accelerator is configured to provide the retry response directly to the client application.

Abstract

Systems and methods for selective execution of workloads using hardware accelerators are described. A method includes a client application submitting a command for execution of a workload directly to a hardware accelerator, where the command includes an indication of a performance expectation from the hardware accelerator, and where the workload can be executed either by a compute core accessible to the client application or by the hardware accelerator. The method further includes upon receiving a retry response from the hardware accelerator, the client application executing the workload using the compute core accessible to the client application, where the hardware accelerator is configured to provide the retry response directly to the client application after determining that the hardware accelerator is unable to meet the performance expectation.

TRACKING OF CONTINUOUS DATA PROCESSING WORKLOADS (17824217)

Main Inventor

Scott Michael BRAGG

Brief explanation

The patent application describes a method for tracking the completion of a stream of continuous data processing commands or workloads.

• The method involves receiving a stream of signals that contains multiple commands to be executed.
• The received stream is divided into time periods called timeslices, each containing a set of commands.
• The commands are then categorized into pages, and each page is assigned a unique identifier.
• The pages, along with their unique identifiers, are sent to a command executing agent.
• When the agent indicates that a page is completed, each command within that page is marked as completed.

Abstract

A stream of continuous data processing commands or workloads may be tracked for completeness. A stream of signal is received that includes a plurality of commands to be executed. At least one timeslice is generated in the received stream which corresponds to a period of time and includes the plurality of commands received in the period of time. The plurality of commands are categorized into at least one page and a unique identifier is assigned to the at least one page. The at least one page, including the unique identifier, is transmitted to a command executing agent and in response to receiving an indication that the at least one page is completed, each of the plurality of commands included in the at least one page is marked as completed.

TECHNIQUES FOR DEPLOYING WORKLOADS IN A CLOUD-COMPUTING ENVIRONMENT (17826915)

Main Inventor

Sanjeev MEHROTRA

Brief explanation

The patent application describes a method for providing a standby workload to replace an active workload. 

• The method involves initializing a container for the standby workload, which includes an entry point that points to a binary to be executed by the container.
• The entry point of the container is modified to execute a script that monitors a communication channel for an instruction for executing the standby workload.
• The standby workload is instructed to execute either the same binary or a different binary to replace the active workload.

Abstract

Described are examples for providing a standby workload to replace an active workload, including initializing a container for the standby workload that includes an entry point that points to a binary to be executed by the container, modifying the entry point of the container to execute a script that monitors a communication channel for an instruction for executing the standby workload, and instructing the standby workload to execute at least one of the binary or a different binary to replace the active workload.

UPDATING A STATE OF A CLIENT DEVICE USING A LIMITED EVENT SIZE PROTOCOL (17825373)

Main Inventor

Roy BELIO

Brief explanation

- This patent application describes techniques for updating the state of a client device using a limited event size protocol.

- The initial state of the client device is stored, which includes records identifying binaries associated with the device at a specific time. - Multiple events are received from the client device, each event containing a subset of records identifying binaries associated with the device at a different time. - The first event is parsed to identify a subset of records included in it. - The updated state of the client device is generated by replacing a portion of the initial records with the subset of records from the first event.

• Techniques for updating client device state using a limited event size protocol
• Initial state of the client device is stored, defined by records identifying binaries at a specific time
• Multiple events are received from the client device, each containing a subset of records identifying binaries at different times
• First event is parsed to identify a subset of records included in it
• Updated state of the client device is generated by replacing a portion of the initial records with the subset of records from the first event.

Abstract

Techniques are described herein that are capable of updating a state of a client device using a limited event size protocol. An initial state of the client device is stored. The initial state is defined by first records that identify first respective binaries associated with the client device at a first time. A first event of multiple events, which are configured in accordance with the limited event size protocol, is received from the client device. Each event includes a respective subset of second records, which identify respective second binaries associated with the client device at a second time. The first event is parsed to identify a first subset of the second records that is included in the first event. An updated state of the client device is generated by replacing a first portion of the first records with the first subset of the second records.

NETWORK API CREDENTIALS WITHIN A TRANSLATION SESSION (17824842)

Main Inventor

Landon COX

Brief explanation

The system described in this patent application is a network API gateway that assigns credentials to a call made to an operator network. This call is initiated by an application based on a request it receives. The credentials are used by an operator API to authenticate the call.

• The network API gateway creates and uses a connectivity representation to assign credentials to the call.
• The credentials are generated by the application making the request and are passed to the network API gateway during a translation session.
• The translation session is a specific time interval, such as five minutes.
• By passing the credentials during the translation session, the application no longer needs to manage credentials for each individual request.
• This simplifies the developer's task of managing credentials for each request made by the application.

Abstract

The system disclosed herein is composed of a network API gateway that is configured to assign credentials to a call to an operator network. The call is initiated based on a request received from an application. The credentials are used by an operator API to authenticate the call. The network API gateway creates and uses a connectivity representation as a basis for assigning the credentials to the call. The credentials are generated by the application making the request and the credentials are passed to the network API gateway as part of a translation session (e.g., five minute time interval) during which the network API gateway translates requests for the application. Consequently, each request sent by the application to the network API gateway during the translation session no longer needs its own credentials, and thus, the developer is released from the requirement of managing credentials for each request.

MULTI-FACTOR CLOUD SERVICE STORAGE DEVICE ERROR PREDICTION (18225053)

Main Inventor

Yong Xu

Brief explanation

- The patent application describes systems and techniques for predicting errors in multi-factor cloud service storage devices.

- The method involves obtaining a set of storage device metrics and a set of computing system metrics. - A feature set is generated using these metrics, and it is validated by evaluating a validation training dataset. - Based on the validation, a modified feature set is created, and a storage device failure model is developed using this modified feature set. - The method also involves determining a storage device rating range by minimizing the cost of misclassification of a storage device. - Finally, a set of storage devices with a high probability of failure is identified and labeled.

Abstract

Systems and techniques for multi-factor cloud service storage device error prediction are described herein. A set of storage device metrics and a set of computing system metrics may be obtained. A feature set may be generated using the set of storage device metrics and the set of computing system metrics. Members of the feature set may be validated by evaluating a validation training dataset using the members of the feature set. A modified feature set may be created based on the validation. A storage device failure model may be created using the modified feature set. A storage device rating range may be determined by minimizing a cost of misclassification of a storage device. A set of storage devices to be labeled may be identified as having a high probability of failure.

SELECTIVE DATABASE MIGRATION (17826619)

Main Inventor

Kevin WONUS

Brief explanation

The abstract describes a method for selectively migrating a database by creating a snapshot of a subset of a source database and distributing it to multiple computing devices.

• The method involves establishing a creation specification for the snapshot of the source database.
• One or more computing devices receive instructions to create the snapshot based on the creation specification.
• The devices retrieve records from the source database according to the creation specification.
• The retrieved records are broadcasted to one or more creation listeners.
• Each listener serializes the broadcasted records into the snapshot, following the creation specification.
• The snapshot consists of fragments and parts of the source database.

Abstract

Selective migration of a database in which one or more computing devices establish a creation specification for a snapshot of a subset of a source database of a source database management system (DBMS). The device(s) receive instruction to create the snapshot in accordance with the creation specification. The device(s) retrieve, in response to receiving the instruction to create, record(s) from the source database in accordance with the creation specification. The device communicates, via broadcast, the retrieved records to one or more creation listeners; and serializes, by each listener and in accordance with the creation specification, the broadcast records into the snapshot comprising the fragments and the parts.

Systems and Methods for Disaster Recovery for Edge Devices (17807153)

Main Inventor

Prem Mukesh PAREKH

Brief explanation

- The present disclosure describes improved systems and methods for disaster recovery for edge devices.

- One example implementation involves receiving the current device configuration for a first device, which includes the device state and workload configuration of the first device. - A bootstrapping package is generated based on the current device configuration for the first device. - The bootstrapping package is created by segmenting the device state and workload configuration into a namespace. - The bootstrapping package is then provided to a second device. - The bootstrapping package is designed to be automatically installed on the second device. - The innovation aims to enhance disaster recovery processes for edge devices by efficiently transferring device configurations and automating the installation of these configurations on backup devices.

Abstract

Examples of the present disclosure describe improved systems and methods for disaster recovery for edge devices. In one example implementation, a current device configuration for a first device is received. The current device configuration comprises a device state and a workload configuration of the first device. A bootstrapping package for the first device is generated based on the current device configuration for the first device. Generating the bootstrapping package comprises segmenting the device state and the workload configuration into a namespace. The bootstrapping package is provided to a second device. The bootstrapping package is configured to be automatically installed on the second device.

REAL-TIME REPORT GENERATION (17826970)

Main Inventor

Syam B. PINNAKA

Brief explanation

- This patent application describes methods, systems, and computer programs for generating real-time reports.

- The method starts by generating a baseline report based on data collected by a collector computing device for events of a specific type during a certain period. - The method then receives a request from a user to present an updated report with real-time information, including events of the same type during and after the specified period. - The method accesses configuration data that determines which event types are enabled for real-time reporting for the user. - If the updated report is available in real-time, the method sends a request to the relevant device(s) to provide any unreported events. - The method receives new events of the specified type and generates the updated report by combining data from the baseline report and the newly received events. - Finally, the method causes the presentation of the updated report on a user interface.

Abstract

Methods, systems, and computer programs provide real-time report generation. A baseline report is generated based on data, collected by a collector computing device, for events of a first event type for a period. The method receives a request from a user to present an updated report with real-time information that comprises events of the first event type during and after the period. The method further includes accessing configuration data that identifies which event types are enabled for real-time reporting for the user. When the updated report is available in real-time for the user, an event-update request is sent to the at least one device for unreported events. The new events of the first event type are received, and the updated report is generated by aggregating data from the baseline report and the received new events. Further, the method includes causing presentation of the updated report on a user interface.

TESTING USING LABELLED RECORDED ALERTS (17824714)

Main Inventor

Ron Moshe MARCIANO

Brief explanation

The patent application describes a computer-based method for testing software using recorded alerts.

• The recorded alerts contain information about previous events that caused the software to fail, along with a label indicating if the alert was accurate.
• The method automatically applies the testing inputs from the recorded alerts to the software being tested.
• The software is then checked for any faults that may arise as a result of applying the testing inputs.
• This eliminates the need for testers to manually come up with testing inputs, as they are obtained from the recorded alerts.

Abstract

Computer-implemented testing of subject software using labelled recorded alerts. Each of the labelled recorded alerts specifies one or more testing inputs representing one or more events that previously led to prior software when the alert occurred, and a label indicating whether the alert was a true positive. For each labelled recorded alerts, testing of the subject software is automatically performed by 1) reading the one or more testing inputs of the associated labelled recorded alert, 2) applying the read one or more testing inputs to the subject software, and 3) determining whether a fault arises as a result of the application of the read one or more conditions to the subject software. Thus, a tester did not themselves need to come up with testing inputs to apply. Instead, such testing inputs were automatically obtained from labelled data of prior recorded alerts.

TESTING OF A RESOURCE MANAGER OF AN APPLICATION MANAGEMENT SYSTEM (18366200)

Main Inventor

Justin G. MOELLER

Brief explanation

The patent application describes testing methods and systems for a resource manager in an application management system.

• Load orchestrator obtains an artificial metric based on a utilization model.
• The artificial metric is transmitted to applications in a computing node cluster.
• Applications transmit the artificial metric to the resource manager.
• The resource manager generates control output for managing applications based on the artificial metric.
• The utilization model includes executable code for generating artificial metric values.
• The model may be received through an API call.
• The load orchestrator can be instantiated in an orchestration framework or in each node of the cluster.

Abstract

Testing methods and systems are provided for testing a resource manager of an application management system. The testing systems include a load orchestrator configured to obtain an artificial metric that is determined based on a utilization model (e.g., CPU usage, memory allocation, or disk usage, number of webserver sessions). The load orchestrator transmits the artificial metric to applications in a cluster of computing nodes. The applications transmit the artificial metric to the resource manager. In response, the resource manager generates control output for managing applications in the cluster based on the artificial metric (e.g., scaling, load balancing, application placement, failover of applications, or defragmenting data). The utilization model may include executable code for generating artificial metric values. The model may be received as a result of an API call. The load orchestrator may be instantiated in an orchestration framework or in each node of the cluster.

SYSTEM AND METHOD FOR INCREMENTAL ENCRYPTION (17804083)

Main Inventor

Yevgeny YANKILEVICH

Brief explanation

The patent application describes a computing system that uses AES-XTS encryption to encrypt data in two separate sessions.

• The first part of a data stream is encrypted using a tweak key, a data key, and an initial tweak value in the first encryption session.
• The encrypted first part is then stored.
• After the first encryption session ends, a second encryption session begins to encrypt the second part of the data stream.
• The encrypted second part is stored in an encrypted data store.
• The second part is encrypted using a modified tweak value, which is calculated based on the initial tweak value, the tweak key, and the block index of the last cipher block of the first part of the data stream.

Abstract

A computing system uses AES-XTS encryption to encrypt data of a first part of first data stream using a tweak key, a data key, an initial tweak value, in a first encryption session, store the encrypted first part, then encrypts a second part of the first data stream in a second encryption session commenced after the termination of the first encryption session; and store the encrypted second part in the encrypted data store. The second part of the first data stream is encrypted using a modified tweak value computed based on the initial tweak value, the tweak key, and a block index of a last cipher block of the first part of the first data stream.

DETECTING AND MITIGATING MEMORY ATTACKS (17828903)

Main Inventor

Ishwar AGARWAL

Brief explanation

The present disclosure is about systems and methods implemented on a memory controller to detect and mitigate memory attacks, specifically row hammer attacks.

• Memory controller tracks activations of row addresses in a memory hardware (e.g., DRAM device).
• It determines if the pattern of activations indicates a row hammer attack.
• This is done by using a counting mode for corresponding memory sub-banks.
• If a likely row hammer attack is detected, the memory controller activates a sampling mode for a specific sub-bank.
• The sampling mode helps identify which row addresses need to be refreshed on the memory hardware.
• These implementations provide a low computational cost alternative to heavy-handed detection mechanisms.
• The alternative does not require significant computing resources to accurately detect and mitigate row hammer attacks.

Abstract

The present disclosure relates to systems and methods implemented on a memory controller for detecting and mitigating memory attacks (e.g., row hammer attacks). For example, a memory controller may track activations of row addresses within a memory hardware (e.g., a DRAM device) and determine whether a pattern of activations is indicative of a row hammer attack. This is determined using a counting mode for corresponding memory sub-banks. Where a likely row hammer attack is detected, the memory controller may activate a sampling mode (rather than the counting mode) for a particular sub-bank to identify which of the row addresses should be refreshed on the memory hardware. The implementations described herein provide a low computational cost alternative to heavy-handed detection mechanisms that require access to significant computing resources to accurately detect and mitigate row hammer attacks.

Maintaining Stale Files to Minimize Computing Costs (17804609)

Main Inventor

Brian D. Jones

Brief explanation

- The present disclosure describes systems and methods for minimizing computing costs by maintaining stale files.

- The system determines if a hydrated file is eligible to remain temporarily stale. - If eligible, the system causes the hydrated file to remain stale until a content refresh is pending. - While the file is stale, a set of rules is evaluated to determine if the file should be refreshed. - If the rules determine that the file should be refreshed, it is refreshed.

Abstract

Examples of the present disclosure describe systems and methods for maintaining stale files to minimize computing costs. In examples, a determination is made regarding whether a hydrated file is eligible to remain temporarily stale. If the hydrated file is determined to be eligible to remain temporarily stale, the hydrated file is caused to remain stale at a time when a content refresh for the hydrated file is pending. While the hydrated file remains stale, a set of rules for determining whether the hydrated file should be refreshed is evaluated. If, based on the set of rules, it is determined that the hydrated file should be refreshed, the hydrated file is refreshed.

OPTIMIZATIONS FOR DATA DEDUPLICATION OPERATIONS (17829012)

Main Inventor

Rajsekhar DAS

Brief explanation

The patent application describes techniques for efficient data deduplication operations using stability tags.

• Stability tags are introduced to enable efficient data deduplication.
• A stability tag is set for a block of data before analysis by the deduplication process.
• The block of data is considered to be in a known state while the stability tag is set.
• An identifier is generated based on the content of the block of data.
• Later, if a second block of data is found with a matching identifier, it is a potential candidate for deduplication.
• The deduplication process checks the stability tags of both blocks of data.
• If the stability tags are still set, indicating no modification to the blocks of data, one of them can be scheduled for deduplication.

Abstract

The techniques disclosed herein enable systems to efficiently perform data deduplication operations through the introduction of stability tags. To achieve this, a stability tag for an associated block of data is set prior to analysis by a data deduplication process. While the stability tag is set, the block of data is understood by the system to be in a known state. An identifier is then generated based on the content within the block of data. At a later time, the deduplication process detects a second block of data that results in a matching identifier, indicating a potential candidate for deduplication. In response, the deduplication process returns to the stability tag of the first block of data and the second block of data. If the stability tags are still set, indicating no modification to the blocks of data, one of the blocks of data is eligible to be scheduled for deduplication.

GRADIENT FLOWS IN DATASET SPACE (18204568)

Main Inventor

David ALVAREZ-MELIS

Brief explanation

- The patent application discusses devices, systems, and methods for machine learning (ML) using datasets.

- The method involves receiving a request to operate on a first dataset that contains pairs of features and labels. - Multiple datasets are available, and the method identifies a second dataset that also contains pairs of features and labels. - The method then determines the distance between the pairs of features and labels in the first and second datasets. - Based on this determined distance, the method flows the first dataset using a dataset objective to generate an optimized dataset. - The objective is to optimize the dataset by considering the distance between the feature and label pairs in the first and second datasets.

Abstract

Generally discussed herein are devices, systems, and methods for machine learning (ML) by flowing a dataset towards a target dataset. A method can include receiving a request to operate on a first dataset including first feature, label pairs, identifying a second dataset from multiple datasets, the second dataset including second feature, label pairs, determining a distance between the first feature, label and the second feature, label pairs, and flowing the first dataset using a dataset objective that operates based on the determined distance to generate an optimized dataset.

SCALABLE INDEX TUNING WITH INDEX FILTERING AND INDEX COST MODELS (17897930)

Main Inventor

Tarique Ashraf SIDDIQUI

Brief explanation

The patent application describes a method for training an index filter in an index tuning system. This system aims to improve the performance of databases by optimizing the use of indexes.

• The method involves receiving different workloads and databases, each containing various tables and queries.
• Labeled training data is generated by making optimizer calls to a query optimizer using query and index configuration pairs from the databases and workloads.
• An index filter model is trained to identify signals in the labeled training data that indicate potential performance improvements when using specific index configurations for queries.
• The index filter model is also trained to learn rules for identifying spurious indexes, which are indexes that do not provide any performance benefits.
• The trained index filter model is stored in memory for use in the index tuning system.

Abstract

A method of training an index filter for an index tuning system includes receiving a plurality of different workloads and a plurality of different databases, each database including different tables and each workload including a plurality of queries; generating labeled training by making optimizer calls to a query optimizer using query and index configuration pairs from the plurality of databases and the plurality of workloads; training an index filter model to identify signals in the labeled training data, the signals being indicative of a potential performance improvement associated with using an index configuration for a given query; training the index filter model to learn rules over the signals for identifying spurious indexes; and storing the index filter model in a memory.

DISTRIBUTED DATA QUERY UNDER DATA FLOW LIMITATIONS (17828879)

Main Inventor

Anders Tungeland GJERDRUM

Brief explanation

The patent application describes example solutions for performing distributed data queries on a connected data set that is distributed across multiple regions under data flow limitations.

• The solutions are applicable to property graphs or relational databases that are spread across different geographic regions.
• In cases where a data entity in one region is subject to a data flow limitation, the actual data entity is stored in the first region, while the second region only stores a reference to it.
• The query is executed in the first region, but a partial representation of the query's state is injected into the query for execution in the second region.
• The query in the second region locates the reference to the data entity and returns the state of the query back to the first region.
• The query results from all the regions are then combined to produce a final result.
• The patent application also addresses scenarios where references are not permitted due to prohibitive limitations.

Abstract

Example solutions are disclosed for performing a distributed data query for a connected data set, such as a property graph or a relational database, distributed across a plurality of regions (e.g., different geographic regions) under data flow limitations. For a restrictive limitation, a first region stores a data entity that is subject to a data flow limitation, and a second region stores only a reference to the data entity (e.g., a pseudonymous reference). The query is executed in the first region, and at least a partial representation of the state is injected into the query for execution in the second region. The query locates the reference to the data entity in the second region, and the state of the query from the second region is returned. Query results from the plurality of regions are synthesized into a final result. Further solutions address prohibitive limitations when references are not permitted.

A LOOK AHEAD STRATEGY FOR TRIE-BASED BEAM SEARCH IN GENERATIVE RETRIEVAL (18031789)

Main Inventor

Jian JIAO

Brief explanation

- This patent application describes a system and method for generating a keyword sequence from an input query.

- The system uses a machine learning model that includes an encoder and a decoder. - The encoder takes the input query and encodes it into a source sequence representation. - The decoder then generates a keyword sentence based on the source sequence representation. - The decoder calculates a modified generation score for each prediction token, taking into account the prediction token generation score and a maximum generation score for a suffix of each prediction token. - The decoder selects the prediction token with the highest modified generation score and adds it to the previously decoded partial hypothesis. - This process continues until the desired keyword sequence is generated.

Abstract

Systems and methods are provided for generating a keyword sequence from an input query. A first text sequence corresponding to an input query may be received and encoded into a source sequence representation using an encoder of a machine learning model. A keyword sentence may then be generated from the source sequence representation using a decoder of the machine learning model. The decoder may generate a modified generation score for a plurality of prediction tokens, wherein the modified generation score is based on the respective prediction token generation score and a maximum generation score for a suffix of each prediction token. The decoder may then select the prediction token of the plurality of prediction tokens based on the modified generation score, and add the selected prediction token to the previously decoded partial hypothesis provided by the decoder.

System for Generation and Use of Pinned Searches (17828198)

Main Inventor

Kent Chunkin MAI

Brief explanation

The patent application describes a method for executing a search query on an electronic messaging data store and storing the search query as a pinned search.

• The method involves executing a search query for an electronic messaging data store based on entity type and directory scope.
• The results of the search query are presented on a computing device.
• The user is provided with an option to store the search query as a pinned search.
• If the user activates the option, a pinned search data structure is generated to identify the entity type and directory scope.
• Subsequently, a request to initiate a search of the electronic message data store is received.
• In response to the request, a search panel is presented that includes the pinned search data structure as an activatable search query.

Abstract

A method may include executing, on a processing unit, a received search query for an electronic messaging data store according to an entity type and a directory scope; in response to the executing: presenting, on a computing device, results of the search query from the electronic messaging data store; and presenting a user interface option configured to initiate storing the search query as a pinned search; receiving, by the processing unit, an indication that the user interface option was activated; based on receiving the indication, generating a pinned search data structure identifying the entity type and the directory scope; subsequent to the generating, receiving a request to initiate a search of the electronic message data store; and in response to receiving the request, presenting a search panel that identifies the pinned search data structure as an activatable search query.

AUTOMATIC CONTENT GENERATION (17836456)

Main Inventor

Weixin CAI

Brief explanation

The patent application describes a system and method for generating contextually relevant content in a user's writing style.

• The system receives logical inputs in bullet point format regarding a specific topic.
• A content generator uses machine learning models to generate draft content.
• The user's writing style is identified by applying the logical inputs to a machine learning model.
• The system determines the context and direction for the draft content using another machine learning model.
• Based on the logical inputs, identified writing style, context, and direction, at least one paragraph of draft content is generated in the user's writing style.
• The draft content follows an outline associated with the bullet point format and has the same context and direction as the logical inputs.
• The generated draft content is presented on a client device.

Abstract

Systems and methods are directed to generating content that is contextually relevant in a writing style of a user. In example embodiments, a plurality of logical inputs regarding a topic is received in bullet point format. A content generator generates draft content using machine learning (ML) models. The generating comprises identifying a writing style of the user by applying the plurality of logical inputs to a first ML model, determining a context and direction for the draft content using a second ML model, and based on the plurality of logical inputs, the identified writing style, and the context and direction, generating at least one paragraph of draft content in the writing style of the user that follows an outline associated with the bullet point format and comprises a same context and direction as the plurality of logical inputs. The draft content is then presented at a client device.

TECHNIQUES FOR ASSOCIATING DOMAIN-SPECIFIC TERMS FOR INFORMATION DISCOVERY (17826927)

Main Inventor

Laurent BOUÉ

Brief explanation

- The patent application describes a method for information discovery using domain-specific term matching.

- The method involves obtaining a set of search strings used for searching a specific domain during a search session. - The method identifies one of the search strings in the set as a successful search string hit, while the rest are considered search string misses. - The method then correlates the search string misses with additional search strings from other search sessions related to the same domain that have the same successful search string hit. - The purpose of this method is to improve information discovery by identifying relevant search terms and connecting them with other related search sessions.

Abstract

Described are examples for information discovery using domain-specific term matching, including obtaining, for a search session related to a domain, a set of search strings used for searching the domain for information discovery during the search session, identifying, for the search session, a string of the set of search strings as a search string hit and the remaining strings in the set of search strings as search string misses, and correlating, into a set of domain-specific search string misses, the remaining strings in the set of search strings with additional remaining search strings from one or more other search session related to the domain that have the same string identified as the search string hit.

CONTENT MODERATION SERVICE FOR SYSTEM GENERATED CONTENT (17825734)

Main Inventor

Bernhard Kohlmeier

Brief explanation

- The patent application describes a method carried out by a content moderation service.

- The method involves receiving system generated content from an application that has triggered a content moderation list. - The trigger can be a word, phrase, image, audio, or video that requires moderation action. - The content moderation service also receives context for the trigger, which includes other words, phrases, images, or media in proximity to the trigger. - The trigger and its context are evaluated together using a content moderation process to determine a risk assessment. - The risk assessment is then provided to the application, which can use it to determine the appropriate moderation action.

Abstract

A method carried out by a content moderation service can include receiving system generated content from an application identified as a result of detecting a trigger associated with a content moderation list in the system generated content, wherein the trigger associated with a content moderation list is a word, phrase, image, audio, or video indicated as requiring a moderation action; receiving context for the trigger, wherein the context for the trigger comprises other words or phrases or images or other media in proximity to the trigger; evaluating the trigger in combination with the context for the trigger according to a content moderation process to obtain a determination of a risk assessment; and providing the risk assessment to the application for determining the moderation action to the application.

WEB SITE PREVIEW GENERATION BASED ON WEB SITE TYPE (17752675)

Main Inventor

Joseph Michael GLOCKE

Brief explanation

The abstract describes a system that automatically generates a preview of a website based on its type. Here are the key points:

• The system receives a website identifier from a client computer.
• It uses the identifier to navigate to the specified website.
• The system accesses the type of the website from the website itself.
• Based on the type, the system selects a predetermined preview template.
• It populates the preview template with content from the website to generate the website preview.
• This ensures consistent previews across different websites of the same type.
• The owner of the website may have the option to override the generated preview with their own.

Abstract

The automated generation of a web site preview based on a type of the web site. In response to receiving the web site identifier from the client computing system, the service uses the web site identifier to navigate to the web site identified by the web site identifier. After navigating to that web site, the service accesses a type of the web site from the web site. The service selects a predetermined preview template at least in part based on the type of the web site, and populates at least some of the content from the web site to generate the web site preview. Because the web site preview is based on the type of web site, the user sees consistent previews across different web sites of the same type (though the owner might have the option to supersede with their own preview).

SYSTEMS AND METHODS FOR SPARSE MATRIX MULTIPLICATION (17657912)

Main Inventor

Venmugil ELANGO

Brief explanation

The patent application describes a method for multiplying sparse matrices efficiently.

• The method involves receiving a first block of elements and dividing it into smaller sub-blocks with a certain level of sparsity.
• A sparsity mask is applied to the first block to ensure that each sub-block has the same level of sparsity.
• A second block of elements is received and divided into sub-blocks with a different level of sparsity.
• A sparsity mask is applied to the second block to ensure that a certain percentage of sub-blocks have no elements and the remaining sub-blocks have all elements.
• Finally, the first and second blocks are multiplied together using matrix multiplication.

Abstract

A method for sparse matrix multiplication comprises receiving a first block having M elements in a first dimension, and parsing the first block of M elements into a first set of B sub-blocks including MB elements in the first dimension. A first sparsity mask having S % sparsity is applied to the first block of elements, such that each of the first set of B sub-blocks has S % sparsity. A second block is received having M elements in a second dimension, and is parsed into a second set of B sub-blocks that include MB elements in the second dimension. A second sparsity mask having S′% sparsity is applied to the second block of elements, such that S′% of the second set of B sub-blocks have 100% sparsity and (100−S′)% of the second set of B sub-blocks have 0% sparsity. The first and second blocks are then matrix multiplied.

UNSTRUCTURED TEXT CLASSIFICATION (18233657)

Main Inventor

Arunkumar GURURAJAN

Brief explanation

- The patent application describes a technology that can quickly and accurately identify malicious URLs.

- The technology is designed to be used as a real-time URL security analysis tool. - It can process a URL quickly and issue a warning if it identifies a malicious URL. - The technology achieves fast processing speed by using only the URL as input. - It achieves high accuracy by analyzing the unstructured text of the URL on both a character-by-character and word-by-word level. - The technology utilizes both character-level and word-level information from the incoming URL.

Abstract

The technology described herein identifies malicious URLs using a classifier that is both accurate and fast. Aspects of the technology are particularly well adapted for use as a real-time URL security analysis tool because the technology is able to quickly process a URL and produce a warning when a malicious URL is identified. The rapid processing speed of the technology described herein is produced, in part, by use of only a single input signal, which is the URL itself. The high accuracy produced by the technology described herein is achieved by analyzing the unstructured text on both a character-by-character level and a word-by-word level. The technology described herein uses both character-level and word-level information from the incoming URL.

SYSTEMS AND METHODS FOR FLUSH PLUS RELOAD CACHE SIDE-CHANNEL ATTACK MITIGATION (17838446)

Main Inventor

Ishwar AGARWAL

Brief explanation

- The patent application describes a method for mitigating a side-channel timing attack in a system with a processor and cache.

- The method involves receiving a first instruction that is designed to flush at least one cache line from the processor's cache. - Prior to executing the first instruction, the method automatically maps it to a second instruction that prevents the cache line from being flushed, even if the first instruction is received. - This technique helps protect against cache side-channel attacks by preventing the attacker from exploiting timing information obtained from cache flush operations. - The innovation aims to enhance the security of systems with processors and caches by reducing the vulnerability to side-channel attacks.

Abstract

Systems and methods related to flush plus reload cache side-channel attack mitigation are described. An example method for mitigating a side-channel timing attack in a system including a processor having at least one cache is described. The method includes receiving a first instruction, where the first instruction, when executed by the processor, is configured to flush at least one cache line from the at least one cache associated with the processor. The method further includes, prior to execution of the first instruction by the processor, automatically mapping the first instruction to a second instruction such that the at least one cache line is not flushed from the at least one cache even in response to receiving the first instruction.

WEB SITE PREVIEW BASED ON CLIENT PRESENTATION STATE (17752658)

Main Inventor

Joseph Michael GLOCKE

Brief explanation

- The patent application describes a method for generating a web site preview based on the client presentation state.

- When a request is received for a web site preview, the service determines the client presentation state of the client(s) that will render the preview. - The service selects a preview template based on the determined client presentation state. - The selected preview template is populated with content from the web site to generate preview data representing the web site. - The preview data is tailored to the presentation state of the client, providing a customized preview experience. - The innovation allows for the creation of web site previews that are optimized for different client presentation states.

Abstract

The generation of a web site preview based on client presentation state of the client that will render the web site preview. Upon a service receiving a request to provide preview data for a web site preview corresponding to a web site identifier, the service determines client presentation state of the client(s) that is or are to render a web site preview using preview data that is to be provided in response to the request. The service selects a preview template at least in part based on the determined client presentation state. The service also populates the selected preview template with content from the web site to thereby generate preview data representing a preview of the web site identified by the web site identifier. The preview data is thus tailored to the presentation state of the client.

WEB SITE PREVIEW GENERATION WITH ACTION CONTROL (17752665)

Main Inventor

Joseph Michael GLOCKE

Brief explanation

The abstract describes a system for automatically generating a preview of a website based on its identifier. The preview includes controls that allow users to connect to different endpoints.

• The system receives a website identifier from a client computer.
• It navigates to the website identified by the identifier.
• The system retrieves an action identifier and an associated endpoint identifier from the website.
• It generates preview data that represents a preview of the website.
• The system provides the preview data to the client, where it is rendered with controls that facilitate connection to the associated endpoint.

Abstract

The automated generation of a web site preview based on a web site identifier, where the web site preview has one or more controls that facilitate connection to one or more endpoints. In response to receiving the web site identifier from the client computing system, the service uses the web site identifier to navigate to the web site identified by the web site identifier. After navigating to that web site, the service accesses an action identifier and an associated endpoint identifier from the web site. The service then generates preview data representing a preview of the web site represented by the web site identifier. The service provides the preview data to the client, where the preview with the control is rendered, so as to facilitate connection with the associated endpoint of the control.

Complementary Networks for Rare Event Detection (17824406)

Main Inventor

Xinjian XUE

Brief explanation

The patent application describes a computer method for identifying rare events using machine learning networks.

• The method involves receiving information about an event.
• A first machine learning network, trained to classify events in the majority class, is executed on the received information.
• A second machine learning network, trained to classify events in the minority class, is also executed on the received information.
• The first and second machine learning networks can be executed in parallel or sequentially.
• The classifications from both networks are combined to predict the class of the event.

Abstract

A computer implemented method of identifying rare events includes receiving information representative of an event. A first machine learning network trained to classify events in a majority class is executed on the received information representative of the event. A second machine learning network trained to classify events in a minority class is executed on the received information representative of the event. The first and second machine learning networks may be executed in parallel or serially. The classifications of the first and second machine learning networks are then combined to predict the class of the information representative of the event.

TECHNIQUES FOR GENERATING A MODEL FOR TIMESERIES DATA FORECASTING (17804429)

Main Inventor

Chepuri Shri Krishna

Brief explanation

- The patent application describes a method for generating a model to forecast time series data.

- The method involves using one or more layers, where each layer includes generating short range and long range outputs for each input in the time series data set. - The short range output is generated using a causal convolution process, which considers inputs from the time series data set that are associated with timestamps within a certain time threshold before the input timestamp. - The long range output is generated using a transformer process, which is based on the short range outputs from the causal convolution process. - The transformer process considers inputs from the time series data set that are associated with timestamps before the input timestamp. - The method aims to improve the accuracy of time series data forecasting by incorporating both short range and long range information from the time series data set.

Abstract

Described are examples for generating a model for forecasting time series data. For a timeseries data set, one or more layers can be provided, where each layer in the one or more layers includes, for each timeseries data input in at least a portion of multiple timeseries data inputs, generating, for the timeseries data input, a short range output from a causal convolution process that is based on timeseries data inputs from the timeseries data set that are associated with timestamps within a threshold time before the timestamp of the timeseries data input, and generating, for the timeseries data input, a long range output from a transformer process based on the short range outputs from the causal convolution process for each timeseries data input from at least the portion of the multiple timeseries data inputs that are associated with timestamps before the timestamp of the timeseries data input.

LINGUISTIC SCHEMA MAPPING VIA SEMI-SUPERVISED LEARNING (17827688)

Main Inventor

Avrilia FLORATOU

Brief explanation

- The patent application describes a method for mapping a customer schema to an industry-specific schema using linguistic schema mapping via semi-supervised learning.

- The customer schema is received and the corresponding industry-specific schema is identified. - An attribute in the customer schema is selected for labeling. - Candidate pairs are generated, consisting of the selected attribute and one or more second attributes that may describe the first attribute. - A featurizer determines similarities between the first attribute and second attribute in each generated pair. - One or more suggested labels are generated by a machine learning model. - One of the suggested labels is applied to the first attribute.

Abstract

Linguistic schema mapping via semi-supervised learning is used to map a customer schema to a particular industry-specific schema (ISS). The customer schema is received and a corresponding ISS is identified. An attribute in the customer schema is selected for labeling. Candidate pairs are generated that include the first attribute and one or more second attributes which may describe the first attribute. A featurizer determines similarities between the first attribute and second attribute in each generated pair, one or more suggested labels are generated by a machine learning (ML) model, and one of the suggested labels is applied to the first attribute.

Meeting Analysis and Coaching System (17804459)

Main Inventor

Jan-Ove Karlberg

Brief explanation

- The patent application describes systems and methods for meeting analysis and coaching.

- The systems monitor a meeting and identify the content discussed during the meeting. - The content is analyzed to determine the specific information each participant contributed to the meeting. - The knowledge level of each participant on the topics discussed in the meeting is determined. - A set of policies for the meeting is evaluated to check if they have been followed. - The participant content, knowledge levels, policy evaluation, and other information are used to generate insights for the meeting participants. - These insights are then provided to the participants to help them improve their meeting performance.

Abstract

Examples of the present disclosure describe systems and methods for meeting analysis and coaching. In examples, a meeting is monitored to identify meeting content associated with the meeting. The meeting content is analyzed to determine participant content for the participants of the meeting. A knowledge level for topics discussed in the meeting is determined for each participant. A set of policies for the meeting is evaluated to determine whether the set of policies has been satisfied. A set of info including the participant content, the knowledge levels for the participants, the evaluation of the set of policies, and other information is evaluated to generate insights for the participants of the meeting. The insights are provided to the participants of the meeting.

AGENDA DRIVEN CONTROL OF USER INTERFACE ENVIRONMENTS (17829336)

Main Inventor

Jason Thomas FAULKNER

Brief explanation

- The patent application describes techniques for controlling user interface environments in conference systems.

- The system can automatically select and apply suitable 2D or 3D user interface constructs based on the context of the conference. - It can switch display settings between 2D and 3D for client endpoints. - The system utilizes a meeting agenda to determine the context and identify the type of meeting. - Different agenda items like Financial Report, Brainstorming Session, and Social Gathering are used to determine the meeting type. - Based on the meeting type, the system applies appropriate 2D and 3D constructs with scenes suitable for each agenda item. - For example, a conference hall with large presentation screens is used for the Financial Report, a virtual room with a whiteboard is used for the Brainstorming Session, and a virtual room with a party theme is used for the Social Gathering.

Abstract

The disclosed techniques enable systems to provide agenda driven control of user interface environments. A conference system can perform a contextual determination and automatically select and apply a suitable corresponding 2D or 3D user interface construct for the conference participants. The system can also cause client endpoints to switch display between 2D and 3D settings using different user interface constructs. A system can perform contextual determination utilizing a meeting agenda and identify a meeting type based on agenda items such as: a Financial Report, a Brainstorming Session, and a Social Gathering. In response, the system automatically applies proper 2D and 3D constructs with scenes suitable for each agenda item: a conference hall with large presentation screens for the Report, a virtual room with a whiteboard for the Brainstorming Session, and a virtual room with a party theme for the Social Gathering.

NOTIFYING CONTENT EXPERT OF CONTENT CREATED BY USER OUTSIDE COLLABORATION CIRCLE OF CONTENT EXPERT (17664918)

Main Inventor

Torbjørn Helvik

Brief explanation

This patent application describes systems and methods for notifying users about new content that is relevant to their expertise. Here are the key points:

• The system evaluates existing content to determine the topics associated with it.
• User activity is monitored to determine their knowledge levels on various topics within a specific domain.
• User collaboration circles are formed based on their interactions with each other.
• When new content is detected, the system evaluates the topics in the new content.
• Users who have knowledge on those topics are identified based on their determined knowledge levels.
• The identified users are ranked, taking into account their collaboration circles.
• The ranked users who have knowledge on the topics are notified about the new content creation.
• Alternatively, the users who created the new content can be notified about the ranked users who have knowledge on the topics.

Abstract

Examples of the present disclosure describe systems and methods for notifying users of content creation related to existing content expertise. In examples, content associated with a data domain is evaluated to determine the topics associated with the content. User activity for the data domain is monitored to determine user knowledge levels on various topics. User collaboration circles are determined based on interactions between users. When new content is detected, topics in the new content are evaluated and users having knowledge on the topics are identified based on the determined knowledge levels. The users having knowledge on the topics are ranked based in part on their collaboration circles. At least a portion of the ranked users having knowledge on the topics are notified of the new content creation and/or the users creating the new content are notified of the ranked users having knowledge on the topics.

EASING CROSS-GEO COLLABORATION WITH INTELLIGENT SCHEDULING (17804424)

Main Inventor

Gladys Tigounmo KENFACK

Brief explanation

This patent application describes methods and systems for scheduling virtual meetings across multiple geographic locations. Here are the key points:

• The technology allows for scheduling virtual meetings by considering location attributes and cross-geographic preferences of the attendees.
• The method involves receiving and storing configurations for location attributes and cross-geographic preferences of multiple users.
• When a meeting organizer requests the location attributes and preferences of attendees, the system accesses the stored information.
• Based on the requested attributes and preferences, the system generates a meeting time recommendation.
• The system then transmits the accessed attributes, preferences, and the recommended meeting time to the meeting organizer.

Abstract

Methods and systems for scheduling virtual meetings across multiple geographic locations. In an example, the technology relates to a method for scheduling a virtual meeting. The method includes receiving configurations for location attributes and cross-geographic preferences for a plurality of users; storing the received configurations in a data storage; receiving, from a meeting organizer client device, a request for location attributes and cross-geographic preferences for one or more attendees of a virtual meeting; accessing, from the data storage, the requested location attributes and cross-geographic preferences for the one or more attendees; generating, based on at least the requested location attributes and cross-geographic preferences, a meeting time recommendation; and transmitting the accessed location attributes, cross-geographic preferences, and the generated meeting time recommendation to the meeting organizer client device.

SCHEDULING CALENDAR EVENTS (17804441)

Main Inventor

Yuchen LI

Brief explanation

The patent application describes a method for scheduling calendar events.

• The method involves generating multiple potential calendars for an attendee, each containing different options for each event.
• An opportunity cost is calculated for each potential calendar.
• Some of the potential calendars are selected for further development, creating a calendar graph.
• Events are added to the selected potential calendars to create new potential calendars or completed calendars.
• The selection of potential calendars for further development is based on their opportunity cost.
• Finally, a portion of the calendar events are scheduled using the completed calendars generated from the selection process.

Abstract

A method for scheduling one or more of a plurality of calendar events comprises generating a plurality of partial candidate calendars for an attendee. Each partial candidate calendar includes, for each of one or more calendar events, a timeslot selected from one or more timeslot options for that calendar event. An opportunity cost is calculated for each partial candidate calendar. At least some of the partial candidate calendars are queued for further development in which each queued partial candidate calendar is a parent node in a calendar graph. The further development includes adding a calendar event to the parent node to thereby generate another partial candidate calendar or a completed candidate calendar. The queuing is sequenced based on the opportunity cost for each partial candidate calendar. At least a portion of the plurality of calendar events are scheduled using one or more completed candidate calendars generated from the queuing.

MEETING THREAD BUILDER (17826859)

Main Inventor

Warren David JOHNSON, III

Brief explanation

- This patent application is about automatically determining the relationship between meetings and using that information to provide improved meeting services to users.

- The technology involves creating a meeting-oriented knowledge graph to store the relationship between meetings. - The meeting relationship information can be analyzed to provide meeting analytics and suggestions to users. - Meeting suggestions may include suggested attendees, location, and topic, based on the relationship between meetings. - The meeting-oriented knowledge graph can also be used to generate analytics and visualizations to help users plan or prepare for meetings.

Abstract

Various embodiments are directed to automatically determining when meetings are related to each other. The relationship between meetings may be stored in a meeting-oriented knowledge graph that can be analyzed to provide meeting analytics. Various technologies can leverage the meeting relationship information to provide improved meeting services to users. For example, meeting suggestions may be presented to a user with suggested meeting parameters (e.g., suggested attendees, suggested location, suggested topic) that are accurate because a relationship between meetings is used to predict the parameters. The information in the meeting-oriented knowledge graph can be used to generate various analytics and visualizations that help users plan or prepare for meetings.

AUTOMATED CUSTOMER SELF-HELP SYSTEM (17828203)

Main Inventor

Raymond Robert RINGHISER

Brief explanation

The patent application describes methods, systems, and computer programs for providing self-help to users.

• The methods involve detecting a user's request for self-help and obtaining a score for a set of historical self-help cases using machine learning models.
• The first score is obtained using a rule mining model, while the second score is obtained using a similarity model based on user information.
• The combined score for each case is calculated based on the first and second scores, and the set of cases is ranked accordingly.
• The information for at least one of the cases is presented on a user interface based on the ranking.

Abstract

Methods, systems, and computer programs are presented for providing self-help. One method includes operations for detecting a request for self-help for a user, and obtaining, using a first ML model for rule mining, a first score for a set of cases from a database of historical cases of self-help for aiding users. The method further includes an operation for obtaining, using a second ML model for similarity based on user information, a second score for each case based on a similarity between and an environment of the user requesting self-help and an environment of each case. Further, the method includes obtaining a combined score for each case based on the first score and the second score, and ranking the set of cases based on the combined score. The information for at least one of the cases is presented on a user interface (UI) based on the ranking.

TOOLS AND METHODS FOR USER-ENGAGEMENT MODELING AND OPTIMIZATION (17827936)

Main Inventor

Ruby MAZUMDAR

Brief explanation

- The patent application describes methods, systems, and computer programs for automated hypothesis generation and evaluation.

- The invention includes a user interface (UI) that allows users to identify a baseline segment and a target segment of users for a product or service. - The UI also allows users to configure parameters for generating a hypothesis. - The hypothesis is generated based on the configured parameters and defines a campaign to transfer members from the baseline segment to the target segment. - A machine-learning model is used to estimate the performance metric value that would result from implementing the hypothesis. - The hypothesis and the estimated performance metric are presented on the UI for evaluation.

Abstract

Methods, systems, and computer programs are presented for automated hypothesis generation and evaluation. One method includes an operation for generating a user interface (UI) for identifying a baseline segment and a target segment of users of a product or service. The UI further provides at least one option for configuring parameters for generating a hypothesis. The method further includes an operation for generating the hypothesis based on the configured parameters. The hypothesis defines a campaign to reach members of the baseline segment in order to transfer members from the baseline segment to the target segment. The method further includes estimating, by a machine-learning model, at least one performance metric value that would result from implementing the hypothesis to transfer members from the baseline segment to the target segment. Further, the method includes an operation for causing presentation on the UI of the hypothesis and the at least one performance metric.

OPTIMIZING TRIAL RESOURCE ALLOCATIONS TO PROMOTE PRODUCT ACQUISITION (17804845)

Main Inventor

Brijesh Bharadwaj

Brief explanation

- The patent application is about a system that helps optimize trials of software products within a budget.

- The system estimates the value of acquiring a software product and determines a trial budget for it. - A software provider offers the first trial of the product to the user based on the trial budget and the cost of providing the product. - Data is collected during the first trial, and if the user doesn't acquire the product, a subsequent trial optimizer uses a model to evaluate the collected data. - The optimizer determines a parameter for optimizing a second trial of the product for the user within the remaining trial budget. - Based on this parameter, the system offers the second trial of the product to the user.

Abstract

The present disclosure relates to a system for optimizing a trial of software product within a budget. In particular, the disclosed technology estimates a resource value of product acquisition for a product and determines a trial budget for the product. A software provider offers the first trial of the product to the user for a first trial period based on the trial budget and a resource cost associated with providing the product and collects data associated with the first trial of the product. In response to the first trial not resulting in the product acquisition, a subsequent trial optimizer uses a model for evaluating the collected data and determines a parameter for optimizing a second trial of the product for the user within a remaining trial budget. Based on the at least one parameter, the system offers the second trial of the product to the user.

VIDEO COMPRESSION (17829265)

Main Inventor

Marc Andre Leon POLLEFEYS

Brief explanation

The patent application describes a decoder that can process compressed RGBD frames in a video. 

• The decoder uses a reference RGBD frame and a depth channel to reproject the reference frame.
• The reprojected version of the reference frame is computed using a camera pose.
• The decoder then utilizes the reprojected reference frame to decode the compressed RGBD frame.

Abstract

A decoder receives a compressed red green blue depth, RGBD, frame of a video. The decoder accesses a reference RGBD frame. The decoder reprojects the reference RGBD frame using a depth channel of the reference RGBD frame and a camera pose, to compute a reprojected version of the reference frame. The decoder uses the reprojected version of the reference frame to decode the compressed RGBD frame.

TINTING MATERIAL ON AN INTERFACE (17827691)

Main Inventor

Spencer Israel Antonin Nataraja HURD

Brief explanation

- The patent application describes a method for generating and applying a tinting material to the backdrop of an application on a user interface.

- The user interface includes a background with a first color, which has a luminosity value, a hue value, and a saturation value. - A tint color is received, which has a luminosity value, a hue value, a saturation value, and an opacity value. - The luminosity value of the first color is modified to create a second color. - The hue value and saturation value of the second color are further modified to generate a third color. - A tinting material color is generated using the modified luminosity value of the second color, the modified hue value of the third color, and the modified saturation value of the third color. - The application on the user interface is presented with the tinting material color applied to the backdrop.

Abstract

A tinting material may be generated and applied to the backdrop of an application presented on a user interface. The user interface is presented on a display and includes a background. The background comprises a first color, which includes a luminosity value, a hue value, and a saturation value. A tint color, having a luminosity value, a hue value, a saturation value, and an opacity value, is received. The luminosity value of the first color is modified to generate a second color, and the hue value and saturation value of the generated second color are modified to generate a third color. A tinting material color is generated that includes the modified luminosity value of the second color, the modified hue value of the third color, and the modified saturation value of the third color, and an application is presented on the user interface that includes the tinting material color.

CONTENT LAYOUT SYSTEMS AND PROCESSES (17828857)

Main Inventor

Gaurav Vinayak TENDOLKAR

Brief explanation

- This patent application describes a data processing system that can receive an image of a canvas and analyze it to detect design features within the canvas.

- The system can compare the image to a current image of the canvas to determine the execution of a command and modify the design features accordingly to generate layouts. - The system can also determine parameters of the modified design features and apply rules to these parameters to determine a value for each layout. - The layouts, based on their determined value, can be displayed to a user.

Abstract

A data processing system is implemented for receiving an image of a canvas, and detecting design features within the canvas by analyzing the image. The data processing system is implemented for determining an execution of a command by comparing the image to a current image of the canvas, and modifying the design features within the canvas to generate layouts in response to determining the execution of the command. Further, the data processing system is implemented for determining parameters of the modified design features, and determining a value for each layout by applying rules to the parameters of the modified design features. In addition, the data processing system is implemented for displaying the layouts based on the determined value for each layout to a user.

GRAPHICS PROCESSING SYSTEMS AND METHODS WITH GEOMETRY LEVEL OF DETAIL PROCESSING (17828914)

Main Inventor

Mark S. GROSSMAN

Brief explanation

The abstract describes a graphics processing system and method that involves processing geometry level of detail for meshlet instances.

• The system includes a processor that retrieves a first level of detail value for a meshlet instance.
• The processor computes a second level of detail value for the same meshlet instance.
• Based on a comparison between the two level of detail values, the processor selects a final level of detail value for the meshlet instance.
• The processor fetches vertices and corresponding indices for the meshlet instance based on the final level of detail value.
• The processor then processes the vertices of the meshlet instance.

Abstract

Graphics processing systems and methods with geometry level of detail processing are described. An example graphics processing system includes a processor configured to retrieve a first level of detail value for a meshlet instance. The processor may further be configured to compute a second level of detail value for a meshlet instance. The processor may further be configured to, based on a comparison between the first level of detail value for the meshlet instance and the second level of detail value for the meshlet instance, select a final level of detail value for the meshlet instance. The processor may further be configured to fetch vertices and corresponding indices for the meshlet instance based on the final level of detail value for the meshlet instance and process the vertices of the meshlet instance.

AUTOMATION OF AUDIO AND VIEWING PERSPECTIVES FOR BRINGING FOCUS TO RELEVANT ACTIVITY OF A COMMUNICATION SESSION (17827618)

Main Inventor

Jason Thomas FAULKNER

Brief explanation

- This patent application describes techniques for guiding a user's attention in a 3D communication environment.

- The system can control the user's viewing perspective to focus on specific avatars that are relevant to the user. - The system can also control audio signals to highlight relevant discussions and other audio content. - For example, the system can obscure other avatars when a particular group of remote users interact with the user's avatar or mention the user in a conversation. - By directing visual and audio perspectives, the system helps the user navigate through large groups of participants using 3D representations in a communication environment.

Abstract

The techniques disclosed herein enable systems to guide a user's attention to relevant activity of a communication session displayed in a 3D environment. The system can control a viewing perspective of a 3D environment to focus on specific avatars that are relevant to a user viewing the activity. The system can also control audio signals from remote users of a communication session to enable the viewer to focus on relevant discussions and other audio content. For example, when a particular group of remote users control their avatars to look at the user's avatar or name the user in a conversation, the system can obscure a view of other avatars to bring focus on that particular group of remote users. By directing visual and audio perspectives, a system can help the user navigate through activity of large groups of participants using 3D representatives of a 3D environment to communicate.

TERRAIN ESTIMATION USING LOW RESOLUTION IMAGERY (17804195)

Main Inventor

Roberto DE MOURA ESTEVAO FILHO

Brief explanation

- The patent application describes a computing system that measures terrain coverage using multispectral image data.

- The system generates an index array of pixels for a specific terrain, representing the relationship between reflectance values at different wavelengths. - This index array is then provided to a trained calibration model, which generates an estimated value representing the amount of terrain coverage within a geographic region. - The estimated value is outputted as the result for the specific terrain. - The calibration model is trained using reference images of training geographic regions at a higher resolution than the sample resolution.

Abstract

A computing system measures terrain coverage by: obtaining sample image data representing a multispectral image of a geographic region at a sample resolution; generating, based on the sample image data, an index array of pixels for a subject terrain in which each pixel has an index value that represents a predefined relationship between a first wavelength reflectance and a second wavelength reflectance; providing the index array to a trained calibration model to generate an estimated value based on the index array, the estimated value representing an estimated amount of terrain coverage within the geographic region for the subject terrain; and outputting the estimated value for the subject terrain. The trained calibration model may be trained based on training data representing one or more reference images of one or more training geographic regions containing the subject terrain at a higher resolution than the sample resolution.

DETECTING SPOOF IMAGES USING PATTERNED LIGHT (17804293)

Main Inventor

Neil EMERTON

Brief explanation

The patent application is about determining whether an imaged subject is real or fake.

• The invention is a computing system that includes a camera and a light pattern source.
• The system captures an image of a subject illuminated by the light pattern.
• It determines whether the subject is real or a spoof based on the contrast of the light pattern in the image.
• If the subject is determined to be real, the system performs an action.
• If the subject is determined to be a spoof, the system does not perform the action.

Abstract

Examples are disclosed herein that relate to determining whether an imaged subject is real or spoofed. One example provides a computing system, comprising, a camera, a light pattern source configured to output a light pattern, a logic subsystem, a storage subsystem storing instructions executable by the logic subsystem to capture, via the camera, an image of a subject illuminated by the light pattern emitted by the light pattern source, determine, based at least upon a contrast of the light pattern in the image, whether the subject is real or a spoof, based at least upon determining that the subject is real, perform an action on the computing system, and based at least up on determining that the subject is a spoof, not perform the action on the computing system.

PHONEME-BASED TEXT TRANSCRIPTION SEARCHING (17804508)

Main Inventor

Yuchen LI

Brief explanation

- This patent application describes a computer-implemented method for searching and aligning text transcriptions with specified spellings in audio sessions.

- The method involves receiving a search query with a specified spelling and generating a sequence of search phonemes corresponding to that spelling. - A sequence of transcript phonemes is also generated from the text transcription. - A search alignment is then generated, aligning the sequence of search phonemes with a fragment of transcript phonemes. - If the search alignment has a quality score exceeding a threshold, it is determined that the fragment of transcript phonemes and the associated portion of the text transcription resulted from an utterance of the specified spelling in the audio session. - A search result is output indicating that the fragment of transcript phonemes and the associated portion of the text transcription are determined to have resulted from the utterance.

• Simplified explanation:

- This patent application describes a method for searching and aligning text transcriptions with specified spellings in audio sessions. - The method involves generating phoneme sequences for the search query and the text transcription. - A search alignment is created between the search phonemes and a fragment of transcript phonemes. - If the alignment meets a quality score threshold, it is determined that the transcript fragment and associated text resulted from the specified spelling in the audio session. - A search result is then provided indicating this determination.

Abstract

A computer-implemented method is disclosed. A search query of a text transcription is received. The search query includes a word or words having a specified spelling. A sequence of search phonemes corresponding to the specified spelling is generated. A sequence of transcript phonemes corresponding to the text transcription is generated from the text transcription. A search alignment in which the sequence of search phonemes is aligned to a transcript phoneme fragment is generated. Based at least on the search alignment having a quality score exceeding a quality score threshold, the transcript phoneme fragment and an associated portion of the text transcription is determined to result from an utterance of the specified spelling in an audio session corresponding to the text transcription. A search result indicating that the transcript phoneme fragment and the associated portion of the text transcription is determined to have resulted from the utterance is output.

Multichannel Audio Speech Classification (17804606)

Main Inventor

Oron NIR

Brief explanation

- The present disclosure describes systems and methods for multichannel audio speech classification.

- The system receives an audio signal with multiple audio channels. - Each audio channel is transcoded to a predefined audio format. - Average power values are calculated for one or more data windows in each transcoded audio channel. - Correlation values are calculated between the average power values of each audio channel and the combined average power value of the other audio channels. - The correlation values are compared against a threshold value to determine if the audio signal is speech-based communication. - An action associated with the audio signal is performed based on the classification.

Abstract

Examples of the present disclosure describe systems and methods for multichannel audio speech classification. In examples, an audio signal comprising multiple audio channels is received at a processing device. Each of the audio channels in the audio signal is transcoded to a predefined audio format. For each of the transcoded audio channels, an average power value is calculated for one or more data windows in the audio signal. A correlation value is calculated between the average power value for each audio channel and the combined average power value of the other audio channels in the audio signal. Each of the correlation values (or an aggregated correlation value for the audio channels) is then compared against a threshold value to determine whether the audio signal is to be classified as a speech-based communication. Based on the classification, an action associated with the audio signal may be performed.

COMPUTER-BASED WELL BEING ASSESSMENT AND MITIGATION (17664974)

Main Inventor

Mastafa Hamza FOUFA

Brief explanation

The patent application describes a computer-based system that assesses a user's well-being and takes proactive measures to improve it.

• The system includes a network communication subsystem, an attribution machine, a well-being assessment machine, and a mitigation machine.
• The network communication subsystem communicates with multiple user computers.
• The attribution machine assigns computing information received from a user computer to a user account.
• The well-being assessment machine continuously updates a well-being score for the user account based on the computing information.
• The mitigation machine performs a mitigation operation for the user account if the well-being score decreases at a rate above a certain threshold.

Abstract

Examples are disclosed that relate to performing computer-based well being assessments and proactively performing computer-based mitigation operations to improve a user's well being. In one example, a computing system comprises a network communication subsystem, an attribution machine, a well being assessment machine, and a mitigation machine. The network communication subsystem is configured to communicate with a plurality of user computers. The attribution machine is configured to attribute, to a user account, computing information that the network communication subsystem receives from a user computer. The well being assessment machine is configured to progressively update a well being score over time for the user account based at least on the computing information. The mitigation machine is configured to perform a mitigation operation associated with the user account based at least on an above threshold rate of decrease of the well being score.

USING ATTESTATION CLIENT CODE TO ATTEST HEALTH OF A COMPUTING DEVICE (17829292)

Main Inventor

Ronald AIGNER

Brief explanation

The patent application describes techniques for using attestation client code to verify the health of a computing device. Here are the key points:

• The computing device receives attestation client code and a cryptographic key from an attestation service.
• The cryptographic key is associated with a TPM (Trusted Platform Module) of the computing device and can only be used by the attestation client code.
• The computing device executes the attestation client code using a dynamic root of trust for measurement (DRTM) sequence.
• The attestation client code gathers measurements that indicate attributes of the operating system of the computing device.
• The attestation client code generates protected measurements by using the cryptographic key to sign and/or encrypt the measurements.
• The computing device sends the protected measurements to the attestation service to establish trust in the measurements.

Abstract

Techniques are described herein that use attestation client code to attest health of a computing device. The computing device receives the attestation client code and a cryptographic key from an attestation service. The cryptographic key is associated with a TPM of the computing device and is usable only by the attestation client code. The computing device executes the attestation client code by executing a dynamic root of trust for measurement (DRTM) sequence. The computing device causes the attestation client code to gather measurements that indicate attributes of an operating system of the computing device. The computing device causes the attestation client code to generate protected measurements by using the cryptographic key to sign and/or encrypt the measurements. The computing device causes the attestation service to establish trust in the measurements by causing the protected measurements to be provided to the attestation service.

DETECTION OF FAILURES IN VIRTUALIZED RADIO ACCESS NETWORKS (17827684)

Main Inventor

Daehyeok KIM

Brief explanation

- The patent application is about a system that transfers data traffic between a radio unit (RU) and a virtualized radio access network (vRAN) instance.

- If the vRAN instance fails to send a downlink fronthaul packet to the RU within a specific time limit, a failure notification is sent to a PHY layer failure response function. - This failure to communicate the packet within the time limit indicates a failure of the vRAN instance. - The innovation is focused on detecting and notifying failures in the communication between the RU and the vRAN instance. - The system aims to improve the reliability and performance of the cellular network by promptly identifying and addressing failures in the vRAN instance.

Abstract

Data traffic is communicated between a radio unit (RU) of a cellular network and a virtualized radio access network (vRAN) instance of a vRAN. In response to determining that the vRAN instance has failed to communicate a downlink fronthaul packet to the RU within a threshold timeout interval, a failure notification is sent to a PHY layer failure response function. The failure to communicate the downlink fronthaul packet to the RU within the threshold timeout interval is indicative of a failure of the vRAN instance.

TECHNIQUES FOR PROVISIONING WORKSPACES IN CLOUD-BASED COMPUTING PLATFORMS (17829235)

Main Inventor

Veerash Ayyagari

Brief explanation

The patent application describes a method for provisioning resources on a cloud-based computing platform.

• The method involves receiving a visual representation of a desired workspace configuration from a user interface.
• The visual representation includes multiple resources that need to be deployed on the cloud-based computing platform.
• The visual representation is then translated into a data representation using name/value pairs.
• Based on this data representation, the multiple resources are deployed on one or more nodes of the cloud-based computing platform.
• The method also includes providing an indication of one or more parameters for accessing the multiple resources via the cloud-based computing platform to the user interface.

Abstract

Described are examples for provisioning resources on a cloud-based computing platform including receiving, from a user interface, a visual representation of a desired workspace configuration including multiple resources to be deployed on the cloud-based computing platform, translating the visual representation into a data representation including name/value pairs, deploying, based on the data representation, the multiple resources on one or more nodes of the cloud-based computing platform, and providing, to the user interface, an indication of one or more parameters for accessing the multiple resources via the cloud-based computing platform.

COLLECTING AND VISUALIZING HEALTH PROFILE DATA OF RADIO ACCESS NETWORK COMPONENTS (17827112)

Main Inventor

Bhushan Mangesh KANEKAR

Brief explanation

- The patent application is about a system for collecting operational data from multiple radio access network (RAN) components to determine and present a health profile for those components.

- The system involves implementing event tracking agents on the RAN components and compiling instances of detected events through event streams. - The system then determines a health profile that reflects the current or predicted health state of the RAN components. - The system can generate and present a health profile presentation with interactive icons and features for viewing health profile data for specific RAN sites, components, and user devices associated with the tracked events. - The system can also take mitigation actions to address poor health conditions observed or predicted over time.

Abstract

The present disclosure relates to systems, methods, and computer-readable media for collecting operational data across a plurality of radio access network (RAN) components for determining and presenting a health profile for the RAN components. Systems described herein involve implementing event tracking agents on the RAN components, compiling instances of detected events via event streams from the respective RAN components, and determining a health profile that reflects a current or predicted health state for components that make up a RAN. The systems described herein may further generate and present a health profile presentation including interactive icons and features that enable an individual to view health profile data for specific RAN sites, RAN components, and even user devices associated with the tracked events. Systems described herein may perform various mitigation actions to overcome poor health conditions as they are observed or predicted over time.

DATA CENTER NETWORK WITH PACKET SPRAYING (18446876)

Main Inventor

Pradeep Sindhu

Brief explanation

The patent application describes a network system for a data center that involves spraying a data flow of packets over a logical tunnel between access nodes.

• Access nodes establish a logical tunnel over multiple data paths across a switch fabric.
• The logical tunnel connects a source access node to a destination access node, both of which are part of a group of access nodes.
• The source access node is connected to a source network device.
• The source access node sprays a data flow of packets over the logical tunnel to the destination access node.
• The source access node receives the data flow of packets from the source network device.
• Spraying the data flow of packets involves directing each packet within the data flow to the least loaded data path.

Abstract

A network system for a data center is described in which an access node sprays a data flow of packets over a logical tunnel to another access node. In one example, a method comprises establishing, by a plurality of access nodes, a logical tunnel over a plurality of data paths across a switch fabric between a source access node and a destination access node included within the plurality of access nodes, wherein the source access node is coupled to a source network device; and spraying, by the source access node, a data flow of packets over the logical tunnel to the destination access node, wherein the source access node receives the data flow of packets from the source network device, and wherein spraying the data flow of packets includes directing each of the packets within the data flow to a least loaded data path.

DYNAMIC RE-ROUTING AND MODIFICATION OF LAYER TRAFFIC IN VIRTUALIZED RANS (17825645)

Main Inventor

Anuj KALIA

Brief explanation

The patent application describes methods and systems for re-routing layer traffic between servers in a virtualized Radio Access Network (vRAN) without disrupting the user experience or making modifications to the vRAN software stack.

• The approach allows operators to migrate the physical layer (PHY) processing to different servers either on demand or automatically in response to unexpected events like server failures.
• Unlike other network components, PHY processing in cellular networks does not have any hard state that needs to be migrated, making it easier to re-route layer traffic.
• The re-routing mechanism involves using one or more message controllers (middleboxes) to intercept and redirect layer traffic between the PHY and Layer 2 (L2) protocols.
• This re-routing can be done during planned maintenances or automatically in response to server failures, ensuring continuous network operation and minimizing disruptions.
• The innovation enables operators to efficiently manage and optimize their vRAN infrastructure without impacting the user experience or requiring complex modifications to the software stack.

Abstract

Methods and systems for dynamically re-routing layer traffic between different servers with little user-visible disruption and without modifications to the vRAN software stack are provided. This approach enables operators to initiate a PHY migration either on demand (e.g., during planned maintenances) or to set up automatic migration on unexpected events (e.g., server failures). It is recognized that PHY processing in cellular networks has no hard state that must be migrated. As a result, layer traffic such as the PHY-L2 traffic or L2-PHY traffic can be simply re-routed to a different server. This re-routing mechanism is realized by interposing one or more message controllers (e.g., middlebox) in a communication channel between the PHY and L2.

SYSTEMS AND METHODS FOR DETERMINING SCORES FOR MESSAGES BASED ON ACTIONS OF MESSAGE RECIPIENTS AND A NETWORK GRAPH (17828901)

Main Inventor

Maurizio CIBELLI

Brief explanation

- The patent application describes an email ranking system that assigns scores to emails based on actions taken by other recipients of the emails.

- The system considers the closeness of the recipient's connection to the user and the type of connection when weighting their actions. - Each email is given a score that represents the likelihood of it containing important content for the user. - A client device can display the user's emails in descending order based on the scores, allowing the user to prioritize important emails. - The email ranking system aims to improve the client device by helping the user quickly identify important emails.

Abstract

An email ranking system assigns scores to emails of a user based on actions that other recipients of the emails have taken with respect to the emails. In determining the scores, the email ranking system may weight each recipient's action based on how closely connected the recipient is to the user and a type of connection the recipient has to the user. Each email's score may represent a likelihood that the email contains content that is important to the user. A client device may display the user's emails based on the scores. The client device may list the emails in descending order based on the scores, enabling the user to prioritize review of emails that are more likely to be important to the user. In this way, the email ranking system improves the client device by helping the user more quickly identify important emails.

Multiple Virtual Private Network Active Connection Management (17828871)

Main Inventor

Pankaj Kumar MADHUKAR

Brief explanation

The patent application describes a computer method for intercepting and forwarding packets in a mobile device to a specific virtual private network (VPN) plugin.

• The method identifies the appropriate VPN plugin for the packet out of multiple active VPN plugins.
• The packet is then forwarded to the identified VPN plugin.
• The packet is transmitted through the VPN tunnel while keeping other VPNs with corresponding plugins active.
• This enables the mobile device to establish multiple remote VPN connections using just one VPN tunnel.

Abstract

A computer implemented method includes intercepting a packet in a mobile device, the packet having a destination network address. A first virtual private network (VPN) plugin for which the packet is intended is identified out of multiple active VPN plugins. The packet is forwarded to the first VPN plugin. The first packet is forwarded via the VPN tunnel while keeping other VPNs having corresponding other plugins active, enabling multiple remote VPN connections using just one VPN tunnel.

DECENTRALIZED ATTRIBUTE-BASED ACCESS CONTROL (17829231)

Main Inventor

Peter KOEN

Brief explanation

This patent application describes a system and method for decentralized attribute-based access control in a federation. Here are the key points:

• The system allows for a decentralized federation where members can control access to their resources based on attributes.
• A request is made to a federation authority to obtain a list of unique identifiers (IDs) associated with members in the federation.
• For each unique ID, the system determines the communication information needed to contact the corresponding member.
• The system then sends a request to each member for a list of available services.
• The first member provides a set of verifiable credentials to the second member, which are used to determine the available services.
• The second member uses a set of policies and rules to determine the final list of available services.
• The list of available services is received from the second member.

Overall, this patent application describes a system that enables decentralized control over access to resources within a federation, using attributes, verifiable credentials, and policies/rules.

Abstract

Embodiments of the present disclosure include systems and methods for providing a decentralized federation for attribute-based access control. A request for a list of unique identifiers (IDs) associated with members belonging to the federation is sent to a federation authority. For a unique ID in the list of unique IDs associated with a second member belonging to the federation, a set of communication information for communicating with the second member is determined. Based on the set of communication information associated with the second member, the second member is sent a request for a list of available services. The second member is provided a set of verifiable credentials associated with the first member. The second member determines the list of available services based on the set of verifiable credentials and a set of policies and rules. The list of available services is received from the second member.

ESTABLISHMENT OF TRUST FOR DISCONNECTED EDGE-BASED DEPLOYMENTS (17827641)

Main Inventor

Rahul BOSE

Brief explanation

The patent application describes a computing network that includes a computing service provider and an edge computing network. 

• The network includes a trusted device that establishes a root of trust at the edge computing network using a trusted component on the device.
• If there is a disconnection or degradation of communications between the computing service provider and the edge computing network, the edge computing network enters an autonomous mode.
• In this mode, the trusted device identifies new devices trying to access computing resources in the edge computing network.
• The trusted device then stores data about these unauthorized devices that attempted to access the network.

Abstract

A computing network comprising a computing service provider and an edge computing network is managed. A trusted device establishes a root of trust at the edge computing network via a trusted component on the trusted device. In response to receiving a first indication of a disconnection or degradation of communications between the computing service provider and the edge computing network, the edge computing network initiates an autonomous mode at the edge computing network. While the edge computing network is operating in the autonomous mode, the trusted device detects new devices that are attempting to access computing resources in the edge computing network. The trusted device stores data pertaining to new devices that were not authorized to access the computing resources in the edge computing network.

AUTOMATION OF VISUAL INDICATORS FOR DISTINGUISHING ACTIVE SPEAKERS OF USERS DISPLAYED AS THREE-DIMENSIONAL REPRESENTATIONS (17827588)

Main Inventor

Jason Thomas FAULKNER

Brief explanation

The patent application describes a system that automates visual indicators to show active speakers in a communication session using 3D representations.

• Participants in the communication session are displayed as 3D avatars within a 3D environment.
• The user interface also includes a gallery of 2D images of other participants.
• When a user starts speaking, the system detects their activity through audio signals from their device.
• In response, the system automatically adds a complementary image of the user to the gallery.
• This helps viewers navigate through complex user interface arrangements with many avatars.

Abstract

The disclosed techniques provide systems that automate visual indicators to show active speakers of a communication session who are displayed as 3D representations. Some participants of a communication session can be displayed in a user interface using 3D representations, e.g., avatars, that are each positioned within a 3D environment. The user interface may also include and number of renderings of 2D images of other participants displayed in a gallery, e.g., a display region that is designated for active speakers. When a user who is displayed as a 3D representation starts to speak, the system can detect the speaker's activity via a detection of an audio signal from the user's device. In response to the detection, the system can then automatically add a complementary image of the user to the gallery. The complementary image can help viewers navigate through complex user interface arrangements that display a large number of avatars.

2D AND 3D TRANSITIONS FOR RENDERINGS OF USERS PARTICIPATING IN COMMUNICATION SESSIONS (17824869)

Main Inventor

Jason Thomas FAULKNER

Brief explanation

- This patent application describes systems for transitioning a user interface arrangement from displaying a 2D image of a user to rendering a 3D representation of the user.

- The system starts with a user interface that shows a rendering of the user based on a 2D image file. - When the system receives an input, it transitions the display from the 2D image to a 3D representation of the user. - To display the 3D representation, the system uses permission data and a 3D model that defines the position and orientation of the user. - The system allows users to switch between different viewing modes to interact with content using the most suitable hardware.

Abstract

Systems for transitioning a user interface arrangement from a display of a two-dimensional image of a user to a rendering of a three-dimensional representation of the user is provided. A system can start with a UI including a rendering of a user that is based on a 2D image file. The system can receive an input that is configured to cause the system to transition the display of the rendering of the 2D image of the select user to a rendering of the three-dimensional representation of the select user. To display the rendering of the 3D representation of the select user, the system uses permission data and a three-dimensional model defining a position and orientation to display the 3D representation of the user. The system allows users to switch between viewing modes to allow users to interact with content using the most effective type of hardware.

TECHNIQUES FOR OVERRIDING LIBRARIES FOR WORKLOADS IN A CLOUD-COMPUTING ENVIRONMENT (17804737)

Main Inventor

Sanjeev MEHROTRA

Brief explanation

- This patent application describes a method for overriding a library used by a workload in a cloud-computing environment.

- The method involves initializing a container for the workload, which includes specifying a binary to be executed by the container. - The method further involves loading an override library into the container before executing the binary. - The override library contains an override function that has the same function signature as a function provided by the library being overridden. - The workload is then instructed to execute the binary in the container. - When the binary calls the function using the function signature, the override function in the override library is called instead of the original function from the library.

Abstract

Described are examples for overriding a library used by a workload in a cloud-computing environment including initializing a container for a workload that includes an entry point that points to a binary to be executed by the container, causing the workload to load, based on initializing the container, an override library into the container before executing the binary, where the override library includes an override function having a function signature of a function provided by the library, and instructing the workload to execute the binary in the container, where the binary calls the function using the function signature causing the override function in the override library to be called in place of the function.

FINE-GRAINED REAL-TIME PRE-EMPTION OF CODELETS BASED ON RUNTIME THRESHOLD (17824662)

Main Inventor

Xenofon FOUKAS

Brief explanation

The patent application describes a method for fine-grained real-time pre-emption of codelets based on a runtime threshold.

• Codelets are small pieces of code that perform specific tasks within an application.
• A controller inserts checkpoints into the code of a third-party codelet before it is verified.
• These checkpoints determine the runtime of the codelet.
• If the runtime exceeds a certain threshold, the codelet is terminated.
• This method can be used in a virtualized radio access network (vRAN) network function.
• The codelet can control the vRAN function or export network metrics.
• The application may be executed in a container management system.
• The container management system modifies a container for the application.
• It detects an annotation that identifies the codelet.
• It symbolically links the codelet to the hook point of the application.

Abstract

Described are examples for providing fine-grained real-time pre-emption of codelets based on a runtime threshold. A controller inserts checkpoints into extended Berkeley packet filter (eBPF) bytecode of a third-party codelet prior to verification of the third-party codelet. A device executes the codelet at a hook point of an application. The inserted checkpoints determine a runtime of the codelet. The device terminates the codelet in response to the runtime exceeding a threshold. The application can be a virtualized radio access network (vRAN) network function and the codelet can control the vRAN function or export network metrics. The application may be executed in a container management system that modifies a container for the application to mount code including a function associated with the hook point of the application to the container; detect an annotation for the container that identifies the codelet; and symbolically links the codelet to the hook point.

VIDEO ENCODING USING DEVIATION-ADJUSTED BITRATE PARAMETER (17829118)

Main Inventor

Nitin Suri

Brief explanation

- This patent application describes techniques for encoding digital video files for streaming applications.

- The data associated with the video file is analyzed to determine its center (average) and spread (deviation) in terms of bitrate over the duration of the video file. - A deviation-adjusted bitrate is calculated based on the measure of center and spread. - This deviation-adjusted bitrate can be applied to the entire video file or specific segments of the file, such as units of video streaming. - The disclosed techniques offer advantages such as using a lower bitrate for lower-complexity video or using a higher bitrate for higher-complexity video. - The goal is to optimize the encoding process and improve the streaming experience for viewers.

Abstract

Techniques and solutions are described for encoding digital video files, such as for streaming applications. Data associated with the digital video file forms a dataset that can be characterized by a measure of the dataset's center, such as an average, and a spread of the dataset, such as a deviation, with respective to a bitrate over a duration of the digital video file. The measure of center and spread are used to calculate a deviation-adjusted bitrate. A deviation adjusted bitrate can be calculated for the entire digital video file, or for particular subsets of the digital video file, such as for segments of a duration forming units of video streaming Disclosed techniques can provide various advantages, including using a reduced bitrate for video or video portions as compared with an average or static bitrate, for lower-complexity video, or using a higher bitrate for video or video portions for higher-complexity video.

NON-TRANSFORM CODING (18231963)

Main Inventor

Jizheng Xu

Brief explanation

The patent application describes techniques for selectively transforming coding units in video content coding.

• The techniques involve determining whether or not to transform a coding unit based on pixel value differences and predefined rate-distortion constraints.
• If it is determined that a transform is not necessary, the coding unit is coded without undergoing transformation.

Abstract

Techniques for selectively transforming one or more coding units when coding video content are described herein. The techniques may include determining whether or not to transform a particular coding unit. The determination may be based on a difference in pixel values of the particular coding unit and/or one or more predefined rate-distortion constraints. When it is determined to not perform a transform, the particular coding unit may be coded without transforming the particular coding unit.

INSERTING DIGITAL CONTENTS INTO A MULTI-VIEW VIDEO (18031809)

Main Inventor

Jie Yang

Brief explanation

The patent application describes methods and devices for adding digital content to a multi-view video.

• Multi-view videos consist of multiple perspectives or views of a scene.
• The invention identifies specific regions within the multi-view video where digital content can be inserted.
• The digital content to be inserted is determined.
• The multi-view video is updated by adding the digital content to the identified target regions.

Abstract

The present disclosure provides methods and apparatuses for inserting digital contents into a multi-view video. The multi-view video may comprise a plurality of views. At least one target region in the plurality of views may be identified. At least one digital content to be inserted may be determined. The multi-view video may be updated through adding the at least one digital content into the at least one target region.

SYSTEMS AND METHODS FOR CAMERA EXPOSURE CONTROLLED STROBING LIGHTS (17828918)

Main Inventor

Vladimir LEVKOV

Brief explanation

The patent application describes an electronic device that includes a light source, a communication device, a processor, and a hardware storage device.

• The electronic device is capable of receiving a timing signal from a camera, which includes information about the exposure timing of a camera exposure.
• The device can provide an exposure light pulse from the light source at the same time as the camera exposure.
• After providing the exposure light pulse, the device can also provide a dummy light pulse that does not overlap with the camera exposure.

Innovation:

• The electronic device synchronizes the timing of the light source with the camera exposure, ensuring accurate and synchronized lighting during photography.
• The device uses a dummy light pulse to avoid interfering with the camera exposure, allowing for clear and undistorted images.
• This technology can be used in various electronic devices, such as cameras or other imaging devices, to improve the quality and accuracy of captured images.

Abstract

An electronic device includes a light source, a communication device, a processor in data communication with the light source and the communication device, and a hardware storage device in data communication with the processor. The hardware storage device has instructions stored thereon that, when executed by the processor, cause the electronic device to receive a timing signal from a camera, where the timing signal includes an exposure timing of a camera exposure; provide an exposure light pulse from the light source simultaneously with the camera exposure; and after providing the exposure light pulse, provide a dummy light pulse that does not overlap with a camera exposure.

IMAGE FRAME SELECTION FOR MULTI-FRAME FUSION (17828575)

Main Inventor

Tomi Marko Juhani SOKEILA

Brief explanation

The patent application describes a method for improving the quality of images captured by a camera by fusing multiple image frames together.

• The method aims to generate an image frame with high dynamic range and reduced noise.
• The camera captures one or more history image frames during a preview mode before the shutter button is activated.
• A highlight recovery frame is captured after the shutter button is activated.
• The history image frames and the highlight recovery frame are compared to determine their similarity.
• The history image frames are captured with a different exposure value than the highlight recovery frame.
• The history image frames that are similar to the highlight recovery frame are combined with it to create the final image frame with high dynamic range.

Abstract

Methods, systems, apparatuses, and computer-readable storage mediums described herein are configured to fuse image frames captured by a camera to generate an image frame having high dynamic range and reduced amount of noise. For instance, after a shutter button of the camera is activated, one or more history image frames captured during a preview mode of the camera (e.g., before the shutter button is activated) are compared to a highlight recovery frame captured after the shutter button is activated to determine a level of similarity therebetween. The history image frame(s) may be captured with a first exposure value, and the highlight recovery frame may be captured with a second exposure value that is different than the first exposure value. History image frame(s) that are determined to be relatively similar to the highlight recovery frame are combined with the highlight recovery frame to generate the image frame having high dynamic range.

LOAD ESTIMATION AND BALANCING IN VIRTUALIZED RADIO ACCESS NETWORKS (17827681)

Main Inventor

Daehyeok KIM

Brief explanation

This patent application describes a method for monitoring data traffic between a radio unit (RU) and a virtualized Radio Access Network (vRAN) instance. The vRAN instance is running on a server and is responsible for processing the physical layer (PHY) and Layer 2 (L2) of the data traffic. 

• The method involves monitoring the data traffic during a first transmission time interval (TTI) between the RU and the vRAN instance.
• The first vRAN instance is running on a specific server and is responsible for PHY layer processing and L2 processing.
• Based on the data traffic observed during the first TTI, the method estimates the workload that the first vRAN instance will experience during a second TTI.

Abstract

During a first transmission time interval (TTI) of a vRAN, data traffic between a radio unit (RU) of a cellular network and a first vRAN instance of the vRAN is monitored. The first vRAN instance executes on a first server of the vRAN and the first vRAN instance is configured to perform PHY layer processing and L2 processing of the data traffic. Based on the data traffic between the RU of the cellular network and the first vRAN instance during the first TTI, a workload at the first vRAN instance during a second TTI is estimated.

COMPUTE-AWARE RESOURCE CONFIGURATIONS FOR A RADIO ACCESS NETWORK (18202041)

Main Inventor

Manikanta KOTARU

Brief explanation

This patent application is about using a machine learning model to allocate resources in a radio access network (RAN) based on compute power needs. Here are the key points:

• The patent application focuses on allocating RAN resources among RAN slices using a machine learning model.
• The machine learning model determines the optimal RAN resource configuration based on compute power needs.
• This approach improves RAN resource allocation and compute power requirements, even in situations with changing or unknown network conditions.
• A prediction engine receives communication parameters and/or requirements associated with service-level agreements (SLAs) for applications running on a device connected to the RAN.
• The RAN generates one or more RAN resource configurations for implementation among RAN slices.
• If there is a change in network conditions or SLA requirements, the optimal RAN configuration is determined based on the required compute power.

Abstract

Aspects of the present disclosure relate to allocating RAN resources among RAN slices using a machine learning model. In examples, the machine learning model may determine an optimal RAN resource configuration based on compute power needs. As a result, RAN resource allocation generation and compute power requirements may improve, even in instances with changing or unknown network conditions. In examples, a prediction engine may receive communication parameters and/or requirements associated with service-level agreements (SLAs) for applications executing at least partially at a device in communication with the RAN. The RAN may generate one or more RAN resource configuration for implementation among RAN slices. Upon a change in network conditions or SLA requirements, an optimal RAN configuration may be determined in terms of required compute power.

WIRELESS PARAMETER LIMITS FOR PREDICTED VRAN RESOURCE LOADS (17825596)

Main Inventor

Yu YAN

Brief explanation

- The patent describes a method for efficiently using computing resources in a virtualized Radio Access Network (vRAN).

- A trained neural network model is used to predict the resource load for processing data traffic in wireless communication channels served by the vRAN. - The data traffic processing includes tasks like PHY data processing and MAC processing for a 5G RAN. - Based on the predicted resource load, computing resources are allocated for the data traffic processing. - Wireless parameter limits are determined for the wireless communication channels, which restrict the utilization of the allocated computing resources. - The trained neural network model helps in setting these limits, such as the maximum number of radio resource units per timeslot or the maximum MCS index. - By using these wireless parameter limits, the method aims to reduce load spikes that can lead to violations of real-time deadlines for the data traffic processing.

Abstract

A method for utilizing computing resources in a vRAN is described. A predicted resource load is determined for data traffic processing of wireless communication channels served by the vRAN using a trained neural network model. The data traffic processing comprises at least one of PHY data processing or MAC processing for a 5G RAN. Computing resources are allocated for the data traffic processing based on the predicted resource load. Wireless parameter limits are determined for the wireless communication channels that constrain utilization of the allocated computing resources using the trained neural network model, including setting one or more of a maximum number of radio resource units per timeslot or a maximum MCS index for the wireless parameter limits. The data traffic processing is performed using the wireless parameter limits to reduce load spikes that cause a violation of real-time deadlines for the data traffic processing.

SCHEDULING SATELLITE DATA TRANSMISSIONS USING DIFFERING SETS OF GROUND STATIONS (18362901)

Main Inventor

Deepak VASISHT

Brief explanation

- The patent application describes a method for transmitting data from a satellite using a combination of ground stations.

- The ground stations are configured to both transmit and receive data, while a set of other ground stations are configured only to receive data from the satellite. - The orbit of the satellite is determined over a specific period of time, and a subset of ground stations that can receive data but not transmit to the satellite is identified based on the satellite's orbit. - A transmission schedule is then generated, specifying the time intervals during which the satellite is within communication range of each ground station in the subset. - An expected transmission rate is estimated for each ground station, and this information is also included in the transmission schedule. - The transmission schedule is provided to the satellite via another ground station that can both transmit and receive data. - The satellite is then configured to transmit data to the subset of ground stations based on the transmission schedule.

Abstract

The disclosure herein describes transmitting data from a satellite using a ground station configured to both transmit and receive, and a set of ground stations configured to receive data from a satellite. An orbit of the satellite is determined over a schedule period and a subset of ground stations configured to receive data and not transmit data to the satellite is identified based on the determined orbit of the satellite. A transmission schedule associated with the satellite is then generated. For each ground station of the subset, a time interval during which the satellite is within communication range is determined, an expected transmission rate is estimated, and the time interval and the expected transmission rate are included in the transmission schedule. The transmission schedule is provided to the satellite via another ground station configured to both transmit and receive, whereby the satellite is configured to transmit data to the subset of ground stations based on the transmission schedule.

Electronic Prototyping (17849305)

Main Inventor

Stephen Edward HODGES

Brief explanation

The patent application describes electronic prototyping platforms.

• The platform includes an electrically insulative substrate with visible orientation features on both sides.
• It has three mounting holes, each bordered by an electrical conductor associated with data transmission, electrical ground, and electrical power.
• The substrate also has an edge connector tab with three exposed electrically conductive contacts.
• These contacts are connected to the data conductor, ground conductor, and power conductor, and are insulated from each other.

Abstract

The description relates to electronic prototyping platforms. One example can include an electrically insulative substrate having generally opposing first and second major surfaces and that includes an orientation feature that is visible on both of the first and second major surfaces. The example can include a first mounting hole through the substrate that is bordered by a first electrical conductor associated with data transmission. The example can also include a second mounting hole through the substrate that is bordered by a second electrical conductor associated with electrical ground, and a third mounting hole through the substrate that is bordered by a third electrical conductor associated with electrical power. The example can also include an edge connector tab defined by the substrate and having three exposed electrically conductive contacts that are coupled to the data electrical conductor, the ground electrical conductor, and the power electrical conductor and insulated from one another.

FLEXIBLE ELECTROMAGNETIC SHIELDING THAT ATTENUATES ELECTROMAGNETIC INTERFERENCE (17827701)

Main Inventor

Jesse William SANDERS

Brief explanation

- The patent application describes electromagnetic shielding that reduces electromagnetic interference (EMI) within a specific frequency range.

- The shielding consists of a layer of metal (e.g., aluminum foil) and a layer of thermoplastic polymer fabric (e.g., woven polyethylene fabric). - The shielding contains multiple apertures that allow for flexibility and draping over electronic equipment. - The purpose of the shielding is to protect the electronic equipment from EMI by attenuating it by at least a certain threshold amount. - The innovation aims to provide effective EMI protection while maintaining flexibility and ease of use.

Abstract

Described herein is electromagnetic shielding that is configured to attenuate electromagnetic interference (EMI) by at least a threshold amount when the EMI has a frequency within a predefined frequency range. The electromagnetic shielding includes a layer of metal, such as aluminum foil, and a layer of thermoplastic polymer fabric (such as woven polyethylene fabric), where the electromagnetic shielding has several apertures that extend therethrough. The electromagnetic shielding is at least partially draped over electronic equipment that is to be shielded from EMI.