105 results about "Numbering" patented technology

The invention discloses a geographic coding method comprises the following steps: a. confirming geographic positions; b. confirming a No. i coding precision; c. carrying out No. i partition, so as to partition the surface of the earth into a plurality of subsections; numbering, that is, each subsection is partitioned and coded continuously till each partitioned subsection is related to the No. i coding precision; d. acquiring the number of an assigned geographic position in a corresponding subsection, judging whether the assigned geographic position is in the boundary area of the corresponding subsection or not, and coding to obtain a one-dimensional No. i geographic code and a one-dimensional No. i boundary mark; repeating the steps b to d for N times; e. combining the N geographic codes and N boundary marks. The invention further discloses a position inquiring system and method adopting the geographic coding method. According to the invention, approximate inquiry of an optional assigned position from an optional assigned range and neighboring positions can be realized conveniently and fast; suitability for fast mass position matching approximate inquiry is realized.

A multiple-input multiple-output s-box receives a contiguously numbered input bits (101, 102, 103, 104, 105) I1, I2 to Ia, where a is at least 4, and outputs b contiguously numbered output bits (131, 132, 133, 134, 135) O1, O2, to Ob. The s-box comprises c primitive s-boxes (121, 122, 123) sb1 sb2 to sbc. Each primitive s-box (121, 122, 123) has a multiple-input single-output Boolean function ƒ1, ƒ2, to ƒo defining the relationship between the multiple inputs and the single output. Each primitive s-box (121, 122, 123) receives a set of input bits s1, s2, to sc, respectively, each such set is chosen from the a input bits (101, 102, 103, 104, 105) to the s-box and containing sl1, sl2, to slc bits respectively. Each of the numbers sl1, sl2, to slc, is in the range of 3 to (a−1), and the sum of the numbers sl1, sl2, to slc is larger than a. The b output bits of the s-box (131, 132, 133, 134, 135) are the outputs of the c Boolean functions.

Disclosed herein is a system and method for generating a BIM geometry breakdown structure. The system includes a geometry breakdown system (GBS) range setting module, a GBS geometric object coding module, and a GBS geometric object coding module. The GBS range setting module sets the range of a GBS based on BIM framework variables. The GBS element definition module generates “standard information breakdown property information” that is used to manage work-type breakdown and location breakdown, “project numbering system (PNS) property information” that is used to manage a work breakdown system (WBS), a cost breakdown structure (CBS), and a standard-method-of-measurement (SMM) breakdown structure (MBS), and “GBS property information” that is used to define geometric information. The GBS geometric object coding module matches geometric objects to the “standard information breakdown property information” and the “PNS property information”, and assigns numbers corresponding to the “GBS property information” to the matched geometric objects.

The invention discloses a method for processing a vector graph by utilizing a key proportional scale and a similar tile technology. The method comprises the following steps of performing grading on elements in a topographic map and naming levels; performing rectangular block segmentation on each level, and performing numbering; calculating out the key proportional scale of each level, calculatingout a display scale of the level, and performing storage; determining tiles and performing numbering; and performing storage on each piece of tile data, comprising a tile number, a size, a position and graphic data, as a whole body. According to the storage method, the response speed can be remarkably increased during opening as well as panning and zooming of the vector graph in quality graph making software.

The invention relates to a method for drawing an exploratory point planar graph on the basis of the Excel. The method comprises the following steps of: 1, setting an Excel template file, i.e. setting a corresponding worksheet, wherein the worksheet at least comprises a header, a column number acquisition region, a CAD (Computer Aided Design) batch command generating region for expressing graph blocks and characters of different exploration holes, a hole coordinate input regions of the exploration holes and an element input region; 2, setting a CAD template file, including steps of setting corresponding drawing layers and defining the graph blocks and graph block names as per the elements, and programming a small program of 'numbering and coordinate extracting.dvb'; and 3, by loading the small program of 'numbering and coordinate extracting. dvb', generating a corresponding Excel table, acquiring the coordinates of exploratory points so as to obtain the worksheet, starting a CAD batch command and drawing the exploratory point planar graph. The method has the advantages that the method is simple, is easy to operate, is flexible and changeful, has strong adaptability, is convenient to carry out batch regulation and modification and has large data capacity; the time of generating the exploratory point layout plan in the investigation project is greatly shortened; and the working efficiency is improved.

