公开(公告)号：US07043510B1

公开(公告)日：2006-05-09

申请号：US09597478

申请日：2000-06-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 where 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.

公开(公告)号：US06959434B2

公开(公告)日：2005-10-25

申请号：US09727846

申请日：2000-12-01

Applicant: Rajendra Kumar Bera

Inventor： Rajendra Kumar Bera

IPC: G06F9/45

CPC classification number: G06F8/427

Abstract: The present invention is a method (100) of determining the syntactic correctness of an expression for use in a computing environment. After creating (30) a string of characters from said expression, it looks for substrings (character sequences), which are legitimate and replaces (54) them with a shorter but semantically equivalent substring. It also looks for character sequences which are illegitimate, and replaces (54) them with a substring (i.e. “?”) to indicate that it has met with an illegal sequence. It does these operations repeatedly, and in predetermined sequences, till no further changes in the string can be made; that is, the string achieves a constant length. An expression is determined to be syntactically correct only if said string reduces to a single predetermined character.

Abstract translation: 本发明是确定在计算环境中使用的表达式的句法正确性的方法（100）。 从所述表达式创建（30）一串字符后，它会查找字符串（字符序列），这些字符串是合法的，并使用较短但语义上等效的子字符串替换（54）它们。 它还查找非法的字符序列，并用子字符串（即“？”）替换它们（54），以指示它遇到了非法序列。 反复执行这些操作，并且以预定的顺序，直到不能进一步改变串; 也就是说，字符串实现了一个恒定的长度。 如果所述字符串减少到单个预定字符，则表达式被确定为在语法上是正确的。

公开(公告)号：US06745215B2

公开(公告)日：2004-06-01

申请号：US09839025

申请日：2001-04-20

Applicant: Rajendra Kumar Bera

Inventor： Rajendra Kumar Bera

IPC: G06F700

CPC classification number: G06F8/41

Abstract: In a compiler or program proving or verification software code, it is often useful to analyse a computer program and one way in which this might be partially achieved is by comparing algebraic expressions to see if they are equivalent, i.e. to see if they are derivable from a common template or function definition. Herein a string matching and replacement algorithm is used to compare two functions. Initially, each expression is converted to a “reduced” form by reference to a set of standard rules so as, for example, to ensure that terms comprising the same variables are combined. The variables names in each term are then replaced with symbols to produce, for each expression, a corresponding character string which, arranged in a predetermined order, are compared to determine equivalence of the expressions. To achieve this, a matrix M is formed with entries corresponding to the symbols and the matrix elements are incremented according to pre-set rules. The matrix is then processed to identify equivalence.

Abstract translation: 在编译器或程序证明或验证软件代码中，分析计算机程序通常是有用的，通过比较代数表达式来查看它们是否是等价的，可以部分实现这一点的一种方法 一个通用的模板或功能定义。 这里使用字符串匹配和替换算法来比较两个函数。 最初，通过参考一组标准规则将每个表达式转换为“缩减”形式，以便例如确保组合包含相同变量的术语。 每个术语中的变量名称随后被符号替换，以产生对于每个表达式，相应的字符串以预定顺序排列，以确定表达式的等价性。 为了实现这一点，矩阵M形成有与符号对应的条目，矩阵元素根据预先设定的规则递增。 然后处理矩阵以识别等价。

公开(公告)号：US06578196B1

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

申请号：US09589394

申请日：2000-06-07

Applicant: Rajendra Kumar Bera

Inventor： Rajendra Kumar Bera

IPC: G06F945

CPC classification number: G06F11/0751 ,  G06F11/3624

Abstract: A method and apparatus is described for the checking of the correctness and consistency of units and dimensions of variables and constants used in expressions, such as those used in computer programs. The present invention relates to a method (200) and apparatus (100) for performing such checking. A set of user-supplied precompiler directives is added to the computer program that is to be checked. Broadly, functions, function parameters, constants and variables are replaced with strings from the precompiler directives. The resulting expressions are reduced into a standard form. The expressions in the reduced form are tested for homogeneity according to a set of predetermined conditions.

Abstract translation: 描述了用于检查表达式中使用的变量和常数的单位和维度的正确性和一致性的方法和装置，例如在计算机程序中使用的那些。 本发明涉及一种进行这种检查的方法（200）和装置（100）。 一组用户提供的预编译指令被添加到要检查的计算机程序中。 广泛地说，函数，函数参数，常量和变量被替换为预编译指令中的字符串。 所得到的表达式被缩小为标准形式。 根据一组预定条件测试缩小形式的表达式的均匀性。

