32 results about "Graph Layout" patented technology

The application provides a hierarchical automatic layout method and device for internal module graphs, comprising the following steps: constructing a preliminary shape of a model graph layout; scanning each node, if there is a nested relationship, taking the nested information as a subgraph of the current node; scanning each node of the nested information, if there is a nested relationship, taking the nested information as a subgraph of the current node, and constructing a preliminary shape of a nested graph layout; determining virtual connections between different node nested relationships; and correcting the preliminary shape of the model graph layout to obtain a final shape of the model layout. In the layout process, the ports and graph element nesting involved in the internal module graph are considered, and a hierarchical automatic layout method completely covering the internal module graph elements is realized.

The embodiment of the invention provides a graph generation method and device, electronic equipment and a storage medium, and belongs to the technical field of computers. The method comprises the following steps: acquiring graph node data, performing layout analysis based on the graph node data to obtain layout recommendation parameters, performing graph rendering based on the layout recommendation parameters and the graph node data to generate a default graph, displaying in response to the default graph, collecting modification information of the default graph, acquiring layout correction parameters, and displaying the layout correction parameters. And performing graph rendering based on the layout correction parameters and the graph node data to generate a target graph. According to the embodiment of the invention, the adaptive layout recommendation parameters can be obtained through analysis of the graph node data, and the efficiency and accuracy of graph layout are remarkably improved, so that a relation graph with a complex topological structure can be constructed more quickly, and the convenience of construction of a complex relation graph in the financial field is improved.

The application discloses a node positioning method and device, and relates to the technical field of computers. A specific embodiment of the method comprises the following steps: acquiring a relationship node identifier set of each node according to edge data in graph data, and determining an initial root node in a preset mode; for the nodes in the relationship node identifier set of the initial root node, if the nodes are leaf nodes, the leaf nodes are separately grouped, and if the nodes are non-leaf nodes, the nodes are grouped according to connection characteristics; the order of the leaf node groups and the non-leaf node groups is determined to determine a new relationship node sequence; and the position information of each leaf node and each non-leaf node is calculated according to the new relationship node sequence and taking the position of the initial root node as a starting point. The embodiment takes the relationship node identifier set of the node as a calculation basis, and can quickly obtain a simple, ordered and efficient mesh graph layout calculation result without setting an initial configuration and without multiple tests, compared with an existing force-directed algorithm.

The invention provides a hierarchical automatic layout method and device for an internal module graph. The method comprises the following steps: forming a preliminary shape of a model graph layout; scanning each node, and if a nesting relationship exists, taking nesting information as a sub-graph of the current node; scanning each node of the nested information, and if a nested relationship exists, taking the nested information as a sub-graph of the current node to form a preliminary shape of a nested graph layout; determining a virtual connection line between different node nesting relationships; and correcting the initial shape of the model graph layout to obtain a final shape of the model layout. In the layout process, ports and graph element nesting conditions related to the internal module graph are considered, and the hierarchical automatic layout method completely covering the elements of the internal module graph is realized.

The disclosure provides a string-based graphical analysis method, which defines the hierarchy, layout direction, size ratio and state color of a graph by designing a nested string DSL, converts the string expression into standard structured data using an analysis engine, and finally dynamically generates a visual graph through a rendering engine; this method abstracts complex graph layout into dataable semantic templates, allowing users to quickly build and modify complex nested graphs in a minimalist text form, while relying on a color and state binding mechanism and standardized data output to achieve flexible definition, efficient parsing, dynamic rendering and real-time state updating of graph layout in server cluster monitoring, distributed system state display and other scenarios, effectively solving the problems of low development efficiency, high maintenance cost and lack of dynamics in traditional hard coding methods.

Disclosed herein are systems, methods, and computer-readable media for an exchange management platform that obtains, using artificial intelligence (AI) orchestrators, a set of available exchanges based on a set of exchange protocols. In some implementations, a first command set directs one or more AI orchestrators to generate, as output, a set of resources satisfying a first protocol from the set of exchange protocols. A second command set and a second protocol from the set of exchange protocols can then be provided, as input, to the one or more AI orchestrators, causing the one or more AI orchestrators to determine a set of available exchanges for transferring a resource between two entities. The set of available exchanges can be obtained from the one or more AI orchestrators and display of a graphical layout based on the set of available exchanges can be caused.

