Abstract: A Web service (WS) client archive and its deployment is described. The archive includes components that define and describe the deployable WS client such as the implementation classes of the WS client, a WSDL document, and descriptors that provide more detail than what is described in a normal WSDL that are specific to the WS client of the archive.

Abstract: A logging last resource (LLR) system can provide a transaction log and transaction data to a LLR resource after a number of two-phase-commit resources have been prepared. The LLR resource manager can operate on the transaction log and transaction data in an atomic fashion so that the local commit can be done. The local commit can be done by the LLR manager in an atomic manner.

Abstract: In one embodiment, software for remediation management is operable to automatically identify an asset in an enterprise network. One or more vulnerabilities of the identified asset is automatically identified based on comparing the identified asset to content associated with the one or more vulnerabilities. At least a portion of the content is collected from a plurality of third party content providers. Other example software for remediation management may be operable to identify one or more vulnerabilities of an asset based on comparing the asset to content associated with the one or more vulnerabilities and automatically generate remediations for the asset based on the content associated with the one or more vulnerabilities.

Abstract: A system and method for compensating for disruptions to update transmissions is disclosed. A first application component stores an instance of a business object. The first application component reconciles the instance with data stored on a second application component. The first application component receives a business object update from the second application component. The first application component checks a reconciliation value associated with the business object update. If the first reconciliation value indicates the first business object update was sent after the reconciliation, the first application component applies the business object update to the instance.

Abstract: In a first general aspect, a computer program product tangibly embodied in an information carrier is described. The computer program product includes instructions that, when executed, perform operations for identifying a source or destination for stock. The operations include receiving an electronic request to determine a source or destination for stock, identifying, using a primary rule, a logistic area database object that represents a storage location at one of multiple levels of a hierarchy of storage locations. The logistic area database object is associated with a value that indicates an amount of stock that is associated with the storage location. The operations also include transmitting an identifier specifying the logistic area database object if the value indicates that associated storage location is available as a source or destination. The identifier is used to assign the storage location as the source or destination for the stock.

Abstract: Systems and methodologies that facilitate evolving a data model via a combination of an explicit logical model definition, logical model changes, functional units, an explicit/implicit physical model and physical model changes, to derive a data model transformation are presented. Such an arrangement can provide for a rich set of transformations, which can be automatically applied to a data model instantiation. The subject invention facilitates leveraging a common set of code in data model instantiation evolution, by defining the set of transformations across an arbitrary data model.

Abstract: A system and method for application fault tolerance and recover using topologically remotely located computing devices are provided. A primary computing device runs one instance of an application (i.e. the primary application instance) at a production site and an active standby computing device runs a second instance of the application (i.e. the shadow application instance) at a recovery site which may be topologically remotely located from the production site. The two instances of the application are brought into a consistent state by running an initial application “checkpoint” on the primary computing device followed by an application “restart” on the active standby computing device. Events occurring in the primary application instance may be automatically and continuously recorded in a log and transferred to the recovery site using a peer-to-peer remote copy operation so as to maintain the states of the application instances consistent.

Abstract: A method for determining semantic correlation between an input query and stored queries based on their temporal correlation. Embodiments include a formal calculation of a correlation coefficient between an input query and stored queries. Alternate embodiments include methods for calculation of a correlation coefficient using a reduced data model and efficient data examination with little or no sacrifice in the accuracy of the correlation coefficient.

Abstract: A method in a data processing system for a generic symbol referencing mechanism. A reference to a symbol is received for resolution. The symbol is identified using a data structure. The data structure comprises a set of symbol space instances, each symbol space instance contains a set of name space registry instances, each name space registry instance contains a set of name space instances, each name space instance contains a set of name instances, each name instance corresponds to a referencable symbol instance, and the referencable symbol instance corresponds to the symbol.

Abstract: A message generator for use in a publish/subscribe system, the publish/subscribe system having a broker for receiving a plurality of messages from one or more publishers and a subscriber: the message generator comprising: a storage component for retaining the plurality of messages; and an aggregator for aggregating the plurality of messages into an aggregated message.

