Abstract: Techniques are described for graph-based analysis of data generated on sensor networks, such as Internet-of-Things (IoT) networks. Data may be collected from various computing devices, or sensors, on a network. The data is discretized and analyzed to provide a graphical representation of at least a portion of the data. In some instances, the graph may be determined based on various relationships between nodes that correspond to discrete portions of the data, and the relationships between nodes may be time-based correlations between the data of the nodes. The graph accumulates, compresses, and organizes the data to enable efficient data visualization, analysis, alert generation, and/or other activities. A previously generated version of a graph may be compared to a current version to identify a changing situation, such as new usage of the monitored devices, failure or anomalous behavior of the devices, and so forth.

Abstract: A method, a system, and a computer program product for generating a customized user interface variant of a software application are disclosed. At least one configuration parameter in a plurality of configuration parameters is received. The configuration parameter is used for configuring a user interface of the software application. Based on the configuration parameter, the software application accesses at least one business process to generate the configured user interface. At least one requirement in a plurality of requirements of the business process is linked to the configuration parameter. The configured user interface can be generated based on the configuration parameter and the linking of the requirement of the business process and the configuration parameter.

Abstract: The present disclosure involves systems, software, and computer implemented methods for deploying changes in a multi-tenancy database system. One example method includes upgrading at least one tenant database container in a database system. Table structure differences and table sharing type differences are determined by comparing tables in a current-version shared container to tables in a next-version shared container. A current key pattern configuration in the current-version shared container is compared to an updated key pattern configuration in the next-version shared container to identify key pattern configuration differences. Each table in the at least one tenant database container is upgraded based on the table structure differences, the table sharing type differences, and the key pattern configuration differences.

Abstract: Various embodiments of systems and methods to provide a testing framework for testing code are described herein. In one aspect, a request to test at least a portion of code is received. A test model composed of model elements representing the portion of the code, code on which the portion of the code depends and one or more preexisting test doubles is generated. An option is provided to define one or more test double elements, in the test model, corresponding to the code on which the portion of the code depends. Further, an option is provided to alter dependencies between the model elements and the defined one or more test double elements in the test model. Furthermore, new one or more code artefacts are generated based on the test model and the generated new one or more code artefacts are executed to test logic of the portion of the code.

Abstract: The disclosure generally describes methods, software, and systems, including a method for defining and using dependencies and equivalences for data elements in the data model in order to improve query efficiency. At design time of a data model, dependencies and equivalences for data elements in the data model are received over a computer network. The dependencies and equivalences are stored in persistent storage with the data model. A request is received over the computer network, the request to be executed to obtain results from a database associated with the data model. An optimized query is generated using the received request and the dependencies and equivalences. The optimized query is optimized relative to the received request.

Abstract: A method can include: reordering an enriched inverted index associated with a database, the enriched inverted index including a first inverted list having a first plurality of current document identifiers of records that contain a first data value, the enriched inverted index further including a first data structure storing enrichment data, the reordering of the enriched inverted index comprising: generating an ordinal sequence corresponding to an order of a first plurality of current document identifiers that include a change of at least one of the first plurality of current document identifiers to a new document identifier; determining a reordered ordinal sequence corresponding to a sorted order of the second plurality of document identifiers; separately reordering, based at least on the reordered ordinal sequence, the first plurality of current document identifiers in the first inverted list and the enrichment data in the first data structure.

Abstract: Some embodiments provide a program that retrieves a set of notifications describing failures that occurred on a set of monitored devices. The program further determines a set of topics based on the set of notifications. The program also determines failure modes associated with the set of topic from a plurality of failure modes defined for the set of monitored devices. The program further determines failure modes associated with the set of notifications based on the set of topics and the failure modes associated with the set of topics. The program also receives a particular notification that includes a particular set of words describing a failure that occurred on a particular monitored device in the set of monitored devices. The program further determines a failure mode associated with the particular notification based on the particular set of words and the determined failure modes associated with the set of notifications.

Abstract: Embodiments of the present disclosure pertain to accessing computing resources. In one embodiment, the present disclosure includes a computer implemented method comprising storing at least one credential for accessing a first system, storing a plurality of user credentials for a plurality of users having access to a second system, linking the plurality of user credentials for the plurality of users having access to the second system to the at least one credential for accessing the first system, receiving a first user credential for a first user from the second system over a first connection, authenticating the first user credential, wherein the first user credential is authenticated when the first user credential matches one of the stored plurality of user credentials, and establishing a second connection between the first system and the second system using the at least one credential when the first user credential is authenticated.

Abstract: Embodiments of the present disclosure pertain to matching transactional data. In one embodiment, the present disclosure includes a computer implemented method comprising receiving transactional data for a first user and second data for the first user, selecting transactional data records for the first user from a data store of transactional data for a plurality of users, determining a plurality of similarities between fields of the transactional data and second data, determining a likelihood of a match between a transactional data field and a second data field based on the plurality of similarities using a machine learning model, and in accordance therewith, identifying one record in the transactional data records for the first user that generates said likelihood of the match above a first threshold, and replacing values second data fields with corresponding values in the one record.

