会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • Automated solicited message detection
    • 自动请求消息检测
    • US20060031346A1
    • 2006-02-09
    • US11080258
    • 2005-03-14
    • Hao ZhengBruce ChuAnirban KunduMiles LibbeyDavid NakayamaJing Zhu
    • Hao ZhengBruce ChuAnirban KunduMiles LibbeyDavid NakayamaJing Zhu
    • G06F15/16
    • G06Q10/107H04L51/12
    • The invention relates to determining electronic text communication distributed in bulk is likely solicited. In one step, a first electronic and a second electronic submission are received. It is determined that the first electronic submission is likely solicited. A first portion is extracted from the first electronic submission and a second portion from the second electronic submission. The content of the first electronic submission influences extraction of the first portion, and the content of the second electronic submission influences extraction of the second portion. A first code is determined for the first portion and a second code is determined for the second portion, where the first code is indicative of the first portion and the second code is indicative of the second portion. The first code is compared to the second code. It is determined that the second electronic submission is likely solicited, at least in part, in response to comparing the first code to the second code.
    • 本发明涉及确定批量散布的电子文本通信可能被请求。 一步,接收第一个电子和第二个电子提交。 确定可能要求第一次电子提交。 从第一电子提交中提取第一部分,并从第二电子提交中提取第二部分。 第一电子提交的内容影响第一部分的提取,并且第二电子提交的内容影响第二部分的提取。 为第一部分确定第一代码,并且为第二部分确定第二代码,其中第一代码指示第一部分,而第二代码指示第二部分。 第一个代码与第二个代码进行比较。 确定可以至少部分地响应于将第一代码与第二代码进行比较来请求第二电子提交。
    • 2. 发明授权
    • Automated solicited message detection
    • 自动请求消息检测
    • US07321922B2
    • 2008-01-22
    • US11080258
    • 2005-03-14
    • Hao ZhengBruce Hui-der ChuAnirban KunduMiles A. LibbeyDavid H. NakayamaJing Zhu
    • Hao ZhengBruce Hui-der ChuAnirban KunduMiles A. LibbeyDavid H. NakayamaJing Zhu
    • G06F15/16
    • G06Q10/107H04L51/12
    • The invention relates to determining electronic text communication distributed in bulk is likely solicited. In one step, a first electronic and a second electronic submission are received. It is determined that the first electronic submission is likely solicited. A first portion is extracted from the first electronic submission and a second portion from the second electronic submission. The content of the first electronic submission influences extraction of the first portion, and the content of the second electronic submission influences extraction of the second portion. A first code is determined for the first portion and a second code is determined for the second portion, where the first code is indicative of the first portion and the second code is indicative of the second portion. The first code is compared to the second code. It is determined that the second electronic submission is likely solicited, at least in part, in response to comparing the first code to the second code.
    • 本发明涉及确定批量散布的电子文本通信可能被请求。 一步,接收第一个电子和第二个电子提交。 确定可能要求第一次电子提交。 从第一电子提交中提取第一部分,并从第二电子提交中提取第二部分。 第一电子提交的内容影响第一部分的提取,并且第二电子提交的内容影响第二部分的提取。 为第一部分确定第一代码,并且为第二部分确定第二代码,其中第一代码指示第一部分,而第二代码指示第二部分。 第一个代码与第二个代码进行比较。 确定可以至少部分地响应于将第一代码与第二代码进行比较来请求第二电子提交。
    • 4. 发明申请
    • Method and System for Selecting Candidate Neighboring Cells
    • 选择候选相邻单元的方法和系统
    • US20130084857A1
    • 2013-04-04
    • US13515195
    • 2011-04-29
    • Xiaowei ChenLei SuWanbin QiuDongmei HeHao Zheng
    • Xiaowei ChenLei SuWanbin QiuDongmei HeHao Zheng
    • H04W48/16
    • H04W48/16H04W24/02H04W36/0083
    • Disclosed is a method and system for selecting a candidate neighbor cell in the present invention. The method includes: determining a candidate cell set of a serving cell; acquiring a base station closest to the serving cell from the candidate cell set, and adding all the cells under the base station into a neighbor cell set; deleting a cell sheltered by the base station and cells included in the neighbor cell set from the candidate cell set; judging whether the candidate cell set is empty; if not, then returning to the step of acquiring a base station closest to the serving cell; and if yes, then taking cells in the neighbor cell set as a first layer of neighbor cells of the serving cell. By way of the present invention, the efficiency and accuracy of neighbor cell planning can be improved, thereby saving neighbor cell resources and improving the self adaptability of the candidate neighbor cell.
    • 本发明公开了一种用于选择候选相邻小区的方法和系统。 该方法包括:确定服务小区的候选小区集合; 从所述候选小区集获取最靠近所述服务小区的基站,并将所述基站下的所有小区相加到相邻小区组中; 从所述候选小区集合删除由所述基站和包括在所述相邻小区组中的小区所遮蔽的小区; 判断候选单元格是否为空; 如果不是,则返回到获取最靠近服务小区的基站的步骤; 并且如果是,则将相邻小区中的小区设置为服务小区的相邻小区的第一层。 通过本发明,可以提高相邻小区规划的效率和精度,从而节省相邻小区资源,提高候选邻居小区的自适应性。
    • 6. 发明申请
    • Traffic messaging system
    • 交通信息系统
    • US20070005782A1
    • 2007-01-04
    • US11112316
    • 2005-04-21
    • Hao Zheng
    • Hao Zheng
    • G06F15/16
    • H04L63/0236H04L51/12H04L51/26
    • According to the invention, a digital message system for receiving a plurality of digital messages is disclosed. The digital message system includes a message receiving function, a message grouping function and a traffic shaping unit. The message receiving function interacts with the first and second digital messages. The message grouping function associates a first digital message and a second digital message to a group that are similar in at least one way. The traffic shaping unit does not delay delivery of the first digital message, but delays a second digital message. Messages are delayed when traffic for the group compares unfavorably with a traffic profile for the group.
    • 根据本发明,公开了一种用于接收多个数字消息的数字消息系统。 数字消息系统包括消息接收功能,消息分组功能和流量整形单元。 消息接收功能与第一和第二数字消息交互。 消息分组功能将第一数字消息和第二数字消息与至少一种类似的组相关联。 流量整形单元不延迟第一数字消息的传送,而是延迟第二数字消息。 当组的流量与组的流量模板进行比较时,消息将被延迟。
    • 9. 发明授权
    • Training a search query intent classifier using wiki article titles and a search click log
    • 使用wiki文章标题和搜索点击日志训练搜索查询意图分类器
    • US09465864B2
    • 2016-10-11
    • US13384589
    • 2010-09-29
    • Jian HuHao Zheng
    • Jian HuHao Zheng
    • G06F15/18G06F17/30G06K9/62G06N5/02G06N99/00
    • G06N99/005G06F17/30705G06F17/30958G06K9/6256G06K9/6269G06N5/025G06N7/005
    • Techniques are described herein for training a search query intent classifier using wiki article titles and a search click log. Titles of wiki articles that correspond to links that are associated with a specified wiki article and/or titles of wiki articles that are included in a category that includes the specified wiki article are extracted and included with the title of the specified wiki article in an initial set. Each title in the initial set is correlated with respective clicked URI(s) using a search click log. The initial set is expanded to include search terms that are correlated to the clicked URIs based on the search click log to provide an expanded set. The search query intent classifier is trained to classify search queries with respect to a query intent that is associated with the title of the specified wiki article based on the expanded set.
    • 这里描述了用于训练使用wiki文章标题和搜索点击日志的搜索查询意图分类器的技术。 与指定维基文章相关联的链接和/或包含在指定维基文章的类别中的维基文章的标题的Wiki文章的标题将被提取并包含在指定的维基文章的标题中 组。 初始集中的每个标题与使用搜索点击日志的各个点击的URI相关联。 初始集合被扩展为包括与基于搜索点击日志的点击的URI相关联的搜索项以提供扩展集合。 对搜索查询意图分类器进行训练,以便根据扩展集合对与指定维基文章的标题相关联的查询意图对搜索查询进行分类。