Abstract: A method for creating a database for a domain specific application includes providing a centralized data repository comprising data from different sources, identifying a set of data units of the repository that represent a specific domain, determining a pivotal entity type for an application, determining a mapping between different identifiers of the pivotal entity type, creating a reference set by selecting a first subset of the set of data units using the mapping, wherein the first subset represents the pivotal entity type, selecting, based at least in part on the mapping, a second subset of the set of data units, wherein the second subset represents non-pivotal entity types which are related to instances of the pivotal entity type in the reference set; and creating a database from data units and associated attributes selected from the reference set of data units and the second subset of data units.

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 invention relates to a novel photoacid generator compound cation, comprising an element having for 92 eV photons (extreme ultraviolet (EUV)) an absorption cross section of at least 0.5×107·cm2/mol; having at least two stable oxidation states; and selected from the elements of group 1 to group 15 of the periodic table of the elements. Additionally, the present invention relates to a photoacid generator comprising said photoacid generator compound cation and an anion. Furthermore, the present invention aims to provide a photoresist composition comprising said photoacid generator and an acid labile polymer. Finally, the present invention relates to a method of generating an acid using the photoresist composition and a method of forming a patterned materials feature on a substrate.

Abstract: The present invention relates to a novel photoacid generator compound cation, comprising an element having for 92 eV photons (extreme ultraviolet (EUV)) an absorption cross section of at least 0.5×107·cm2/mol; having at least two stable oxidation states; and selected from the elements of group 1 to group 15 of the periodic table of the elements. Additionally, the present invention relates to a photoacid generator comprising said photoacid generator compound cation and an anion. Furthermore, the present invention aims to provide a photoresist composition comprising said photoacid generator and an acid labile polymer. Finally, the present invention relates to a method of generating an acid using the photoresist composition and a method of forming a patterned materials feature on a substrate.

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: A computing system, program products and computer-implemented method of exploring data comprises accessing data structures and executing an interaction loop. Data structure captures connected graph nodes associated with attributes containing human-readable data. Interaction loop receives user-selected attributes associated with focal nodes and executes subroutines to determine layouts of an arborescence extending from focal nodes. The subroutines use starting nodes and pivot attributes as arguments. Identifying nodes of subroutines are connected to starting nodes by walking the graph and comparing pivot attributes with attributes associated with connected nodes, obtaining distance-dependent quantities. Subroutines compute layout data, including coordinates of the connected nodes. Coordinates are determined in accordance with the distance-dependent quantities. Interaction loop displays arborescence according to the layout data.

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: A photoacid generator (PAG) anion, a photoresist composition, and a method are disclosed. The PAG anion includes a moiety, selected from an alkyl group, a monocyclic aromatic group, and a bicyclic aromatic group, that includes a carbon atom with a negative elementary charge. The PAG anion also includes an electron acceptor atom, selected from boron(III), aluminum(III), and phosphorus(V), which is covalently bonded to the carbon atom. The PAG anion also has at least one electron-withdrawing R group. The photoresist composition has a PAG that includes the PAG anion and a cation selected from triphenylsulfonium, diphenyliodonium, phenylthiolanium, and derivatives thereof. The method includes forming a layer of the photoresist composition over a material surface on a substrate, irradiating the layer to form a pattern of radiation-exposed regions, selectively removing portions of the irradiated layer to form exposed portions of the material surface, and etching or ion implanting the exposed portions.

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: A method for creating a database for a domain specific application includes providing a centralized data repository comprising data from different sources, identifying a set of data units of the repository that represent a specific domain, determining a pivotal entity type for an application, determining a mapping between different identifiers of the pivotal entity type, creating a reference set by selecting a first subset of the set of data units using the mapping, wherein the first subset represents the pivotal entity type, selecting, based at least in part on the mapping, a second subset of the set of data units, wherein the second subset represents non-pivotal entity types which are related to instances of the pivotal entity type in the reference set; and creating a database from data units and associated attributes selected from the reference set of data units and the second subset of data units.

