-
公开(公告)号：US11550827B2
公开(公告)日：2023-01-10
申请号：US16948515
申请日：2020-09-22
摘要： A method and a related system for allocating target locations to optimize trajectories between several objects and the target locations may be provided. The method comprises capturing location data of the target locations as well as location and movement data of the objects, building a graph using the target locations as well as the location and movement data and integrating constraints into the graph. Furthermore, the method comprises determining for each of the several objects a desired target location using a first optimization system, thereby determining endpoints of a trajectory between each of the objects and its respective desired target location and selecting for each of the several objects an optimal path as the trajectory between the object and the desired target location, using a second optimization system, and taking into account movements of other objects along their trajectories.
-
公开(公告)号：US20220092091A1
公开(公告)日：2022-03-24
申请号：US16948515
申请日：2020-09-22
摘要： A method and a related system for allocating target locations to optimize trajectories between several objects and the target locations may be provided. The method comprises capturing location data of the target locations as well as location and movement data of the objects, building a graph using the target locations as well as the location and movement data and integrating constraints into the graph. Furthermore, the method comprises determining for each of the several objects a desired target location using a first optimization system, thereby determining endpoints of a trajectory between each of the objects and its respective desired target location and selecting for each of the several objects an optimal path as the trajectory between the object and the desired target location, using a second optimization system, and taking into account movements of other objects along their trajectories.
-
公开(公告)号：US20200285657A1
公开(公告)日：2020-09-10
申请号：US16296313
申请日：2019-03-08
IPC分类号： G06F16/28 , G06F16/901
摘要： A method for linking a first knowledge graph (KG) and a second KG in the presence of a third KG is provided. Content of nodes of the first KG is compared to nodes of the second KG. If a first KG node has a content relationship to a related second KG node, an edge identified by a tuple identifying the first KG and the first KG node and a tuple identifying the second KG and the second KG node is stored in a meta-layer KG. The method comprises comparing content of the nodes from the third KG with the content of nodes from the first and second KG, and in case relationships are identified, more complex tuples establishing this relationship in the meta-layer are stored. Finally, the method also comprises storing at least all nodes and edges of the meta-layer knowledge graph.
-
公开(公告)号：US20190073598A1
公开(公告)日：2019-03-07
申请号：US15695989
申请日：2017-09-05
摘要： A method includes receiving a first query by a computing device and assigning the first query to a plurality of cognitive engines, wherein each of the plurality of cognitive engines include different characteristics for processing data. The method also includes, responsive to receiving a response from each of the plurality of cognitive engines for the first query, comparing the received responses from the plurality of cognitive engines. The method also included responsive to determining a difference between a first response from a first cognitive engine and a second response from a second cognitive engine is above a predetermined threshold value, performing a response mediation process until the difference is below the predetermined threshold value. The method also includes selecting a first final response from the received responses for the first query and the second query and displaying the first final response to a user.
-
公开(公告)号：US11651276B2
公开(公告)日：2023-05-16
申请号：US16669685
申请日：2019-10-31
发明人： Stefan Ravizza , Andrea Giovannini , Patrick Lustenberger , Frederik Frank Flöther , Thomas Pfeiffer
IPC分类号： G06N20/00
CPC分类号： G06N20/00
摘要： A computer-implemented method for generating a group of representative model cases for a trained machine learning model may be provided. The method comprising determining an input space, determining an initial plurality of model cases, and expanding the initial plurality of model cases by stepwise modifying field values of the records representing the initial plurality of model cases resulting in an exploration set of model cases. Additionally, the method comprises obtaining a model score value for each record of the exploration set of model cases, continuing the expansion of the exploration set of model cases thereby generating a refined model case set, and selecting the records in the refined model case set based on relative record distance values and related model score values between pairs of records, thereby generating the group of representative model cases.
-
公开(公告)号：US11120150B2
公开(公告)日：2021-09-14
申请号：US16801469
申请日：2020-02-26
发明人： Stefan Ravizza , Tim U. Scheideler , Florian Graf , Andrea Giovannini , Frederik Flöther , Erik Rueger
摘要： A computer-implemented method, system, and computer program product for dynamic access control to a node in a knowledge graph includes: structuring nodes of a knowledge graph into a plurality of hierarchically organized graph layers; assigning, to one or more users, an access right to a first node of the knowledge graph, the access right to the node selected from a plurality of access rights, where different types of users have different access rights; and assigning, to at least one user from the one or more users, an additional access right to a second node of the knowledge graph.
-
公开(公告)号：US10678857B2
公开(公告)日：2020-06-09
申请号：US15933748
申请日：2018-03-23
IPC分类号： G06F16/90 , G06F16/901
摘要： A knowledge graph is divided into a plurality of sub-graphs, each sub-graph comprising a plurality of vertices and a plurality of edges. The knowledge graph is represented as a summary graph comprising for each of the sub-graphs a summary-graph vertex. A local sub-graph is generated as a copy of one of the sub-graphs together with a copy of a surrounding graph to the one of the sub-graphs. The content of the local sub-graph is modified. The local sub-graph is reintegrated, upon a reintegration trigger event, back into the knowledge graph, wherein a structure of the surrounding graph is used as a reintegration aid, by overlaying the structure and the knowledge graph, thereby identifying identical vertices of the surrounding structure and the knowledge graph as anchor points from where changes in the local sub-graph are reintegrated into the knowledge graph.
-
公开(公告)号：US20190294733A1
公开(公告)日：2019-09-26
申请号：US15933748
申请日：2018-03-23
IPC分类号： G06F17/30
摘要： A knowledge graph is divided into a plurality of sub-graphs, each sub-graph comprising a plurality of vertices and a plurality of edges. The knowledge graph is represented as a summary graph comprising for each of the sub-graphs a summary-graph vertex. A local sub-graph is generated as a copy of one of the sub-graphs together with a copy of a surrounding graph to the one of the sub-graphs. The content of the local sub-graph is modified. The local sub-graph is reintegrated, upon a reintegration trigger event, back into the knowledge graph, wherein a structure of the surrounding graph is used as a reintegration aid, by overlaying the structure and the knowledge graph, thereby identifying identical vertices of the surrounding structure and the knowledge graph as anchor points from where changes in the local sub-graph are reintegrated into the knowledge graph.
-
公开(公告)号：US20190266341A1
公开(公告)日：2019-08-29
申请号：US15907549
申请日：2018-02-28
发明人： Stefan Ravizza , Erik Rueger , Tim U. Scheideler , Peter Minig
摘要： A method and a related system for controlling user access to a target node in a knowledge graph may be provided. The method comprises defining a knowledge graph structure limitation for a user, defining a node type depending on the number of edges connecting to the node, determining a condition for an access to the target node, based on the knowledge graph structure limitation relative to the start node and the node type of the target node, upon the user attempting, coming from a start node, to access the target node in the knowledge graph, and granting access to the target node based on the determination.
-
10.发明申请公开(公告)号：US20190180001A1
公开(公告)日：2019-06-13
申请号：US15834302
申请日：2017-12-07
发明人： Romeo Kienzler , Jenny Li , Stefan Mueck , Stefan Ravizza
摘要： A system and machine-implemented method for sorting Next-Generation Sequencing (NGS) reads in O(n) time and space complexity that makes use low sparsity and nearly uniform distribution of the input array. The genome position field in the input array is used to determine the target position of the output array. Duplicate target positions due to n-fold coverage are handled by assigning either overflow buckets to each position or anterior assigning multiple target slots in the output array for each genome position depending on the distribution of reads over the genome and the resulting probability of hitting an already occupied slot. Once every tuple in the input array has been written to the output array, the output array in read through ascending order and each tuple is appended to the end of a final result array.
-
-
-
-
-
-
-
-
-
搜索结果
36 条记录 (耗时 0.024 秒)
