公开(公告)号：US06505167B1

公开(公告)日：2003-01-07

申请号：US09295146

申请日：1999-04-20

申请人： Eric Horvitz ,  Andrew W. Jacobs

发明人： Eric Horvitz ,  Andrew W. Jacobs

IPC分类号： G06F1760

CPC分类号： G06Q10/109 ,  G06Q10/06314 ,  G06Q10/06375 ,  G06Q10/1097 ,  H04M1/72547 ,  H04M1/72566

摘要： Directing automated services for messaging and scheduling. In one embodiment, a computer-implemented method first determines a message to analyze. The method then determines the probability that the user would like to review a calendar or to schedule an appointment based on information in the message, based on the message, and based on the scheduling probability, selects one of the following options: (1) inaction, (2) automatic action, or (3) suggested action with user approval. Upon the method selecting either the (1) automatic action option or the (2) suggested action with user approval option—the latter also in conjunction with receiving actual user approval—the method performs a scheduling action based on the message in a manner that takes into consideration the precision and confidence of the scheduling action.

摘要翻译： 引导消息和调度的自动化服务。 在一个实施例中，计算机实现的方法首先确定要分析的消息。 该方法然后基于消息确定用户想要查看日历或基于消息中的信息安排约会的概率，并且基于调度概率，选择以下选项之一：（1）不作为 ，（2）自动动作，或（3）用户批准建议的动作。 当方法选择（1）自动动作选项或（2）建议动作与用户批准选项 - 后者也结合接收实际用户批准 - 该方法基于该消息以采取的方式执行调度动作 考虑到调度动作的精度和置信度。

公开(公告)号：US06233570B1

公开(公告)日：2001-05-15

申请号：US09197160

申请日：1998-11-20

申请人： Eric Horvitz ,  John S. Breese ,  David E. Heckerman ,  Samuel D. Hobson ,  David O. Hovel ,  Adrian C. Klein ,  Jacobus A. Rommelse ,  Gregory L. Shaw

发明人： Eric Horvitz ,  John S. Breese ,  David E. Heckerman ,  Samuel D. Hobson ,  David O. Hovel ,  Adrian C. Klein ,  Jacobus A. Rommelse ,  Gregory L. Shaw

IPC分类号： G06F1700

CPC分类号： G06N5/00 ,  G06F9/453 ,  Y10S707/99943

摘要： A general event composing and monitoring system that allows high-level events to be created from combinations of low-level events. An event specification tool allows for rapid development of a general event processor that creates high-level events from combinations of user actions. The event system, in combination with a reasoning system, is able to monitor and perform inference about several classes of events for a variety of purposes. The various classes of events include the current context, the state of key data structures in a program, general sequences of user inputs, including actions with a mouse-controlled cursor while interacting with a graphical user interface, words typed in free-text queries for assistance, visual information about users, such as gaze and gesture information, and speech information. Additionally, a method is provided for building an intelligent user interface system by constructing a reasoning model to compute the probability of alternative user's intentions, goals, or informational needs through analysis of information about a user's actions, program state, and words. The intelligent user interface system monitors user interaction with a software application and applies probabilistic reasoning to sense that the user may need assistance in using a particular feature or to accomplish a specific task. The intelligent user interface also accepts a free-text query from the user asking for help and combines the inference analysis of user actions and program state with an inference analysis of the free-text query. The inference system accesses a rich, updatable user profile system to continually check for competencies and changes assistance that is given based on user competence.

摘要翻译： 一般的事件编制和监控系统，允许从低级别事件的组合创建高级别事件。 事件规范工具可以快速开发通用事件处理器，从用户操作的组合创建高级事件。 事件系统与推理系统相结合，能够监视和执行关于几类事件的推理，用于各种目的。 各种类型的事件包括当前上下文，程序中关键数据结构的状态，用户输入的一般序列，包括与图形用户界面交互时使用鼠标控制的光标的操作，以自由文本查询形式输入的单词 帮助，关于用户的视觉信息，例如注视和手势信息，以及语音信息。 另外，提供了一种构建智能用户界面系统的方法，通过构建推理模型来通过分析关于用户动作，程序状态和单词的信息来计算替代用户的意图，目标或信息需求的概率。 智能用户界面系统监视用户与软件应用程序的交互，并应用概率推理来感知用户可能需要协助使用特定功能或完成特定任务。 智能用户界面还接受用户请求帮助的自由文本查询，并将用户操作和程序状态的推理分析与自由文本查询的推理分析相结合。 推理系统访问丰富的，可更新的用户配置文件系统，以持续检查基于用户能力给出的能力和更改帮助。

