公开(公告)号：US06546385B1

公开(公告)日：2003-04-08

申请号：US09374380

申请日：1999-08-13

Applicant: Jianchang Mao ,  Carlton Wayne Niblack

Inventor： Jianchang Mao ,  Carlton Wayne Niblack

IPC: G06F1730

CPC classification number: G06F17/30011 ,  G06F17/3061 ,  Y10S707/917 ,  Y10S707/959 ,  Y10S707/99933

Abstract: A method and apparatus for indexing and searching content in a hardcopy document utilizes a searching assistant computing device (402) with an index table (420) stored in memory (412). The index table (420) is created in memory by scanning a 2-D barcode from a hardcopy document or alternatively by downloading indexing information from a web page via the Internet (430). A search engine (410) in the searching assistant (402) searches the index table (420) to locate a data element found in the content of the hardcopy document. The indexing information corresponding to the data element is displayed to a user as part of the search results to indicate the location of the data element in the hardcopy document.

Abstract translation: 用于在硬拷贝文档中索引和搜索内容的方法和装置利用具有存储在存储器（412）中的索引表（420）的搜索辅助计算设备（402）。 索引表（420）通过从硬拷贝文档扫描二维条形码或通过因特网从网页下载索引信息（430）而在存储器中创建。 搜索助理（402）中的搜索引擎（410）搜索索引表（420）以定位在硬拷贝文档的内容中找到的数据元素。 与数据元素相对应的索引信息作为搜索结果的一部分显示给用户，以指示硬拷贝文档中数据元素的位置。

公开(公告)号：US06259812B1

公开(公告)日：2001-07-10

申请号：US09635201

申请日：2000-08-09

Applicant: Jianchang Mao ,  Matthias Zimmerman

Inventor： Jianchang Mao ,  Matthias Zimmerman

IPC: G06K918

CPC classification number: G06K9/00872

Abstract: A method, apparatus, and article of manufacture employing lexicon reduction using key characters and a neural network, for recognizing a line of cursive text. Unambiguous parts of a cursive image, referred to as “key characters,” are identified. If the level of confidence that a segment of a line of cursive text is a particular character is higher than a threshold, and is also sufficiently higher than the level of confidence of neighboring segments, then the character is designated as a key character candidate. Key character candidates are then screened using geometric information. The key character candidates that pass the screening are designated key characters. Two-stages of lexicon reduction are employed. The first stage of lexicon reduction uses a neural network to estimate a lower bound and an upper bound of the number of characters in a line of cursive text. Lexicon entries having a total number of characters outside of the bounds are eliminated. For the second stage of lexicon reduction, the lexicon is further reduced by comparing character strings using the key characters, with lexicon entries. For each of the key characters in the character strings, it is determined whether there is a mismatch between the key character and characters in a corresponding search range in the lexicon entry. If the number of mismatches for all of the key characters in a search string is greater than (1+(the number of key characters in the search string/4)), then the lexicon entry is eliminated. Accordingly, the invention advantageously accomplishes lexicon reduction, thereby decreasing the time required to recognize a line of cursive text, without reducing accuracy.

Abstract translation: 一种使用关键字符和神经网络来进行词典缩减的方法，装置和制品，用于识别草书文本。 识别草书图像的明确部分，称为“关键字符”。 如果一行草图文本的一段是特定字符的置信度高于阈值，并且也足够高于相邻段的置信度，则该字符被指定为关键字符候选。 然后使用几何信息筛选关键字候选人。 通过筛选的关键角色候选人被指定为关键角色。 采用两个阶段的词典缩小。 词典缩减的第一阶段使用神经网络来估计草图文本行中的字符数的下限和上限。 消除了界限外的字符总数的词典条目。 对于词汇缩减的第二阶段，通过使用关键字符比较字符串与词典条目进一步减少词汇。 对于字符串中的每个关键字符，确定在词典条目中的相应搜索范围中的关键字符和字符之间是否存在不匹配。 如果搜索字符串中所有关键字符的匹配数量大于（1+（搜索字符串/ 4中的关键字符数）），则排除词典条目。 因此，本发明有利地实现词典缩减，从而减少了识别草稿文本行所需的时间，而不降低精确度。

