公开(公告)号：US07085692B2

公开(公告)日：2006-08-01

申请号：US09973786

申请日：2001-10-11

申请人： Warren B. Jackson ,  Oliver P. Guenther ,  Tad H. Hogg ,  Bernardo A. Huberman

发明人： Warren B. Jackson ,  Oliver P. Guenther ,  Tad H. Hogg ,  Bernardo A. Huberman

IPC分类号： G06F17/10

CPC分类号： G05B13/048 ,  G05B17/02

摘要： A market based learning mechanism for controlling smart matter to learn an appropriate organizational control structure for a multiple actuator-sensor dynamical system for use in optimizing system control. The more successful one or more of a plurality of control methods are in predicting system operation, the more weight the successful methods are given in controlling the system.

摘要翻译： 一种基于市场的学习机制，用于控制智能物体，以学习用于优化系统控制的多个执行器 - 传感器动力系统的适当的组织控制结构。 多个控制方法中的一个或多个控制方法在预测系统操作中越成功，控制系统中成功的方法的权重越大。

公开(公告)号：US06470269B1

公开(公告)日：2002-10-22

申请号：US09377697

申请日：1999-08-20

申请人： Eytan Adar ,  Bernardo A. Huberman

发明人： Eytan Adar ,  Bernardo A. Huberman

IPC分类号： G06F1516

CPC分类号： G06F17/3089

摘要： A method for providing time discrimination in the World Wide Web. The method includes the steps of creating a computational model of users of the World Wide Web that represents aggregate World Wide Web surfing patterns; using the computational model to determine a first number of clicks that an user goes through in a specific type of query entered by the user in a conventional web search engine; using the computational model to determine a second number of clicks that the user goes through in the specific type of query entered by the user in an optimized web search engine; and subtracting the first number of clicks from the second number of clicks to extract the gain obtained by time discrimination.

摘要翻译： 一种在万维网上提供时间歧视的方法。 该方法包括以下步骤：创建代表聚合万维网冲浪模式的万维网用户的计算模型; 使用所述计算模型来确定用户在常规网络搜索引擎中输入的特定类型的查询中的第一数量的点击; 使用计算模型来确定用户在优化的网络搜索引擎中输入的特定类型的查询中的第二数量的点击; 并且从第二个点击次数中减去第一个点击次数以提取通过时间歧视获得的增益。

公开(公告)号：US06272507B1

公开(公告)日：2001-08-07

申请号：US09163595

申请日：1998-09-29

申请人： Peter L. Pirolli ,  James E. Pitkow ,  Bernardo A. Huberman

发明人： Peter L. Pirolli ,  James E. Pitkow ,  Bernardo A. Huberman

IPC分类号： G06F1500

CPC分类号： G06F17/30864 ,  G06F17/30011 ,  Y10S707/99935

摘要： A system and method for ranking the results of a search on a collection of linked documents. Documents found on the Web are typically referred to as Web pages. The system utilizes various information relating to the collection of linked documents, including the topology, content and historical usage of the linked collections of documents. The ranking is based on historical patterns and information about the current context of interest (e.g. what the user or group seems to be currently interested in doing). A spreading activation technique is used to identify the frequency of activation of the documents in the search results. Spreading activation techniques are based on representations of Web pages as nodes in graph networks representing usage, content, and hypertext relations among Web pages. After performing the spreading activation based on an initial set defined by the search results, each document from the results may be ranked based on their level of activation.

摘要翻译： 一种用于对链接文档集合进行搜索的结果进行排名的系统和方法。 在Web上找到的文档通常被称为网页。 该系统利用与链接文件的收集有关的各种信息，包括链接的文档集合的拓扑，内容和历史使用。 排名是基于历史模式和关于当前感兴趣的上下文的信息（例如用户或组似乎目前感兴趣的）。 扩展激活技术用于识别搜索结果中文档的激活频率。 扩展激活技术基于网页的表示，作为表示网页中的使用，内容和超文本关系的图形网络中的节点。 在基于由搜索结果定义的初始集合执行扩展激活之后，来自结果的每个文档可以基于其激活水平进行排名。

