Abstract: A method, a computer program product, and an information handling system is provided for identifying a causal relationship between metrics performing steps. The steps include receiving a correlation significance Sij between a metric Mi and a metric Mj; receiving a mutability attribute Ai for the Mi and a mutability attribute Aj for the metric Mj from a data source; and identifying the metric Mi causing the metric Mj with the Sij if only if the Ai is immutable and the Aj is mutable.

Abstract: Systems and methods for natural language processing of structured documents. In another embodiment, in an information processing apparatus comprising at least one computer processor, a method for processing a structured document may include: (1) receiving a document; (2) parsing the document into a plurality of components using a statistical parser; (3) extracting a plurality of entities from each component; (4) identifying a potential relationship between two of the plurality of entities; (5) generating a numeric representation for the potential relationship; (6) confirming the potential relationship with a logical regression model; and (7) generating and storing a unified structured file for the document.

Abstract: An information handling system may include at least one processor and a memory coupled to the at least one processor. The information handling system may be configured to receive data comprising a plurality of data chunks; perform deduplication on the plurality of data chunks to produce a plurality of unique data chunks; determine a compression ratio for respective pairs of the unique data chunks; determine a desired compression order for the plurality of unique data chunks based on the compression ratios; combine the plurality of unique data chunks in the desired compression order; and perform data compression on the combined plurality of unique data chunks.

Abstract: A lower-level master node sends, to a higher-level master node, a table-based write set as a bundle of combinations of a shadow copy of the database and a heap tuple map expanded in a memory, and the higher-level master node that received the write set verifies whether the update has already been executed and sends the record of this update to the lower-level master node as a transaction log including a table number, whereby the database can be updated efficiently and consistently from the lower-level master node to the higher-level master node, and from the higher-level master node to the lower-level master node under its control.

Abstract: Video streaming method, including establishing first link through first radio network between transponder and server via first base station, wherein transponder receives video data from camera; establishing second link through second radio network between transponder and server via second base station; generating video stream and sending to transponder; assigning sequence numbers to packets; transmitting video stream to server through first link as first stream, and through second link as duplicate second stream; on first sponge of first radio network, receiving radio data of first stream and sending it to server as third stream; on second sponge of second radio network, receiving radio data of second stream and sending it to server as fourth stream; on server, receiving first stream through first link and third stream from first sponge, and receiving second stream through second link and fourth stream from second sponge; discarding duplicate packets; combining packets into resultant stream.

Abstract: A method may include obtaining forms each including fields each including field metadata, obtaining a schema including elements each including element metadata and defining constraints on a field of a form, identifying a corresponding element for each field, creating, for the field, a search result by combining the field metadata of the field and the element metadata of the corresponding element, adding the search result to a search results repository, receiving, from a user, a search query, in response to receiving the search query, determining, using the search results repository, search results, and ranking, using a ranking model, the search results.

Abstract: A method of transferring data to an end user via a content distribution network using an nonvolatile memory express over fabrics (NVMe-oF) device, the method including receiving a read request at the NVMe-oF device, translating a logical address corresponding to the data to a physical address, fetching the data from a flash storage of the NVMe-oF device, processing the data with a GPU that is either embedded in the NVMe-oF device, or on a same chassis as the NVMe-oF device, and transferring the data.

Abstract: Methods, and mobile devices implementing the methods, identify the types of activities performed by a software application operating on a computing device, and take responsive actions based on the detected activity types. For example, the computing device may determine an application type of the software based on metadata associated with the software application, select a lookup table based on the determined application type, determining the types of activities performed by the software application based on the selected lookup table, and select, determine or performing a responsive action based on the types of activities performed by the software application on the computing device.

Abstract: Implementations generally relate to a spreadsheet add-in that provides data entry validation. As described in more detail herein, the spreadsheet add-in integrates a spreadsheet-based table component with a remote web service. The spreadsheet add-in uses web service metadata to validate data that a user enters into the spreadsheet. The spreadsheet add-in provides immediate feedback on errors in an interactive fashion for the user. Furthermore, during a data upload process, any errors that are reported by the web service are displayed in context such that the user may quickly affect corrections.

Abstract: In a driving data analyzer, a data collector collects, from at least one vehicle, driving data sequences while each of the driving data sequences is correlated with identification data. Each driving data sequence includes sequential driving data items, and each driving data item represents at least one of a driver's operation of at least one vehicle and a behavior of the at least one vehicle based on the at least one of a driver's operation. The identification data represents a type of at least one external factor that contributes to variations in the driving data items. A feature extractor applies a data compression network model to the driving data sequences to thereby extract, from the driving data sequences, at least one latent feature independently from the type of the at least one external factor.

