公开(公告)号：US20060168115A1

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

申请号：US11303375

申请日：2005-12-16

申请人： David Loupia ,  Marc Fiammante ,  Lionel Mommeja

发明人： David Loupia ,  Marc Fiammante ,  Lionel Mommeja

IPC分类号： G06F15/16

CPC分类号： G06F8/38

摘要： A system and method for automatically generating web services from an existing web site having web page based business processes or transactions. A script is generated representative of the user navigation sequence involved to perform the transaction. The script elements include the web application calls, input/output parameters, and the interrelation between the elements of the transaction. A WSDL file, web service interface code, and web service implementation code are automatically, i.e. computer-aided, generated from the navigation script without a user required to have advance programming skills. The web service may be published locally to the web site or on a remote site.

摘要翻译： 一种用于从具有基于网页的业务流程或事务的现有网站自动生成Web服务的系统和方法。 生成代表用于执行交易的用户导航序列的脚本。 脚本元素包括Web应用程序调用，输入/输出参数以及事务元素之间的相互关系。 WSDL文件，Web服务接口代码和Web服务实现代码是自动地，即由计算机辅助的，从导航脚本生成的，而不需要用户具有高级编程技能。 Web服务可以在本地发布到网站或远程站点上。

公开(公告)号：US09558296B2

公开(公告)日：2017-01-31

申请号：US12353195

申请日：2009-01-13

申请人： Matthias Gruetzner ,  Witold Szczeponik ,  Stefan Puehl ,  Marc Fiammante

发明人： Matthias Gruetzner ,  Witold Szczeponik ,  Stefan Puehl ,  Marc Fiammante

IPC分类号： G06F17/30

CPC分类号： G06F17/30958

摘要： The invention relates to a computerized method for processing a graph containing a set of nodes processing a graph containing a set of nodes, wherein forest of trees is provided corresponding to a directed acyclic graph containing a set of nodes, each of said nodes having a type chosen from a set of types; a depth for each node in said forest of trees is determined; in a breadth-first traversal manner, the depth and type of each node in said forest of trees is compared to a predefined matrix, said matrix defining for each depth and type combination one of the following actions to be carried out: no action, creating a new sub-tree, triggering exception handling.

摘要翻译： 本发明涉及一种用于处理包含处理包含一组节点的图的节点集合的图的计算机化方法，其中森林对应于包含一组节点的有向非循环图，每个所述节点具有类型 从一组类型中选出; 确定所述森林中每个节点的深度; 以广度优先遍历方式，将所述森林中的每个节点的深度和类型与预定矩阵进行比较，所述矩阵为每个深度和类型组合定义要执行的以下动作之一：无动作，创建 一个新的子树，触发异常处理。

公开(公告)号：US20090138686A1

公开(公告)日：2009-05-28

申请号：US12353195

申请日：2009-01-13

申请人： Matthias Gruetzner ,  Witold Szczeponik ,  Stefan Puehl ,  Marc Fiammante

发明人： Matthias Gruetzner ,  Witold Szczeponik ,  Stefan Puehl ,  Marc Fiammante

IPC分类号： G06F9/30

CPC分类号： G06F17/30958

摘要： The invention relates to a computerized method for processing a graph containing a set of nodes processing a graph containing a set of nodes, wherein forest of trees is provided corresponding to a directed acyclic graph containing a set of nodes, each of said nodes having a type chosen from a set of types; a depth for each node in said forest of trees is determined; in a breadth-first traversal manner, the depth and type of each node in said forest of trees is compared to a predefined matrix, said matrix defining for each depth and type combination one of the following actions to be carried out: no action, creating a new sub-tree, triggering exception handling.

摘要翻译： 本发明涉及一种用于处理包含处理包含一组节点的图的节点集合的图的计算机化方法，其中森林对应于包含一组节点的有向非循环图，每个所述节点具有类型 从一组类型中选出; 确定所述森林中每个节点的深度; 以广度优先遍历方式，将所述森林中的每个节点的深度和类型与预定矩阵进行比较，所述矩阵为每个深度和类型组合定义要执行的以下动作之一：无动作，创建 一个新的子树，触发异常处理。

