Abstract: Improved techniques for representation of Java data types in Java computing environments are disclosed. A word consisting of four bytes is used to represent primitive and non-primitive Java data types. As will be appreciated, the Java data type representations can be used by a Java virtual machine to efficiently represent various Java data types encountered in Java computing environments. As a result, various components that can represent Java data types (e.g., signatures of Java methods) can efficiently be constructed.

Abstract: A memory module for use in a two rank memory module system includes a plurality of memory devices and a control circuit. In one embodiment, the control circuit may be configured to generate a chip select signal that is provided to each of the memory devices. The chip select signal may be dependent upon assertions of a first bank chip select signal and a second bank chip select signal received from a memory controller. The control circuit may be further configured to generate an address signal that is provided to each of the memory devices. The address signal may be asserted dependent upon which of the first bank chip select signal and the second bank chip select signal are asserted.

Abstract: A computer system comprising at least two processing sets. Each processing set includes main memory. A bridge connects the processing sets. At least a first processing set further including a dirty memory having dirty indicators for indicating dirtied blocks of the main memory of the first processing set. The bridge includes a direct memory access controller that is operable to copy blocks of the first processing set indicated in the dirty memory to the main memory of another processing set. The processors do not, therefore, need to carry out the copying, whereby the processor overhead associated therewith can be avoided, increasing the efficiency of memory reintegration. The direct memory access controller can be arranged to search the dirty memory for dirty indicators indicative of dirtied blocks. Alternatively, the dirty memory can include control logic operable to search the dirty memory for dirty indicators indicative of dirtied blocks.

Abstract: Techniques for transmission of message fragments between Object Request Brokers operating in distributed object oriented environments. The techniques provide an elegant mechanism for fragmentation of messages into sub-messages. In one embodiment, a fragment-offset is provided as a means for determining the location of data bytes in sub-messages with respect to the original message that has been fragmented. During the construction and transmission of sub-messages, the fragment-offset can be updated to indicate the current offset with respect to the original message. Accordingly, in contrast to conventional techniques, a significant amount of computations or bookkeeping to track of several other variables (e.g., number of fragments constructed, total number of bytes constructed, etc.) are not required. As will appreciated, the headers of the sub-messages need not be of the same size. Similarly, the data portions of the sub-messages can vary in size.

Abstract: Disclosed are novel methods and apparatus for efficiently providing power buses and bump patterns with reduced inductance and/or resistance. In an embodiment, an apparatus is disclosed. The apparatus includes a plurality of power and ground bus pairs. Each power and ground bus pair may have a power bus and a ground bus. The apparatus further includes a first power bus from a first pair of the plurality of power and ground bus pairs. The first power bus may include a plurality of power bumps. The apparatus also includes a first ground bus from the first pair of the plurality of power and ground bus pairs. The first ground bus may include a plurality of ground bumps. Each of the plurality of power/ground bumps may be substantially equidistance from any immediately neighboring ground bump of the first ground bus.

Abstract: The invention provides a methodology for rendering software applications more highly available through active fault recovery thus encouraging fewer fatal faults. The invention allows recovery from both active and passive faults. The methodology in accordance with the invention also includes the steps collecting information regarding potential faults in the software code, identifying a plurality of correctable faults, selecting a likely correctable fault and making a correction to the software code.

Abstract: Provided is a computer implemented method, system, and program for enabling communication between a first network device that communicates using a first address format and a second network device that communicates using a second address format. A frame from the first network device directed toward the second network device is received. A determination is made as to whether one address in the second address format is available to communicate with the second network device. A correspondence is defined between the first network device address in the first address format and the determined address in the second address format if one address in the second address format is available, wherein the determined address is used to represent the first network device to the second network device.

Abstract: One embodiment of the present invention provides a system that solves a global optimization problem specified by a function ƒ and a set of equality constraints qi(x)=0 (i=1, . . . , r), wherein ƒ is a scalar function of a vector x=(x1, x2, x3, . . . xn). During operation, the system receives a representation of the function ƒ and the set of equality constraints and stores the representation in a memory. Next, the system performs an interval equality constrained global optimization process to compute guaranteed bounds on a globally minimum value of the function ƒ(x) subject to the set of equality constraints. During this process, the system applies term consistency to a set of relations associated with the interval equality constrained global optimization problem over a subbox X, and excludes any portion of the subbox X that violates the set of relations. It also applies box consistency to the set of relations, and excludes any portion of the subbox X that violates the set of relations.

Abstract: The present invention provides a method and apparatus for invalidating a victimized entry. The apparatus comprises a directory cache adapted to store one or more cache entries, and a control unit. The control unit is adapted to determine whether it is desirable to remove a shared cache entry from the directory cache, and invalidate the shared cache entry in response to determining that it is desirable to remove the shared cache entry from the directory cache.

Abstract: A system for generating native code of a software application includes a page table indexing a plurality of pages using a page pointer, wherein the page pointer includes an address of at least one of the plurality of pages, a memory cache including a page table cache and a page cache, and a statically-generated executable code to obtain data on at least one of the plurality of pages using the memory cache.