The invention discloses an equipment connection diagram scoring optimization method based on data analysis, and relates to the technical field of scoring optimization, and the method comprises the steps: carrying out the modeling of a communication equipment connection diagram through employing an attribute diagram, and converting a scoring problem of an equipment connection networking examination system into a similarity calculation problem between calculation attribute diagrams; the score optimization method comprises the following steps: defining a cost function in a graph editing distance; calculating a graph editing distance by using a DP-GED algorithm; converting the graph editing distance into a score by using score mapping; performing re-layout on the graph B by utilizing a Fuchterman-Reingold graph layout algorithm and the vertex corresponding relation L so as to realize clear comparison between the graph A and the graph B; according to the GEDS scoring algorithm based on the graph editing distance, compared with a system original VECS scoring algorithm, the GEDS scoring algorithm based on the graph editing distance is closer to expert scoring in the aspect of test data, and meanwhile it is avoided that wrong answers heterogeneous with standard answers are marked as full scores.

The application discloses a graph visualization controllable layout interactive generation method based on a deep diffusion model, and belongs to the field of visualization and human-computer interaction; the method comprises the following steps: (1) graph data enhancement; (2) deep diffusion model structure design for graph layout; (3) deep diffusion model pre-training for graph layout; (4) user uploading of graph data in JSON format; (5) user interaction for constructing expected layout constraints; (6) system analysis of the layout constraints and generation of graph visualization layout based on the pre-trained model; (7) system display of the graph visualization layout result and support for user exploration of the output of different models; and (8) user iteration for creating layout constraints to construct a data streaming visualization exploration process. The method discloses a graph layout method based on a deep diffusion model and an interactive graph visualization generation system, supports an analyst without a programming background to efficiently construct a graph visualization result meeting user requirements, and reduces the difficulty of user screening of a suitable graph visualization layout form.

Embodiments of the present disclosure provide for efficient global qubit placement within a quantum computing environment for a quantum program. Some embodiments utilize a graph-based approach to represent positions in a quantum computing environment, and optimize the graph layout using a graph processing algorithm to rearrange layers of a graph and reduce edge crossings. A layered graph associated with minimum cost is selected and utilized as an efficient layered graph for purposes of global qubit placement at various time steps of execution. Embodiments provide satisfactory approximations that avoid the NP-hard nature of this task to significantly reduce compilation time to a solution for global qubit placement as opposed to optimal global qubit placement while additionally identifying solutions that significantly reduce overall execution time and computing resource usage.

The application discloses a storage topology graph creation method and device, equipment and medium, comprising: acquiring an initial bipartite topology graph of a target storage system; determining a combination of second part storage nodes connected with each first part storage node, and determining a combination of first part storage nodes connected with each second part storage node; taking the average position of the second initial positions of all second part storage nodes in the combination of second part storage nodes as the first target position of the corresponding connected first part storage node; taking the average position of the first initial positions of all first part storage nodes in the combination of first part storage nodes as the second target position of the corresponding connected second part storage node; and reordering the first part storage nodes based on the first target position and reordering the second part storage nodes based on the second target position according to the same position front and back ordering sequence, to obtain a target bipartite topology graph. The topology graph layout can be simply and conveniently completed, and the topology graph layout is clear.

The invention discloses a page testing method and system for an application program, a medium and a product, and the method comprises the steps: determining whether a first GUI test case meets a repair condition or not, and if the first GUI test case meets the repair condition, determining second control information of a second control of a second target page of a second target application program according to the first GUI test case, according to the second control information, updating the first control information in the first GUI test case into the second control information, and generating a second GUI test case; and performing page function testing on a second target page of the second target application program by utilizing the second GUI test case. According to the method and the device, active error correction is realized when the graphic layout is changed and the pattern is changed, the graphic control is captured in a larger range, so that the change information of the control is automatically repaired by accurately positioning the graphic control, the automatic test efficiency is improved, and the maintenance overhead of a GUI test case is reduced.

