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

From WikiPatents
Revision as of 17:29, 10 November 2023 by Wikipatents (talk | contribs) (Creating a new page)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Contents

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

AUTOMATIC GENERATION OF FASHION MANUFACTURING TECH PACKS FROM IMAGES USING COMPUTER VISION (17850915)

Main Inventor

Yan Mui Kitty YEUNG


Brief explanation

- The patent application describes techniques for analyzing a garment design to create technical specifications for manufacturing.

- Computer vision technologies are used to identify fabrics, materials, and components of the garment. - The identified aspects of the garment are analyzed for errors or inconsistencies. - Designers are prompted to resolve any errors in the garment design. - The confirmed specifications are exported to a tech pack that includes a bill of materials, panel lists, and annotations. - The tech pack can be used by clothing manufacturers to configure machines for garment production.

Abstract

The techniques disclosed herein analyze a garment design to create, verify, and package technical specifications usable by a manufacturer to produce a garment. Computer vision technologies are applied to an image of the garment to identify fabrics and other materials, notions such as zippers, buttons, drawstrings, etc., and individual panels that will be cut and sewn together to produce the garment. In some configurations, the identified aspects of the garment are analyzed for inconsistencies, omissions, or other errors. A designer of the garment may be prompted to resolve any errors. The confirmed specifications are then exported to a tech pack that conforms to the standards of a manufacturer, including a bill of materials, a list of panels to be cut, and annotations confirming the intent of the designer. A clothing manufacturer may then use the tech pack to configure machines to produce the garment.

ANOMALY DETECTION FOR SENSOR SYSTEMS (18004875)

Main Inventor

Nadav Shlomo BEN AMRAM


Brief explanation

The patent application describes an apparatus and method for improving the quality of a sensor signal by using an AI-based anomaly detector. 
  • An AI-based anomaly detector is used to recognize anomalies in a sensor output data stream.
  • The approach helps in predicting and identifying rare anomaly signals that are not effectively handled by noise removal algorithms.
  • The detected anomalies can assist subsequent algorithms in making better decisions in real-time to handle anomalous samples more effectively.

Abstract

An apparatus and method for improving signal quality of a sensor signal, wherein an AI-based anomaly detector is configured to recognize an anomaly in a sensor output data stream. This approach can be used to predict and identify rare anomaly signals that are not handled properly by noise removal algorithms and help subsequent algorithms to get better decisions on the fly to better handle anomalous samples.

METHOD AND SYSTEM OF MANAGING AND DISPLAYING DOCUMENT ANNOTATION SURFACES (17740277)

Main Inventor

Theo LORRAIN-HALE


Brief explanation

- The patent application describes a method for managing annotation surfaces for a document.

- The method involves receiving a request to add a note to a document. - A first user interface (UI) surface is displayed for the note, which includes an editable surface that can be edited by multiple users. - The first UI surface allows real-time visibility of content to the multiple users. - A second UI surface, specifically for comments, is attached to the first UI surface. - The second UI surface requires user action for posting the comment. - The innovation enables collaborative annotation and commenting on documents in real-time.

Abstract

A method for managing annotation surfaces for a document includes receiving a request to add a note to a document, displaying a first user interface (UI) surface for the note, the first UI surface including an editable surface that is editable by a plurality of users and the first UI surface enabling visibility of content to the plurality of users in real-time, and attaching a second UI surface to the first UI surface, the second UI surface being a UI surface for a comment and the second surface UI surface requiring user action for posting the comment.

ENCODING SYSTEM DATA IN PARITY SYMBOLS (17848774)

Main Inventor

Majid Anaraki NEMATI


Brief explanation

A RAM chip with host dies and parity dies is described in this patent application. The chip has limited storage capacity, so a memory controller is used to encode system data into the parity symbols of the parity dies. This allows for storing more data than what the host dies can accommodate. When the system data needs to be retrieved, the parity symbols are decoded, and the original system data is identified from the decoded information.
  • RAM chip with host dies and parity dies
  • Memory controller encodes system data into parity symbols
  • Allows for storing more data than the host dies' storage capacity
  • Parity symbols are decoded to retrieve the system data
  • Original system data is identified from the decoded information

Abstract

A RAM chip includes host dies and parity dies. A memory controller receives system data to be stored on the RAM chip that is in excess of the storage capacity of the host dies. The memory controller encodes the system data in the parity symbols of the parity dies. The system data is retrieved by decoding the parity symbols and identifying the system data from the decoded information.

EXTERNALLY-INITIATED RUNTIME TYPE EXTENSION (17740267)

Main Inventor

Aaron Reid ROBINSON


Brief explanation

- The abstract describes a method for externally extending a type managed by a runtime environment.

- This extension is initiated by third-party code that is not a part of the runtime component. - The extension is achieved by supplying a subject interface to the type and providing an implementation for that interface. - The runtime environment is instructed to use the supplied interface and implementation to extend the type. - Once extended, the interface becomes available to other computing entities using the type.

Abstract

