48 results about "Graph operations" patented technology

The invention is suitable to the independent motion vehicles environment sensation monocular visual navigation method, first surveys the camera distortion parameter, puts the camera on the independent motion vehicles, determines transformation relation from image plane coordinate system to world coordinate system; then records current car body posture, gathers the picture in the current car body visible scope, feedback the picture to the picture operation contact surface in order to definite the walk mode of the car body and do distortion correction on the gathering picture, select the path and the path spot on the path, according to the coordinates transformation relations under the world coordinate system put the current position and choice path result to the car body and demonstrate on the graph operation contact surface by the car body width; the car body walks according to the independently evades bonds or the way track way till the current visible scope last way spot, and then circling start from the gather picture to the final object point. The invention applies the monocular measuring technique in the unknown environment the visual navigation.

A system for autonomous management of risk transfer is provided, comprising a network-connected server configured to provide an interface for a requester to submit a request; an automated underwriting processor configured to: create a contract block by compiling the request into a computational graph-based format, link the contract block to the requester, store the contract block into memory, retrieve a plurality of available underwriting agreements from memory, and create an offer list by perform computational graph operations on the contract block to determine viable risk-transfer agreements; and presenting the offer list to the requester.

In order to solve the problems that in the existing graph operation interface, the operation is complicated, and the finding of application programs (functions, files and the like) is inconvenient, the invention provides a bran-new graph menu display method, which has the advantages that the interface operation of a graph menu is simpler, and the finding is more convenient. The method provided by the invention is characterized in that on the graph interface, the use probability (the use duration, the use times, the use importance and the like) of application program icons is counted at any time, then, all application program icons are graded, the application with the higher use probability (the use duration, the use times and the like) obtains higher weight, and in addition, the icons of the application programs (the functions, the files and the like) are optimized so that a better display effect is obtained.

The invention is applicable to the technical field of internet, and provides a game development method and a game development device based on HTML5. The game development method comprises the following steps: establishing at least one game frame; establishing a game resource bank, wherein the game resource bank comprises a plurality of resource files, and the resource files are basic elements for forming the scene or the sound of a game; establishing a game editor, wherein the game editor comprises a graph operation interface, and a developer can select a game frame and/or a resource file through the graph operation interface at a client side; setting the game frame selected by the developer as a game execution frame; operating the game according to the game execution frame, and scheduling the resource file selected by the development in the game operation through the game execution frame. By adopting the game development method and the game development device, the game development threshold is eliminated, non-technological ordinary fans can develop and modify games on equipment supporting an HTML5 browser, the game development is greatly popularized, and the development resource is also saved through resource reuse.

The invention discloses a bridge reinforcement assembly graph adjusting method applied to bridge design software, providing a visual graph operation interface for editing skeleton reinforcing steel bar information for bridge construction member design software, and allocating corresponding skeleton reinforcing steel bar to bridge construction member by icon operation. A designer only needs to click all the icons on the visual graph operation interface by mouse, so as to conveniently display the required skeleton reinforcing steel bar information. The designer drags the information icon for skeleton reinforcing steel bar by mouse, and a corresponding changing drawing of the adjusted skeleton reinforcing steel bar can be seen, the dragging is carried out until the skeleton reinforcing steel bar is adjusted to the expected effect position. The icon reflecting the skeleton reinforcing steel bar information and the adjusted skeleton reinforcing steel bar are linked and are corresponding in real time. The invention effectively simplifies the original trivial procedure that skeleton reinforcing steel bar information is input manually, skeleton reinforcing steel bar is allocated to bridge construction member by operating the icon for skeleton reinforcing steel bar, operation is simple, and time and effort can be saved.

The invention discloses a method and a device for identifying an associated specific account, and a storage medium. The method comprises the following steps: firstly, constructing an isomorphic directed graph according to associated data between accounts within a period of time; then, according to some specific modes of the specific account, finding out a seed node which may be the specific account from the isomorphic directed graph; then, finding a connected sub-graph containing the seed nodes; dividing the connected sub-graph into a plurality of communities according to a community discoveryalgorithm, and evaluating each community to obtain a score corresponding to each community; and then, determining the community with the relatively high risk as the target community, and wherein theaccount represented by the node in the target community is the identified associated specific account. Therefore, by using the method, associated specific accounts can be automatically identified fromlarge-scale associated data by using data mining methods such as graph theory, graph operation, community discovery, social network analysis and the like through unsupervised learning.

A method, system and computer program product for integrating implication-based analysis and equivalent gate analysis to maintain transitive reduction in an implication graph over a sequence of graph operations. One or more gates of a design are identified that are equivalent in all reachable states. Equivalent gates are assigned to an equivalence class when all gates within the equivalence class are equal. During the implication-based analysis the system determines when one or more implication paths are associated with the one or more equivalence classes, and an implication is generated at the implication path associated with the equivalence classes. A transitively reduced graph is received depicting the implications and equivalence classes of the design. When one or more operations are assigned to the transitively reduced graph, the graph is automatically adjusted to maintain transitive reduction.

