40 results about "Partial graph" patented technology

The system has a collection of a plurality of objects. Each object defines a node in a k-partite graph, such that, the nodes can be divided into a number of mutually exclusive sets such that all of the nodes are in exactly one of the sets; further edges occur only between nodes in different sets; The system also has a simplification process that aggregates one or more of the nodes into one or more categories and identifies a category node corresponding to each category. The category node inherits the mode and the edges of all the nodes in the respective category. Further, the system contains Directed Acyclic Graphs Indices (DAGIs) whose nodes may have a 1-1 mapping with the nodes in the k-partite graph. These indices can be used to aggregate and hide nodes in the k-partite graph. Aggregation occurs by selecting one or more non-leaf nodes in the DAGI and aggregating all descendent nodes. Hiding occurs by selecting some set of DAGI nodes, thus selecting some corresponding set of nodes in the k-partite graph, and requesting this set of nodes be hidden which effectively removes them from further consideration until they are restored by explicit request.

Executing a user defined portion of an executable graph. The method includes providing to a user a graphical representation of an executable graph, the executable graph comprising executable modules. The method further includes receiving from the user a selection of a sub-portion of the executable graph. The method further includes executing the user selected sub-portion of the graph in isolation from other portions of the executable graph.

The embodiment of the invention provides a graph data processing method, which comprises the following steps of: S1, obtaining graph data containing a plurality of vertexes, sorting the vertexes according to the descending order of the vertexes, and taking a sorting serial number as a first resorting ID; S2, sequentially distributing the vertexes of the graph data to each distributed computing node in a distributed computing node cluster in a polling manner according to the first reordering ID and preset granularity; S3, traversing the obtained partial graph data by the computational nodes byusing a hybrid BFS algorithm, and obtaining a local next-layer active vertex set by each computational node after each layer is traversed; S4, after each layer is traversed, performing loop communication between adjacent computing nodes to transmit a local next-layer active vertex set, and determining the compression mode of the local next-layer active vertex set to be transmitted this time beforethe local next-layer active vertex set is transmitted after partial-layer traversal. According to the invention, vertex IDs are subjected to reordering, data compression and loop communication through the out-degree of the vertexes, and the communication efficiency is improved.

The invention relates to a process for cleaning high-precision screen printing plates, which comprises the steps of: 1 rapidly taking down a screen printing plate in one minute after printing, and collecting residual silver paste on the screen printing plate in two minutes; 2 simultaneously wiping the front side and the back side of the screen printing plate with non-woven fabric wetted in a TM plate washing agent along the direction of mesh stretching angles; 3 after the both sides of the screen printing plate are cleaned by the TM washing agent, simultaneously wiping the front and the back sides of graphics fields with non-woven fabric wetted in a DM plate washing agent along the direction of mesh stretching angles, 4 checking graphs with lights, if partial graphs are invisible, simultaneously wiping the front and the back sides of the field with non-woven fabric wetted in the DM plate washing agent along the direction of mesh stretching angles, until the graphs are visible, wherein the whole wiping process is not more than ten minutes; and 5 after the screen plating plate is wiped clean, drying the screen printing plate with an ion blower gun. The process can rapidly clean the high-precision screen printing plates completely, and is quite effective to plates with high-precision screen printing silver paste that is difficult to be cleaned, has low cleaning cost, and guarantees the normal production.

In a process and unit for gradual decoding, archiving and graphic display of progressively decoded image data, time intervals between the time points of consecutive decoding steps, during which network users receive ever more refined image resolution when downloading image data from a central network server to the client computer using transferred and decoded partial data quantities ΔLi as preview images, are generated with abbreviated time spans that are optimized with respect to minimization of system usage by the decoding system. For this purpose, the receiving data rates for transfer of the individual partial data quantities, which are taken into account through improvements generated by the individual decoding steps of a quality metric showing the degree of image resolution and the temporary usage of the decoding system upon determination of the decoding time points. The wait times between the time points of directly consecutive decoding steps are calculated using statistical image quality parameters of received partial image data in such a manner that the decoding steps which do not lead to a perceptible improvement in the quality of a reconstructed image are suppressed.