Externally-initiated extension of a type that is managed by a runtime environment. As an example, third-party code that is not a runtime component may itself cause a type to be extended by causing a subject interface to be supplied to the type while also providing an implementation for that interface. The extension occurs by identifying a subject interface to supply to a type that is managed by the runtime environment, providing an implementation of the interface to the runtime environment, and instructing the runtime environment to supply the subject interface to the type using the implementation. The interface is thereafter available to computing entities that use the type.

CODE CONTEXT ASSEMBLY (17740164)

Main Inventor

Albert ZIEGLER


Brief explanation

- The patent application describes a computer system that can identify a cursor position in an editor where a code file is displayed.

- The system can also identify one or more wish items based on the cursor position or metadata associated with the code file. - It can then identify relevant portions of text from the wish items that are related to the text immediately preceding the cursor. - The system prioritizes these relevant portions of text to find the most relevant one. - Based on this most relevant portion of text, the system generates a second portion of text and suggests that it be entered at the cursor position.

Abstract

A computer system is configured to identify a position of a cursor in an editor where a code file is displayed and identify one or more wish items based on the position of the cursor or metadata associated with the code file. The computer system is further configured to identify one or more first portions of text from the one or more wish items that are relevant to text immediately preceding the cursor, and prioritize the one or more first portions of text to identify a particular first portion of text that is most relevant to the text immediately preceding the cursor. The computer system then generates a second portion of text based on the particular first portion of text and suggest that the second portion of text be entered at the cursor.

SOFTWARE DEVELOPMENT ENVIRONMENT PREBUILD TRIGGERED BY ENVIRONMENT CHANGE COMMITS (17735829)

Main Inventor

Anthony VAN DER HOORN


Brief explanation

- The patent application describes a computer system that can identify a software development environment (SDE) and generate a prebuild of the SDE.

- The computer system obtains data related to the state of the SDE and generates a hash based on this data. - It can then identify a commit (a change made to the SDE) and determine if it has changed the state of the SDE by generating a new hash and comparing it to the previous hash. - If the commit has changed the state of the SDE, the computer system generates a new prebuild of the SDE. - The innovation here lies in the automated process of identifying the SDE, tracking changes to its state, and generating prebuilds accordingly.

Abstract

A computer system is configured to identify a software development environment (SDE), and generate a first prebuild of the SDE. The computer system is further configured to obtain data associated with a plurality of elements that are related to a state of the SDE, and generate a first hash based on data associated with the plurality of elements. The computer system is also configured to identify a commit to the SDE and determine that the commit changed the state of SDE by obtaining data associated with the plurality of elements, generating a second hash based on the data, and determining that the second hash is different from the first hash. In response to determining that the first commit changed the state of the SDE, the computer system then generates a second prebuild of the SDE.

MACHINE LEARNING MODEL MANAGEMENT AND SOFTWARE DEVELOPMENT INTEGRATION (17738110)

Main Inventor

Patrick W. J. EVANS


Brief explanation

- The patent application describes a method for automatically generating a model wrapper for a machine learning (ML) model identified within the source code of a software project.

- This model wrapper can be used during the compilation and execution of the software code, making it easier to integrate ML models into software projects. - A representative object is also generated to manage the ML model during the software development process, allowing for easier management and manipulation of the model attributes. - The runtime library associated with the ML model is automatically included in the software project, simplifying the integration process. - The training of the ML model can also be automatically initiated, ensuring that the model is up-to-date and accurate. - In cases where the ML model is still being trained, a placeholder or partially trained model can be used during software development, allowing for continued development without waiting for the model to be fully trained.

Abstract

In examples, a declaration of an ML model is identified within source code of a software project. As a result, a model wrapper may be generated for the ML model and used when compiling and/or executing the software code. Further, a representative object may be generated to enable management of the ML model during the software development process. As an example, model attributes associated with the ML model may be identified from the software code and used to manage the ML model accordingly. In examples, a runtime library associated with the ML model may be automatically included in the software project and/or training of the ML model may be automatically initiated. In some instances, a placeholder ML model or a partially trained or intermediate ML model may be used when building and executing the software project while the ML model is still being trained, thereby enabling continued software development.

USER ENGAGEMENT SURFACED THROUGH AN APPLICATION PROGRAMMING INTERFACE (API) (17850794)

Main Inventor

Ugan SIVAGNANENTHIRARAJAH


Brief explanation

- This patent application describes a system for detecting user engagement with a computing device.

- User engagement is determined by a sensor, such as a camera, that detects if the user's face is facing the display device. - If the user is not facing the display device, the sensor determines that the user is unengaged. - The computing device can then perform power-saving operations, such as dimming the display, when the user is unengaged. - The computing device includes an API that abstracts the sensor data into a user engagement signal. - The operating system and applications on the computing device can use this user engagement signal to take appropriate actions without directly communicating with the sensor. - The user engagement signal can be used as an input to a state machine for further processing.

Abstract

