Abstract: A mechanism is disclosed for migrating a file sequence from a first workspace managed by a first workspace management system into a second workspace managed by a second workspace management system. To carry out the file sequence migration, the mechanism does not implement a format conversion process. Instead, the mechanism invokes and exploits the functionality provided by the workspace management systems. By avoiding the format conversion process, the mechanism is able to carry out the migration process much more easily and cost effectively.

Abstract: Techniques for optimistically obtaining a resource that does not currently reside in a cache associated with a node include sending a request for permission to access the resource. Before receiving a response to the request, an operation is initiated to retrieve the resource; then the response to the request is received. After receiving the response, it is determined whether the operation results in a correct version of the resource. A returned resource is received in response to the operation. If it is determined that the operation results in the correct version, then, after the returned resource is received, the returned resource is placed in the cache associated with the first node. The techniques of the current invention not only perform an optimistic read but also determine whether the results of the optimistic read are valid. When optimistic read results are valid, latency is reduced in retrieving resources.

Abstract: Techniques for maintaining version compatibility between a first module and one or more interacting modules that interact with the first module through an interface. Stored mapping maps instances of a data structure describing the interface at corresponding release times with corresponding version numbers for the first module. A second version number is automatically developed for a second module of the interacting modules based on the mapping. Compatibility is determined based on a first version number for the first module and the second version number for the second module. These techniques allow the developer of the central module to provide the developers of the interacting modules with a tool to automatically assign version numbers to the interacting module being developed. Automatic assignment of version numbers avoids the tedium and errors associated with manual methods. Furthermore, the automated methods not only ensure compatibility but also discover compatibility with the earliest core module.

Abstract: A process automation application, referred to as a commerce exchange server, for sending transaction messages between application programs uses a transaction definition data structure for specifying the component operations and processing logic that comprise the transaction. The data structure specifies one or more operations that constitute the transaction, instructions for producing the input data needed for each operation, and conditional logic for specifying constraints on the sequence of operation execution. The conditional logic may include one or more expressions, ranging from simple to complex, including variables, math operations and functions, that are evaluated using the inputs or outputs of one or more prior operations to determine execution order of subsequent operations. The transaction definition data structure may also provide for broadcast operations and for conditioning the success of their execution.

Abstract: A scalable, programmable software based application run on a programmed general-purpose digital computer is used for interconnecting a plurality of heterogeneous network nodes. The application has the ability to convert between any two signaling protocols used, such as those used over a telecommunications network, by converting an originating protocol to a universal non-protocol specific representation, and then converting the universal non-protocol specific representation to a receiving protocol. A call context is used to store information elements created from the originating protocol so that a universal call model applies inter-working rules. The universal call model is also in communication with state machines associated with both the originating and the terminating sides in order to supply the appropriate response signals anticipated by the originating and terminating sides received when each is in communication with its own protocol.

Abstract: A mailing and response envelope for conveying an item from a sender to a recipient and back is disclosed. The envelope comprises a base panel, a sender address panel, and a recipient address panel. The sender address panel is affixed to the base panel by an adhesive region. The sender address panel and adhesive region define a pocket sized to accept an item. The adhesive region extends laterally on the base panel in an amount selected to ensure that a postal cancellation is not applied to an area overlying the item. The recipient address panel is joined to the base panel by a detachable joint. In this configuration, a fragile item may be conveyed from the sender to the recipient and from the recipient back to the sender without damage to the item.

Abstract: Techniques are provided for allowing the reorganization and/or redefinition of data in a relational database with minimal or no downtime by allowing “online” reorganization/redefinition of the data. According to one aspect of the invention, an empty revised table is created in the same schema as the target table. The revised table is created with the attributes that are desired for the reorganization/redefinition of the target table. Triggers, constraints, grants and indexes that are associated with the target table are replicated for the revised table. The reorganization/redefinition is performed by using an underlying mechanism that involves using incrementally maintainable materialized views. According to one feature, the revised table is initialized and periodically synchronized with the target table.

