Patents
Literature
Patsnap Eureka AI that helps you search prior art, draft patents, and assess FTO risks, powered by patent and scientific literature data.

341 results about "Time complexity" patented technology

In computer science, the time complexity is the computational complexity that describes the amount of time it takes to run an algorithm. Time complexity is commonly estimated by counting the number of elementary operations performed by the algorithm, supposing that each elementary operation takes a fixed amount of time to perform. Thus, the amount of time taken and the number of elementary operations performed by the algorithm are taken to differ by at most a constant factor.

Multi-level batch text parallel deduplication method, system and equipment and storage medium

The invention discloses a multi-level batch text parallel deduplication method, system and device and a storage medium, and the method comprises the steps: carrying out the preprocessing of text data, and carrying out the similarity text representation and content deduplication of sensitive hashing at a chapter level, a paragraph level and a statement level; adding a priority score and a sorting rule in a duplicate removal process to eliminate duplicate removal randomness; during content deduplication, a graph structure is created according to similarity text representation of sensitive Hash, a plurality of connected components are established on the graph structure by utilizing combination and separation of union sets, and a target text is selected and reserved in each connected component by adopting a dynamic Hash threshold value; in the process, data frame objects are respectively constructed for chapter-level, paragraph-level and statement-level texts, unique identifiers are allocated, and the time complexity and the required memory space are optimized by adopting a parallel deduplication strategy of block delay calculation and pointer storage. According to the method, the duplicate removal speed and accuracy can be improved, and meanwhile, the problem of memory shortage faced by mass duplicate removal is solved.
Owner:CHINA ELECTRIC POWER RESEARCH INSTITUTE CO LTD +1

Instruction translation method and device, electronic equipment and storage medium

The embodiment of the invention discloses an instruction translation method and device, electronic equipment and a storage medium, and the method comprises the steps: receiving an instruction translation request, when the instruction translation request carries a target address of an original instruction, obtaining the target address in the instruction translation request, obtaining a first symbol table file, retrieving a target node in the tree data structure of the first symbol table file according to the target address, and reading symbol offset from the target node; retrieving a function number of the target address and a first line number of the original instruction from first symbol information of the first symbol table file according to the symbol offset; the first symbol dictionary is obtained according to the target address, the first function character of the original instruction is retrieved in the first symbol dictionary according to the function number, and the translation result of the original instruction is obtained based on the first function character and the first line number, so that the time complexity during instruction translation can be reduced, and the instruction translation efficiency is improved.
Owner:TENCENT TECHNOLOGY (SHENZHEN) CO LTD

Dust concentration acquisition and early warning method and system

The invention relates to the technical field of data processing, in particular to a dust concentration collecting and early warning method and system.The method comprises the steps that a binary tree corresponding to a data subset where any data point in dust concentration data is located serves as a reference binary tree, the credibility of any data point in any reference binary tree is calculated, and the credibility of any data point in any reference binary tree is calculated; obtaining logarithmic data which takes the prominence degree of the data point in the reference binary tree as a base number and takes the ratio of the balance factor of the reference binary tree to the time complexity as a true number, correcting the credibility to obtain a corrected value, and taking the corrected value of the credibility of the data point in each reference binary tree as a weight to obtain a corrected value of the credibility of the data point in each reference binary tree; and performing weighted summation on the complexity variable quantities of all the reference binary trees before and after the data point is inserted to obtain the final abnormal degree of the data point, so as to perform early warning on the dust concentration in the air based on the final abnormal degree of the current data point. According to the invention, the accuracy of anomaly detection can be improved.
Owner:广州泽亨实业有限公司

Low-orbit super-dense constellation optimization method based on NSGA-II algorithm

The invention discloses a low-orbit super-dense constellation optimization method based on an NSGA-II algorithm, and belongs to the field of satellite communication. According to the method, the problems that in the scene of low-orbit super-dense constellation configuration optimization, an existing optimization method is high in time complexity, the constellation coverage performance cannot be guaranteed, and the inter-satellite link richness requirement cannot be met are solved. The method comprises the following steps: firstly, simulating a constellation, and establishing a target function according to a constellation optimization target; establishing a multi-objective optimization model by taking parameters of the constellation as input and taking the established objective function value as output; then, an NSGA-II algorithm is adopted to solve the established multi-objective optimization model, and a pareto leading edge point set and an optimal solution set are obtained; and finally, K pareto front edge points are selected from the obtained pareto front edge point set, and low-orbit super-dense constellation design is carried out based on constellation parameters corresponding to the selected pareto front edge points in the optimal solution set. The method can be applied to low-orbit super-dense constellation optimization.
Owner:SHANGHAI SATELLITE ENG INST +1

