Abstract: Techniques for generating SQL queries from natural language requests are described. In some examples, a method for generating a SQL query from a natural language request includes performing entity extraction on the natural language query to extract entities and predict domains; determining required tables of the relational database to answer the natural language query; generating a SQL generation ready entity relationship graph based on the determined required tables; and generating a SQL query from at least the SQL generation ready entity relationship graph.

Abstract: A system for generating a storage-efficient data structure representing a plurality of inter-related data tables and adapted for use in data processing. The system configured to receive input data and generate a graph database having edges and vertices. Each inter-related data table of a plurality of inter-related data tables is received as input data and defines a corresponding vertex of the vertices. The edges defining pairwise relationships between the vertices based on one or more common elements of a corresponding pair of data tables. A reduced graph database is generated, as well as its connected-components. A partition defined by an equivalence relation on the graph database is used to generate the reduced graph database. Each set of the plurality of sets of the partition is represented by a single vertex of the corresponding set. An output data structure indicative of the connected-components, or additionally or alternatively, the irreducible generators, is generated.

Abstract: Disclosed are systems, methods, and devices for pattern extraction. A graph data structure is generated, reflective of a directed graph having vertices representative of entities and edges representative of relationships between two entities. A subgraph data structure is generated, reflective of a plurality of subgraphs of the directed graph. A similarity matrix data structure is generated by applying a graph kernel to obtain a subgraph similarity matrix including a plurality of entries, each entry providing a score of the similarity between two subgraphs of the plurality of subgraphs. A clustering data structure is generated, reflective of a plurality of groups of the plurality entities upon processing the similarity matrix data structure. For at least a given one of the plurality of groups, a common pattern data structure is generated corresponding to a subgraph that is similar to subgraphs in the given group.

Abstract: A system, non-transitory computer-readable medium, and method are provided. The system comprises at least one processor and memory storing instructions which when executed by the at least one processor configure the at least one processor to perform the method. The non-transitory computer-readable medium has instructions thereon, which when executed by a processor, perform the method. The method comprises determining a similarity score between a first webpage and a second webpage, determining a popularity score of a link between the first webpage and the second webpage, determining a difference between the similarity score and the popularity score, and determining that the link between the first webpage and the second webpage may be improved if the difference is greater than a threshold value.

Abstract: The present invention relates to electronic systems for use in high demand or mission critical environments, including power stations, sub-stations, roadside transportation, rail, and industrial applications. The present invention provides a) increased resilience of mission critical communications infrastructure b) ability to maintain multiple independent RSTP domains over HSR ring d) method of using a hidden VLAN as an RSTP domain ID c) a method of creating multiple redundant protocols domains over HSR ring.

Abstract: A system for generating a storage-efficient data structure representing a plurality of inter-related data tables and adapted for use in data processing. The system configured to receive input data and generate a graph database having edges and vertices. Each inter-related data table of a plurality of inter-related data tables is received as input data and defines a corresponding vertex of the vertices. The edges defining pairwise relationships between the vertices based on one or more common elements of a corresponding pair of data tables. A reduced graph database is generated, as well as its connected-components. A partition defined by an equivalence relation on the graph database is used to generate the reduced graph database. Each set of the plurality of sets of the partition is represented by a single vertex of the corresponding set. An output data structure indicative of the connected-components, or additionally or alternatively, the irreducible generators, is generated.

Abstract: A system, non-transitory computer-readable medium, and method are provided. The system comprises at least one processor and memory storing instructions which when executed by the at least one processor configure the at least one processor to perform the method. The non-transitory computer-readable medium has instructions thereon, which when executed by a processor, perform the method. The method comprises determining a similarity score between a first webpage and a second webpage, determining a popularity score of a link between the first webpage and the second webpage, determining a difference between the similarity score and the popularity score, and determining that the link between the first webpage and the second webpage may be improved if the difference is greater than a threshold value.

Abstract: Disclosed are systems, methods, and devices for pattern extraction. A graph data structure is generated, reflective of a directed graph having vertices representative of entities and edges representative of relationships between two entities. A subgraph data structure is generated, reflective of a plurality of subgraphs of the directed graph. A similarity matrix data structure is generated by applying a graph kernel to obtain a subgraph similarity matrix including a plurality of entries, each entry providing a score of the similarity between two subgraphs of the plurality of subgraphs. A clustering data structure is generated, reflective of a plurality of groups of the plurality entities upon processing the similarity matrix data structure. For at least a given one of the plurality of groups, a common pattern data structure is generated corresponding to a subgraph that is similar to subgraphs in the given group.

Abstract: The present invention relates to electronic systems for use in high demand or mission critical environments, including power stations, sub-stations, roadside transportation, rail, and industrial applications. The present invention provides a) increased resilience of mission critical communications infrastructure b) ability to maintain multiple independent RSTP domains over HSR ring d) method of using a hidden VLAN as an RSTP domain ID c) a method of creating multiple redundant protocols domains over HSR ring.