International Business Machines Corporation

Bruce David D'Amora

Charles Ray Johns

Gordon Clyde Fossum

James Randal Moulic

Ashwini K Nanda

Clifford A Pickover

Brian M O'Connell

Keith R Walker

Andrew R Jones

Swaminathan Balasubramanian

Yu Deng

Neal Martin Keller

John Hans Handy-Bosma

Thomas Winters Fox

Brad William Michael

Daniel Alan Brokenshire

Gabriel Taubin

John Samuel Liberty

Eun Kyung Lee

Sinem Guven Kaya

Giacomo Domeniconi

Hui Kang

Jong Yoon Lee

Xinyu Que

Techniques facilitating anomaly detection and root cause analysis using distributed trace data. In one example, a system can comprise a processor that executes computer executable components stored in memory. The computer executable components comprise: a preprocessing component; and a monitor component. The preprocessing component can generate a trace frame comprising a vectorized representation of textual trace data produced by microservices of a microservice application. The monitor component can identify a state of the microservice application using the trace frame.

Learning from distributed traces for anomaly detection and root cause analysis

Method and systems for generating an adjacency matrix A and a directional relation graph representing a relationship between one or more diagnostics. The adjacency matrix with all zero's is initialized. One or more entries in the adjacency matrix A are revised by, for each source diagnostic s, decreasing a corresponding count A(s,d) in the adjacency matrix A to decrease a corresponding directional relation in response to the diagnostic s failing and one or more other diagnostics d passing; increasing the corresponding count A(s,d) in the adjacency matrix A to increase the corresponding directional relation in response to the diagnostic s failing and one or more other diagnostics d failing; and maintaining a current value of the corresponding count A(s,d) in the adjacency matrix A in response to the diagnostic s passing or having no corresponding data. The directional relation graph is generated based on the adjacency matrix A.

Selective diagnostics for computing systems

A system and method for accelerating the execution of applications in computing environments. The method includes receiving a request for execution of a plug-in of a computing application and analyzing a network for accelerators for executing the plug-in. The method further includes identifying a designated accelerator residing on a device that is remote from the application and executing the plug-in with the designated accelerator.

Plug-in accelerator

A method, data processing system, and computer program product for associating tags with a person or user. A computer receives a communication file. The computer determines a tag for the communication file to form a communication file association of the tag with the communication file. The computer identifies contact information for a user from the communication file. The computer forms a user association between the user and the tag.

Applying tags from communication files to users

Performing accelerated volume rendering of a scene in a computer system by: loading volumetric data into a first part of a system memory, the volumetric data represented as a three-dimensional array of data values; determining intersection points of each of a set of sample rays cast through the scene and intersecting the three-dimensional array, wherein the intersection points are determined as a function of sample times from beginning to end; using the intersection points, computing a subset of the three-dimensional array for placement into local storage; loading the subset of three-dimensional array into the local storage; and repeating the determining, computing, and loading acts for all sample times from beginning to end for all sets of sample rays cast by the processor device.

Accelerated volume rendering

The present invention provides a method, system, and computer program product for displaying images of conference call participants. A method in accordance with an embodiment of the present invention includes receiving a call from a user to join a conference call, obtaining a phone number of the user, matching the phone number to a stored graphical representation, and distributing and displaying the matching graphical representation to a predetermined set of users. A voice identification/recognition process can also be used to match the user to a stored graphical representation.

Displaying images of conference call participants

A method, apparatus, and computer implemented instructions for generating antialiased lines for display in a data processing system. Graphics data is received for display, wherein the graphics data includes primitives defining lines. A gamma correction is applied to the graphics data on a per primitive basis to form antialiased lines. The antialiased lines are displayed.

Method and apparatus for generating gammacorrected antialiased lines

A structure and method comprises a data structure representing a characteristic of an object in the virtual interactive environment. The device further comprises a client simulator to perform a first simulation of the characteristic of the object in the virtual interactive environment and a server simulator to perform a second simulation of the characteristic of the object in the virtual interactive environment. The device further comprises a synchronizer to synchronize the first and the second simulations.

