Abstract: 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.

Abstract: Embodiments of the invention provide a technique for improving the efficiency of a molecular modeling simulation. In one embodiment, the simulation may parse a kd-tree representing a receptor atom to identify atoms of the receptor within a specified distance of a target point. The target point may represent the center of a spherical envelope enclosing atoms of a ligand atom. A miss-accumulation vector may be used to accumulate a miss distance representing the minimum distance between a target point and a given node of the kd-tree. Thus, although the search algorithm may only evaluate the distance between the target point and a splitting dimension at each node of the kd-tree, the miss-accumulation vector may be used to account for distances over multiple dimensions.

Abstract: A technique for reducing the number of actions performed as part of a molecular modeling simulation is disclosed. For example, embodiments of the invention may be used to reduce the number of comparisons performed in a simulation of binding affinity between a first molecule (e.g., a protein receptor site) and a second molecule (e.g., a ligand). Because such a simulation is typically performed a very large number of times for even one particular first and second molecule, and is further performed for different combinations of first and second molecules, the effect of reducing the number of comparisons is leveraged and can provide a significant impact on overall simulation performance.

Abstract: A method and apparatus for performing a molecular modeling simulation is disclosed. The simulation may be configured to store the position of atoms for a first and second molecule in a first and a second kd-tree. The simulation may also generate an envelope that contains all atoms of the second molecule, parse the kd-tree generated for the first molecule to identify atoms of the first molecule within the kd-tree of that are within the envelope. For each such atom, the simulation may search the kd-tree generated for the second molecule to identify corresponding nearest atom of the second molecule.

Abstract: 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.

Abstract: 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 final destination. The default routing strategy is altered responsive to detection of overutilization of a particular path of one or more links, and at least some traffic is re-routed by distributing the traffic among multiple paths (which may include the default path). An alternative path may require a greater number of link traversals to reach the destination node.

Abstract: A method and apparatus for configuration of a memory controller in a parallel computer system using an extensible markup language (XML) configuration file. In preferred embodiments an XML file with the operation parameters for the memory controller is stored in a bulk storage and used by the computers service node to create a personality file with binary register data that is transferred to static memory. The binary register data is then used during the boot process of the compute nodes to configure the memory controller.

Abstract: Systems and methods are disclosed that allow multiple users to simultaneously watch different content on the same video display. In one application, multiple players may play a multiplayer game on a single PC or game console, while simultaneously enjoy a full-screen display on a single video monitor. The video content corresponding to each player is separated into frames, which are interleaved and displayed sequentially on the video display at a controlled frequency. Each player has a personal viewing device that is synchronized with the interleaved frames, such that each user only sees the images intended for that player. Each player therefore sees a full screen display without seeing the screen content of other players.

Abstract: 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.

Abstract: 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.

Abstract: An identifier of a root page, a keyword, and a depth are received from a client. Descendant pages in paths from the root page are searched. The descendant pages exist in the paths at levels within the depth from the root page. A term in a first descendant page is found that matches the keyword. A child link that points to a child page of the root page is found. A path relevancy for the child link is determined by performing a logical-or operation on page relevancies of each of the descendant pages in a path. A copy of the root page, a descendant link that points at the first descendant page, a match score for the first descendant page, and a path relevancy for the path of the child link are sent to the client. In this way, pages that are linked from root pages may be searched.

Abstract: In an embodiment, clients create trade profiles that specify trade criteria. In various embodiments, the trade criteria specify categories of files that are desired, specify files that are desired, or specify files that are available to trade. The clients send the trade profiles to a server, which selects available files that meet the trade criteria of other clients. The server sends a specification of the selected files to the clients. In response, the clients lock their files, which prevents presentation and send the locked files to each other. The clients receive the locked files and unlock them. After expiration of a time period, the clients once again lock the files. In this way, a file may be traded by clients, but only one client may access the file at any one time.

Abstract: 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.

Abstract: A massively parallel computer system contains an inter-nodal communications network of node-to-node links. Each node implements a respective routing strategy for routing data through the network, the routing strategies not necessarily being the same in every node. The routing strategies implemented in the nodes are dynamically adjusted during application execution to shift network workload as required. Preferably, adjustment of routing policies in selective nodes is performed at synchronization points. The network may be dynamically monitored, and routing strategies adjusted according to detected network conditions.

Abstract: 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.

Abstract: 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.