System, methods, and machine-readable media to facilitate adaptive content composite interaction with respect to digitally distributed content are disclosed. Discovery may be performed, and events specified for digital distribution may be detected. A particular endpoint identifier mapped to media devices may be detected. Events may be determined as a function of access specifications. Content objects corresponding to the events may be received from a remote system via a network. Content composites corresponding to mapping specifications may be created for each content object with selecting and configuring an adaptable content object with the content object to form a content composite to facilitate presentation of the content composite. The content composites may be used to facilitate an augmentation interface with a graphical layout of the content composites, each causing display of an interface element allowing selective communications to a process-performing system to configure an executable function in accordance with parameters.

The application provides a graph layout optimization method and system based on force model parameter automatic search, acquires graph data, generates an initial graph layout result for the graph data, calculates the shortest path length between any pair of nodes in the graph, acquires the specified graph readability index of the user for the given graph data, generates a graph layout result satisfying the specified graph readability index according to the graph layout optimization method based on parameter automatic search, reuses the solved force model to new graph data to generate a layout result, and acquires the selection result of the user for the subgraph of interest in the layout result to perform local optimization on the subgraph corresponding to the selection result. The application can simultaneously satisfy the generation of corresponding visualization results according to the specified graph readability index and aesthetic criteria, so as to better show the structural characteristics of data, and simultaneously allows the user to perform interactive data exploration centered on analysis tasks according to requirements.

The application provides a hierarchical grouping rectangular association graph layout method and device, the method comprises the following steps: S1, constructing a tree data structure, presetting classification levels of the tree data structure, distances of different levels and a layout rectangular width-height ratio; S2, obtaining data, classifying and grouping the data according to attributes, and storing the classified and grouped data in the tree data structure constructed in the step S1, wherein leaf nodes of the tree data structure are grouping results of the data, and non-leaf nodes of the tree data structure are hierarchical results of the data; S3, traversing all nodes, judging whether only leaf nodes exist, if only leaf nodes exist, placing the leaf nodes after position calculation according to the predetermined distance and the rectangular width-height ratio, and if not only leaf nodes exist, executing the step S4; and S4, judging whether the non-leaf nodes are root nodes, if not, taking the non-leaf nodes as new leaf nodes, and returning to execute the step S3, and if yes, ending the operation.

A WebGL-based network graph processing method, apparatus, and electronic device are disclosed. The WebGL-based network graph processing method includes: creating an initial object based on WebGL, the initial object including multiple nodes and multiple edges connecting at least a portion of the multiple nodes; acquiring initial input data for the multiple nodes and initial input data for the multiple edges, the initial input data for the multiple nodes including the coordinates of the multiple nodes; iteratively updating the coordinates of each of the multiple nodes; and outputting the processed network graph based on the update result of the coordinates of each node. Thus, by combining WebGL technology with traditional graph layout algorithms, high-performance network graph layout on a web browser can be achieved.

The invention provides a pattern-layout decoupling-based stylized handwritten mathematical formula generation method, which comprises the following steps of: by taking a handwritten formula sample of a reference style and a target print body formula as input, encoding category information of mathematical symbols in the print body formula and position information corresponding to the mathematical symbols, extracting category features and overall layout features of local mathematical symbols of the standard mathematical formula; extracting style features of a reference style handwritten formula by using a style feature coding module, performing feature fusion on the style features of a reference sample and overall layout features of a standard formula through adaptive global feature fusion, and estimating layout information of the handwritten formula by using a layout generator; in combination with mathematical symbol category information and style characteristics of a standard formula, generating a handwritten track of each symbol based on a Gaussian density mixture model; integrating the position and the handwriting track of each symbol to generate a target handwriting mathematical formula; according to the method and the device, the stylized complex layout handwritten formula is generated by decoupling the character image generation and the geometric layout generation of the handwritten formula, the generation difficulty of the handwritten formula is effectively reduced, and the accuracy and the authenticity of the handwritten formula generation are improved.