Multi-user short-term power load prediction method of improved Transform model

The invention discloses a multi-user short-term power load prediction method for an improved Transform model, and relates to the technical field of novel power systems, and the method comprises the steps: S1, setting an internal decomposition block based on a moving average and Fourier transform thought, integrating the internal decomposition block into a frame, and decomposing an input data sequence into trend, season, holiday and festival variables and residual variables; s2, an Nystrom method is used for approximating a softmax matrix in a standard self-attention mechanism, and the softmax matrix is used for coping with challenges of secondary time complexity and memory use in Transform; s3, performing deep feature mining on the seasonal part after time sequence decomposition by using convolution operation; and S4, probability prediction based on Monte Carlo random inactivation. And designing an internal decomposition module of the depth model, and extracting an internal complex time sequence trend of a hidden state in the model by the module, so that the model has a progressive decomposition capability of a complex time sequence. Different from a traditional load prediction method for exploring time characteristics of a single user, a space-time attention mechanism is improved, and accurate multi-user short-term load prediction is provided.
Owner:STATE GRID JIANGSU ELECTRIC POWER CO XUZHOU POWER SUPPLY CO

Short-term load prediction system based on coder-decoder architecture and construction method thereof

The invention relates to the technical field of short-term load prediction in a power system, and discloses a short-term load prediction system based on a coder-decoder architecture, and the system is characterized in that a coder is used for extracting local features of a power load mode; and the decoder is used for converting the local features of the power load mode into predicted power load values and outputting the predicted power load values. The encoder is realized by a multi-scale expansion causal convolutional network MSDCC, and the decoder is realized by a bidirectional long short-term memory network BiLSTM. The prediction system construction method comprises the following steps: extracting related data from a historical database, preprocessing and analyzing the data, and constructing a predictor matrix; an MSDCC encoder is constructed; a BiLSTM decoder is constructed; and combining the encoder-decoder architecture to construct a short-term load prediction model. According to the method, the size of the feature map is effectively limited, model parameters are reduced, overfitting is avoided, calculation requirements are controlled, non-linear features are efficiently captured, meanwhile, time keeping complexity is low, and therefore the method has the advantages of being high in prediction efficiency and high in prediction precision.
Owner:HUBEI CENT CHINA TECH DEV OF ELECTRIC POWER +1

Stiffness matrix compression storage method and system based on block symmetry characteristic and medium

The invention discloses a stiffness matrix compression storage method and system based on block symmetry characteristics and a medium, and the method comprises the following steps: constructing a geometric model, and obtaining material attribute parameters; dividing finite element analysis grids according to the geometric model, and numbering units, nodes and degrees of freedom; setting boundary conditions and load applying conditions; a storage space is applied based on the block symmetry characteristic of the global stiffness matrix; calculating an element stiffness matrix, assembling element stiffness matrix information to a global stiffness matrix, and applying a boundary condition; and solving a finite element equation corresponding to the compressed and stored global stiffness matrix by adopting a numerical solution method. According to the method, the reducibility of the stiffness matrix is kept, redundant information stored in the stiffness matrix is reduced, and the time complexity of the stiffness matrix and vector multiplication and other matrix operation is also reduced, so that the solving performance of the linear equation set is effectively improved.
Owner:SOUTH CHINA UNIV OF TECH

Method for solving task-platform optimization configuration problem based on QGA quantum enhancement

The invention discloses a method for solving a task-platform optimization configuration problem based on QGA quantum enhancement, and the method comprises the steps: firstly, employing the true randomness and entanglement of quantum, achieving the coding of a corresponding relation between a task and a platform through a quantum state, and determining an optimal individual in a population through a fitness function; secondly, a quantum logic gate is used for achieving selection operation in the algorithm, and the rotation angle and direction of the quantum logic gate are determined through the fitness difference value between each chromosome and the optimal chromosome; then, a quantum logic gate X and a quantum logic gate SWAP are used for achieving mutation operation and crossover operation in the algorithm respectively; the method provided by the invention has high accuracy and timeliness, the number of algorithm iterations and the time complexity are greatly reduced, and the method can be effectively used for solving the task-platform optimization configuration problem in the military C2 organization.
Owner:NAT UNIV OF DEFENSE TECH

