利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

9 条记录 (耗时 0.02 秒)

    Method and system for comparing and updating file trees
    1.
    发明授权
    Method and system for comparing and updating file trees 有权
    用于比较和更新文件树的方法和系统

    公开(公告)号：US07702641B2

    公开(公告)日：2010-04-20

    申请号：US10021943

    申请日：2001-12-12

    申请人： Brian Holtz ,  Vijay Balasubramanian ,  Nidheesh Dubey ,  Aseem Sharma ,  Vivek Pandey

    发明人： Brian Holtz ,  Vijay Balasubramanian ,  Nidheesh Dubey ,  Aseem Sharma ,  Vivek Pandey

    IPC分类号： G06F17/30 ,  G06F7/00

    CPC分类号： G06F17/30091 ,  Y10S707/99942

    摘要： The embodiments of the present invention provide a method for comparing file tree descriptions and generating a sequenced log of changes that transform an old file tree to a new file tree. According to one embodiment, the inputs to this comparator are two tree-structured descriptions called file tree indices, and the outputs are a sequence of file tree operations that can transform the old tree to the current tree. According to another embodiment, the comparator has two top level steps, where at step one it recursively goes through the old file tree index and compares each folder along with its children with that of the corresponding file tree generating a raw operation log, and at step two after the recursion is done, the comparator processes the raw operation log and optimizes certain sets of operations by transforming them into single operations.

    摘要翻译： 本发明的实施例提供了一种用于比较文件树描述并生成将旧文件树变换为新文件树的改变的排序日志的方法。 根据一个实施例，该比较器的输入是称为文件树索引的两个树结构描述，并且输出是可以将旧树变换为当前树的文件树操作的序列。 根据另一个实施例，比较器具有两个顶级步骤，其中在步骤1中递归地遍历旧的文件树索引，并将每个文件夹与其子节点与生成原始操作日志的相应的文件树的每个文件夹进行比较，并且在步骤 在递归完成之后，比较器处理原始操作日志，并通过将其转换为单个操作来优化某些操作集。

    File tree conflict processor
    2.
    发明授权
    File tree conflict processor 有权
    文件树冲突处理器

    公开(公告)号：US07165248B2

    公开(公告)日：2007-01-16

    申请号：US10023378

    申请日：2001-12-12

    申请人： Brian Holtz ,  Vijay Balasubramanian ,  Nidheesh Dubey ,  Aseem Sharma ,  Vivek Pandey

    发明人： Brian Holtz ,  Vijay Balasubramanian ,  Nidheesh Dubey ,  Aseem Sharma ,  Vivek Pandey

    IPC分类号： G06F9/44 ,  G06F7/00

    CPC分类号： G06F17/30176 ,  Y10S707/99931 ,  Y10S707/99938

    摘要： The embodiments of the present invention provide a method for resolving conflicting changes encountered when reconciling parallel user changes to two synchronized trees of folders and files. According to one embodiment, these conflicts are presented to the user as an interface that requires an indication from the user to the winner of the conflict. According to another embodiment, since certain conflicts cannot be resolved independently, they have to be combined and presented to the user as a single conflict. According to yet another embodiment, after the user has indicated which operations are the winners of all or some of the conflicts, the winning operations are applied to the file tree with which they are in conflict.

    摘要翻译： 本发明的实施例提供了一种用于解决在将并行用户改变与两个同步的文件夹和文件树进行协调时遇到的冲突变化的方法。 根据一个实施例，这些冲突作为需要从用户向冲突获胜者指示的界面呈现给用户。 根据另一个实施例，由于某些冲突不能独立地解决，它们必须被组合并作为单个冲突呈现给用户。 根据另一个实施例，在用户已经指示哪些操作是所有或某些冲突的获胜者之后，获胜操作被应用于与它们冲突的文件树。

    File tree change reconciler
    3.
    发明授权
    File tree change reconciler 有权
    文件树更改调节器

    公开(公告)号：US07085779B2

    公开(公告)日：2006-08-01

    申请号：US10021854

    申请日：2001-12-12

    申请人： Brian Holtz ,  Vijay Balasubramanian ,  Nidheesh Dubey ,  Aseem Sharma ,  Vivek Pandey

    发明人： Brian Holtz ,  Vijay Balasubramanian ,  Nidheesh Dubey ,  Aseem Sharma ,  Vivek Pandey

    IPC分类号： G06F12/00 ,  G06F17/30

    CPC分类号： G06F17/30067 ,  Y10S707/99952 ,  Y10S707/99953

    摘要： Methods and systems are provided for reconciling any changes that have occurred in two file trees since they were last synchronized. A reconciler takes as input two logs of the changes made in the respective file trees. The first log resides on a client computing device, and the second log resides on a server computing device. The reconciler outputs two sets of changes that need to be applied to the respective file trees in order to synchronize them. The reconciler detects and outputs a list of changes that conflict with each other.

    摘要翻译： 提供了方法和系统，用于协调自上次同步以来在两个文件树中发生的任何更改。 调和器将相应文件树中所做更改的两个日志作为输入。 第一个日志驻留在客户端计算设备上，第二个日志驻留在服务器计算设备上。 调和器输出需要应用于相应文件树的两组更改，以便同步它们。 调和器检测并输出相互冲突的更改列表。

    Method and system of executing a software application in highly constrained memory situation
    5.
    发明授权
    Method and system of executing a software application in highly constrained memory situation 有权
    在高度受限的内存情况下执行软件应用程序的方法和系统

    公开(公告)号：US07895427B2

    公开(公告)日：2011-02-22

    申请号：US11846527

    申请日：2007-08-29

    申请人： Rajesh Kumar Sinha ,  Vivek Pandey

    发明人： Rajesh Kumar Sinha ,  Vivek Pandey

    IPC分类号： G06F15/177

    CPC分类号： G06F9/44505

    摘要： A method and system for executing a software application having a binary size that is larger than an available memory space in an embedded system from which the software application will execute. The software application is split into one or more initialization sequences and a main code sequence. The method includes loading (302) each initialization sequence of the one or more initialization sequences in the memory space prior to its execution, and executing (304) each initialization sequence of the one or more initialization sequences out of the memory space. Further, the method includes loading (306) the main code sequence in the memory space after the execution of the one or more initialization codes and then executing (308) the main code sequence out of the memory space.

    摘要翻译： 一种用于执行软件应用程序的方法和系统，所述软件应用程序具有大于所述软件应用将从其执行的嵌入式系统中的可用存储器空间的二进制大小。 软件应用程序分为一个或多个初始化序列和主要代码序列。 该方法包括在其执行之前将（存储器）空间中的一个或多个初始化序列的每个初始化序列加载（302），并且从存储器空间中执行（304）一个或多个初始化序列的每个初始化序列。 此外，该方法包括在执行一个或多个初始化代码之后将主代码序列加载（306）到存储器空间中，然后从存储器空间执行（308）主代码序列。

    METHOD AND SYSTEM OF EXECUTING A SOFTWARE APPLICATION IN HIGHLY CONSTRAINED MEMORY SITUATION
    9.
    发明申请
    METHOD AND SYSTEM OF EXECUTING A SOFTWARE APPLICATION IN HIGHLY CONSTRAINED MEMORY SITUATION 有权
    在高度约束的记忆状况下执行软件应用的方法和系统

    公开(公告)号：US20080077787A1

    公开(公告)日：2008-03-27

    申请号：US11846527

    申请日：2007-08-29

    申请人： Rajesh Kumar SINHA ,  Vivek Pandey

    发明人： Rajesh Kumar SINHA ,  Vivek Pandey

    IPC分类号： G06F9/445

    CPC分类号： G06F9/44505

    摘要： A method and system for executing a software application having a binary size that is larger than an available memory space in an embedded system from which the software application will execute. The software application is split into one or more initialization sequences and a main code sequence. The method includes loading (302) each initialization sequence of the one or more initialization sequences in the memory space prior to its execution, and executing (304) each initialization sequence of the one or more initialization sequences out of the memory space. Further, the method includes loading (306) the main code sequence in the memory space after the execution of the one or more initialization codes and then executing (308) the main code sequence out of the memory space.

    摘要翻译： 一种用于执行软件应用程序的方法和系统，所述软件应用程序具有大于所述软件应用将从其执行的嵌入式系统中的可用存储器空间的二进制大小。 软件应用程序分为一个或多个初始化序列和主要代码序列。 该方法包括在其执行之前将（存储器）空间中的一个或多个初始化序列的每个初始化序列加载（302），并且从存储器空间中执行（304）一个或多个初始化序列的每个初始化序列。 此外，该方法包括在执行一个或多个初始化代码之后将主代码序列加载（306）到存储器空间中，然后从存储空间执行（308）主代码序列。