The invention relates to a method for transmitting information based on two-dimension bar code, wherein said information has type characters; and the inventive method comprises that (1) building the type list between different type character and serial number; (2) decomposing the exchange original information into information blocks, to be separated by separators, while each information block is arranged by their sequence in the original information; (3) numbering the different type characters, and arranging them by the sequence of information blocks in original information, to obtain the character information; (4) forming two-dimension bar code from character information and information blocks via the code method of two-dimension bar code; (5), reading out two-dimension bar code, to obtain the character information and information blocks; (6) reducing the character information into type information, while they are one-to-one relative. The invention can keep original character information, and effectively treat the content after exchange, while the two-dimension bar code has minimum size in same resolution.

A method for constructing a simplified trellis diagram for BCH-encoded information is disclosed. BCH-encoded information is received, having a corresponding parity check matrix H. The parity check matrix H is expressed as an ordered sequence of columns of matrices. A sequence of sub-code words is provided, corresponding to one or more code words, each satisfying a given condition. A matrix Hcp, having columns that are generated as a selected permutation of the columns of the matrix H through a column-permutation-for-binary-matching process, is provided, and a sequence of sub-matrices and a corresponding sequence of permuted sub-code words is provided. A trellis diagram, representing an ordered sequence of code word transitions in the received information and symmetric about a central location, is provided for each code word c, connecting n+1 stages, numbered i=0, 1, . . . , n, in an ordered sequence.

The embodiment of the invention discloses a graph data storage method and device, a graph data processing method and device and a computer storage medium, and belongs to the technical field of graph databases. The method comprises the steps of acquiring target vertex sequence numbers of target vertexes stored in a target partition, storing a plurality of vertexes in the target partition, wherein the vertexes correspond to the vertex sequence numbers respectively; obtaining a partition number of a partition where the other vertex of each edge in one or more edges associated with the target vertex is located, a vertex sequence number of the other vertex and the direction of each edge, and obtaining target edge data corresponding to the target vertex sequence number; and writing the target edge data into a side data file in the target partition, wherein the side data file is used for storing side data corresponding to each vertex sequence number. According to the embodiment of the invention, the partition numbers of the partitions where the vertexes are located and the vertex sequence numbers of the vertexes in the partitions are used as identifiers, so that the memory required for graph calculation is reduced, and the calculation performance of the calculation nodes is improved.

The present invention discloses a method for automatically generating the related work in a proactive academic paper, and belongs to the technical field of computer natural language processing. The specific operation steps comprise: 1 constructing a large-scale corpus based on the related work in the English academic papers and the abstracts of the references cited in the related work; 2 trainingthe neural network of a hierarchical encoder-decoder structure based on the residual attention according to the constructed corpus, and performing multitask learning according to the loss value of thereference number cited in the sentence and the loss value of the word in the sentence; and 3 inputting multiple abstracts into the trained neural network, and generating the corresponding related work word by word and sentence by sentence. Compared with the conventional extraction method, by using the method for automatically generating the related work in a proactive academic paper proposed by the present invention, not only each word in the related work can be automatically generated, but also a plurality of reference numbers can be assigned to each sentence in the generated related work.

