Abstract: The present disclosure relates to a method for displaying a search result in a user interface comprising a sequence of K table rows, a sequence of first type columns (named regular columns) and a sequence of B second type columns (named braided columns), the search result comprising values of attributes. The method includes creating a structure that includes a sequence table rows and a sequence of regular columns and a sequence of braided columns. The method selects a row of the sequence of rows and a braided column of the braided columns for displaying the search result. In each regular column a regular cell that is included in the selected row may be defined. From a braided column a braided cell may be defined that includes in the selected row and subsequent B?1 rows. The attributes values are displayed in the defined regular and braided cells.

Abstract: Splitting a natural language sentence into primitive phrases retaining relations of terms includes receiving a natural language sentence, building a parse tree from the natural language sentence using a natural language parser, and recursively identifying discourse markers in subtrees of the parse tree, starting with the highest ranking discourse marker in the parse tree, thereby separating each of the respective subtrees at the respective discourse marker using a set of predefined rules until a set of basic subtrees remains. The recursive identification includes looking-ahead for identifying long ranging discourse markers before identifying local discourse markers.

Abstract: A computer-implemented method, a computer program product, and a computer system for building a knowledge graph. A computer system converts user inputs as to a partial topology of a knowledge graph that a user wants to build into one or more initial nodes corresponding to respective natural language descriptions. A computer system interprets the respective natural language descriptions using natural language processing to match the one or more initial nodes against reference data. A computer system, based on matched reference data, obtains a valid topology of nodes and edges, wherein the nodes and edges are mapped onto the matched reference data. A computer system, based on the valid topology, generates a data flow linking to the matched reference data via associations of the nodes and edges and the matched reference data. A computer system builds an executable knowledge graph from the data flow.

Abstract: The present disclosure relates to a method for displaying a search result in a user interface comprising a sequence of K table rows, a sequence of first type columns (named regular columns) and a sequence of B second type columns (named braided columns), the search result comprising values of attributes. The method includes creating a structure that includes a sequence table rows and a sequence of regular columns and a sequence of braided columns. The method selects a row of the sequence of rows and a braided column of the braided columns for displaying the search result. In each regular column a regular cell that is included in the selected row may be defined. From a braided column a braided cell may be defined that includes in the selected row and subsequent B?1 rows. The attributes values are displayed in the defined regular and braided cells.

Abstract: The present disclosure relates to a method for generating a structure of a PDF-document, wherein the PDF-document comprises elements. The method comprises detecting document cells of the PDF-document dependent on commands of a page description language for printing the elements of the PDF-document. The method comprises determining parts of the PDF-document dependent on the PDF-document by a machine learning module. The determining of the respective part comprises associating a respective portion of the elements of the PDF-document with the respective part. Furthermore, a respective label may be assigned to the respective part. The method may further comprise using a symbolic artificial intelligence module, wherein rules of the symbolic AI-module for reconciling the document cells with the parts may be applied. The elements of the structure of the PDF-document may be generated and labelled dependent on a result of the reconciling and dependent on the respective label to the respective part.

Abstract: Information extraction systems and computer-implemented methods for producing a searchable representation of information contained in a corpus of documents by generating a document structure graph for each document, the graph indicating a structural hierarchy of document items in that document based on a predefined hierarchy of predetermined item-types, and linking document items to a parent document item in the structural hierarchy, for each document, generating a knowledge graph including first nodes, representing document items in the corpus and second nodes representing language items identified in those document items, interconnecting the first nodes and second nodes by edges representing a defined relation between items represented by the nodes interconnected by that edge, storing the knowledge graph in a knowledge graph database, and producing the searchable representation by traversing edges of the graph in response to input search queries.

Abstract: In an approach for automatically extracting product baseline information from a request for proposal document, a processor receives the document. A processor detects a table in the document. A processor identifies a table header on the table. The table header is associated with a name and an associated volume of the product. A processor extracts context based on the table header from the table. The context includes the name and the associated volume of the product. A processor maps the extracted context with the name of the product in the table to an associated name of the product based on a pre-defined product ontology.

Abstract: A method, a computer system, and a computer program product for managing a dataset of training samples, labeled by class, during training of a machine learning model is provided. Embodiments of the present invention may include training the model on a sequence of increasing-sized sets of the training samples and testing performance of the model after training with each set to obtain class-specific performance metrics corresponding to each set size. Embodiments of the present invention may include generating class-specific learning curves from the performance metrics for the plurality of classes. Embodiments of the present invention may include extrapolating the learning curves. Embodiments of the present invention may include optimizing a function of the predicted performance metrics to identify a set of augmentation actions to augment the dataset for further training of the model. Embodiments of the present invention may include providing an output indicative of the set of augmentation actions.

Abstract: The present disclosure relates to a method for searching a graph representing content of digital objects. A set of operations for traversing the graph may be determined according to a search request. The set of operations may be executed, resulting in intermediate result vectors of nodes and a result vector of nodes, wherein the result vector of nodes is associated with a result set of one or more object units of the digital objects. Intermediate result vectors may be selected from of the intermediate result vectors. A set of result entities may be identified. The set of result entities are entities which are part of the object units and part of entities represented by nodes of said selected intermediate result vectors. The set of result entities and the result set of object units may be provided as a result of the search request.

