利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

29 条记录 (耗时 0.035 秒)

    Automated solicited message detection
    1.
    发明授权
    Automated solicited message detection 有权
    自动请求消息检测

    公开(公告)号：US07321922B2

    公开(公告)日：2008-01-22

    申请号：US11080258

    申请日：2005-03-14

    申请人： Hao Zheng ,  Bruce Hui-der Chu ,  Anirban Kundu ,  Miles A. Libbey ,  David H. Nakayama ,  Jing Zhu

    发明人： Hao Zheng ,  Bruce Hui-der Chu ,  Anirban Kundu ,  Miles A. Libbey ,  David H. Nakayama ,  Jing Zhu

    IPC分类号： G06F15/16

    CPC分类号： G06Q10/107 ,  H04L51/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.

    摘要翻译： 本发明涉及确定批量散布的电子文本通信可能被请求。 一步，接收第一个电子和第二个电子提交。 确定可能要求第一次电子提交。 从第一电子提交中提取第一部分，并从第二电子提交中提取第二部分。 第一电子提交的内容影响第一部分的提取，并且第二电子提交的内容影响第二部分的提取。 为第一部分确定第一代码，并且为第二部分确定第二代码，其中第一代码指示第一部分，而第二代码指示第二部分。 第一个代码与第二个代码进行比较。 确定可以至少部分地响应于将第一代码与第二代码进行比较来请求第二电子提交。

    Automated solicited message detection
    2.
    发明申请
    Automated solicited message detection 有权
    自动请求消息检测

    公开(公告)号：US20060031346A1

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

    申请号：US11080258

    申请日：2005-03-14

    申请人： Hao Zheng ,  Bruce Chu ,  Anirban Kundu ,  Miles Libbey ,  David Nakayama ,  Jing Zhu

    发明人： Hao Zheng ,  Bruce Chu ,  Anirban Kundu ,  Miles Libbey ,  David Nakayama ,  Jing Zhu

    IPC分类号： G06F15/16

    CPC分类号： G06Q10/107 ,  H04L51/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.

    摘要翻译： 本发明涉及确定批量散布的电子文本通信可能被请求。 一步，接收第一个电子和第二个电子提交。 确定可能要求第一次电子提交。 从第一电子提交中提取第一部分，并从第二电子提交中提取第二部分。 第一电子提交的内容影响第一部分的提取，并且第二电子提交的内容影响第二部分的提取。 为第一部分确定第一代码，并且为第二部分确定第二代码，其中第一代码指示第一部分，而第二代码指示第二部分。 第一个代码与第二个代码进行比较。 确定可以至少部分地响应于将第一代码与第二代码进行比较来请求第二电子提交。

    Method and system for selecting candidate neighboring cells
    5.
    发明授权
    Method and system for selecting candidate neighboring cells 有权
    用于选择候选相邻小区的方法和系统

    公开(公告)号：US08666401B2

    公开(公告)日：2014-03-04

    申请号：US13515195

    申请日：2011-04-29

    申请人： Xiaowei Chen ,  Lei Su ,  Wanbin Qiu ,  Dongmei He ,  Hao Zheng

    发明人： Xiaowei Chen ,  Lei Su ,  Wanbin Qiu ,  Dongmei He ,  Hao Zheng

    IPC分类号： H04W48/16 ,  H04W24/02 ,  H04W36/00

    CPC分类号： H04W48/16 ,  H04W24/02 ,  H04W36/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.

    摘要翻译： 本发明公开了一种用于选择候选相邻小区的方法和系统。 该方法包括：确定服务小区的候选小区集合; 从所述候选小区集获取最靠近所述服务小区的基站，并将所述基站下的所有小区相加到相邻小区组中; 从所述候选小区集合删除由所述基站和包括在所述相邻小区组中的小区所遮蔽的小区; 判断候选单元格是否为空; 如果不是，则返回到获取最靠近服务小区的基站的步骤; 并且如果是，则将相邻小区中的小区设置为服务小区的相邻小区的第一层。

    INTELLIGENT FEATURE EXPANSION OF ONLINE TEXT ADS
    6.
    发明申请
    INTELLIGENT FEATURE EXPANSION OF ONLINE TEXT ADS 有权
    在线文本ADS的智能特征扩展

    公开(公告)号：US20120316972A1

    公开(公告)日：2012-12-13

    申请号：US12935283

    申请日：2010-03-04

    申请人： Jian Hu ,  Hao Zheng

    发明人： Jian Hu ,  Hao Zheng

    IPC分类号： G06Q30/02

    CPC分类号： G06Q30/0244 ,  G06F17/30616 ,  G06F17/30672 ,  G06F17/30867 ,  G06Q30/0256 ,  G06Q30/0276

    摘要： Embodiments employ knowledge from network searches to enrich features useable to describe an advertisement. Advertisement content may be segmented to generate key phrases that are rank ordered based on a phrase's pointwise mutual information value with Ad keywords and term frequency-inverse document frequency (TF-IDF) scores. These key phrases are employed to generate a plurality of query searches that are performed to generate a plurality of search result snippets. The snippets are then analyzed and ranked to identify query expansion features having a TF-IDF value over a given threshold. A subset of these ranked phrases are combined with the Ad keywords to be used to rebuild an Ad index for the given advertisement. When content is to be delivered to a client device, content keywords are compared to the Ad index to select an advertisement to be provided with the content to the client device.

    摘要翻译： 实施例采用来自网络搜索的知识来丰富可用于描述广告的特征。 广告内容可以被分割以产生基于具有广告关键词和术语频率 - 逆文档频率（TF-IDF）分数的短语的点互信息值进行排序的关键短语。 采用这些关键短语来产生多个查询搜索，以便生成多个搜索结果片段。 然后对片段进行分析和排序，以识别具有超过给定阈值的TF-IDF值的查询扩展特征。 将这些排名短语的一部分与用于重建给定广告的广告索引的广告关键字相结合。 当将内容传送到客户端设备时，将内容关键字与广告索引进行比较，以选择要向客户端设备提供内容的广告。

    Diagonally cuttable led strip and method of use
    7.
    发明授权
    Diagonally cuttable led strip and method of use 有权

    公开(公告)号：US10948141B1

    公开(公告)日：2021-03-16

    申请号：US16893338

    申请日：2020-06-04

    申请人： Daniel Machlis ,  Hao Zheng

    发明人： Daniel Machlis ,  Hao Zheng

    IPC分类号： F21S4/00 ,  F21S4/24 ,  H05K1/18 ,  F21Y103/10 ,  F21Y115/10

    摘要： A diagonally cuttable LED strip system comprising of a channel having a bottom and one or more side walls and a lens in which a primary circuit board having one or more LED diodes, one or more resistors, and one or more cutting lines resides therein. The one or more cutting lines include perpendicular and non-perpendicular cutting lines which divide the channel into cuttable increments at one or more angles. An extender is provided which attaches to the end of a channel to allow the cuttable increments of the channel to be extended, shortened, or a combination thereof.

    Method and System for Selecting Candidate Neighboring Cells
    8.
    发明申请
    Method and System for Selecting Candidate Neighboring Cells 有权
    选择候选相邻单元的方法和系统

    公开(公告)号：US20130084857A1

    公开(公告)日：2013-04-04

    申请号：US13515195

    申请日：2011-04-29

    申请人： Xiaowei Chen ,  Lei Su ,  Wanbin Qiu ,  Dongmei He ,  Hao Zheng

    发明人： Xiaowei Chen ,  Lei Su ,  Wanbin Qiu ,  Dongmei He ,  Hao Zheng

    IPC分类号： H04W48/16

    CPC分类号： H04W48/16 ,  H04W24/02 ,  H04W36/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.

    摘要翻译： 本发明公开了一种用于选择候选相邻小区的方法和系统。 该方法包括：确定服务小区的候选小区集合; 从所述候选小区集获取最靠近所述服务小区的基站，并将所述基站下的所有小区相加到相邻小区组中; 从所述候选小区集合删除由所述基站和包括在所述相邻小区组中的小区所遮蔽的小区; 判断候选单元格是否为空; 如果不是，则返回到获取最靠近服务小区的基站的步骤; 并且如果是，则将相邻小区中的小区设置为服务小区的相邻小区的第一层。 通过本发明，可以提高相邻小区规划的效率和精度，从而节省相邻小区资源，提高候选邻居小区的自适应性。

    Traffic messaging system
    10.
    发明申请
    Traffic messaging system 审中-公开
    交通信息系统

    公开(公告)号：US20070005782A1

    公开(公告)日：2007-01-04

    申请号：US11112316

    申请日：2005-04-21

    申请人： Hao Zheng

    发明人： Hao Zheng

    IPC分类号： G06F15/16

    CPC分类号： H04L63/0236 ,  H04L51/12 ,  H04L51/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.

    摘要翻译： 根据本发明，公开了一种用于接收多个数字消息的数字消息系统。 数字消息系统包括消息接收功能，消息分组功能和流量整形单元。 消息接收功能与第一和第二数字消息交互。 消息分组功能将第一数字消息和第二数字消息与至少一种类似的组相关联。 流量整形单元不延迟第一数字消息的传送，而是延迟第二数字消息。 当组的流量与组的流量模板进行比较时，消息将被延迟。