The embodiment of the invention provides a position query method and device, computer equipment and a storage medium. The method is applied to the field of data query in data processing. The method comprises the following steps: encoding all position points in a preset data set according to a geohash algorithm to obtain character strings corresponding to the position points; sorting and numberingall the position points in the preset data set and the character strings corresponding to the position points according to the lexicographical order to obtain a target data set, and constructing an extended dictionary tree according to the target data set; converting the extended dictionary tree into a double-array dictionary tree; if a query instruction is received, querying the double-array dictionary tree according to the query instruction to obtain position points in a query domain; and verifying the position point in the query domain to obtain a target position point. By implementing theembodiment of the invention, the effects of effectively supporting any spatial range query, improving the index structure performance, improving the retrieval efficiency and being higher in coding adaptability can be achieved.

A method of calculating and encoding a score of semantic and spatial similarity between concepts of an ontology stored in hierarchically numbered trellis form, in which the score (NSSij) is calculated and encoded (1) for each concept (Ci) with respect to a central concept (Cj), taken two-by-two, by convergence relative to their common semantic characteristics respectively by separation according to their distance. The method is applicable to the consultation of ontologies representative of knowledge in the technical or non-technical domain.

A method of calculating and encoding a score of semantic and spatial similarity between concepts of an ontology stored in hierarchically numbered trellis form, in which the score (NSSij) is calculated and encoded (1) for each concept (Ci) with respect to a central concept (Cj), taken two-by-two, by convergence relative to their common semantic characteristics respectively by separation according to their distance. The method is applicable to the consultation of ontologies representative of knowledge in the technical or non-technical domain.

The invention discloses a method for acquiring frame structure information based on Revit secondary development in combination with Ansys command stream. The method comprises the following steps: developing an information export operation interface; creating a structural column and a frame beam of a frame structure model; obtaining geometric information of the structural columns and the frame beamcomponents in order; creating a structural plate; obtaining geometric information of the structural slab components in order; and copying the command stream of the geometric information to Ansys software, and automatically generating a model. The method is used for solving the problem that body cannot be generated or the generated body is in a distorted state due to the extracted geometric information of the Revit frame structure model cannot meet the high requirement of Ansys software on the numbering sequence, the framework model established by Revit software is imported into Ansys software, a model is provided for subsequent analysis operation, the operation of repeatedly inputting key point numbers and coordinates in the Ansys software is avoided, and the application of the building information model in the aspect of structural design is enhanced.

The invention discloses a sparse subspace clustering method based on selective coordinate descent optimization. The method comprises the following steps: 1, establishing a sparse subspace clustering model, substituting the sparse subspace clustering model into the Lasso formula, converting the sparse subspace clustering model into a quadratic programming problem, and solving a similarity matrix; 2, starting to solve the similarity matrix, traversing all features in the first time iteration by using a coordinate descent method, and using a calculated solution as an initial value; 3, starting from the second time iteration, traversing each feature, if the current solution item is non-zero, updating the feature of the coordinate position by using the coordinate descent method; otherwise, skipping the update of the feature of the coordinate position; repeating the process until the convergence of an objective function; and 4, after the similarity matrix is obtained, performing a spectral clustering process to obtain a classification serial number. According to the sparse subspace clustering method disclosed by the invention, whether the current solution item is zero or non-zero is quickly judged by using an infinite norm rule, thereby avoiding an unnecessary calculation process of a zero item result and shortening the time of optimization solution; and the effect on large-scale sparse problems is extremely obvious.

The invention discloses a serial number generation method and device, a storage medium and electronic equipment, and the method comprises the steps: obtaining a serial number rule from a serial numberrule list according to configuration information, determining a sub-rule and a serial number sequence of the sub-rule according to the serial number rule, and finally carrying out the serial number processing of the configuration information, and obtaining a target serial number. The numbering rules are determined through the numbering rule list configured with the numbering rules, and the corresponding sub-rules are determined, so that the number of the numbering rules configured in the method and the number of the sub-rules are multiple, the generation method of the number can meet different numbering rules, and an operation program corresponding to the generation method of the number can be met; and the program does not need to be modified after the numbering rule is changed, so that the program operation and maintenance cost is reduced.