Abstract: A method for dynamically managing a digital recording system's bandwidth requirements, provides prioritized accesses to the recording system's hard drive according to a pre-defined policy which gives the first priority to the data streams being written to the disk, the second priority to the data streams being read from the disk, and the third priority to other accesses to the disk. The recording system's bandwidth efficiency may also be improved by optimizing allocation of the disk's storage space which is partitioned into lower bandwidth portions and higher bandwidth portions, where lower bandwidth data streams are stored in lower bandwidth portions and higher bandwidth data streams are stored in higher bandwidth portions.

Abstract: Techniques for managing hierarchical data include managing a link table in a relational database. The hierarchical data includes data about a hierarchy of nodes related by multiple links. The link table includes first information, second information and link information, for each link. First information indicates a first node in the hierarchical data. Second information indicates a second node that is associated with the first node by the link. Link information indicates values for link attributes of the link between the first node and the second node, and does not indicate a value for any attribute of the first node alone or any attribute of the second node alone. The techniques support directing a single SQL statement to a path database object, constructed based on the link table, in order to obtain paths that satisfy a search on link attributes.

Abstract: Techniques are disclosed for managing resources that are accessible to a plurality of entities. In one embodiment, shared locks on a resource are granted more efficiently by maintaining data that is local to (e.g. on the same node as) each entity to indicate whether an exclusive lock has been granted on the resource to any entity of the plurality of entities. Data that (15) is maintained local to an entity, and that (16) indicates whether any entity has an exclusive lock on a particular resource is referred to herein as a “local exclusive lock flag” for that particular resource. When an entity of the plurality of entities seeks to acquire a shared lock for a particular resource, that entity checks the local exclusive lock flag for that particular resource. If the local exclusive lock flag indicates that no entity holds an exclusive lock on the resource, then the entity seeking the shared lock acquires the shared lock without first receiving a lock grant from the resource manager that manages the resource.

Abstract: A design for an inverting delay component of an oscillator is disclosed, which enables the oscillator to be more tolerant of parameter variations. This increased parameter variation tolerance allows the KVCO of the oscillator to vary less between the worst case scenario (where the components of the oscillator meet minimum specifications) and the best case scenario (where the components meet the maximum specifications). This in turn means that the worst case KVCO value will be significantly smaller than in the prior art. By using a significantly smaller KVCO value, the jitter experienced at the output of the oscillator will be substantially reduced. Thus, this design enables a low-jitter oscillator to be realized.

Abstract: Techniques are provided performing text-to-speech translation in situations in which the input texts may contain unanticipated content. According to one aspect of the invention, text-to-speech services are provided by splitting a text into segments that include anticipated-content segments and unanticipated-content segments. Speech for the anticipated-content segments is generated based on pre-recorded sound recordings that correspond to the anticipated-content segments. Speech for the unanticipated-content segments is generated using speech synthesis. Usage statistics are recorded. The usage statistics identify which segments are contained in texts that are translated using the text-to-speech services. In one embodiment, the usage statistics indicate frequency of use of unanticipated-content segments and, based on the usage statistics, a set of unanticipated-content segments for which to make recordings is selected.

Abstract: Schema conversion approaches convert images of complex objects. The schema conversion is performed on images of complex objects belonging to a root class, whether those objects are instances of the root class or instances of a subclass of the root class. A complex object is an object that is comprised of a collection of objects or that has another object as an attribute. The approaches use change vectors to represent changes to make to an image to convert it between the target schema version and source schema version. Change vectors are generated based on schema version records, each of which describes the properties of a schema version, including the attributes in the schema version and the data type of each of the attributes. The approaches evolve changes that includes addition, modification and deletion of object attributes. They convert from an earlier schema version to a later schema version, and vice versa, i.e. from a later schema version to a earlier schema version.