Abstract: A computer system is provided that stores reference data records and event data records that each correspond to one of the reference data records. Tokens are generated from the reference data records and sorted into subsets. Each reference data record that has a given token is included in the corresponding subset. A correlation value is calculated between members (e.g., the reference data records) of the subsets. The correlation values are calculated by determining a common time, calculating a reference value, calculating a percentage difference from the reference value, and then determining a correlation value (e.g., a correlation coefficient) using the percentage difference.

Abstract: Techniques are provided for compression and decompression of log data. An exemplary method comprises: obtaining a log message, wherein the log message comprises a message template and one or more message variables; obtaining a compression index that maps a plurality of message templates to a corresponding message signature; and writing the one or more message variables and a message signature corresponding to the message template of the log message to a log file. A counter may be maintained for each of a plurality of distinct message templates, and a given message signature may be assigned to a particular message template based on a length of the given message signature and a frequency of occurrence of the particular message template. The compression index comprises, for example, a key/value database where the message templates are keys and the corresponding message signatures are values of the key/value database. A decompression index maps message signatures to corresponding message templates.

Abstract: Described herein is technology for replicating data from a source database to one or more target databases at different points in time. The system receives a request to replicate a data set stored in a source database. The system stores a copy of a first subset of the data set from the source database to a target database at a first time. The system stores a copy of a second subset of the data set from the source database to the target database at a second time.

Abstract: The presently disclosed systems and methods collect information associated with client instances, and use the information associated with the instances. In particular, information related to database servers and/or applications servers providing the instance may be retrieved from databases that store information relating to instances, and written and saved in an instance configuration file. Moreover, instances may be deployed or provisioned by reading an instance configuration file and setting properties of the instance using the parameters saved in the instance configuration file. Two instance configuration files may be compared to determine differences between the two files. Additionally, the instance may be reverted back to the previously healthy version of the instance using the previous instance configuration file.

Abstract: Generating a compliance framework. The compliance framework facilitates an organization's compliance with multiple authority documents by providing efficient methodologies and refinements to existing technologies, such as providing hierarchical fidelity to the original authority document; separating auditable citations from their context (e.g., prepositions and or informational citations); asset focused citations; SNED and Live values, among others.

Abstract: A control system, a control method and an equalization apparatus for improving process control reliability are provided. In each equalization apparatus, a received-data outputting unit sends, to a network, input data from a sensor measuring a state of a process; an other-apparatus-data receiving unit acquires the input data from the received-data outputting unit and receives, from the network, input data sent from each of other equalization apparatuses than itself; and a data selecting unit selects, as output data, a representative value of the input data acquired by the other-apparatus-data receiving unit. Each computing apparatus calculates a manipulative variable of an actuator based on the output data from a corresponding equalization apparatus.

Abstract: Techniques to protect against data loss are disclosed. In various embodiments, an amount of data that has changed since a last backup of at least a defined subset of a save set is determined. The determined amount of changed data is compared to a corresponding threshold. A backup is performed based at least part on a determination that the determined amount of changed data equals or exceeds the threshold.

Abstract: The disclosure herein describes generating test data based on a set of linked data nodes and associated data value rules. A plurality of data fields of a data structure is identified. A plurality of linked data nodes is generated based on the identified data fields, wherein each data node comprises a probability value and data value rules for generating data values for the data fields. Parent nodes of the linked data nodes are collapsed into associated child nodes to form combined data nodes. Test data values for the plurality of data fields are generated based on the combined data nodes and a data structure instance is populated with the generated test data values. The populated data structure instance is provided for use in executing tests. The generation of test data based on the data value rules of linked data nodes provides a realistic data environment for testing.

Abstract: This disclosure is directed to reducing a computing operation time and reducing memory usage associated with determining at least two target data elements, associated with a target computing operation result, from a set of data elements. This disclosure can be extended to determining more than two target data elements, associated with a target computing operation result, from a set of data elements, as well.

Abstract: One example method includes creating a copy of a dataset, wherein the dataset is a backup that was previously created and stored. The copy of the dataset may be a clone, or a snapshot. The method further includes indexing a portion of the copy, mounting the copy at a proxy, associating the index with data in the copy, storing the index, and then using the index to search the copy. The search may be performed in response to a request from a user.