Abstract: A computer-based process retrieves information organized in documents containing text and/or coded representations of text. The process involves obtaining and labeling a selected set of documents, and extracting and selecting features from each document in the selected set. The extracted and selected features are represented, and models are constructed using parametric learning algorithms. The constructed models are capable of assigning a label to each document. The model parameters being instantiated use a first subset of the selected set of documents. Parameters are chosen by validating the corresponding model against at least a second subset of the full document set. The constructed models also are capable of assigning labels and ranks to similar documents outside a selected subset not previously given to the process of model construction.

Abstract: A method and apparatus for generating search results with higher relevancy. More specifically, the present invention provides a determination whether a search term belongs to a particular category. Namely, properly associating a search term with the correct category will greatly enhance the generation of search results with higher relevancy.

Abstract: A mechanism for configuring and scheduling logical discovery processes in a data processing system is provided. A discovery engine communicates with information providers to collect discovery data. An information provider is a software component whose responsibility is to discover resources and relationships between the resources and write their representations in a persistent store. Discovery directives are used to coordinate the execution of information providers.

Abstract: In the case where metadata refers to relevant content on a network, since the relevant content on the network can not be necessarily permanently held, it is desirable that a time limit for making reference can be set. Besides, in order to provide relevant content which can be referred to only in a limited period for promoting sales, or in order to provide relevant content which can be referred to only in a limited period such as, for example, Christmas Day every year for raising the entertainingness of the metadata, it is desirable that a reference time limit of the relevant content can be set. Then, in order to set an effective time limit of an access unit, a flag to specify the effective time limit and the effective time limit are described in each access unit.

Abstract: Various embodiments of a method to access metadata from a plurality of data servers from a federated database management system are provided. In one embodiment, a request for metadata, from a client application, is received by the federated database management system. Data servers which are accessible from the federated database management system are identified. For each data server, metadata describing data of a data source of that data server is retrieved in accordance with the application request. The retrieved metadata from each of the data servers is aggregated to produce an aggregated result in a uniform format. The aggregated result is provided. In another embodiment, for each data server, a source metadata request for metadata of that data server is generated in accordance with the application request and a source metadata application programming interface. A view is created based on the source metadata request for metadata for each data server.

Abstract: A method is provided for using a templated pattern to define part types on a web service definition language (WSDL) interface. Applying the templated pattern enables peer services to define a transparent contract between specific WSDL part types. The templated pattern is used to wrap the original business object with the enriched business graph schema. The templated business graph is created by extending the business graph complex type that is provided by the business object framework runtime and adding an element delegating to the original business object.

Abstract: A method, article of manufacture, apparatus for determining keywords to be used by a search engine. In one embodiment, a list of hyperlinks contained in an electronic document is identified by a searching program. The searching program then accesses the resource content (e.g., HTML) from each resource pointed to by the hyperlinks. The resource content of each resource is examined to determine whether a commonality exists in a manner directed to identifying keywords for each resource. These keywords may then be used by a search engine to return more accurate results to user queries.

Abstract: A method is provided that can include providing a computer, storing data records in the data store, processing the data records to form a hierarchical chart that reflects a relationship field and displaying the hierarchical chart on the display device. Each data record can include an identifier field, a relationship field, and a quality assurance field, where the relationship field for at least one of the data records defines a hierarchical relationship with at least one of the other of the data records. The computer can include a processing device, a display device, a storage device, and a data store. A computer program and system are also provided.

Abstract: A method and apparatus for migrating the session state of an original session from a first node to a second node, such that a process, executing in the migrated session, may enqueue and dequeue messages from a queue of messages and experience the same behavior from the queue of messages as if the process was enqueuing and dequeuing messages in the original session. Advantageously, all the benefits of migrating a session from one node to another node may be realized, even when the session contains queuing state information that describes the state of a queue of messages. Data that indicates how many messages one or more subscribers have removed from the queue of messages may also be stored to preserve proper behavior of the queue of messages for multiple subscribers when sessions are migrated.

Abstract: A method of storing addresses in a database comprising generating original prefixes representing the addresses to be stored in the database. The prefix lengths are determined dynamically. Reduced prefixes are generated by collapsing or expanding the original prefixes such that a number of reduced prefixes is less than a number of original prefixes. The reduced prefixes are stored in the database.