System and apparatus for managing latency-sensitive interaction in virtual environments

Method, system, and computer program product for displaying images of conference call participants

A quantization transform, corresponding to a geometric object, is determined. The geometric object represents at least a portion of an object in a three-dimensional scene. The quantization transform is suitable for converting a floating point space to a fixed point space, where the floating point space contains floating point data corresponding to the geometric object. The quantization transform is used to convert floating point data to fixed point data. The floating point data is typically vertices corresponding to the geometric object. Additionally, a quantization transform corresponding to a geometric object is determined. The geometric object represents at least a portion of the three-dimensional scene. The quantization transform is suitable for converting a floating point space to a fixed point space, and the fixed point space contains one or more fixed point data corresponding to the geometric object. The floating point space defines at least the portion of the three-dimensional scene. At least the quantization transform is applied to the one or more fixed point data.

Techniques for representing 3D scenes using fixed point data

A fully programmable graphics processing engine is provided. The graphics processing engine includes three independent, programmable processors that run independent sets of instructions from independent instruction storage facilities. Graphics processing tasks may be distributed among the serially pipelined processors to allow for load balancing and parallel processing. The graphics processing engine may be a graphics co-processing core within a larger, general purpose computing system. Register files and storage units may be addressable by the system host processor. Each processor accepts incoming data for state or context updates. Each processor may execute a specific graphics processing function by executing a set of instructions when a predetermined memory address is accessed.

Programmable graphics processing engine

A computer system, method, and article of manufacture for shading graphical objects and/or displays is disclosed. A graphical geometric data structure has a plurality of vertex positions defining one or more polygons, typically triangles. In a preferred embodiment, the polygons define a wireframe representation of a geometric object. Each of the vertex positions is associated with one or more sets of vertex color information. A color table has one or more fill colors to be rendered (shaded) between two or more of the vertex positions on a rendering of the geometric object. These colors can uniformly vary between the vertices of the triangle over the entire surface. A substitute color is associated with each of the fill colors so that at least two of the fill colors are associated with the same substitute color.

System, method, and article of manufacture for shading computer graphics

The present invention provides methods, apparatus and systems for enabling real-time lighting of 3D geometric models. While these are well-suited for all processors, these are particularly useful on low power processors typically found in PDAs, cell phones, and embedded display systems. Methods+presented utilize a preprocessing scale factor and real-time shift factor to efficiently calculate diffuse lighting intensities for the bound vertices of the geometric model. An example embodiment includes scaling first digitized data of a 3D model in a floating point datatype by a scaling factor to form scaled digitized data. The scaling factor being a proper power of two. Converting said scaled digitized data into an integer datatype forming second digitized data. Enabling a transfer of said second digitized data to a display system, and facilitating lighting and shading said second format of digitized data.

Fast lighting processors

Apparatus and methods are provided to perform volume rendering via composited texture-mapped convex polyhedra. This is accomplished by generating a sequence of z polygons defined by the intersection of a sequence of z planes parallel to the view plane with the convex polyhedron. The vertices of the convex polyhedron are numbered sequentially based on z-axis depth and this defines a sequence of slabs that are bounded by z planes intersecting the vertices. The edges of the convex polyhedron are numbered based on viewing the polyhedron along an axis from the closest vertex to the furthest vertex. A data structure maintains a list of active edges for each slab, where an edge is &ldquo;active&rdquo; if the edge intersects any z plane in the slab. Each vertex in the z polygon is defined by the intersection of an active edge with the z plane. The z polygon is rendered by connecting adjacent vertices, where the ordering is determined by the order of the active edges in the slab. Each edge of the z polygon can be rendered by performing only three multiplications, two additions, and one subtraction. These computationally efficient methods make volume rendering via texture mapping feasible.

Growing community of inventors

New Milford, CT, United States of America

Bruce David D'Amora