Abstract: Disclosed is a data processing system, a data processing system-implemented method and an article of manufacture for providing general user availability while integrity processing of rolled-in data is deferred and performed incrementally. The data processing system includes a data warehouse administration module for administering a data warehouse to include a table dividable into portions for containing rows of rolled-in data, a first and a second delimiter delimiting the start and the end respectively of each portion, a metadata element having an entry corresponding to the start and end delimiters delimiting each portion, a third delimiter for delimiting, between the first delimiter and the third delimiter, a sub-portion of the portion, and an operations management module having operation mechanisms for performing operations on the data warehouse responsive to the delimiters.

Abstract: The present invention relates generally to restoration of low priority services in a network. More particularly, the invention encompasses a method and an apparatus for delaying the start of the restoration of low priority services in a communication network. The invention further includes multiple schemes for restoring low priority services. The network could consist of optical, ATM, FR, or IP/MPLS switches and cross-connects.

Abstract: The present invention relates generally to routing of circuits in a network. More particularly, the invention encompasses a method and an apparatus for routing circuits using dynamic self-adjusting link weights within a network. The invention further includes multiple schemes for routing circuits with dynamic self-adjusting link weights in a SCN (Switched Communication Network). The network could consist of optical, ATM, FR, or IP/MPLS switches and cross-connects.

Abstract: Ethylenically unsaturated, particularly acrylic, monomers are polymerised using a catalyst system including a manganese carbonyl initiator, an organic halogen reactive substrate and an allylic halide chain termination agent. Desirably the manganese carbonyl initiator is a dimanganese compound, particularly dimanganese decacarbonyl (Mn2(CO)10). The catalysis mechanism appears to involve initiator homolysis, abstraction of halogen from the reactive substrate forming an organic free radical which acts as a chain initiator for polymerisation and eventual reaction of the propagating chain radical with the chain terminating agent. The speed or extent of reaction may be modified by the inclusion of Lewis acids in the reaction mixture. The resulting polymers are telechelic and may have different end groups. The polymers can be reacted further to functionalise them and/or to form block copolymers.

Abstract: A method and a system for allocating restoration capacity in a network link in a communications network provides that a common pool of communication capacity is provisioned in a network link, such that the common pool of communication capacity includes spare capacity for new service and restoration capacity. A pool of pre-allocated communication capacity for future growth of at least one connection in the network link is also provisioned. The pool of pre-allocated communication capacity for future growth is available for restoration capacity, but not for spare capacity for new service. The communications network can be, for example, a private line (PL) network, a SONET-based network, an Asynchronous Transfer Mode (ATM)-based network, an Internet Protocol/MultiProtocol Label Switching (IP/MPLS)-based network or a frame relay (FR)-based network.

Abstract: A data network wherein network links have an assigned service weight and a restoration weight that are used as factors for respectively determining an optimum primary data path and a back-up data path through the network. The restoration path is used in the event of a failure of the primary service path and a Dijkstra or similar algorithm may be used for determining these paths. Service weights may be assigned to the links to prioritize finding the shortest possible path, whereas restoration weights may be assigned to the links to find a path with the maximum available capacity.

Abstract: In a system for coating a plurality of items, a tank unit prepares the plurality of items for painting, a painting unit paints the plurality of items, a drying unit dries the plurality, and an item conveyer conveys the plurality of items through the system as a flow of single items.

Abstract: A memory controller includes ports and corresponding tables. Each port is receptive to one or more memory modules. Each table includes entries mapping memory addresses to the memory modules. Each entry corresponds to no more than one of the memory modules. The tables support asymmetric population of the memory modules within the ports; each port is capable of having a different number of memory modules relative to the other ports. The tables impose no restrictions on where the memory modules are to be inserted within the ports, both number-wise and position-wise. The tables are independently configurable; the configuration of each table is modifiable independently of the configurations of the other tables. Each table is dynamically configurable. The entries of a table are modifiable to reflect changes in the number and type of the memory modules connected, without restarting or temporarily halting the computer system containing the memory controller.

Abstract: A method, apparatus, and article of manufacture for providing to a signature hash for checking versions of abstract data types. An identifier is constructed for the abstract data type that is substantially unique to the abstract data type, wherein the identifier comprises a concatenation of various attributes for the abstract data type. The constructed identifier is hashed to generate a signature hash value for the abstract data type, which is then stored both in the database and a class definition for the abstract data type. When the class definition is instantiated as a library function, it accesses the abstract data type from the database, and compares the signature hash value from the database and the signature hash value from the class definition in order to verify that the class definition is not outdated. The class definition is outdated when the abstract data type has been altered without the signature hash value being re-generated and re-stored in the database and the class definition.

Abstract: The invention provides methods and systems for provisioning fault-tolerant ring structures that do not necessarily involve fully provisioning all spans of a ring with service capacity. The system allows a plurality of nodes to be connected in a ring structure. The ring structure can allow a ring to be provisioned without a continuous loop of service capacity around all legs of the ring. This postpones or totally avoids the cost of service capacity until a demand requires it. Only protection capacity is required to close the loop, and the decision to add working capacity can be made as warranted. At the same time, this ring structure can retain its fault-tolerant nature and also provide acceptable performance.

