公开(公告)号：US08028280B2

公开(公告)日：2011-09-27

申请号：US12015591

申请日：2008-01-17

Applicant: Rajendra Kumar Bera

Inventor： Rajendra Kumar Bera

IPC: G06F9/45

CPC classification number: G06F8/443

Abstract: A computer program product and computer system for implementing a method of compiler optimisation of source code during compilation of the source code in a computer environment. The compiler optimisation of source code includes: recasting two algebraic expressions into a form of one or more token pairs arranged sequentially in a string, each token pair including an operator followed by an operand; reducing the strings in accordance with a set of predetermined simplifying rules; and comparing the reduced strings by matching to detect an equivalence of the two algebraic expressions.

Abstract translation: 一种计算机程序产品和计算机系统，用于在计算机环境中的源代码编译期间实现源代码的编译器优化方法。 源代码的编译器优化包括：将两个代数表达式重新形成一个顺序排列在一个字符串中的一个或多个令牌对的形式，每个令牌对包括一个操作符，后跟一个操作数; 根据一组预定的简化规则减少字符串; 并通过匹配比较缩减的字符串以检测两个代数表达式的等价。

公开(公告)号：US07836112B2

公开(公告)日：2010-11-16

申请号：US11231091

申请日：2005-09-20

Applicant: Rajendra Kumar Bera

Inventor： Rajendra Kumar Bera

IPC: G06F15/00 ,  G06F13/00

CPC classification number: G06F17/12

Abstract: A computer implemented method (200) is described for determining the equivalence of two sets of simultaneous linear algebraic equations. Each of said equations is of a form: ei1x1+ei2x2+ei3x3+ . . . +eiixn=bi wherein xj are unknowns, eij are coefficients and bi are quantities, and defining the relationship between the unknowns within the set. The coefficients and quantities are known algebraic expressions. The unknowns are iteratively eliminated (250 to 280) from each of the sets of simultaneous linear algebraic equations until each of said equations are in the form: (lii)kxi=(ri)k wherein lii and ri are algebraic expressions, and k={1;2} indicate one of said sets that said equation is derived from. The products (lii)1*(ri)2 and (lii)2*(ri)1 are compared (300) for each of the unknowns. Only if the products match (310) for all the unknowns are the two sets of simultaneous linear algebraic equations equivalent (312). An apparatus (100) for performing the above method (200) is also provided.

Abstract translation: 描述了用于确定两组同时线性代数方程的等价性的计算机实现方法（200）。 所述等式的每一个都具有以下形式：ei1x1 + ei2x2 + ei3x3 +。 。 。 + eiixn = bi其中xj是未知数，eij是系数，bi是数量，并且定义集合内的未知数之间的关系。 系数和数量是已知的代数表达式。 未知数从每组同时线性代数方程中迭代消除（250至280），直到每个所述等式为：（lii）kxi =（ri）k其中lii和ri是代数表达式，k = {1; 2}表示所述等式得出的所述集合中的一个。 对于每个未知数，对产品（lii）1 *（ri）2和（lii）2 *（ri）1进行比较（300）。 只有当所有未知数的产品匹配（310）是等效的两组同时线性代数方程（312）时。 还提供了一种用于执行上述方法（200）的设备（100）。

公开(公告)号：US07337437B2

公开(公告)日：2008-02-26

申请号：US09728096

申请日：2000-12-01

Applicant: Rajendra Kumar Bera

Inventor： Rajendra Kumar Bera

IPC: G06F9/45

CPC classification number: G06F8/443

Abstract: A method, apparatus, and computer program product for determining, in a computer environment, the equivalence, if any, of two algebraic expressions. The expressions are recast into a form of one or more token pairs arranged sequentially in a string, such that each token pair includes an operator followed by an operand. The strings are reduced in accordance with a set of predetermined simplifying rules. The reduced strings are compared by matching, to detect equivalence of the two algebraic expressions. The source code is compiled into object code, wherein the source code includes the two algebraic expressions, and wherein the compiling includes the recasting, the reducing, and the comparing. The method, apparal us, and computer program product may be used in compiler optimisation of source code and like computing tasks.

Abstract translation: 一种用于在计算机环境中确定两个代数表达式的等价性（如果有的话）的方法，装置和计算机程序产品。 这些表达式被重新形成一个顺序排列在一个字符串中的一个或多个令牌对的形式，使得每个令牌对都包括一个操作符，后跟一个操作数。 根据一组预先确定的简化规则，减少字符串。 缩小的字符串通过匹配进行比较，以检测两个代数表达式的等价性。 将源代码编译成目标代码，其中源代码包括两个代数表达式，其中编译包括重新编译，缩小和比较。 该方法，apparal我们和计算机程序产品可以用于源代码的编译器优化和计算任务。