Time sequence clustering method and device

The invention provides a time sequence clustering method and device, and the method comprises the steps: obtaining subsequences of a to-be-clustered time sequence, taking m subsequences as m clustering centers, and combining the m clustering centers into a clustering center set of the to-be-clustered time sequence; a target function is constructed with the purpose of maximizing the sum of the shape similarities of all the subsequences and the corresponding clustering centers, and one subsequence corresponds to one clustering center; and performing approximate solution on the target function based on a greedy strategy, and accelerating the solution process through a preset effective boundary to determine an approximate optimal subsequence combination in the clustering center set. According to the invention, the time complexity is significantly reduced by selecting the subsequences as the clustering center; a greedy strategy is introduced to enable a suboptimal solution to quickly approach a globally optimal solution, the solving process is accelerated by setting an effective boundary, and the clustering efficiency of a long-time sequence is effectively improved.
Owner:TSINGHUA UNIVERSITY

Large language model output quality guarantee method, device and system based on chain deterministic reasoning verification

The invention discloses a large language model output quality guarantee method, device and system based on chain type deterministic reasoning verification, and belongs to the field of artificial intelligence safety, deterministic calculation and reasoning verification. The method comprises the following steps: classifying each reasoning step generated by LLM into a deterministic step (bT: deductive reasoning, verified facts and mathematical proof) or a non-deterministic step (bF: inductive reasoning, unverified references and creative guess), and accumulatively constructing a reasoning chain; chain certainty verification chain (chain) = foldr (AND, true, chain) and time complexity O (n) are carried out in each k steps; if the bF is returned, a chain pollution elimination theorem is applied to prove that once the chain contains non-deterministic steps, the whole chain loses deterministic guarantee; and a deterministic boundary report is generated, and a non-deterministic initial position is marked. The device comprises an inference classifier, a reference verifier, a mathematical checker and a chain verification engine, and all the modules can be independently realized (formalized verification / database query / rule engine / mixed mode).
Owner:GUANGZHOU KINGPIN IND CO LTD

Long-time sequence power load prediction method based on improved Informer model

ActiveCN119106350AEnrich input feature representationSolve the problem of insufficient sparsityLoad forecast in ac networkBiological modelsTemporal informationLoad forecasting
The invention provides a long-time sequence power load prediction method based on an improved Informer model, and particularly relates to the technical field of power load prediction, and the method comprises the steps: carrying out the feature coding and embedding of meteorological features, scalar information, position information, time information and trend information through a feature embedding layer and an SSI model, and carrying out the feature coding and embedding of the meteorological features, scalar information, position information, time information and trend information; the method comprises the following steps of: providing richer input feature representation for a model, carrying out secondary sparsity on probability sparse attention by adopting a method for carrying out sparsity evaluation on a key value matrix, reducing the time complexity of an attention mechanism from O (LlnL) to O ((lnL) 2), and finally outputting a final predicted value through a decoder and an encoder; according to the method, the problems that when an original Informer model is applied to power load prediction, feature richness is insufficient and a probability sparse attention module still has insufficient sparsity are solved, so that the effect of improving the precision and efficiency of long-time sequence power load prediction is achieved.
Owner:TRAINING CENT OF STATE GRID SHAANXI ELECTRIC POWER CO LTD +1

UAV and USV network resource allocation system and method based on improved whale algorithm

The invention discloses a UAV and USV network resource allocation system and method based on an improved whale algorithm. A constraint condition construction module is used for taking a correlation coefficient between a USV and a UAV, a service duration of providing service for the UAV by the UAV and a processor calculation frequency of the USV as constraint conditions; the optimization problem construction module is used for constructing optimization problems of minimizing USV task processing energy consumption and maximizing USV data processing amount; and the resource allocation module is used for iteratively solving the optimization problem by using the improved whale algorithm to obtain resource allocation between the UAV and the USV network. According to the method, a traditional whale optimization algorithm is fused with a novel coding mode and crossover mutation operation, the problems of poor feasible solution performance, poor convergence and high time complexity in existing resource allocation are solved, and the QoS requirement of intensive tasks is met.
Owner:WUHAN UNIV OF TECH

Space-time K function graph generation method and system based on distribution and aggregation, terminal and storage medium

