International Business Machines Corporation

Birgit Monika Pfitzmann

Nikolai A Joukov

Matthew A Markley

Murthy V Devarakonda

Norbert George Vogl

Amitkumar Manoharrao Paradkar

John K Baker

Michael Waidner

Michael Tacci

Florian Graf

Kamal Bhattacharya

Gerhard A Widmayer

Steve N Lee

Heather Maria Hinton

William Robert Reohr

Michael Elton Nidd

George Robert Blakley, Iii

Brian L Peterson

Vasily Tarasov

Matthias Schunter

Peter Urbanetz

Shaya Potter

Bruce G Taylor

Richard Keith Athey

Ronda L Caswell

Venkata Vinay Parisa

Marco Pistoia

Manoj N Kumar

Naresh Nayar

Takaaki Tateishi

John Joseph Rofrano

Xiaolan Zhang

Peter Willem Jan Staar

Alain Charles Azagury

Michele Dolfi

Christoph Auer

Konstantinos Magoutis

Yunwu Huang

Marcel Schlatter

Dorothea W Wiesmann Rothuizen

Harigovind Ramasamy

Jian Wang

Jun Zhu

Ying Liu

Xin Zhou

Harigovind Venkatraj Ramasamy

Amit Anil Nanavati

Josep Cors

John C Dayka

Honglei Guo

Joel W Branch

Mark A Nelson

Ying Huang

Christopher Charles Young

Guenter Karjoth

Changhua Sun

Laura A Richardson

Richard Henry Guski

Michael P Waidner

Linda Nancy Betz

Kristiann J Schultz

Milton A Bonilla

Venkata Vinay Kumar Parisa

Walter Barlett Farrell

Anil K Maddipatla

Haiqi Liang

Li Ni Zhang

Zhong Su

Li Xiao

Jan Leonard Camenisch

Mahesh Viswanathan

Thomas E Chefalas

Andrzej P Kochut

Shiwan Zhao

Chi Zhang

Christopher Ward

Anthony Joseph Nadalin

Hai Huang

Robert Filepp

Mickey Iqbal

Thomas R Gross

Eric James Barkie

George E Stark

Jing Luo

Yun-Wu Huang

Anthony Scott Moran

Dipyaman Banerjee

Valery Weber

Kunwadee Sripanidkulchai

Dorothea W Wiesmann

Colm V Malone

Cheng-Lin Tsao

Brian James Turner

Ioana Giurgiu

Kevin David Galloway

Kewei Sun

Suraj Subramanian

Shao Yang Yu

Karen Cheng

Hsiao Choong Thio

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.

Search in knowledge graphs

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.

Presentation of search results in a user interface

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.

Automated natural language splitting for generation of knowledge graphs

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.

Generating a structure of a PDF-document

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.

Product baseline information extraction

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.

Dataset management in machine learning

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&#x2032;, and outputting composition data defining each preferred service composition.

Automated information technology services composition

A system and method for information technology (IT) migration includes determining a relationship among objects to be migrated such that the relationship includes a set of objects having at least one of a common feature or dependency between the objects in the set. The objects are grouped into a plurality of migration waves such that cross-wave relationships are minimized among the plurality of migration waves. The objects are migrated wave by wave.

System and method for object migration using waves

A system and method for cost-based migration planning includes determining cost factors and constraints associated with at least one of migrating and transforming a plurality of components. A cost-based model is constructed using the cost factors and constraints. The cost-based model is applied to groupings of the plurality of components to provide a cost-based determination grouping scheme in accordance with the constraints. The grouping scheme is output to provide migration waves for migrating or transforming the plurality of components.

Cost-based migration waves planning

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.

Using network configuration analysis to improve server grouping in migration

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.

Supporting joins in directed acyclic graph knowledge bases

Methods and systems for evaluating compatibility of a cloud of computers to perform one or more workload tasks. One or more computing solution aspects are determined that corresponding to one or more sets of workload factors, where the workload factors characterize one or more workloads, to characterize one or more computing solutions. The workload factors are compared to the computing solution aspects in a rule-based system to exclude computing solutions that cannot satisfy the workload factors. A computing solution is selected that has aspects that accommodate all of the workload factors to find a solution that accommodates the one or more individual workloads.

Workload-to-cloud migration analysis based on cloud aspects

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.

Consistency enforcement in multi-author documents

Methods and systems for finding a migration target include building a constrained, layered graph from a catalog of possible configuration combinations and a distance function for each layer in the graph; and determining an available path through the graph, said path having a minimum overall distance from a source instance, by performing an optimized search that selectively evaluates available paths through the graph based on cumulative distances of paths through the graph from the source instance.

Efficient configuration combination selection in migration

A method is presented for error correction of tabular data in document conversion. The method includes identifying errors from tabular data transformation by employing an error/invalidation checking module and correcting the identified errors from the tabular data transformation by employing an error correction module. The error correction module includes identifying a main structure pattern from common row structures, concatenating separate keywords according to natural language processing models employing training data obtained from a plurality of candidate tabular data, adjusting cells in the tabular data based on a domain-specific knowledge database including the training data in combination with linguistic and semantic knowledge, merging partial tabular data pieces, and generating an adjusted table as output on a display of a computing device.

Error correction for tables in document conversion

Growing community of inventors

Samstagern, Switzerland

Birgit Monika Pfitzmann