专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明专利

JP2009116898A Relation path viability prediction 有权
标题翻译：关系路径可能性预测
公开(公告)号：JP2009116898A
公开(公告)日：2009-05-28
申请号：JP2009005237
申请日：2009-01-13
申请人： Sap Portals Israel Ltd , エスエーピーポータルズイスラエルリミテッド
发明人： GVILY YANIV , AGASSI SHAI
IPC分类号： G06F17/30 , G06F12/00
CPC分类号： G06F17/30445 , G06F17/30324 , G06F17/30398 , G06F17/30457 , G06F17/30469 , G06F17/30522 , G06F17/30554 , G06F17/30607 , Y10S707/99935 , Y10S707/99943
摘要： PROBLEM TO BE SOLVED: To provide an information system formed of objects having different instances and relations between the objects. SOLUTION: A process is provided for predicting whether a query will produce a result (514) in this information system. An instance-to-object bitmap (512) is computed offline before queries are generated by a user. The bitmap is used to represent the existence of a relation path from instances to the other objects of a database. When a query is generated, the bitmap is accessed to predict whether there exists a relation from the instance to the object, that is whether the query will issue a result. The process enables the user to abort queries (518) without consuming run-time. The process also guides the user through navigation of a Web page or the like by suggesting relations that will produce results. COPYRIGHT: (C)2009,JPO&INPIT
摘要翻译：要解决的问题：提供由对象之间具有不同实例和关系的对象形成的信息系统。
解决方案：提供了一种用于预测查询是否将在该信息系统中产生结果（514）的过程。在用户生成查询之前，离线计算一个实例对对象位图（512）。位图用于表示从实例到数据库的其他对象的关系路径的存在。当生成查询时，访问位图以预测是否存在从实例到对象的关系，即查询是否会发出结果。该过程使用户能够中止查询（518）而不消耗运行时间。该过程还通过建立将产生结果的关系来引导用户导航网页等。版权所有（C）2009，JPO＆INPIT

2. 发明专利

JP2006114038A Hyperlink browser with multilink select capability 审中-公开
标题翻译： HYPERLINK浏览器具有多种选择能力
公开(公告)号：JP2006114038A
公开(公告)日：2006-04-27
申请号：JP2005295778
申请日：2005-10-07
申请人： Sap Portals Israel Ltd , エスエーピーポータルズイスラエルリミテッド
发明人： GVILY YANIV
IPC分类号： G06F17/30 , G06F3/0483 , G06F12/00
CPC分类号： G06F17/30887 , G06F3/0483 , G06F17/30864
摘要： PROBLEM TO BE SOLVED: To provide a method of generating and processing a multilinked operation in a hyperlinked browser of a computer system.
SOLUTION: The multilinked operation is an operation representing at least two links. A user is presented with a page in hyperlinked format with at least two links thereon and a browser (or server) records link selections of the user. More than one link (1) selection is recorded if the user selects a link (2) without unselecting all other previously selected link (1) selections. In response to the user selecting the recorded selections as a group, the multilinked operation is generated representing the recorded selections and processed to form a new hyperlinked format page.
COPYRIGHT: (C)2006,JPO&NCIPI
摘要翻译：要解决的问题：提供一种在计算机系统的超链接浏览器中生成和处理多链接操作的方法。
解决方案：多链接操作是表示至少两个链接的操作。向用户呈现超链接格式的页面，其上至少有两个链接，浏览器（或服务器）记录用户的链接选择。如果用户选择链接（2）而不取消选择所有其他先前选择的链接（1）选择，则记录多于一个链接（1）选择。响应于用户选择记录的选择作为组，生成表示所记录的选择的多链接操作并被处理以形成新的超链接格式页面。版权所有（C）2006，JPO＆NCIPI

3. 发明专利

JP2010015556A Method and device for transaction processing conscious of distributed application context 有权
标题翻译：用于分布式应用上下文的交易处理方法和设备
公开(公告)号：JP2010015556A
公开(公告)日：2010-01-21
申请号：JP2009140429
申请日：2009-06-11
申请人： Sap Portals Israel Ltd , エスエーピー・ポータルズ・イスラエル・リミテッド
发明人： ALEX DROBINSKY , GROYS MICHAEL , NADAV HELFMAN
IPC分类号： G06F9/54 , G06F9/445
CPC分类号： H04L67/2804 , H04L67/327
摘要： PROBLEM TO BE SOLVED: To provide a method and a device for applying a uniform processing policy within a distributed computer network.
SOLUTION: A message is received at a termination point from application used by a user. At the termination point, tagging information is attached to the message, the tagging information indicating which processes the message should undergo and which parameter or configuration the processes should undergo. The message is then processed in the distributed network according to the tagging information so that uniform processing may be assured. When necessary, a response message is generated and the same tagging information as the original message is assigned substantially.
COPYRIGHT: (C)2010,JPO&INPIT
摘要翻译：要解决的问题：提供一种在分布式计算机网络内应用统一处理策略的方法和装置。
解决方案：在用户使用的应用程序的终止点接收到消息。在终止点，标签信息被附加到消息，标记信息指示消息应该经历什么处理以及进程应该经历哪些参数或配置。然后根据标签信息在分布式网络中处理该消息，从而可以确保均匀处理。必要时，生成响应消息，并且基本上分配与原始消息相同的标签信息。版权所有（C）2010，JPO＆INPIT

