-
公开(公告)号：US20240321412A1
公开(公告)日：2024-09-26
申请号：US18124638
申请日：2023-03-22
发明人： Nikolaos Livathinos , Maksym Lysak , Ahmed Samy Nassar , Peter Willem Jan Staar , Valery Weber , Gerhard Ingmar Meijer
IPC分类号： G16C20/80 , G06F40/103 , G06F40/143 , G06F40/186
CPC分类号： G16C20/80 , G06F40/103 , G06F40/143 , G06F40/186
摘要： 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.
-
公开(公告)号：US12118039B2
公开(公告)日：2024-10-15
申请号：US17667974
申请日：2022-02-09
发明人： Maksym Lysak , Viktor Kuropiatnyk , Nikolaos Livathinos , Cesar Berrospi Ramis , Peter Willem Jan Staar , Abderrahim Labbi
IPC分类号： G06F16/901
CPC分类号： G06F16/9024 , G06F16/9027
摘要： 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.
-
3.发明授权公开(公告)号：US11940962B2
公开(公告)日：2024-03-26
申请号：US17546265
申请日：2021-12-09
发明人： Nikolaos Livathinos , Maksym Lysak , Viktor Kuropiatnyk , Cesar Berrospi Ramis , Peter Willem Jan Staar , Abderrahim Labbi
IPC分类号： G06F16/21
CPC分类号： G06F16/211
摘要： 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.
-
公开(公告)号：US10891319B2
公开(公告)日：2021-01-12
申请号：US16354779
申请日：2019-03-15
IPC分类号： G06F15/177 , G06F16/28 , G06F3/0484 , G06F16/22 , G06F16/29
摘要： Real-time rendering representations of objects in a view. Objects include clusters of nodes of a graph structure and links between said clusters. The graph structure comprises edges defined as pairs of the nodes. User inputs in respect to a current view and/or at least one of the objects is received. A data structure is updated, which associates multiple identifiers. Multiple identifiers may include cluster identifiers, node identifiers, and link identifiers, which respectively identify clusters of nodes, nodes of said graph, and links between pairs of clusters.
-
公开(公告)号：US20240233223A1
公开(公告)日：2024-07-11
申请号：US18339263
申请日：2023-06-22
IPC分类号： G06T11/60 , G06F40/174 , G06F40/177 , G06F40/186 , G06F40/205 , G06F40/284 , G06V10/774 , G06V30/412
CPC分类号： G06T11/60 , G06F40/174 , G06F40/177 , G06F40/186 , G06F40/205 , G06F40/284 , G06V10/774 , G06V30/412
摘要： The present disclosure relates to a method for automatically generating table images. The method includes determining a table configuration including a number of rows of the table, a number of columns of the table and a spanning area of the table, the spanning area indicating a fraction of spanning cells in the table. The table may be generated in accordance with the table configuration. Content may be inserted into cells of the table using a selected content template. An image table of an appearance of the table may be created and the image table may be provided.
-
6.发明公开公开(公告)号：US20230252078A1
公开(公告)日：2023-08-10
申请号：US17667974
申请日：2022-02-09
发明人： Maksym Lysak , Viktor Kuropiatnyk , Nikolaos Livathinos , Cesar Berrospi Ramis , Peter Willem Jan Staar , Abderrahim Labbi
IPC分类号： G06F16/901
CPC分类号： G06F16/9024 , G06F16/9027
摘要： 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.
-
7.发明公开公开(公告)号：US20230185776A1
公开(公告)日：2023-06-15
申请号：US17546265
申请日：2021-12-09
发明人： Nikolaos Livathinos , Maksym Lysak , Viktor Kuropiatnyk , Cesar Berrospi Ramis , Peter Willem Jan Staar , Abderrahim Labbi
IPC分类号： G06F16/21
CPC分类号： G06F16/211
摘要： 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.
-
公开(公告)号：US20200293556A1
公开(公告)日：2020-09-17
申请号：US16354779
申请日：2019-03-15
IPC分类号： G06F16/28 , G06F16/29 , G06F16/22 , G06F3/0484
摘要： Real-time rendering representations of objects in a view. Objects include clusters of nodes of a graph structure and links between said clusters. The graph structure comprises edges defined as pairs of the nodes. User inputs in respect to a current view and/or at least one of the objects is received. A data structure is updated, which associates multiple identifiers. Multiple identifiers may include cluster identifiers, node identifiers, and link identifiers, which respectively identify clusters of nodes, nodes of said graph, and links between pairs of clusters.
-
-
-
-
-
-
-
搜索结果
8 条记录 (耗时 0.016 秒)
