Abstract: A system and method for managing image storage size. The invention uses reduction criteria to determine how much to reduce the storage size of an image over time. In one embodiment, reduction of data storage size includes degrading the quality of the image. The reduced-size image replaces the image from the previous iteration. The smaller storage allows longer access to the information in quick access storage and quicker transmission time.

Abstract: A computer implemented method, data processing system, and computer program product for managing multilevel hierarchical structured information in disparate knowledge repositories. An association data structure is created for an entity as metadata in a metadata repository. The association data structure is populated with association information about the entity. A process data structure is created for the entity as metadata in the metadata repository. The process data structure is populated with process information about the entity. Information about a multi-phased process is then collected by extracting process information from each entity of the multi-phased process across the disparate knowledge repositories. The collected information comprising information about the multi-phased process is then stored in the process data structure in the metadata repository.

Abstract: A halftone threshold matrix includes a plurality of submatrices, wherein a first group of the plurality of submatrices has a line screen frequency different from a second group of the plurality of submatrices. The halftone method and apparatus removes the restriction that at most one pel is turned on per basic cell for the next constant input level and allows the pels in some basic cells to be turned on much sooner that the corresponding positions in other basic cells. This creates a dominant low frequency line screen simultaneously with the higher frequency line screen of the other basic cells. The present invention also allows the basic cells inside the threshold matrix to have different shapes and sizes. Thus, the cells participating in the low frequency screen could be larger than the cells generating the higher frequency screen. For example, the low frequency screen's pleasing patterns can distract the eye from noticing less pleasing patterns in the high frequency grid and vice versa.

Abstract: A mechanism for automatically managing process information stored in federated repositories. When practice requirements are collected for a multi-step process, a process metadata data structure comprising process information conforming to the practice requirements is created in a metadata repository. The structure is created by creating a template document for each task in the multi-step process and populating the template documents with the procedure information in the practice requirements. Hierarchical and horizontal associations are created among the template documents based on the execution order of the tasks in the procedure information. Process documents for each task in the multi-step process are created and populated with information about the tasks. The task information, procedure information, and association information for each task is then stored as metadata in the process metadata structure.

Abstract: The scaling down of data is provided. At least two blocks of transformed data samples representing at least two blocks of original data samples are received. One of at least two tables of constants is selected wherein each table of constants is capable of reducing the number of transformed data samples by a different factor. The constants taken from the selected table are applied to the at least two blocks of transformed data samples to produce one block of transformed data samples representing one block of final data samples. The data is processed one dimension at a time by multiplying the data in one dimension with selected constants taken from previously developed tables corresponding to the desired scale down factor. Scaling down by different factors in each dimension as well as scaling down in one dimension and scaling up in the other dimension may be achieved.

Abstract: A halftone method and apparatus provides a line screen frequency of N/2 for a printer resolution of N without negative print effects. A 300 lines per inch halftone screen for a 600 dpi printer may thus be created by alternating white and saturated colored lines when half of a given color component's pels are on. Empirical rules are used to create the screens based on how that printer creates consistent and reliable levels for each color component. These rules allow intermediate intensity values between white and full-on at each pel. Since the halftoning is done in the hardware just before printing, the print direction relative to the threshold matrix is known. No rotation capability is needed in the hardware. If an image needs to be rotated, it can be done previously to being sent to the hardware. Furthermore, because a pair of pels are turned on for the lightest values (or possibly with a one level difference between the first and second dots in the pair), the electronics are stressed less.

Abstract: A method for management of federated information in associated knowledge systems. The method includes maintaining a data structure, the data structure including associative metadata that correlates a plurality of substantive knowledge entities from a plurality of disparate knowledge bases; monitoring the substantive knowledge entities for an access-limiting event; determining the access-limiting event on at least one of the substantive knowledge entities; and responsive to determining the access-limiting event, adding to the associative metadata a persistent audit enhancement indicative of the access-limiting event, the persistent audit enhancement including a timestamp. The access-limiting event may include deletion of a substantive knowledge entity, enacting more restrictive access permissions for a substantive knowledge entity, and copying of a substantive knowledge entity to a more restrictive access area.

Abstract: This invention solves problems due to employing error degraded data in digital processing. It particularly solves multi-generation problems wherein transform data degrade during each inverse transform and forward transform cycle even without any processing due to the rounding and clipping errors. It provides methods, systems and devices for reduced-error processing of transform-coded data. After inverse transformation of transform data, high-precision numbers are manipulated. The converting to integers and clipping to an allowed range steps are executed at any stage in the manipulation to obtain integer representation of the inverse transformed data such as for displaying of the data. However, further processing including forward transforming back to the transform domain is executed on the high-precision numbers. Thus, the rounding and clipping errors are not present in the processed data.

Abstract: The scaling down of data is provided. At least two blocks of transformed data samples representing at least two blocks of original data samples are received. One of at least two tables of constants is selected wherein each table of constants is capable of reducing the number of transformed data samples by a different factor. The constants taken from the selected table are applied to the at least two blocks of transformed data samples to produce one block of transformed data samples representing one block of final data samples. The data is processed one dimension at a time by multiplying the data in one dimension with selected constants taken from previously developed tables corresponding to the desired scale down factor. Scaling down by different factors in each dimension as well as scaling down in one dimension and scaling up in the other dimension may be achieved.

