International Business Machines Corporation

UniversitÈ Libre De Bruxelles Bruxelles

Peter Willem Jan Staar

Michele Dolfi

Christoph Auer

Konstantinos Bekas

Leonidas Georgopoulos

Gerhard Ingmar Meijer

Valery Weber

Birgit Monika Pfitzmann

Abderrahim Labbi

Cesar Berrospi Ramis

Nikolaos Livathinos

Maksym Lysak

Francesco Fusco

Aleksandros Sobczyk

Alexander Velizhev

Ralf Kaestner

Viktor Kuropiatnyk

Ahmed Samy Nassar

Kasper Dinkla

Martin M Rufli

Robin Devooght

Elliot Jacques Vincent

Dal Noguer Hidalgo

Rita Kuznetsova

André Carvalho

Tim Jan Baccaert

Lokesh Mishra

The invention is notably directed to a computer-implemented method to generate a synthetic data set. The synthetic data set comprises a plurality of chemical documents and each of the plurality of chemical documents comprises a respective set of chemical objects. The method comprises a step of receiving configuration data, the configuration data comprising a set of configuration parameters for the data set. The method further comprises performing, in an iterative manner, for each of the plurality of chemical documents the steps of generating, by a structure generation module, a respective document structure for each of the respective chemical documents in accordance with the configuration data, generating, by a content generation module, the respective set of chemical objects for the respective chemical document and arranging the respective set of chemical objects on the respective chemical document.

Synthetic data set generation of chemical illustrations

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.

Photoacid generator for chemically amplified photoresists for deep ultra violet and extreme ultraviolet lithography

In an approach for a dynamic in-memory construction of a knowledge graph structure, the knowledge graph structure comprising a plurality of nodes and edges linking selected nodes to each other, a processor receives a record comprising a plurality of strings. The plurality of strings relates to a command combined with a set of strings. A processor determines content records relating to nodes relating to each of the strings. A processor assigns node identifiers for respective determined content records. A processor appends the node identifiers to a dynamic in-memory knowledge graph structure. A processor modifies an edge between selected ones of the node identifiers based on the command combined with the set of strings. A processor builds the dynamic in-memory knowledge graph structure.

Dynamic in-memory construction of a knowledge graph

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

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.

Photoacid generator for chemically amplified photoresists

Provided are techniques for performing a search using a hypergraph. Entities are identified. A knowledge graph using the entities is generated, wherein nodes of the knowledge graph represent the entities and edges between the nodes represent pair-wise relationships, and wherein each of the edges carries an edge score that quantifies a degree of coherence between a pair of the entities. A hypergraph using the knowledge graph is generated, wherein nodes of the hypergraph represent the entities and hyperedges represent relationships between multiple entities, and wherein each of the hyperedges carries a hyperedge score that quantifies a degree of coherence between the multiple entities. A search request is received. A search result is generated using the hypergraph, wherein the search result comprises a set of coherently related entities. The search result is returned.

Performing a search using a hypergraph

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×10·cm/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.

Photoacid generator

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.

Specificity ranking of text elements and applications thereof

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.

Organometallic photoresists for DUV or EUV lithography

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. Subroutines can be recursively executed, whereby, at each recursion level of execution, it is called with the selected attribute and each node of a selection of nodes, as a starting node.

Visually exploring implicit features of hierarchical graphs based on attributes of nodes of the graphs

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.

Preparing a database for a domain specific application using a centralized data repository

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

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

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.

Growing community of inventors

Wädenswil, Switzerland

Peter Willem Jan Staar