SYSTEM AND METHOD IN A DATA TABLE FOR EXPORTING AND IMPORTING RECURSIVE SCALABLE TEMPLATES
    1.
    发明申请
    SYSTEM AND METHOD IN A DATA TABLE FOR EXPORTING AND IMPORTING RECURSIVE SCALABLE TEMPLATES 审中-公开
    用于出口和进口可追溯标定模板的数据表中的系统和方法

    公开(公告)号:WO2004092976A3

    公开(公告)日:2005-08-18

    申请号:PCT/EP2004003035

    申请日:2004-02-27

    CPC classification number: G06F17/246

    Abstract: The present invention is directed to a method, system and program for exporting, from a source electronic data table comprising a plurality of objects having parent-child relationships to a destination electronic data table, one or several of objects with their filiation. The method for use in a computer comprises the steps of : defining objects and associating with each object one or a plurality of parent objects or one or a plurality of child objects or both; associating with each object a unique object reference (OR) equal to a prime number; determining for each object whether said object is associated with at least a child object or not : if said object is not associated with at least one child object, defining a filiation reference (FR) equal to 1; if said object is associated with at least one child object, defining a filiation reference (FR) equal to the product of two terms : a first term, equal to the product of each object reference (OR) associated with each child object of said object: a second term equal to the least common multiplier (LCM) of the filiation references of the child objects associated with said object : receiving an export command for exporting one or a plurality of selected objects with associated child objects; associating with each object, a selected children variable (SC) for determining whether or not said object belongs to the set of child objects associated with selected objects, said selected children variable being equal to : a first Boolean value if the least common multiplier (LCM) of the filiation references of the one or plurality of selected objects is a multiple of the own object reference: a second Boolean value if the least common multiplier (LCM) of the filiation references of the one or plurality of selected objects is not a multiple of the own object reference: exporting to the destination data table, the selected objects and the objects with a selected children variable (SC) equal to said first Boolean value.

    Abstract translation: 本发明涉及一种用于从包括具有父子关系的多个对象的源电子数据表导出到目的地电子数据表的方法,系统和程序,其中一个或几个具有其归档的对象。 在计算机中使用的方法包括以下步骤:定义对象并且与每个对象相关联一个或多个父对象或一个或多个子对象或两者; 与每个对象关联等于素数的唯一对象引用(OR); 确定每个对象是否所述对象与至少一个子对象相关联:如果所述对象不与至少一个子对象相关联,则定义等于1的子化参考(FR); 如果所述对象与至少一个子对象相关联,则定义等于两个项的乘积的子化参考(FR):第一项,等于与所述对象的每个子对象相关联的每个对象引用(OR)的乘积 :等于与所述对象相关联的子对象的归档引用的最小公用乘数(LCM)的第二项:接收用于将一个或多个所选对象与相关联的子对象一起导出的导出命令; 与每个对象相关联的所选择的子变量(SC),用于确定所述对象是否属于与所选对象相关联的一组子对象,所述选择的子变量等于:如果最小公倍数(LCM)为第一布尔值 )所述一个或多个所选择的对象的所述提取引用的倍数是所述自身对象引用的倍数:如果所述一个或多个所选对象的所述归档引用的最小公用乘数(LCM)不是多个,则所述第二布尔值 的自己的对象引用:导出到目标数据表,所选对象和具有等于所述第一布尔值的所选子变量(SC)的对象。

    3.
    发明专利
    未知

    公开(公告)号:FR1203566A

    公开(公告)日:1960-01-20

    申请号:FR1203566D

    申请日:1958-03-13

    Applicant: CIE IBM

    Inventor: DUNEAU JACQUES

    6.
    发明专利
    未知

    公开(公告)号:DE60203525D1

    公开(公告)日:2005-05-04

    申请号:DE60203525

    申请日:2002-05-23

    Abstract: System and program product are provided for facilitating on-line help information in an office application which includes one or more objects. The on-line help information is dependent on content of a selected object of the office application. A user of the office application is provided with help information setting forth an example directly derived from content of the currently selected object or cell. Content of a user entry field within the object is parsed to determine whether a predefined keyword is present, and if so, at least one parameter associated with the keyword and at least one format or rule related to the at least one parameter are identified. The at least one format and rule specified in the help information are employed in correcting content of the user entry field, for example, for display to the user.

Patent Agency Ranking