4. 发明专利

JP2006172491A Relation path viability prediction 有权
标题翻译：关系路径可能性预测
公开(公告)号：JP2006172491A
公开(公告)日：2006-06-29
申请号：JP2006005434
申请日：2006-01-12
申请人： Sap Portals Israel Ltd , エスエーピーポータルズイスラエルリミテッド
发明人： GVILY YANIV , AGASSI SHAI
IPC分类号： G06F17/30 , G06F12/00
CPC分类号： G06F17/30445 , G06F17/30324 , G06F17/30398 , G06F17/30457 , G06F17/30469 , G06F17/30522 , G06F17/30554 , G06F17/30607 , Y10S707/99935 , Y10S707/99943
摘要： PROBLEM TO BE SOLVED: To provide an information system formed by objects having mutually different instance and relations between the objects. SOLUTION: In this system, a process for predicting whether a query produces a result (514) is provided. An instance-to-object bitmap (512) is computed in off-line, before queries are generated by a user. The bitmap is used to represent the existence of a relation path from instances to the other objects of a database. When a query is generated, the bitmap is accessed to predict whether there exists a relation from the instance to the object, that is whether the query issues a result. The process makes it possible for the user to abort queries (518) without consuming run-time. The process also makes it possible to guide users through navigation of a Web pages or the like by suggesting relation that produces results. COPYRIGHT: (C)2006,JPO&NCIPI
摘要翻译：要解决的问题：提供由对象之间具有彼此不同的实例和关系的对象形成的信息系统。
解决方案：在该系统中，提供了一种用于预测查询是否产生结果（514）的过程。在用户生成查询之前，离线计算实例对对象位图（512）。位图用于表示从实例到数据库的其他对象的关系路径的存在。当生成查询时，访问位图以预测是否存在从实例到对象的关系，即查询是否发出结果。该过程使得用户可以中止查询（518）而不消耗运行时间。该过程还使得可以通过建立产生结果的关系来引导用户浏览网页等。版权所有（C）2006，JPO＆NCIPI

5. 发明专利

JP2013131218A Analysis and display of relations among persons 审中-公开
标题翻译：分析和展示人际关系
公开(公告)号：JP2013131218A
公开(公告)日：2013-07-04
申请号：JP2012274420
申请日：2012-12-17
申请人： Sap Portals Israel Ltd , エスエーピーポータルズイスラエルリミテッド
发明人： ALEXEY SOSHIN
IPC分类号： G06F17/30
CPC分类号： G06Q10/06
摘要： PROBLEM TO BE SOLVED: To provide display of relations among persons in accordance with the degree of separation among entities in a database.SOLUTION: A computer execution method for analyzing and displaying relations among persons includes a step for receiving a user input for requesting display of relations among persons about a certain person in a computer system, a step for selecting relations including persons on the basis of the user input in a relational database to execute a query of the relational database for selecting another person included in any of the selected relations, and also executing a query of the relational database for each of selected other persons up to the maximum number of the step, and a step for performing display of relations among persons corresponding to the user input and allowing the display to show at least persons selected by the query of the relational database.
摘要翻译：要解决的问题：根据数据库中的实体之间的分离程度来提供人员之间的关系的显示。解决方案：用于分析和显示人员之间关系的计算机执行方法包括：接收用户请求显示的用户输入的步骤人之间关于计算机系统中的某人的关系，用于基于在关系数据库中的用户输入来选择关系的步骤，以执行关系数据库的查询以选择包括在所选择的关系中的任何一个的另一个人，并且还执行对于所选择的其他人的每个所述关键数据库的查询，直到所述步骤的最大数量;以及用于执行与所述用户输入相对应的人之间的关系的显示的步骤，并允许所述显示至少显示由查询关系数据库。

6. 发明专利

JP2011204228A Mashup infrastructure with learning mechanism 审中-公开
标题翻译：具有学习机制的MASHUP基础设施
公开(公告)号：JP2011204228A
公开(公告)日：2011-10-13
申请号：JP2011029746
申请日：2011-02-15
申请人： Sap Portals Israel Ltd , エスエーピーポータルズイスラエルリミテッド
发明人： BLEIER ORLY , ALON RAM , GROSS RAN , TAMMAM ARIEL , VAINER VITALY
IPC分类号： G06F9/44
CPC分类号： G06F9/54
摘要： PROBLEM TO BE SOLVED: To provide systems, software, and computer implemented methods for providing a mashup infrastructure with a learning mechanism.SOLUTION: One process includes operations for receiving a request for connecting a first port of an application with a different port and identifying tagged parameters associated with the first port. A set of potential ports for connecting with the first port based at least in part on the tagged parameters is dynamically determined. A suggestion of potential ports for connecting with the first port, including at least a subset of potential ports selected from the set of potential ports, is presented.
摘要翻译：要解决的问题：提供系统，软件和计算机实现的方法，用于提供具有学习机制的混搭基础设施。解决方案：一个过程包括用于接收连接应用程序的第一个端口与不同端口的请求的操作，并识别标记与第一个端口关联的参数。至少部分地基于标记参数的用于与第一端口连接的一组潜在端口被动态地确定。提出了与第一端口连接的潜在端口的建议，包括从该组潜在端口中选择的至少一个潜在端口的子集。

