Abstract: A system and method is introduced that integrates middleware components without canonicalization of data at runtime. An interface receives inputs identifying at least a first and second middleware to be made interoperative and a configurator configures at least an in-port and an out-port based on a binding and transport associated with the first and second middleware, respectively. Interoperation of the first and second middleware is effected via at least one communication path between the configured in-port and out-port, wherein the communication path allows an incoming message to pass from the in-port corresponding to said first middleware to the out-port corresponding to the second middleware without the creation of an intermediate canonical message.

Abstract: A remote mobile device periodically connects with a centralized data server to receive updated information. Because of the mobile nature of the remote device, a download of all available information may not be able to be completed during the initial network connection. When the mobile device can again reconnect to the centralized data server, the two machines are able to continue the exchange of information even if the new network connection uses different underlying technologies or different connection protocols. A fragmentation layer is used in the protocol stack above the transport layer to separate messages into chunks. By tracking which chunks are successfully sent between the two machines, the efficient exchange of messages can occur across multiple, different network connections.

Abstract: A system and method for the automated capture and analysis of data associated with a pilot deployment of client migration is provided. In an initial phase, software specified by a migration plan is deployed to a subset of a target set of client machines. Data from users interacting with client machines in the client migration pilot process is monitored and data corresponding to expected functions is captured in real-time. Captured interaction data is subsequently analyzed with respect to a baseline of expected user interactions for the migrated software system, to determine the existence of difficulty in interacting with a new software system. If difficulty is indeed detected, either the migration plan or current service offerings are adjusted to meet users'expectations. Adjustments and modifications made are dependent on whether determined user difficulties are categorized as isolated or widespread. Data captured from multiple client migration engagements is further analyzed for strategic decisions.

Abstract: Software intrusion is proactively detected using a dynamically evolving audit log wherein log entries are generated in the audit log and key values are evolved based upon a one-way function depending on both the previous log entry and the previous key. The audit log with the generated log entries and the final key value is transmitted to a clearinghouse that detects software intrusion by analyzing these values. In an effort to reduce the size of the log to be transmitted, the log entries are assigned identical values, thereby only needing to transmit one log entry and the last key value to the clearinghouse.

Abstract: A method of detecting tasks performed by users wherein a single task is a sequence of web URLs invocation. Task patterns are detected in web logs to identify tasks performed by users and analyze task trends over time, across corporate divisions and geographies. A grammar-based framework is used to model and detect tasks from web log patterns. The framework has two components: a declarative unit—to generate a task grammar, and a processing unit—to detect tasks from access logs by generating a state machine for applying the task grammar to the tokens associated with the access records. By analyzing user tasks, rather than just URLs, useful business information can be extracted.

Abstract: Addressed is a system and method for remote data caching and replication by local copy maintenance of remote data within a SAN file system. Distributed Storage Tank (DST), an extension to a SAN file system, provides for transparent SAN client access of local copies by importing, exporting, and storing data using network file access protocols as well as by providing assurance of metadata and file content validity. A Remote Access Agent (RAA) handles protocol implementation and conversion necessary for communication with remote data sources. Controlled by a consistency policy, consistency is maintained by RAA fetching and updating local copies if modifications have occurred to a file since it was first stored as a local copy in local storage. Additionally, RAA returns metadata pertaining to the requested data. A SAN client obtains metadata corresponding to the requested data and utilizes it to directly access locally stored copies of remote data.

Abstract: A scheme is used to automatically discover algebraic constraints between pairs of columns in relational data. The constraints may be “fuzzy” in that they hold for most, but not all, of the records, and the columns may be in the same table or different tables. The scheme first identifies candidate sets of column value pairs that are likely to satisfy an algebraic constraint. For each candidate, the scheme constructs algebraic constraints by applying statistical histogramming, segmentation, or clustering techniques to samples of column values. In query-optimization mode, the scheme automatically partitions the data into normal and exception records. During subsequent query processing, queries can be modified to incorporate the constraints; the optimizer uses the constraints to identify new, more efficient access paths. The results are then combined with the results of executing the original query against the (small) set of exception records.

Abstract: A policy-based resource management system provides an infrastructure that uses high-level definitions of data-types along with desired policy rules to manage legacy data. In particular, relevant legacy data is identified as well as the characteristics of storage devices where the legacy data resides. The storage management system determines what if any of the legacy data is stored in a manner that is non-compliant with the policy rules and corrects any violations. It generates corrective action plans, and then uses existing data migration software to migrate the data. Accordingly, the legacy data may be managed in a policy-based manner without requiring typical storage management software.

Abstract: A system for the entry of notes on a policy or claim, wherein the notes, after submission, are stored is non-editable form and are locked in a database for historical archival. In one scenario, the entered notes are editable and can be deleted for a pre-set time period, wherein, after the expiration of the pre-set time period, the entered notes are stored is non-editable form and are locked in a database for historical archival. Filters can be used to categorize and render the stored notes based on a set of categories.

Abstract: A system and method are disclosed for decreasing the number of duplicate library copies loaded into memory without endangering the security of applications in a runtime environment. In a preferred embodiment, applications in the runtime environment may be provided with a delegation classloader that identifies any libraries referenced by the delegation classloader's respective application. The delegation classloaders then delegate the task of providing the referenced libraries to a distinct software component. In a preferred embodiment, the distinct software component may be another delegation classloader or other loader adapted to look at a single library or a small set of libraries. These “atomic” classloaders can be freely shared by multiple applications since they do not expose any application's internals. Each atomic classloader preferably loads one copy of its associated library or libraries into memory.