公开(公告)号：US06232974B1

公开(公告)日：2001-05-15

申请号：US08904966

申请日：1997-07-30

申请人： Eric Horvitz ,  Jerome E. Lengyel

发明人： Eric Horvitz ,  Jerome E. Lengyel

IPC分类号： G06F1516

CPC分类号： G06F9/50 ,  G06T15/00

摘要： A decision-theoretic regulator employs a method for allocating computational resources to components of media content to create the highest quality output for a budget of rendering resources. The components of the content represent parts of the content that have independent quality parameters that the regulator can vary to trade-off quality for computational savings. For example, in multimedia content, the components might be objects in a 3D graphics scene. The method allocates computational resources by attempting to minimize the total expected cost of a rendering task. The method computes the raw error for a rendering action on a component and then maps the raw error to a perceived error based on empirical evidence of how users perceive errors in rendered output. The expected cost is computed from the perceived error or raw error by applying a model of attention that gives the probability that a user is focusing his or her attention on a component. The method minimizes the total expected cost by selecting a rendering action for each component that yields the lowest expected cost for a given rendering budget.

摘要翻译： 决策理论调节器采用一种将计算资源分配给媒体内容的组件的方法，以便为渲染资源的预算创建最高质量的输出。 内容的组成部分表示具有独立质量参数的内容的部分，调节器可以改变以便计算节省的权衡质量。 例如，在多媒体内容中，组件可能是3D图形场景中的对象。 该方法通过尝试最小化渲染任务的总预期成本来分配计算资源。 该方法计算组件上的渲染操作的原始错误，然后基于用户如何感知渲染输出中的错误的经验证据将原始错误映射到感知错误。 通过应用给出用户将他或她的注意力集中在组件上的可能性的注意模型，从感知到的错误或原始错误中计算预期成本。 该方法通过为每个组件选择一个呈现操作来最小化总预期成本，从而为给定的渲染预算产生最低的预期成本。

公开(公告)号：US06192360B1

公开(公告)日：2001-02-20

申请号：US09102946

申请日：1998-06-23

申请人： Susan T. Dumais ,  David Heckerman ,  Eric Horvitz ,  John Carlton Platt ,  Mehran Sahami

发明人： Susan T. Dumais ,  David Heckerman ,  Eric Horvitz ,  John Carlton Platt ,  Mehran Sahami

IPC分类号： G06F1700

CPC分类号： G06F17/30707 ,  G06K9/6269 ,  Y10S707/99936

摘要： A text classifier and building the text classifier by determining appropriate parameters for the text classifier.

摘要翻译： 文本分类器，并通过确定文本分类器的适当参数构建文本分类器。

公开(公告)号：US06182133B2

公开(公告)日：2001-01-30

申请号：US09019641

申请日：1998-02-06

申请人： Eric Horvitz

发明人： Eric Horvitz

IPC分类号： G06F1516

CPC分类号： G06F17/30902 ,  Y10S707/99938

摘要： A technique, specifically apparatus and accompanying methods for use therein, that, through continual computation, harnesses available computer resources during periods of low processing activity and low network activity, such as idle time, for prefetching, e.g., web pages, or pre-selected portions thereof, into local cache of a client computer. As the browser prefetches and stores each web page (or component thereof) in its local cache, the browser provides a suitable and preferably visual indication, through its graphical user interface, to a user that this item has been fetched and stored. Consequently, the user can quickly and visually perceive that a particular item (i.e., a “fresh” page or portion) has just been prefetched and which (s)he can now quickly access from local cache. As such additional items are cached, the browser can change the color of the displayed hotlink associated with each of the items then stored in cache so as, through color coding, to reflect their relative latency (“aging”) in cache.

摘要翻译： 一种技术，特别是在其中使用的装置和伴随方法，通过连续计算，在低处理活动和低网络活动（例如空闲时间）期间利用可用的计算机资源，用于预取（例如，网页）或预先选择 其部分到客户端计算机的本地缓存中。 当浏览器将每个网页（或其组件）预取并存储在其本地高速缓存中时，浏览器通过其图形用户界面向用户提供适当且优选的可视指示，该用户指示该物品已被获取和存储。 因此，用户可以快速和视觉地感知到特定项目（即，“新鲜”页面或部分）刚刚被预取，并且他现在可以从本地高速缓存快速访问。 随着这些额外的项目被缓存，浏览器可以改变与存储在高速缓存中的每个项目相关联的显示的热链接的颜色，以便通过颜色编码来反映它们在缓存中的相对等待时间（“老化”）。

公开(公告)号：US6009452A

公开(公告)日：1999-12-28