User engagement is detected and used to control operation of a computing device. User engagement is detected by a sensor such as a camera that identifies if a user's face is oriented towards a display device. If the user is not facing the display device, the sensor determines that the user is unengaged. The computing device is thus able to perform a power-saving operation, such as dimming the display device, when the user is unengaged. The computing device includes an API that abstracts sensor data into a user engagement signal indicating that the user is either engaged or unengaged. The OS and applications running on the computing device act on the user engagement signal provided by the API without communicating directly with the sensor. The user engagement signal may be provided as an input to a state machine.

OPERATING SYSTEM PARTITIONING OF DIFFERENT USERS FOR SINGLE-USER APPLICATIONS (18354216)

Main Inventor

Xiaoxi HAN


Brief explanation

- The patent application describes a computer device that can partition application files for multiple users.

- When installing an application package, the computer device creates a separate location for each user. - The application package includes read-only files for the first user. - The computer device uses filter drivers to project the installed package files into the user-specific location. - If there are any modifications made to the files in the user-specific location, the computer device writes them there. - During the execution of the application by the first user, the modified files are loaded from their user-specific location.

Abstract

Examples described herein generally relate to a computer device including a memory, and at least one processor configured to partition application files for multiple users of the computer device. The computer device creates a per-user location for a first user when installing an application package to an installation location. The application package includes a plurality of files for an application that are read-only for the first user. The computer device projects, via one or more filter drivers, installed package files from the installation location into the per-user location. The computer device receives a modification to the plurality of files for the application projected into the per-user location. The computer device writes at least one modified file into the per-user location. The computer device loads, during execution of the application by the first user, the at least one modified file from the per-user location for the first user.

PREDICTING EXPANSION FAILURES AND DEFRAGMENTING CLUSTER RESOURCES (18355033)

Main Inventor

Shandan ZHOU


Brief explanation

- The patent application is about systems, methods, and computer readable media for predicting expansion failures and implementing defragmentation instructions.

- The systems use a failure prediction model to determine the likelihood of deployment failures on a node cluster. - Defragmentation instructions are generated to prevent expansion failures while minimizing negative customer impacts. - The defragmentation instructions are specific to each node cluster, allowing the cloud computing system to minimize expansion failures and increase resource capacity. - The innovation aims to reduce costs and provide reliable services to customers.

Abstract

The present disclosure relates to systems, methods, and computer readable media for predicting expansion failures and implementing defragmentation instructions based on the predicted expansion failures and other signals. For example, systems disclosed herein may apply a failure prediction model to determine an expansion failure prediction associated with an estimated likelihood that deployment failures will occur on a node cluster. The systems disclosed herein may further generate defragmentation instructions indicating a severity level that a defragmentation engine may execute on a cluster level to prevent expansion failures while minimizing negative customer impacts. By uniquely generating defragmentation instructions for each node cluster, a cloud computing system can minimize expansion failures, increase resource capacity, reduce costs, and provide access to reliable services to customers.

ALERT RULE EVALUATION FOR MONITORING OF LATE ARRIVING DATA (18299253)

Main Inventor

Yaniv LAVI


Brief explanation

The patent application describes a monitoring system that can distinguish between two types of alert rules and apply different evaluation methods to each type. 
  • The system addresses the issue of latent data ingestion in alert rule evaluation.
  • It tailors the evaluation method based on the type of alert rule, optimizing alert latency, accuracy, and cost of goods sold.
  • A machine learning model is used to classify a query associated with an alert rule as either increasing or non-increasing.
  • Based on the query classification and a condition associated with the alert rule, the system determines if the rule is invariant or variant.

Abstract

A monitoring system is configured to distinguish between two types of alert rules— namely, invariant alert rules and variant alert rules—and to apply a different method of alert rule evaluation to each, wherein each alert rule evaluation method deals with the issue of latent data ingestion in a different way. By tailoring the alert rule evaluation method to the type of alert rule being evaluated, the system can apply an optimized approach for each type of alert rule in terms of achieving a trade-off between alert latency, alert accuracy, and cost of goods sold. In an embodiment, the system utilizes a machine learning model to classify a query associated with an alert rule as either increasing or non-increasing. Then, based on the query classification and a condition associated with the alert rule, the system determines if the alert rule is invariant or variant.

ENABLING EXCHANGE OF CONVERSATIONAL BOT SKILLS DURING CONVERSATIONAL CHAT (18350661)

Main Inventor

Christopher Lee MULLINS


Brief explanation

This patent application describes systems, methods, and devices for enabling conversational bot communications. Here are the key points:
  • The system maintains a marketplace with a variety of skills, each associated with a manifest and a conversational bot.
  • When a request for a specific skill is received, the system identifies multiple conversational bots that can execute that skill.
  • The system ranks the conversational bots based on certain criteria.
  • The highest ranked conversational bot is selected to execute the specific skill.
  • In some cases, multiple highest ranked conversational bots may be presented, and the user can choose which one executes the skill.

Abstract

