公开(公告)号：US07756772B1

公开(公告)日：2010-07-13

申请号：US10069234

申请日：2000-08-29

申请人： David Konopnicki ,  Lior Leiba ,  Oded Shmueli ,  Yehoshua Sagiv

发明人： David Konopnicki ,  Lior Leiba ,  Oded Shmueli ,  Yehoshua Sagiv

IPC分类号： G06Q30/00

CPC分类号： G06Q30/06 ,  G06Q30/0633 ,  G06Q40/025 ,  G06Q40/04 ,  G06Q50/188

摘要： A system, method and device for (semi-)automated e-commerce on the Internet, the WWW and other networks. Trading parties present intentions, made of more elementary components, which are used to express their willingness to engage in deals subject to constraints. Parts of intentions may be variable components. Some variable components may be associated with computational devices that transform them, optionally communicating via messages, into more specified components. This mechanism encodes business rules. By fitting intentions, contracts are formed. While fitting intentions, negotiations are carried out via the exchange of messages. Negotiations are automated by encoding users wishes as mathematical programs. Following the deal formation an optional deal improvement phase, in one-to-one mode or one-to-many mode, is carried out to improve the deal. The improvement phase may be based on a trading mechanselected from an available collection of such mechanisms including such mechanisms as constructed by users of the system.

摘要翻译： 用于互联网，WWW和其他网络上（半））自动电子商务的系统，方法和设备。 交易方提出了由更多基本组成部分组成的意图，这些意图用于表达自己愿意参与受限制的交易。 部分意图可能是可变组件。 一些可变组件可以与将它们（可选地通过消息通信）转换成更多指定组件的计算设备相关联。 这种机制编码业务规则。 通过拟订意图，形成合同。 在拟订意图的同时，通过交换信息进行谈判。 通过将用户的愿望编码为数学程序，可以自动进行谈判。 在交易形成之后，进行可选的交易改进阶段，以一对一模式或一对多模式进行，以改进交易。 改进阶段可以基于从这种机制的可用集合中选择的交易机制，包括由系统的用户构造的机制。

公开(公告)号：US07469249B2

公开(公告)日：2008-12-23

申请号：US10795534

申请日：2004-03-08

申请人： George Andrei Mihaila ,  Sriram Padmanabhan ,  Oded Shmueli

发明人： George Andrei Mihaila ,  Sriram Padmanabhan ,  Oded Shmueli

IPC分类号： G06F17/00

CPC分类号： G06F17/30932 ,  Y10S707/99931 ,  Y10S707/99943 ,  Y10S707/99945 ,  Y10S707/99953

摘要： Techniques are provided for automatically rewriting a relational-to-hierarchical mapping into one or more modified mappings. In this way, clients that prefer or require different portions of the mapping-defined data are supported. For example, in one aspect of the invention, a technique for modifying a relational-to-hierarchical mapping in accordance with at least one user query includes the following steps/operations. At least one query associated with a query language that supports a hierarchical data structure is obtained. Further, at least one relational-to-hierarchical mapping for use in translating data associated with a relational data structure into data associated with the hierarchical data structure is obtained. Then, the at least one relational-to-hierarchical mapping is modified based on the at least one query such that data specifically relevant to the at least one query may be generated in accordance with the modified relational-to-hierarchical mapping.

摘要翻译： 提供了用于将关系到分层映射自动重写成一个或多个修改的映射的技术。 以这种方式，支持偏好或需要映射定义数据的不同部分的客户端。 例如，在本发明的一个方面，根据至少一个用户查询修改关系到分层映射的技术包括以下步骤/操作。 获得与支持分层数据结构的查询语言相关联的至少一个查询。 此外，获得用于将与关系数据结构相关联的数据转换成与分层数据结构相关联的数据的至少一个关系到分层映射。 然后，基于至少一个查询来修改至少一个关系到分层映射，使得可以根据修改的关系到分层映射生成与至少一个查询特别相关的数据。

公开(公告)号：US09405820B2

公开(公告)日：2016-08-02

申请号：US13016199

申请日：2011-01-28

申请人： Oded Shmueli ,  Lila Shnaiderman

发明人： Oded Shmueli ,  Lila Shnaiderman

IPC分类号： G06F17/30

CPC分类号： G06F17/30625

摘要： A system and method for searching a document for a query pattern. A plurality of streams may be stored each including a linear sequence of nodes. Each stream may be associated with nodes having a common label in a data tree of the document. A query pattern may be searched for in the streams by executing a plurality of threads. Each of two or more of the threads may be used to search different sub-streams of the plurality of streams. Each of the different sub-streams searched for by each thread in each stream may be uniquely correlated with one or more disjoint sub-trees of a partition of the tree into a plurality of sub-trees. The two or more of the plurality of threads may be executed in parallel. A result of the query pattern search may be generated using at least one of the threads.