The invention discloses a graph layout method based on semantic constraints. The graph layout method comprises the following steps: inputting graph data needing layout optimization; according to input graph data and / or external domain knowledge, semantic constraints suitable for the graph data are identified and defined, and the types of the semantic constraints comprise attribute-based constraints, relation-based constraints, domain agreement-based constraints and task-based constraints; performing formalized processing on semantic constraints, combining with traditional structural, geometric and aesthetic constraints, constructing a comprehensive layout optimization problem, and solving by adopting a proper optimization algorithm; and outputting a graph layout visualization result. According to the method, the defect that a traditional graph layout algorithm is insufficient in semantic information expression is overcome, domain knowledge, data attributes and user tasks contained in the graph are systematically converted into computable semantic constraints, and the information expression depth and cognition efficiency of graph visualization are remarkably improved.

The application discloses a three-dimensional visualization system and construction method based on Ethereum big data, which classifies Ethereum blockchain big data according to entities, and constructs an Ethereum head ecological network model by using a Spark computing framework. The whole Ethereum network model is laid out by using a three-dimensional force guiding model, and the Barnes-Hut optimization algorithm extended to three dimensions is introduced in the graph layout process. The local part is laid out on the surface by using a spherical layout method. Finally, the WebGL, ThreeJS and other WEB three-dimensional graphics rendering technologies are used to realize the visualization display of the Ethereum head ecological network on the WEB side. The user can view the three-dimensional visualization model of the Ethereum transaction network in different ways, so that the user interaction process becomes more smooth, the details of the three-dimensional visualization model are controlled more deeply, and the search function in the model is provided, so that the user can quickly locate the node to be concerned.

The application relates to a self-organizing network topology graph layout method, device and computer equipment. The method first obtains a node grouping position distribution graph through standardized position information of nodes, so that each interval obtained by subsequent position distribution graph division can be regarded as a unit quantity, and then interval distribution quantity can represent interval width / height; then, by sequentially comparing position relations of each node grouping and a previous adjacent node grouping, blank interval width / height between the two is determined, and a node interval end point of the current node grouping can be obtained according to the node interval end point of the previous adjacent node grouping, the blank interval width / height and the current node interval width / height; then, according to the node interval end point and the interval width / height of the current node grouping, the position distribution of the optimized node region in the position distribution graph can be determined, and corresponding scaling can complete layout optimization of the current node grouping. The method can realize adaptive scaling of node regions and blank regions.

The utility model discloses a machine vision calibration board with concentric circle arrays and sine characteristic lines, which comprises a rectangular substrate, the surface of the rectangular substrate is provided with concentric circle pattern arrays arranged regularly, and at least one sine curve characteristic line is arranged above the concentric circle pattern arrays. The concentric circle pattern array is regularly arranged in the whole calibration plate area, stable circle center feature points are provided, the sine curve feature lines cover the concentric circle array, and a high-contrast curve contour can be presented in an image. And the concentric circle positioning marks are used for assisting board surface direction detection and alignment. According to the utility model, the characteristic identification rate is obviously improved; the concentric circle pattern has strong rotation invariance and is easy to identify; multi-feature fusion improves precision: curve and circular geometric features are combined to improve fitting capability; the graph layout is reasonable; robust calibration under a wider visual angle and complex distortion can be realized; the method is more suitable for modern industrial scenes, and supports AI image analysis and rapid deployment of edge vision equipment.

Disclosed is method including receiving input graphical layout having cells forming grid structure cells are configured to be placed with objects to form GL; determining placement probability score for cells with respect to objects at first point in time; placing each object into IGL for forming GL, wherein placing given object into IGL include selecting given object, based on predefined placement schedule; identifying constrained cell(s) from amongst cells where predefined constraint(s) is violated if given object is placed thereon; adjusting placement probability score, for constrained cell(s), to be zero; adjusting placement probability score, for each cell of constraint-free cells, based on placement probability score for each cell of CFCs, and adjusted placement probability score for constrained cell(s), wherein given object is placed in constraint-free cell (C4) having highest adjusted placement probability score amongst CFCs.