公开(公告)号：US06085216A

公开(公告)日：2000-07-04

申请号：US2021

申请日：1997-12-31

申请人： Bernardo A. Huberman ,  Rajan Lukose

发明人： Bernardo A. Huberman ,  Rajan Lukose

IPC分类号： G06F9/50 ,  G06F9/00

CPC分类号： G06F9/50 ,  Y02B60/142

摘要： A resource allocation method and system allocates a computational resource between elements of a portfolio of computational entities. The computational resource can be processing time, memory or display screen space. The computational resource can also be associated with a distributed network such as the Internet. In this case, the computational resource is the number of pending messages sent across the distributed network, pendancy time of a message sent across the distributed network, priority of the messages sent across the distributed network, and/or cost of the messages set across the distributed network. When the computational resource is processing time, the resource is allocated between different processes executing on the processor. These different processes include different solution procedures for solving a computationally hard problem, different instances of a single solution procedure for solving the computationally hard problem, and the like. The resource is allocated to optimize the solution time or variance in the solution time. When the computational resource is memory, the resource is allocated between files that are to be stored in the memory, where the total size of the files exceeds the available space in the memory. The available space in the memory is allocated to maximize the likelihood that a file will be stored in the memory when it is needed. When the computational resource is screen real estate, the resource is allocated between display icons that are to be displayed on the display screen, where the total area consumed by the icons exceeds the available screen real estate.

摘要翻译： 资源分配方法和系统在计算实体组合的元素之间分配计算资源。 计算资源可以是处理时间，内存或显示屏幕空间。 计算资源也可以与诸如因特网的分布式网络相关联。 在这种情况下，计算资源是通过分布式网络发送的未决消息的数量，跨分布式网络发送的消息的挂起时间，跨分布式网络发送的消息的优先级和/或跨越分布式网络的消息的成本 分布式网络。 当计算资源处于处理时间时，在处理器上执行的不同进程之间分配资源。 这些不同的过程包括用于解决计算困难问题的不同解决方法，用于解决计算难题的单个解决方案的不同实例等。 分配资源以优化解决方案时间或解决方案时间的差异。 当计算资源是存储器时，资源在要存储在存储器中的文件之间分配，其中文件的总大小超过存储器中的可用空间。 分配存储器中的可用空间以最大化在需要时将文件存储在存储器中的可能性。 当计算资源是屏幕空间时，资源被分配在要显示在显示屏幕上的显示图标之间，其中图标消耗的总面积超过可用屏幕空间。

公开(公告)号：US6078906A

公开(公告)日：2000-06-20

申请号：US173908

申请日：1998-10-16

申请人： Bernardo A. Huberman

发明人： Bernardo A. Huberman

IPC分类号： G06Q30/06 ,  G06Q30/08 ,  G06Q40/00 ,  G06F17/60

CPC分类号： G06Q30/06 ,  G06Q30/08 ,  G06Q40/00 ,  G06Q40/04

摘要： A system and method to enable and facilitate networked, automated, brokered auctioning of document services. A plurality of processes are executed, including a customer process representing a customer, a supplier process representing a supplier, and a broker process capable of serving as an intermediary between the customer and supplier processes. The broker process is provided with a description of a document service. Responsively to the description thus provided, an auction for the document service is conducted, as follows: A customer or supplier process submits a bid for the document service. The broker process receives bidding information including the submitted bid. The broker process attempts to establish a price for the document service responsively to the received bidding information and, if a price can be established, establishes the price. If a price is established, the broker process proposes a transaction wherein the document service is to be provided at the established price. If the proposed transaction is accepted, it can proceed automatically.

摘要翻译： 一种实现和促进文件服务网络化，自动化，中介拍卖的系统和方法。 执行多个处理，包括代表客户的客户过程，代表供应商的供应商过程，以及能够充当客户和供应商处理之间的中介的代理流程。 经纪人流程提供了文档服务的描述。 响应于如此提供的描述，进行文件服务的拍卖，如下：客户或供应商进程提交文件服务的出价。 经纪人流程收到投标信息，包括提交的投标。 代理流程试图根据收到的投标信息确定文档服务的价格，如果可以确定价格，则建立价格。 如果价格成立，代理进程提出一种交易，其中文件服务将以既定的价格提供。 如果拟议的交易被接受，它可以自动进行。