摘要翻译： 一种用于搜索文档查询模式的系统和方法。 可以存储多个流，每个流包括节点的线性序列。 每个流可以与在文档的数据树中具有公共标签的节点相关联。 可以通过执行多个线程在流中搜索查询模式。 两个或更多个线程中的每一个可以用于搜索多个流的不同子流。 每个流中每个线程搜索的每个不同子流可以与树的分区的一个或多个不相交的子树唯一地相关联成多个子树。 可以并行地执行多个线程中的两个或更多个。 可以使用至少一个线程来生成查询模式搜索的结果。

公开(公告)号：US20140189149A1

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

申请号：US14201870

申请日：2014-03-09

申请人： Oded Shmueli ,  Benny Yehezkel

发明人： Oded Shmueli ,  Benny Yehezkel

IPC分类号： H04L29/06

CPC分类号： H04L65/1069 ,  H04L29/06027 ,  H04L65/60 ,  H04L67/04 ,  H04L67/303 ,  H04M3/42263 ,  H04M3/543 ,  H04M2201/60 ,  H04M2203/1091 ,  H04M2203/2066 ,  H04M2203/2094 ,  H04M2242/30

摘要： Rerouting apparatus for rerouting data including multimedia data. The apparatus is for association with electronic equipment and allows for routing the data to a device regarded as the most convenient for playing the media. The apparatus comprises an announcer device for indicating to surrounding equipment that associated equipment is available for rerouting, thereby to enable receipt of rerouted communications therefrom, and a scout device for scanning surroundings of the associated equipment to find out about compatible equipment in the vicinity, thereby to reroute communications thereto. The apparatus may be attached to any device having data processing capability, to enable rerouting of data and communications therebetween.

摘要翻译： 用于重新路由数据的重新路由设备，包括多媒体数据。 该设备用于与电子设备相关联并且允许将数据路由到被认为是最方便播放媒体的设备。 该装置包括用于向周围设备指示相关联的设备可用于重新路由的播音器设备，从而能够从其接收重新路由的通信，以及用于扫描相关设备的周围环境的侦察设备，以找出附近的兼容设备，从而 重新路由通信。 该装置可以附接到具有数据处理能力的任何设备，以使得能够重新路由它们之间的数据和通信。

公开(公告)号：US20110099205A1

公开(公告)日：2011-04-28

申请号：US13000022

申请日：2009-06-18

申请人： Oded Shmueli ,  Lila Shnaiderman

发明人： Oded Shmueli ,  Lila Shnaiderman

IPC分类号： G06F7/00

CPC分类号： G06F17/30923 ,  G06F17/30911 ,  G06F17/30961

摘要： In a data storage and retrieval system wherein data is stored and retrieved in pages, said data comprising connected nodes arranged such that each page stores only complete nodes, said connected nodes being connected via a plurality of overlapping tree structures, a method of minimizing page retrieval in the face of changing relationships between nodes comprising: selecting at least two of said overlapping tree structures; incrementally adjusting a page node structure dynamically based on real time workload, separately according to each selected tree structure, to form modified partitions for each tree structure, each modified partition being so as to minimize page faults; for each modified partition calculating a modification gain to indicate which partition has provided a greater minimization of page faults; and selecting the tree structure and modified partition corresponding to the best modification gain.

摘要翻译： 在其中以页面存储和检索数据的数据存储和检索系统中，所述数据包括被布置为使得每个页面仅存储完整节点的连接节点，所述连接的节点通过多个重叠的树结构连接，一种使页面检索最小化的方法 面对改变节点之间的关系，包括：选择所述重叠树结构中的至少两个; 根据每个选择的树结构，分别根据实时工作量动态地调整页面节点结构，以形成每个树结构的修改的分区，每个修改的分区是最小化页面错误; 对于每个修改的分区计算修改增益以指示哪个分区提供了更大的页面错误的最小化; 并选择对应于最佳修改增益的树结构和修改分区。

公开(公告)号：US07912871B2

公开(公告)日：2011-03-22

申请号：US11997115

申请日：2006-07-27

申请人： Oded Shmueli ,  Sharon Krisher

发明人： Oded Shmueli ,  Sharon Krisher

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

CPC分类号： G06F17/2247 ,  G06F17/2725

摘要： The present invention relates to a method, and system for implementing the method, for performing incremental validation of an XML document with respect to XML Schema key and keyref constraints, and handling the semantics dictated by the XML Schema specification. Several operations are defined that change the content of a document, i.e., add or remove nodes, or change the value of existing nodes. The present invention verifies whether performing such an operation would violate key or keyref constraints, and allows changing the document only if the operation maintains the validity of the document with respect to the constraints. The verification traverses only the parts of the document that may be affected by the change operation, and not the whole document. The invention maintains, in an efficient manner, data structures that hold information relevant to the validation of key and keyref constraints.

摘要翻译： 本发明涉及一种用于实现该方法的方法和系统，用于针对XML Schema密钥和keyref约束执行XML文档的增量验证，以及处理由XML Schema规范规定的语义。 定义了改变文档的内容，即添加或删除节点或改变现有节点的值的若干操作。 本发明验证是否执行这样的操作将违反密钥或密钥对约束，并且只有当操作维持文档相对于约束的有效性时才允许更改文档。 验证仅遍历可能受更改操作影响的文档的部分，而不是整个文档。 本发明以有效的方式保持了数据结构，其保存与关键和关键参数约束的验证相关的信息。