In non-limiting examples of the present disclosure, systems, methods, and devices for enabling conversational bot communications are presented. A marketplace comprising an identity of a plurality of skills may be maintained, each of the plurality of skills associated with a manifest and a conversational bot. A request for execution of a specific skill may be received. A plurality of conversational bots may be identified, each of the plurality of conversational bots being associated with a manifest for executing the specific skill. The plurality of conversational bots may be ranked. The specific skill may be caused to be executed by the highest ranked conversational bot. In some examples, a plurality of highest ranked conversational bots may be surfaced and a bot that is selected may execute the specific skill.

Threat Hunting Across Datacenters To Identify Security Incidents (17739366)

Main Inventor

Sekhar Poornananda CHINTALAPATI


Brief explanation

- The patent application describes techniques for generating an identifier index table (IIT) and executing queries.

- The IIT is used to map different labels used in various data sources to a commonly defined data type. - The IIT is then used to generate executable queries based on the selected data type and search for indicators of compromise (IOC) in the data sources. - The results of the queries are analyzed to identify the IOC.

Abstract

Techniques for generating an identifier index table (IIT) and for executing queries are disclosed. The IIT maps different labels used among different data sources to a commonly defined data type. The IIT is used to generate a set of queries that are executable based on selection of the commonly defined data type and that are executable against the different data sources to search for an indicator of compromise (IOC) within the different data sources. The results from the queries are analyzed in an attempt to identify the IOC.

ASYNCHRONOUS AUTHORIZATION OF APPLICATION ACCESS TO RESOURCES (18355290)

Main Inventor

Jeffrey Thomas SAKOWICZ


Brief explanation

The patent application describes an apparatus that allows applications to request access to a resource.
  • The apparatus includes a processor that records the access request in a data store.
  • An authorized entity is identified to evaluate the request.
  • The authorized entity is notified to evaluate the request asynchronously, meaning they can evaluate it at a later time.
  • The processor checks if a response is received from the authorized entity.
  • If a response is received, the request is either rejected or granted based on the response.
  • The record of the request is cleared from the data store.

Abstract

According to examples, an apparatus may include a processor that may access a request for access by an application to a resource and may record the request in a data store. The processor may also identify an authorized entity to evaluate the request and output a notification to the authorized entity to evaluate the request, in which the authorized entity is to evaluate the request asynchronously with submission of the request by the application. In addition, the processor may determine whether a response is received from the authorized entity and, based on a determination that the response is received, may reject or grant the request based on the response and clear the record of the request from the data store.

METHOD AND SYSTEM TO EXTRACT DATA DEPENDENCIES FOR MACHINE LEARNING MODELS (17738851)

Main Inventor

Laurent BOUE


Brief explanation

The patent application describes techniques for detecting anomalies in machine learning models using sparse judgmental samples. 
  • Techniques involve analyzing the textual representation of a machine learning model and generating a set of tokens using lexical analysis.
  • The tokens are then used to create an abstract syntax tree (AST) that represents the structure of the machine learning model.
  • The AST helps identify data dependencies within the model, indicating which data sources are used by the model.
  • Potential issues with the data sources are detected, and alert notifications are sent based on the identified data dependencies.

Abstract

Example aspects include techniques for anomaly detection via sparse judgmental samples. These techniques may include generating, via lexical analysis, a plurality of tokens from a textual representation of a machine learning (ML) model and generating, via a parser, based on the plurality of tokens, an abstract syntax tree (AST) corresponding to the ML model. In addition, the techniques may include identifying a data dependency of the ML model based on an AST node within the AST, the AST node corresponding to a data source and the data dependency indicating the ML model depends on the data source. Further, the techniques may include detecting a potential issue associated with the data source, and transmitting, based on the data dependency, an alert notification in response to the potential issue.

GEOMETRY-BASED COMPRESSION FOR QUANTUM COMPUTING DEVICES (18351666)

Main Inventor

Poulami DAS


Brief explanation

The patent application describes a quantum computing device that uses a surface code lattice and a compression scheme to improve efficiency and accuracy in quantum computations.
  • Quantum computing device with a surface code lattice and logical qubits
  • Surface code lattice is divided into multiple regions based on its geometry
  • Compression engine is connected to each logical qubit to compress syndrome data
  • Compression engine uses a geometry-based compression scheme
  • Decompression engine is connected to each compression engine
  • Decompression engine receives compressed syndrome data and decompresses it
  • Decompressed syndrome data is then sent to a decoder block for further processing

Abstract

A quantum computing device comprises a surface code lattice that includes l logical qubits, where l is a positive integer. The surface code lattice is partitioned into two or more regions based on lattice geometry. A compression engine is coupled to each logical qubit of the l logical qubits. Each compression engine is configured to compress syndrome data generated by the surface code lattice using a geometry-based compression scheme. A decompression engine is coupled to each compression engine. Each decompression engine is configured to receive compressed syndrome data, decompress the received compressed syndrome data, and route the decompressed syndrome data to a decoder block.

MULTISTAGE FEED RANKING SYSTEM WITH METHODOLOGY PROVIDING SCALABLE MULTI-OBJECTIVE MODEL APPROXIMATION (18353789)

Main Inventor

Madhulekha Arunmozhi


Brief explanation