Abstract: A method for performing network analysis comprising: receiving telemetry information for a computer network, the telemetry information comprising network device state information for internetworking devices in the computer network and network traffic flow information for data packet flows through the computer network; transforming the telemetry information into a temporal graph that is digitally stored in computer memory, wherein the temporal graph comprises a plurality of graph elements include a plurality of vertices and a plurality of edges, each of the vertices representing an internetworking device, each of the edges representing one or more portions of a data packet flow; digitally storing graph element metadata corresponding to the plurality of graph elements in a structured format, the graph element metadata comprising temporal data for each graph element of the plurality of graph elements, the temporal data comprising a modification time value specifying a modification time that is associated with ea

Abstract: Elements can be parsed from a document instance and a first validation of each parsed element can be performed using a first schema parse tree. The first schema parse tree can include nodes for respective types of document elements expected to be encountered and that correspond to schema elements parsed from at least one schema and validated using a second schema parse tree. At least one of the nodes can be configured to call at least one validation rule, external to the first schema parse tree, which validates the element of the document instance corresponding to the node. A second validation of at least one parsed element can be performed using the validation rule called from the node to which the parsed element corresponds. The method also can include adding the validated document elements to a validation report and outputting the validation report.

Abstract: A method includes receiving, at a computing device, a media stream. The method further includes generating, at the computing device, client analytics data associated with at least one of receiving, processing, or playback of the media stream. The method further includes transmitting, from the computing device, the client analytics data to an analytics device, the client analytics data including metadata indicating that the client analytics data is associated with a particular category of data.

Abstract: A processing device receives a query comprising a first field value and a time period and performs a first search of a data store using the first field value to identify a plurality of events having the time period and a field that comprises the first field value. The processing device determines a first subset of the plurality of events associated with a first context definition and determines a plurality of fields specified in the first context definition. The processing device determines, for events in the first subset, field values of one or more fields specified in the first context definition. The processing device generates a report based on the field values of the one or more fields specified in the first context definition from the events in the first subset. The processing device generates a response to the query that comprises at least a portion of the report.

Abstract: Systems and techniques for accelerating relationship visualizations from data objects are described herein. The configuration and/or display of a relationship matrix may be automatically determined from the data objects. The relationship matrix may display relationships through gradient, hue, color, and/or saturation. The relationship matrix may be navigable and/or interactive to accelerate relationship visualizations.

Abstract: The present disclosure relates to systems, methods, and devices for sending and receiving payments using an integrated payment and messaging system. In particular, the integrated payment and messaging system allows users to send and receive electronic payments as well as exchange messages. Additional implementations involve facilitating payment transaction by inferring payment events. Still further implementations involve facilitating payment transactions between groups of users. In addition to the foregoing, one or more implementations allow a user to initiate payment transactions without first providing a payment credential.

Abstract: A computer-implemented method includes identifying one or more client-based data artefacts associated with a client device, identifying one or more backend configuration data artefacts associated with a backend device, and identifying one or more backend configuration correlation guidelines. The computer-implemented method further includes determining one or more configuration correlation conclusions based on the one or more client-based data artefacts, the one or more backend configuration data artefacts, and the one or more backend configuration correlation guidelines. A corresponding computer program product and computer system are also disclosed.

Abstract: The present application discloses a network topology self-adapting data visualization method, device, apparatus, and storage medium. The network topology self-adapting data visualization method includes: preprocessing nodes, output the preprocessed nodes; processing the preprocessed nodes by the force guidance layout algorithm to form an initial network topology graph; performing de-duplication processing for the duplicated preprocessed nodes in the initial network topology graph and outputting the de-duplicated nodes; and forming an object network topology graph on the basis of the de-duplicated nodes. By means of the network topology self-adapting data visualization method, data visualization and automation can be achieved, the data visualization processing procedure is simplified, manual intervention is not needed, the manual intervention cost can be effectively reduced, and the processing efficiency is improved.

Abstract: A method and a system for enabling multiple log record consumers to comply with regulations and requirements regarding privacy and handling of data are described. A determination, based on a log record format being of a first of the log record types, that a first field from a raw log record is to be tokenized based on a first tokenization strategy of multiple tokenization strategies in the first log record type, is performed. Each one of the tokenization strategies identifies a tokenization mechanism from tokenization mechanisms for generating a token from a raw value to enable compliance with a set of regulations and requirements regarding privacy and the handling of data. For a first raw value in the first field a first token is generated that is an anonymized representation of the first raw value using a tokenization mechanism identified by the first tokenization strategy in the log record type.

Abstract: Embodiments are directed to a method of automatically assigning proxy nodes to proxy servers in a backup system by allocating the proxy nodes to a common proxy node pool, defining rules for assignment of the proxy nodes to the proxy servers, receiving backup sessions from the proxy servers, assigning proxy nodes to the proxy servers in accordance with at least one of an order of received backup sessions and the defined rules, and returning assigned proxy nodes back to the common proxy node pool upon completion of respective backup sessions.

