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

1. 发明授权

US08160910B2 Visualization for aggregation of change tracking information 失效
标题翻译：可视化用于汇总变更跟踪信息
公开(公告)号：US08160910B2
公开(公告)日：2012-04-17
申请号：US13236224
申请日：2011-09-19
申请人： Jason B. Ellis , Laurent Hasson , Peter K. Malkin
发明人： Jason B. Ellis , Laurent Hasson , Peter K. Malkin
IPC分类号： G06Q10/00
CPC分类号： G06Q10/10 , G06Q10/063 , G06Q10/06311 , G06Q10/063114 , G06Q30/0201
摘要： A method within a system wherein a first user of the system provides information on social patterns to a second user includes: receiving a request for social pattern information from the second user, the request comprising a query; assigning authorization level to the second user for restricting the type and amount of data provided to the second user; providing information on social patterns to the second user according to the second user's authorization level; and storing information about the second user to be used in future transactions with the second user, the information including transactional fee data and subscription data for notifying the second user of additional social patterns as they develop.
摘要翻译：系统内的方法，其中系统的第一用户向第二用户提供关于社交模式的信息，包括：从第二用户接收对社交图案信息的请求，所述请求包括查询; 为第二用户分配授权级别以限制提供给第二用户的数据的类型和数量; 根据第二用户的授权级别向第二用户提供关于社交模式的信息; 以及存储关于将来与第二用户的交易中使用的第二用户的信息，所述信息包括事务费用数据和订阅数据，用于在第二用户开发时通知另外的社交模式。

2. 发明授权

US08024214B2 System and method of visualization for aggregation of change tracking information 有权
标题翻译：变更跟踪信息汇总的可视化系统和方法
公开(公告)号：US08024214B2
公开(公告)日：2011-09-20
申请号：US11505145
申请日：2006-08-15
申请人： Jason B. Ellis , Laurent Hasson , Peter K. Malkin
发明人： Jason B. Ellis , Laurent Hasson , Peter K. Malkin
IPC分类号： G06Q10/00
CPC分类号： G06Q10/10 , G06Q10/063 , G06Q10/06311 , G06Q10/063114 , G06Q30/0201
摘要： A system for identifying one or more social patterns in a status history of one or more change requests includes: a processor for executing instructions and memory comprising logic for: receiving as input change request data history; detecting social patterns in the change request data history; storing information about the social patterns, including status history data; and providing information on social patterns within the status history of the given change request. The logic includes the following elements: a hypertext transfer protocol server handler; a social pattern server database; a change log handler; a social pattern alert handler; a social pattern query handler; and a social pattern detection handler for: receiving new patterns wherein the patterns are user-defined operational descriptors, detecting social patterns in raw change request data from the change log handler, and storing the patterns in the database, and analyzing the patterns. The system further includes a graphical user interface.
摘要翻译：一种用于识别一个或多个改变请求的状态历史中的一个或多个社会模式的系统包括：用于执行指令和存储器的处理器，包括用于：作为输入改变请求数据历史的逻辑; 检测变更请求数据历史中的社会模式; 存储关于社会模式的信息，包括状态历史数据; 并在给定的变更请求的状态历史中提供关于社会模式的信息。该逻辑包括以下元素：超文本传输协议服务器处理程序; 社交模式服务器数据库; 更改日志处理程序; 社会模式警报处理程序社交模式查询处理程序以及社会模式检测处理程序，用于：接收新模式，其中模式是用户定义的操作描述符，从变更日志处理程序中检测原始改变请求数据中的社会模式，并将模式存储在数据库中，并分析模式。该系统还包括图形用户界面。

3. 发明申请

US20050188353A1 Method and system for retaining formal data model descriptions between server-side and browser-side javascript objects 有权
标题翻译：用于在服务器端和浏览器端的JavaScript对象之间保留正式数据模型描述的方法和系统
公开(公告)号：US20050188353A1
公开(公告)日：2005-08-25
申请号：US10784026
申请日：2004-02-20
申请人： Laurent Hasson , Jobi George , John Ponzo
发明人： Laurent Hasson , Jobi George , John Ponzo
IPC分类号： G06F9/44
CPC分类号： G06F8/70
摘要： A server method for converting objects of a first type into objects of a second type, the method comprising: a) identifying one or more object classes of the first type; b) determining instance data based on the classes of the first type; c) introspecting each class of the first type; d) creating an artifact representing a software model; and e) generating one or more converters, each converter being based on the artifact and is configured for receiving the instance data and generating JavaScript code for recreating the instance from the classes as objects of the second type, for display on a browser.
摘要翻译：一种用于将第一类型的对象转换为第二类型的对象的服务器方法，所述方法包括：a）识别所述第一类型的一个或多个对象类别; b）基于第一类的类确定实例数据; c）内省第一类的每一类; d）创建代表软件模型的工件; 以及e）生成一个或多个转换器，每个转换器基于所述工件，并且被配置为接收所述实例数据并生成用于从作为所述第二类型的对象的类再现所述实例的JavaScript代码，以在浏览器上显示。

