Abstract: A method is described for relaying information from a first body of information defined by a source schema to a second body of information defined by a target schema. The method involves mapping content associated with one or more source schema fields from the first body of information to a third body of information defined by an intermediate schema. The method further involves executing one or more transformation functions that use the content and are identified by the intermediate schema. The method further involves mapping one or more results of the executing from the third body of information to the second body of information.

Abstract: Methods and systems for searching a database for a query using an integrated approach of associating transduced query string comparisons with literal query string comparisons reduces computation time and results in more relevant and accurate results. The methods and systems include a processor receiving a query, searching a database for the query, and providing results of the search. The query may be compared to data entries from the database, and a transduced version of the query may be compared to transduced data entries. Results from the comparisons between the query and the data entries may be used to guide the comparisons between the transduced query and the transduced data entries. Search results are determined based on the guided comparisons.

Abstract: Systems and methods for fast, efficient content-based routing that allow a router to perform true content-based routing without having to de-serialize the data and apply a full content-based filter by determining the exact set of consumers to forward the data onto based on packet headers. A system for fast content-based routing may receive a subscription from a receiver machine and may assign a unique ID associated with the subscription in a router table. The system may then place a ID associated with a particular subscription in a message header if the message corresponds to the subscription. The system may then analyze the router table to determine one or more receiver machines associated with the ID in the header of the message. The system may then send, from a sender machine to one or more receiver machines, one or more messages containing the ID in the header of the message.

Abstract: Methods and systems for visual debugging of an interpreted language in, for example, an Interactive Development Environment are provide. Example embodiments provide an S-PLUS Visual Debugging System (“SPVDS”), which includes an S-PLUS Workbench Debugger (“SPWD”) that provides “step-based” visual debugging, enabling programmers to step through execution of expressions by setting and otherwise managing breakpoints, examining variables and expressions, and controlling execution such as by step, step-in, step-out, step-over, continue, stop commands. In addition, the SPWD provides a profiler which tracks the number and duration of calls to functions and the amount of memory allocated to variables. This abstract is provided to comply with rules requiring an abstract, and it is submitted with the intention that it will not be used to interpret or limit the scope or meaning of the claims.

Abstract: Methods and systems for performing a query over joined tables in the context of inexact matching provide efficient search engine functionality. The systems and methods are used to perform an efficient query on a parent table and joined child tables. Search grams are determined based on the query and parent records and child records are scanned for the search grams. Gram scores are computed based on a degree of matching between the parent and child records and the search grams.

Abstract: A computing system is configured to deploy a JAVA application for execution in a distributed manner. The computing system includes a plurality of computing nodes including a domain manager node, the plurality of computing nodes forming a computing domain configured as an administrative grouping of the nodes administered by the domain manager node. The domain manager node is configured to provide, to each of the computing nodes, a main portion of the JAVA application. The main portion defines, for each computing node, a portion of the behavior of the JAVA application to be accomplished by that computing node. Furthermore, each computing node is configured to receive at least one class file having classes appropriate for the portion of the behavior of the JAVA application defined, by the main portion, to be accomplished by that computing node.

Abstract: A distributed computing system manages execution of jobs and their associated tasks. A broker manages assignment of computing tasks from clients to available computing resources. Clients and available computing resources contact the broker by polling. To prevent “ringing,” the broker specifies wait times for the polling entities, and randomizes the wait times in a range around a desired target latency. That is, a pseudo-random number generator is used to select values within a range of the target value, to avoid the situation in which deterministic patterns in the polling and response times result in highly synchronized message traffic, which might otherwise overwhelm the broker and/or the communication network.

Abstract: Disclosed are systems and methods for providing message compression instructions by communicating with a plurality of sender machines and a plurality of receiver machines and monitoring one or more messages from the plurality of sender machines. The disclosed systems and methods may also identify a part of the one or more messages that is frequently included in a plurality of the messages sent by the plurality of sender machines, dynamically determine compression instructions to compress this part of the message, and provide the compression instructions to at least one of the plurality of sender machines, such that the compression instructions reduce size of the messages having the part of the message associated with the compression instructions.

Abstract: Disclosed are systems and methods for transporting data using shared memory comprising allocating, by one of a plurality of sender application, one or more pages, wherein the one or more pages are stored in a shared memory, wherein the shared memory is partitioned into one or more pages, and writing data, by the sender application, to the allocated one or more pages, wherein a page is either available for use or allocated to the sender applications, wherein the one or more pages become available after the sender application has completed writing the data. The systems and methods further disclose sending a signal, by the sender application, to a receiver application, wherein the signal notifies the receiver application that writing the data to a particular page is complete, reading, by the receiver application, the data from the one or more pages, and de-allocating, by the receiver application, the one or more pages.

Abstract: Disclosed are systems and methods for communicating with a sender machine and a receiver machine, and analyzing a bitmask associated with a message to be sent from the sender machine to the receiver machine, such that the bitmask comprises one or more presence bits and one or more absence bits, such that the presence bits indicate that an associated field of the message are included in the message and the absence bits indicate that an associated field of the message are omitted in the message. The systems and methods also dynamically determine compression instructions to compress the bitmask, and provide the compression instructions to the sender machine, wherein the compression instructions reduce size of the bitmask associated with the message to be sent to the receiver machine.