- This patent application describes techniques for approximating a complex multi-objective feed item scoring model with a simpler single objective model in a multistage feed ranking system.

- The goal is to optimize the personalization and ranking of feeds by considering factors such as viewer experience, professional or social network effects, and content creator impact. - The techniques involve using a lightweight single objective model at the first pass ranker stage, which efficiently scores a large set of feed items. - Despite being less complex, the single objective model still maintains much of the richness and complexity of the multi-objective model. - The second pass ranker stage uses the more complex multi-objective model, but with the benefit of high recall due to the efficient scoring done by the first pass ranker. - Overall, these techniques enable effective multi-objective optimization in the ranking system while improving efficiency and maintaining a high level of performance.

Abstract

Approximating a more complex multi-objective feed item scoring model using a less complex single objective feed item scoring model in a multistage feed ranking system of an online service. The disclosed techniques can facilitate multi-objective optimization for personalizing and ranking feeds including balancing personalizing a feed for viewer experience, downstream professional or social network effects, and upstream effects on content creators. The techniques can approximate the multi-objective model—that uses a rich set of machine learning features for scoring feed items at a second pass ranker in the ranking system—with the more lightweight, single objective model—that uses fewer machine learning features at a first pass ranker in the ranking system. The single objective model can more efficiently score a large set of feed items while maintaining much of the multi-objective model's richness and complexity and with high recall at the second pass ranking stage.

SEAT-ASSIGNMENT BASED RESOURCE TRACKING (17737309)

Main Inventor

Wilco Gerardus Bernardus BAUWER


Brief explanation

- The patent application is about a system for tracking the usage of resources under a license.

- The system assigns seats to an account, which represents a license for multiple resources. - An allotment is created within the account and filled with seats. - The seats are automatically authorized to access a portion of the resources. - When a device associated with an authorized seat accesses the resources, the usage is tracked.

Abstract

Seat-assignment based resource tracking is used to track usage, or consumption, of resources under a license. An account includes a license for a plurality of resources. An allotment is generated under the account and populated with a plurality of seats. Populating the allotment with the plurality of seats automatically authorizes the populated plurality of seats for access to a portion of the plurality of resources. When the plurality of resources are accessed by a device associated with a seat of the authorized plurality of seats, the usage of the plurality of resources by the device is tracked.

CONTROLLABLE IMAGE GENERATION (18354485)

Main Inventor

Marek Adam KOWALSKI


Brief explanation

The patent application describes a method of image processing that involves storing a real image of a specific object in memory.
  • Real image of an object is stored in memory

The method uses a first encoder to compute a factorized embedding of the real image.

  • First encoder is used to compute a factorized embedding of the real image

The method receives a value of at least one parameter from a synthetic image rendering apparatus, which controls an attribute of synthetic images of objects of the specified type.

  • Value of at least one parameter is received from a synthetic image rendering apparatus

A second encoder is used to compute an embedding factor based on the received value.

  • Second encoder is used to compute an embedding factor based on the received value

The factorized embedding is then modified with the computed embedding factor.

  • Factorized embedding is modified with the computed embedding factor

Using a decoder with the modified embedding as input, the method computes an output image of an object that is similar to the real image, except for the attribute controlled by the parameter.

  • Decoder is used to compute an output image that is similar to the real image, except for the controlled attribute

Abstract

In various examples there is a method of image processing comprising: storing a real image of an object in memory, the object being a specified type of object. The method involves computing, using a first encoder, a factorized embedding of the real image. The method receives a value of at least one parameter of a synthetic image rendering apparatus for rendering synthetic images of objects of the specified type. The parameter controls an attribute of synthetic images of objects rendered by the rendering apparatus. The method computes an embedding factor of the received value using a second encoder. The factorized embedding is modified with the computed embedding factor. The method computes, using a decoder with the modified embedding as input, an output image of an object which is substantially the same as the real image except for the attribute controlled by the parameter.

DIGITAL IMAGE SUB-DIVISION (17662061)

Main Inventor

Yanwei WANG


Brief explanation

The patent application describes a method for processing digital images using a computer.
  • The method involves receiving a digital image captured by a real camera, which has intrinsic and extrinsic parameters.
  • The intrinsic parameters include a native principal point, which is defined relative to the origin of a coordinate system of the digital image.
  • The digital image is divided into multiple sub-images.
  • Each sub-image is associated with a synthesized recapture camera, which has synthesized intrinsic and extrinsic parameters mapped from the real camera.
  • The synthesized intrinsic parameters of the recapture camera also include the native principal point defined relative to the origin of the coordinate system of the sub-image.

Abstract

A digital image processing method performed by a computer is disclosed. A digital image captured by a real camera having intrinsic and extrinsic parameters is received. The intrinsic parameters include a native principal point defined relative to an origin of a coordinate system of the digital image. The digital image is sub-divided into a plurality of sub-images. For each sub-image of the plurality of sub-images, the sub-image is associated with a synthesized recapture camera having synthesized intrinsic and extrinsic parameters mapped from the real camera. The synthesized intrinsic parameters include the native principal point defined relative to an origin of a coordinate system of the sub-image.

