Abstract: A method, computer program product, and distributed data processing system that allows a single physical I/O adapter, such as a PCI, PCI-X, or PCI-E adapter, to validate that a direct memory access address referenced by an incoming I/O transaction that was initiated through a memory mapped I/O operation are associated with a virtual adapter or virtual resource that is referenced by the incoming memory mapped I/O operation is provided. Specifically, the present invention is directed to a mechanism for sharing conventional PCI (Peripheral Component Interconnect) I/O adapters, PCI-X I/O Adapters, PCI-Express I/O Adapters, and, in general, any I/O adapter that uses a memory mapped I/O interface for communications. A single physical I/O adapter validates that one or more direct memory access addresses referenced by an incoming I/O transaction initiated through a memory mapped I/O operation are associated with a virtual adapter or virtual resource that is referenced by the incoming memory mapped I/O operation.

Abstract: A computer implemented method, apparatus, and computer usable code for rendering graphical markers in a manner that avoids overlap of graphical markers on a map display. The process identifies a plurality of points for display from data describing locations and associated data about locations. The process determines whether displaying graphical markers for a set of points in the plurality of points will result in graphical markers overlapping each other. If the process determines that displaying graphical markers for the set of points will result in graphical markers overlapping each other, the process displays the graphical markers for the set of points in an arrangement that avoids overlap. Each graphical marker representing a point in the set of points does not overlap with any other marker associated with the map display when displayed in the arrangement that avoids overlap.

Abstract: A mechanism minimizes the management issues of the participant objects of the logical target set, such as an application set. The mechanism maps the current physical implementation. The mechanism then identifies the target and extraneous object set locations to facilitate isolation. Thereafter, the mechanism optimizes the logical target set placement for best manageability and performance. The mechanism minimizes the management issues by providing a small application footprint. This is accomplished by placing the object set on the fewest necessary volumes to facilitate both application performance and independence of administrative action.

Abstract: A survey document is provided on a server, for delivery to a client on a network, having questions and potential answers in a format defining branches of the questions. Programming instructions are also provided on the server for delivery to the client on the network. The instructions are for causing the client to render questions on a user interface from the survey document. The questions initially rendered include a first one of the questions. The instructions are also for causing the client to branch to and render on the user interface second or third ones of the questions responsive to the survey document and an answer received for the first question.

Abstract: A method, system, and computer program product for visually indicating the last line(s) of text on a page displayed in a window so that the user can see this visual indication as they are scrolling the text. The user also has the ability to specify a hard stop for the scrolling once the visual indication has reached a desired position.

Abstract: A computer implemented method, apparatus, and computer usable program code to receive a user input defining settings at an application layer to form a set of received settings. An adaptive bandwidth control process is executed using the received settings to identify a transmission rate for transmitting data packets across a network. The data packets are transmitted across the network using the identified transmission rate.

Abstract: A method and apparatus is provided for routing error messages in a distributed computer system comprising multiple root nodes, and further comprising one or more PCI switches and one or more I/O adapters, wherein each root node includes one or more system images. In one useful embodiment, a method is provided for routing I/O error messages to root nodes respectively associated with the errors contained in the messages. The method includes detecting occurrence of an error at a specified one of the adapters, wherein the error affects one of the system images, and generating an error message at the specified adapter. The method further comprises routing the error message from the specified adapter to the particular root node that includes the affected system image. The error message is then selectively processed at the particular root node, in order to identify the affected system image.

Abstract: A method, apparatus, and computer instructions for managing multi-threaded conversations in an instant messaging system. The present invention provides a menu option to allow the start of a new topic of discussion within the current instant messaging session. When a new topic is selected, a new thread of conversation is created within the messaging window that is segregated from previous topics of discussion. This new thread of conversation may be created at all other locations for all of the parties involved in the instant messaging session. In this manner, each party to a messaging session containing multiple conversations may be able to understand which response is related to which thread of conversation. In addition, a menu option may be provided by the instant messaging application to allow a user to merge one or more of the threaded conversations into a single conversation.

Abstract: A data model for navigating data. In a preferred embodiment, the data model abides rules that limit the total number of nodes displayable and that limit the number of child nodes displayable beneath a given parent. Collapsed or folded nodes are replaced by embedded navigation controls that indicate the hidden nodes.

Abstract: A computer implemented method, data processing system, and computer program product that enable a component to prepare for the arrival of a moving component by providing, to the component, an automated notification of the moving component's approach. When a moving component approaches an arrival point, a signal is received from a transponder chip on the moving component, wherein the signal includes a unique identifier for the transponder chip. The moving component is then identified based on the unique identifier in the signal. A second signal is sent to the component to signal that initiation of a set of actions to be performed with respect to the moving component may occur.