公开(公告)号：US07006999B1

公开(公告)日：2006-02-28

申请号：US09568794

申请日：2000-05-09

申请人： Bernardo A. Huberman ,  Tad H. Hogg ,  Matthew K. Franklin

发明人： Bernardo A. Huberman ,  Tad H. Hogg ,  Matthew K. Franklin

IPC分类号： G06F17/60

CPC分类号： G06Q10/10 ,  G06Q20/383

摘要： A method for enabling privacy and trust in electronic communities is disclosed. A major impediment to using recommendation systems and collective knowledge for electronic commerce is the reluctance of individuals to reveal preferences in order to find groups of people that share them. An equally important barrier to fluid electronic commerce is the lack of agreed upon trusted third parties. We propose new non-third party mechanisms to overcome these barriers. Our solutions facilitate finding shared preferences, discovering communities with shared values, removing disincentives posed by liabilities, and negotiating on behalf of a group. We adapt known techniques from the cryptographic literature to enable these new capabilities.

摘要翻译： 公开了一种在电子社区中实现隐私和信任的方法。 使用推荐系统和集体知识进行电子商务的主要障碍是个人不愿意透露偏好，以寻找分享他们的群体。 流动电子商务同样重要的障碍是缺乏可信第三方的认可。 我们提出新的非第三方机制来克服这些障碍。 我们的解决方案有助于发现共同的偏好，发现具有共同价值观念的社区，消除负债构成的不利因素，代表团体进行谈判。 我们从加密文献中调整已知技术，以实现这些新功能。

公开(公告)号：US06115718A

公开(公告)日：2000-09-05

申请号：US53616

申请日：1998-04-01

申请人： Bernardo A. Huberman ,  James E. Pitkow ,  Peter L. Pirolli

发明人： Bernardo A. Huberman ,  James E. Pitkow ,  Peter L. Pirolli

IPC分类号： G06F17/30

CPC分类号： G06F17/30011 ,  G06F17/30864 ,  Y10S707/99943

摘要： A method and apparatus for predicting document access within a collection of linked documents. The present invention utilizes a predictive technique known as "spreading activation" where document collections are graphically represented as a network. Empirical data is analyzed according to a law of surfing to generate a decay function which is used to dampen the activation as spreads through the network. Activation is applied to a set of focus documents and propagates through the network until a stable pattern of activation is achieved across all documents. From this stable pattern, the desired usage information is extracted. Such a system will provide several practical benefits to users of the World Wide Web. For example, the present invention can be used to identify relevant pages to a set of one or more focus pages or to predict the number of times a document will be accessed in a collection of linked documents. Further, alone or in combination, this information can be used in connection with web site design or re-design.

摘要翻译： 一种用于在链接文档的集合内预测文档访问的方法和装置。 本发明利用了一种称为“扩展激活”的预测技术，其中文档集合以图形方式表示为网络。 根据冲浪规律分析经验数据，生成衰减函数，该功能用于通过网络将激活抑制为传播。 激活被应用于一组焦点文档，并通过网络进行传播，直到在所有文档上实现稳定的激活模式。 从该稳定模式，提取期望的使用信息。 这样的系统将为万维网的用户提供几个实际的好处。 例如，本发明可以用于识别一组一个或多个焦点页面的相关页面，或者用于预测文档在链接文档的集合中被访问的次数。 此外，单独或组合地，该信息可以与网站设计或重新设计相关联使用。

公开(公告)号：US5826244A

公开(公告)日：1998-10-20

申请号：US518632

申请日：1995-08-23

申请人： Bernardo A. Huberman

发明人： Bernardo A. Huberman

IPC分类号： G06Q30/06 ,  G06Q30/08 ,  G06Q40/00 ,  G06F17/60