The invention is used in data processing device. The method comprise: searching the explain word and / or part numbering in the design graph; detecting if the reference location of the explain word and / or part numbering is fixed at a first positioning angle and / or a second positioning angle; when the reference location of the explain word and / or part numbering has a 180 degree rotation in relation to first positioning angle and / or second positioning angle, the explain word and / or part number is rotated 180 degree; confirming if the explain word and / or part numbering after rotation is offset from the original position; if yes, recovering the explain word and / or part numbering to the original position.

The invention provides a method for recognizing text segments by using sequence annotation, which comprises the following steps: A, respectively segmenting different text segments of a sample set intoclause sets, and annotating the clause sets by using semantic feature vectors to form semantic feature vector sets; B, performing clustering training on the semantic feature vector set to obtain a clustering model, and performing cluster numbering on each object of the clustering model to form a sequence model; C, establishing mapping between the sequence model and the different text fields, andtraining a sequence labeling model for the mapped cluster sequence; and D, sequentially applying the sequence model and the sequence labeling model, and segmenting the text to be segmented. The methodperforms standardized modeling by taking the sample set as a database template. And during subsequent text segmentation recognition, the method includes standardizing the sentence pattern model in the to-be-segmented text, and mapping the standardized sentence to the sentence features according to the model, so that different expressions representing the same semantics can be expressed to complete text segmentation recognition.

The embodiment of the invention provides a node fusion method and device and a code generation method and device. The node fusion method comprises: numbering nodes according to a dependency relationship among the nodes in a target calculation graph, connecting the nodes with the dependency relationship in the target calculation graph through edges, enabling each node to correspond to one tensor operation, and enabling each edge to correspond to one tensor; and determining a layer where the node is located according to a numbering result, determining a hierarchical graph corresponding to the target calculation graph, and carrying out layer-by-layer fusion of tensor operation according to the hierarchical graph, therefore, the nodes without dependency among layers can be fused as well, the calculation granularity of the fusion operation obtained after node fusion is enlarged, and the problems that in the prior art, the calculation granularity of the fusion operation obtained after fusionis small, and the calculation performance of an existing hardware platform cannot be brought into full play are solved.

The invention discloses a method for implementing partition load balancing in a Spark environment. The method comprises the steps of receiving a Spark application sent by a user, and analyzing the Spark application program to obtain an analysis result, wherein the RDD graph represents the relationship among the plurality of elastic distributed data sets RDDs, and the directed acyclic graph DAG isused in the scheduling stage; sequentially determining a dependency relationship between every two adjacent scheduling stages according to the DAG graph; numbering the wide dependency relationships inall the obtained dependency relationships; setting counter cnt = 1, and judging whether the cnt is greater than the total number of the wide dependency relationships or not; and if not, sampling datain all partitions in the last RDD in the Map end corresponding to the cnt-th wide dependency relationship to obtain hash tables which represent data key distribution and correspond to each partition,and merging the hash tables corresponding to all the obtained partitions. According to the method, the problem of data inclination in big data calculation can be solved, meanwhile, allocation of calculation resources is optimized, and the program running time is shortened.

The invention discloses a digital process management method and system and a storage medium, and the method comprises the following steps: S1, setting a two-dimensional code on each workpiece, and enabling the two-dimensional codes to be in one-to-one pairing with the workpieces through a preset numbering rule so as to number the workpieces; S2, after one production process of each workpieces is completed, scanning the two-dimensional code corresponding to the workpiece, and recording production process information of each workpiece in the system by scanning the two-dimensional code; S3, allowing workshop management personnel to confirm the flow and the real-time process of the workpieces according to the production process information of the workpieces recorded in the system; and S4, after all the procedures are completed, allowing the system to obtain the completion rate of the production task, the percent of pass of the product and the rework rate information according to the two-dimensional code information scanned in all the procedures, and uploading the information to workshop management personnel. According to the method provided by the embodiment of the invention, the intelligent level of the workshop can be improved, manual operation is reduced, and manpower and material resources are saved.