申请号：US850346

申请日：1997-05-02

申请人： Eric Horvitz

发明人： Eric Horvitz

IPC分类号： G06F9/48 ,  G06F9/50 ,  G06F9/46

CPC分类号： G06F9/485 ,  G06F9/4881

摘要： Apparatus and accompanying methods for optimally using available computer resources, illustratively processing time, and which can be advantageously used for selecting task(s) instances to be precomputed during idle time as well as during other periods of processing activity. Specifically, at an onset of each idle-time interval, processing time is allocated to precompute during the remainder of that interval a future task instance, from among a group of such instances then available for precomputation, that will provide the highest fixed or incremental utility. For those task instances which exhibit constant or varying value with time, task selection is based on maximum probability of future occurrence, or net expected value (NEV), respectively, of each such instance. NEV is evaluated as a product of the task instance probability multiplied by a rate of change in the value (EVC flux) to be provided by that task with continued computation time, respectively. This product is assessed, for task instances that exhibit linearly changing value with time, at the onset of each idle-time interval, or, for task instances that exhibit non-linearly changing value, at the onset of each time slice occurring during such an interval. Processing time can be also allocated, at non-idle times, to precomputing a future task instance in lieu of continuing a presently executing task instance, if the future task instance then exhibits a time-discounted NEV that is larger than the EVC flux presently being provided by the currently executing task instance.

摘要翻译： 用于最佳地利用可用计算机资源的装置和伴随方法，说明性地处理时间，并且其可以有利地用于选择在空闲时间期间以及在其他处理活动期间预先计算的任务实例。 具体来说，在每个空闲时间间隔开始时，处理时间被分配给在该间隔的剩余时间内的预计算，一个未来的任务实例（从一组这样的实例中可用于预先计算）将提供最高的固定或增量效用 。 对于那些随着时间呈现恒定值或变化值的任务实例，任务选择基于每个这样的实例的未来发生的最大概率或净期望值（NEV）。 NEV被评估为任务实例概率乘以由该任务提供的持续计算时间的值（EVC通量）的变化率的乘积。 对于在每个空闲时间间隔开始时呈现出随时间呈线性变化的值的任务实例，或者对于在这样的时间间隔期间发生的每个时间片的开始，对于表现出非线性变化的值的任务实例，对该产品进行评估。 间隔。 如果未来的任务实例表现出大于当前正在执行的EVC通量的时间贴现NEV，则在非空闲时间也可以分配预处理未来任务实例代替继续当前执行的任务实例的处理时间 由当前执行的任务实例提供。

公开(公告)号：US5999938A

公开(公告)日：1999-12-07

申请号：US791597

申请日：1997-01-31

申请人： William J. Bliss ,  Jerry R. Hughson, Jr. ,  Lois E. Bauer ,  Suryanarayanan Raman ,  Michael L. Roberts ,  Eric Horvitz ,  Erich S. Finkelstein

发明人： William J. Bliss ,  Jerry R. Hughson, Jr. ,  Lois E. Bauer ,  Suryanarayanan Raman ,  Michael L. Roberts ,  Eric Horvitz ,  Erich S. Finkelstein

IPC分类号： G06F9/44 ,  G06F17/30

CPC分类号： G06F9/44 ,  Y10S707/99943 ,  Y10S707/99945

摘要： A system and method for creating a new destination data structure in memory populated with data from fields of an existing source data structure. A representation of the source is selected, dragged over, and dropped onto an icon representing a program module. The source and the program module are each associated with a type of data structure. If these types of data structures are different, then the destination is created in memory of the type associated with the program module. Once the destination is created, the data within the source is transformed to populate predetermined fields of the destination. One way of populating the destination is by determining which field in the destination corresponds to a given field in the source. Data from a given field of the source is loaded into the corresponding field of the destination. This is performed for each of the fields in the source, thus transferring the data into the destination from the source without having to manually re-enter or perform successive copy and paste operations on the data in the fields of the destination. Another way of populating the destination is by formatting data from each of the printable fields of the source into a predetermined rich text format to yield a formatted version of the source as if the source were being printed in one of the fields of the destination. The formatted data is then loaded into the field of the destination.

