会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Prioritizing messages within a message network
    • 确定消息网络中的消息优先级
    • US09356806B2
    • 2016-05-31
    • US12898711
    • 2010-10-06
    • Abdur ChowdhuryAshish GoelRam Ravichandran
    • Abdur ChowdhuryAshish GoelRam Ravichandran
    • G06F15/16H04L12/64H04L12/58
    • H04L51/26H04L12/6418H04L51/04H04L51/32H04L67/22H04L67/26
    • A system and a method are disclosed for recommending electronic messages in a message sharing system. Users can post messages to the message sharing system. These messages from posting users are received by the system and sent to receiving users that have subscribed to the posting users. The receiving users interact with the messages in various ways, such as by sharing the messages with other users. Interaction information is received for each of the electronic messages. The interaction information includes an indication of the number of interactions with the electronic message by receiving users. A score is determined for each electronic message based on the interaction information. Electronic messages are selected for being recommended to a user or a group of users based on the scores. The recommendations are then sent to the users, enabling users to better focus their attention on messages that are likely to be interesting.
    • 公开了一种用于在消息共享系统中推荐电子消息的系统和方法。 用户可以将消息发布到消息共享系统。 来自发布用户的这些消息由系统接收并发送给已订阅发布用户的接收用户。 接收用户以各种方式与消息进行交互,例如通过与其他用户共享消息。 接收每个电子信息的交互信息。 交互信息包括接收用户与电子消息的交互次数的指示。 基于交互信息确定每个电子消息的分数。 基于分数,选择电子消息被推荐给用户或一组用户。 然后将这些建议发送给用户,使用户能够将注意力集中在可能有趣的消息上。
    • 2. 发明申请
    • Prioritizing Messages Within a Message Network
    • 确定消息网络内的消息优先级
    • US20120089681A1
    • 2012-04-12
    • US12898711
    • 2010-10-06
    • Abdur ChowdhuryAshish GoelRam Ravichandran
    • Abdur ChowdhuryAshish GoelRam Ravichandran
    • G06F15/16
    • H04L51/26H04L12/6418H04L51/04H04L51/32H04L67/22H04L67/26
    • A system and a method are disclosed for recommending electronic messages in a message sharing system. Users can post messages to the message sharing system. These messages from posting users are received by the system and sent to receiving users that have subscribed to the posting users. The receiving users interact with the messages in various ways, such as by sharing the messages with other users. Interaction information is received for each of the electronic messages. The interaction information includes an indication of the number of interactions with the electronic message by receiving users. A score is determined for each electronic message based on the interaction information. Electronic messages are selected for being recommended to a user or a group of users based on the scores. The recommendations are then sent to the users, enabling users to better focus their attention on messages that are likely to be interesting.
    • 公开了一种用于在消息共享系统中推荐电子消息的系统和方法。 用户可以将消息发布到消息共享系统。 来自发布用户的这些消息由系统接收并发送给已订阅发布用户的接收用户。 接收用户以各种方式与消息进行交互,例如通过与其他用户共享消息。 接收每个电子信息的交互信息。 交互信息包括接收用户与电子消息的交互次数的指示。 基于交互信息确定每个电子消息的分数。 基于分数,选择电子消息被推荐给用户或一组用户。 然后将这些建议发送给用户,使用户能够将注意力集中在可能有趣的消息上。
    • 6. 发明授权
    • Quality of service based path selection for connection-oriented networks
    • 面向连接的网络的基于服务质量的路径选择
    • US06661797B1
    • 2003-12-09
    • US09514725
    • 2000-02-28
    • Ashish GoelDeepak KatariaDimitris LogothetisKajamalai Gopalaswamy Ramakrishnan
    • Ashish GoelDeepak KatariaDimitris LogothetisKajamalai Gopalaswamy Ramakrishnan
    • H04L1228
    • H04L45/00H04L45/121
    • Arrangements and methods for efficiently selecting an optimum connection path that meets user specified delay requirements with enhanced efficiency. In a basic aspect, a method is implemented by one of a plurality of algorithms to meet user QoS specifications. The user not only specifies a delay threshold T for the incoming request but also specifies a delay threshold tolerance &egr; for the path delay that will satisfy him. Two implementations are disclosed. The first is termed non-iterative and sets scaling factor &tgr;=min (T, (n−1)/&egr;), where n is a number of links in a shortest path, scales all the relevant delay parameters by &tgr;/T, truncates all the scaled values to integers, and uses a dynamic programming algorithm to accumulate the total of resulting link delay parameters values for each possible shortest path. The second method, termed iterative, is similar, except that it sets &tgr;
    • 有效选择满足用户指定的延迟要求并提高效率的最佳连接路径的安排和方法。 在一个基本方面,一种方法由多种算法中的一种来实现,以满足用户QoS规范。 用户不仅为传入请求指定了延迟阈值T,还指定了将满足他的路径延迟的延迟阈值容差ε。 公开了两种实现方式。 第一个称为非迭代,并设置缩放因子τt = min(T,(n-1)/ epsilon),其中n是最短路径中的链路数,将所有相关延迟参数缩放为tau / T,截断 将所有缩放的值作为整数,并使用动态编程算法来累积每个可能的最短路径的结果链路延迟参数值的总和。 称为迭代的第二种方法是类似的,只是它设置tau << T。 然后,如果缩放,截断和累加步骤不能满足客户规格,则下一次迭代将两倍。 两种方法都以计算有效的方式计算从一个源到所有目的地的路径。
    • 9. 发明授权
    • Automatic verification of dependency
    • 自动验证依赖关系
    • US08555226B1
    • 2013-10-08
    • US13603402
    • 2012-09-04
    • Xiushan FengJayanta BhadraAshish Goel
    • Xiushan FengJayanta BhadraAshish Goel
    • G06F17/50
    • G06F17/504
    • An approach is provided in which a formal verification tool sends a condition signal to a first circuit instance and to a second circuit instance, which are both instances of an electric circuit design. The formal verification tool selects a common input port and sends a first input value to the common input port of the first circuit instance and sends a second input value, which is different than the first input value, to the common input port of the second circuit instance. In turn, the first circuit instance generates a first output value and the second circuit instance generates a second instance value, which are utilized to verify dependencies between the electronic circuit's input ports and output ports.
    • 提供了一种方法,其中形式验证工具向第一电路实例和第二电路实例发送条件信号,这是电路设计的两个实例。 形式验证工具选择公共输入端口并将第一输入值发送到第一电路实例的公共输入端口,并将与第一输入值不同的第二输入值发送到第二电路的公共输入端口 实例。 反过来,第一电路实例产生第一输出值,第二电路实例产生第二实例值,用于验证电子电路的输入端口和输出端口之间的依赖关系。