International Business Machines Corporation

Geodigm Corporation

Nuance Communications, Inc.

Brian Paul Wallenfelt

Charles J Archer

Amanda Peters

Kurt Walter Pinnow

Roy Glenn Musselman

Brent Allen Swartz

Cary Lee Bates

Zachary Adam Garbow

Richard Michael Theis

Timothy Pressler Clark

Michael Craig Marshall

Mark Ervin Olsen

Minh Xuan Nguyen

Donne Joseph Warden

Thomas M Gooding

Kevin Glynn Paterson

Patrick Joseph McCarthy

Minh Xuan Nhuyen

Camesha R Hardwick

Dental prostheses may be manufactured based on electronic models of the prostheses. Manufacturing aids may be used to check manufacturing quality of the dental prosthesis and components thereof. For example, a jig may be used during and after the manufacture of the dental prostheses and systems and methods for using the same. A customized tooth die may be designed and fabricated to fit a dental prosthesis or components thereof in a jig for inspection. A customized jig may be designed and fabricated for inspecting a dental prosthesis or components thereof throughout the manufacturing process.

Dental prosthesis manufacturing aids

Method for manufacturing a dental prosthesis

A method and apparatus provides fault isolation in a in a highly interconnected system. A fault isolator uses a virtual topology of the system to autonomically isolate the fault. Failing nodes interconnects are identified and then used to traverse a virtual topology to determine the most suspect components as the cause of the reported failures. A failure indication is propagated to each component connected to a failing node in the virtual topology until the next node in the virtual topology is encountered. In preferred embodiments, the failure indications for each component are tallied together as the topology is traversed for each failing node and/or component. A total count of the number of nodes connected to each component is determined for a denominator. A weighting of the likelihood of fault is then determined by dividing the failure indications by the total count.

Autonomic fault isolation in a highly interconnected system

The present invention enables users to dynamically manage historical data within documents bearing one or more links, and retain the relationships defined by the links. The present invention tracks the links not just from source documents to destination documents, but also from destination documents back to the source documents, organizes the links in a hierarchical manner based on the content/naming of the links, and displays the link information to the user in a real-time and meaningful way.

Document-based information and uniform resource locator (URL) management

Embodiments of the present invention provide a method, system and article of manufacture for adjusting a language model within a voice recognition system, based on text received from an external application. The external application may supply text representing the words of one participant to a text-based conversation. In such a case, changes may be made to a language model by analyzing the external text received from the external application.

Speech recognition system for providing voice recognition services using a conversational language model

Electronic models of components of dental appliances can be generated based on the outer surface of an electronic model of the dental appliance. The outer surface may be generated based on the dentition and anatomy of the patient. For example, automated processes may identify landmarks in the anatomy and define the outer surface based on the identified landmarks. Alternatively, the outer surface may be generated based on statistical data. A management system coordinates automated processes with interactive processes to facilitate collaboration of remotely located technicians and equipment in generating electronic models.

Dental appliances

A massively parallel nodal computer system periodically collects and broadcasts usage data for an internal communications network. A node sending data over the network makes a global routing determination using the network usage data. Preferably, network usage data comprises an N-bit usage value for each output buffer associated with a network link. An optimum routing is determined by summing the N-bit values associated with each link through which a data packet must pass, and comparing the sums associated with different possible routes.

Method and apparatus for routing data in an inter-nodal communications lattice of a massively parallel computer system by dynamic global mapping of contended links

In a first aspect, a first method of providing communication to a user via one of a plurality of network devices is provided. The first method includes the steps of (1) receiving a plurality of communications for the user from one or more of the network devices in a message queue; (2) selecting a network device based on at least one of respective time thresholds and respective priorities associated with the plurality of network devices; and (3) determining whether the selected network device can receive a communication from the message queue based on at least one of a profile associated with the user adapted to define how the user receives the communication on one or more of the network devices and a ruleset adapted to define how the communication is handled based on criteria associated with the communication. Numerous other aspects are provided.

Methods and apparatus for providing communications from a plurality of network devices to a user

A digital device automatically arranges digital images for display in a stack-based arrangement, wherein images are grouped in multiple stacks according to at least one grouping criterion, and the user can scroll over groups of images. Preferably, the digital device automatically selects a mascot image from each group as the top of the corresponding stack. When the images are displayed using a digital display apparatus, the user can scroll through the mascot images only, without reviewing the other images in each stack. When the user finds a mascot image of interest, he may optionally scroll down the images in the stack. Preferably, images are grouped according to power-on session, and mascots are chosen based on user interaction history.

