公开(公告)号：US09832268B2

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

申请号：US14471088

申请日：2014-08-28

申请人： Software AG USA Inc.

发明人： Gagan Mehra

IPC分类号： G06F15/16 ,  H04L29/08 ,  H04L29/06

CPC分类号： H04L67/1097 ,  H04L67/10 ,  H04L67/1091 ,  H04L67/322 ,  H04L67/42

摘要： An in-memory data grid (IMDG) server includes an i/o interface for transmitting and receiving data over a network. A random access memory (RAM) is configured with the IMDG which stores plural different data sets that may be requested for retrieval by applications that can connect to the IMDG server through the network. A processor receives requests for retrieval of data from the IMDG data sets, and sends the requested data to the requesting application. The IMDG server also includes a request prioritizer that determines, when two or more applications, which are competing applications that defined as having requests co-pending at the IMDG server to retrieve one or more of the data sets, which of the competing applications has the highest priority relative to the other competing applications. The request prioritizer causes a data set requested by the application with the highest priority to be handled before requests from the applications.

公开(公告)号：US09830356B2

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

申请号：US14333740

申请日：2014-07-17

申请人： Software AG USA, Inc.

发明人： Gagan Mehra ,  Foram Gandhi ,  Steve Yellenberg

IPC分类号： G06F3/00 ,  G06F17/30 ,  G06F12/0871 ,  G06F12/126 ,  G06F13/38 ,  G06F13/10 ,  G06F9/44

CPC分类号： G06F17/3048 ,  G06F9/4411 ,  G06F12/0871 ,  G06F12/126 ,  G06F13/102 ,  G06F13/385

摘要： Certain example embodiments relate to memory management techniques that enable users to “pin” elements to particular storage tiers (e.g., RAM, SSD, HDD, tape, or the like). Once pinned, elements are not moved from tier-to-tier during application execution. A memory manager, working with at least one processor, receives requests to store and retrieve data during application execution. Each request is handled using a non-transitory computer readable storage medium (rather than a transitory computer readable storage medium), if the associated data is part of a data cache that is pinned to the non-transitory computer readable storage medium, or if the associated data itself is pinned to the non-transitory computer readable storage medium. If neither condition applies, the memory manager determines which one of the non-transitory and the transitory computer readable storage mediums should be used in handling the respective received request, and handles the request accordingly.

公开(公告)号：US09760549B2

公开(公告)日：2017-09-12

申请号：US14108762

申请日：2013-12-17

申请人： Software AG USA, Inc.

发明人： Bernard J. Style

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

CPC分类号： G06F17/2247 ,  G06F17/30492 ,  G06F17/30917

摘要： Certain example embodiments described herein relate to techniques for processing XML documents of potentially very large sizes. For instance, certain example embodiments parse a potentially large XML document, store the parsed data and some associated metadata in multiple independent blocks or partitions, and instantiate only the particular object model object requested by a program. By including logical references rather than physical memory addresses in such pre-parsed partitions, certain example embodiments make it possible to move the partitions through a caching storage hierarchy without necessarily having to adjust or encode memory references, thereby advantageously enabling dynamic usage of the created partitions and making it possible to cache an arbitrarily large document while consuming a limited amount of program memory. Such techniques may be extended to enable atomic updates to be processed efficiently, e.g., by maintaining commit level information in a partition list and optionally implementing document shadowing.

公开(公告)号：US09471629B2

公开(公告)日：2016-10-18

申请号：US14255362

申请日：2014-04-17

申请人： Software AG USA Inc.

发明人： Karthic Thope ,  John Crupi ,  Daniel Malks

IPC分类号： G06F17/30

CPC分类号： G06F17/30424

摘要： A computer system, a computer-readable non-transitory medium, and/or a computer-implemented method generates analytics applicable to data of an undetermined structure and type. A processor device receives data formatted in an undetermined structure. The processor device discovers, in a cross filter model processor, dynamically in response to receiving the data in the undetermined structure, a structure and a data type of the data which was received in the undetermined structure. The processor device determines, in response to the structure and the data type of the data discovered by the cross filter model processor, which of a plurality of analytic queries are applicable to the data.

摘要翻译： 计算机系统，计算机可读的非暂时介质和/或计算机实现的方法产生适用于未确定的结构和类型的数据的分析。 处理器设备接收以未确定结构格式化的数据。 处理器设备在交叉滤波器模型处理器中动态响应于以未确定的结构接收数据，在未确定的结构中接收的数据的结构和数据类型。 处理器设备响应于由过滤器模型处理器发现的数据的结构和数据类型来确定多个分析查询中的哪一个适用于数据。

公开(公告)号：US09465752B2

公开(公告)日：2016-10-11

申请号：US14569026

申请日：2014-12-12

申请人： Software AG USA, Inc.