公开(公告)号：US07992127B2

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

申请号：US11303375

申请日：2005-12-16

申请人： David Loupia ,  Marc Fiammante ,  Lionel Mommeja

发明人： David Loupia ,  Marc Fiammante ,  Lionel Mommeja

IPC分类号： G06F9/44 ,  G06F3/00

CPC分类号： G06F8/38

摘要： A system and method for automatically generating web services from an existing web site having web page based business processes or transactions. A script is generated representative of the user navigation sequence involved to perform the transaction. The script elements include the web application calls, input/output parameters, and the interrelation between the elements of the transaction. A WSDL file, web service interface code, and web service implementation code are automatically, i.e. computer-aided, generated from the navigation script without a user required to have advance programming skills. The web service may be published locally to the web site or on a remote site.

摘要翻译： 一种用于从具有基于网页的业务流程或事务的现有网站自动生成Web服务的系统和方法。 生成代表用于执行交易的用户导航序列的脚本。 脚本元素包括Web应用程序调用，输入/输出参数以及事务元素之间的相互关系。 WSDL文件，Web服务接口代码和Web服务实现代码是自动地，即由计算机辅助的，从导航脚本生成的，而不需要用户具有高级编程技能。 Web服务可以在本地发布到网站或远程站点上。

公开(公告)号：US20060075359A1

公开(公告)日：2006-04-06

申请号：US11245230

申请日：2005-10-05

申请人： Frederic Bauchot ,  Jean-Luc Collet ,  Marc Fiammante ,  Gerard Marmigere ,  Joaquin Picon

发明人： Frederic Bauchot ,  Jean-Luc Collet ,  Marc Fiammante ,  Gerard Marmigere ,  Joaquin Picon

IPC分类号： G06F3/00

CPC分类号： G06F9/4443 ,  G06F3/0481 ,  G06F9/451

摘要： A method and system for managing overlapping windows on a computer screen of a computer system. A hook filter intercepts an event that has occurred. An association of the hook filter with the event was established prior to the occurrence of the event. The event is characterized by an overlapping condition in which a floating window partially or totally overlaps an active window on the computer screen. A software application is associated with the active window. Response to intercepting the event, the hook filter detects the overlapping condition. Response to detecting the overlapping condition, the hook filter eliminates the overlapping condition to make the active window totally visible.

摘要翻译： 一种用于管理计算机系统的计算机屏幕上的重叠窗口的方法和系统。 挂钩过滤器拦截已发生的事件。 挂钩过滤器与事件的关联在事件发生之前建立。 该事件的特征在于重叠状态，其中浮动窗口部分或全部与计算机屏幕上的活动窗口重叠。 软件应用程序与活动窗口相关联。 响应拦截事件，挂钩过滤器检测重叠状态。 响应检测重叠条件，挂钩过滤器消除了重叠条件，使活动窗口完全可见。

公开(公告)号：US20050132381A1

公开(公告)日：2005-06-16

申请号：US11006799

申请日：2004-12-06

申请人： Marc Fiammante ,  Lionel Mommeja

发明人： Marc Fiammante ,  Lionel Mommeja

IPC分类号： G06Q99/00 ,  G06F9/44 ,  G06F9/46 ,  G06F15/16

CPC分类号： G06F8/24

摘要： The invention concerns a method of automatically generating and/or modifying service interfaces for web services implemented on a Services Oriented Architecture (SOA) in response to recurring usage patterns identified from logged service usage data. An analyzer identifies recurring usage patterns and an inference engine determines from the usage patterns the fine-grained service definitions comprising frequently used services. A service generator creates new service definitions from the fine-grained service definitions in accordance with a set of rules.

摘要翻译： 本发明涉及一种自动生成和/或修改在面向服务体系结构（SOA）上实现的Web服务的服务接口的方法，以响应从记录的服务使用数据识别的循环使用模式。 分析器识别循环使用模式，推理引擎根据使用模式确定包含经常使用的服务的细粒度服务定义。 服务生成器根据一组规则从细粒度的服务定义创建新的服务定义。

公开(公告)号：US06523171B1

公开(公告)日：2003-02-18

申请号：US09450076