Abstract: A method, apparatus, and computer instructions for optimizing Web services binding. A request is received from a client for Web services binding information for a Web service. The current availability of the Web service requested by the client is identified in response to receiving the request to form an identified current availability. An indication of the identified current availability of the Web service is sent to the client in response to identifying the current availability of the Web service requested by the client. The client uses the indication of the identified current availability to selectively use the Web service.

Abstract: A hybrid shift register latch which uses static memory cells for system operations and a dynamic memory cell for testing operations only. An L1 storage element and an L2 storage element are provided in an array cell. The L1 storage element comprises a static random access memory cell. The L1 storage element is used during system and testing operation of the array cell. The L2 storage element comprises a dynamic random access memory cell. The L2 storage element is used only during testing operation of the array cell.

Abstract: A method for improving the reliability of host data stored on Fiber Channel attached storage subsystems by performing end-to-end data integrity checks. When a read or write operation is initiated, an initial checksum for data in the read/write operation is generated and associated with the data, wherein the association exists through a plurality of layers of software and attached storage subsystems. The initial checksum is passed with the data in the read/write path. When a layer of software in the read/write path receives the initial checksum and data, the layer performs an integrity check of the data, which includes generating another checksum and comparing it to the initial checksum. If the checksums do not match, the read/write operation fails and the error is logged. If the checksums match, the integrity check is repeated through each layer in the read/write path to enable detecting data corruption at the point of source.

Abstract: A method and system for reallocating memory in a logically partitioned environment. The invention comprises a Performance Enhancement Program (PEP) and a Reallocation Program (RP). The PEP allows an administrator to designate several parameters and identify donor and recipient candidates. The RP compiles the performance data for the memory and calculates a composite parameter. For each memory block in the donor candidate pool, the RP compares the composite parameter to the donor load threshold to determine if the memory is a donor. For each memory block in the recipient candidate pool, the RP compares the composite parameter to the recipient load threshold to determine if the memory is a recipient. The RP calculates the recipient workload ratio and allocates the memory from the donors to the recipients. The RP monitors and update the workload statistics based on either a moving window or a discrete window sampling system.

Abstract: A logic gate is described that implements complex logic within a memory array. The logic gate receives at least three of a first storage cell signal, a second storage cell signal, a first external signal, or a second external signal at a first input circuitry and second input circuitry. The logic gate then performs one of a set of logic functions using the first storage cell signal, the second storage cell signal, the first external signal, or the second external signal. The set of logic functions includes at least one of a matching function, an OR-AND function, or an AND function.

Abstract: The present invention provides a method for scaling a user interface adaptively to an object discovery or display system with policy driven filtering. A number of filters are defined by the user in an initial setup. The filter includes a target number of discovered objects and a metric for filtering discovered objects. Once the initial setup is complete, the present invention automatically triggers or deactivates the filters and dynamically applies one or more filters based on the number of discovered objects and rules defined by the user. Resulting discovered objects are displayed in the user interface to the user.

Abstract: A semi-automatic mapping of a library definition to a simple network management protocol (SNMP) management information base (MIB). By exposing the internal data needed to remotely access arbitrary user space libraries as SNMP data structures which can be directly modified over the network, the internal data, its operations, and usages operations can be modeled remotely.

Abstract: A data query system including a first storage medium including a data schema having a data schema query language associated therewith, a second storage medium including an ontology model including classes and properties, the ontology model having an ontology query language associated therewith, wherein constructs of the database schema are mapped to corresponding classes, properties or compositions of properties of the ontology model, and an ontology query processor generating a query expressed in the data schema query language corresponding to a specified query expressed in the ontology query language. A method is also described and claimed.

Abstract: Inter-procedural strength reduction is provided by a mechanism of the present invention to optimize software program. During a forward pass, the present invention collects information of global variables and analyzes the information to select candidate computations for optimization. During a backward pass, the present invention replaces costly computations with less costly or weaker computations using pre-computed values and inserts store operations of new global variables to pre-compute the costly computations at definition points of the global variables used in the costly computations.

Abstract: A fork system call by a first process is detected. A second process is created as a replication of the first process with a second affinity. If a replication of the replicated shared library is present in the second affinity domain, effective addresses of the replication of the replicated shared library are mapped using a mapping mechanism of the present invention to physical addresses in the second affinity domain.