The invention belongs to the technical field of data analysis and data mining, and particularly relates to an AI-based objectified attribute text automatic classification method and system, and the method comprises the following core steps: building a character coding library, carrying out character decomposition on all text data which are stored in a library in history, numbering single characters uniquely in the library, and integers being used as self-increasing numbers according to numbering rules; preprocessing standard attribute data, extracting stored standard data as to-be-trained data, and limiting the length of a character string to be 60 Chinese characters, such as drug general names, drug specifications, drug production enterprises, approved numbers and the like, and clearly expressing fields of data attribute characteristics. Through the invention, the subject attribute category described by a section of data can be quickly judged, and then whether the attribute category is consistent with the subject design or not is judged; in addition, attribute classification judgment can be carried out on a plurality of adjacent data, and the position of the main body description information can be positioned in the webpage.

The invention provides a distributed test case execution system and method, and the system comprises a temporary code storage unit, a code test cluster unit, and a summarizing unit, and the code testcluster unit comprises a plurality of code test modules; the temporary code storage unit pushes the code to the corresponding code test module according to the code position index table, and replacesthe influence range of the modification attached to the code annotation with the corresponding function index number according to the function index table during pushing; the code test module receivesthe code; the function index numbers are cached, the function index numbers are sorted according to the established function call relationship tree, the sorted function indexes are converted into related test cases which only need to be executed according to a binding relationship table, the test cases are executed to generate related test results, and the related test results to a summarizing unit; and the summarizing unit is used for summarizing the test results of the related test cases are pushed in each code test module to generate an overall test result report.

The invention provides a question and answer method, system and device based on natural language processing and a storage medium. The method comprises the steps of obtaining a question and answer instruction input after a user starts an intelligent service; carrying out semantic identification on the question and answer instruction, and obtaining the question features corresponding to the question and answer instruction according to the identification result, wherein the question features comprise the intention category keywords and the execution category keywords; analyzing each execution category keyword, performing matching connection on the intention category keyword and all the execution category keywords by adopting the AND, OR and NOT expressions, and calling the similar statements corresponding to the question and answer instruction from a preset database according to a matching result; and obtaining the preset numbers of the similar statements, and obtaining the reply information corresponding to the similar statements according to the preset numbers. The question and answer method based on natural language processing can solve the problems of low reply efficiency, high labor cost and high system maintenance professionality of manual customer services, and has the advantages of high identification accuracy and accurate reply.

The invention is applicable to the field of similar word dictionary rule mining, and provides a mining method, a system and a database terminal of a similar word dictionary rule of a database. The mining method of the similar word dictionary rule comprises the following steps of: scanning and analyzing a database r, eliminating single-value columns and columns in which all values are unique, and the marking the rest candidate column sets as R; counting up the support degree of each item of each column in the candidate column sets R, and numbering the item with the support degree more than the given maximum support degree with an integer; sequentially numbering each row of transactions in the database r, recording the row transaction number included in each item in a list, and then caching; using a method of DCfd to mine the similar word dictionary rule of the database r; and outputting the similar word dictionary rule. According to the invention, the similar word dictionary rule mining method of DCfd is used in the database r, a reverse increment search strategy is used, a search tree is trimmed by a trimming method, and simultaneously, the found rule is cached, so that the calculation amount of the whole mining method can be reduced, and the similar word dictionary rule in the database can be automatically and efficiently found.