Abstract: A mechanism is described for constructing work granules, where the work granules are constructed independently of whether two or more of the work granules are assigned to operate on a logical storage unit that contains a portion of the same row. A database system maintains transaction control data for data blocks in a manner that avoids self-deadlocks for slaves that follow a row collision protocol. A row collision protocol is a set of rules or steps that slaves follow to ensure that only one subtransaction in a distributed transaction updates a spanning row. Thus, for a particular spanning row, a single subtransaction modifies all the row pieces of the spanning row in any data block containing any row pieces of the spanning row. Consequently, a given data block may be affected by multiple subtransactions in a distributed transaction, one subtransaction affecting a row piece in the data block, another subtransaction affecting other rows in the data block.

Abstract: Techniques for executing an atomic transaction include performing a first operation of a first set of operations. The atomic transaction involves the first set of operations for causing changes to a first set of data. A first error that prevents completion of the atomic transaction is detected. In response to detecting the first error, a second set of operations is performed for resolving the first error. It is then determined whether a resolution of the first error is obtained in response to performing the second set of operations. If the resolution is obtained, then execution of the first set of operations is resumed. These techniques allow atomic transactions to be resumed after resolving an error without undoing all the operations accomplished for the transaction at the time the error occurred.

Abstract: A method and apparatus for securely establishing voice over Internet Protocol calls are disclosed. In a Registration Security approach, a Gatekeeper sends an Access Token in all Registration Request messages. The Access Token contains information that authenticates the Gateway to the Gatekeeper. The Gatekeeper formats a message to an authentication server that will authenticate the information contained in the token, and the server responds with either an Access-Accept or Access-Reject message. The Gatekeeper responds to the Gateway with either a Registration Confirm message or a Registration Reject message. If a call is then placed from a successfully authenticated Gateway, that Gateway generates a new Access Token that is identical to the one generated during registration, except for the timestamp. The Gatekeeper uses the authentication server to authenticate the originating gateway, before sending the designation side Access Confirm message.

Abstract: A method of converting an abstract quality of service policy into a new configuration for one or more network devices of managed network, as routers. The abstract quality of service policy is received and converted into a first set of one or more basic commands. A current configuration of one of the network devices is obtained, e.g. through device discovery. The configuration is received in the form of one or more first command line interface (CLI) commands that represent the current configuration of the network device. A second set of one or more basic commands that correspond to the current configuration of the network device is determined, based on the first CLI commands. The first and second sets of basic commands are transformed into one or more second CLI commands which, when executed by the network device, will create a new configuration for the network device that implements the abstract quality of service policy.

Abstract: A fast recovery extended method is used to enhance the performance of TCP fast recovery when multiple segment losses occur within a single round trip time between a TCP sender and a TCP receiver. A TCP fast recovery process is performed by a TCP sender, and then a TCP fast recovery extended process is performed by the TCP sender upon receiving acknowledgement of receipt of new data from a TCP receiver in the TCP fast recovery process. The fast recovery extended process determines, following receipt of the acknowledgement of receipt of new data, an excess number of duplicate acknowledgements based upon a count of consecutive duplicate acknowledgement packets. The fast recovery extended process takes a network packet transmission recovery action based upon the excess number of duplicate acknowledgements, and then stores the excess number of duplicate acknowledgements as a number of duplicate acknowledgements for further use.

Abstract: Methods are provided for automatically discovering correlations between values in columns of tables. A set of significantly correlated columns is identified by identifying correlated columns, and by determining the significance of the correlation between the correlated columns from one or more tables. If the correlated columns are considered significantly correlated, a correlation table is constructed that includes records representing distinct combinations of values corresponding to the correlated columns. Embodiments include methods for identifying correlated columns, for determining the significance of the correlation between the correlated columns, and for using the resultant correlation table to enhance performance of a query execution process. One particular embodiment provides for using a correlation table for partition pruning a partitioned table, with respect to a query execution plan.

Abstract: A method and apparatus for linking external information to a network management system are disclosed. A network management system is installed for and executes in association with a managed network. An external application program is identified by defining and storing in a connection file information that describes: the name and location of the program; a position in a menu control tree into which folders and items, which identify functions and options of the external application program, should be displayed and accessed; security roles associated with each folder and item; and other meta-information about the application program and its maker. The information may be stored in a markup format in a connection file. The network management system reads the connection file and integrates the information into its registry and other locations that determine how the network management system operates.