The embodiment of the invention discloses a data set expansion and training method and device of an image classification model, the image classification model is realized based on a convolutional neural network, and the data set expansion method comprises the following steps: for each picture sample in at least part of picture samples in a training data set of the image classification model, respectively executing the following operations: obtaining a class activation graph CAM of a preset class corresponding to the picture sample; obtaining an area corresponding to a preset target from the CAM graph by adopting a preset algorithm, and determining a position coordinate of the area in the picture sample; obtaining a cut picture from the picture sample by utilizing the position coordinates; and labeling the cut picture as the same category as the picture sample, and storing the picture sample into the training data set. According to the scheme of the invention, in the training process of the image classification model, effective training data set samples can be added.

An automatic designing system includes: a rule storage unit storing sets of rewrite rules for rewriting variable nodes of a hierarchically structured graph in a design architecture for the system; a search unit sequentially determining variable nodes as application targets for the rewrite rules by searching the graph, including components in the design architecture for the system to be designed, using a search tree; a judgment unit judging whether the rewrite rule is applicable to the determined variable node; and a rule application unit replacing the determined variable node with a partial graph, including at least one of fixed and variable nodes, according to the rewrite rule, in response to a judgment that the rewrite rule is applicable. The search unit performs the searching until an undefined variable node no longer exists in the graph to be designed, and performs backtracking on condition that no variable node is found.

According to one general aspect, a shard creation device may include a host processor interface circuit configured to communicate data and commands with an external host processor circuit. The devicemay include a controller processor circuit configured to merge graph data elements into merged dynamic shards, wherein the merged dynamic shards include the same number of graph data elements. The device may include a non-volatile memory configured to store data in an at least a partial graph structure, wherein the graph structure includes data elements that each include vertexes and an edge, andwherein sub-portions of the data elements are grouped into shards. A shard creation system is also provided.

The invention provides a model management method and device and electronic equipment, and the method comprises the steps: rendering of a first candidate component in a display object, and determininga first selected component through judging whether a rendering identification exists in a frame selection range or not; determining a second selected component by judging whether partial primitive vertexes corresponding to candidate primitives of the second candidate component are within the frame selection range or not; and determining a third selected component by judging whether all primitive vertexes corresponding to the candidate primitives of the third candidate component are within the box selection range or not. Rendering identifier judgment and primitive vertex judgment are combined to determine the selected component, so that the complexity of primitive vertex judgment is simplified, and the time for executing component selection is shortened.

Methods, systems, and computer program products for synchronizing data between a mobile application and an enterprise data source are provided. A computer-implemented method may include receiving a request for data from an application executing on a mobile device, receiving a document including the requested data from a data source where the document represents a graph of data having a plurality of nodes, and providing a partial graph of data to the application where the partial graph is derived from the received document and at least includes the requested data.

The invention relates to an image processing method and device, electronic equipment, a medium and a program product. The method comprises the following steps: acquiring a noise image on which a plurality of pattern elements are distributed; part of pattern elements in the noise image are sampled at each sampling moment, a pattern element graph corresponding to each sampling moment is obtained, and a plurality of pattern elements sampled at two adjacent sampling moments are not completely overlapped; and according to the sequence of the plurality of sampling moments, synthesizing the pattern element diagrams corresponding to the plurality of sampling moments into an element special effect diagram containing moving pattern elements. According to the invention, the noise image distributed with the plurality of pattern elements is directly sampled to obtain the pattern element graph, so that the special effect of pattern element movement can be added to the to-be-processed image by using the pattern element graph; the problems that the special effect of pattern element movement added to the to-be-processed image needs to depend on a corner detection algorithm and the special effect is easy to lose are solved.