CPC分类号： G06Q30/06 ,  G06Q30/08 ,  G06Q40/00 ,  G06Q40/04

摘要： A system and method to enable and facilitate networked, automated, brokered auctioning of document services. A plurality of processes are executed, including a customer process representing a customer, a supplier process representing a supplier, and a broker process capable of serving as an intermediary between the customer and supplier processes. The broker process is provided with a description of a document service. Responsively to the description thus provided, an auction for the document service is conducted, as follows: a customer or supplier process submits a bid for the document service; the broker process receives bidding information including the submitted bid; the broker process attempts to establish a price for the document service responsively to the received bidding information and, if a price can be established, establishes the price; if a price is established, the broker process proposes a transaction wherein the document service is to be provided at the established price; and if the proposed transaction is accepted, it can proceed automatically.

摘要翻译： 一种实现和促进文件服务网络化，自动化，中介拍卖的系统和方法。 执行多个处理，包括代表客户的客户过程，代表供应商的供应商过程，以及能够充当客户和供应商处理之间的中介的代理流程。 经纪人流程提供了文档服务的描述。 响应于如此提供的描述，进行文件服务的拍卖，如下：客户或供应商进程提交文件服务的投标; 经纪人流程收到投标信息，包括提交的投标; 经纪人程序试图根据收到的投标信息确定文件服务的价格，如果可以确定价格，建立价格; 如果价格成立，经纪处理提出交易，其中文件服务将以既定的价格提供; 如果提议的交易被接受，它可以自动进行。

公开(公告)号：US07590554B2

公开(公告)日：2009-09-15

申请号：US09976959

申请日：2001-10-11

申请人： Kay-Yut Chen ,  Leslie R. Fine ,  Bernardo A. Huberman

发明人： Kay-Yut Chen ,  Leslie R. Fine ,  Bernardo A. Huberman

IPC分类号： G06F17/30

CPC分类号： G06Q10/06 ,  G06Q10/063 ,  G06Q10/0635 ,  G06Q10/06393 ,  G06Q30/0202 ,  G06Q30/0203 ,  G06Q30/0204 ,  G06Q30/0206

摘要： The present invention is a novel methodology for predicting future outcomes that uses small numbers of individuals participating in an imperfect information market. Determining their individual characteristics and performing a nonlinear aggregation of their predictions, provides a probability assessment of the future outcome of an uncertain event. In one embodiment of the present invention the aggregated prediction is compared to both the objective probability of its occurrence and the performance of the market as a whole. In one embodiment, the present invention includes a forecasting process comprising, running an information market, extracting participant characteristics, performing a query process, and aggregating the participant characteristics and results of the query process. The information market is designed to elicit characteristics of the participants include participant risk inclination and ability to analyze information provided in the information market.

摘要翻译： 本发明是用于预测使用参与不完美信息市场的少数个体的未来结果的新颖方法。 确定其个人特征并对其预测进行非线性聚合，为不确定事件的未来结果提供概率评估。 在本发明的一个实施例中，将聚合预测与其出现的客观概率和整个市场的表现进行比较。 在一个实施例中，本发明包括预测过程，包括：运行信息市场，提取参与者特征，执行查询过程，以及聚合参与者特征和查询过程的结果。 信息市场旨在引发参与者的特征，包括参与者风险倾向和分析信息市场提供信息的能力。

公开(公告)号：US07529708B2

公开(公告)日：2009-05-05

申请号：US11185167

申请日：2005-07-20

申请人： Tad Hogg ,  Bernardo A. Huberman

发明人： Tad Hogg ,  Bernardo A. Huberman

IPC分类号： G06Q40/00

CPC分类号： G06Q40/04 ,  G06Q30/08 ,  G06Q40/00

摘要： A system for determining latent demand for at least one of a plurality of commodities includes an offer analyzer and a commodity selector. The offer analyzer analyzes at least a plurality of initially unaccepted offers for each of the plurality of commodities. The commodity selector selects at least one of the plurality of commodities to offer for sale which satisfies at least one criteria based on the analysis by the offer analyzer.