Method and System for Determining Overall Content Values for Content Elements in a Web Network and for Optimizing Internet Traffic Flow Through the Web Network
    31.
    发明申请
    Method and System for Determining Overall Content Values for Content Elements in a Web Network and for Optimizing Internet Traffic Flow Through the Web Network 有权
    用于确定Web网络中内容元素的总内容值并通过Web网络优化Internet流量的方法和系统

    公开(公告)号:US20100146144A1

    公开(公告)日:2010-06-10

    申请号:US12509199

    申请日:2009-07-24

    Abstract: Disclosed is a method for optimizing internet traffic flow through a web network including the steps of collecting content data corresponding to the content elements, determining a revenue value for each content element, calculating an overall content value for each content element based on the corresponding revenue value and revenue generated from subsequent traffic flow of a user during a visit to the web network, and modifying the web network based on the overall content value and the content data, so as to maximize the value of the web network. Also disclosed is a system for determining overall content values for a plurality of content elements including an analytic server for receiving content data corresponding to the content elements, and a processor for determining a revenue value for each content element, and to calculate an overall content value for each content element based on the corresponding revenue value and revenue generated from subsequent traffic flow of a user during a visit to the web network.

    Abstract translation: 本发明公开了一种通过网络网络优化互联网流量流的方法,包括以下步骤:收集对应于内容元素的内容数据,确定每个内容元素的收益值,基于相应收入值计算每个内容元素的总体内容值 以及在访问网络期间由用户的后续流量产生的收入,以及基于总体内容值和内容数据修改网络网络,以便最大化网络网络的价值。 还公开了一种用于确定多个内容元素的总体内容值的系统,包括用于接收与内容元素相对应的内容数据的分析服务器,以及用于确定每个内容元素的收入值的处理器,并且计算总体内容值 基于在访问网络期间由用户的后续业务流量产生的相应收入值和收入的每个内容元素。

    Policy-based management of a redundant array of independent nodes
    32.
    发明授权
    Policy-based management of a redundant array of independent nodes 有权
    独立节点冗余阵列的基于策略的管理

    公开(公告)号:US07657586B2

    公开(公告)日:2010-02-02

    申请号:US11638252

    申请日:2006-12-13

    Abstract: An archive cluster application runs in a distributed manner across a redundant array of independent nodes. Each node preferably runs a complete archive cluster application instance. A given nodes provides a data repository, which stores up to a large amount (e.g., a terabyte) of data, while also acting as a portal that enables access to archive files. Each symmetric node has a set of software processes, e.g., a request manager, a storage manager, a metadata manager, and a policy manager. The request manager manages requests to the node for data (i.e., file data), the storage manager manages data read/write functions from a disk associated with the node, and the metadata manager facilitates metadata transactions and recovery across the distributed database. The policy manager implements one or more policies, which are operations that determine the behavior of an “archive object” within the cluster. The archive cluster application provides object-based storage. Preferably, the application permanently associates metadata and policies with the raw archived data, which together comprise an archive object. Object policies govern the object's behavior in the archive. As a result, the archive manages itself independently of client applications, acting automatically to ensure that all object policies are valid.

    Abstract translation: 归档集群应用程序通过独立节点的冗余阵列以分布式方式运行。 每个节点最好运行一个完整的归档集群应用实例。 给定的节点提供了一个数据存储库,它可以存储大量数据(例如,一千兆字节)的数据,同时还充当允许访问存档文件的门户。 每个对称节点具有一组软件过程,例如请求管理器,存储管理器,元数据管理器和策略管理器。 请求管理器管理对节点的数据(即文件数据)的请求,存储管理器从与该节点相关联的盘管理数据读/写功能,并且元数据管理器便于跨分布式数据库的元数据事务和恢复。 策略管理器实现一个或多个策略,这些策略是确定集群中“归档对象”的行为的操作。 归档集群应用程序提供基于对象的存储。 优选地,应用程序将元数据和策略永久地关联到原始归档数据,其一起构成归档对象。 对象策略管理对象在归档中的行为。 因此,归档管理自身独立于客户端应用程序,自动执行以确保所有对象策略都有效。

    Fixed content distributed data storage using permutation ring encoding
    34.
    发明授权
    Fixed content distributed data storage using permutation ring encoding 有权
    使用排列环编码固定内容分布式数据存储

    公开(公告)号:US07240236B2

    公开(公告)日:2007-07-03

    申请号:US10806488

    申请日:2004-03-23

    CPC classification number: G06F11/1076 G06F2211/1028 H03M13/1191 H03M13/151

    Abstract: A file protection scheme for fixed content in a distributed data archive uses computations that leverage permutation operators of a cyclic code. In an illustrative embodiment, an N+K coding technique is described for use to protect data that is being distributed in a redundant array of independent nodes (RAIN). The data itself may be of any type, and it may also include system metadata. According to the invention, the data to be distributed is encoded by a dispersal operation that uses a group of permutation ring operators. In a preferred embodiment, the dispersal operation is carried out using a matrix of the form [IN—C] where IN is an n×n identity sub-matrix and C is a k×n sub-matrix of code blocks. The identity sub-matrix is used to preserve the data blocks intact. The sub-matrix C preferably comprises a set of permutation ring operators that are used to generate the code blocks. The operators are preferably superpositions that are selected from a group ring of a permutation group with base ring Z2.

    Abstract translation: 分布式数据归档中固定内容的文件保护方案使用利用循环码的置换运算符的计算。 在说明性实施例中,描述了用于保护分布在独立节点(RAIN)的冗余阵列中的数据的N + K编码技术。 数据本身可以是任何类型的,并且它也可以包括系统元数据。 根据本发明,要分配的数据通过使用一组置换环操作符的分散操作进行编码。 在一个优选实施例中,使用以下形式的矩阵来执行分散操作:其中I N为N [N 2 是n×n个身份子矩阵,C是代码块的k×n子矩阵。 身份子矩阵用于完整保存数据块。 子矩阵C优选地包括用于生成代码块的一组置换环操作符。 操作者优选地是从具有基环Z 2的置换组的组环中选择的叠加。

    Policy-based management of a redundant array of independent nodes
    35.
    发明申请
    Policy-based management of a redundant array of independent nodes 有权
    独立节点冗余阵列的基于策略的管理

    公开(公告)号:US20070094316A1

    公开(公告)日:2007-04-26

    申请号:US11638252

    申请日:2006-12-13

    Abstract: An archive cluster application runs in a distributed manner across a redundant array of independent nodes. Each node preferably runs a complete archive cluster application instance. A given nodes provides a data repository, which stores up to a large amount (e.g., a terabyte) of data, while also acting as a portal that enables access to archive files. Each symmetric node has a set of software processes, e.g., a request manager, a storage manager, a metadata manager, and a policy manager. The request manager manages requests to the node for data (i.e., file data), the storage manager manages data read/write functions from a disk associated with the node, and the metadata manager facilitates metadata transactions and recovery across the distributed database. The policy manager implements one or more policies, which are operations that determine the behavior of an “archive object” within the cluster. The archive cluster application provides object-based storage. Preferably, the application permanently associates metadata and policies with the raw archived data, which together comprise an archive object. Object policies govern the object's behavior in the archive. As a result, the archive manages itself independently of client applications, acting automatically to ensure that all object policies are valid.

    Abstract translation: 归档集群应用程序通过独立节点的冗余阵列以分布式方式运行。 每个节点最好运行一个完整的归档集群应用实例。 给定的节点提供了一个数据存储库,它可以存储大量数据(例如,一千兆字节)的数据,同时还充当允许访问存档文件的门户。 每个对称节点具有一组软件过程,例如请求管理器,存储管理器,元数据管理器和策略管理器。 请求管理器管理对节点的数据(即文件数据)的请求,存储管理器从与该节点相关联的盘管理数据读/写功能,并且元数据管理器便于跨分布式数据库的元数据事务和恢复。 策略管理器实现一个或多个策略,这些策略是确定集群中“归档对象”的行为的操作。 归档集群应用程序提供基于对象的存储。 优选地,应用程序将元数据和策略永久地关联到原始归档数据,其一起构成归档对象。 对象策略管理对象在归档中的行为。 因此,归档管理自身独立于客户端应用程序,自动执行以确保所有对象策略都有效。

    Fixed content distributed data storage using permutation ring encoding
    37.
    发明申请
    Fixed content distributed data storage using permutation ring encoding 有权
    使用排列环编码固定内容分布式数据存储

    公开(公告)号:US20050216813A1

    公开(公告)日:2005-09-29

    申请号:US10806488

    申请日:2004-03-23

    CPC classification number: G06F11/1076 G06F2211/1028 H03M13/1191 H03M13/151

    Abstract: A file protection scheme for fixed content in a distributed data archive uses computations that leverage permutation operators of a cyclic code. In an illustrative embodiment, an N+K coding technique is described for use to protect data that is being distributed in a redundant array of independent nodes (RAIN). The data itself may be of any type, and it may also include system metadata. According to the invention, the data to be distributed is encoded by a dispersal operation that uses a group of permutation ring operators. In a preferred embodiment, the dispersal operation is carried out using a matrix of the form [IN—C] where IN is an n×n identity sub-matrix and C is a k×n sub-matrix of code blocks. The identity sub-matrix is used to preserve the data blocks intact. The sub-matrix C preferably comprises a set of permutation ring operators that are used to generate the code blocks. The operators are preferably superpositions that are selected from a group ring of a permutation group with base ring Z2.

    Abstract translation: 分布式数据归档中固定内容的文件保护方案使用利用循环码的置换运算符的计算。 在说明性实施例中,描述了用于保护分布在独立节点(RAIN)的冗余阵列中的数据的N + K编码技术。 数据本身可以是任何类型的,并且它也可以包括系统元数据。 根据本发明,要分配的数据通过使用一组置换环操作符的分散操作进行编码。 在一个优选实施例中,使用以下形式的矩阵来执行分散操作:其中I N为N [N 2 是n×n个身份子矩阵,C是代码块的k×n子矩阵。 身份子矩阵用于完整保存数据块。 子矩阵C优选地包括用于生成代码块的一组置换环操作符。 操作者优选地是从具有基环Z 2的置换组的组环中选择的叠加。

    SYSTEMS, DEVICES, AND METHODS OF DEVELOPING OR MODIFYING SOFTWARE USING PHYSICAL BLOCKS

    公开(公告)号:US20200272429A1

    公开(公告)日:2020-08-27

    申请号:US16802845

    申请日:2020-02-27

    Abstract: Systems, devices, and methods for software development or modification. The disclosed technology relates to transforming interactions with physical blocks by a human developer on an activity surface into computer-understandable digital information or logic for developing or modifying software (e.g., websites or mobile applications) in real-time or near real-time. The physical blocks are representative of software elements used in software development. For example, the structures, colors, shapes or hardness/softness/squeeze/bend/flex/elastic/shape-memory/rigid properties, whether symmetrical or asymmetrical, whether open-shaped or close-shaped of the physical blocks can determine which software elements are being developed and the arrangement of the blocks can be mapped to how the software elements are to be included in the software. Users located remotely from the developer can provide annotations or feedback to the software being developed in real-time.

Patent Agency Ranking