公开(公告)号：US08195802B2

公开(公告)日：2012-06-05

申请号：US11539906

申请日：2006-10-10

Applicant: Rajendra Kumar Bera

Inventor： Rajendra Kumar Bera

IPC: G06F15/173 ,  G06F12/00

CPC classification number: G06Q10/109 ,  G06Q10/02

Abstract: A method of processing allocation and deallocation requests in a computing environment. The method forms an Allocation Queue of requests for resource allocations, a Deallocation Queue of requests for resource deallocations, a Pending Queue of requests for resource allocation which cannot be met immediately, and a Cancel Queue of requests to cancel an earlier request already waiting in either the Pending Queue or the Allocation Queue. A cycle of servicing the Allocation Queue, the Deallocation Queue, the Pending Queue, and the Cancel Queue in a chronological sequence is carried out. In the cycle: the Deallocation Queue is serviced first, the Cancel Queue is serviced after the Deallocation Queue is serviced until the Cancel Queue is empty, the Pending Queue is serviced after the Cancel Queue is serviced, and the Allocation Queue Queue is serviced after the Pending Queue is serviced.

Abstract translation: 一种在计算环境中处理分配和解除分配请求的方法。 该方法形成资源分配请求的分配队列，资源释放请求的解除分配队列，不能立即满足的资源分配请求的待处理队列，以及取消队列，以取消先前已经等待的请求 挂起队列或分配队列。 执行按时间顺序对分配队列，交换分配队列，挂起队列和取消队列进行服务的周期。 在循环中：首先处理交换分配队列，在服务处理分配队列之后对取消队列进行服务，直到取消队列为空，在取消队列被服务之后为挂起队列提供服务，并且分配队列队列在 待处理队列服务。

公开(公告)号：US08176108B2

公开(公告)日：2012-05-08

申请号：US11287100

申请日：2005-11-23

Applicant: Rajendra Kumar Bera

Inventor： Rajendra Kumar Bera

IPC: G06F7/38

CPC classification number: G06F17/5036

