13 results about "Index function" patented technology

The invention relates to a duplication name index creation and reconstruction method and device based on openGauss, and aims to solve the compatibility problem caused by index naming conflicts when heterogeneous databases such as MySQL migrate to openGauss. According to the method, a duplication index function switch is controlled through a GUC parameter ENABLEDUPLICATEINDEXNAME, when the duplication index function switch is started, a user table index name is rewritten (an affiliated table OID and an ASCII 0x1F invisible separator are added), and a unique system storage name is generated and written into a pgclass system table and other system tables; a REINDEX mechanism is provided to realize smooth transition of new and old index formats; and transparent analysis of user operations (such as INDEX HINT) is supported. According to the method, on the premise that the global uniqueness constraint of the openGauss index is not damaged, the MySQL cross-table duplicate-name index is compatible, the migration efficiency and the system compatibility are improved, the labor cost is reduced through automatic rewriting, parameter control and other mechanisms, and the accuracy and stability of large-scale database migration are guaranteed.

The application discloses a kind of indexless quick slice transaction coding storage methods for alliance chain transaction data.The application realizes the indexless quick reading of transaction and the storage slice of transaction data by decoupling the verification function and data index function of transaction tree, improves the reading efficiency of transaction.For transaction verification function, the application proposes a verifiable data structure suitable for transaction data storage slice-indexless transaction tree, reduces the size of verification information, reduces the number of node interactions required for transaction data reading in data slice scenario.For transaction index function, the application proposes a new transaction data content coding method, realizes the indexless reading of transaction, improves the access efficiency of transaction, reduces the storage overhead of index.

The invention discloses a data processing method and device for transaction behavior data, a medium and electronic equipment, and relates to the technical field of data processing, and the method comprises the steps: carrying out the calculation processing based on the bidding data of each power purchaser in each bidding stage, and obtaining a bidding evaluation index between the power purchasers; performing correlation analysis based on the bidding evaluation index and a predetermined evaluation result to obtain a correlation type of the bidding evaluation index relative to the predetermined evaluation result; performing standardization processing on the bidding evaluation index by adopting a predetermined standardization index function based on the correlation type and each numerical value conversion function to obtain a standardization index corresponding to the bidding evaluation index; and performing data cleaning processing on the standardized indexes by adopting a dynamic gradient analysis method to obtain a data processing result of the transaction behavior data. According to the method, the preciseness of a subsequent standardization processing process can be improved by comprehensively considering multiple bidding evaluation indexes, and the accuracy of transaction behavior data processing can be improved.

The invention belongs to the technical field of data encryption processing, and provides an order-preserving ciphertext indexing method and system supporting forward security. According to the technical scheme, firstly, a new segmentation function is designed, the uniformity of the size of a subset and the rationality of a segmentation interval are balanced through a global optimization objective function, and a new segmentation function is designed; a segmentation strategy can be adjusted according to data density and abrupt change points, and the size of a subset and a segmentation interval can be flexibly weighed through lambda; secondly, a new index structure is constructed, the order-preserving ciphertext can be inquired in a personalized mode according to the state of the multi-user token, and the index function of forward security is supported; the method comprises the following steps: mapping ciphertext data and token states in a user query token to a target address on a token state key chain, forming a search token, sending the search token to carry out data retrieval, carrying out data retrieval according to the target address, and carrying out retrieval on a multi-level index to finally obtain a result set of target data. And the retrieval efficiency is considered while the security is considered.

The invention relates to the technical field of early looseness diagnosis of bolts of bolt connection structures, in particular to a method and system for detecting looseness of bolts of key parts of an aero-engine, a terminal and a medium, and the method comprises the steps: firstly, carrying out the data preprocessing of vibration signals of bolts of different health categories on the key parts of the aero-engine based on an index function; learning features of the preprocessed data of different health categories based on a sparse filtering model, and combining the features with the health categories to train a softmax classifier; through the trained softmax classifier, health categories of bolt looseness on the to-be-detected key parts of the aero-engine can be classified based on vibration signals of bolts in different health states on the key parts of the aero-engine, so that the bolt looseness condition of the key parts of the aero-engine is detected.

The invention relates to an exponential function operation processing device and method and a controller. The device comprises a function conversion unit used for obtaining an original exponential function and converting the original exponential function into a natural exponential function; the parameter decomposition unit is used for decomposing an exponential term of the natural exponential function based on the reference cardinal number to obtain an integer term parameter and a decimal term parameter; the operation unit is used for performing index operation by taking a natural number as a base number and a decimal term parameter as an index to obtain an intermediate operation result; and the merging unit is used for performing merging operation on the intermediate operation result according to the integer term parameter and the reference cardinal number to obtain an exponential function operation result of the original exponential function. By adopting the method, the calculation precision and the hardware resource consumption can be effectively balanced.

Computer-implemented method in a compilation system that includes the following: Obtain (202) a non-optimized computational graph with a multitude of nodes representing operations and directed edges representing data dependencies; Analyzing (204) the non-optimized computational graph using a variety of known patterns and pattern comparison to determine fusionable operations, where a pattern specifies a chain of several unary regular operations, where in chaining the result of a regular operation is an input of a chained subsequent operation, where a regular operation is an array operation that reads one element from each input array in order to compute one element of the output array using a data function, Upon detection of a pattern of chaining unary regular operations: Decomposing each of the unary regular operations into an index function and a data function, where the index operation maps an index of the output array to an index of the input array; Concatenating the index functions and concatenating the data functions of the respective fusionable operations into a single fusion operation; Transforming (206) the non-optimized computational graph into an optimized computational graph by replacing the nodes representing the fusionable operations in the non-optimized computational graph with a single fusion node representing the single fusion operation; and Providing the individual fusion node of the optimized computation graph to a compiler, the compiler translating the individual fusion node as a call that performs the individual fusion operation to generate efficient code in the code generation phase of compilation (208).