Abstract: A mechanism for automatically managing process information stored in federated repositories. When practice requirements are collected for a multi-step process, a process metadata data structure comprising process information conforming to the practice requirements is created in a metadata repository. The structure is created by creating a template document for each task in the multi-step process and populating the template documents with the procedure information in the practice requirements. Hierarchical and horizontal associations are created among the template documents based on the execution order of the tasks in the procedure information. Process documents for each task in the multi-step process are created and populated with information about the tasks. The task information, procedure information, and association information for each task is then stored as metadata in the process metadata structure.

Abstract: The present invention provides methods, apparatus, and article of manufacture for performing parallel operations on multiple signed elements which have been packed into a binary value, each element being associated with a different set of bits. A signs binary value is obtained which contains the sign bits for each element in the register. The signs binary value is then used to remove and/or restore sign bits to each element in single operations. This enables parallel operations to be performed efficiently on multiple signed elements loaded into a register, without incurring loss of data.

Abstract: A computer implemented method, data processing system, and computer program product for managing multilevel hierarchical structured information in disparate knowledge repositories. An association data structure is created for an entity as metadata in a metadata repository. The association data structure is populated with association information about the entity. A process data structure is created for the entity as metadata in the metadata repository. The process data structure is populated with process information about the entity. Information about a multi-phased process is then collected by extracting process information from each entity of the multi-phased process across the disparate knowledge repositories. The collected information comprising information about the multi-phased process is then stored in the process data structure in the metadata repository.

Abstract: The present invention provides a method, apparatus, and article of manufacture for controlling truncation error which is introduced when performing a transform equation as a result of lowering the precision of elements of the equation using shift right operations. This is achieved by associating a predetermined truncation amount with a plurality of operations of the transform equation and defining an ordered set of the operations to perform the transform which control the truncation error in the result if each operation introduced the predetermined truncation amount associated with it. Accordingly the transform is performed using the defined ordered set. For example the pre-determined truncation error could be an average truncation error.

Abstract: Provided are a method, system, and program for decoding compressed data. Compressed data is received and decoded. An error is detected while decoding a first location in the compressed data. A reentry data set is accessed having a pointer to a second location in the compressed data following the first location and decoding information that enables decoding to start from the second location. The second location in the compressed data is accessed and the decoding information in the accessed reentry data set is used to continue decoding the compressed data from the second location.

Abstract: Provided are a method, system, and program for decoding compressed data. Compressed data is received and decoded. An error is detected while decoding a first location in the compressed data. A reentry data set is accessed having a pointer to a second location in the compressed data following the first location and decoding information that enables decoding to start from the second location. The second location in the compressed data is accessed and the decoding information in the accessed reentry data set is used to continue decoding the compressed data from the second location.

Abstract: Fast transforms that use early aborts and precision refinements are disclosed. When to perform a corrective action is detected based upon testing the incremental calculations of transform coefficients. Corrective action is then performed. The corrective action includes refining the incremental calculations to obtain additional precision and/or aborting the incremental calculations when the resulting numbers are sufficient.

Abstract: The scaling down of data is provided. At least two blocks of transformed data samples representing at least two blocks of original data samples are received. One of at least two tables of constants is selected wherein each table of constants is capable of reducing the number of transformed data samples by a different factor. The constants taken from the selected table are applied to the at least two blocks of transformed data samples to produce one block of transformed data samples representing one block of final data samples. The data is processed one dimension at a time by multiplying the data in one dimension with selected constants taken from previously developed tables corresponding to the desired scale down factor. Scaling down by different factors in each dimension as well as scaling down in one dimension and scaling up in the other dimension may be achieved.

Abstract: The invention provides a method, a data analyzing system, an apparatus, and article of manufacture which reduce the error in transform equations in which constants are replaced by approximations. This is achieved by factoring an adjustment factor into the calculations which serves to reduce the error introduced by the approximations. For a forward transform equation this may be performed as part of a quantization step and for an inverse transform equation this may be performed as part of a de-quantization step. For example the adjustment factor could reduce the maximum error associated the approximations.

Abstract: Provided are a method, system, and program for decoding compressed data. Compressed data is received and decoded. An error is detected while decoding a first location in the compressed data. A reentry data set is accessed having a pointer to a second location in the compressed data following the first location and decoding information that enables decoding to start from the second location. The second location in the compressed data is accessed and the decoding information in the accessed reentry data set is used to continue decoding the compressed data from the second location.

Abstract: At least a system and data structure for the scaling of data is provided. An exemplary use of the disclosed embodiments involves the scaling up in size or the scaling down in size of computer images. n-dimensional transformed data representing some original n-dimensional real data is received. An m-dimensional inverse transform on the n-dimensional transformed data is performed to produce hybrid data, where 1?m?n. The hybrid data is scaled in p dimensions to produce scaled hybrid data representing a desired p-dimensional change in the n-dimensional real data where p?m. Finally, an m-dimensional forward transform is performed on the scaled hybrid data to produce n-dimensional scaled transformed data.