ADAPTIVE SEVERITY FUNCTIONS FOR ALERTS (18355740)

Main Inventor

Yotam LIVNY


Brief explanation

The patent application describes methods, systems, and apparatuses for adaptive severity functions for security alerts.
  • The severity of alerts, particularly security alerts, can be adjusted based on the global security situation.
  • Time and other parameters are taken into consideration to prioritize or reprioritize alerts.
  • Severity levels can be modified based on rules, triggering events, or using severity functions with or without artificial intelligence.
  • The invention aims to provide a more efficient and effective way of managing security alerts.

Abstract

Methods, systems and apparatuses are described herein to provide adaptive severity functions for alerts, particularly security alerts. The adaptive severity functions may be aligned with an existing global security situation to upgrade or downgrade the severity of new and existing alerts. By taking into consideration the time factor along with other parameters, the alerts may be prioritized or reprioritized appropriately. The modification of the severity level for the alerts may be made based on rules and/or one or more triggering events or by using severity functions with or without the aid of artificial intelligence based on best-practice preferences.

DYNAMIC REFRESH RATE SWITCHING (18148413)

Main Inventor

Michael Paul Erich VON HIPPEL


Brief explanation

The patent application describes a technology called Dynamic Refresh Rate (DRR) switching that allows for the dynamic update of the refresh rate of content displayed on a user interface.
  • DRR switching is used to temporarily boost the refresh rate of content presented on an interface.
  • When a request is received to boost the refresh rate, DRR switching is initiated.
  • Applications that have opted in to the higher refresh rate receive signals to refresh their content at the higher rate.
  • Applications that have not opted in to the higher refresh rate receive signals to refresh their content at a virtualized refresh rate that matches the original rate.
  • This allows for a smooth user experience without unnecessarily consuming power.
  • The first application refreshes content at the original refresh rate, while the second application refreshes content at the higher refresh rate.

Abstract

Dynamic refresh rate (DRR) switching is used to dynamically update a refresh rate of content presented on an interface. When a first application and a second application are presented on a user interface at a first refresh rate; a request may be received to temporarily boost the first refresh rate to a second, higher, refresh rate. DRR switching is initiated as the first refresh rate is temporarily boosted to a second refresh rate. Applications that are opted in to the second refresh rate receive signals to refresh content at the second refresh rate, while applications that are not opted in to the second refresh rate receive signals to refresh content at a virtualized refresh rate that matches the first refresh rate. Thus, the first application refreshes content at the first refresh rate and the second application refreshes content at the second, higher refresh rate, providing a smooth user experience without unnecessarily utilizing power consumption.

KEYWORD-BASED DIALOGUE SUMMARIZER (17735663)

Main Inventor

Abedelkader ASI


Brief explanation

- The patent application describes a method for generating dialogue summaries based on keywords.

- The method involves using a machine learning model trained on encodings of the keyword and transcript. - The model generates computer-generated text that is different from the original transcript but still descriptive and associated with the keyword. - The generated text can be included in the displayed transcript and is associated with a selectable item. - Users can select the item to include the generated text in the displayed transcript. - The innovation aims to provide keyword-based dialogue summaries using machine learning techniques.

Abstract

A method of generating keyword-based dialogue summaries is provided. The method includes inputting a transcript of an audio conversation and a keyword into a machine learning model trained based on encodings representing the keyword and the transcript, generating computer-generated text different from and semantically descriptive of the transcript and semantically associated with the keyword, and outputting the computer-generated text in association with a selectable item selectable for inclusion of the computer-generated text in displayed text representing the transcript, the selectable item associated with the keyword.

HOLOGRAPHIC STORAGE (17906793)

Main Inventor

Douglas James KELLY


Brief explanation

The abstract describes a holographic data storage system that includes an emitter system, a holographic recording medium, and an input waveguide network.
  • The holographic recording medium has multiple recording regions that are connected to corresponding out-coupling regions of the input waveguide network.
  • The system is designed to write data from an input beam to the appropriate recording region.
  • A controller is used to control the optical characteristics of the input beam or the guiding elements of the waveguide network.
  • This allows the input beam to be guided from an in-coupling region to any selected out-coupling region.
  • Similar waveguide networks are used for carrying reference and output beams.

Abstract

A holographic data storage system comprises an emitter system, a holographic recording medium, and an input waveguide network formed of one or more multimode optical waveguides. The holographic recording medium has multiple recording regions, each optically coupled to a corresponding one of multiple out-coupling regions of the input waveguide network, the holographic data storage system arranged to persistently write data of an input beam, received at any one of the out-coupling regions, to the corresponding recording region. A controller is coupled to at least one of the emitter system and at least one controllable guiding element of the input waveguide network and controls at least one optical characteristic of the input beam or the at least one guiding element, so as to guide the input beam from an in-coupling region to any selected one of the multiple out-coupling regions. Similar waveguide networks are provided for carrying reference and output beams.

THREADED FASTENER RETENTION DETECTION (17739945)

Main Inventor

Donghwi KIM


Brief explanation