申请日：1999-11-29

申请人： Jean-Christophe Dupuy ,  Martine Linares-Langloys ,  Rémi Piro ,  Marc Fiammante ,  Eric Menguy ,  Patrick Boeuf

发明人： Jean-Christophe Dupuy ,  Martine Linares-Langloys ,  Rémi Piro ,  Marc Fiammante ,  Eric Menguy ,  Patrick Boeuf

IPC分类号： G06F945

CPC分类号： G06F8/51

摘要： A method for translating source code programs written in a procedural computer language in source code programs written in an Object Oriented language. The method of the invention provides a parser which adds to the lexicographic and syntactical analysis of the source code a semantic analysis: a parser is written for identifying the semantic patterns in the source code. At execution, the parser reads the instructions of the procedural language and classify the sequences of instructions identified as using a known pattern. According to the matched patterns, the parser creates different categories of classes containing both functional (linearly translated code) or references to other object instances. Each time an object is discovered in the code it is stored in an Object Dictionary with its description and reused when referred later in the code. The parser is executed for each program and at each execution new classes and new objects are created; when all the programs are translated the OO classes and objects form the target object model.

摘要翻译： 一种以面向对象语言编写的源代码程序中用程序计算机语言编写的源代码程序的方法。 本发明的方法提供了一种解析器，其将源代码的词典和语法分析添加到语义分析中：解析器被编写用于识别源代码中的语义模式。 在执行时，解析器读取程序语言的指令，并将识别为使用已知模式的指令序列进行分类。 根据匹配的模式，解析器创建不同类别的类，包含功能（线性转换代码）或对其他对象实例的引用。 每次在代码中发现一个对象时，它将被存储在一个具有其描述的对象字典中，并在代码中稍后引用时被重用。 为每个程序执行解析器，并在每次执行时创建新类和新对象; 当所有程序被翻译时，OO类和对象形成目标对象模型。

公开(公告)号：US6081532A

公开(公告)日：2000-06-27

申请号：US733488

申请日：1996-10-18

申请人： Marc Fiammante

发明人： Marc Fiammante

IPC分类号： H04L12/18 ,  H04L12/46 ,  H04L12/56 ,  H04L12/28 ,  H04L12/54

CPC分类号： H04L12/46 ,  H04L12/18 ,  H04L47/10

摘要： A bridging apparatus for receiving and transmitting broadcast and non-broadcast frames from a first communication network to a second communication network in a network system, is provided. The bridging apparatus includes storage memory for storing the broadcast frames and the non-broadcast frames, and filtering arrangement for controlling and balancing the transmission of the frames to the second communication network. The filtering is performed by alternatively reading and sending a first number of broadcast frames and a second number of non-broadcast frames to the second communication network. The number of broadcast frames and non-broadcast frames being read and send alternatively is based upon the characteristics of the communication networks.The bridging system of the invention further permits to discard either broadcast frames or non-broadcast frames that are received from a first network, when the capacity of the memory in which each type of frame is stored is reached.The system disclosed also permits that a broadcast frame received from a same station may be discarded if it is received within a variable delay. This delay may be defined with respect to the characteristics of the networks, or may be dynamically computed with respect to the time at which the last broadcast frame received from the same station has not been successfully transmitted to the second network.

摘要翻译： 提供了一种用于在网络系统中从第一通信网络向第二通信网络接收和发送广播和非广播帧的桥接装置。 桥接装置包括用于存储广播帧和非广播帧的存储存储器，以及用于控制和平衡帧到第二通信网络的传输的过滤装置。 通过交替地向第二通信网络读取和发送第一数量的广播帧和第二数量的非广播帧来执行过滤。 正在读取和发送的广播帧和非广播帧的数量是基于通信网络的特性。 当达到存储每种类型的帧的存储器的容量时，本发明的桥接系统还允许丢弃从第一网络接收到的广播帧或非广播帧。 所公开的系统还允许如果在可变延迟内接收到的，则可以丢弃从同一站接收的广播帧。 可以相对于网络的特性定义该延迟，或者可以相对于从同一站接收的最后一个广播帧尚未成功发送到第二网络的时间动态地计算该延迟。