The invention discloses a disassembly line setting method combining a priority relation matrix, and relates to the technical field of disassembly line balance. The method comprises the following steps that firstly, all parts of an object to be disassembled are numbered, and the preferential disassembly relation, the hazard attribute and the demand attribute of the parts are recorded; then a mixed integer linear programming model is established, wherein the model comprises an objective function and constraint conditions; and finally the model is solved. According to the method, a parallel disassembly line mixed integer linear programming model combining a priority relation matrix is established, and compared with the existing traditional disassembly balance problem, the model provided by the invention can be directly solved; and meanwhile, the method provided by the invention can solve the parallel disassembly problem of small-scale, medium-scale and large-scale same end-of-life products, can also solve the parallel disassembly problem of small-scale, medium-scale and large-scale mixed end-of-life products, and has better practical application value.

The invention discloses a sorting method and device based on fuzzy matching, computer equipment and a storage medium. The method comprises the steps that after cargos enter sorting lines, bar codes ofthe cargos are obtained, and corresponding records are searched for in a first dictionary; if the values in the records are the exit numbers, the cargos are controlled to be sent to the correspondingexits; if the values in the records are the container IDs, barcode sets and exit number sets corresponding to the container IDs are searched in a second dictionary; the first exit number in the exitnumber sets is obtained, the cargos are controlled to be sent to an exit corresponding to the first exit number. According to the sorting method and the device based on fuzzy matching, the computer equipment and the storage medium, strict sequence guarantee of stacking and unstacking is not required, the sorting function of one-to-one correspondence requirements of the sorting lines is compatible,the cargo selection efficiency can be improved, and unnecessary workloads cannot be brought.

The invention discloses a production scheduling management method based on a logic priority principle by utilizing a computer, and the method comprises the following steps: issuing and inputting all work orders including finished products and semi-finished products into a computer system, numbering the work orders according to a priority sequence during input, giving a priority sequence number toeach work order, and taking the minimum priority sequence number as the priority principle; scheduling production from the entered work order, and scheduling production from small to large according to the size of the priority number, wherein only the orders in the issued and started states are scheduled; adopting the overall logic priority principle that the priority sequence number is minimum, and then judging the priority sequence of the single work order according to the determined rule judgment priority sequence so that scheduling can be conducted. According to the method, production scheduling is carried out in a priority sequence number mode by taking the minimum number as a priority principle, a detailed load list can be given for each resource, and which resources are capacity bottlenecks can be judged; therefore, the capacity of bottleneck resources can be adjusted or which procedures are temporarily outsourced can be set, and production scheduling is less prone to walking.

The invention discloses a scheduling method and device, equipment and a storage medium. The method comprises the following steps:on the basis of configuration information of a to-be-scheduled time period, solving optimal shift information meeting constraint conditions through a mixed integer programming method, wherein the configuration information comprises business demand information, shift types, time slices, on-duty and off-duty time and employee information, and the shift information comprises dates, shift numbers and the number of employees of each shift; and based on the optimal shift information, the group information and the shift arrangement rule, solving shift arrangement information meeting the group consistency requirement through a mixed integer programming method. According to the technical scheme provided by the embodiment of the invention, the scheduling method can adapt to different management requirements, the use range is wide, the scheduling convenience is improved, in addition, the scheduling information meets the group consistency requirement, and the management convenience can also be improved.

The invention discloses a disassembling line setting method without combining a priority relation matrix, and relates to the technical field of disassembling line balance. The method comprises the following steps that firstly, all parts of an object to be disassembled are numbered, the preferential disassembly relation, the hazard attribute and the demand attribute of the parts are recorded, then a mixed integer linear programming model is established, the model comprises an objective function and constraint conditions, and finally the model is solved. According to the method, a processing mode different from a traditional parallel disassembly line processing mode is established, disassembly tasks are distributed according to the priority relation matrix of the disassembly products on the parallel disassembly line, the parallel disassembly line balance problem is solved, the mixed integer linear programming model of the non-merging parallel disassembly line priority relation matrix is established, and the parallel disassembly line processing mode is optimized. And respectively solving single-target optimal values of four targets, namely the number of the working stations started by the parallel disassembly line, the total idle time, the demand attribute and the hazard attribute.