- Portable electronic devices are prone to mechanical stresses due to their frequent repositioning and relocation.

- Rough handling of these devices can cause threaded mechanical fasteners securing the internal components to become dislodged. - Dislodged fasteners can come into contact with electrically conductive features, leading to ground faults or shorts. - This can result in the device malfunctioning, overheating, and becoming a fire hazard. - The disclosed technology detects dislodged fasteners and alerts the user, allowing them to power down the device.

Abstract

Portable electronic devices by their nature are designed to be regularly physically repositioned and relocated, which can cause significant mechanical stresses on internal components, including printed circuit boards (PCBs). This is particularly true when a portable electronic device is handled roughly. These significant mechanical stresses can cause threaded mechanical fasteners securing the PCBs to become dislodged. A dislodged threaded mechanical fastener may contact electrically conductive features of the PCB or other internal components, thereby causing a ground fault or short. At a minimum, this may cause the portable electronic device to not work well, or at all. Further, this may cause the portable electronic device to overheat and become a fire hazard. The presently disclosed technology detects if the threaded mechanical fasteners within a portable electronic device become dislodged. A user of the portable electronic device may then be warned, and the portable electronic device may be powered down.

MONITORING FOR INCONSISTENT LATENCY IN DATA CENTERS (17735501)

Main Inventor

Denizcan BILLOR


Brief explanation

This patent application describes a method for detecting inconsistent latencies in data center environments. 
  • The method involves generating test traffic with encapsulated packets and transmitting them from a source device to a destination device along a specific route.
  • The test traffic is supplied to a bundle of interfaces on the source device, which allows it to be transmitted over multiple physical paths to the destination device.
  • The latencies of the encapsulated packets along the route are identified.
  • Inconsistent latency is identified when there is a deviation from the expected latency across the bundle of interfaces.
  • This method helps in discovering and addressing latency issues in data center networks.

Abstract

Systems, methods, and software are disclosed herein for discovering inconsistent latencies in data center environments. In an implementation, a method for detecting inconsistent latency in a network comprises generating test traffic comprising encapsulated packets to transmit along a route from a source device to a destination device and supplying the test traffic to a bundle of interfaces of the source device to transmit to the destination device over multiple physical paths. The method continues with identifying latencies of the encapsulated packets along the route, and identifying an occurrence of inconsistent latency with respect to the bundle of interfaces based at least on the latencies of the encapsulated packets.

REDUCING PLACEMENT CONFLICTS BETWEEN CONCURRENT VIRTUAL MACHINE ALLOCATIONS (18026295)

Main Inventor

Abhisek PAN


Brief explanation

The patent application is about a system that reduces conflicts between allocation agents responsible for allocating computing resources in a computing zone.
  • The system identifies conflicts between multiple allocation agents processing placement requests.
  • It modifies the placement policy based on the number of conflicts by relaxing restrictions on resource allocation rules.
  • It enlarges the placement zone of server nodes to prevent or minimize conflicts between allocation agents.
  • By reducing restrictions and enlarging the placement zone, the system reduces conflicts while optimizing service placement in a cloud computing system.

Abstract

The present disclosure relates to systems, methods, and computer readable media for reducing placement conflicts between allocation agents tasked with allocating computing resources on a computing zone. For example, systems disclosed herein may identify placement conflicts between multiple allocation agents processing incoming placement requests on a computing zone. The systems disclosed herein may further modify a placement policy based on the number of placement conflicts by reducing one or more restrictions on rules for allocating computing resources. For example, the systems disclosed herein may enlarge a placement zone of server nodes when allocating computing resources to prevent or otherwise reduce conflicts between multiple allocation agents implementing the same placement policies. By reducing allocation restrictions and enlarging a placement zone, the systems described herein may significantly reduce placement conflicts while still optimizing placement of services on nodes of a cloud computing system.

BIDIRECTIONAL MAPPING BETWEEN APPLICATIONS AND NETWORK CONTENT (18105785)

Main Inventor

Zhaowei Charlie JIANG


Brief explanation

- The patent application describes a bidirectional mapping system between network content and application programs.

- This mapping system allows for deep links, which connect specific network content with specific data presentations in an application program. - The identification format for these deep links can be standardized or customized based on declarations from the network content or application program. - A lookup service utilizes this bidirectional mapping to provide functionality to a third-party entity. - The lookup service can identify application programs associated with network content specified by the entity, as well as network content associated with application programs specified by the entity.

Abstract

A bidirectional mapping is established between network content and application programs, based on declarations at both the network content and at the application. Additionally, bidirectional mapping can provide for deep links, which can associate specific network content with a specific presentation of data in an application program. The identification format for such deep links can conform to a predetermined standard or it can be custom implemented according to a format declared either as part of the network content or the application program. The bidirectional mapping is then utilized by a lookup service to provide functionality to a third-party entity. The lookup service can identify, to the entity, application programs associated with network content specified by that entity and network content associated with application programs specified by that entity.

METHOD AND SYSTEM OF MANAGING RESOURCES IN A CLOUD COMPUTING ENVIRONMENT (17736643)