The invention relates to the technical field of data processing, and discloses a space-time K function graph generation method and system based on distribution and aggregation, a terminal and a storage medium, the method comprises the following steps: obtaining a position data set of a target area, constructing a first matrix, performing data point access on the position data set to obtain an access result, and performing range query according to the access result to obtain a space-time K function graph; obtaining a first range query set; constructing a second matrix, and performing element allocation on the second matrix according to the first range query set to obtain a target second matrix; constructing a third matrix, performing numerical calculation on all elements in the third matrix to obtain a target calculation result, and performing optimization processing on the first matrix according to the target calculation result to obtain a target first matrix; and generating a space-time K function graph according to the target first matrix and the space-time K function minimum value and the space-time K function maximum value of the randomly generated data set. According to the method, the time complexity of generating the space-time K function diagram is reduced while the precise solution and the same space complexity are kept.
Owner:SHENZHEN UNIV

Method for predicting residual service life of equipment based on improved Mama framework

The invention discloses a method for predicting the residual service life of equipment based on an improved Mama framework. The method comprises the following steps: step 1, preprocessing multi-dimensional data; step 2, a Mama model is improved; and 3, predicting the remaining service life. According to the method, the unique selective state space mechanism of Mamba is fully utilized, so that the time complexity is controlled to be O (N) when long-sequence data is processed, and the calculation cost which is increased along with the square level of the sequence length in a traditional model is avoided. And meanwhile, an intelligent scaling regulator is constructed in Residual Block of the Mama framework so as to dynamically adjust the weight of residual error connection. A plurality of attention branches which are operated in parallel are creatively integrated in MambaBlock and act on data processed by a convolutional layer, so that the capturing capability of a model on a complex data relationship is enhanced, and the prediction precision is improved.
Owner:HEILONGJIANG UNIVERSITY OF SCIENCE AND TECHNOLOGY

Long-term wind power prediction method based on improved Bert

The invention discloses a long-term wind power prediction method based on improved Bert. The method mainly comprises the following steps of: firstly, preprocessing an abnormal value and time information of fan information in the data concentration; thirdly, processing the data by using a full connection layer and a convolutional layer to obtain a high-dimensional representation of fan information with time sequence information and time information; a full connection layer is used for processing the multi-head self-attention mechanism, and a shared query key matrix and a value matrix needed by the multi-head self-attention mechanism are obtained respectively. Then, a random rotation method is used to map the data matrix into different hash buckets, and a multi-head self-attention mechanism is used in each hash bucket. And finally, obtaining a final result by using residual connection and layer normalization processing. According to the improved Bert model provided by the invention, the prediction accuracy can be improved while the time complexity is reduced to O (nlogn).
Owner:TONGDA COLLEGE OF NANJING UNIV OF POSTS & TELECOMM

Data storage method and apparatus, and device and storage medium

The embodiments of the present application relate to the technical field of computers. Provided are a data storage method and apparatus, and a device and a storage medium. The method comprises: if the event to be processed is a transaction processing event, constructing a corresponding parameter query event, and storing, in a transaction time-sequence library, transaction information in the parameter query event and transaction information in the event to be processed; and if the event to be processed is a parameter processing event, constructing a corresponding parameter maintenance event, and storing the parameter maintenance event and an exchange rate parameter in a parameter time-sequence library in an associated manner. Therefore, it is not necessary to record corresponding exchange rate information for each transaction, thereby avoiding data storage redundancy, and also improving the utilization rate of storage resources and the processing performance of a system. The parameter time-sequence library and the transaction time-sequence library use the same time axis to store and manage data, such that the retrieval time complexity is relatively low. Time sequence data of a transaction and time sequence data of an exchange rate parameter are stored by means of a storage mechanism in which an event is bound to data, such that recorded time sequence data directly reflects a service processing process.
Owner:CHINA UNIONPAY

Multi-source time sequence test data time alignment method and storage medium