Abstract: A tool for managing text-item recognition systems such as NER (Named Entity Recognition) systems. The tool applies the system to a text corpus containing instances of text items, such as named entities, to be recognized by the system, and selecting from the text corpus a set of instances of text items which the system recognized. The tool tokenizes the text corpus such that each instance in the aforementioned set is encoded as a single token and processing the tokenized text via a word embedding scheme to generate a word embedding matrix. The tool, responsive to selecting a seed token corresponding to an instance in the aforementioned set, performs a nearest-neighbor search of the embedding space to identify a set of neighboring tokens for the seed token, and identifies the text corresponding to each neighboring token as a potential instance of a text item to be annotated.

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: Ranking a plurality of text elements, each comprising at least one word, by specificity. For each text element to be ranked, such a method includes computing an embedding vector that locates a text element in an embedding space, and selecting a set of text fragments from reference text. Each of these text fragments contains the text element to be ranked and further text elements. For each text fragment, the method calculates respective distances in the embedding space between the further text elements. The method further includes calculating a specificity score for the text element to be ranked and storing the specificity score. After ranking the plurality of text elements, a text data structure using the specificity scores for text elements to extract data having a desired specificity from the data structure may be processed.

Abstract: A computer-implemented method for determining a set of target items to be annotated for training a machine learning application. The method comprises providing a training data set with a set of data samples and an auto-encoder with a classifier. The auto-encoder comprises an embedding model that maps the set of data samples to a set of compressed feature vectors. The set of compressed feature vectors define a compressed feature matrix. Further provided are: a definition of a graph associated to the compressed feature matrix, applying a clustering-algorithm to identify node clusters of the graph and applying a centrality algorithm to identify central nodes of the node clusters, retrieving from an annotator node labels for the central nodes, propagating the annotated node labels to other nodes of the graph and performing a training of the embedding model and the classifier with the annotated and the propagated node labels.

Abstract: A method, system and computer program product to generate a training data set for image segmentation applications, comprising providing a set of input documents of a first format. The input documents each comprise one or more pages. The input documents are split into individual document pages and parsed. Parsing comprises identifying a predefined set of items including position information of the position of the predefined set of items in the individual document pages; generating a bitmap image of a second format for each individual document page of the first format. The bitmap image comprises a predefined number of pixels. A mask is generated for each individual document. The mask comprises the predefined number of pixels of the corresponding bitmap image. Generating the mask comprises assigning an encoded class label to each pixel of the mask based on the position information of identified items of the predefined set of items.

Abstract: A computer-implemented method for processing a digital image. The digital image comprises one or more text cells, wherein each of the one or more text cells comprises a string and a bounding box. The method comprises receiving the digital image in a first format, the first format providing access to the strings and the bounding boxes of the one more text cells. The methods further comprises encoding the strings of the one or more text cells as visual pattern according to a predefined string encoding scheme and providing the digital image in a second format. The second format comprises the visual pattern of the strings of the one or more text cells. A corresponding system and a related computer program product is provided.

Abstract: Organometallic photoresists suitable for use in deep ultraviolet (DUV) or extreme ultraviolet (EUV) lithography are provided. The organometallic photoresists contain an organometallic molecule having least a metal element M selected from the group consisting of Bi, Sb, and mixtures thereof, and having an oxidation state of 3+, and at least one polymerizable group R. A method of forming a patterned materials feature on a substrate utilizing the organometallic photoresist compositions is also provided.

Abstract: In an approach to improve the field of photoacid generators (PAGs) through a new photoacid generator, in particular to a photoacid generator comprising a new polycyclic aromatic photoacid generator compound anion, and a photoresist composition, comprising said photoacid generator. Embodiments the present invention relate to a method of generating an acid using said photoresist composition and a method of forming a patterned materials feature on a substrate.

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: The invention is notably directed to a computer-implemented method for processing a plurality of documents. The method comprises providing the plurality of documents in a first format and splitting each of the plurality of documents of the first format into one or more individual pages. The method further comprises individually parsing the one or more individual pages of the plurality of documents. The parsing comprises identifying a predefined set of items of the one or more individual pages. Further processing comprises gathering the predefined set of items of each of the one or more individual pages of the plurality of documents into individual page files of a second format and performing the document processing service with the individual page files of the second format. The invention further concerns a corresponding computing system and a related computer program product.