Main Inventor

Kalyan Kumar KONA


Brief explanation

The abstract describes a system and method for deploying virtual machines in a server farm based on the capacity needs of the server farm. 
  • The system receives a request to deploy a new virtual machine (VM) in the server farm.
  • It determines if the cluster configuration property associated with the new VM specifies parameters for the new VM.
  • If parameters are specified, the system retrieves custom SKU parameter information or custom capacity parameter information for the new VM.
  • The system then deploys the new VM to the server farm with the custom SKU parameter or custom capacity parameter.

Abstract

A system and method for deploying virtual machines in a server farm based on capacity needs of the server farm includes receiving a request to deploy a new virtual machine (VM) in the server farm; determining that a cluster configuration property associated with the new VM specifies one or more parameters for the new VM; upon determining that the cluster configuration property associated with the new VM specifies one or more parameters for the new VM, retrieving at least one of a custom SKU parameter information or custom capacity parameter information for the new VM; and deploying the new VM to the server farm with at least one of the custom SKU parameter or custom capacity parameter.

MESSAGE-BASED NOTIFICATION THAT A CALLED PARTY IS BUSY (17740133)

Main Inventor

Tapas Kumar SARKAR


Brief explanation

- The patent application describes a VoLTE network that combines 4G LTE and IMS networks.

- The network includes an application server that sends message-based notifications to user equipment when a previously busy called party is available to accept a new voice call. - The CCBS service signalling flow, which allows for completion of communications to a busy subscriber, is modified in this network. - Instead of automatically calling back the calling party, a notification in the form of an SMS message is sent. - The SMS notification is sent using SIP proxy servers and an IP Short-Message-Gateway between the LTE and IMS networks. - The IP Short-Message-Gateway appears as another application server to the IMS core.

Abstract

A VoLTE (Voice over Long-Term Evolution) network comprising 4G (4 generation) LTE and IMS (Internet Protocol Multimedia Subsystem) networks includes an application server configured to provide message-based notifications to user equipment of a calling party when a previously busy called party is free to accept a new voice call. In an illustrative embodiment, a CCBS (Completion of Communications to Busy Subscriber) service signalling flow described by 3GPP (3 Generation Partnership Project) technical specification TS 24.642 is modified to replace an automated CCBS recall (i.e., call back) to the calling party with a notification comprising an SMS (Short Message Service) message. The SMS notification is sent using Session Initiation Protocol (SIP) proxy servers implementing call session control functions (CSCF) in an IMS core that interoperate with an IP Short-Message-Gateway (IP-SM-GW) between the LTE and IMS networks that appears to the IMS core as another application server.

INTRA-PICTURE PREDICTION USING NON-ADJACENT REFERENCE LINES OF SAMPLE VALUES (18223999)

Main Inventor

Bin Li


Brief explanation

The patent application describes innovations in intra-picture prediction with multiple candidate reference lines available.
  • Intra-picture prediction for a current block uses a non-adjacent reference line of sample values to predict the sample values of the current block.
  • This improves the effectiveness of intra-picture prediction when the adjacent reference line has capture noise, quantization error, or significantly different values due to occlusion.
  • Innovations include intra-picture prediction with multiple candidate reference lines available, encoding/decoding of reference line indices using prediction, filtering of reference sample values, residue compensation, weighted prediction, mode-dependent padding to replace unavailable reference sample values, using in-loop-filtered reference sample values, encoder-side decisions for selecting reference lines, and post-filtering of predicted sample values.

Abstract

Innovations in intra-picture prediction with multiple candidate reference lines available are described herein. For example, intra-picture prediction for a current block uses a non-adjacent reference line of sample values to predict the sample values of the current block. This can improve the effectiveness of the intra-picture prediction when the reference line of sample values that is adjacent the current block includes significant capture noise, significant quantization error, or significantly different values (compared to the current block) due to an occlusion. Innovations described herein include, but are not limited to, the following: intra-picture prediction with multiple candidate reference lines available; encoding/decoding of reference line indices using prediction; filtering of reference sample values; residue compensation; weighted prediction; mode-dependent padding to replace unavailable reference sample values; using in-loop-filtered reference sample values; encoder-side decisions for selecting reference lines; and post-filtering of predicted sample values.

ANOMALOUS ACCESS POINT DETECTION (18225049)

Main Inventor

Amer Aref Hassan


Brief explanation

- The patent application describes methods, systems, devices, and machine-readable mediums for detecting evil twin and other anomalous access points in an IT infrastructure.

- The detection is based on analyzing access point reports from one or more computing devices. - The goal is to identify access points that are not in their expected locations. - The invention aims to enhance the security of IT infrastructures by detecting and alerting the presence of potentially malicious access points. - The methods and systems described in the patent application can help prevent unauthorized access and potential security breaches.

Abstract

Disclosed in some examples are methods, systems, devices, and machine-readable mediums that detect evil twin and other anomalous access points in an IT infrastructure by detecting access points that are not in their expected locations based upon an analysis of access point reports from one or more computing devices.