Abstract: Computer-implemented methods and systems are provided for identifying IT service compositions corresponding to subsets of a set R of IT service requirements. Such a method includes providing a data structure including, for a set S of IT services, a master graph having master nodes representing respective subsets of like services in S, interconnected by master edges each representing an integration-need between nodes interconnected by that edge. The method further comprises, for each service composition being a set of services, integrated by integration components and spanning all master nodes, in the composition subgraph, comparing the composite attributes of services and integration components in that composition with the requirements in R? to select at least one preferred service composition for R?, and outputting composition data defining each preferred service composition.

Abstract: Splitting a natural language sentence into primitive phrases retaining relations of terms includes receiving a natural language sentence, building a parse tree from the natural language sentence using a natural language parser, and recursively identifying discourse markers in subtrees of the parse tree, starting with the highest ranking discourse marker in the parse tree, thereby separating each of the respective subtrees at the respective discourse marker using a set of predefined rules until a set of basic subtrees remains. The recursive identification includes looking-ahead for identifying long ranging discourse markers before identifying local discourse markers.

Abstract: Various embodiments manage the migration of servers. In one embodiment, a set of server-level dependency information is obtained for servers to be migrated from a source computing environment to a target computing environment. A set of network configuration data is obtained for a plurality of network devices associated with the servers. The set of server-level dependency information is updated to include one or more additional dependencies of at least one of the servers based on the set of network configuration data. Updating the set of server-level dependency information generates an updated set of dependency information. The servers are assigned to multiple migration groups based on the updated set of dependency information. The migration groups optimize cross-group dependencies among the migration groups.

Abstract: A method, a computer system, and a computer program product for managing a dataset of training samples, labeled by class, during training of a machine learning model is provided. Embodiments of the present invention may include training the model on a sequence of increasing-sized sets of the training samples and testing performance of the model after training with each set to obtain class-specific performance metrics corresponding to each set size. Embodiments of the present invention may include generating class-specific learning curves from the performance metrics for the plurality of classes. Embodiments of the present invention may include extrapolating the learning curves. Embodiments of the present invention may include optimizing a function of the predicted performance metrics to identify a set of augmentation actions to augment the dataset for further training of the model. Embodiments of the present invention may include providing an output indicative of the set of augmentation actions.

Abstract: A method, apparatus, and non-transitory computer readable medium for performing joins on data from hierarchical databases are described. The method, apparatus, and non-transitory computer readable medium may provide for receiving one or more search results from each of a plurality of hierarchical databases, identifying one or more matching fields from each of the search results, joining the search results according to a set of rules for processing related fields to the matching fields, wherein the related fields comprise sibling fields, neighbor fields, ancestor fields, descendant fields, or any combination thereof, and generating one or more combined search results based on the joining.

Abstract: Computer-implemented methods and systems are provided for identifying IT service compositions corresponding to subsets of a set R of IT service requirements. Such a method includes providing a data structure including, for a set S of IT services, a master graph having master nodes representing respective subsets of like services in S, interconnected by master edges each representing an integration-need between nodes interconnected by that edge. The method further comprises, for each service composition being a set of services, integrated by integration components and spanning all master nodes, in the composition subgraph, comparing the composite attributes of services and integration components in that composition with the requirements in R? to select at least one preferred service composition for R?, and outputting composition data defining each preferred service composition.

Abstract: In an approach for automatically extracting product baseline information from a request for proposal document, a processor receives the document. A processor detects a table in the document. A processor identifies a table header on the table. The table header is associated with a name and an associated volume of the product. A processor extracts context based on the table header from the table. The context includes the name and the associated volume of the product. A processor maps the extracted context with the name of the product in the table to an associated name of the product based on a pre-defined product ontology.

Abstract: A parameter of a first checker in a profile of the first checker is configured. The parameter comprises a restriction on contents of a modification to a dataset. The modification comprises a write to a portion of the dataset. The dataset is modifiable by a plurality of authors. The first checker has a first checker owner. A first modification to the dataset is validated against a restriction enforced by the first checker according to the parameter. The first modification has a modification owner. Responsive to the validating detecting that the first modification is acceptable, the first modification is allowed.

Abstract: A computer-implemented method of automatically identifying a product offering for a customer using a generated decision tree from a directed acyclic graph knowledge base is described. The method includes, by a processor, identifying a set of product offerings, where each product offering is described by a file. The method converts each file into a Directed Acyclic Graph (DAG) and clusters the DAGs. For each cluster, the processor creates a decision tree to distinguish between the product offerings.

Abstract: A method, apparatus, and non-transitory computer readable medium for performing joins on data from hierarchical databases are described. The method, apparatus, and non-transitory computer readable medium may provide for receiving one or more search results from each of a plurality of hierarchical databases, identifying one or more matching fields from each of the search results, joining the search results according to a set of rules for processing related fields to the matching fields, wherein the related fields comprise sibling fields, neighbor fields, ancestor fields, descendant fields, or any combination thereof, and generating one or more combined search results based on the joining.

Abstract: A parameter of a first checker in a profile of the first checker is configured. The parameter comprises a restriction on contents of a modification to a dataset. The modification comprises a write to a portion of the dataset. The dataset is modifiable by a plurality of authors. The first checker has a first checker owner. A first modification to the dataset is validated against a restriction enforced by the first checker according to the parameter. The first modification has a modification owner. Responsive to the validating detecting that the first modification is acceptable, the first modification is allowed.