公开(公告)号：US20070192297A1

公开(公告)日：2007-08-16

申请号：US11558029

申请日：2006-11-09

申请人： Kaushik Shriraghav ,  Venkatesh Ganti ,  Xin Dong

发明人： Kaushik Shriraghav ,  Venkatesh Ganti ,  Xin Dong

IPC分类号： G06F17/30

CPC分类号： G06F16/24535 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99934

摘要： The subject disclosure pertains to efficient computation of the difference between queries by exploiting commonality between them. A minimal difference query (MDQ) is generated that roughly corresponds to removal of as many joins as possible while still accurately representing the query difference. The minimal difference can be employed to further substantially the scope of view matching where a query is not wholly subsumed by a view. Additionally, the minimal difference query can be employed as an analytical tool in various contexts.

摘要翻译： 本发明涉及通过利用它们之间的共性来有效地计算查询之间的差异。 生成最小差异查询（MDQ），大致对应于删除尽可能多的连接，同时仍准确地表示查询差异。 可以使用最小差异来进一步实质地观察视图匹配的范围，其中查询未被完全包含在视图中。 另外，最小差异查询可以用作各种上下文中的分析工具。

公开(公告)号：US20070198469A1

公开(公告)日：2007-08-23

申请号：US11564981

申请日：2006-11-30

申请人： Kaushik Shriraghav ,  Venkatesh Ganti ,  Xin Dong

发明人： Kaushik Shriraghav ,  Venkatesh Ganti ,  Xin Dong

IPC分类号： G06F17/30

CPC分类号： G06F17/30451 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99934

摘要： The subject disclosure pertains to efficient computation of the difference between queries by exploiting commonality between them. A minimal difference query (MDQ) is generated that roughly corresponds to removal of as many joins as possible while still accurately representing the query difference. The minimal difference can be employed to further substantially the scope of view matching where a query is not wholly subsumed by a view. Additionally, the minimal difference query can be employed as an analytical tool in various contexts.

公开(公告)号：US20070192282A1

公开(公告)日：2007-08-16

申请号：US11352628

申请日：2006-02-13

申请人： Kaushik Shriraghav ,  Venkatesh Ganti ,  Xin Dong

发明人： Kaushik Shriraghav ,  Venkatesh Ganti ,  Xin Dong

IPC分类号： G06F17/30

CPC分类号： G06F17/30451 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99934

摘要： The subject disclosure pertains to efficient computation of the difference between queries by exploiting commonality between them. A minimal difference query (MDQ) is generated that roughly corresponds to removal of as many joins as possible while still accurately representing the query difference. The minimal difference can be employed to further substantially the scope of view matching where a query is not wholly subsumed by a view. Additionally, the minimal difference query can be employed as an analytical tool in various contexts.

公开(公告)号：US07558780B2

公开(公告)日：2009-07-07

申请号：US11564981

申请日：2006-11-30

申请人： Kaushik Shriraghav ,  Venkatesh Ganti ,  Xin Dong

发明人： Kaushik Shriraghav ,  Venkatesh Ganti ,  Xin Dong

IPC分类号： G06F17/00 ,  G06F17/30

CPC分类号： G06F17/30451 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99934

摘要： The subject disclosure pertains to efficient computation of the difference between queries by exploiting commonality between them. A minimal difference query (MDQ) is generated that roughly corresponds to removal of as many joins as possible while still accurately representing the query difference. The minimal difference can be employed to further substantially the scope of view matching where a query is not wholly subsumed by a view. Additionally, the minimal difference query can be employed as an analytical tool in various contexts.

摘要翻译： 本发明涉及通过利用它们之间的共性来有效地计算查询之间的差异。 生成最小差异查询（MDQ），大致对应于删除尽可能多的连接，同时仍准确地表示查询差异。 可以使用最小差异来进一步实质地观察视图匹配的范围，其中查询未被完全包含在视图中。 另外，最小差异查询可以用作各种上下文中的分析工具。

公开(公告)号：US07251646B1

公开(公告)日：2007-07-31

申请号：US11352628

申请日：2006-02-13

申请人： Kaushik Shriraghav ,  Venkatesh Ganti ,  Xin Dong

发明人： Kaushik Shriraghav ,  Venkatesh Ganti ,  Xin Dong

IPC分类号： G06F17/30