The invention discloses a multi-source time sequence test data time alignment method and a storage medium, and the method comprises the steps: obtaining the data of each product in a test, and calculating the maximum data collection frequency and time sequence data reference time axis of all products; performing preliminary time alignment on each product; static products and dynamic products are distinguished, and different types of products are subjected to time alignment according to the time sequence data reference time axis in different modes. According to the method, the unique reference time axis is calculated by calculating the maximum data acquisition frequency, the time complexity is O (1) when time matching is carried out on data at each moment, and time sequence data time preliminary alignment work can be completed at a higher speed when the data size is too large. According to the invention, for the time sequence data which is subsequently added into time alignment calculation, the current time sequence data which is subjected to time alignment cannot be influenced. Meanwhile, data preprocessing work is carried out according to the data features of different data sources, so that the time alignment work of the multi-source time sequence data is more complete.
Owner:KUNMING SHIP EQUIPMENT RESEARCH & TESTING CENTER (CHINA SHIPBUILDING CORP 750 TEST SITE)

Encoding method, decoding method, code stream, encoder, decoder, and storage medium

Embodiments of the present application disclose an encoding method, a decoding method, a code stream, an encoder, a decoder, and a storage medium. The decoding method, applied to a decoder, comprises: decoding a code stream, and determining a target filtering mode of a current block; determining a reference area of the current block on the basis of a size parameter of the current block and the target filtering mode; determining a filter coefficient of the current block on the basis of the reference area of the current block; and performing intra-frame prediction on the current block on the basis of the filter coefficient, and determining a predicted value of the current block. Therefore, the time complexity can be reduced while the encoding and decoding performance is ensured.
Owner:GUANGDONG OPPO MOBILE TELECOMMUNICATIONS CORP LTD

Hypothesis phase compensation velocity ambiguity solving method

The invention discloses a hypothetical phase compensation solution velocity ambiguity method, which comprises the following steps of: identifying and detecting a dynamic target, and acquiring radar data, a Doppler phase difference phi cfu corresponding to the dynamic target, an all-channel data set S and a hypothetical velocity ambiguity period N; according to an assumed velocity ambiguity period N and a phase compensation formula, Doppler phase compensation is carried out on the radar data to obtain compensated radar data; drawing an angular power spectrum based on the compensated radar data, determining a target peak point according to a peak point in the angular power spectrum, and determining a representative point of the dynamic target and the time complexity of the representative point according to the target peak point and the geometric center of the dynamic target; and determining the real speed Vtrue of the dynamic target based on the time complexity corresponding to the representative point and the target speed estimated value Vcfu. By applying the method provided by the invention, the correctness and calculation performance of speed estimation are improved.
Owner:TECH TRAFFIC ENG GRP CO LTD +3

Time-varying nonlinear system rapid identification method based on beta wavelet basis function expansion

The invention provides a time-varying parameter model identification method based on beta wavelet basis function expansion. As shown in the flow in figure 1, the method comprises the following steps: firstly, establishing a nonlinear autoregression time-varying parameter model by using a non-stationary time-varying signal, and determining the order of the model by using an FPE order determination criterion; performing linear weighted expansion on the model time-varying parameters by utilizing a first-order beta wavelet basis function, and converting a model time-varying parameter identification problem into a time-invariant parameter estimation and model effective item selection problem, namely obtaining a beta wavelet expansion time-invariant parameter model; selecting effective items of the model by adopting a classical orthogonal forward regression algorithm, determining the number of the effective items of the model in combination with an APRESS cross validation standard, eliminating redundant items in the expansion model, estimating corresponding time-invariant parameters of the model, and establishing a sparse model structure; and finally, in combination with the obtained effective items and corresponding parameters, obtaining a sparse nonlinear autoregression model and time-varying parameters thereof through reverse solution. Compared with an existing time-varying parameter identification method based on main B-spline multi-wavelet basis function expansion, the time complexity of the identification process can be effectively reduced, the identification precision of a sparse model is improved, and a new thought and a new calculation framework are provided for identification analysis of nonlinear time-varying parameter signals.
Owner:BEIHANG UNIV

Hypergraph search for real-time multi-robot task allocation in a smart factory

Task assignment for multi-robot systems (MRSs) in a smart factory (Industry 4.0) is described. Aspects are directed to a hypergraph based MRS and production model facilitating the cooperation among robots and serving frequent reconfiguration desired in Industry 4.0. Aspects are directed to a time complexity friendly search algorithm for real-time application using a hypergraph model to get task assignment(s). Parameters are provided for a tradeoff between solution optimality and time complexity. In an implementation, an example system can include a MRS including robots, wherein the MRS is configured to perform a manufacturing task, and a computing device configure to perform a multi-robot task allocation (MRTA) for the MRS. In an implementation, an example method can include generating task assignments, using MRTA, for robots of a MRS including the robots, wherein the MRS is configured to perform a manufacturing task, and providing the task assignments to the MRS.
Owner:UNIV OF SOUTH FLORIDA