This application provides a hierarchical graph layout method, an electronic device, a storage medium, and a program product. The method includes: obtaining the hierarchical depth of each child node under a parent node; determining the position coordinates of each child node in the parent container based on the initial position of the parent node in a parent container and the hierarchical depth of each child node, the position coordinates including horizontal and vertical coordinates; constructing a subtree structure in the parent container according to the position coordinates; and dynamically adjusting the size of the parent container according to the subtree boundary of the subtree structure in the parent container until the parent container matches the subtree boundary. This method can improve the hierarchical graph layout effect.

Disclosed is method comprising receiving input graphical layout (IGL) (206, 300) having cells (C1-4) forming grid structure (208), cells are configured to be placed with objects (O1-4) to form GL; determining placement probability score (210) for cells with respect to objects at first point in time (T1); placing each object into IGL for forming GL, wherein placing given object (O2, 304) into IGL comprises selecting given object, based on predefined placement schedule; identifying constrained cell(s) (C2) from amongst cells where predefined constraint(s) is violated if given object is placed thereon; adjusting placement probability score (212), for constrained cell(s), to be zero; adjusting placement probability score (214), for each cell of constraint-free cells (CFCs) (C1, C3, C4), based on placement probability score for each cell of CFCs, and adjusted placement probability score for constrained cell(s), wherein given object is placed in constraint-free cell (C4) having highest adjusted placement probability score amongst CFCs.

Provided is a method to generate a graph layout for an object-centric data model, wherein each object type of the data model is represented as a node and each object- to-object relationship is represented as an edge. The method comprises generating a hierarchy with a predefined number of levels and several node positions for each level. Each node is assigned to a node position of a level of the hierarchy according to an order of nodes that is determined based on how nodes connected to the respective node are assigned. The nodes are arranged according to the order of nodes in each level of the hierarchy, by minimizing crossings of edges with other edges or nodes.

The systems and methods disclosed herein receive an output generation request from that includes input for generating an output using a language model. The input includes a set of alphanumeric characters associated with operative standards for a first set of actions. The system divides the set of alphanumeric characters into text subsets. For each text subset, a vector representation is determined. Prompts are created for each vector representation including the set of alphanumeric characters, query contexts, keywords, and / or the text subset. Each vector representation's prompt is input into the language model, which generates a second set of actions of related actions, where subsequently generated actions are based on prior generated actions. The system aggregates the second set of actions into a third set of actions and displays a graphical layout. The graphical layout displays a representation of the set of alphanumeric characters and the corresponding actions.

The invention relates to the technical field of graph layout, in particular to a content-aware graph layout generation method based on an unsupervised domain adaptation technology, which comprises the following steps: acquiring a large poster graph layout data set; constructing a content awareness graph layout model PDA-GAN which is composed of a pixel-level discriminator PD and a layout generator G and is used for eliminating domain differences to generate poster high-quality content layout; an adaptive unilateral label is introduced to smoothly enhance the content aware graph layout model PDA-GAN; and quantitatively evaluating the layout generation performance of the PDA-GAN through three pre-established correlation indexes. According to the method, a pixel-level discriminator PD and a generator are designed for adversarial training based on a domain difference between a repaired image marked in a data set CGL-Dataset and a clean product image applied in reality in combination with an unsupervised domain adaptation technology, and an adversarial loss is calculated for each pixel point in an original input image; the problem of domain difference caused by pixels in a restoration area is eliminated at a pixel level.

This invention discloses a visualization and interactive analysis method for cloud computing network frameworks, comprising the following steps: obtaining a cloud computing network framework containing multiple functional layers; constructing a corresponding graph database using functional layers as entities and the flow direction of data and instructions between functional layers as edges; managing different data types within the functional layers using a force-guided graph layout model to construct corresponding logical relationship trees, where data types are nodes and the service relationships between data types are directed edges; and in use, performing visualization processing based on the constructed graph database to output a corresponding topology view, wherein the content of the graph nodes in the topology view is visualized in the form of a logical relationship tree. This invention also provides a device and an electronic device. The method provided by this invention reduces data size while preserving information characteristics, accelerates system operation, and improves user analysis efficiency.