4. 发明申请

US20090077123A1 METHOD FOR MANAGING KEYBOARD NAVIGATION WITHIN A TREE CONTROL STRUCTURE USER INTERFACE COMPONENT VIA A LINKED LIST 有权
标题翻译：通过链接列表在树控制结构中管理键盘导航的方法用户界面组件
公开(公告)号：US20090077123A1
公开(公告)日：2009-03-19
申请号：US11855798
申请日：2007-09-14
申请人： BECKY J. GIBSON , Daniel A. Gisolfi , Laurent Hasson , Mark A. Pilgrim
发明人： BECKY J. GIBSON , Daniel A. Gisolfi , Laurent Hasson , Mark A. Pilgrim
IPC分类号： G06F17/00
CPC分类号： G06F3/0489 , G06F3/0482
摘要： A method, data processing system and computer program product for maintaining/updating managing keyboard navigation using a linked list. In particular, a Dynamic Tree Control Linkage (DTCL) utility creates a doubly linked list with list nodes having assigned values based on a tree control structure UI component. Each list node of the doubly linked list corresponds to a visible tree item of the tree structure UI component. Responding to a keyboard event signal, the DTCL utility finds a current list node corresponding to a first current tree item. The DTCL utility finds a next (i.e. previous or subsequent) list node corresponding to a next tree item. The DTCL utility detects a list node exists. The DTCL utility detects whether the next list node is associated with a null value. When the next list node is associated with a non-null value, the next tree item is identified. The DTCL utility returns an identification of the next tree item representing a second current tree item. The DTCL utility also updates the doubly linked list in response to the expansion/collapsion of the current list item. The DTCL utility avoids the need to number all tree items (both visible and hidden tree items) sequentially by adding list node(s) to or removing list node(s) from the linked list to represent the visible tree items.
摘要翻译：一种用于维护/更新使用链表管理键盘导航的方法，数据处理系统和计算机程序产品。特别地，动态树控制链接（DTCL）实用程序创建具有基于树控制结构UI组件的分配值的列表节点的双向链表。双向链表的每个列表节点对应于树结构UI组件的可见树项。响应于键盘事件信号，DTCL实用程序找到与第一个当前树项对应的当前列表节点。 DTCL实用程序查找对应于下一个树项目的下一个（即前一个或后续）列表节点。 DTCL实用程序检测到列表节点存在。 DTCL实用程序检测下一个列表节点是否与一个空值相关联。当下一个列表节点与非空值相关联时，将识别下一个树项目。 DTCL实用程序返回表示第二个当前树项目的下一个树项目的标识。 DTCL实用程序还会更新双向链表，以响应当前列表项的扩展/折叠。 DTCL实用程序避免了通过将列表节点添加到列表节点或从链接列表中删除列表节点来代表可见树项目，从而顺序地对所有树项（可见树和隐藏树项）进行编号。

5. 发明申请

US20080162488A1 METHOD, SYSTEM AND PROGRAM PRODUCT FOR UPDATING BROWSER PAGE ELEMENTS OVER A DISTRIBUTED NETWORK 审中-公开
标题翻译：分布式网络更新浏览器页面元素的方法，系统和程序产品
公开(公告)号：US20080162488A1
公开(公告)日：2008-07-03
申请号：US11617835
申请日：2006-12-29
申请人： Christopher J. Karle , Laurent Hasson , Fenil Shah
发明人： Christopher J. Karle , Laurent Hasson , Fenil Shah
IPC分类号： G06F17/30
CPC分类号： G06F16/957
摘要： The present invention provides a solution for updating browser page elements over a distributed network. Specifically, the present invention associates a control with a downloaded data element. This association may be provided via the Document Object Model (DOM) of the web page. The control, in turn, is linked with the data element itself, or with a sub-element that depends from the root data element. This dependent data element may have been obtained from the remote location simultaneously with the data element. Upon activation of the control, the dependent data element is displayed without a need for the remote location to be accessed.
摘要翻译：本发明提供了一种用于在分布式网络上更新浏览器页面元素的解决方案。具体地，本发明将控制与下载的数据元素相关联。该关联可以通过网页的文档对象模型（DOM）来提供。控制又与数据元素本身或与根数据元素相关的子元素链接。该依赖数据元素可能已经与数据元素同时从远程位置获得。在激活控制时，显示依赖数据元素，而不需要访问远程位置。