Abstract: A system for query planning and execution with source and/or sink operators is provided. In some implementations, the system performs operations comprising identifying a plurality of operators for executing a query, allocating space in memory for storing data when a second operator comprises a collection operator for collecting the data, generating at least a portion of the data based on executing a first operator, and providing the data (e.g., access to the data) to another operator which occurs after the first operator. In some implementations, a query plan for execution of the query can be generated to include the first operator and exclude the collection operator. Related systems, methods, and articles of manufacture are also described.

Abstract: A system performance monitor displays the performance of a system that carries out one or more tasks. The monitor has a front end including an input and output device, a back end, and one or more subsystem schema databases for storing data about said tasks. The system that carries out the tasks has subsystem schemas that have members that carry out the tasks. The records of each database are indexed by the members of the corresponding subsystem schemas. When a user selects a member of a subsystem schema, the back end retrieves the records from the database using the member index. After the records are retrieved, they are formatted to be graphically displayed on the output device. The graphical display may be a time-cloud scatter plot where each data point is located according to the start time and end time of a particular task in the retrieved records.

Abstract: Techniques for improving database searches are described herein.

Abstract: The present invention provides a fast and efficient way of processing structured data by utilizing an intermediate file to store the structural information. The structured data may be processed into a Binary mask Format (BMF) file which may serve as a starting point for post-processing. A tree structure built on top of the BMF file may be constructed very quickly, and also takes up less space than a DOM tree. Additionally, BMF records may reside entirely in the memory and contain structural information, allowing SAX-like sequential data access.

Abstract: Various technologies pertaining to extracting data encoded in a tree-structured document and generating a table based upon the extracted data are described herein. In a first embodiment, the table is generated without requiring input from a data cleaner. In a second embodiment, the table is generated based upon examples set forth by a data cleaner.

Abstract: Unstructured data items are stored in an item collection. An access request comprising an input interpretation rule and a filtering criterion is directed to at least a portion of the item collection. Records are extracted from an unstructured data item using the input interpretation rule. A response to the access request is obtained, based at least partly in a determination that one of the records satisfies the filtering criterion.

Abstract: The disclosed embodiments provide a system for processing data. During operation, the system obtains a user-defined function (UDF) that is defined using a standard UDF interface for accessing multiple platforms. Next, the system converts data in a platform into a standard form that is supported by the standard UDF interface using a platform-specific wrapper for the UDF and a platform-specific implementation of the standard UDF interface. The system then generates output data in the standard form by applying one or more operations to the data in the standard form. Finally, the system converts the output data into a platform-specific form that is supported by the platform and returns the output data in the platform-specific form.

Abstract: An online system stores objects that may be accessed by users. The online system also stores indexes of terms related to different entity types of objects. When a user provides a search query, the online system compares the search terms with terms stored in the indexes. Based on the comparisons, the online system determines term features for entity types associated with an index. The online system provides the term features as inputs to a machine learning model. The machine learning model outputs a score for each entity type indicating a likelihood that the search query is for an object associated with the entity type. The machine learning model output is used by the online system to select one or more entity types that the user is likely searching for. The online system offers objects of the likely entity types to the user as results of the search query.

Abstract: The system described herein can automatically match, link, or otherwise associate electronic activities with one or more node profiles. For an electronic activity that is eligible or qualifies to be matched with one or more node profiles, the system can selectively apply rules to match the electronic activity to a subset of the one or more node profiles based on values of fields extracted from the electronic activity and values of the node profiles. The system can then store an association between the electronic activity and the subset of the one or more node profiles.

Abstract: The present disclosure relates to a system and method for extracting information from text data. The method comprises: obtaining a plurality of text elements. A word embedding algorithm may be applied to the obtained text elements by mapping each text element of at least part of the text elements into a vector of a predefined dimension. The mapped text elements may be clustered into groups using the distances between the respective vectors. For each text element of a set of text elements of the mapped text elements a respective distribution of neighbors across the groups may be built. Similarity scores may be computed using the distributions thereby for determining relations between the set of text elements.

Abstract: A computer-implemented method for identifying pre-join operations, when accessing a database of relational tables, based on a usage history and/or a priority needs, comprises creating a graph of weighted edges and nodes, the nodes represent relational tables and edges represent join operations to be performed on the tables, partitioning the graph into a plurality of graph communities based on graph community densities, with a density indicating a number of edges touching a particular node, with the number of edges being greater than a predetermined edge number threshold, with each edge further including an edge weight indicative of a frequency of referencing within a predetermined recent duration of time and/or indicative of urgency of quick access to the corresponding join result within a predetermined recent duration of time, and generating pre-join results based on the partitioned graph communities and graph community densities.