Method and apparatus for managing image display in a digital image display apparatus

Compute nodes perform allreduce operations that swap processes at nodes. A first allreduce operation generates a first result and uses a first process from a first compute node, a second process from a second compute node, and zeros from other compute nodes. The first compute node replaces the first process with the first result. A second allreduce operation generates a second result and uses the first result from the first compute node, the second process from the second compute node, and zeros from others. The second compute node replaces the second process with the second result, which is the first process. A third allreduce operation generates a third result and uses the first result from first compute node, the second result from the second compute node, and zeros from others. The first compute node replaces the first result with the third result, which is the second process.

Performing process migration with allreduce operations

A massively parallel computer system contains an inter-nodal communications network of node-to-node links. Nodes vary a choice of routing policy for routing data in the network in a semi-random manner, so that similarly situated packets are not always routed along the same path. Semi-random variation of the routing policy tends to avoid certain local hot spots of network activity, which might otherwise arise using more consistent routing determinations. Preferably, the originating node chooses a routing policy for a packet, and all intermediate nodes in the path route the packet according to that policy. Policies may be rotated on a round-robin basis, selected by generating a random number, or otherwise varied.

Method and apparatus for routing data in an inter-nodal communications lattice of a massively parallel computer system by semi-randomly varying routing policies for different packets

A massively parallel computer system contains an inter-nodal communications network of node-to-node links. An automated routing strategy routes packets through one or more intermediate nodes of the network to reach a destination. Some packets are constrained to be routed through respective designated transporter nodes, the automated routing strategy determining a path from a respective source node to a respective transporter node, and from a respective transporter node to a respective destination node. Preferably, the source node chooses a routing policy from among multiple possible choices, and that policy is followed by all intermediate nodes. The use of transporter nodes allows greater flexibility in routing.

Method and apparatus for routing data in an inter-nodal communications lattice of a massively parallel computer system by routing through transporter nodes

A request is received that includes a primary keyword and a persistent keyword. In response to the request, a root page is found that includes a first term that matches the primary keyword. Descendant pages of the root page are searched for a second term that matches the persistent keyword. The search determines that the descendant pages are at levels on paths from the root page and that the levels are within a depth from the root page. A descendant page is found that is a descendant of the root page and that includes a second term that matches the persistent keyword. A root link that points at the root page and a descendant link that points at the descendant page are sent to the requester. If the number of times that the primary keyword was received is greater than a threshold number, then the primary keyword is added to the persistent keywords.

Searching descendant pages for persistent keywords

Methods, parallel computers, and products are provided for identifying failure in a tree network of a parallel computer. The parallel computer includes one or more processing sets including an I/O node and a plurality of compute nodes. For each processing set embodiments include selecting a set of test compute nodes, the test compute nodes being a subset of the compute nodes of the processing set; measuring the performance of the I/O node of the processing set; measuring the performance of the selected set of test compute nodes; calculating a current test value in dependence upon the measured performance of the I/O node of the processing set, the measured performance of the set of test compute nodes, and a predetermined value for I/O node performance; and comparing the current test value with a predetermined tree performance threshold. If the current test value is below the predetermined tree performance threshold, embodiments include selecting another set of test compute nodes. If the current test value is not below the predetermined tree performance threshold, embodiments include selecting from the test compute nodes one or more potential problem nodes and testing individually potential problem nodes and links to potential problem nodes.

Identifying failure in a tree network of a parallel computer

A method, apparatus, system, and signal-bearing medium that, in an embodiment, determine a term score based on frame scores, frame weights, and effect bonuses. The frame score represents a probability that the frame will be displayed, and in an embodiment is based on whether the frame may be skipped via an embedded link between frames. Frames that may be skipped have their frame scores reduced. The frame weights are based on an attribute of the term, such as a font size, a font style, a color, or a location within a frame. The effect bonus is based on one or more attributes of the nearest tweened object to the term, such as a location, a size, a shape, or a color. The term score may be used to order the display of the pages that contain the frames in response to a search request. In this way, terms within the frames of an animated graphics file are scored based on the likelihood that the term will be seen during the animation.

Growing community of inventors

Eden Prairie, MN, United States of America

Brian Paul Wallenfelt