公开(公告)号：US08856028B2

公开(公告)日：2014-10-07

申请号：US13012655

申请日：2011-01-24

Applicant: Jian Yang ,  Jianchang Mao

Inventor： Jian Yang ,  Jianchang Mao

IPC: G06Q30/00 ,  G06Q30/02

CPC classification number: G06Q30/0244 ,  G06Q30/0241 ,  G06Q30/0245 ,  G06Q30/0251 ,  G06Q30/0255 ,  G06Q30/0277

Abstract: An advertisement impression distribution system is programmed to generate an allocation plan for serving a number of advertisement impressions changeable as a result of one or more events, the allocation plan to allocate a first portion of advertisement impressions to satisfy guaranteed demand and a second portion of advertisement impressions to satisfy non-guaranteed demand. The system includes an optimizer programmed to establish a relationship between the first portion of advertisement impressions and the second portion of advertisement impressions, the relationship defining a range of possible proportions of allocation of the first portion of advertisement impressions and the second portion of advertisement impressions; and to impose at least one objective on the relationship including moderating an increase in the number of advertisement impressions available for allocation to the first and second portions, to minimize a cost associated with reducing a quality of the advertisement impressions as their volume increases. The system outputs the allocation plan to an ad serving module to control serving of the advertisement impressions according to the range of possible proportions of allocation between the first and the second portions.

Abstract translation: 广告印象分配系统被编程为生成分配计划，用于服务由于一个或多个事件而可更改的多个广告印象，分配计划以分配广告印象的第一部分以满足保证的需求和广告的第二部分 满足无保证需求的印象。 所述系统包括经过编程的优化器，用于建立广告印象的第一部分与广告印象的第二部分之间的关​​系，所述关系定义广告印象的第一部分和第二部分广告印象的可能分配比例的范围; 并且对该关系施加至少一个目标，包括调整可用于分配给第一和第二部分的广告印象数量的增加，以最小化与其音量增加时降低广告印象的质量相关联的成本。 系统将分配计划输出到广告服务模块，以根据第一和第二部分之间的可能分配比例的范围来控制广告印象的投放。

公开(公告)号：US08788492B2

公开(公告)日：2014-07-22

申请号：US11082202

申请日：2005-03-15

Applicant: Qi Lu ,  Eckart Walther ,  David Ku ,  Chung-Man Tam ,  Kevin Lee ,  Zhichen Xu ,  Ali Diab ,  Kenneth Norton ,  Jianchang Mao

Inventor： Qi Lu ,  Eckart Walther ,  David Ku ,  Chung-Man Tam ,  Kevin Lee ,  Zhichen Xu ,  Ali Diab ,  Kenneth Norton ,  Jianchang Mao

IPC: G06F17/30

CPC classification number: G06F17/30525 ,  G06F17/30867 ,  G06F17/30899 ,  H04L51/32

Abstract: Computer systems and methods incorporate user annotations (metadata) regarding various pages or sites, including annotations by a querying user and by members of a trust network defined for the querying user into search and browsing of a corpus such as the World Wide Web. A trust network is defined for each user, and annotations by any member of a first user's trust network are made visible to the first user during search and/or browsing of the corpus. Users can also limit searches to content annotated by members of their trust networks or by members of a community selected by the user.

公开(公告)号：US08359295B2

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

申请号：US13282559

申请日：2011-10-27

Applicant: Kenneth Norton ,  Chung-Man Tam ,  Jianchang Mao ,  Zhichen Xu ,  Adrienne Bassett ,  Ashley Hall ,  Nathan Arnold

Inventor： Kenneth Norton ,  Chung-Man Tam ,  Jianchang Mao ,  Zhichen Xu ,  Adrienne Bassett ,  Ashley Hall ,  Nathan Arnold

IPC: G06F17/00 ,  G06F3/00 ,  H04N7/173

CPC classification number: G06F17/30867 ,  G06F3/04842 ,  G06F17/30873 ,  G06F17/30997