发明人： Manish Devgan

IPC分类号： G06F12/00 ,  G06F13/00 ,  G06F13/28 ,  G06F12/14 ,  G06F12/08

CPC分类号： G06F12/1483 ,  G06F12/0811 ,  G06F12/0813 ,  G06F12/0815 ,  G06F12/0866 ,  G06F12/0868 ,  G06F12/0897 ,  G06F12/1458 ,  G06F2212/1052 ,  G06F2212/60

摘要： Certain example embodiments provide efficient policy-based access to data stored in memory tiers, including volatile local in-process (L1) cache memory of an application and at least one managed (e.g., non-volatile) in-memory (L2) cache. Operations include receiving an access request for access to a data element in L2; detecting whether a copy of the data element is in L1; if so, copying the data element and the access policy from L2 to L1 and providing the user with access to the copy of data element from L1 if the access policy allows access to the user; and if not, determining, by referring to a copy of the access policy stored in L1, whether the user is allowed to access the data element, and, if the user is allowed to access the data element, providing the user with access to the copy of the data element from the L1 cache memory.

摘要翻译： 某些示例性实施例提供对存储在存储器层中的数据的有效的基于策略的访问，包括应用的易失性本地进程（L1）高速缓存存储器和至少一个被管理（例如，非易失性）存储器（L2）高速缓存。 操作包括在L2中接收访问数据元素的访问请求; 检测数据元素的副本是否在L1中; 如果是，则将数据元素和访问策略从L2复制到L1，并且如果访问策略允许访问用户，则向用户提供对来自L1的数据元素的副本的访问; 如果不是，则通过参考存储在L1中的访问策略的副本来确定是否允许用户访问数据元素，并且如果允许用户访问数据元素，则向用户提供对 数据元素从L1高速缓存存储器复制。

公开(公告)号：US08954371B2

公开(公告)日：2015-02-10

申请号：US13524360

申请日：2012-06-15

申请人： Barry S. Dresdner ,  Son T. Nguyen

发明人： Barry S. Dresdner ,  Son T. Nguyen

IPC分类号： G06F17/00 ,  G06N5/02

CPC分类号： G06N5/02 ,  G06N5/025

摘要： Certain example embodiments described herein relate to techniques for dynamically selecting rule processing modes. The processing mode does not need to be specified during rule design/authoring. Two sets of artifacts may be generated to support a desired processing mode. This may occur in the designer's local workspace, e.g., so that rule invocation can be tested locally. Additionally, or alternatively, both sets of artifacts may be installed on the rule engine running on a remote server when the project is deployed. The designer need not be aware that both sets of artifacts are being generated. In certain example embodiments, the designer may have the ability to sequence rules within metaphors (or decision entities such as decision tables), and/or the ability to sequence metaphors within rule sets. During rule invocation, a parameter may be provided to indicate the processing mode (e.g., sequential or inferential) to be used by the rule engine.

摘要翻译： 这里描述的某些示例实施例涉及用于动态选择规则处理模式的技术。 在规则设计/创作过程中，不需要指定处理模式。 可以生成两组伪影以支持期望的处理模式。 这可能发生在设计人员的本地工作区中，例如，可以在本地测试规则调用。 另外或替代地，当部署项目时，两组工件可以安装在在远程服务器上运行的规则引擎上。 设计者不需要知道正在生成两组工件。 在某些示例性实施例中，设计者可能具有在隐喻（或决策实体，例如决策表）中排序规则的能力，和/或在规则集内对序列隐喻进行排序的能力。 在规则调用期间，可以提供参数以指示要由规则引擎使用的处理模式（例如，顺序或推断）。

公开(公告)号：US20140181306A1

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

申请号：US13799562

申请日：2013-03-13

申请人： SOFTWARE AG USA, INC.

发明人： Vasudeva Kothamasu ,  Devashish Karecha ,  Warren H. Cooper, JR. ,  Sachin Gadre ,  Shih-Min Sidney Pao

IPC分类号： H04L12/24

CPC分类号： H04L41/5077 ,  G06F9/5072

摘要： Certain example embodiments provide a generic integration framework for connecting on-premises applications with software as a service (SaaS) applications, and/or for integrating the same. The framework of certain example embodiments involves a layered approach (including a Connector Development Kit, connection factory, metadata handlers, and connector services) that helps to, among other things, allow customization of applications in multi-tenant architectures. Design-time wizards help create runtime artifacts and, during runtime, the connector service helps serve as an intermediary between the on-premises application and the cloud service, thereby hiding the complexity of the specific cloud providers. Certain example embodiments advantageously provide a generic and well-integrated solution for connecting an on-premises application to a cloud service in connection with existing containers.