Abstract: The present invention defines a mechanism for automatic synchronization of scripting variables in an action tag extension facility. Attached to each action, there is a TagExtraInfo class that describes the action. The TagExtraInfo class knows the attributes of the class, including the names of the scripting variables introduced or modified by the action. At translation time, a tag handler accesses the information from the TagExtraInfo class for each tag in a page. At run time, a pageContext object is created containing a mapping of scripting variables to values. The values are visible to the scripting code, and the scripting code can modify the values. Also, the values are accessible by the action code. The action code can modify the values or create new values and assign the values to scripting variables so that the scripting code can modify them later. Thus, the present invention allows action tags to be created without explicit knowledge of the scripting language used to create a page.

Abstract: A method for recording an audio broadcast by user preference has been developed. The method includes recording an audio broadcast and then converting the broadcast to text. The text is then scanned for content that has been designated as preferred by the user. If such content if found in the text, the recording of the audio broadcast is saved for future use.

Abstract: A system and method for selecting or ordering search results received from members of a distributing search network in response to a search request. Network nodes operating as consumer or requesting nodes generate the search requests. Nodes operating as hubs are configured to route the search requests in the network. Individual nodes operating as provider nodes receive the search request and in response may generate results according to their own procedures and return them. Communication between nodes in the network may use a common query protocol. Hub nodes may resolve the search requests to a subset of the provider nodes in the network, for example by matching search requests with registration information from nodes. Search results may be selected, ordered, and/or consolidated for use by the requesting nodes by nodes receiving a plurality of the search results.

Abstract: A chassis for an electronics assembly comprises: (i) a frame (1); and (ii) a panel (31) located on a face of the frame, the panel comprising a plurality of cooling fans (22) and a holder (30) for the fans. The panel allows removal of individual fans from the panel and replacement of any fans while the panel is located on the frame, and the frame allows removal of the panel therefrom and replacement of the panel. The chassis thus allows replacement of any fans without the assembly being shut down, and also reduces downtime of the assembly if all the fans need replacing, for example for maintenance.

Abstract: A method and apparatus are disclosed for testing the accuracy of digital images generated by a computer graphics program executed on a computer graphics system. A test program is utilized to compare test images with a set of reference images. Adaptive local image quantification verification aims at an image comparison that allows specified color value and spatial shifts. The color value for each pixel of a specified portion of the test image is compared to the average color value of an offset array of pixels in a reference image. A test image region may be unacceptably different from a reference image, if for any pixel of the test image region an offset reference image array is not found that has an array size, absolute color value difference, and spatial shift less than specified maximums.

Abstract: A method for advertising an availability of a processing resource to execute a process is provided. The method includes enabling a registry service and the processing resource to register with the registry service. The processing resource is configured to be one of numbers of network interconnected resources. Also included in the method is enabling a system controller code to find and select a suitable and available processing resource registered with the registry service to execute the process. The system controller code is configured to be executed on a computer that is networked with the number of interconnected resources. The method further includes enabling the system controller code to communicate with a selected processing resource and updating a status of the processing resource in the registry service upon a termination of executing the process.

Abstract: A interface, which connects memory and an integrated circuit, having a write path and read path that allow synchronous data propagation is provided. Further, a method for synchronizing data propagation through a read path and a write path of an interface is provided. The interface uses clock signals and paths based on a clock signal to synchronize the flow of data through various paths within the interface.

Abstract: A dual instruction set processor can decode and execute both code received from a network and other code supplied from a local memory. Thus, the dual instruction set processor is capable of executing two different types of instructions, from two different sources, permitting the dual instruction set processor to have maximum efficiency. A computer system with the foregoing described dual instruction set processor, a local memory, and a communication interface device, such as a modem, for connection to a network, such as the Internet or an intranet, can be optimized to execute, for example, JAVA code from the network, and to execute non-JAVA code stored locally, or on the network but in a trusted environment or an authorized environment.

Abstract: A platform independent B2B messenger is described. The B2B messenger includes a subscribing portion coupling a first partner and a second partner. The subscribing portion further includes a subscription manager arranged to receive a message from the first partner and a subscription message adapter coupled to the subscription manager arranged to convert the first partner message from a first partner message format to a second partner message format. The subscribing portion of the B2B messenger also includes a partner adapter coupled to the subscription manager adapter arranged send the appropriately formatted message to the second partner.

Abstract: The present invention provides an automated solution for generating a question document and an answer document from a database of questions and answers. The solution utilizes an extensible markup language to define the database. The database is then converted into a first Document Object Model (DOM) tree. The first DOM tree may then be used in prompting a user to enter the number of questions from each section to be generated. Once this input is received, nodes from the first DOM tree are randomly selected using the data received from the input. These randomly selected nodes are then used to create a second DOM tree representing the quiz or test. This second DOM tree may then be converted to a readable or printable format using a transformation, such as an stylesheet language transformation.