会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 12. 发明申请
    • Exploratory Search Technique
    • 探索性搜索技术
    • US20080319975A1
    • 2008-12-25
    • US11767142
    • 2007-06-22
    • Daniel Scott MorrisMeredith June MorrisGina Danielle VenoliaRyen William WhiteEric HorvitzSteven M. Drucker
    • Daniel Scott MorrisMeredith June MorrisGina Danielle VenoliaRyen William WhiteEric HorvitzSteven M. Drucker
    • G06F17/30
    • G06F3/048G06F16/951G06F2203/04803
    • A technique for the creation of synthesized results from multi-query searches to provide more relevant information to the user in a more useful format and to discard or reduce in relevancy information that is not so useful. It allows a user to define the boundaries of the exploratory search before it starts or retroactively define which queries belong to the search. It can imply which queries belong to the search based on parameters in the queries or results. It also provides mechanisms for supporting exploratory searches including: saving/restoring search context; search-specific query history; a “keepers” bin for storing useful results; elimination of redundant results; re-ranking of common search results; integration of searching with navigation; pivoting on search results; collaboration among multiple searchers; user-generated content; generation of hypotheses; re-executing queries and executing standing queries; multi-monitor searching and automatic preparation of search summaries. User interfaces for conducting multi-query searches are also provided.
    • 一种用于从多查询搜索创建合成结果的技术,以更有用的格式向用户提供更多的相关信息,并丢弃或减少不那么有用的相关性信息。 它允许用户在开始之前定义探索性搜索的边界,或者追溯地定义哪些查询属于搜索。 它可以暗示哪些查询属于基于查询或结果中的参数的搜索。 它还提供支持探索性搜索的机制,包括:保存/恢复搜索环境; 搜索专用查询记录; 用于存储有用结果的“管理员”仓; 消除冗余结果; 共同搜索结果重新排序; 搜索与导航的整合; 在搜索结果上转动; 多个搜索者之间的协作; 用户生成内容; 一代假设; 重新执行查询并执行常规查询; 多监视搜索和自动准备搜索摘要。 还提供了用于进行多查询搜索的用户界面。
    • 15. 发明授权
    • Relationship view
    • 关系视图
    • US07120619B2
    • 2006-10-10
    • US10420414
    • 2003-04-22
    • Steven M. DruckerCurtis G. WongAsta L. Glatzer
    • Steven M. DruckerCurtis G. WongAsta L. Glatzer
    • G06F15/00
    • G06F17/3002G06F17/30038G06F17/30058
    • The present invention provides a unique method and user interface that facilitates accessing and browsing objects in which a user begins with a center object (e.g., one or a few focal objects) displayed on a screen and related objects are populated on the screen as well. The related objects can be further organized into clusters whereby each cluster or grouping of objects expands on a particular attribute of the center object. The attributes correspond to metadata. Thus, the objects are populated based upon the metadata of the center object. According to one aspect, the user can access one or more specific objects having a plurality of attributes and then relax at least one of the attributes to see what other objects share at least one attribute with the center object. According to another aspect, the object having the closest match to a search request can be centrally displayed with other close matches arranged by their respective metadata.
    • 本发明提供了一种独特的方法和用户界面,其便于访问和浏览用户以屏幕上显示的中心对象(例如,一个或几个焦点对象)开始的对象,并且相关对象也被填充在屏幕上。 可以将相关对象进一步组织成群集,由此每个群集或对象组在中心对象的特定属性上展开。 属性对应于元数据。 因此,基于中心对象的元数据填充对象。 根据一个方面,用户可以访问具有多个属性的一个或多个特定对象,然后放松至少一个属性,以查看哪些其他对象与中心对象共享至少一个属性。 根据另一方面,具有与搜索请求最匹配的对象可以通过其各自的元数据排列的其他紧密匹配集中显示。
    • 18. 发明授权
    • Compression of graphic data normals
    • 压缩图形数据法线
    • US5736987A
    • 1998-04-07
    • US618194
    • 1996-03-19
    • Steven M. DruckerDonald P. Mitchell
    • Steven M. DruckerDonald P. Mitchell
    • G06T15/00
    • G06T15/00
    • Geometric data for a three-dimensional surface are compressed in regard to the data representing the continuity between triangles in a mesh that represents the three-dimensional surface. The geometric data include information defining the vertices of the triangles comprising the mesh, an indication of the triangle faces, and corner normals to each of the vertices shared by triangles having a common vertex, which indicates the continuity or discontinuity between adjacent triangles of the surface. Vertex rotation continuity (VRC) data are determined for each vertex shared by adjacent triangles, indicating whether the transition between the adjacent triangles is continuous or discontinuous. Further, a dihedral angle between each pair of adjacent triangles is determined and associated with the VRC bit. The VRC data are sorted by the associated dihedral angles, enabling an optimal dihedral angle to be selected. The optimal dihedral angle is chosen so as to minimize the number of errors in predicting the nature of the transition between adjacent triangles based on the dihedral angle between the adjacent triangle. Next, exception data are generated by comparing the dihedral angle for each pair of adjacent triangles to the optimal dihedral angle to predict a VRC bit, and noting any errors within the exception data. The exception data are encoded to further reduce the size of the compressed data used to represent the three-dimensional surface. The compressed data require less space for storage and are more efficiently transmitted to a remote site.
    • 关于代表表示三维表面的网格中的三角形之间的连续性的数据,三维表面的几何数据被压缩。 几何数据包括定义包括网格的三角形的顶点的信息,三角形面的指示,以及由具有共同顶点的三角形共享的每个顶点的角法线,其指示表面的相邻三角形之间的连续性或不连续性 。 针对由相邻三角形共享的每个顶点确定顶点旋转连续性(VRC)数据,指示相邻三角形之间的过渡是连续的还是不连续的。 此外,确定每对相邻三角形之间的二面角并与VRC位相关联。 VRC数据按照相关的二面角进行排序,从而能够选择最佳的二面角。 选择最佳二面角,以便基于相邻三角形之间的二面角来最小化预测相邻三角形之间的过渡的性质的误差数。 接下来,通过将每对相邻三角形的二面角与最佳二面角进行比较来预测VRC位,并注意异常数据内的任何错误,产生异常数据。 编码异常数据以进一步减小用于表示三维表面的压缩数据的大小。 压缩数据需要更少的存储空间,并且更有效地传输到远程站点。