Abstract: Non-inline transaction error correction is disclosed. Where a transaction being processed in a pipeline is determined to include a correctable error, it is output, or drained, from the pipeline into an error queue. The pipeline is switched from a normal mode of operation to a correction mode of operation. In the correction mode, a correction command is inserted into and processed within the pipeline to correct the error within the transaction. The pipeline is switched from the correction mode of operation to a restart mode of operation. In the restart mode, the transaction is reprocessed within the pipeline. The pipeline is then switched from the restart mode of operation back to the normal mode of operation.

Abstract: Flexibility is achieved in provisioning communication rings with an integrated DCS that allows any port that is connected to a line interface unit within the integrated DCS to be coupled within the integrated DCS—pursuant to software controlled provisioning—to any other port that is connected to a line interface unit within the integrated DCS. This is accomplished by merging the cross connect fabrics of the ADM portions of the integrated DCS with the cross connect fabric of the DCS portion of the integrated DCS, by incorporating at least some of the switching controls of the ADMs in the ADM portion of the integrated DCS in the controller of the DCS, and by insuring that the SONET K-bytes can be passed by the controller of the flexible integrated DCS from any line interface unit to any other line interface unit.

Abstract: An optimization technique that reorders outerjoins and antijoins with inner joins in a bottom-up optimizer of a relational database management system (RDBMS). Each join predicate is associated with a normal eligibility list (NEL) that includes tables that are referenced in the join predicate and an extended eligibility list (EEL) that includes additional tables that are referenced in conflicting join predicates. An EEL includes all the tables needed by a predicate to preserve the semantics of the original query. During join enumeration, the optimizer determines whether a join predicate's EEL is a subset of all the tables in two subplans to be merged, i.e., whose EEL is covered. If so, the two subplans are combined using the join predicate. Otherwise, the two subplans cannot be joined. Two approaches are used to reordering: without compensation and with compensation. The “without compensation” approach only allows join reorderings that are valid under associative rules.

Abstract: A method and system provide capacity-efficient restoration within an optical fiber communication system. The system includes a plurality of nodes each interconnected by optical fibers. Each optical fiber connection between nodes includes at least three channel groups with different priority levels for restoration switching in response to a connection failure. The system maintains and restores full-capacity communication services by switching at least a portion of the channel groups from a first optical fiber connection to a second optical fiber connection system based on the priority levels assigned to the channel groups. Service reliability is effectively maintained without incurring additional costs for dedicated spare optical fiber equipment by improving idle capacity utilization.

Abstract: A method and system provide capacity-efficient restoration within an optical fiber communication system. The system includes a plurality of nodes each interconnected by optical fibers. Each optical fiber connection between nodes includes at least three channel groups with different priority levels for restoration switching in response to a connection failure. The system maintains and restores full-capacity communication services by switching at least a portion of the channel groups from a first optical fiber connection to a second optical fiber connection system based on the priority levels assigned to the channel groups. Service reliability is effectively maintained without incurring additional costs for dedicated spare optical fiber equipment by improving idle capacity utilization.

Abstract: A method and system for refreshing materialized join views includes asynchronously evaluating changes to the base tables, i.e., evaluating changes for an intended time tintended at an evaluation time teval that is later than the intended time. Changes made to the base table between the intended time tintended and evaluation time teval are recursively compensated for. The results of the evaluating and compensating are then applied to the materialized view to refresh the view.

Abstract: An optimization technique that reorders outerjoins and antijoins with inner joins in a bottom-up optimizer of a relational database management system (RDBMS).

Abstract: A method, apparatus, and article of manufacture for a computer-implemented embedded storage mechanism for structured data types. A statement is stored in a database stored on a data storage device connected to a computer. At compile-time, specific methods for a structured data type are mapped to generic methods using parse trees. At run-time, an in-memory representation of the structured data type is generated using information conveyed in the parse trees. Then, linearization of the generated in-memory representation is performed.

Abstract: A space-efficient system and method for generating an approximate &phgr;-quantile data element of a data set in a single pass over the data set, without a priori knowledge of the size of the data set. The approximate &phgr;-quantile is guaranteed to lie within a user-specified approximation error &egr; of the true quantile being sought with a probability of at least 1−&dgr;, with &dgr; being a user-defined probability of failure. B buffers, each having a capacity of k elements, initially are filled with elements from the data set, with the values of b and k depending on approximation error e and the probability &dgr;. The buffers are then collapsed into an output buffer, with the remaining buffers then being refilled with elements, collapsed (along with the previous output buffer), and so on until the entire data set has been processed and a single output remains. The element of the output corresponding to the approximate quantile is then output as the approximate quantile.

Abstract: In a multiprocessing system, multiple concurrently operating task execution units are operated to perform an aggregate task by using incremental and on-demand sub-task allocation. A command is received to perform a machine-executed task divisible into multiple sub-tasks, i.e., an “aggregate task”. A granularity is then established, for dividing the aggregate task into sub-tasks. Preferably, the granularity is not too large to permit potentially uneven sub-task allocation, and not too small to incur excessive overhead in allocating sub-tasks. Having established the granularity, multiple task execution units are independently operated on-demand to sequentially self-allocate and execute sub-tasks of the aggregate tasks. Each sub-task is sized according to the established granularity. Operating “on-demand”, each task execution unit sequentially allocates and executes one sub-task at a time, then proceeding to the next unexecuted sub-task.