Abstract: The present invention relates to systems, methods, and user interfaces for browsing a collection of content items saved by a user or by one or more buddies associated with a given user. The method of the present invention comprises saving one or more content items and one or more associated keywords as specified by a user. An interface is generated that displays the one or more saved content items and the one or more associated keywords, as well as the one or more buddies associated with a given user. A user indication of the selection of a given keyword or the selection of a given buddy by the user is received. The one or more displayed content items are filtered according to the selected keyword, buddy, or combination of selected keyword and buddy.

Abstract translation: 本发明涉及用于浏览由用户或由与给定用户相关联的一个或多个伙伴保存的内容项目的集合的系统，方法和用户界面。 本发明的方法包括保存由用户指定的一个或多个内容项和一个或多个关联关键字。 生成一个界面，显示一个或多个保存的内容项目以及一个或多个关联关键字，以及与给定用户相关联的一个或多个伙伴。 接收给定关键字的选择的用户指示或用户对给定好友的选择。 一个或多个显示的内容项目根据所选择的关键字，好友或所选关键词和伙伴的组合进行过滤。

公开(公告)号：US08108374B2

公开(公告)日：2012-01-31

申请号：US12211307

申请日：2008-09-16

Applicant: Ruofei Zhang ,  Jianchang Mao

Inventor： Ruofei Zhang ,  Jianchang Mao

IPC: G06F17/30

CPC classification number: G06F17/30864 ,  G06Q10/06 ,  G06Q30/02

Abstract: Disclosed are apparatus and methods for facilitating the ranking of web objects. The method includes automatically adjusting a plurality of weight values for a plurality of parameters for inputting into a ranking engine that is adapted to rank a plurality of web objects based on such weight values and their corresponding parameters. The adjusted weight values are provided to the ranking engine so as to generate a ranked set of web objects based on such adjusted weight values and their corresponding parameters, as well as a particular query. A relevance metric (e.g., that quantifies or qualifies how relevant the generated ranked set of web objects are for the particular query) is determined. The method includes automatically repeating the operations of adjusting the weight values, providing the adjusted weight values to the ranking engine, and determining a relevance metric until the relevance metric reaches an optimized level, which corresponds to an optimized set of weight values. The repeated operations utilize one or more sets of weight values including at least one set that results in a worst relevance metric value, as compared to a previous set of weight values, according to a certain probability in order to escape local optimal solution to reach the global optimal solution.

Abstract translation: 公开了用于促进web对象的排名的装置和方法。 该方法包括自动调整用于多个参数的多个权重值，用于输入适应于基于这些权重值及其对应参数对多个网页对象排序的排名引擎。 调整的权重值被提供给排名引擎，以便基于这种调整的权重值及其对应的参数以及特定的查询来生成排序的web对象集合。 确定相关性度量（例如，量化或限定生成的排名的web对象集合对于特定查询的相关性）。 该方法包括自动重复调整权重值的操作，向排序引擎提供经调整的权重值，以及确定相关性度量，直到相关性度量达到对应于优化的权重值集合的优化级别。 重复操作利用一组或多组权重值，包括至少一组，与根据某种概率的先前的权重值组相比导致最差的相关度度值，以逃避局部最优解以达到 全局最优解。

公开(公告)号：US07685209B1

公开(公告)日：2010-03-23

申请号：US11149323

申请日：2005-06-08

Applicant: Kenneth Norton ,  Chung-Man Tam ,  Jianchang Mao ,  Zhichen Xu ,  Adrienne Bassett ,  Ashley Hall ,  Nathan Arnold

Inventor： Kenneth Norton ,  Chung-Man Tam ,  Jianchang Mao ,  Zhichen Xu ,  Adrienne Bassett ,  Ashley Hall ,  Nathan Arnold

IPC: G06F7/00 ,  G06F17/30

CPC classification number: G06F17/30997

Abstract: An annotation method for annotating content includes displaying a set of suggested keywords on an editing interface page configured to receive one or more annotations for the content. A request is received via the editing interface page to annotate the content with at least one keyword from the set of suggested keywords. Association information is generated that associates the at least one keyword with the content.