6. 发明申请

US20070157077A1 Accessible role and state information in HTML documents 有权
标题翻译： HTML文档中的可访问角色和状态信息
公开(公告)号：US20070157077A1
公开(公告)日：2007-07-05
申请号：US11315955
申请日：2005-12-22
申请人： Becky Gibson , Daniel Gisolfi , Laurent Hasson , Aaron Leventhal , Mark Pilgrim
发明人： Becky Gibson , Daniel Gisolfi , Laurent Hasson , Aaron Leventhal , Mark Pilgrim
IPC分类号： G06F17/00
CPC分类号： G06F17/30914 , G06F17/30882 , G06F17/30893 , G06F17/30917
摘要： Accessible role and state information may be included in hypertext markup language documents by encoding an accessibility definition into a class attribute. The accessibility definition corresponds with an object of a hypertext markup language document and comprises role information and state information if state information is applicable to the corresponding role information. A script is associated with the hypertext markup language document and is configured for parsing at least a portion of the hypertext markup language document to identify the accessibility definition. The script further maps the role information and the state information in the accessibility definition to corresponding namespaced role and state attributes.
摘要翻译：可访问角色和状态信息可以通过将可访问性定义编码到类属性中而被包括在超文本标记语言文档中。可访问性定义对应于超文本标记语言文档的对象，并且如果状态信息适用于相应的角色信息，则其包括角色信息和状态信息。脚本与超文本标记语言文档相关联，并被配置用于解析至少一部分超文本标记语言文档以识别可访问性定义。该脚本还将可访问性定义中的角色信息和状态信息映射到相应的命名空间角色和状态属性。

7. 发明授权

US07844637B2 Method for managing keyboard navigation within a tree control structure user interface component via a linked list 有权
标题翻译：通过链表管理树控制结构用户界面组件内的键盘导航的方法
公开(公告)号：US07844637B2
公开(公告)日：2010-11-30
申请号：US11855798
申请日：2007-09-14
申请人： Becky J. Gibson , Daniel A. Gisolfi , Laurent Hasson , Mark A. Pilgrim
发明人： Becky J. Gibson , Daniel A. Gisolfi , Laurent Hasson , Mark A. Pilgrim
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F3/0489 , G06F3/0482
摘要： A method, data processing system and computer program product for maintaining/updating managing keyboard navigation using a linked list. In particular, a Dynamic Tree Control Linkage (DTCL) utility creates a doubly linked list with list nodes having assigned values based on a tree control structure UI component. Each list node of the doubly linked list corresponds to a visible tree item of the tree structure UI component. Responding to a keyboard event signal, the DTCL utility finds a current list node corresponding to a first current tree item. The DTCL utility finds a next (i.e. previous or subsequent) list node corresponding to a next tree item. The DTCL utility detects a list node exists. The DTCL utility detects whether the next list node is associated with a null value. When the next list node is associated with a non-null value, the next tree item is identified. The DTCL utility returns an identification of the next tree item representing a second current tree item. The DTCL utility also updates the doubly linked list in response to the expansion/collapsion of the current list item. The DTCL utility avoids the need to number all tree items (both visible and hidden tree items) sequentially by adding list node(s) to or removing list node(s) from the linked list to represent the visible tree items.
摘要翻译：一种用于维护/更新使用链表管理键盘导航的方法，数据处理系统和计算机程序产品。特别地，动态树控制链接（DTCL）实用程序创建具有基于树控制结构UI组件的分配值的列表节点的双向链表。双向链表的每个列表节点对应于树结构UI组件的可见树项。响应于键盘事件信号，DTCL实用程序找到与第一个当前树项对应的当前列表节点。 DTCL实用程序查找对应于下一个树项目的下一个（即前一个或后续）列表节点。 DTCL实用程序检测列表节点存在。 DTCL实用程序检测下一个列表节点是否与一个空值相关联。当下一个列表节点与非空值相关联时，将识别下一个树项目。 DTCL实用程序返回表示第二个当前树项目的下一个树项目的标识。 DTCL实用程序还会更新双向链表，以响应当前列表项的扩展/折叠。 DTCL实用程序避免了通过将列表节点添加到列表节点或从链接列表中删除列表节点来代表可见树项目，从而顺序地对所有树项（可见树和隐藏树项）进行编号。