公开(公告)号：US20080127152A1

公开(公告)日：2008-05-29

申请号：US12015591

申请日：2008-01-17

Applicant: Rajendra Kumar Bera

Inventor： Rajendra Kumar Bera

IPC: G06F9/45

CPC classification number: G06F8/443

Abstract: A computer program product and computer system for implementing a method of compiler optimisation of source code during compilation of the source code in a computer environment. The compiler optimisation of source code includes: recasting two algebraic expressions into a form of one or more token pairs arranged sequentially in a string, each token pair including an operator followed by an operand; reducing the strings in accordance with a set of predetermined simplifying rules; and comparing the reduced strings by matching to detect an equivalence of the two algebraic expressions.

Abstract translation: 一种计算机程序产品和计算机系统，用于在计算机环境中的源代码编译期间实现源代码的编译器优化方法。 源代码的编译器优化包括：将两个代数表达式重新形成一个顺序排列在一个字符串中的一个或多个令牌对的形式，每个令牌对包括一个操作符，后跟一个操作数; 根据一组预定的简化规则减少字符串; 并通过匹配比较缩减的字符串以检测两个代数表达式的等价。

公开(公告)号：US06839749B1

公开(公告)日：2005-01-04

申请号：US09613523

申请日：2000-07-10

Applicant: Rajendra Kumar Bera

Inventor： Rajendra Kumar Bera

IPC: G06F15/16 ,  G06F17/50

CPC classification number: G06F17/509

Abstract: A computer implemented method (200) is provided for representing a network in a canonical form. The network has nodes and arcs. Each arc has a source node and a destination node. Each node has an identifier, and optionally, one or more properties. Various manipulations that may be carried out on the network's canonical representation are also provided. Further, a computer implemented method is provided for determining the equivalence between two networks either on the basis of the nodes' identifiers or some specific property of the nodes. An apparatus (100) for performing the above method (200) is also provided.

公开(公告)号：US06658643B1

公开(公告)日：2003-12-02

申请号：US09644119

申请日：2000-08-23

Applicant: Rajendra Kumar Bera

Inventor： Rajendra Kumar Bera

IPC: G06F944

CPC classification number: G06F11/3616 ,  G06F8/70

Abstract: A method and system for analysing software to estimate the cost of production, development and maintenance of computer applications. Unlike previous proposals for such analysis, where the primary measured parameters are the numbers of lines of code and function points, the inventive method identifies high complexity software segments arising from specific discontinuities in execution of the program, ie points at which the program has to, in effect, make decisions. These items are assigned complexity indices which may be summed to give an overall complexity value for the program or the indices may be displayed as a histogram showing the complexity distribution of the program.

Abstract translation: 一种用于分析软件以估计计算机应用的生产，开发和维护成本的方法和系统。 不同于以前关于这种分析的建议，其中主要测量参数是代码行和功能点的数量，本发明的方法识别由程序执行中的特定不连续性引起的高复杂性软件段，即程序必须的点， 实际上做出决定。 这些项目被分配复杂度指数，其可以被相加以给出程序的整体复杂性值，或者索引可以被显示为示出程序的复杂度分布的直方图。

公开(公告)号：US06625599B1

公开(公告)日：2003-09-23

申请号：US09574152

申请日：2000-05-18

Applicant: Rajendra Kumar Bera

Inventor： Rajendra Kumar Bera

IPC: G06F1730

CPC classification number: G06F7/02 ,  G06F2207/025 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99935 ,  Y10S707/99936

Abstract: A method and apparatus for searching data to locate a portion identified by a search query. The data may comprise text files in a database. The search query comprises a sequence of two or more data fragments expected to be contained in the portion of data being sought. The method comprises receiving the data fragments and searching the data to locate the first fragment, then searching to find the location of the last. The method may include locating the earliest match between the data and the last data fragment which is preceded by matches between the data and each other fragment, the object being to find the shortest section of data which contains all the fragments in the right sequence and without overlapping one with another. The identified portion of text can be highlighted in a display of the data.

