利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

6 条记录 (耗时 0.022 秒)

    GENERALIZED PROXIMITY SERVICE
    1.
    发明申请
    GENERALIZED PROXIMITY SERVICE 有权
    一般接近服务

    公开(公告)号：US20120124223A1

    公开(公告)日：2012-05-17

    申请号：US13358233

    申请日：2012-01-25

    申请人： Jeffrey B. Parham ,  Levon A. Esibov ,  Nicholas J. Harvey ,  William B. Lees

    发明人： Jeffrey B. Parham ,  Levon A. Esibov ,  Nicholas J. Harvey ,  William B. Lees

    IPC分类号： G06F15/16

    CPC分类号： H04L67/16 ,  H04L29/06 ,  H04L67/14 ,  H04L67/18 ,  H04L69/329

    摘要： A system and method for identifying network endpoints that provide a service of interest orders endpoints according to their network proximity to a requesting client. The requesting client may then contact the closest available providing endpoint, thus increasing the efficiency of usage of network resources while decreasing latency and enhancing reliability. In an embodiment of the invention, when a connection to the nearest providing endpoint cannot be established, a mechanism for locating a next-closest alternative endpoint is provided.

    摘要翻译： 一种用于识别根据其与请求客户端的网络接近度来提供兴趣订单端点的服务的网络端点的系统和方法。 然后，请求客户端可以联系最接近的可用提供端点，从而提高网络资源的使用效率，同时减少等待时间并提高可靠性。 在本发明的实施例中，当不能建立与最近的提供端点的连接时，提供用于定位下一个最接近的备选端点的机制。

    Generalized proximity service
    2.
    发明授权
    Generalized proximity service 有权
    广义接近服务

    公开(公告)号：US08145699B2

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

    申请号：US10448903

    申请日：2003-05-30

    申请人： Jeffrey B. Parham ,  Levon A. Esibov ,  Nicholas J. Harvey ,  William B. Lees

    发明人： Jeffrey B. Parham ,  Levon A. Esibov ,  Nicholas J. Harvey ,  William B. Lees

    IPC分类号： G06F15/16

    CPC分类号： H04L67/16 ,  H04L29/06 ,  H04L67/14 ,  H04L67/18 ,  H04L69/329

    摘要： A system and method for identifying network endpoints that provide a service of interest orders endpoints according to their network proximity to a requesting client. The requesting client may then contact the closest available providing endpoint, thus increasing the efficiency of usage of network resources while decreasing latency and enhancing reliability. In an embodiment of the invention, when a connection to the nearest providing endpoint cannot be established, a mechanism for locating a next-closest alternative endpoint is provided.

    摘要翻译： 一种用于识别根据其与请求客户端的网络接近度来提供兴趣订单端点的服务的网络端点的系统和方法。 然后，请求客户端可以联系最接近的可用提供端点，从而提高网络资源的使用效率，同时减少等待时间并提高可靠性。 在本发明的实施例中，当不能建立与最近的提供端点的连接时，提供用于定位下一个最接近的备选端点的机制。

    METHOD AND APPARATUS FOR OPERATING A WEBSITE
    3.
    发明申请
    METHOD AND APPARATUS FOR OPERATING A WEBSITE 审中-公开
    用于操作网站的方法和装置

    公开(公告)号：US20140074583A1

    公开(公告)日：2014-03-13

    申请号：US13608685

    申请日：2012-09-10

    申请人： Nicholas J. Harvey ,  Christopher J. Ippolito

    发明人： Nicholas J. Harvey ,  Christopher J. Ippolito

    IPC分类号： G06Q30/06 ,  G06Q30/02

    CPC分类号： G06Q30/02 ,  G06Q30/0251 ,  G06Q30/06 ,  G06Q50/01

    摘要： The present invention includes a social networking system wherein the users may be broadly categorized as payor users or payee users. Payor users are generally individuals or students, while payee users generally businesses or charities. Each user in the social networking system of the present invention is associated with financial data. The financial data is thereafter used to facilitate commercial transactions and transfer donations within the social networking system between users, generally from a payee user to a payor user. The payor user is not required to enter financial data or log in to an additional system to facilitate the transaction. The transaction is facilitated entirely within the constructs of the social networking system. Pursuant to this, payee users may add products and services to their associated profiles to vend their products and services from within the social networking system.

    摘要翻译： 本发明包括社交网络系统，其中用户可以被广泛地分类为付费用户或收款人用户。 付款人用户一般是个人或学生，而收款人用户一般是商业或慈善机构。 本发明的社交网络系统中的每个用户都与财务数据相关联。 此后，财务数据用于促进商业交易，并在用户之间的通常从收款人用户到付款人用户的社交网络系统内转移捐款。 付款人用户不需要输入财务数据或登录到附加系统以促进交易。 该交易完全在社交网络系统的结构内。 根据这一点，收款人用户可以向相关个人资料添加产品和服务，以便在社交网络系统内销售其产品和服务。

    Method and system for matching network clients and servers under matching constraints
    6.
    发明授权
    Method and system for matching network clients and servers under matching constraints 有权
    在匹配约束下匹配网络客户端和服务器的方法和系统

    公开(公告)号：US07165103B2

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

    申请号：US10180734

    申请日：2002-06-26

    申请人： Nicholas J. Harvey ,  Laszlo Lovasz

    发明人： Nicholas J. Harvey ,  Laszlo Lovasz

    IPC分类号： G06F15/173 ,  G06F15/16

    CPC分类号： H04L67/2814 ,  H04L29/06 ,  H04L67/2819 ,  H04L67/2871 ,  H04L67/306 ,  H04L69/329

    摘要： A method of finding an optimal match between clients and servers under given matching constraints utilizes a bipartite diagram in which the clients are presented as vertices on one side, the servers as vertices on the other side, and each possible client-server pairing allowed under the matching constraints as an edge connecting the vertices representing the client and the server. After an initial round of assignments is performed, the assignments are optimized by an optimization operation that iteratively applies a reassignment process. The reassignment process searches for a chain of servers starting with a server having a highest number of clients and ends with another server with a client number less than that of the first server by at least two, with each server in the chain except the end server having a client reassignable to the next server in the chain. Those reassignable clients are then reassigned along the chain such that the first server's client number is reduced by one and the end server's client number is reduced by one. The reassignment process is repeated until an optimal match is reached.

    摘要翻译： 在给定的匹配约束下，在客户机和服务器之间找到最佳匹配的方法利用二分图，其中客户端作为一侧的顶点，服务器作为另一侧的顶点，以及允许的每个可能的客户端 - 服务器配对 匹配约束作为连接表示客户端和服务器的顶点的边缘。 执行初始轮任务后，通过迭代应用重新分配过程的优化操作优化分配。 重新分配过程从具有最高客户端数量的服务器开始搜索一连串的服务器，并且将客户端号码小于第一个服务器的客户端号码的服务器终止至少两个，除了终端服务器之外的链中的每个服务器 将客户端重新分配给链中的下一个服务器。 然后，这些可重新分配的客户端沿着链路重新分配，使得第一服务器的客户端号码减少一个，并且终端服务器的客户端号码减少一个。 重新分配过程重复直到达到最佳匹配。