8. 发明申请

US20090012950A1 METHOD AND SYSTEM FOR SEARCHING ACROSS INDEPENDENT APPLICATIONS 失效
标题翻译：用于搜索独立应用的方法和系统
公开(公告)号：US20090012950A1
公开(公告)日：2009-01-08
申请号：US11772268
申请日：2007-07-02
申请人： Laurent Hasson , David Konopnicki
发明人： Laurent Hasson , David Konopnicki
IPC分类号： G06F7/00
CPC分类号： G06F17/30864
摘要： A method and system are provided for searching across independent applications. A first seedlist (202) is provided from a first application (201), the first seedlist (202) including a list of data items (211) for crawling by a search engine (220). The data items (211) are owned by the first application (201). A second seedlist (206) is also provided from a second independent application (205), the second seedlist (206) including annotation data (214) for crawling by a search engine (220). The annotation data (214) relates to the data items (211) of the first application (201). A search index (204) provides searchable data from the two or more applications (201, 205), the searchable data relating to the same set of data items (211).
摘要翻译：提供了一种在独立应用程序中进行搜索的方法和系统。从第一应用（201）提供第一种子列表（202），第一种子列表（202）包括用于由搜索引擎（220）爬行的数据项列表（211）。数据项（211）由第一应用程序（201）拥有。还从第二独立应用程序（205）提供第二种子列表（206），第二种子列表（206）包括用于由搜索引擎（220）爬行的注释数据（214）。注释数据（214）涉及第一应用（201）的数据项（211）。搜索索引（204）提供来自两个或多个应用程序（201,205）的可搜索数据，涉及同一组数据项（211）的可搜索数据。

9. 发明申请

US20060156277A1 System and method for utilizing non-EMF based objects in an EMF environment 失效
公开(公告)号：US20060156277A1
公开(公告)日：2006-07-13
申请号：US11033772
申请日：2005-01-12
申请人： Titania Gupta , Laurent Hasson
发明人： Titania Gupta , Laurent Hasson
IPC分类号： G06F9/44
CPC分类号： G06F9/4493
摘要： A system, method and program product for generating artifacts that can convert back and forth between non-EMF (Eclipse Modeling Framework) objects and EMF-based objects in an EMF-based runtime environment such as Web Data Objects (WDO) or Service Data Objects (SDO). Included is a system for inputting one or more non EMF application classes such as Java Beans and generating artifacts that include: a source meta model (ecore) that describes the data model defined by the input application classes; an EMap file that contains mappings between the classes and properties of the non-EMF objects and the EMF Objects; a target meta model (ecore) which represents the source meta model as transformed by the emap mappings; and a set of java classes (Mediators and DiffHandlers) that will at runtime perform the transformation between the two environments (non-EMF and EMF based objects).

10. 发明授权

US08838571B2 Data-discriminate search engine updates 有权
标题翻译：数据区分搜索引擎更新
公开(公告)号：US08838571B2
公开(公告)日：2014-09-16
申请号：US12825301
申请日：2010-06-28
申请人： Shai Erera , Laurent Hasson , Eitan Shapiro
发明人： Shai Erera , Laurent Hasson , Eitan Shapiro
IPC分类号： G06F17/30
CPC分类号： G06F17/30864
摘要： Techniques are provided for data-discriminate search engine updates, where, in accordance with a first crawling session frequency associated with a first update type, a search engine index is updated by recording an update to a first set of data, where the update to the first set of data is of the first update type, and, in accordance with a second crawling session frequency associated with a second update type, the search engine index is updated by recording an update to a second set of data, where the update to the second set of data is of the second update type, where the first crawling session frequency is of a different frequency than the second crawling session frequency.
摘要翻译：提供用于数据鉴别搜索引擎更新的技术，其中根据与第一更新类型相关联的第一爬行会话频率，通过将更新记录到第一组数据来更新搜索引擎索引，其中更新到第一组数据是第一更新类型，并且根据与第二更新类型相关联的第二爬行会话频率，通过将更新记录到第二组数据来更新搜索引擎索引，其中更新为第二组数据是第二更新类型，其中第一爬行会话频率具有与第二爬行会话频率不同的频率。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式