Point cloud coding / decoding method and apparatus, device and storage medium

This application provides a point cloud decoding performed by an electronic device. The method includes: obtaining a current point to be decoded from a point cloud code stream, the current point comprising N types of attribute information, and N being an integer greater than 1; determining M attribute groups of the N types of attribute information of the current point, M being a positive integer less than N; and perform uniform decoding for each attribute information in a same attribute group of the current point using a first operation, the first operation comprising at least one of a neighbor point determination and an attribute predicted value calculation. According to this application, the point cloud decoding method avoids the repeated searching, reduces time complexity during attribute decoding and improves attribute decoding efficiency.
Owner:TENCENT TECHNOLOGY (SHENZHEN) CO LTD

Finite-state machine coverage rate statistical method for VCD file

The invention discloses a finite-state machine coverage rate statistical method of a VCD (Video Compact Disc) file, which is characterized in that a mapping relationship is established between a signal name and state transition information by directly analyzing a YAML (Young Attribute Markup Language) format file of finite states and transition behaviors among the states compiled in a design stage and adopting a hash table mapping technology, so that the constant-level efficiency of reducing time complexity to O (1) is realized. When the VCD file generated by simulation is processed, two strategic file reading methods are adopted, and the file processing flow is simplified. And the uniqueness and accuracy of data processing are ensured through a self-defined Hash algorithm. In simulation data processing, screening is carried out according to the rule of the first character of the data, and only key state transition information is reserved. According to the method, the defects of processing the VCD file and counting the coverage rate of the finite-state machine under the condition of limited resources in the prior art can be effectively overcome, the counting speed of the coverage rate of the finite-state machine is increased, the efficiency of the verification process is improved, and remarkable performance improvement is brought to the verification stage of integrated circuit design.
Owner:GUANGDONG UNIV OF TECH

Engineering optimization method and system based on whale optimization algorithm and medium

The invention relates to an engineering optimization method and system based on a whale optimization algorithm, and a medium, and belongs to the technical field of intelligent optimization algorithms. Comprising the following steps: S1, initializing parameters and populations: setting a population scale, a maximum number of iterations, dimensions and upper and lower bounds of variables, generating an initial population, and initializing a global optimal solution and a current optimal solution; s2, executing an individual variation strategy: recording a global optimal individual position and a current iteration optimal individual position; s3, executing a unified search strategy; s4, executing a group communication strategy; and S5, judging whether the current number of iterations reaches the maximum number of iterations, if so, outputting a globally optimal solution, otherwise, adding 1 to the current number of iterations and returning to the step S2 to continue iteration. The algorithm provided by the invention aims to improve the global search capability and convergence precision of the algorithm and maintain the time complexity equivalent to that of the original WOA at the same time.
Owner:CHINA UNIV OF PETROLEUM (EAST CHINA)

Multi-social-platform budget influence maximization method based on multi-population parallel optimization

The invention discloses a multi-social-platform budget influence maximization method based on multi-population parallel optimization. The method comprises a model building module, a seed node selection module and a seed node identification effect evaluation module. Model establishment is a task of establishing a multi-layer network model. A seed node selection process is composed of population initialization, a repair function, a fitness function, a selection operator, a crossover operator and a mutation operator, and an individual with the highest fitness value is selected as a final solution, namely a seed node set for maximizing multilayer network influence propagation. And finally, simulating a propagation experiment through a multi-layer network, and evaluating an actual effect. According to the method, a multi-population parallel optimization framework and a repair function are designed, the search range is wider, the optimal result can be found under the condition of lower time complexity, the problem that budget limitation is exceeded possibly in the training process is effectively solved, and waste of excellent individuals is avoided. The method has great application in the aspects of economic utility and social service.
Owner:HANGZHOU NORMAL UNIVERSITY

Quasi-linear time complexity coding and unique decoding algorithm of any-order Reed-Muller code and application