Abstract translation: 一种用于搜索数据以定位由搜索查询识别的部分的方法和装置。 数据可以包括数据库中的文本文件。 搜索查询包括期望包含在正在搜索的数据部分中的两个或更多个数据片段的序列。 该方法包括接收数据片段并搜索数据以定位第一片段，然后搜索找到最后片段的位置。 该方法可以包括定位数据与最后数据片段之间的最早的匹配，其前面是数据和每个其他片段之间的匹配，该对象是找到包含正确序列中的所有片段的最短部分数据，而没有 与另一个重叠。 文本的识别部分可以在数据的显示中突出显示。

公开(公告)号：US07130806B1

公开(公告)日：2006-10-31

申请号：US09722133

申请日：2000-11-24

Applicant: Rajendra Kumar Bera

Inventor： Rajendra Kumar Bera

IPC: G06Q10/00

CPC classification number: G06Q10/109 ,  G06Q10/02

Abstract: The present invention discloses a method of allocating resource units such as hotel rooms, computer memory locations, seats in an aircraft, etc which constitute a sequence of allocatable resource units. Each resource unit is identified with a leading and a trailing identifier separated by a first divider and placed in a string which is able to be compared with a similar string representing an allocation criterion. The strings are matched and if a match is successful then the first divider of the matched portion of the string is replaced with a second divider which thereby indicates that an allocation has been made. A system for carrying out the above method and a computer program product incorporating the method are also disclosed. A method of queuing resource allocation and deallocation requests is also disclosed.

Abstract translation: 本发明公开了一种分配诸如酒店房间，计算机存储器位置，飞机中的座位等资源单元的方法，其构成可分配资源单元的序列。 每个资源单元用一个由第一分隔符分隔的前导标识符和尾部标识符标识，并被放置在能够与表示分配标准的类似字符串进行比较的字符串中。 字符串匹配，如果匹配成功，则字符串的匹配部分的第一个分隔符被替换为第二个分隔符，从而指示已经进行了分配。 还公开了一种用于执行上述方法的系统和结合该方法的计算机程序产品。 还公开了排队资源分配和释放请求的方法。

公开(公告)号：US06963865B2

公开(公告)日：2005-11-08

申请号：US09826710

申请日：2001-04-05

Applicant: Rajendra Kumar Bera

Inventor： Rajendra Kumar Bera

IPC: G06F17/30

CPC classification number: G06F17/30985 ,  Y10S707/99933 ,  Y10S707/99943 ,  Y10S707/99945 ,  Y10S707/99952

Abstract: A method and apparatus for searching data to locate a portion identified by a search query. The data may comprise text files in a database. The search query comprises two or more data fragments expected to be contained in the portion of data being sought and in any order. The method comprises receiving the data fragments and searching the data to locate matches between the data and the respective data fragments. Any overlapping matches are discriminated and replaced by an iterative search process until there is found a minimal portion of the data containing all of the data fragments without overlaps, the term minimal meaning a portion with only one complete set of the data fragments (though some but not all can be duplicated). The identified portion of text can be highlighted in a display of the data.

Abstract translation: 一种用于搜索数据以定位由搜索查询识别的部分的方法和装置。 数据可以包括数据库中的文本文件。 搜索查询包括期望包含在正在寻找的数据部分中的任何顺序的两个或更多个数据片段。 该方法包括接收数据片段并搜索数据以定位数据与相应数据片段之间的匹配。 任何重叠的匹配被区分并被迭代搜索过程所代替，直到发现包含所有数据片段的数据的最小部分没有重叠，术语最小意味着仅具有一组完整数据片段的部分 不是全部都可以重复）。 文本的识别部分可以在数据的显示中突出显示。

公开(公告)号：US06636880B1

公开(公告)日：2003-10-21

申请号：US09664185

申请日：2000-09-18

Applicant: Rajendra Kumar Bera

Inventor： Rajendra Kumar Bera

IPC: G06F700

CPC classification number: G06F8/423 ,  G06F8/437

Abstract: A remedial method (200) and apparatus (100) is described, by which unit information can be documented in a computer program. A set of user-supplied precompiler directives is added to the computer program that is to be converted, in which a preferred set of units, called primary units, are prescribed. A precompiler tool performs a conversion of a unit to its corresponding unit in the preferred set of units.

Abstract translation: 描述了补救方法（200）和装置（100），通过该补救方法可以在计算机程序中记录单位信息。 一组用户提供的预编译器指令被添加到要转换的计算机程序中，其中规定了称为主单元的优选单元组。 预编译器工具在首选单位集中执行单元到其对应单元的转换。