Hierarchal control of teleconferences
    23.
    发明授权
    Hierarchal control of teleconferences 有权
    电话会议的分层控制

    公开(公告)号:US08275108B2

    公开(公告)日:2012-09-25

    申请号:US12037553

    申请日:2008-02-26

    IPC分类号: H04M3/42

    CPC分类号: H04M3/56

    摘要: A teleconference between at least two participants is evaluated by monitoring the teleconference and detecting a triggering event if more than one participant desires to speak at the same time. Upon detecting a triggering event, e.g., detecting an attempt of one or more participants to interrupt another participant, or detecting a request initiated by one or more participants to interrupt another participant, a dominant source is selected from among the ones of the participants attempting/requesting to speak based at least in part upon a determined hierarchal order of those participants attempting/requesting to speak. A participant is then selected from the participants to have the role of the dominant participant based upon the selected dominant source and only the speech of the dominant participant is conveyed to each participant through the teleconference system.

    摘要翻译: 通过监视电话会议和多个参与者希望同时发言来检测触发事件,评估至少两名参与者之间的电话会议。 在检测到触发事件时,例如,检测到一个或多个参与者尝试中断另一参与者,或者检测由一个或多个参与者发起的请求以中断另一个参与者的请求,从参与者中选择主要来源/ 要求至少部分地基于尝试/请求发言的参与者的确定的等级顺序发言。 然后从参与者中选出参与者以基于所选择的主要来源为主导参与者的角色,并且仅通过电话会议系统将主要参与者的言语传达给每个参与者。

    RELATIONSHIP MANAGEMENT FOR CONTACT STALENESS
    25.
    发明申请
    RELATIONSHIP MANAGEMENT FOR CONTACT STALENESS 有权
    联系方式的关系管理

    公开(公告)号:US20100094837A1

    公开(公告)日:2010-04-15

    申请号:US12252349

    申请日:2008-10-15

    IPC分类号: G06F17/30

    CPC分类号: G06Q10/107

    摘要: A contact management data processing system can be provided. The system can include a contact manager coupled to a list of contacts and stored staleness criteria stored in connection with the list of contacts. The system also can include stale contact management logic. The logic can include program code enabled to apply the stored staleness criteria to a selected contact to identify a stale contact, and to manage the stale contact in the list of contacts. In aspects of the embodiment, the list of contacts can be stored in a personal computer, in a server remotely disposed from the contact manager, in a telephone such as a cellular telephone or voice over Internet protocol (VoIP) telephone, or in a personal digital assistant to name but a few.

    摘要翻译: 可以提供联系人管理数据处理系统。 系统可以包括耦合到联系人列表的联系人管理器和与联系人列表相关联地存储的存储的陈旧标准。 该系统还可以包括陈旧的联系人管理逻辑。 逻辑可以包括启用的程序代码,以将存储的陈旧条件应用于所选联系人以识别陈旧的联系人,并且管理联系人列表中的陈旧的联系人。 在该实施例的方面中,联系人列表可以存储在例如蜂窝电话或互联网协议语音(VoIP)电话或电话中的电话中从联系人管理器远程设置的服务器中的个人计算机中 数位助理姓名但少数。

    AUTOMATED SURFACING OF TAGGED CONTENT ADJUNCT TO VERTICAL APPLICATIONS
    27.
    发明申请
    AUTOMATED SURFACING OF TAGGED CONTENT ADJUNCT TO VERTICAL APPLICATIONS 审中-公开
    标签内容的自动表面调整到垂直应用

    公开(公告)号:US20090183082A1

    公开(公告)日:2009-07-16

    申请号:US12015270

    申请日:2008-01-16

    IPC分类号: G06F3/00

    CPC分类号: G06Q10/10

    摘要: Embodiments of the present invention address deficiencies of the art in respect to social bookmarking and provide a method, system and computer program product for automated surfacing of tagged content adjunct to a vertical application. In an embodiment of the invention, a method for automatically surfacing tagged content in a vertical application can be provided. The method can include receiving and parsing text from content in an end user application, comparing the parsed text to social bookmarks and associated metadata from a social bookmarking system and matching portions of the content to respective ones of the social bookmarks and associated metadata based upon the comparison, and directing a visual emphasis of the matched portions of the content in the end user application, whereby the end user application is unmodified to perform the receiving, comparing and directing steps.

    摘要翻译: 本发明的实施例解决了关于社会书签的本领域的缺陷,并且提供了用于对垂直应用附加的标记内容进行自动表面化的方法,系统和计算机程序产品。 在本发明的一个实施例中,可以提供用于在垂直应用中自动表面标记的内容的方法。 该方法可以包括从终端用户应用程序中的内容接收和解析文本,将解析的文本与社会书签系统的相关元数据进行比较,并将内容的相应部分与相应的社交书签和相关元数据相匹配 比较和指导最终用户应用中内容的匹配部分的视觉强调,由此最终用户应用未被修改以执行接收,比较和指导步骤。

    AGGREGATE SCORING OF TAGGED CONTENT ACROSS SOCIAL BOOKMARKING SYSTEMS
    28.
    发明申请
    AGGREGATE SCORING OF TAGGED CONTENT ACROSS SOCIAL BOOKMARKING SYSTEMS 审中-公开
    通过社会书签系统对标签内容进行标定

    公开(公告)号:US20090144254A1

    公开(公告)日:2009-06-04

    申请号:US11947102

    申请日:2007-11-29

    IPC分类号: G06F7/06

    CPC分类号: G06Q30/02 G06F17/30884

    摘要: Embodiments of the present invention address deficiencies of the art in respect to social bookmarking and provide a method, system and computer program product for aggregating scoring of tagged content across social bookmarking systems. In an embodiment of the invention, a method for aggregating scoring of tagged content across social bookmarking systems can be provided. The method can include combining tag scores for a tag in content across multiple different social bookmarking systems into a single aggregate tag score and applying the single aggregate tag score to the tag in the content. In this regard, combining tag scores for a tag in content across multiple different social bookmarking systems into a single aggregate tag score can include computing either a simple or a weighted average of the tag scores for the tag to produce the single aggregate score.

    摘要翻译: 本发明的实施例解决了关于社会书签的本领域的缺陷,并提供了一种用于在社会书签系统上聚合标记内容的评分的方法,系统和计算机程序产品。 在本发明的一个实施例中,可以提供一种用于在社会书签系统上聚合标记内容评分的方法。 该方法可以包括将多个不同社会书签系统中的内容中的标签的标签分数组合成单个聚合标签分数,并将单个聚合标签分数应用于内容中的标签。 在这方面,将多个不同社会书签系统中的内容中的标签的标签分数组合成单个聚合标签评分可以包括计算标签的标签分数的简单或加权平均以产生单个总分数。

    ENABLING COLLABORATIVE NETWORKS
    29.
    发明申请
    ENABLING COLLABORATIVE NETWORKS 审中-公开
    启用协作网络

    公开(公告)号:US20090100052A1

    公开(公告)日:2009-04-16

    申请号:US11873114

    申请日:2007-10-16

    IPC分类号: G06F17/30 G06F15/16

    摘要: A system and method for providing collaborative resources to a user. A search expression is received from a user. One more keywords are determined from the search expression. One or more resources are determined responsive to the keywords and based on information related to the user, and the at least one resource is provided to the user. The one or more resources may be determined responsive to and prioritized to at least one of, for example, information in email of the user, an organization of the user, a search history of the user, an organizational position of the user, a level of experience of the user, a geographical location of the user, a geographical location of the resource, a language preference of the user, or a keyword match confidence. The resource may include at least one person and presence information associated with the at least one person.

    摘要翻译: 一种用于向用户提供协作资源的系统和方法。 从用户接收到搜索表达式。 从搜索表达式确定另外一个关键字。 响应于关键字并且基于与用户相关的信息来确定一个或多个资源,并且向用户提供至少一个资源。 一个或多个资源可以针对例如用户的电子邮件中的信息,用户的组织,用户的搜索历史,用户的组织位置,用户的组织位置,等级 用户的经验,用户的地理位置,资源的地理位置,用户的语言偏好或关键字匹配置信度。 所述资源可以包括与所述至少一个人相关联的至少一个人和存在信息。

    CURSOR PATH VECTOR ANALYSIS FOR DETECTING CLICK FRAUD
    30.
    发明申请
    CURSOR PATH VECTOR ANALYSIS FOR DETECTING CLICK FRAUD 有权
    用于检测点击率的游标路径分析

    公开(公告)号:US20090024461A1

    公开(公告)日:2009-01-22

    申请号:US11778156

    申请日:2007-07-16

    IPC分类号: G06Q30/00

    摘要: A system and method for detecting click fraud where data related to at least one vector associated with a path taken by movement of a cursor on a web page prior to an advertisement on the web page being clicked by a controller of the cursor is received. Click fraud is detected based on an analysis of the received data. A pattern in the at least one vector is analyzed to determine if the cursor movement is human-like and a click fraud detected if the cursor movement is not human-like. In another embodiment, the at least one vector associated with the path is stored and compared with previously stored vectors associated with the path and a click fraud detected if the stored at least one vector is analogous to at least one of the previously stored vectors associated with the path.

    摘要翻译: 一种用于检测点击欺诈的系统和方法,其中接收与由光标的控制器点击的在网页上的广告之前在网页上的光标移动相关联的至少一个向量相关联的数据。 基于收到的数据分析检测到点击欺诈。 分析至少一个向量中的图案以确定光标移动是否类似人物,并且如果光标移动不是类似的,则检测到点击不正当。 在另一个实施例中,与路径相关联的至少一个向量被存储并与先前存储的与路径相关联的向量进行比较,并且如果存储的至少一个向量类似于先前存储的与 路径。