Abstract: The present disclosure relates to methods, systems, and storage media for updating field-value pairs of record objects using electronic activities linked to the record objects. The method can maintain a plurality of node profiles corresponding to a plurality of unique entities; access a plurality of electronic activities transmitted or received via electronic accounts associated with one or more data source providers; identify a record object of a plurality of record objects of one or more systems of record; match electronic activity of the plurality of electronic activities to the record object based on content of the electronic activity and the object field-value pairs of the record object; identify a node profile matched with the electronic activity of the plurality of electronic activities; determine a weighting factor for the electronic activity; and update a stage field of the record object to a second stage value indicating a second proximity to the completion of the event.

Abstract: The present disclosure relates to systems and methods for determining an engagement profile of a participant by associating electronic activities to a profile. It may generate the engagement profile based on analysis of the electronic activity level. An example implementation may contain the following steps. The system may access for a first record object a plurality of electronic activities linked with the first record object. The system may identify for a participant from the plurality of electronic activities a set of electronic activities including the participant. The system may determine an engagement profile of the participant based on a first number of electronic activities of the set of electronic activities sent by the participant, a second number of the set of electronic activities received by the participant and a temporal distribution of the set of electronic activities. The system may store the engagement profile in one or more data structures.

Abstract: A method and system for generating structured data from semi-structured data are provided. The method includes reading a plurality of records from a data file including semi-structured data. Further, the method includes obtaining aligned delimiters in a list for every record that has been read. The method also includes selecting a most occurring delimiter from the list. The method then includes constructing a regular expression using the selected delimiter to split the records into different fields. The method also includes reconstructing the records for the regular expression to fit and split into fields. In addition, the method includes displaying the records split into the fields.

Abstract: A message bus-based streaming rules engine is disclosed. In various embodiments, a data analysis system as disclosed herein includes a communication interface configured to receive log data; and a processor coupled to the communication interface and configured to: parse the log data to generate a data unit comprising a data value; and send the data unit via a message bus to a rule actor configured to apply a rule based at least in part on the data value.

Abstract: Systems and techniques for accelerating relationship visualizations from data objects are described herein. The configuration and/or display of a relationship matrix may be automatically determined from the data objects. The relationship matrix may display relationships through gradient, hue, color, and/or saturation. The relationship matrix may be navigable and/or interactive to accelerate relationship visualizations.

Abstract: As disclosed herein, a computer implemented method for reading a record on a storage device includes reading, by a processor, the record from the storage device, and generating, by a processor, a header corresponding to the record. The method further includes adding, by a processor, header information corresponding to the metadata to the header, and providing, by a processor, the header and the record to a host. Also disclosed herein, a computer implemented method for writing a record on a storage device includes receiving, by a processor, a header and the record from a host to be written to the storage device, and determining, by a processor, metadata included in header information corresponding to the header. The method further includes determining, by a processor, a write behavior specified by the metadata, and writing, by a processor, the metadata and the record to the storage device according to the write behavior.

Abstract: Methods and arrangements for configuring document editors. A search client add-in is loaded at a document editor. At the document editor, a document is accepted from a search engine. Communication is established between the search client add-in and the search engine. At the search client add-in, supplementary information about the document is received from the search engine. User input about the document is accepted, and is directed to the search engine. The document is informatively enhanced via at least one of: the supplementary information and the user input. Other variants and embodiments are broadly contemplated herein.

Abstract: Some embodiments provide a method for displaying text content on a device. The method receives a set of text content arranged in a single column. The method identifies a separable segment of the text content for display on a device. Based on properties of the text content and the device, the method determines whether the separable segment of the text content meets a set of characteristics for dividing the segment of text content into more than one column for display. When the separable segment of text content meets the set of characteristics, the method displays the segment of text content using more than one column.

Abstract: Various embodiments relate generally to data science and data analysis, computer software and systems, and wired and wireless network communications to provide an interface between repositories of disparate datasets and computing machine-based entities that seek access to the datasets, and, more specifically, to a computing and data storage platform that facilitates consolidation of one or more datasets, whereby a collaborative data layer and associated logic facilitate, for example, efficient access to, and implementation of, collaborative datasets. In some examples, a method may include receiving a dataset and dataset attributes and identifying a first version of the dataset. The method may include identifying data that varies from a first version of the dataset, and generating a second version of the dataset to include a first subset and a second subset of atomized data. The method may include storing subsets of atomized data points as an atomized dataset.