The invention discloses a quasi-linear time complexity coding and unique decoding algorithm for any-order Reed-Muller codes, which comprises the following steps of: defining a q-element RMq (r, m) RM code, defining information and converting the information into a unitary information polynomial; coding is carried out by using an RS code coder, so that MPE acceleration of an m-element polynomial on # imgabs0 # is realized, and the coding complexity reaches a quasi-linear level; and inputting the received code word into a unique decoder of the RS code, calculating to obtain a correct message polynomial, solving an m-element information polynomial through a mapping relation, and taking a coefficient as a unique decoding result. According to the method, on the basis of the thought of transformation between a multivariate polynomial ring on # imgabs1 # and a univariate polynomial ring on an extended finite field # imgabs2 #, a quasi-linear time algorithm for unique decoding of any r-order RM codes is realized, coding and decoding of the RM codes are accelerated, and the applicability of the coding scheme is enhanced.
Owner:UNIV OF ELECTRONICS SCI & TECH OF CHINA

Implementation method of improved two-dimensional ordered statistical constant false alarm rate detector based on CPU

The invention discloses an improved two-dimensional ordered statistical constant false alarm rate detector implementation method based on a CPU. The implementation steps are as follows: inputting a two-dimensional data matrix; performing initialization setting; for each detection unit, judging whether the sample value of the detection unit is the maximum value in a nine-block grid taking the detection unit as the center or not before detection; if yes, judging whether the sample value of the detection unit is greater than k arbitrary values of all reference unit sample values multiplied by a threshold factor or not through parallel processing; if yes, the detection unit is judged as a target, and the adjacent undetected unit does not need to be detected subsequently. According to the method, the number of detection units is greatly reduced, the processing time is shortened, meanwhile, in the detection process, a CPU does not need to open up an extra memory space to store all reference units to be sorted, data sorting work which is complex in traditional two-dimensional ordered statistics constant false alarm rate and long in consumed time is ingeniously avoided, the time complexity and the space complexity of an algorithm are reduced, and the detection efficiency is improved. And the real-time performance of target detection is ensured.
Owner:NANJING UNIV OF SCI & TECH

Hash and tcam based combined packet classifier and method

The application discloses a kind of combination packet classifier and method based on hash and TCAM, adopt the combination of imperfect hash classification module and TCAM classification module, the complement of imperfect hash classification and TCAM classification on input key value space is realized;Compared with the traditional TCAM packet classification solution based on, the application reduces hardware resource utilization, system power consumption;Compared with the packet classification solution based on perfect hash, the application reduces the design cost of hash function and the time complexity of generation process under the premise of guaranteeing the function of classifier.The application can consider low space resource consumption, low power consumption and low delay in the classification stage, saves design cost in the classifier generation stage, and reduces the time complexity of generation process;Meanwhile, the application can better balance different types of hardware resources on reconfigurable hardware platforms such as FPGA, and provides a new way of thinking for the design of classifier in network tasks such as firewall packet filtering and routing table lookup.
Owner:XIAN MICROELECTRONICS TECH INST

An implicit video recommendation algorithm

An implicit video recommendation algorithm, by calculating the proportion of the time length of the video watched by the user to the total time length of the video, then the data dispersion situation data is counted, the data is taken as the parameter, the data table of the user and the video is established, then the cosine similarity is calculated, after sorting, the video with the highest similarity is recommended, according to the accuracy, recall rate of the training result, the proportion of data division is dynamically adjusted, so as to achieve the purpose of optimizing the final recommendation result. By deeply mining the relationship between users and videos, this can solve the problem of long tail commodity recommendation and data sparsity, and the time complexity of this algorithm is low, and the operation speed is fast.
Owner:SHANDONG INSPUR ULTRA HD INTELLIGENT TECH CO LTD

Method for inversely sorting and assembling tree data

The invention discloses a method for inversely sorting and assembling tree data, which relates to the field of software background development and comprises the following steps: S1, preparing; s2, a sorting step; s3, a cache establishment step; and S4, traversing and assembling. Compared with a traditional assembling mode of arranging from root nodes in sequence and recurring layer by layer, the method for assembling the tree structure data in the inverted sorting mode has the remarkable beneficial effects that the basic data are traversed in the inverted sorting mode, calculation is started from the last-stage node, the lower-stage nodes are set, and the efficiency is improved. According to the method, the complete tree structure can be assembled only through one-time circulation, the number of times and depth of recursion calling are greatly reduced, the time complexity problem (O (1)-O (n2)) caused by too deep recursion hierarchy and uncertain tree branch is avoided, and therefore the response time of a tree interface is remarkably shortened, and the overall running smoothness of software is improved.
Owner:富盛科技股份有限公司