摘要翻译： 一种用于使用来自现有源数据结构的字段的数据填充的内存中创建新的目的地数据结构的系统和方法。 源的表示被选择，拖动并放在表示程序模块的图标上。 源和程序模块都与一种数据结构相关联。 如果这些类型的数据结构不同，则在与程序模块相关联的类型的存储器中创建目的地。 创建目的地后，将转换源中的数据以填充目标的预定字段。 填充目的地的一种方法是通过确定目的地中的哪个字段对应于源中的给定字段。 来自源的给定字段的数据被加载到目的地的相应字段中。 这对源中的每个字段执行，从而将数据从源传输到目的地，而无需手动重新输入或对目的地的字段中的数据执行连续的复制和粘贴操作。 填充目的地的另一种方式是将来自源的每个可打印字段的数据格式化为预定的富文本格式，以产生源的格式化版本，就好像源正在目的地的一个字段中打印一样。 然后将格式化的数据加载到目的地的字段中。

公开(公告)号：US10540665B2

公开(公告)日：2020-01-21

申请号：US12490413

申请日：2009-06-24

申请人： Eric Horvitz ,  Kamal Jain

发明人： Eric Horvitz ,  Kamal Jain

IPC分类号： G06Q30/02 ,  G06F16/41 ,  G06F16/958

摘要： A content provider may provide public access to a content item set, but may be unable to achieve sufficient revenue to sustain the administrative costs and ongoing development of the content item set. Instead, the content provider may develop relationships with one or more referrers (e.g., search engines.) When a user requests a content item, the content provider may determine whether the request results from a referral by a sponsoring referrer, and based on this determination may provide either a full version or a limited version of the content item. The referrer benefits by providing its users with free access to the content item set, which may be unavailable from non-sponsoring competitors, and in exchange may share advertising revenue with the content provider. This arrangement achieves sustaining sponsorship of the content provider while extending full and free access to the content item set to users of sponsoring referrers.

公开(公告)号：US09213780B2

公开(公告)日：2015-12-15

申请号：US12492916

申请日：2009-06-26

申请人： Joseph Yossi Azar ,  Eric Horvitz ,  Eyal Lubetzky ,  Dafna Shahaf

发明人： Joseph Yossi Azar ,  Eric Horvitz ,  Eyal Lubetzky ,  Dafna Shahaf

IPC分类号： G06F7/00 ,  G06F17/30

CPC分类号： G06F17/30902 ,  G06F17/30469

摘要： Many computing scenarios involve an item cache or index, comprising items corresponding to source items that may change without notice, rendering the item in the item cache or index stale. It may not be possible to guarantee the freshness of the items, but it may be desirable to reduce staleness in an efficient manner. Therefore, the refreshing of items may be prioritized by first predicting the query frequency of respective item representing the rate at which an item is retrieved from the item cache (e.g., by monitoring queries for the item), predicting an update frequency representing the rate at which the source item is updated by the source item host (e.g., by classifying the source item type), and computing a refresh utility representing the improvement in cache freshness achieved by refreshing the item. Respective items may then be prioritized for refreshing according to the computed refresh utilities.

摘要翻译： 许多计算场景涉及物品高速缓存或索引，其包括与源项目相对应的项目，其可以在没有通知的情况下改变，将物品呈现在物品高速缓存或索引陈旧中。 可能不可能保证物品的新鲜度，但是可能希望以有效的方式减少陈旧。 因此，可以通过首先预测表示从项目高速缓存检索项目的速率的各个项目的查询频率（例如，通过监视项目的查询）来预测项目的刷新，预测表示该项目的速率的更新频率 源项目由源项目主机更新（例如，通过对源项目类型进行分类），以及计算刷新实用程序的刷新实用程序，该刷新实用程序代表通过刷新项目实现的缓存新鲜度的改进。 然后可以根据所计算的刷新实用程序将各项目优先进行刷新。

公开(公告)号：US08498497B2

公开(公告)日：2013-07-30

申请号：US11561378

申请日：2006-11-17

申请人： Ruston John David Panabaker ,  Eric Horvitz ,  Johannes Klein ,  Gregory Baribault ,  Feng Zhao

发明人： Ruston John David Panabaker ,  Eric Horvitz ,  Johannes Klein ,  Gregory Baribault ,  Feng Zhao

IPC分类号： G06K9/36 ,  G09G5/00 ,  H04N9/74

CPC分类号： G06T11/00 ,  G06F17/30265 ,  H04N1/3876 ,  H04N5/781 ,  H04N9/8205 ,  H04N21/4788 ,  H04N21/84 ,  H04N2201/3214 ,  H04N2201/3215 ,  H04N2201/3253

摘要： A method and apparatus is provided for collecting data and generating synthesized data from the collected data. For example, a request for an image may be received from a requestor and at least one data capture device may be identified as capable of providing at least a portion of the requested image. A request may be sent to identified data capture devices to obtain an image corresponding to the requested image. Multiple images may be received from the data capture devices and may further be connected or stitched together to provide a panoramic, 3-dimensional image of requested subject matter.