Abstract translation: 用于注释内容的注释方法包括在被配置为接收内容的一个或多个注释的编辑界面页面上显示一组建议的关键字。 通过编辑界面页面接收到一个请求，以从该组建议的关键字中的至少一个关键字注释内容。 生成将至少一个关键字与内容相关联的关联信息。

公开(公告)号：US07685084B2

公开(公告)日：2010-03-23

申请号：US11673355

申请日：2007-02-09

Applicant: Jacob Sisk ,  Heidi Eldenburg Bramlet ,  Daniel C. Fain ,  Jianchang Mao ,  Charity A. Rieck

Inventor： Jacob Sisk ,  Heidi Eldenburg Bramlet ,  Daniel C. Fain ,  Jianchang Mao ,  Charity A. Rieck

IPC: G06F17/00

CPC classification number: G06F17/30864

Abstract: Various embodiments are directed to a system and method providing associative matching of terms. Candidate terms are selected for building one or more associative matching models from one or more selected candidate sources. Associativity is defined to give editors the ability to label sample associative term pairs from the one or more candidate sources. The editors label sample candidate term pairs as being related. Features are determined that can differentiate associative from non-associative pairs. The selected features are used to build a model. The model is applied to determine whether a received query-candidate pair are associative.

Abstract translation: 各种实施例涉及提供术语的关联匹配的系统和方法。 从一个或多个选择的候选来源中选择候选词来构建一个或多个关联匹配模型。 关联性被定义为使编辑者能够从一个或多个候选来源标记样本关联词对。 编辑者将样品候选词对标记为相关。 确定可以区分缔合和非关联对的特征。 所选功能用于构建模型。 应用该模型来确定所接收的查询候选对是否是关联的。

公开(公告)号：US07548908B2

公开(公告)日：2009-06-16

申请号：US11475427

申请日：2006-06-26

Applicant: Yun Fu ,  Zhichen Xu ,  Jianchang Mao

Inventor： Yun Fu ,  Zhichen Xu ,  Jianchang Mao

IPC: G06F7/00

CPC classification number: G06F17/30864 ,  G06F17/30902 ,  Y10S707/99933

Abstract: Methods, systems, and machine-readable media are disclosed for searching a corpus of information by utilizing a Bloom filter for caching query results. According to one aspect of the present invention, a method of caching information from a corpus of information can include populating one or more Bloom filters with a plurality of bits representative of information in the corpus of information. A search request can be received identifying requested information from the corpus of information. One or more bits in the filter(s) associated with the requested information can be checked and the requested information can be retrieved from the corpus of information based on results of said checking. Furthermore, the filter(s) can be used to determine which information to make available to a particular user in a system where certain information is associated with or access is limited to certain users or groups of users.

Abstract translation: 公开了用于通过利用布隆过滤器来搜索查询结果来搜索信息语料库的方法，系统和机器可读介质。 根据本发明的一个方面，一种从信息语料库缓存信息的方法可以包括用表示信息语料库中的信息的多个比特填充一个或多个布隆过滤器。 可以从信息语料库中识别搜索请求信息。 可以检查与请求的信息相关联的过滤器中的一个或多个位，并且可以基于所述检查的结果从信息语料库检索所请求的信息。 此外，过滤器可以用于确定哪些信息可用于特定用户在某些信息相关联或访问受限于特定用户或用户组的系统中。

公开(公告)号：US20060294086A1

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

申请号：US11498706

申请日：2006-08-02

Applicant: Daniel Rose ,  Jianchang Mao ,  Chad Walters

Inventor： Daniel Rose ,  Jianchang Mao ,  Chad Walters

IPC: G06F17/30

CPC classification number: G06F17/3053 ,  G06F17/30616 ,  G06F17/30867 ,  Y10S707/99932 ,  Y10S707/99933

Abstract: The present invention is directed to systems and methods for searching content items indexed in real-time. The method according to one embodiment comprises generating an index of word location pairs that identifies the location of one or more words in one or more content items available on a network. One or more additional content items are received over the network. The received content items are stored in a stream search queue, the stream search queue operative to allow for a stream search of the one or more additional content items.