System, method and computer program product for managing tabulated metadata
    11.
    发明授权
    System, method and computer program product for managing tabulated metadata 有权
    用于管理表格元数据的系统,方法和计算机程序产品

    公开(公告)号:US08959113B2

    公开(公告)日:2015-02-17

    申请号:US13431753

    申请日:2012-03-27

    CPC classification number: G06F17/30525 G06F21/6227 G06F2221/2141

    Abstract: Embodiments disclosed herein provide systems and methods for managing metadata, including scalar, text, drop-down, type ahead, and tabular metadata related to digital assets. Restrictions may be set at the metadata field level to allow users of different user groups to view fields based on restriction classes. A metadata management tool may allow an administrator to restrict one or more metadata fields associated with a digital asset in a network with a restriction class. The restricted fields may be associated with one or more user groups in the network. Only users in the user groups associated with the restriction class can view the restricted fields, in addition to the digital asset and any unrestricted fields associated therewith. When searching tabular metadata, a ‘row oriented’ search function may retrieve only assets where the search criteria are matched by a single row.

    Abstract translation: 本文公开的实施例提供了用于管理元数据的系统和方法,包括标量,文本,下拉,前进类型,以及与数字资产相关的表格元数据。 可以在元数据字段级别设置限制,以允许不同用户组的用户基于限制类来查看字段。 元数据管理工具可以允许管理员限制与具有限制类的网络中的数字资产相关联的一个或多个元数据字段。 受限字段可以与网络中的一个或多个用户组相关联。 与限制类相关联的用户组中的用户除了数字资产和与其相关联的任何无限制字段之外,还可以查看受限制的字段。 当搜索表格元数据时,“面向行”的搜索功能可以仅检索搜索条件由单个行匹配的资产。

    System and method for managing enterprise-level interrelated site, channel, and content objects
    13.
    发明授权
    System and method for managing enterprise-level interrelated site, channel, and content objects 有权
    用于管理企业级相关站点,通道和内容对象的系统和方法

    公开(公告)号:US08805878B2

    公开(公告)日:2014-08-12

    申请号:US10681710

    申请日:2003-10-08

    CPC classification number: H04L41/50 G06F17/3089

    Abstract: Systems and methods for managing enterprise-level interrelated content items used in Web sites. In accordance with the present disclosure, site objects, channel objects and content objects are associated with each other to form a hierarchical site structure. The content objects are linked to corresponding content items in a content repository, and are grouped together by association with channel objects in the site structure. Each of the objects in the site structure has an associated set of content services and can be deployed individually or in combination, while maintaining references to the related objects in the hierarchical site structure.

    Abstract translation: 用于管理网站中使用的企业级相关内容项的系统和方法。 根据本公开,站点对象,信道对象和内容对象彼此关联以形成分层站点结构。 内容对象链接到内容存储库中的相应内容项,并通过与站点结构中的通道对象相关联将其分组在一起。 站点结构中的每个对象都具有关联的一组内容服务,并且可以单独或组合部署,同时保持对分层站点结构中的相关对象的引用。

    SYSTEM, METHOD AND COMPUTER PROGRAM PRODUCT FOR EFFICIENT CACHING OF HIERARCHICAL ITEMS
    15.
    发明申请
    SYSTEM, METHOD AND COMPUTER PROGRAM PRODUCT FOR EFFICIENT CACHING OF HIERARCHICAL ITEMS 有权
    系统,方法和计算机程序产品,用于高效地分层分析

    公开(公告)号:US20140207825A1

    公开(公告)日:2014-07-24

    申请号:US14223785

    申请日:2014-03-24

    Applicant: Open Text S.A.

    Abstract: Embodiments disclosed herein provide a “lazy” approach in caching a hierarchical navigation tree with one or more associated permission trees. In one embodiment, only a portion of a cached permission tree is updated. One embodiment of a method may comprise determining whether a dirty node exists by comparing tree timestamps of the permission tree and the master tree. If the tree timestamp of the master tree is temporally more recent than the tree timestamp of the permission tree, the permission tree has a dirty node and the method may operate to check node timestamps of the master and permission trees. This process may be repeated until the dirty node is found, at which time a portion of the permission tree associated with the dirty node may be reconstructed, rather than the entire permission tree itself, thereby eliminating or significantly reducing access time to the cached permission tree.

    Abstract translation: 本文公开的实施例提供了一种“延迟”方法来缓存具有一个或多个相关权限树的层次导航树。 在一个实施例中,仅更新缓存许可树的一部分。 方法的一个实施例可以包括通过比较权限树和主树的树时间戳来确定是否存在脏节点。 如果主树的树时间戳在时间上比权限树的树时间戳更新,则权限树具有脏节点,并且该方法可以操作以检查主节点和权限树的节点时间戳。 可以重复该过程,直到找到脏节点,此时可以重建与脏节点相关联的许可树的一部分而不是整个权限树本身,从而消除或显着减少到缓存的权限树的访问时间 。

    NUMERIC VALUE DECAY FOR EFFICIENT RELEVANCE COMPUTATION
    16.
    发明申请
    NUMERIC VALUE DECAY FOR EFFICIENT RELEVANCE COMPUTATION 审中-公开
    数值衰减有效的相关性计算

    公开(公告)号:US20140207747A1

    公开(公告)日:2014-07-24

    申请号:US14079785

    申请日:2013-11-14

    Applicant: Open Text S.A.

    CPC classification number: G06F17/30864

    Abstract: Search engines today are capable of incorporating numeric scoring modifiers from controlling applications into their relevance computations. Challenges arise in keeping these modifiers current, given that they may change over time. Embodiments provide a new way to compute numeric value decay for efficient relevance computation without having to rely on a controlling application. The controlling application can set a value for a modifier of an object managed by the controlling application and the controlling application can perform operations on the modifier. However, the controlling application does not need to keep track of the modifier and compute the modifier value independently. Rather, a search engine is configured to perform decay computation(s) and adjust the modifier value on a regular basis or on demand. The search engine ensures that modifier values for all the objects indexed by the search engine are always valid—within acceptable ranges and with acceptable adjustments.

    Abstract translation: 今天的搜索引擎能够将数字评分修饰符从控制应用程序纳入其相关性计算。 保持这些修饰符是最新的挑战,因为它们可能随时间而改变。 实施例提供了一种用于计算数值衰减的新方法,用于有效的相关性计算,而不必依赖于控制应用。 控制应用程序可以设置由控制应用程序管理的对象的修改器的值,并且控制应用程序可以对修改器执行操作。 然而,控制应用程序不需要跟踪修饰符并独立地计算修饰符值。 相反,搜索引擎被配置为执行衰减计算并且定期或按需调整修改值。 搜索引擎确保搜索引擎索引的所有对象的修饰符值始终有效 - 在可接受的范围内并具有可接受的调整。

    Workflow data binding
    20.
    发明授权
    Workflow data binding 有权
    工作流数据绑定

    公开(公告)号:US08719773B2

    公开(公告)日:2014-05-06

    申请号:US12353849

    申请日:2009-01-14

    Abstract: A workflow data binding system facilitates binding of a data component to a feature of a software component. Prior to the binding, a graphical indication of the software component and a graphical indication of the feature of the software component are displayed. In addition, an indication of an element of the data component is displayed in a display area approximately adjacent to the displayed software component. The workflow data binding system receives a user input command to bind the data component to the feature of the software component. The user input command may include dragging the indication of an element of the data component from the data component display area to the feature of the software component and subsequently dropping it on the feature. As a result, the workflow data binding system automatically generates script or code that provides executable instructions to bind the feature of the software component to the data component.

    Abstract translation: 工作流数据绑定系统便于将数据组件绑定到软件组件的特征。 在绑定之前,显示软件组件的图形指示和软件组件的特征的图形指示。 此外,在与所显示的软件组件近似的显示区域中显示数据组件的元素的指示。 工作流数据绑定系统接收用户输入命令以将数据组件绑定到软件组件的特征。 用户输入命令可以包括将数据组件的元素的指示从数据组件显示区域拖动到软件组件的特征,并随后将其放在特征上。 因此,工作流数据绑定系统自动生成提供可执行指令以将软件组件的特征绑定到数据组件的脚本或代码。

Patent Agency Ranking