The invention discloses a multi-account relevance method and device, and electronic equipment. The multi-account relevance method comprises the following steps: obtaining the URL (Uniform Resource Locator) information of a user network behavior; according to a network entry rule, regularly mining account information from the URL information; filtering the account information, and ejecting dirty data; on the basis of the URL information and a Refferer message, generating multiple pieces of Session for the filtered account information at set time intervals; extracting the account information under the same Session to generate an account information group with a relevance relationship; according to the relevance relationship, calculating the support degree and the confidence coefficient of each account information group; and on the basis of the support degree and the confidence coefficient, carrying out graph operation on the account information group to generate an image of the relevance relationship. The multi-account relevance method fully mines the Internet access behavior information of a user and improves the classification accuracy and integrity of the user account information.

A general complex structure graph constructing method and the associated computer program is described. The generators and initiators selected by the user are used as the geometrical graphing basis. Using the transformation information of the generators and the operation information between the generators and the initiators, the geometrical transformation and duplication of the objects are performed according to the definitions of duplication objects and connecting objects. This implements the geometrical graphing of complex structures. It is characterized in that: the operations are performed in a visualized way, including graphing operations (e.g., generation of objects), parameter transmissions (e.g., shifted duplications), and data generation (e.g., generation of a geometrical graph). Since the operations are simple and can be implemented on all computer executable platforms and is suitable for artistic designs, graphing, and teaching.

The invention provides a high-speed railway ticketing system, and the system comprises a controller, a touch display, an ID card recognition module, a card slot, and a cash slot. The system carries out the ticket selection through a step of hierarchical graph operation. According to the geographic position of a current station, the first-level operation enables all stations to be classified into stations in a province and stations outside the province; the second-level operation enables the stations in the province to be listed completely, and the amplification processing of the popular stations is carried, and then the stations outside the province are classified again, wherein the classification level is the administrative region at a provincial level; and the third-level operation enables all stations in the province to be listed completely, the amplification processing of the popular stations is carried and the edge of a screen is provided with a quick operation region, so as to display the popular station in the country in a rolling manner and bring convenience to passengers for clicking. Through the graded operation, the system greatly simplifies the ticket buying convenience, and enables a passenger who carries out the self-operation without inputting a destination under the condition that the passenger does not know train conditions to determine the destination and the train condition through graph selection. Therefore, the system is easy to operate, avoids the address typing, and is suitable for many groups.

The present invention establishes a process for creating a set of structures that allows efficient storage and subsequent handling. The multigraph is represented using bitmaps with element counters and mappings between values and organized bitmaps to faciliate the handling of the multigraphs. The bits in the bitmaps represent two aspects of the multigraph: 1) indexing of all the objects of the multigraph as a function of their identifiers and 2) connectivity between objects of the multigraph, whether they are vertices or edges. Mappings allow, given a value, accessing the objects of the multigraph which contain such value. Multigraph operations are solved by accessing the mappings and applying logical operations on the bitmaps. This way of representing a graph allows efficiently performing graph operations such as: inserting a vertex or an edge, inserting an attribute, acquiring the incoming and outgoing edges of an attribute, etc.

The invention provides a graph neural network application-oriented task scheduling execution system and method, and the method comprises the steps that a to-be-transmitted graph operator cache modulereads a to-be-processed graph operator processing request, and obtains needed input data from a cache according to a graph operator label of the to-be-processed graph operator processing request; thetransmitting unit transmits the to-be-processed graph operator processing request and the input data to a unified structure processing unit based on the static data stream; the unified structure processing unit maps the input data to the input of the corresponding binary operation tree according to the graph operator code of the graph operator label and the graph operator execution frame, and completes the current round of operation to obtain an intermediate result; the label generator generates a new graph operator label according to the label information of the previous round of operation; the unified structure processing unit returns the intermediate result and the new graph operator label to the to-be-transmitted graph operator cache module; and circularly execution is performed untilthe residual repetition frequency value in the graph operator label is 1, and the current intermediate result is written back to the cache.

The invention discloses a compression storage and calculation method for high-dimensional interpolation. The compression storage and calculation method comprises the following steps: recursively constructing a deep storage tree of an interpolation independent variable according to the interpolation independent variable of each dimension of an interpolation table for searching an interpolation interval of each dimension, constructing a dynamic interpolation binary tree according to the interpolation independent variable, converting an interpolation calculation process into graph operation on the tree, and finally obtaining a result. The storage tree structure of the multi-dimensional interpolation table greatly compresses the storage overhead of repeated data; and the establishment of the dynamic interpolation binary tree unifies the interpolation process of a linear interpolation space and a nonlinear interpolation space, simplifies the calculation, and is helpful for chip-level implementation to greatly improve the efficiency of high-dimensional interpolation calculation. A tree type and binary search method is combined, so that the time expenditure of performing linear sequentialsearch on interpolation coordinate vectors in a traditional method is avoided, and the search efficiency is improved from a linear level to an exponential level. Along with the increase of the orderof magnitudes of problem dimensions, the advantages are more obvious.