The application combines the technical field of dynamic analysis, and provides a consortium chain contract threat detection method, which can detect and process security vulnerabilities of a contract before the contract is formally deployed. The main scheme includes an index function generation module: through a large amount of data, the execution characteristics of the contract are obtained by simulating the execution of the contract, and an index function is constructed; a data variation module: inputting the specification data sample of the execution contract, according to the execution characteristics of the contract and the format requirements of the data, selecting the correct fuzz strategy, generating the data after variation, caching the data after variation, and waiting for the threat discovery module to request or provide data for re-variation; a threat discovery module: obtaining the data after variation from the data variation module, simulating the execution of the contract, obtaining the execution result of the variation data, and matching with the index function, if the deviation reaches a certain value, a threat warning is output.

The application provides a terminal device and a music generation method. The method can set an evaluation index function and a constraint condition of music generation, and create an initial population, wherein the initial population includes a first population and a second population. A first algorithm is used to iteratively evolve the first population to iteratively search for an optimal individual in the first population, and a second algorithm is used to iteratively evolve the second population to iteratively search for an optimal individual in the second population. An exchange operation is performed on individuals in the first population and individuals in the second population at intervals of a preset iteration number. Finally, target music is generated according to the results of the iterative evolution, wherein the target music is an individual whose fitness function value is greater than a preset fitness threshold when the iteration number is equal to an iteration threshold, and the fitness function value is calculated according to the evaluation index function and the constraint condition. The method generates music in a multi-population cooperative evolution manner, can more comprehensively search the solution space, and thus improves the quality and speed of music generation.

The embodiment of the present application provides a directory access method, a consistent directory and a processor chip, and the method comprises the following steps: querying the consistent directory based on a request address; the consistent directory is divided into a plurality of virtual groups based on index bits, each virtual group comprises a first part and a second part; the first part is used for storing a plurality of directory entries, and different index functions are used in each path in the same virtual group; the second part is used for storing the positions of invalid directory entries in the same virtual group; based on the first part and the second part obtained by querying, a target operation to be executed is determined, and the target operation comprises one of the following: an update operation, a replacement operation, an insertion operation, a moving and insertion operation; the target operation is executed in a target virtual group, and the first part and / or the second part are updated. On the basis of reducing the number of reading SRAM and the control complexity, the embodiment of the present application can reduce the replacement operation of the directory entry, so that the access delay is reduced and the system performance is improved.

The application relates to a dynamic self-adaptive strategy-based fuzzy test optimization method, and belongs to the technical field of network security vulnerability mining. The method comprises the following steps: in the initialization stage, the breadth index of seeds is completed, two seed breadth index heuristic rules are set, and a seed breadth index function is designed; a control flow is mapped to a Markov chain, path branch probability calculation formulas, basic block probability calculation formulas and seed depth index value calculation formulas are respectively designed according to a path state transition process, and the depth index value of the seed is obtained; a dynamic self-adaptive function is designed to optimize the convergence process of the seed set, the fitness threshold and the breadth index and the depth index value of the seed are set according to the program size, the fitness in the seed mutation execution process is obtained, the fitting degree of the seed is judged according to the value of the fitness, the seed with high fitting degree is reserved for continuous mutation, and the rest is removed.

The embodiment of the present application provides a directory access method, a consistent directory and a processor chip, and the method comprises the following steps: querying the consistent directory based on a request address; the consistent directory is divided into a plurality of virtual groups based on index bits, each virtual group comprises a first part and a second part; the first part is used for storing a plurality of directory entries, and different index functions are used in each path in the same virtual group; the second part is used for storing the positions of invalid directory entries in the same virtual group; based on the first part and the second part obtained by querying, a target operation to be executed is determined, and the target operation comprises one of the following: an update operation, a replacement operation, an insertion operation, a moving and insertion operation; the target operation is executed in a target virtual group, and the first part and / or the second part are updated. On the basis of reducing the number of reading SRAM and the control complexity, the embodiment of the present application can reduce the replacement operation of the directory entry, so that the access delay is reduced and the system performance is improved.

The invention provides a calculation unloading scheme based on digital twinning dynamic updating, and belongs to the field of mobile edge calculation. The method comprises the following steps: acquiring state information of a mobile device, a task and a base station in a current time slot; establishing a communication model, a task calculation model and an energy consumption model; establishing a comprehensive index function fusing digital twinborn precision, task delay and system energy consumption; and the comprehensive index functions with continuous time are summed to serve as a long-term dynamic optimization problem. In order to solve the problem, the invention further provides a hierarchical hybrid strategy deep reinforcement learning framework, and the framework combines a strategy learning mechanism and a non-strategy learning mechanism so as to jointly optimize a calculation unloading decision, a resource allocation strategy and an updating process of a digital twinborn model. The method aims at improving the precision of the digital twinborn body, remarkably reduces task delay and system energy consumption at the same time, and can support strategy generation in highly dynamic scenes such as smart cities due to the advantages of low calculation complexity and fast decision response.