CPC分类号： G06F17/30451 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99934

摘要： The subject disclosure pertains to efficient computation of the difference between queries by exploiting commonality between them. A minimal difference query (MDQ) is generated that roughly corresponds to removal of as many joins as possible while still accurately representing the query difference. The minimal difference can be employed to further substantially the scope of view matching where a query is not wholly subsumed by a view. Additionally, the minimal difference query can be employed as an analytical tool in various contexts.

摘要翻译： 本发明涉及通过利用它们之间的共性来有效地计算查询之间的差异。 生成最小差异查询（MDQ），大致对应于删除尽可能多的连接，同时仍准确地表示查询差异。 可以使用最小差异来进一步实质地观察视图匹配的范围，其中查询未被完全包含在视图中。 另外，最小差异查询可以用作各种上下文中的分析工具。

公开(公告)号：US07310698B2

公开(公告)日：2007-12-18

申请号：US11304099

申请日：2005-12-14

申请人： Xin Dong ,  Chuanen Jin ,  Qingyun Cheng ,  Gongcheng Li

发明人： Xin Dong ,  Chuanen Jin ,  Qingyun Cheng ,  Gongcheng Li

IPC分类号： G06F12/00

CPC分类号： G06F12/0623

摘要： Techniques for extending memory addressing with more accessing range are disclosed. According to one aspect of the techniques, an apparatus for extending addressing space comprises a plurality of extended memories, each being allocated an unique identifier, a direct addressing memory reserving a data cell as a public identifier cell for receiving the identifier of each of the extended memories to be accessed, a decision unit determining that which one of the extended memories is to be accessed by comparing an identifier received by the public identifier cell with the identifier of each of the extended memories, and a mapping unit mapping one of the extended memories determined by the decision unit to be accessed onto the direct addressing memory so that the one of the extended memories can be indirectly accessed by directly accessing the direct addressing memory.

摘要翻译： 公开了用于扩展具有更多访问范围的存储器寻址的技术。 根据该技术的一个方面，用于扩展寻址空间的装置包括多个扩展存储器，每个扩展存储器被分配唯一的标识符，将数据单元保留为公共标识符单元的直接寻址存储器，用于接收每个扩展的标识符的标识符 要访问的存储器，决定单元，通过将由公共标识符单元接收到的标识符与每个扩展存储器的标识符进行比较，确定要访问哪个扩展存储器;以及映射单元，映射扩展存储器之一 由决定单元确定要被访问到直接寻址存储器，使得可以通过直接访问直接寻址存储器间接地访问扩展存储器之一。

公开(公告)号：US07131585B2

公开(公告)日：2006-11-07

申请号：US11014195

申请日：2004-12-15

申请人： Justin Gyi ,  Xin Dong ,  Lawrence J. Kaylor

发明人： Justin Gyi ,  Xin Dong ,  Lawrence J. Kaylor

IPC分类号： G06F19/00 ,  G06Q30/00 ,  G06Q90/00

CPC分类号： G06Q10/087 ,  G06Q20/203

摘要： An inventory management system tracks consumables used in creation of secure documents through an identification document issuance process. The system assigns states to card and non-card consumables, and these states are used to track consumables from the vendor's inventory to the issuer's inventory. The system includes functions for managing inventory, shipping and receiving, use management, inventory auditing and secure material destruction. Electronic packing lists are transmitted between vendor and issuer systems to verify shipments. Embedded identification numbers, carried in machine readable codes on consumables, are used to track consumables through the document creation and issuing process.

摘要翻译： 库存管理系统通过识别文档发布过程跟踪用于创建安全文档的耗材。 系统将状态分配给卡和非卡消耗品，这些状态用于跟踪从供应商的库存到发行人的库存的耗材。 该系统包括管理库存，运输和接收，使用管理，库存审核和安全材料销毁的功能。 供应商和发行者系统之间传送电子装箱单，以验证装运。 通过耗材上的机器可读代码携带的嵌入式识别号码用于通过文档创建和发布过程跟踪耗材。

公开(公告)号：US09348891B2

公开(公告)日：2016-05-24

申请号：US13311034

申请日：2011-12-05

申请人： Divesh Srivastava ,  Xin Dong ,  Xuan Liu

发明人： Divesh Srivastava ,  Xin Dong ,  Xuan Liu

IPC分类号： G06F17/30