Abstract: An event bus is instantiated for subscribing applications for notifications in relation to cached results. The cached results may be associated with executed requests sent by the applications to services. It is determining whether a result value associated with a request from a first application to a remote service is cached. When the result value is blank, the first application is subscribed for an event associated with request parameters, defined with the request from the first application. A result event associated with caching the result value is published, e.g. at the event bus. The result value is determined based on executing a request sent by a second application, which defines the request parameters and is sent to the remote service prior to the request from the first application. A notification is provided to the first application with regards to the result event.

Abstract: A system includes multiple memory modules arranged and configured to store data and at least one processor that is operably coupled to the memory modules. The at least one processor is arranged and configured to select an access pattern of a forecast model, determine a storage layout model based on the identified access pattern of the forecast model, and store values in an order defined by the storage layout model using at least one of the memory modules. The order of the stored values enables sequential access to the stored values for use in the forecast model. Implementations of one or more features of the system may be performed by a computer-implemented method and/or a computer program product.

Abstract: A computerized method, system and medium for providing compatibility between systems associated with incompatible object key domains, where a first system is associated with a legacy key domain and a second system with an extended key domain relative to the first system. One example method can include receiving a request associated with a business object instance, wherein the request includes a first logical object key in a legacy format from the first system. The first logical key is converted from the legacy format into a second object key in an extended format. The request is processed and a response is generated based on the processing of the business object instance and includes the second object key, which is converted into the first logical key of the first system prior to sending the response to the received request to the first system. The generated response is sent to the first system.

Abstract: A system for cache efficient reading of column values in a database is provided. In some aspects, the system performs operations including pre-fetching, asynchronously and in response to a request for data in a column store database system, a plurality of first values associated with the requested data. The request may identify a row of the column store database system associated with the requested data. The plurality of first values may be located in the row. The operations may further include storing the plurality of first values in a cache memory. The operations may further include pre-fetching, asynchronously and based on the plurality of first values, a plurality of second values. The operations may further include storing the plurality of second values in the cache memory. The operations may further include reading, in response to the storing the plurality of second values, the requested data from the cache memory.

Abstract: Methods and apparatus, including computer program products, are provided for document synchronization. The method may include generating, by a controller, a first proxy object for a first document at a first system, the first system including the controller and the first proxy object; updating, by the controller, the first proxy object to include a replication status of the first document, when a creation, an update, and/or a deletion occurs at the first document. Related apparatus, systems, methods, and articles are also described.

Abstract: A system for differential privacy is provided. In some implementations, the system performs operations comprising receiving a plurality of indices for a plurality of perturbed data points, which are anonymized versions of a plurality of unperturbed data points, wherein the plurality of indices indicate that the plurality of unperturbed data points are identified as presumed outliers. The plurality of perturbed data points can lie around a first center point and the plurality of unperturbed data points can lie around a second center point. The operations can further comprise classifying a portion of the presumed outliers as true positives and another portion of the presumed outliers as false positives, based upon differences in distances to the respective first and second center points for the perturbed and corresponding (e.g., same index) unperturbed data points. Related systems, methods, and articles of manufacture are also described.

Abstract: A proposed solution to analyze event data from sensors of devices of a manufacturing environment to identify relationships of events to predict faults in devices is disclosed. The analysis includes conditional probability model and Apriori model. The relationships are used to determine a device health index which is compared to real-time event data to predict faults in a device.

Abstract: Methods and system are disclosed that optimize memory consumed, by sharing datasets between workspaces. In one aspect, multiple workspaces may be instantiated by retrieving multiple datasets from multiple data sources. An input to execute transformations on the multiple datasets may be received. Based on a determination of execution of a transformation on the multiple datasets, a dataset context analyzer may be executed to analyze a current context of data in the multiple datasets. Based on a result of execution of the dataset context analyzer, a transformation graph analyzer may be executed to compute a current context of transformations on the multiple datasets. Based on the determined current context of data and the current context of the transformations on the dataset, memory consumed may be optimized by sharing the multiple datasets between the multiple workspaces.

Abstract: Technologies are described for restarting an application while maintaining data in memory (e.g., using shared memory). For example, shared memory can be associated with an application. The shared memory can also be associated with a holder process to maintain the shared memory from the time the application stops to the time the application starts again. When the application starts, the shared memory can be associated with the started application. In addition, restart of in-memory databases can be provided using shared memory. For example, in-memory data can be maintained when a database process or database management system stops and starts (e.g., during a restart).

Abstract: A process is provided for independently hashing and filtering a data set, such as during preprocessing. For the data set, one or more records, separately having one or more fields, may be identified. A record hash value set, containing one or more record hash values for the respective one or more records, may be generated. Generating a given record hash value may be accomplished as follows. For a given record, a hash value set may be generated, having one or more field hash values for the respective one or more fields of the given record. The record hash value for the given record may be generated based on the hash value set. A total hash value for the data set may be generated based on the record hash value set. The records of the data set may be filtered based on classification of the query that generated the records.

Abstract: An integrity check for a first file is initiated. In response, a first key corresponding to the first file is obtained. The first file is hashed to determine that the first key is not equivalent to the hashed first file. A second key is then obtained that corresponds to the hashed first file. A second file is then obtained using the second key. This second file is hashed to determine whether the second key is equivalent to the hashed second file. Integrity of the first file is confirmed if the second key is equivalent to the hashed second file or integrity of the first file is rejected if the second key is not equivalent to the hashed second file. Related apparatus, systems, techniques and articles are also described.