7. 发明申请

WO2004055695A1 METHOD FOR SEARCHING FOR A DESIRED ELEMENT IN A DOCUMENT 审中-公开
标题翻译：在文件中搜索所需元素的方法
公开(公告)号：WO2004055695A1
公开(公告)日：2004-07-01
申请号：PCT/IL2002/001008
申请日：2002-12-16
申请人： SAP PORTALS ISRAEL LTD. , MENASHE, Gilad
发明人： MENASHE, Gilad
IPC分类号： G06F17/30
CPC分类号： G06F17/2247
摘要： The invention provides a method for searching for a desired element in a document using a first sequence of elements from a related document, wherein the document is related by an expected similarity, wherein the first sequence of elements represents an ordered list of elements where each element is from a predetermined set of elements, the method comprising (a) building a second sequence of elements from the document, wherein the second sequence of elements represents an ordered list of elements where each element is from the predetermined set of elements; (b) generating one or more search queries from the first sequence of elements; (c) comparing the second sequence of elements with the one or more search queries to produce one or more comparison results; and (d) determining the desired element in the document from the one or more comparison results.
摘要翻译：本发明提供一种用于使用来自相关文档的元素的第一序列来搜索文档中的期望元素的方法，其中所述文档由预期相似性相关联，其中第一元素序列表示元素的有序列表，其中每个元素所述方法包括（a）从所述文档构建第二元素序列，其中所述第二元素序列表示元素的有序列表，其中每个元素来自所述预定元素集合; （b）从第一个元素序列生成一个或多个搜索查询; （c）将所述第二元素序列与所述一个或多个搜索查询进行比较以产生一个或多个比较结果; 和（d）从一个或多个比较结果确定文档中的期望元素。

8. 发明专利

AT535876T 未知
公开(公告)号：AT535876T
公开(公告)日：2011-12-15
申请号：AT01981504
申请日：2001-10-10
申请人： SAP PORTALS ISRAEL LTD , GVILY YANIV
发明人： GVILY YANIV
IPC分类号： G06F21/00 , G06Q20/10 , H04L29/06 , H04L29/08
摘要： A user is connected to the Internet by a proxy server that impersonates the user. Websites are accessed by sending an HTTP request to the proxy server. The HTTP request is encoded with characters that are understood by the proxy as requiring that the HTTP request be intercepted and either an identified script be executed or data within the request be extracted. The impersonating proxy automatically carries out the steps that would otherwise be carried out by the user when performing a transaction at a website. In one example, a user checks a bank website for a balance inquiry. A first HTTP request includes a script identifier. The proxy retrieves and executes the identified script, which in turn causes a an HTTP response to be sent to the user's browser for personal information (e.g., user name and password). That personal information is extracted from a second HTTP request returned to the proxy, and the proxy accesses the bank website, enters the personal information, retrieves the account balance, and provides it to the user.

9. 发明专利

DE60030735D1 未知
公开(公告)号：DE60030735D1
公开(公告)日：2006-10-26
申请号：DE60030735
申请日：2000-06-29
申请人： SAP PORTALS ISRAEL LTD
发明人： GVILY YANIV , AGASSI SHAI
IPC分类号： G06F17/30 , G06F12/00
摘要： There is provided a process for predicting whether a query will produce a result in an information system formed of objects having different instances and relations between the objects. An instance-to-object bitmap is computed off-line, before queries are generated by a user: the bitmap is used to represent the existence of a relation path from instances to the other objects of a database. When a query is generated, the bitmap is accessed to predict whether there exists a relation from the instance to the object, that is whether the query will issue a result. The process makes it possible for a user to abort queries without consuming run-time. It also makes it possible to guide users through navigation of a Webpage or the like, by suggesting relations that will produce results.

10. 发明专利

AT339730T 未知
公开(公告)号：AT339730T
公开(公告)日：2006-10-15
申请号：AT00946978
申请日：2000-06-29
申请人： SAP PORTALS ISRAEL LTD
发明人： GVILY YANIV , AGASSI SHAI
IPC分类号： G06F12/00 , G06F17/30
摘要： There is provided a process for predicting whether a query will produce a result in an information system formed of objects having different instances and relations between the objects. An instance-to-object bitmap is computed off-line, before queries are generated by a user: the bitmap is used to represent the existence of a relation path from instances to the other objects of a database. When a query is generated, the bitmap is accessed to predict whether there exists a relation from the instance to the object, that is whether the query will issue a result. The process makes it possible for a user to abort queries without consuming run-time. It also makes it possible to guide users through navigation of a Webpage or the like, by suggesting relations that will produce results.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式