Abstract: Disclosed are systems and methods for efficient matching for content-based addressing wherein the systems and methods may: accept, at a receiver machine, a query; generate, at the receiver machine, a tree structure ordered by one or more fields of the query; analyze, at the receiver machine, a message from the sender machine; search, by the receiver machine, the tree structure using content from one or more fields of the message; determine, by the receiver machine, if the content values of the message match a content value of the query stored in the tree structure; and accept, by the receiver machine, the message if the content value of the message matches one or more content values of the query.

Abstract: Disclosed are systems and methods for deploying a componentized application using a deployment tool to deploy an application expressing a requirement for a first capability associated with a second capability, and to find a first capability provider providing the first capability, where the second capability is provided by a second capability provider, and the second capability is dynamically associated with the first capability provider.

Abstract: A method and system for identifying a candidate subset of a data set comprises comparing suffixes of query field values to data field values of records in the data set. Sufficiently similar records are included in the candidate subset. Query field value suffixes may range in length from the query field value itself down to a minimum suffix length. The longest suffix may be processed first, and then successively shorter suffixes may be processed until a satisfactory number of candidates are identified. Entries in an index data structure derived from the data set may associate various suffixes found in the data set with individual records. The data structure entries may include record keys identifying records with data field values identical to the suffix and may also include suffix pointers identifying related data structure entries with suffixes similar to the entry's suffix.

Abstract: Disclosed are systems and methods for deploying a componentized application in a deployment environment using a deployment tool to receive a description of how to deploy the component onto a logical description of the deployment environment, and map the logical description of the deployment environment to the deployment environment based on the mapping data. The deployment tool may receive a component to be deployed in the deployment environment, and automatically deploy the component to the deployment environment. The deployment tool may also generate mapping data including one or more desired attributes of the deployment model based on the description.

Abstract: Disclosed are systems and methods deploying a componentized application using a deployment tool to analyze an application to be deployed, where the application depends on at least two or more deployed capabilities that are interrelated, and the deployed capabilities each provide independent functionality. The deployment tool may automatically identify two or more deployed capability providers that provide the two or more deployed capabilities.

Abstract: Delivering data and formatting information includes delivering object definition files from a server to a client; generating definitions and object instantiations at a client using JavaScript or another simple browser-interpreted language, for objects relating to data modeling and presentation; and presenting data using those objects at the client, using a web browser without a separate runtime environment or application plug-in, but maintaining substantial state at the web browser regarding the data itself and the format for its presentation. Definition files are modified to provide object properties consistent with a full object-oriented language, including for example hierarchical inheritance of object properties.

Abstract: Methods and systems for visual debugging of an interpreted language in, for example, an Interactive Development Environment are provide. Example embodiments provide an S-PLUS Visual Debugging System (“SPVDS”), which includes an S-PLUS Workbench Debugger (“SPWD”) that provides “step-based” visual debugging, enabling programmers to step through execution of expressions by setting and otherwise managing breakpoints, examining variables and expressions, and controlling execution such as by step, step-in, step-out, step-over, continue, stop commands. In addition, the SPWD provides a profiler which tracks the number and duration of calls to functions and the amount of memory allocated to variables. This abstract is provided to comply with rules requiring an abstract, and it is submitted with the intention that it will not be used to interpret or limit the scope or meaning of the claims.

Abstract: A method for managing static data structures of a legacy data modeling software product in a dynamic class loader environment comprises constructing a bundle-specific registry for each software bundle in the dynamic class loader environment and instructing the legacy data modeling software product to use the bundle-specific registry rather than its default registry when creating in-memory representations of data model classes associated with a particular software bundle. Constructing a bundle-specific registry may include using the bundle's configuration metadata to calculate a dependency graph identifying the other bundles on which the software bundle depends. An initializer may construct the initial set of bundle-specific registries, and a listener may construct bundle-specific registries for new software bundles entering the system.

Abstract: Disclosed is a method for archiving provisioning errors that may occur during provisioning of a computing environment having configurable components. The method may comprise distilling a provisioning request, wherein the distilling the provisioning request includes recording, in a provisioning archive, a provisioning request component, and filtering the provisioning request component. The provisioning request component may comprise a component requested to be added to, removed from, and/or updated in the computing environment. The method may further comprise distilling a provisioning target, wherein the distilling the provisioning target includes recording, in the provisioning archive, a target environment, and filtering an existing component of the target environment. Additionally, the method may comprise applying the provisioning request to the provisioning target, including provisioning the target environment, resulting in an updated provisioning target.

Abstract: Disclosed are systems and methods for identifying one or more individuals in an organizational model to work on a particular work item where the method includes receiving a query having one or more attributes where the one or more attributes indicate the criteria for one or more individuals to work on a particular work item. The systems and methods further include searching an organizational model for the one or more individuals associated with the attributes defined in the query, and identifying the one or more individuals associated with the attributes defined in the query. The systems and methods also include allocating or offering the particular work item to the one or more of the individuals associated with the one or more attributes defined in the query.