Abstract: A first representation of an electrical network includes a first set of simultaneous linear algebraic equations (SLAE's). A second representation of an electrical network includes a second set of SLAE's. The equations of the SLAE's include a number of unknowns and have coefficients for the respective unknowns. A number of the coefficients are expressed in algebraic form. The coefficients of one such equation from one of the sets of SLAE's are for respective elements of the set's respective electrical network and the unknowns are for respective operating properties of the set's respective electrical network. Results are derived in pairs for each unknown of each respective one of the SLAE's. The pairs of results are compared in a specified manner to determine a network equivalence. The results are derived from the SLAE's and expressed in algebraic form, so that the comparing of the pairs of results includes comparing algebraic expressions.

Abstract translation: 电网的第一表示包括第一组并行线性代数方程（SLAE）。 电网的第二表示包括第二组SLAE。 SLAE的等式包括许多未知数，并且具有各个未知数的系数。 多个系数用代数形式表示。 来自SLAE集合中的一个的一个这样的等式的系数是针对组的相应电网的相应元素，并且未知数是针对组的相应电网的各自的操作属性。 对于每个SLAE的每一个的每个未知，结果成对地导出。 以指定的方式比较结果对以确定网络等价性。 结果来自于SLAE并以代数形式表示，因此比较结果包括比较代数表达式。

公开(公告)号：US08122349B2

公开(公告)日：2012-02-21

申请号：US11876213

申请日：2007-10-22

Applicant: Rajendra Kumar Bera

Inventor： Rajendra Kumar Bera

IPC: G06F17/00

CPC classification number: G06F17/24 ,  G06F17/211

Abstract: Grouping blocks of text according to user-defined contexts, and editing group specific blocks can be used to improve document consistency during editing and revising of electronic documents. A change made in one block often requires appropriate changes to be made in other blocks that are contextually related to the changed block. Such changes are made to ensure this consistency. Commands that deal with block groups (such as, create group, add block to group(s), delete block from group(s), edit group, merge group, etc.) are provided to assist a user in editing documents.

Abstract translation: 根据用户定义的上下文对文本进行分组，编辑组特定的块可用于在编辑和修改电子文档时提高文档的一致性。 在一个块中进行的更改通常需要在与更改块相关的其他块中进行适当的更改。 做出这些改变以确保这一点。 提供处理块组的命令（例如，创建组，添加块到组，从组中删除块，编辑组，合并组等）以帮助用户编辑文档。

公开(公告)号：US07954043B2

公开(公告)日：2011-05-31

申请号：US10307838

申请日：2002-12-02

Applicant: Rajendra Kumar Bera

Inventor： Rajendra Kumar Bera

IPC: G06F17/00

CPC classification number: G06F17/30008 ,  G06F21/6227 ,  G06F2221/2141 ,  G06F2221/2147

Abstract: A method, system and computer program product for enabling the concurrent editing of a document containing a plurality of independent or loosely connected segments by multiple authors is described. Among other things, the invention allows assigning of editing rights for each segment to a defined set of segment authors, making available a special segment that contains metadata shared by all the segments of said documents, and providing email means private to said document, for facilitating communication between the authors of the document.

Abstract translation: 描述了一种方法，系统和计算机程序产品，用于实现由多个作者同时编辑包含多个独立或松散连接的段的文档。 除此之外，本发明允许将每个段的编辑权限分配给定义的段作者集合，从而提供包含所有文档的所有段共享的元数据的特殊段，并且向所述文档提供私有的电子邮件手段，以便于 文件作者之间的沟通。

公开(公告)号：US06948161B2

公开(公告)日：2005-09-20

申请号：US09839071

申请日：2001-04-20

Applicant: Rajendra Kumar Bera

Inventor： Rajendra Kumar Bera

IPC: G06F9/45

CPC classification number: G06F8/4434

Abstract: The present invention discloses a method for determining, in a computer environment, the equivalence, if any, of two blocks of assignment statements in a computer program for use in compiler optimization of source code, program verification, program proving, and like computing tasks. The method, inter alia, successfully eliminates, from a block of assignment statements, all intermediate variables and statements which are identities and also those which are irrelevant to the computation of the output variables and brings the block to a form suitable for comparing two or more blocks of assignment statements. A system for carrying out the above method and a computer program product incorporating the method are also disclosed.

Abstract translation: 本发明公开了一种用于在计算机环境中确定用于源代码，程序验证，程序验证和类似计算任务的编译器优化的计算机程序中的两个分配语句块的等价性（如果有的话）的方法。 该方法除其他外，成功地从一组赋值语句中消除了所有中间变量和语句，这些变量和语句是身份，也是与输出变量的计算无关的那些，并将该块转化为适合于比较两个或多个 授权语句块。 还公开了一种用于执行上述方法的系统和结合该方法的计算机程序产品。

公开(公告)号：US06829760B1

公开(公告)日：2004-12-07

申请号：US09643572

申请日：2000-08-22

Applicant: Rajendra Kumar Bera

Inventor： Rajendra Kumar Bera

IPC: G06F945

CPC classification number: G06F9/44521

Abstract: A method 100, an apparatus, and a computer program product for constructing a runtime symbol table SymTbl[ ] for a computer program are disclosed. In the method, a symbol table SymTbl[ ] for storing one or more entities Ei is initialized 110. One or more tickets Ti are then added 120 into the symbol table SymTbl[ ] for each entity Ei that does not already exist in the symbol table SymTbl[ ]. An offset address is then inserted 130 after a predefined token “>” for each ticket Vi in a predefined set V of tickets in the symbol table SymTbl[ ] characterized as a sequence of the tickets Vi. One or more preassigned addresses are also inserted 140 in the symbol table SymTbl[ ] for each ticket Vi in the set V of tickets that has preassigned addresses.

Abstract translation: 公开了一种用于构建用于计算机程序的运行时符号表SymTbl []的方法100，装置和计算机程序产品。 在该方法中，用于存储一个或多个实体Ei的符号表SymTbl []被初始化110.然后，一个或多个票Ti被添加到符号表SymTbl []中，每个实体Ei不存在于符号表中 SymTbl []。 在符号表SymTbl []中的预定义集合V中的每个票Vi的预定义标记“>”之后插入偏移地址130，其特征在于票Vi的序列。 在具有预分配地址的票证集合V中的每个票证Vi的符号表SymTbl []中还插入一个或多个预先分配的地址140。