Abstract: Method for ordering nodes within hierarchical data. The concept of isolated ordered regions to maintain coordinates of nodes is used by associating each node with coordinates relative to a containing region. Modifications to nodes within a region only affect the nodes in that region, and not nodes in other regions. Traversals that retrieve information from the nodes can rebase the coordinates from their containing region and return with a total order.

Abstract: A system and method of discovering dependencies between relational database column pairs and application of discoveries to query optimization is provided. For each candidate column pair remaining after simultaneously generating column pairs, pruning pairs not satisfying specified heuristic constraints, and eliminating pairs with trivial instances of correlation, a random sample of data values is collected. A candidate column pair is tested for the existence of a soft functional dependency (FD), and if a dependency is not found, statistically tested for correlation using a robust chi-squared statistic. Column pairs for which either a soft FD or a statistical correlation exists are prioritized for recommendation to a query optimizer, based on any of: strength of dependency, degree of correlation, or adjustment factor; statistics for recommended columns pairs are tracked to improve selectivity estimates.

Abstract: Provided is a method for modeling the cost of XML as well as relational operators. As with traditional relational cost estimation, a set of system catalog statistics that summarizes the XML data is exploited; however, the novel use of a set of simple path statistics is also proposed. A new statistical learning technique called transform regression is utilized instead of detailed analytical models to predict the overall cost of an operator. Additionally, a query optimizer in a database is enabled to be self-tuning, automatically adapting to changes over time in the query workload and in the system environment.

Abstract: The speed of dictionary based decompression is limited by the cost of accessing random values in the dictionary. If the size of the dictionary can be limited so it fits into cache, decompression is made to be CPU bound rather than memory bound. To achieve this, a value prefix coding scheme is presented, wherein value prefixes are stored in the dictionary to get good compression from small dictionaries. Also presented is an algorithm that determines the optimal entries for a value prefix dictionary. Once the dictionary fits in cache, decompression speed is often limited by the cost of mispredicted branches during Huffman code processing. A novel way is presented to quantize Huffman code lengths to allow code processing to be performed with few instructions, no branches, and very little extra memory. Also presented is an algorithm for code length quantization that produces the optimal assignment of Huffman codes and show that the adverse effect of quantization on the compression ratio is quite small.

Abstract: A method and system for accelerating execution of a query on a federated database system. The federated database system is associated with an external data source, which is used by the query. The query is performed based upon a query execution plan. The method and system include generating an optimizer query for the external data source utilized by the query. The optimizer query is based on the query and obtains data related to the external data source. The method and system further include providing the optimizer query to the external data source and collecting at least one resultant from the optimizer query for use in generating a future query execution plan.

Abstract: A system implementing a controller for linear motors is disclosed having a plurality of switches, a reorganization switch control detecting available hot spot sensors, encoder failures, and current sensor failures, and a storage storing a decision matrix having controller reorganization conditions. Upon detecting available hot spot sensors, encoder failures and recoveries, and current sensor failures and recoveries, the reorganization switch control reorganizes itself via configuring at least one of the switches based on information in said decision matrix to operate without available sensors and using available sensors.

Abstract: A remote communication system and method are disclosed. An environment is identified defining a plurality of parameters communicated between a first and a second computer as part of a remote session (i.e., the first computer remotely controlling the second computer via the remote session), with each parameter defining an action associated with the remote session. A first application, via a unidirectional communication with the environment, modifies at least one parameter associated with the environment (e.g., modifying keyboard scan codes, cursor position, mouse position, clipboard data, screen resolution, or channel administration), wherein the modified parameter is extracted by an interceptor associated with the second computer and, the interceptor, based on a look-up, executes a pre-defined action affecting the remote session, wherein the pre-defined action being different than the modified parameter's associated action.

Abstract: A computer implemented method of activating a process. The method includes the steps of generating one or more first plug-ins each configured to activate a target process, dynamically registering the first plug-ins with a second plug-in, and permanently storing information relating to each registered first plug-in. A server computer in a client-server computer system that includes one or more first plug-ins each configured to activate a target process, and a second plug-in configured to dynamically register the first plug-ins and to permanently store information relating to the registered first plug-ins.

Abstract: A sampling infrastructure/scheme that supports flexible, efficient, scalable and uniform sampling is disclosed. A sample is maintained in a compact histogram form while the sample footprint stays below a specified upper bound. If, at any point, the sample footprint exceeds the upper bound, then the compact representation is abandoned, the sample purged to obtain a subsample. The histogram of the purged subsample is expanded to a bag of values while sampling remaining data values of the partitioned subset. The expanded purged subsample is converted to a histogram and uniform random samples are yielded. The sampling scheme retains the bounded footprint property and to a partial degree the compact representation of the Concise Sampling scheme, while ensuring statistical uniformity. Samples from at least two partitioned subsets are merged on demand to yield uniform merged samples of combined partitions wherein the merged samples also maintain the histogram representation and bounded footprint property.

Abstract: A generalized axiomatic definition of information-theoretic similarity is provided for taxonomies that are structured as directed acyclic graph form which multiple terns may be used to describe an object. The definition is adaptable in the presence of ambiguity, as introduced by an evolving taxonomy or classifiers with imperfect knowledge, and two new similarity measures are introduced based on the definitions. A pragmatic implementation is also provided for similarity measures that arc tightly integrated with an object-relational database and scales to large taxonomies and large datasets.