The invention discloses a method and system for dividing a bounded incremental graph. The method includes: the coordinator divides the initial graph structure into a plurality of first subgraphs, correspondingly obtains a plurality of first subdivisions, and distributes the first subdivisions to multiple services; The partition is iteratively expanded, and during the iterative expansion process, it is judged whether the first sub-division reaches the preset equilibrium upper bound, and if the first sub-division reaches the preset equilibrium upper bound, the expansion of the first sub-division is stopped; the coordinator Confirm whether there is updated data; if there is updated data, first merge the updated data with the initial graph structure to obtain an updated partial graph structure, and then divide the partial graph structure into multiple second subgraphs, and the corresponding second subgraphs Partition, distribute the second sub-partition to the service, and perform iterative expansion by the service that receives the second sub-partition. The invention can reduce the calculation overhead when the distributed graph is divided, and make the division result more balanced.

The invention discloses an addition and processing method of small-size redundant graphs for metal wire layers. The method comprises the steps of dividing the original layout into a plurality of regions according to a design rule, calculating the graph density of the metal wire layers in the regions, dividing all the regions of the original layout into a first graph density region, a second graph density region and a third graph density region according to the graph density, selecting metal wires meeting addition conditions of the small-size redundant graphs from the regions, adding the small-size redundant graphs for the selected different metal wires located in the first graph density region, the second graph density region and the third graph density region according to the graph size and the quantity, merging the small-size redundant graphs to the original main graph of the metal wire layers in the original layout, and performing optical proximity correction. The method can really realize a change from isolated metal wires to dense metal wires and can achieve purposes of increasing a photolithographic technology window of the selected partial metal wires and improving the selected partial graph density.

Embodiments of the present invention provide a computer-aided method, system and computer program code product for pattern drafting in the field of apparel. In one embodiment of the present invention, a pattern making method includes: acquiring a series of different two-dimensional images of the human body from the storage of the computer; selecting cloth strips of partial patterns of clothing by the processor of the computer; a processor of a computer making metric calculation rules for said selected strip of said two-dimensional image; acquiring a measurement value of said two-dimensional image by said processor of said computer; and said processing by said computer The device generates a measurement value for the selected cloth strip by using the acquired measurement value according to the created metric calculation rule.

The application discloses a data processing method, a data processing system, computer equipment, and a storage medium, which belong to the technical field of graph computing. In the method provided by the embodiment of the present application, by using a data processing system with a distributed architecture, each computing node in the data processing system stores part of the graph data, and in the encoding stage, each computing node performs an aggregation first, and then calculates Interaction of vertex IDs between nodes to complete the second aggregation. Through the above two aggregation processes, each computing node can store a full amount of vertex IDs. In the decoding stage, decoding can be completed without communication, which can reduce The overall communication volume improves the efficiency of algorithm execution.

The invention discloses a stream type equilibrium diagram division method and belongs to the field of parallel diagram calculation. According to an algorithm, for a characteristic of power-law distribution of most diagrams in reality, firstly an original input diagram is quickly subjected to community detection under a constraint condition; secondly communities are sorted; and finally vertexes are allocated to a specified processing unit in sequence according to a deterministic greedy flow algorithm. Compared with a conventional division algorithm, the division quality and the division efficiency are greatly improved. The stream type equilibrium diagram division method is suitable for task division in parallel computing of large-scale networks of power-law distribution.

The invention provides an optical imaging film, which comprises an imaging layer and a micro image-text layer; the imaging layer comprises a plurality of imaging structures which are periodically distributed; the micro image-text layer comprises a plurality of micro image-texts which are periodically distributed, and the micro image-texts are arranged corresponding to the imaging structure, so that the optical imaging film forms a target image with an amplification effect; the micro image-texts are partial graphs of the target image, and the plurality of micro image-texts can form a complete graph consistent with the target image. Compared with a traditional optical imaging film, the optical imaging film provided by the invention has the beneficial effect that a larger Moire image can be displayed.