SYSTEMS AND METHODS FOR DETERMINING A TAG MATCH RATIO
    151.
    发明申请
    SYSTEMS AND METHODS FOR DETERMINING A TAG MATCH RATIO 有权
    用于确定标签匹配比的系统和方法

    公开(公告)号:US20100030766A1

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

    申请号:US12183217

    申请日:2008-07-31

    CPC classification number: G06F17/30616 G06F17/30864 G06F17/30917

    Abstract: The present invention is directed towards systems and methods for determining a tag match ratio. The method according to one embodiment of the present invention comprises selecting a content item, identifying one or more tags that are associated with the content item and determining a weight for each of the one or more tags associated with the content item. The method further comprises extracting one or more keywords from the content item. A tag match ratio for the one or more tags associated with the content item is then calculated and stored.

    Abstract translation: 本发明涉及用于确定标签匹配率的系统和方法。 根据本发明的一个实施例的方法包括选择内容项目,识别与内容项目相关联的一个或多个标签,并确定与内容项目相关联的一个或多个标签中的每一个的权重。 该方法还包括从内容项中提取一个或多个关键字。 然后计算并存储与内容项目相关联的一个或多个标签的标签匹配比率。

    IDENTIFYING REGIONAL SENSITIVE QUERIES IN WEB SEARCH
    152.
    发明申请
    IDENTIFYING REGIONAL SENSITIVE QUERIES IN WEB SEARCH 有权
    识别网络搜索中的区域敏感性查询

    公开(公告)号:US20090307198A1

    公开(公告)日:2009-12-10

    申请号:US12136279

    申请日:2008-06-10

    CPC classification number: G06F17/3087

    Abstract: A system for determining the intent of query that includes a search engine that receives a first search query, a query/click log module configured to store log data associated with the first search query; and a computational module that generates metric values associated with the first search query based on the log data and that determines that the first search query is one of a regional specific query or a global query based on the metric values, where the metric values reflect a likelihood of local intent of the first search query, and where the search engine provides search results selected in part based on the metric values.

    Abstract translation: 一种用于确定查询意图的系统,包括接收第一搜索查询的搜索引擎,被配置为存储与第一搜索查询相关联的日志数据的查询/点击日志模块; 以及计算模块,其基于所述日志数据生成与所述第一搜索查询相关联的度量值,并且基于所述度量值确定所述第一搜索查询是区域特定查询或全局查询之一,其中所述度量值反映 第一搜索查询的本地意图的可能性,以及搜索引擎提供基于度量值部分地选择的搜索结果的位置。

    Query rewriting with spell correction suggestions using a generated set of query features
    153.
    发明授权
    Query rewriting with spell correction suggestions using a generated set of query features 有权
    使用生成的查询功能集查询重写拼写修正建议

    公开(公告)号:US07630978B2

    公开(公告)日:2009-12-08

    申请号:US11639492

    申请日:2006-12-14

    CPC classification number: G06F17/30672 Y10S707/99933 Y10S707/99935

    Abstract: Techniques for rewriting queries submitted to a query engine are provided. A query is submitted by a user and sent to a search mechanism. Based on the query, one or more query suggestions are generated. Features are generated based on the query and the query suggestions. Those features are input to a trained machine learning mechanism that generates a rewrite score. The rewrite score signifies a confidence score that indicates how confident the search mechanism is that the user intended to submit the original query. If the rewrite score is below a certain threshold, then the original query is rewritten to a second query. Results of executing the original query may be sent to the user along with a reference to the second query. Additionally or alternatively, results of executing the second query are sent to the user.

    Abstract translation: 提供了重写提交到查询引擎的查询的技术。 查询由用户提交并发送到搜索机制。 基于该查询,生成一个或多个查询建议。 功能根据查询和查询建议生成。 这些功能被输入到产生重写分数的训练有素的机器学习机制。 重写分数表示置信度分数,表示用户希望提交原始查询的搜索机制的信心。 如果重写分数低于某个阈值,则原始查询被重写为第二个查询。 执行原始查询的结果可以与对第二个查询的引用一起发送给用户。 另外或替代地,执行第二查询的结果被发送给用户。

    Crossbar diode-switched magnetoresistive random access memory system
    154.
    发明申请
    Crossbar diode-switched magnetoresistive random access memory system 有权
    交叉二极管开关磁阻随机存取存储器系统

    公开(公告)号:US20090237987A1

    公开(公告)日:2009-09-24

    申请号:US12079036

    申请日:2008-03-24

    CPC classification number: H01L27/224 G11C11/15 G11C11/1675 H01L43/08

    Abstract: A magnetic memory or MRAM memory system comprising an M×N crossbar array of MRAM cells. Each memory cell stores binary data bits with switchable magnetoresistive tunnel junctions (MJT) where the electrical conductance changes as the magnetic moment of one electrode (the storage layer) in the MJT switches direction. The switching of the magnetic moment is assisted by a phase transition interlayer that transitions from antiferromagnetic to ferromagnetic at a well defined, above ambient temperature.

    Abstract translation: 一种磁存储器或MRAM存储器系统,其包括MRAM单元的MxN交叉列阵列。 每个存储单元存储具有可切换磁阻隧道结(MJT)的二进制数据位,其中电导通过MJT开关方向上的一个电极(存储层)的磁矩而变化。 磁矩的切换由相位转变中间层辅助,相位转变中间层在高于环境温度的情况下,从反铁磁转变为铁磁性。

    Dynamic deep depletion field effect transistor
    155.
    发明授权
    Dynamic deep depletion field effect transistor 有权
    动态深度耗尽场效应晶体管

    公开(公告)号:US07462908B2

    公开(公告)日:2008-12-09

    申请号:US11181292

    申请日:2005-07-14

    Applicant: Igor Bol Xin Li

    Inventor: Igor Bol Xin Li

    CPC classification number: H01L29/66666 H01L29/7827 H01L29/7828

    Abstract: A vertical conduction trench FET has a plurality of trenches containing conductive polysilicon gates. The mesas between the trenches have a source diffusion region connected to a common source electrode. The trenches are spaced so that the depletion regions induced by the trench gate will overlap to pinch off conduction through the mesa to turn off the device. The gate potential is pulsed. The polysilicon in the trenches may be separated into two insulated portions. The pulses may be applied simultaneously or sequentially to the polysilicon gates.

    Abstract translation: 垂直导电沟槽FET具有包含导电多晶硅栅极的多个沟槽。 沟槽之间的台面具有连接到公共源电极的源极扩散区域。 沟槽间隔开,使得由沟槽栅极引起的耗尽区域将重叠以夹住通过台面的传导以关闭器件。 栅电位为脉冲。 沟槽中的多晶硅可以分成两个绝缘部分。 脉冲可以同时或顺序施加到多晶硅栅极。

    Query rewriting with spell correction suggestions
    156.
    发明申请
    Query rewriting with spell correction suggestions 有权
    使用拼写修正建议查询重写

    公开(公告)号:US20080147637A1

    公开(公告)日:2008-06-19

    申请号:US11639492

    申请日:2006-12-14

    CPC classification number: G06F17/30672 Y10S707/99933 Y10S707/99935

    Abstract: Techniques for rewriting queries submitted to a query engine are provided. A query is submitted by a user and sent to a search mechanism. Based on the query, one or more query suggestions are generated. Features are generated based on the query and the query suggestions. Those features are input to a trained machine learning mechanism that generates a rewrite score. The rewrite score signifies a confidence score that indicates how confident the search mechanism is that the user intended to submit the original query. If the rewrite score is below a certain threshold, then the original query is rewritten to a second query. Results of executing the original query may be sent to the user along with a reference to the second query. Additionally or alternatively, results of executing the second query are sent to the user.

    Abstract translation: 提供了重写提交到查询引擎的查询的技术。 查询由用户提交并发送到搜索机制。 基于该查询,生成一个或多个查询建议。 功能根据查询和查询建议生成。 这些功能被输入到产生重写分数的训练有素的机器学习机制。 重写分数表示置信度分数,表示用户希望提交原始查询的搜索机制的信心。 如果重写分数低于某个阈值,则原始查询被重写为第二个查询。 执行原始查询的结果可以与对第二个查询的引用一起发送给用户。 另外或替代地,执行第二查询的结果被发送给用户。

    Defining Statistical Sensitivity for Timing Optimization of Logic Circuits with Large-Scale Process and Environmental Variations
    157.
    发明申请
    Defining Statistical Sensitivity for Timing Optimization of Logic Circuits with Large-Scale Process and Environmental Variations 有权
    定义具有大规模过程和环境变化的逻辑电路的时序优化的统计灵敏度

    公开(公告)号:US20080072198A1

    公开(公告)日:2008-03-20

    申请号:US11629445

    申请日:2005-06-11

    CPC classification number: G06F17/5031 G06F2217/10

    Abstract: The large-scale process and environmental variations for today's nano-scale ICs are requiring statistical approaches for timing analysis and optimization (1). Significant research has been recently focused on developing new statistical timing analysis algorithms (2), but often without consideration for how one should interpret the statistical timing results for optimization. The invention provides a sensitivity-based metric (2) to assess the criticality of each path and/or arc in the statistical timing graph (4). The statistical sensitivities for both paths and arcs are defined. It is shown that path sensitivity is equivalent to the probability that a path is critical, and arc sensitivity is equivalent to the probability that an arc sits on the critical path. An efficient algorithm with incremental analysis capability (2) is described for fast sensitivity computation that has a linear runtime complexity in circuit size. The efficacy of the proposed sensitivity analysis is demonstrated on both standard benchmark circuits and large industry examples.

    Abstract translation: 目前的纳米尺度IC的大规模工艺和环境变化需要用于时序分析和优化的统计方法(1)。 最近重点研究重点是开发新的统计时序分析算法(2),但往往不考虑如何解释统计时序结果进行优化。 本发明提供了一种基于灵敏度的度量(2)来评估统计时序图(4)中每个路径和/或弧的关键性。 定义了路径和弧线的统计灵敏度。 显示路径灵敏度等于路径关键的概率,弧敏感度等于弧位于关键路径上的概率。 描述了具有增量分析能力的有效算法(2),用于快速灵敏度计算,其电路尺寸具有线性运行时间复杂度。 提出的灵敏度分析的功效在标准基准电路和大型行业实例中得到证明。

    Techniques for navigational query identification
    158.
    发明申请
    Techniques for navigational query identification 有权
    导航查询识别技术

    公开(公告)号:US20080059508A1

    公开(公告)日:2008-03-06

    申请号:US11514076

    申请日:2006-08-30

    CPC classification number: G06K9/623 G06F17/30707 G06F17/30864 G06K9/6278

    Abstract: To accurately classify a query as navigational, thousands of available features are explored, extracted from major commercial search engine results, user Web search click data, query log, and the whole Web's relational content. To obtain the most useful features for navigational query identification, a three level system is used which integrates feature generation, feature integration, and feature selection in a pipeline. Because feature selection plays a key role in classification methodologies, the best feature selection method is coupled with the best classification approach to achieve the best performance for identifying navigational queries. According to one embodiment, linear Support Vector Machine (SVM) is used to rank features and the top ranked features are fed into a Stochastic Gradient Boosting Tree (SGBT) classification method for identifying whether or not a particular query is a navigational query.

    Abstract translation: 为了将查询精确地分类为导航,从主要商业搜索引擎结果,用户Web搜索点击数据,查询日志和整个Web的关系内容中提取出数千种可用功能。 为了获得导航查询识别最有用的功能,使用了一个三级系统,将特征生成,特征集成和特征选择集成在一条流水线中。 因为特征选择在分类方法中起着关键作用,因此最好的特征选择方法与最佳分类方法相结合,以实现识别导航查询的最佳性能。 根据一个实施例,使用线性支持向量机(SVM)对特征进行排序,并且将顶级特征馈送到用于识别特定查询是否是导航查询的随机渐变增强树(SGBT)分类方法中。

    Spectacles set with decorative frame
    160.
    发明申请
    Spectacles set with decorative frame 审中-公开
    眼镜设置与装饰框架

    公开(公告)号:US20060256281A1

    公开(公告)日:2006-11-16

    申请号:US11488213

    申请日:2006-07-17

    Applicant: Xin Li

    Inventor: Xin Li

    CPC classification number: G02C1/08 G02C1/00 G02C1/02 G02C1/04 G02C1/10 G02C2200/08

    Abstract: A spectacles set includes a lens frame, a decorative frame and a lens engaging arrangement. The lens frame includes two lenses and a lens retention arrangement spacedly supporting the two lens in position. The decorative frame includes two lens rims defining two lens areas respectively, a bridge extending between two inner sides of the lens rims, and two side extensions extending at two outer sides of the lens rims. The lens engaging arrangement is provided at a rear side of the decorative frame to detachably engaging with the lens frame at a position that when the lens retention arrangement is detachably mounted at the rear side of the decorative frame in a hidden manner, the two lenses are alignedly positioned at two lens areas respectively so as to keep an aesthetic appearance of the decorative frame with the two lenses.

    Abstract translation: 眼镜组包括透镜框架,装饰框架和透镜接合装置。 透镜框架包括两个透镜和将两个透镜间隔地支撑在适当位置的透镜保持装置。 装饰框架包括分别限定两个透镜区域的两个透镜边缘,在透镜边缘的两个内侧之间延伸的桥和在透镜边缘的两个外侧延伸的两个侧延伸部。 透镜接合装置设置在装饰框架的后侧,以在透镜保持装置以可隐藏的方式可拆卸地安装在装饰框架的后侧的位置处可拆卸地与透镜框架接合, 分别对准地定位在两个透镜区域处,以便与两个透镜保持装饰框架的美观外观。

Patent Agency Ranking