G06Q10/101

ESCALATION MANAGEMENT AND JOURNEY MINING
20230050135 · 2023-02-16 · ·

The journeys and/or timelines of multiple customers may be used in escalation management and/or journey mining. An event of interest, pertaining to an issue or an incident, on a timeline may be used in the escalation management and/or journey mining. Escalation management is directed to addressing and resolving incidents, problems, and customer situations which could result in a high level of customer dissatisfaction or damage to a service provider's reputation, using the appropriate response and/or resources. Journey mining is directed to using patterns across customers and their journeys to determine where things in the journey went differently than what was expected.

DISTRIBUTED COMMAND EXECUTION IN MULTI-LOCATION STUDIO ENVIRONMENTS

A content production management system within a distributed studio environment includes a command interface module and a command queue management module. The command interface module is configured to render a user interface for a set of content production entities associated with a set of content production volumes within the distributed studio environment. The command queue management module, upon execution of software instructions, is configured to perform the operations of receiving, from the command interface module, a command targeting a target content production entity, assigning a synchronized execution time to the command, enqueueing the command into a command queue associated with the target content production entity according to the synchronized execution time, and enabling the target content production entity to execute the command from the command queue according to the synchronized execution time.

System, method, and computer program product for finding and analyzing deadlock conditions associated with the formal verification of an electronic circuit design

The present disclosure relates to a method for electronic circuit design. Embodiments may include receiving, using a processor, an electronic circuit design and performing a deadlock check on the electronic circuit design using a using a linear temporal logic property and a proof engine. Embodiments may further include analyzing a counterexample associated with the electronic circuit design for a loop escape condition, wherein analyzing includes proving a cover trace of a liveness obligation. If the loop escape condition is reachable from the counterexample, embodiments may include extracting one or more events associated with the loop escape condition and adding a waiver constraint to the deadlock check to force a no deadlock outcome.

Scoring members of a set dependent on eliciting preference data amongst subsets selected according to a height-balanced tree
11580083 · 2023-02-14 ·

A software voting or prediction system iteratively solicits participant preferences between members of a set, with a binary tree built used to minimize the number of iterations required. As each member of the set is considered, it is pairwise-compared with select members represented by nodes already in the binary tree, with iterations beginning at a root node of the tree and continuing to a leaf node. The newly considered member is placed as a new leaf node, and the tree is height-rebalanced as appropriate. Red-black tree coloring and tree rotation rules are optionally used for this purpose. Yes/no preference tallies are kept for each member of the set throughout the tree-building process and are ultimately used for scoring. Height-rebalancing of the tree helps minimize the number of iterations needed to precisely score each member of the set relative to its alternatives.

Scoring members of a set dependent on eliciting preference data amongst subsets selected according to a height-balanced tree
11580083 · 2023-02-14 ·

A software voting or prediction system iteratively solicits participant preferences between members of a set, with a binary tree built used to minimize the number of iterations required. As each member of the set is considered, it is pairwise-compared with select members represented by nodes already in the binary tree, with iterations beginning at a root node of the tree and continuing to a leaf node. The newly considered member is placed as a new leaf node, and the tree is height-rebalanced as appropriate. Red-black tree coloring and tree rotation rules are optionally used for this purpose. Yes/no preference tallies are kept for each member of the set throughout the tree-building process and are ultimately used for scoring. Height-rebalancing of the tree helps minimize the number of iterations needed to precisely score each member of the set relative to its alternatives.

Multi-user media presentation system
11582182 · 2023-02-14 · ·

One or more embodiments of the disclosure provide systems and methods for providing media presentations to users of a media presentation system. A media presentation generally includes a plurality of media segments provided by multiple users of the media presentation system. In one or more embodiments, a user of the media presentation system may share a media presentation with a co-user. The media presentation system can provide a number of features to assist a user in sharing, filtering, and accessing media presentations.

Contact creation and utilization

Non-limiting examples of the present disclosure describe creation and management of a contact associated with a document. A contact for a document in a first application may be created. The contact may be used to add content, from a second application, to the document. The contact may be stored. Contact data for the contact may be transmitted to one or more processing devices. An exemplary created contact may be used to transfer content from one or more applications to a document of another application. Other examples are also described.

Contact creation and utilization

Non-limiting examples of the present disclosure describe creation and management of a contact associated with a document. A contact for a document in a first application may be created. The contact may be used to add content, from a second application, to the document. The contact may be stored. Contact data for the contact may be transmitted to one or more processing devices. An exemplary created contact may be used to transfer content from one or more applications to a document of another application. Other examples are also described.

SYSTEMS AND METHODS FOR CREATING SHARABLE MEDIA ALBUMS
20230039684 · 2023-02-09 ·

The disclosed computer-implemented method may include (i) detecting a collection of media files captured by a wearable media device, (ii) determining a selection of the media files representing a common set of user experiences accumulated over a continuous period, (iii) grouping the selection of the media files into a customizable container, and (iv) sharing the customizable container with one or more target recipients for viewing within a secure application portal. Various other methods, systems, and computer-readable media are also disclosed.

Methods and systems for facilitating a collaborative work environment
11553011 · 2023-01-10 · ·

The present disclosure describes techniques for facilitating a collaborative work environment. The techniques comprise receiving a request from a first client computing device associated with a first user in the plurality of users to establish a communication with a second user in the plurality of users, the request specifying information associated with the communication; generating and transmitting data to a second client computing device associated with the second user for display of a user interface on the second client computing device, wherein the user interface indicates an invite of communication from the first user, and the user interface comprises information about the first user, the information associated with the communication, and selectable interface elements for accepting or declining the invite; and in response to receiving an indication of acceptance by the second user, establishing a communication channel between the first user and the second user.