公开(公告)号：US06442555B1

公开(公告)日：2002-08-27

申请号：US09428136

申请日：1999-10-26

申请人： Oded Shmueli ,  Michael Elad ,  Darryl Greig ,  Carl Staelin

发明人： Oded Shmueli ,  Michael Elad ,  Darryl Greig ,  Carl Staelin

IPC分类号： G06F1730

CPC分类号： G06F17/3071 ,  G06K9/00463 ,  Y10S707/99933 ,  Y10S707/99936 ,  Y10S707/99942

摘要： A method of quickly and automatically comparing a new document to a large number of previously seen documents and identifying the document type. First, provide a plurality of document type distributions, each document type distribution describes layout characteristics of an independent document type and may include a plurality of data points. Each document type distribution includes data derived from at least one basis document signature which may include data defining pixels of a low-resolution image of the independent basis document resolved to between 1 and 75 dots per inch or may include document segmentation data derived from the independent basis document. Next provide a new electronic document. Then create new document signature from the new electronic document. Next, distances between the new document signature and each of the plurality of document type distributions are calculated using an algorithm based on a Bayesian framework for a Gaussian distribution. The distances calculated may be Euclidean distances or may be Mahalanobis distances. Additionally, calculating the distances may include weighting the value given each of a plurality of data points in the document signatures based on the usefulness of each of the plurality of data points in distinguishing between the document signatures. Next, select at least one candidate document type for the new electronic document from among the independent document types described by the plurality of document type distributions. The selection of the at least one candidate document type may include selecting a preselected fixed number of the independent document types or may include selecting the independent document types described by those of the plurality of document type distributions having calculated distances that are within a preselected threshold distance of the smallest of the distances calculated. In addition, the invention provides for a program storage medium readable by computer, tangibly embodying a program of instructions executable by the computer to perform the method steps described above.

公开(公告)号：US6012059A

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

申请号：US918686

申请日：1997-08-21

申请人： Marie-Anne Neimat ,  Kurt Shoens ,  Oded Shmueli

发明人： Marie-Anne Neimat ,  Kurt Shoens ,  Oded Shmueli

IPC分类号： G06F17/30

CPC分类号： G06F17/30575 ,  Y10S707/99938 ,  Y10S707/99952

摘要： Local transactions are run at replication sites while receiving and tracking replication packages from primary sites. If a package coming in from a primary site updates data that a local transaction used, the data is considered stale and the local transaction is restarted. When the replication site wishes to commit (e.g., update data at the primary sites), a special dummy marker is submitted and committed. The marker comprises a dummy transaction that updates a piece of data at the primary site private to the replication site. The local site waits for the dummy transaction in the stream of replication packages sent from the primary site. Once the dummy transaction is received, the replication site is assured that any subsequent replication packages from the primary site will not affect the local transaction. If the replication packages received before the marker do not affect data items referenced during the local transaction, the local transaction commits.

摘要翻译： 本地事务在复制站点上运行，同时从主站点接收和跟踪复制包。 如果从主站点进入的软件包更新了本地事务使用的数据，那么数据将被视为过时且本地事务重新启动。 当复制站点希望提交（例如，在主站点更新数据）时，提交并提交特殊的虚拟标记。 该标记包括一个虚拟事务，它将复制站点的主站点私有的一段数据更新。 本地站点等待从主站点发送的复制包流中的虚拟事务。 一旦接收到虚拟事务，复制站点就可以确保来自主站点的任何后续复制包不会影响本地事务。 如果在标记之前收到的复制包不会影响在本地事务期间引用的数据项，则本地事务提交。

公开(公告)号：US10547648B2

公开(公告)日：2020-01-28

申请号：US15607729

申请日：2017-05-30

申请人： Oded Shmueli ,  Benny Yehezkel

发明人： Oded Shmueli ,  Benny Yehezkel

IPC分类号： H04L29/06 ,  H04M3/42 ,  H04L29/08 ,  H04M3/54

摘要： Rerouting apparatus for rerouting data including multimedia data. The apparatus is for association with electronic equipment and allows for routing the data to a device regarded as the most convenient for playing the media. The apparatus comprises an announcer device for indicating to surrounding equipment that associated equipment is available for rerouting, thereby to enable receipt of rerouted communications therefrom, and a scout device for scanning surroundings of the associated equipment to find out about compatible equipment in the vicinity, thereby to reroute communications thereto. The apparatus may be attached to any device having data processing capability, to enable rerouting of data and communications therebetween.

公开(公告)号：US09607052B2

公开(公告)日：2017-03-28

申请号：US12648546

申请日：2009-12-29

申请人： Oded Shmueli ,  Royi Ronen

发明人： Oded Shmueli ,  Royi Ronen

IPC分类号： G06F17/30

CPC分类号： G06F17/30545

摘要： A query network is disclosed, comprising sets of nodes and edges connecting pairs of nodes. The nodes of the query network are associated with edge-defining queries. A method is taught for fully evaluating such a query network. A language is further disclosed for constructing queries. The query network may be used to model a social network, a professional network or the like.