Methods and Apparatus for Distributed Data Storage
    1.
    发明申请
    Methods and Apparatus for Distributed Data Storage 有权
    分布式数据存储的方法和装置

    公开(公告)号:US20120185437A1

    公开(公告)日:2012-07-19

    申请号:US13297262

    申请日:2011-11-15

    IPC分类号: G06F12/16 G06F17/30

    摘要: A distributed heterogeneous or homogeneous file storage system divides logical responsibility for data from actual control of the data by using separate file and storage managers. Each file manager provides access to stored files and stores metadata associated with each of the files for which it is responsible. A file manager control component allocates responsibilities among file managers, assigns management responsibilities for individual files, and maintains a record of which files are assigned to each manager. Each storage manager is responsible for managing storage of files on data storage devices and maintains a record of the location of each stored file. A storage manager control component allocates responsibilities among storage managers, assigns responsibilities for individual files, and maintains a record of which files and storage devices are assigned to each manager. A client provides user access, initiates actions within the system, and implements a redundant data recovery and reconstruction scheme.

    摘要翻译: 分布式异构或同类文件存储系统通过使用单独的文件和存储管理器将数据的逻辑责任与数据的实际控制分开。 每个文件管理器提供对存储的文件的访问,并存储与其负责的每个文件相关联的元数据。 文件管理器控制组件在文件管理器之间分配责任,分配单个文件的管理责任,并维护哪些文件分配给每个管理器的记录。 每个存储管理器负责管理数据存储设备上的文件的存储,并维护每个存储的文件的位置的记录。 存储管理器控制组件在存储管理器之间分配责任,分配单个文件的职责,并维护哪些文件和存储设备分配给每个管理器的记录。 客户端提供用户访问,在系统内启动操作,并实现冗余数据恢复和重建方案。

    Methods and apparatus for distributed data storage
    2.
    发明授权
    Methods and apparatus for distributed data storage 有权
    分布式数据存储的方法和装置

    公开(公告)号:US09098519B2

    公开(公告)日:2015-08-04

    申请号:US13297262

    申请日:2011-11-15

    摘要: A distributed heterogeneous or homogeneous file storage system divides logical responsibility for data from actual control of the data by using separate file and storage managers. Each file manager provides access to stored files and stores metadata associated with each of the files for which it is responsible. A file manager control component allocates responsibilities among file managers, assigns management responsibilities for individual files, and maintains a record of which files are assigned to each manager. Each storage manager is responsible for managing storage of files on data storage devices and maintains a record of the location of each stored file. A storage manager control component allocates responsibilities among storage managers, assigns responsibilities for individual files, and maintains a record of which files and storage devices are assigned to each manager. A client provides user access, initiates actions within the system, and implements a redundant data recovery and reconstruction scheme.

    摘要翻译: 分布式异构或同类文件存储系统通过使用单独的文件和存储管理器将数据的逻辑责任与数据的实际控制分开。 每个文件管理器提供对存储的文件的访问,并存储与其负责的每个文件相关联的元数据。 文件管理器控制组件在文件管理器之间分配责任,分配单个文件的管理责任,并维护哪些文件分配给每个管理器的记录。 每个存储管理器负责管理数据存储设备上的文件的存储,并维护每个存储的文件的位置的记录。 存储管理器控制组件在存储管理器之间分配责任,分配单个文件的职责,并维护哪些文件和存储设备分配给每个管理器的记录。 客户端提供用户访问,在系统内启动操作,并实现冗余数据恢复和重建方案。

    Truthful Optimal Welfare Keyword Auctions
    3.
    发明申请
    Truthful Optimal Welfare Keyword Auctions 审中-公开
    真实最优福利关键字拍卖

    公开(公告)号:US20100306006A1

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

    申请号:US12475243

    申请日:2009-05-29

    申请人: Elan Pavlov

    发明人: Elan Pavlov

    IPC分类号: G06Q10/00

    摘要: There is disclosed a method for auctioning a set of keywords. Bids may be received from a plurality of advertisers. Each bid may include a value of a click-through and a budget expressed as a maximum number of click-throughs. A flow graph may be created that relates the set of keywords to the bids received from the plurality of advertisers. A minimum cost flow solution may be determined for the flow graph, and the keywords may be allocated to the advertisers based on the minimum cost flow solution.

    摘要翻译: 公开了一种用于拍卖一组关键字的方法。 可以从多个广告商接收投标。 每个出价可能包含点击次数和最大点击次数表示的预算值。 可以创建将该组关键字与从多个广告商接收的出价相关联的流程图。 可以为流程图确定最小成本流解决方案,并且可以基于最小成本流解决方案将关键字分配给广告商。

    Routing in Selfish Networks
    4.
    发明申请
    Routing in Selfish Networks 有权
    自私网络路由

    公开(公告)号:US20100304750A1

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

    申请号:US12475253

    申请日:2009-05-29

    申请人: Elan Pavlov

    发明人: Elan Pavlov

    IPC分类号: H04W40/00

    摘要: There is disclosed a method of operating a communications network having a plurality of selfish users. Each selfish user may send messages to a destination node with the messages being forwarded through intermediate nodes of a mesh network. Each selfish user may accumulate a debt equal to the power saved by having messages forwarded through other nodes in the mesh network less the power consumed forwarding messages for other nodes in the mesh network. Each selfish user having greater than zero accumulated debt may be required to forward messages for other nodes.

    摘要翻译: 公开了一种操作具有多个自私用户的通信网络的方法。 每个自私用户可以通过网状网络的中间节点转发消息来向消息发送消息。 每个自私用户可以通过使网状网络中的其他节点转发的消息减少网状网络中其他节点的功耗消耗转发消息,从而累积等于所节省的功率的债务。 可能需要具有大于零累积债务的每个自私用户转发其他节点的消息。

    System and Method for Detecting Misinformation and Fake News via Network Analysis

    公开(公告)号:US20210342704A1

    公开(公告)日:2021-11-04

    申请号:US17321395

    申请日:2021-05-14

    申请人: Elan Pavlov

    发明人: Elan Pavlov

    IPC分类号: G06N5/02 G06N7/00

    摘要: A method for detection of misinformation without the need to analyze any articles (HINTS) includes forming a mixed graph containing at least two different node types, such as users and articles, with edges between users and articles, and with user weights for user nodes and article weights for article nodes. Seed nodes are planted for at least one user node and at least one article node. User weights and article weights are manually assigned to the seed nodes, then neighborhoods are defined for the seed nodes. A HITS-like algorithm is then run for a predetermined number of rounds updating both people and articles, while keeping the weights of the seed nodes constant to converge the graph for the weights of articles and users. Finally, a set of highest weights for users and/or articles is outputted and possible remedial action can be taken.

    Routing in selfish networks
    6.
    发明授权
    Routing in selfish networks 有权
    在自私网络中路由

    公开(公告)号:US08203999B2

    公开(公告)日:2012-06-19

    申请号:US12475253

    申请日:2009-05-29

    申请人: Elan Pavlov

    发明人: Elan Pavlov

    IPC分类号: H04W4/00

    摘要: There is disclosed a method of operating a communications network having a plurality of selfish users. Each selfish user may send messages to a destination node with the messages being forwarded through intermediate nodes of a mesh network. Each selfish user may accumulate a debt equal to the power saved by having messages forwarded through other nodes in the mesh network less the power consumed forwarding messages for other nodes in the mesh network. Each selfish user having greater than zero accumulated debt may be required to forward messages for other nodes.

    摘要翻译: 公开了一种操作具有多个自私用户的通信网络的方法。 每个自私用户可以通过网状网络的中间节点转发消息来向消息发送消息。 每个自私用户可以通过使网状网络中的其他节点转发的消息减少网状网络中其他节点的功耗消耗转发消息,从而累积等于所节省的功率的债务。 可能需要具有大于零累积债务的每个自私用户转发其他节点的消息。