Abstract: Large data sets (e.g., with millions of records) are represented by a heat map within a user interface (UI). Each record in the data set includes a label. The labels of the records are assigned to leaf nodes of a data structure. The leaf nodes are mapped to a grid of cells according to a layout method. Furthermore, values are determined for the cells based on data records having the labels mapped to the cells. A visual property is selected for each cell based on the corresponding value. Since the data labels are stored in leaf nodes that are connected to internal nodes, if a zoom state of the heat map results in a display of a number of data labels that exceeds the number of cells in the grid, values of the cells can be updated according to values determined from the internal nodes without losing the connections between the cells and the underlying leaf nodes.

Abstract: Large data sets (e.g., with millions of records) are represented by a heat map within a user interface (UI). Each record in the data set includes a label. The labels of the records are assigned to leaf nodes of a data structure. The leaf nodes are mapped to a grid of cells according to a layout method. Furthermore, values are determined for the cells based on data records having the labels mapped to the cells. A visual property is selected for each cell based on the corresponding value. Since the data labels are stored in leaf nodes that are connected to internal nodes, if a zoom state of the heat map results in a display of a number of data labels that exceeds the number of cells in the grid, values of the cells can be updated according to values determined from the internal nodes without losing the connections between the cells and the underlying leaf nodes.

Abstract: A method that incorporates teachings of the subject disclosure may include, for example, utilizing a system including at least one processor for determining a video modification plan for a received video stream of a video call session according to the at least one party associated with the video call session, modifying, by the system, a plurality of background images of the received video stream according to the video modification plan to generate a plurality of modified background images, and generating, by the system, a modified video stream according to the plurality of modified background images. Other embodiments are disclosed.

Abstract: A method that incorporates teachings of the subject disclosure may include, for example, utilizing a system including at least one processor for determining a video modification plan for a received video stream of a video call session according to the at least one party associated with the video call session, modifying, by the system, a plurality of background images of the received video stream according to the video modification plan to generate a plurality of modified background images, and generating, by the system, a modified video stream according to the plurality of modified background images. Other embodiments are disclosed.

Abstract: Techniques for analyzing and controlling operation of a system of cooperating processes. A library of system calls used by the processes is replaced by a dynamically-linked library which performs the system calls and also sends messages indicating that the system calls have been performed. The messages are received by a display system which responds to the messages by making a graphical display showing the current state of the system of processes. The graphical display displays the system of processes as a tree. Nodes in the tree represent the processes in the system and resources such as files used by the processes; edges in the tree represent relationships between processes and other processes or resources. Users may control which system calls result in messages, may control the rate at which the display system responds to the messages, and may also control execution of the processes.

Abstract: Techniques for automatically laying out directed graphs with clusters of nodes and free nodes. The techniques produce pictorial representations of the graphs in which a node in a cluster and a free node may belong to the same rank in the graph and nodes belonging to more than one cluster may belong to the same rank. The techniques have been added to the well-known DOT system for laying out directed graphs, and include a recursive technique for ranking nodes of the graph, a technique for ordering nodes within ranks which collapses subclusters into skeletons when the nodes within a cluster are ordered, and a technique for positioning the nodes after they have been ranked and ordered which obtains the x coordinates for the nodes by producing an auxiliary graph which is in effect the original graph "turned on its side" and assigning ranks to the nodes in the auxiliary graph.

Abstract: The present invention relates to a computer-implemented technique for drawing directed graphs providing reduced crossings and improved picture quality. An edge list description provided by a user is processed to produce a ranking of all nodes that minimizes the weighted sum of all edges, an edge cost being the product of its weight and length. Nodes within a ranking are then positioned to reduce edge crossings using a heuristic based on node positions in adjacent ranks. Such heuristic uses a generalized median as a weighting function plus node transposition to avoid senseless edge crossings before proceeding to a next rank. Nodes are then positioned to minimize the weighted sum of horizontal distances among connected nodes. Spline control points are then computed for interconnected nodes, and a code sequence for a drawing is generated.