System and method of accessing a document efficiently through multi-tier web caching
    51.
    发明授权
    System and method of accessing a document efficiently through multi-tier web caching 有权
    通过多层网页缓存有效访问文档的系统和方法

    公开(公告)号:US08224964B1

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

    申请号:US10882796

    申请日:2004-06-30

    IPC分类号: G06F15/16

    摘要: A client-server network system implements a multi-tier caching strategy for a user to access a document efficiently. When serving a document to client, the document is examined for embedded references to other documents. The embedded references are extracted and then assigned a priority. The documents referenced are obtained locally from the server cache or obtained from their respective web hosts and transmitted according to the assigned priority. If the client determines that it has the document, the transmission of is terminated. If the client or server determines that a newly requested document is one of the referenced documents being transmitted, the transmission is given a higher priority. In some instances, the server calculates a content difference between a current version of a referenced and a previous version and transmits this content.

    摘要翻译: 客户机 - 服务器网络系统实现多层缓存策略,以便用户有效地访问文档。 当向客户端提供文档时,将检查文档以了解其他文档的引用。 提取嵌入的引用,然后分配优先级。 所引用的文件是从服务器缓存本地获得的,或者从其各自的web主机获得并根据分配的优先级被发送。 如果客户端确定它具有文档,则传输被终止。 如果客户端或服务器确定新请求的文档是被发送的被引用文档之一,则传输被给予较高的优先级。 在某些情况下,服务器计算当前版本的引用版本和先前版本之间的内容差异,并发送此内容。

    Abuse-Resistant Method of Providing Invitation Codes for Registering User Accounts with an Online Service
    53.
    发明申请
    Abuse-Resistant Method of Providing Invitation Codes for Registering User Accounts with an Online Service 有权
    提供用户注册用户帐号的在线服务的邀请代码的滥用方法

    公开(公告)号:US20120009898A1

    公开(公告)日:2012-01-12

    申请号:US13236526

    申请日:2011-09-19

    IPC分类号: H04W12/06 G06F21/24 H04W12/08

    CPC分类号: H04L63/083 H04M3/42136

    摘要: A server system having one or more processors and memory receives, from a client, an invitation-code request from a user of the client for an invitation code enabling a new user account to be registered, where the invitation-code request includes identifying information and determines whether the invitation-code request exceeds registration limit criteria based on the identifying information. In accordance with a determination that the invitation-code request exceeds the registration limit criteria, the invitation-code request is rejected. In accordance with a determination that the invitation-code request does not exceed the registration limit criteria, an invitation code is provided to the user, enabling a new user account to be registered.

    摘要翻译: 具有一个或多个处理器和存储器的服务器系统从客户端接收来自客户用户的邀请代码请求,用于允许登记新用户帐户的邀请码,其中邀请代码请求包括识别信息,以及 基于识别信息来确定邀请代码请求是否超过了注册限制标准。 根据邀请代码请求超过注册限制条件的确定,邀请代码请求被拒绝。 根据邀请码请求不超过注册限制标准的确定,向用户提供邀请代码,使得能够注册新的用户帐户。

    SYNCHRONIZED PROCESSES COMMUNICATING OVER A WIDE AREA NETWORK AND METHOD
    54.
    发明申请
    SYNCHRONIZED PROCESSES COMMUNICATING OVER A WIDE AREA NETWORK AND METHOD 审中-公开
    同步网络中的通信方法和方法

    公开(公告)号:US20110314103A1

    公开(公告)日:2011-12-22

    申请号:US13162264

    申请日:2011-06-16

    IPC分类号: G06F15/16

    CPC分类号: G06F9/546

    摘要: Communicating peer processes on a wide area network may be synchronized in real time using a client-side library in conjunction with a centralized communication service. Such an approach provides a considerably easier way to develop applications as diverse as multiplayer games, synchronized video watching, document collaboration systems, and a range of web applications that require communication between multiple web clients.

    摘要翻译: 使用客户端库与集中式通信服务结合,可以在广域网上通信对等进程实时同步。 这种方法提供了一种相当简单的方法来开发诸如多人游戏,同步视频观看,文档协作系统以及需要多个web客户端之间的通信的一系列web应用程序的应用程序。

    Abuse-resistant method of registering user accounts with an online service
    55.
    发明授权
    Abuse-resistant method of registering user accounts with an online service 有权
    在线服务注册用户帐户的滥用方法

    公开(公告)号:US08023927B1

    公开(公告)日:2011-09-20

    申请号:US11771119

    申请日:2007-06-29

    IPC分类号: H04M1/66

    CPC分类号: H04L63/083 H04M3/42136

    摘要: A computer implemented method for registering user accounts that includes sending a first request to an online service wherein the first request includes a telephone number, sending a second request to the online service wherein the second request includes an invitation code received via a telephone associated with the telephone number, and upon acceptance of the invitation code by the online service, receiving an invitation from the online service, to register a user account.

    摘要翻译: 一种用于注册用户帐户的计算机实现方法,包括向在线服务发送第一请求,其中所述第一请求包括电话号码,向所述在线服务发送第二请求,其中所述第二请求包括经由与所述在线服务相关联的电话接收的邀请码 电话号码,并且在线服务接受邀请码后,接收到在线服务的邀请,注册用户帐号。

    Methods and systems for developing an instant messaging network
    56.
    发明授权
    Methods and systems for developing an instant messaging network 有权
    用于开发即时消息传递网络的方法和系统

    公开(公告)号:US07685236B1

    公开(公告)日:2010-03-23

    申请号:US10815901

    申请日:2004-03-31

    IPC分类号: G06F15/16 G06F12/00

    摘要: An instant messaging (IM) system has an IM server connected to a communication network, and logic operable on the IM server enabling a first user to browse contacts associated with a second user. In some cases the first user can add and list contacts accessed by browsing the contacts associated with the second user.

    摘要翻译: 即时消息(IM)系统具有连接到通信网络的IM服务器,并且可在IM服务器上操作的逻辑使得第一用户能够浏览与第二用户相关联的联系人。 在某些情况下,第一个用户可以通过浏览与第二个用户相关联的联系人来添加和列出访问的联系人。

    MULTIPLE ACCOUNT AUTHENTICATION
    57.
    发明申请
    MULTIPLE ACCOUNT AUTHENTICATION 失效
    多个账号认证

    公开(公告)号:US20080155669A1

    公开(公告)日:2008-06-26

    申请号:US11963543

    申请日:2007-12-21

    IPC分类号: H04L9/32 H04L9/00

    摘要: A method and a system allow accessing several of a user's controlled access accounts by presenting the credentials of only one of the accounts. The method may include (a) storing the credentials for each of the user's accounts; (b) receiving from the user credentials corresponding to any of the user's accounts; (c) presenting the received credentials to access the corresponding account; and (d) upon successful access of the corresponding account, using the stored credentials to access one or more of the user's accounts without requiring the user to present the corresponding credentials. For each of the user's accounts, the credentials are stored encrypted, using a randomly generated key, common to all the encrypted credentials. In addition, the randomly generated key is encrypted using the credentials of each of the accounts. In that manner, plain-text copies of neither the random key nor the credentials of the accounts need to be stored.

    摘要翻译: 方法和系统允许通过仅呈现一个帐户的凭证来访问用户的受控访问帐户中的几个。 该方法可以包括(a)存储每个用户帐户的凭证; (b)从用户接收与任何用户帐户相对应的凭证; (c)提交收到的凭证以访问相应的帐户; 以及(d)在成功访问相应帐户之后,使用所存储的凭证访问用户的一个或多个帐户,而不要求用户呈现相应的凭证。 对于每个用户的帐户,凭证都使用随机生成的密钥进行加密存储,对所有加密凭证是通用的。 此外,使用每个帐户的凭据对随机生成的密钥进行加密。 以这种方式,不需要存储随机密钥和帐户的凭据的纯文本副本。

    Method and apparatus for learning a probabilistic generative model for text
    58.
    发明授权
    Method and apparatus for learning a probabilistic generative model for text 有权
    用于学习文本的概率生成模型的方法和装置

    公开(公告)号:US07231393B1

    公开(公告)日:2007-06-12

    申请号:US10788837

    申请日:2004-02-26

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30684 G06F17/27

    摘要: One embodiment of the present invention provides a system that learns a generative model for textual documents. During operation, the system receives a current model, which contains terminal nodes representing random variables for words and cluster nodes representing clusters of conceptually related words. Within the current model, nodes are coupled together by weighted links, so that if a cluster node in the probabilistic model fires, a weighted link from the cluster node to another node causes the other node to fire with a probability proportionate to the link weight. The system also receives a set of training documents, wherein each training document contains a set of words. Next, the system applies the set of training documents to the current model to produce a new model.

    摘要翻译: 本发明的一个实施例提供一种学习文本文档的生成模型的系统。 在操作期间,系统接收当前模型,其包含表示用于表示概念相关词的群集的单词和群集节点的随机变量的终端节点。 在当前的模型中,节点通过加权链路耦合在一起,从而如果概率模型中的一个群集节点被触发,则从群集节点到另一个节点的加权链路会导致另一个节点以与链路权重成比例的概率发射。 该系统还接收一组训练文件,其中每个训练文档包含一组单词。 接下来,系统将该组培训文件应用于当前模型以产生新模型。

    Method for data compression
    59.
    发明授权

    公开(公告)号:US10763893B2

    公开(公告)日:2020-09-01

    申请号:US15654632

    申请日:2017-07-19

    申请人: Georges Harik

    发明人: Georges Harik

    摘要: A data compression system includes: (a) a data compression module that receives a sequence of input vectors and that provides a sequence of compressed vectors; (b) a data decompression module that receives the compressed vectors to provide a sequence of output vectors; and (c) a parameter update module that receives the sequence of input vectors and the sequence of output vectors, and which learns the data compression module and data decompression module based on evaluating a loss function of the input vectors, the output vectors, and the parameters controlling the compression module and the decompression module. Each input vector and its corresponding output vector may represent digitized time-domain signals (e.g., speech, audio or video signals) over a predetermined time period. The loss function may be evaluated for each of a sequence of predetermined time periods.

    Searching text via function learning

    公开(公告)号:US10467530B2

    公开(公告)日:2019-11-05

    申请号:US14073576

    申请日:2013-11-06

    申请人: Georges Harik

    发明人: Georges Harik

    IPC分类号: G06N3/12 G06F16/33

    摘要: A method which does not rely on explicit inverted indices is provided to search for documents in a corpus of documents responsive to a textual search query. The method includes (a) selecting a program that is customized by setting values for a plurality of parameters, the program structured to receive the textual search query as input and to provide as output values indicating the relevance of the documents in the corpus to the search query; (b) training the program using a machine learning technique; and (c) applying the trained program to the textual search query. The program may be based on a structure that is developed based on a genetic programming technique.