摘要翻译： 某些示例性实施例提供用于将本地应用与软件即服务（SaaS）应用连接和/或用于集成该应用的通用集成框架。 某些示例性实施例的框架涉及分层方法（包括连接器开发套件，连接工厂，元数据处理程序和连接器服务），其有助于除其他之外允许在多租户体系结构中定制应用程序。 设计时向导可帮助创建运行时工件，并且在运行时期间，连接器服务有助于作为内部部署应用程序和云服务之间的中介，从而隐藏特定云提供商的复杂性。 某些示例实施例有利地提供了用于将内部部署应用程序与现有容器相关联的云服务连接的通用和良好集成的解决方案。

公开(公告)号：US20140026027A1

公开(公告)日：2014-01-23

申请号：US13551891

申请日：2012-07-18

申请人： Bernard J. STYLE

发明人： Bernard J. STYLE

IPC分类号： G06F17/00

CPC分类号： G06F17/30492 ,  G06F17/30917

摘要： Certain example embodiments described herein relate to techniques for processing XML documents of potentially very large sizes. For instance, certain example embodiments parse a potentially large XML document, store the parsed data and some associated metadata in multiple independent blocks or partitions, and instantiate only the particular object model object requested by a program. By including logical references rather than physical memory addresses in such pre-parsed partitions, certain example embodiments make it possible to move the partitions through a caching storage hierarchy without necessarily having to adjust or encode memory references, thereby advantageously enabling dynamic usage of the created partitions and making it possible to cache an arbitrarily large document while consuming a limited amount of program memory.

摘要翻译： 本文描述的某些示例实施例涉及用于处理潜在非常大尺寸的XML文档的技术。 例如，某些示例性实施例解析潜在的大型XML文档，将解析的数据和一些相关联的元数据存储在多个独立的块或分区中，并仅实例化由程序请求的特定对象模型对象。 通过在这样的预先分析的分区中包括逻辑引用而不是物理存储器地址，某些示例性实施例使得可以通过高速缓存存储层级移动分区，而不必必须调整或编码存储器引用，从而有利地实现所创建的分区的动态使用 并且可以在消耗有限量的程序存储器的同时缓存任意大的文档。

公开(公告)号：US08453163B2

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

申请号：US12458030

申请日：2009-06-29

申请人： Vasudeva Kothamasu ,  Derek Rokicki ,  Jason Simpson

发明人： Vasudeva Kothamasu ,  Derek Rokicki ,  Jason Simpson

IPC分类号： G06F9/54

CPC分类号： H04L51/14 ,  H04L67/1002 ,  H04L67/1006 ,  H04L67/1017 ,  H04L67/1019

摘要： The example embodiments disclosed herein relate to application integration techniques and, more particularly, to application integration techniques built around the publish-and-subscribe model (or one of its variants). In certain example embodiments, a publishing application, and first and second broker clusters are provided. Each broker cluster comprises a plurality of brokers, and each broker is configured to relay messages from the publishing application to at least one subscribing application. A composite cluster connection is associated with the publishing application, and cluster connections are associated with the composite cluster connection. The message generated by the publishing application is sent to the broker cluster in accordance with a user-defined composite policy. The message is routed from the composite cluster connection to at least one cluster connection based on a first policy layer. The messaging is routed from the at least one cluster to at least one broker based on a second policy layer.

摘要翻译： 本文公开的示例实施例涉及应用集成技术，更具体地，涉及围绕发布和订阅模型（或其变体之一）构建的应用集成技术。 在某些示例性实施例中，提供发布应用程序以及第一和第二代理程序集群。 每个代理集群包括多个代理，并且每个代理被配置为将来自发布应用的消息中继到至少一个订阅应用。 复合集群连接与发布应用程序相关联，并且集群连接与组合集群连接相关联。 由发布应用程序生成的消息将根据用户定义的组合策略发送到代理集群。 消息从复合集群连接路由到基于第一策略层的至少一个集群连接。 基于第二策略层，消息从至少一个群集路由到至少一个代理。

公开(公告)号：US10410135B2

公开(公告)日：2019-09-10

申请号：US14718277

申请日：2015-05-21

申请人： Software AG USA, Inc.

发明人： James Michael Shumpert

IPC分类号： G06N20/00 ,  G06F11/07 ,  G06F11/00

摘要： Certain example embodiments relate to techniques for detecting anomalies in streaming data. More particularly, certain example embodiments use an approach that combines both unsupervised and supervised machine learning techniques to create a shared anomaly detection model in connection with a modified k-means clustering algorithm and advantageously also enables concept drift to be taken into account. The number of clusters k need not be known in advance, and it may vary over time. Models are continually trainable as a result of the dynamic reception of data over an unknown and potentially indefinite time period, and clusters can be built incrementally and in connection with an updatable distance threshold that indicates when a new cluster is to be created. Distance thresholds also are dynamic and adjustable over time.