-
公开(公告)号：WO2008077715A3
公开(公告)日：2008-09-18
申请号：PCT/EP2007063092
申请日：2007-11-30
Applicant: IBM , IBM UK , GEVA AMIR , KARNIN EHUD DOV , ZLOTNICK AVIAD
Inventor： GEVA AMIR , KARNIN EHUD DOV , ZLOTNICK AVIAD
CPC classification number: G06F3/1205 , G06F3/1232 , G06F3/1243 , G06F3/1285 , G06K9/2054 , G06K9/38 , G06K2209/01
Abstract: A method for form processing in a data processing system comprises creating a computer-readable template of a form having a feature designed for automatic dropout in an automated form processing system. Embedded software code is added to the template. The embedded code is configured, when running on a data processing apparatus, to determine printing attributes of an output device connected to the data processing apparatus and to modify the feature of the form responsively to the printing attributes and to a dropout capability of the form processing system. The template is provided to the data processing apparatus, thus causing the data processing apparatus to print the form having the modified feature using the output device.
Abstract translation: 一种用于数据处理系统中的表单处理的方法包括：创建具有设计用于在自动表单处理系统中自动退出的特征的表单的计算机可读模板。 嵌入式软件代码被添加到模板中。 当在数据处理装置上运行时，嵌入代码被配置为确定连接到数据处理装置的输出装置的打印属性，并且响应于打印属性修改形式的特征以及形式处理的丢弃能力 系统。 将模板提供给数据处理装置，从而使数据处理装置使用输出装置打印具有修改特征的形式。
-
公开(公告)号：DE3750390D1
公开(公告)日：1994-09-22
申请号：DE3750390
申请日：1987-10-02
Applicant: IBM
Inventor： ARPS RONALD BARTHOLD , KARNIN EHUD DOV
Abstract: Method and means are disclosed for detecting any single errors introduced into an arithmetic data compression code string as a result of coding, transmission, or decoding through testing according to a modulo-n function, n being an odd number not equal to +1 or -1, an arithmetic compression coded data stream C'(s) generated by n-scaling an arithmetically recursive function that produces a non-scaled arithmetically data compressed code stream C(s) as a number in the semi-open coding range [0,1).
-
公开(公告)号：DE69424229D1
公开(公告)日：2000-06-08
申请号：DE69424229
申请日：1994-06-27
Applicant: IBM
Inventor： HASSNER MARTIN AURELIANO , KARNIN EHUD DOV , SCHWIEGELSHOHN UWE , TAMURA TETSUYA
Abstract: An apparatus and method for executing a sequential data compression algorithm that is especially suitable for use where data compression is required in a device (as distinguished from host) controller. A history buffer 22 comprises an array of i identical horizontal slice units. Each slice unit stores j symbols to define j separate blocks in which the symbols in each slice unit are separated by exactly i symbols. Symbols in a string of i incoming symbols are compared by i comparators in parallel with symbols previously stored in the slice units to identify matching sequences of symbols. A control unit controls execution of the sequential algorithm to condition the comparators to scan symbols in parallel but in each of the blocks sequentially and cause matching sequences and nonmatching sequences of symbols to be stored in the array. The parameters i and j are selected to limit the number of comparators required to achieve a desired degree of efficiency in executing the algorithm based upon a trade-off of algorithm execution speed versus hardware cost. A priority encoder calculates from signals output by the slice units each j,i address in which a matching sequence is identified, but it outputs the address of only one (such as the smallest) of these addresses.
-
公开(公告)号：BR9402666A
公开(公告)日：1995-05-02
申请号：BR9402666
申请日：1994-07-08
Applicant: IBM
Inventor： HASSNER MARTIN AURELIANO , KARNIN EHUD DOV , SCHWIEGELSHOHN UWE , TAMURA TETSUYA
Abstract: An apparatus and method for executing a sequential data compression algorithm that is especially suitable for use where data compression is required in a device (as distinguished from host) controller. A history buffer 22 comprises an array of i identical horizontal slice units. Each slice unit stores j symbols to define j separate blocks in which the symbols in each slice unit are separated by exactly i symbols. Symbols in a string of i incoming symbols are compared by i comparators in parallel with symbols previously stored in the slice units to identify matching sequences of symbols. A control unit controls execution of the sequential algorithm to condition the comparators to scan symbols in parallel but in each of the blocks sequentially and cause matching sequences and nonmatching sequences of symbols to be stored in the array. The parameters i and j are selected to limit the number of comparators required to achieve a desired degree of efficiency in executing the algorithm based upon a trade-off of algorithm execution speed versus hardware cost. A priority encoder calculates from signals output by the slice units each j,i address in which a matching sequence is identified, but it outputs the address of only one (such as the smallest) of these addresses.
-
公开(公告)号：SG45138A1
公开(公告)日：1998-01-16
申请号：SG1996000352
申请日：1994-06-27
Applicant: IBM
Inventor： HASSNER MARTIN AURELLIANO , KARNIN EHUD DOV , SCHWIEGELSHOHN UWE , TAMURA TETSUYA
Abstract: An apparatus and method for executing a sequential data compression algorithm that is especially suitable for use where data compression is required in a device (as distinguished from host) controller. A history buffer 22 comprises an array of i identical horizontal slice units. Each slice unit stores j symbols to define j separate blocks in which the symbols in each slice unit are separated by exactly i symbols. Symbols in a string of i incoming symbols are compared by i comparators in parallel with symbols previously stored in the slice units to identify matching sequences of symbols. A control unit controls execution of the sequential algorithm to condition the comparators to scan symbols in parallel but in each of the blocks sequentially and cause matching sequences and nonmatching sequences of symbols to be stored in the array. The parameters i and j are selected to limit the number of comparators required to achieve a desired degree of efficiency in executing the algorithm based upon a trade-off of algorithm execution speed versus hardware cost. A priority encoder calculates from signals output by the slice units each j,i address in which a matching sequence is identified, but it outputs the address of only one (such as the smallest) of these addresses.
-
Patent Agency Ranking
公开(公告)号：DE68926270T2
公开(公告)日：1996-10-10
申请号：DE68926270
申请日：1989-06-08
Applicant: IBM
Inventor： CHEVION DAN SHMUEL , KARNIN EHUD DOV , WALACH EUGENIUSZ
IPC: H03M7/40
Abstract: An improved method is disclosed for generating a compressed representation of a source data string each symbol of which is taken from a finite set of m + 1 symbols, a0 to am . 'The method is based on an arithmetic coding procedure wherein the compressed representation is recursively generated as successive sub-intervals within a predetermined interval. The width of each sub-interval is theoretically equal to the width of the previous sub-interval multiplied by the probability of the current symbol. The improvement is achieved by approximating the width of the previous sub-interval so that the approximation can be obtained by a single shift and add operation using a suitable shift register.
-
公开(公告)号：DE3885551D1
公开(公告)日：1993-12-16
申请号：DE3885551
申请日：1988-08-18
Applicant: IBM
Inventor： CHEVION DAN SHMUEL , KARNIN EHUD DOV , WALACH EUGENIUSZ
-
公开(公告)号：ES2145100T3
公开(公告)日：2000-07-01
申请号：ES94304678
申请日：1994-06-27
Applicant: IBM
Inventor： HASSNER MARTIN AURELIANO , KARNIN EHUD DOV , SCHWIEGELSHOHN UWE , TAMURA TETSUYA
Abstract: An apparatus and method for executing a sequential data compression algorithm that is especially suitable for use where data compression is required in a device (as distinguished from host) controller. A history buffer 22 comprises an array of i identical horizontal slice units. Each slice unit stores j symbols to define j separate blocks in which the symbols in each slice unit are separated by exactly i symbols. Symbols in a string of i incoming symbols are compared by i comparators in parallel with symbols previously stored in the slice units to identify matching sequences of symbols. A control unit controls execution of the sequential algorithm to condition the comparators to scan symbols in parallel but in each of the blocks sequentially and cause matching sequences and nonmatching sequences of symbols to be stored in the array. The parameters i and j are selected to limit the number of comparators required to achieve a desired degree of efficiency in executing the algorithm based upon a trade-off of algorithm execution speed versus hardware cost. A priority encoder calculates from signals output by the slice units each j,i address in which a matching sequence is identified, but it outputs the address of only one (such as the smallest) of these addresses.
-
公开(公告)号：AT192614T
公开(公告)日：2000-05-15
申请号：AT94304678
申请日：1994-06-27
Applicant: IBM
Inventor： HASSNER MARTIN AURELIANO , KARNIN EHUD DOV , SCHWIEGELSHOHN UWE , TAMURA TETSUYA
Abstract: An apparatus and method for executing a sequential data compression algorithm that is especially suitable for use where data compression is required in a device (as distinguished from host) controller. A history buffer 22 comprises an array of i identical horizontal slice units. Each slice unit stores j symbols to define j separate blocks in which the symbols in each slice unit are separated by exactly i symbols. Symbols in a string of i incoming symbols are compared by i comparators in parallel with symbols previously stored in the slice units to identify matching sequences of symbols. A control unit controls execution of the sequential algorithm to condition the comparators to scan symbols in parallel but in each of the blocks sequentially and cause matching sequences and nonmatching sequences of symbols to be stored in the array. The parameters i and j are selected to limit the number of comparators required to achieve a desired degree of efficiency in executing the algorithm based upon a trade-off of algorithm execution speed versus hardware cost. A priority encoder calculates from signals output by the slice units each j,i address in which a matching sequence is identified, but it outputs the address of only one (such as the smallest) of these addresses.
-
公开(公告)号：DE3750390T2
公开(公告)日：1995-03-30
申请号：DE3750390
申请日：1987-10-02
Applicant: IBM
Inventor： ARPS RONALD BARTHOLD , KARNIN EHUD DOV
Abstract: Method and means are disclosed for detecting any single errors introduced into an arithmetic data compression code string as a result of coding, transmission, or decoding through testing according to a modulo-n function, n being an odd number not equal to +1 or -1, an arithmetic compression coded data stream C'(s) generated by n-scaling an arithmetically recursive function that produces a non-scaled arithmetically data compressed code stream C(s) as a number in the semi-open coding range [0,1).
-
-
-
-
-
-
-
-
-
Search Results
15
records
(took 0.01 seconds)
