At+t Corp.

At&t Intellectual Property I, LP

Lucent Technologies Inc.

At&t Bell Laboratories

Merck Sharp + Dohme Corp.

Stephen Charles North

Daniel Keim

Christian Panse

Christopher Volinsky

Yehuda Koren

Christopher W Rice

John F Murray

Kiem-Phong Vo

Shankar Krishnan

David J Tabacco

Glenn Stephen Fowler

David B Hurry

David G Korn

Emden Gansner

Elefterios Koutsofios

Eleftherios Koutsofios

Emden R Gansner

Russell N Truscott

Gordon Charles McNeal Woodhull

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.

Displaying large data sets in a heat map

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.

Apparatus and method for modification of telecommunication video content

A method and apparatus for measuring and extracting proximity in networks are disclosed. In one embodiment, the present method receives a network from a user for analysis and extraction of a smaller proximity sub-graph. The method computes a candidate sub-graph and determines at least one Cycle Free Escape Conductivity (CFEC) proximity of at least two nodes in accordance with the candidate sub-graph. The method then extracts and presents a proximity sub-graph that best captures the proximity.

Method and apparatus for measuring and extracting proximity in networks

A system, method and computer-readable media are disclosed for generating an image from another image of contiguous polygons and a vector containing values to which areas of corresponding polygons are scaled. The method embodiment relates to generating an image from a plurality of contiguous polygons having vertices. The method comprises calculating a shape value associated with a polygon, calculating an altered shape value associated with an altered polygon, the altered polygon being an altered version of the polygon, calculating a shape distortion by comparing the shape value and the altered shape value and determining whether to accept the altered polygon based on the calculated shape distortion.

System and method for contiguous images from polygons

The present invention is directed to a new visualization platform for the interactive exploration of large datasets. The present invention integrates a collection of relevant visualization techniques to provide a new visual metaphor for viewing large datasets. It is capable of providing comprehensive support for data exploration, integrating large-scale data visualization with querying, browsing, and statistical evaluation. A variety of techniques are utilized to minimize processing delays and the use of system resources, including processing pipelines, direct IO, memory mapping, and dynamic linking of 'on-the-fly' generated code.

System and method for large-scale data visualization

The present invention is a method for generating cartograms using a base map of contiguous polygons and a vector containing values to which areas of corresponding polygons are scaled. The general problem is intractable, so an iterative heuristic is proposed. The heuristic is based on 'scanlines.' The scanlines may be defined automatically (typically, by placing a grid over the map) or entered manually (to provide finer control over the results). At each step, one scanline is chosen and a new candidate map is made by adjusting the vertices of polygons intersected by the scanline, moving them orthogonally to the scanline. A candidate solution is accepted if it improves the solution and preserves the input mesh's topology. Improvement depends on metrics for area and shape error. The solver is run until the improvement falls below some threshold, or a time limit or maximum number of iterations is reached The method determines shape error created by a candidate iterative step by first estimating a curvature function of the polygon and then performing a Fourier transform on the function to yield a shape representation that is relatively independent of scale, translation and rotation of the polygon. The proposed iterative step is accepted or discarded based in part on the magnitude of the resulting shape error.

Method for generating contiguous cartograms

The present invention discloses a convenient framework for container applications and controls. A customizable embeddable container is provided, and client objects of the container may be positioned dynamically by an external layout agent. The container manages toolbars and user interface modes, integrating disparate components into a single consistent interface. Group repositories of related objects for data transfer operations such as cut-and-paste, drag-and-drop, save-and-load, can be supported. The present invention advantageously does not rely on large external libraries and, thus, is relatively lightweight.

Method and system for creating dynamic interfaces using a general control container

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.

Apparatus and methods for visualizing operation of a system of processes

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.

Graphs employing clusters

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.

Growing community of inventors

Lebanon, NJ, United States of America

Stephen Charles North