The invention relates to an NFV-device-based system performance detection and optimization method, which comprises the following steps: 1) detecting system configuration; 2) setting performance parameters; 3) automatically acquiring performance events in correlation with the system broadband and delay; and 4) based on the sampling results, making an analysis of and optimizing the performances. According to the method of the invention, through the use of a configuration strategy of a software manner to optimize system hardware and software, it is possible to prevent or make breakthrough the limitations of bottleneck performances and to indicate the detection points having influence on the performances, which increases the positioning efficiency of performance bottleneck. The targeted configuration of a series of performance parameters increases the automation of system deployment. Based on the feedback of the actual operation of the equipment, the performance characteristics are analyzed in quantity. In combination with the quantitative result, improper factors and code defects of environment configuration can be found out so as to further improve the system performances. The availability of graph operation interface facilitates the positioning of defects by the development people, therefore, making the method widely applied.

The invention provides a data analysis method and apparatus, which can meet real-time analysis and real-time access requirements of batch data at the same time. According to the data analysis method,an interface adaptation layer is arranged between a column type database and a distributed graph inquiry engine. The method comprises the steps of converting a graph operation command of the distributed graph inquiry engine and sending the graph operation command to the column type database.

The invention belongs to the technical field of construction application of subway rails, and particularly discloses a shield tunneling interval risk management system based on construction of a shield tunneling machine. The system comprises a shield tunneling construction real-time monitoring unit, a database connection reading module, a data processing module, a graph output module and a graph operation module. The database connection reading module, the data processing module, the graph output module and the graph operation module are connected with the shield tunneling construction real-time monitoring unit. The shield tunneling interval risk management system based on construction of the shield tunneling machine has the beneficial effects that 1, the technology is applied to development of an information system, so that the flexibility, the expandability and the reusability of the system are enhanced; 2, access to a database is carried out through an ADO technology, data automatically acquired in shield tunneling construction are read, access to the database is carried out through the ADO technology, connection with a database interface is carried out with an ODBC method, and an ADO is an object model based on an OLE DB, and comprises all data types capable of being described by an OLE DB standard interface; and 3, by means of a programming technology oriented to objects, multiple two-dimensional graphs such as curve charts, bar charts and pie charts are output.

The invention discloses a method for temporarily changing a power grid topological structure. The method includes the steps that firstly, when temporal head detaching and head lapping are conducted on a transmission line and the connecting relation between a power grid topological structure and an element is changed, a broken line board is used as a mark symbol, and a broken line mark is displayed on a corresponding circuit; secondly, the mark position with the hung broken line board serves as a kind node, and a kind node database is established; finally, a conflict resolution strategy is introduced in. The method solves the problem that a graph dispatching operation system changes the connecting logic of the power grid structure and the element due to temporary work in practical work, so that an operation order system cannot work normally, and therefore the functions of the graph operation order system are improved.

The invention provides a graph calculation method and system based on dynamic code generation, and the method comprises the steps of constructing an intermediate graph structure containing a graph operation primitive according to a graph building request, enabling the intermediate graph structure to be associated with a graph name, and then storing the associated intermediate graph structure into an intermediate graph buffer; according to the graph algorithm request, generating a graph algorithm structure composed of the external code byte codes, and sending the graph algorithm structure to a graph algorithm buffer; retrieving the intermediate graph buffer and the graph algorithm buffer according to the execution request to obtain a triple composed of the intermediate graph structure to be executed, the graph algorithm structure to be executed and the parameter list, and retrieving the triple in the local code buffer to obtain an execution object in the local code buffer so as to obtain a result through execution. According to the present invention, the generated codes are injected into a local code space, so that the overhead of data exchange is eliminated; the intermediate graph structure capable of being secondarily compiled is constructed, so that access codes of the graph data can be compiled and optimized; meanwhile, the intermediate graph structure cache and the graph algorithm cache are added, so that the preprocessing expenditure of the graph calculation is avoided.

The invention discloses a closed path region background custom filling and dynamic updating method. The method comprises the following steps: drawing an arbitrary closed path on a canvas; after the closed path is selected, clicking a right key of a mouse, and displaying a selection graph operation function menu; popping up a user-selected picture path window after selecting the filling picture; after the user selects a picture to be filled, clicking a determination button, generating a cut Piece which takes the picture selected by the user as a background according to the closed area of the closed path, and adding the cut Piece into a graph container shape vc; modifying the closed path and updating the display range of the background picture at the same time, and selecting all paths of thecut-parts; clicking the anchor pointd by a left key, dragging and modifying the closed path, and judging cutPieces of which the types are cut piece types in the shape vc; if the judgment condition ismet, storing background picture data image data in the cut piece, and deleting the cut piece; and after the path is updated, transmitting the image data into the process of generating the cut-parts again.