CPC分类号： G06F17/30634

摘要： An online data fusion system receives a query, probes a first source for an answer to the query, returns the answer from the first source, refreshes the answer while probing an additional source, and applies fusion techniques on data associated with an answer that is retrieved from the additional source. For each retrieved answer, the online data fusion system computes the probability that the answer is correct and stops retrieving data for the answer after gaining enough confidence that data retrieved from the unprocessed sources are unlikely to change the answer. The online data fusion system returns correct answers and terminates probing additional sources in an expeditious manner without sacrificing the quality of the answers.

摘要翻译： 在线数据融合系统接收查询，探索第一个来源以获得查询的答案，从第一个源返回答案，在探索附加的源时刷新答案，并对与检索到的答案相关联的数据应用融合技术 从额外的来源。 对于每个检索到的答案，在线数据融合系统计算出答案正确的概率，并且在获得足够的信心从而从未处理的源中检索的数据不太可能改变答案之后，停止检索答案数据。 在线数据融合系统返回正确的答案，并以迅速的方式终止探测附加来源，而不牺牲答案的质量。

公开(公告)号：US08762260B2

公开(公告)日：2014-06-24

申请号：US13585218

申请日：2012-08-14

申请人： Xiao Hong ,  Xiaolan Song ,  Xin Dong ,  Huchen Fei ,  Lihua Wang

发明人： Xiao Hong ,  Xiaolan Song ,  Xin Dong ,  Huchen Fei ,  Lihua Wang

IPC分类号： G06Q40/02

CPC分类号： G06Q40/025 ,  G06Q40/00 ,  G06Q40/02

摘要： The invention provides systems and methods relating to generating a unified determination based on subdetermination, and in particular, generating a unified score based on respective scores. For example, the invention provides a method for generating a unified determination based on subdeterminations, the method including generating a first subdetermination based on first criteria; generating a second subdetermination based on second criteria; and generating a unified determination based on the first subdetermination and the second subdetermination. The generation of the unified determination includes (a) assigning, using iterative processing, an assigned weighting respectively to the first determination and second determination; (b) determining if the assigned weighting satisfies at least one constraint; (c) comparing the assigned weighting to an optimized weighting, which was previously determined, to determine if the assigned weighting is improved over the optimized weighting; and (d) if the assigned weighting is improved, then assigning the assigned weighting to be the optimized weighting.

摘要翻译： 本发明提供了关于基于子确定生成统一确定的系统和方法，并且特别地，基于各个分数生成统一的分数。 例如，本发明提供一种用于基于子确定来生成统一确定的方法，所述方法包括基于第一准则生成第一子确定; 基于第二准则生成第二子确定; 并且基于第一子确定和第二子确定生成统一的确定。 统一确定的生成包括（a）分别使用迭代处理分配的加权分配给第一确定和第二确定; （b）确定所分配的加权是否满足至少一个约束; （c）将所分配的权重与先前确定的优化加权进行比较，以确定所分配的权重是否比所述优化加权得到改善; 和（d）如果分配的权重得到改善，则将所分配的加权分配为优化加权。

公开(公告)号：US20120036263A1

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

申请号：US13277776

申请日：2011-10-20

申请人： John William Madden ,  Pavel Tchourliaev ,  Xin Dong

发明人： John William Madden ,  Pavel Tchourliaev ,  Xin Dong

IPC分类号： G06F15/173

CPC分类号： G06F21/6218 ,  G06F16/95 ,  G06F2221/2149

摘要： A system and a method are provided for controlling access to web pages. It includes receiving an input to access a web page, and then determining if the Web page is on a work list or a recreation list. The work list includes one or more web pages related to work and the recreation list includes one or more web pages related to recreation. If the web page is not on either list, then a request is issued for a categorization of the web page. Upon receiving the categorization, the web page is stored in the work list or the recreation list, and access is provided to the web page.

摘要翻译： 提供了一种用于控制对网页的访问的系统和方法。 它包括接收访问网页的输入，然后确定网页是否在工作列表或娱乐列表中。 工作列表包括与工作相关的一个或多个网页，娱乐列表包括与娱乐相关的一个或多个网页。 如果网页不在任一列表中，则会发出一个网页分类请求。 在接收到分类后，网页被存储在工作列表或娱乐列表中，并且访问被提供给网页。