119 results about "Real arithmetic" patented technology

The present subject relates to a method for proving a statement describing a functionality of an electronic circuit, using a quantum computer and a proof assistant.The procedure comprises: encoding a current proof state into a vector of real numbers of a fixed length, where the current proof state defines a task to prove at least part of the statement; encoding the vector into a quantum state of a quantum system of the quantum computer; using the quantum state as an input quantum state by a quantum machine learning model to provide an output quantum state, the measurement of which constitutes a proof step for the defined task; measuring the output quantum state, thereby obtaining the proof step for the defined task; providing the proof step to the proof assistant; and receiving a next proof state from the proof assistant in response to the provision of the proof step.

The invention discloses a space target monitoring constellation configuration optimization method and system considering complex constraints, and belongs to the technical field of aerospace mission design and optimization. The method comprises the following steps: firstly, constructing a discrete orbit modal library meeting regression orbit dynamic resonance conditions; constructing generalized hybrid design variables consisting of integer indexes and real number fine tuning quantities on the basis of the library; establishing an optimization model taking the space volume coverage rate, the maximum revisit time and the system construction cost as targets and taking illumination, dynamics and maneuvering capability as constraints; performing rapid analysis and coarse screening on invalid links through track geometry; and finally, performing global optimization by using an improved non-dominated sorting genetic algorithm to obtain a Pareto optimal constellation configuration set. According to the method, accurate evaluation of the three-dimensional space target coverage efficiency is realized, the physical feasibility and long-term stability of a configuration scheme are ensured, and a high-dimensional multi-target optimization problem is efficiently solved.

The invention relates to the field of vehicle route planning, in particular to a dynamic multi-target vehicle route planning method and system based on prediction and recombination, and the method comprises the steps: building a mathematical model of dynamic multi-target vehicle route planning, initializing a population through real number coding, adjusting the population to meet a constraint, carrying out the iteration through a genetic algorithm, and obtaining a candidate solution set; a Pareto front set is obtained and clustered, and a clustering center is recorded as a special individual; and when environment change is detected, predicting individuals in a new environment by using a gray model or a least square support vector machine, and constructing a new population until an optimal solution set is output. According to the method, the convergence speed of the algorithm is high, the response to the environment change is more sensitive and timely, the dynamic multi-target vehicle routing problem is effectively solved, and the application effect and the economic benefit of the vehicle routing in the actual life are effectively promoted.

The invention provides a numerical control multi-target energy-saving optimization method and system and a storage medium, and the method comprises the steps: constructing a mixed integer linear programming model for multi-target flexible job shop scheduling, taking machine tool distribution, a machining sequence, tool distribution and a machining speed as decision variables, and taking total weighted tardiness and total energy consumption as optimization targets; a single-layer real number coding method is adopted, machine tool allocation, the machining sequence and the machining speed are coded in a one-dimensional real number sequence in a unified mode, an initial population is generated, the mixed integer linear programming model is solved through a multi-target optimization algorithm, and an algorithm optimal solution of the mixed integer linear programming model is obtained; decoding the optimal solution of the algorithm, distributing tools for each process, and generating a production plan table; and calculating the total weighted tardiness and the total energy consumption to obtain an algorithm energy-saving optimization scheduling scheme. According to the method, the dual-objective mixed integer linear programming model is constructed, and the innovative coding and decoding strategy and the dynamic optimization mechanism are combined, so that collaborative optimization of the production efficiency and the energy consumption is realized.

The invention discloses a probabilistic language three-way decision-making-based telecommunication potential customer evaluation method. The method comprises the steps of firstly grouping target information according to decision requirements, converting a real number data set into a probability language decision matrix, extracting probability language term set features and constructing an expectation-reliability score function; respectively obtaining subjective and objective weights of attributes through an analytic hierarchy process and a variable coefficient method, and solving a comprehensive weight by means of a cosine similarity maximization model; then, a relative loss function is constructed based on the score matrix, a comprehensive foreground value of the scheme is calculated, and (non) harmony indexes and net credibility indexes of the scheme are measured and calculated under each attribute in combination with attribute non-compensability and an ELCTRE thought; and finally, making a series of decision rules through the expectation relative loss function. According to the method, the telecommunication company can be assisted to efficiently classify and evaluate the users, scientific guidance is provided for decision making, and the accuracy of potential customer mining and management is improved.

Artificial-intelligence computer-implemented processes and machines predict whether personal data may be present in structured software based on metadata field(s) contained therein. Natural language processing preprocesses input strings corresponding to the metadata field(s) into normalized input sequence(s). Individual characters in the sequence(s) are embedded into fixed-dimension vectors of real numbers. Bidirectional LSTM(s) or other machine-learning algorithm(s) are utilized to generate forward and backward contextualization(s). Neural network output(s) are provided based on element-wise averaging or feed forwarding based on the contextualization(s) in order to predict whether one or more value fields corresponding to the metadata field(s) may contain personal data.

The invention discloses a field programmable gate array (FPGA) implementation method for Hermite matrix eigenvalue decomposition, which comprises the following steps of: performing real number processing on a Hermite matrix according to a corresponding relationship between the Hermite matrix and eigenvalues and eigenvectors; grouping the dimension real matrix obtained by the real number processing; calculating rotation matrixes of diagonal units and non-diagonal units; performing Jacobi rotation operation on the diagonal units and the non-diagonal units, and updating the feature vector matrix according to a rotation matrix; after a group of Jacobi rotation is completed, data exchange is carried out according to grouping of a parallel Jacobi algorithm; and multi-stage cleaning can be carried out according to actual requirements. According to the method, a parallel Jacobi algorithm is selected, a series of matrix rotation is adopted, the matrix is converted into a diagonal matrix, and therefore the eigenvalue and the eigenvector of the matrix are calculated. According to the method, the parallel computing advantages of the FPGA and the Jacobi algorithm are fully utilized, and the real-time performance of the algorithm is effectively improved.

Disclosed is an operation method for executing an addition operation on quantized matrices. This operation method comprises the steps in which: an NPU matrix multiplication unit executes a matrix multiplication operation on a first matrix and a second matrix, wherein the first matrix has a size of R0*2C0 and is obtained by concatenating a first input tensor and a second input tensor, each of which is composed of quantized values and has a size of R0*C0, and the second matrix is obtained by concatenating a first diagonal matrix having a size of C0*C0 and having all main diagonal element values equal to integer N1 and a second diagonal matrix having a size of C0*C0 and having all main diagonal element values equal to integer N2; and an NPU vector processing unit calculates elements of a non-quantized tensor obtainable by adding the second input tensor to the first input tensor, by adding real number B to a product of real number R and a third matrix calculated by the matrix multiplication operation.

A method for detecting the cliques of evaluators in a decision-making process includes collecting a data matrix Sij to a computer system using an automatic input interface. The elements of the matrix Sij are the real numbers in a predefined range. Each of the elements of the matrix Sij represent a numerical evaluation provided by an evaluator j for an evaluated entity i. For each pair of evaluators j, where j1 and j2 (j1≠j2) from the data matrix Sij, calculating by the computer system the Pairwise Adjusted Distances EDj<sub2>1< / sub2>j<sub2>2< / sub2>. Applying by the computer system a nonlinear transformation to the Pairwise Adjusted Distances EDj<sub2>1< / sub2>j<sub2>2< / sub2>. Identifying cliques of evaluators by comparing by the computer system the transformed distancesEDj1⁢j2*to a robust lower threshold.

The embodiment of the invention provides a modulation method, a storage medium, an electronic device and a computer program product, and the method comprises the steps: shifting a first data sequence, and carrying out the addition operation of the first data sequence and the shifted first data sequence, and obtaining a second data sequence; multiplying each data element of the second data sequence by a negative real number, and sequentially inserting between every two adjacent data elements of the first data sequence to obtain a third data sequence; and transmitting the third data sequence. Through the embodiment of the invention, the problem that the low PAPR requirement of the communication system in the related technology cannot be met is solved, and the effect of reducing the PAPR of the communication system is achieved.

The invention provides a metadata structure, a data processing method and a storage medium. The metadata structure is a structured data object on a computer readable medium, can be read and written by a computer program, and adopts a framework of three parts: a basic index part, which is used for uniquely identifying educational resources and supporting retrieval, and at least comprises a unique identification field and a resource classification / retrieval attribute field; the core attainment vector part is used for quantitatively representing an educational resource childbearing target for intelligent calculation and comprises an N-dimensional attainment vector, the dimension key is c01 to cN, and the value of each dimension is a real number in a preset numerical value interval; and the association application part is used for constructing an inter-resource relationship and learning evidence agreement which at least comprises a field for describing a resource dependency relationship and a rule field which is executable by a computer and is used for extracting evidence from learning interaction data. According to the scheme, structuralization and computability of the attestation information are realized.

This invention discloses a flexible scheduling method, system, and application for UPMS (Upright Manufacturing System) workshops based on an improved differential evolution algorithm. The method includes: establishing an independent parallel machine scheduling model with sequentially dependent mold-changing time as the objective of minimizing the maximum completion time; using real-valued vector encoding and decoding it into a scheduling scheme through the maximum position value rule; performing mutation and crossover operations of the differential evolution algorithm on the generated test vectors, with optimizations including load balancing optimization based on destruction and reconstruction and mold-changing optimization based on sequential smoothing; finally, updating the population and outputting the optimal scheduling scheme. This invention significantly reduces sequentially dependent mold-changing time, achieves dual optimization of load balancing and mold-changing cost, and improves solution accuracy and efficiency, making it particularly suitable for discrete manufacturing workshops such as textile printing and dyeing, and injection molding.

The application discloses a kind of workshop cutter scheduling rule generation methods based on genetic algorithm, belong to data processing technical field, comprising: constructing scheduling model;According to machine priority heuristic rule, obtain each machine priority;According to the heuristic rule of initial tooling tool number and the heuristic rule of tool change tool number, each machine is allocated tool;The tool allocation combination of each machine processing task set is output;Machine number, initial tooling tool number and tool change tool number are respectively carried out real number coding;Using machine priority heuristic rule, initial tooling tool number heuristic rule and tool change tool number heuristic rule form initial population;Initial population is evolved, and the optimal population individual for the weighted sum of minimizing maximum completion time and minimizing tool change frequency is obtained.The workshop cutter scheduling rule generation method based on genetic algorithm solves the problem that existing optimization tool configuration mode scheduling optimization is not high.

A data compression device determines, based on a significant figure of each of a plurality of real numbers, a step size that is a value capable of dividing without remainder each of the plurality of real numbers. The data compression device acquires integers by dividing each of the plurality of real numbers by the step size.

The invention provides a modulation method, a communication node and a storage medium. The modulation method comprises the following steps: modulating a first data sequence to obtain a second data sequence; and for every two adjacent elements of the second data sequence, respectively obtaining a real number item of one element and an imaginary number item of the other element, carrying out addition and phase rotation operation on the real number item and the imaginary number item, and inserting data obtained by the addition and phase rotation operation between the two adjacent elements, and obtaining a third data sequence.

This invention provides a hybrid coding and genetic operation method and system for optimizing the layout of pipe supports and hangers. The method includes: S1, determining the pipe segments to be optimized and combining the optimized pipe segments to form an optimization range; S2, selecting an appropriate optimization mode according to engineering requirements and design stage; S3, performing coding operations for each optimized pipe segment, and the combination of codes for all pipe segments forms a complete chromosome coding structure for the optimization range; S4, generating an initial parent population based on the chromosome coding structure, and performing genetic operations through crossover and mutation to generate offspring individuals; S5, decoding the offspring individuals, performing simulation analysis, screening and constructing a new generation population; S6, repeating the evolutionary process until a preset termination condition is met. This invention uses real number coding combined with integer coding, and introduces natural number index coding to establish a mapping relationship with the coding, and designs matching chromosome crossover and mutation operation rules to achieve efficient genetic operations on the coded chromosomes.

This invention provides a script generation method, apparatus, electronic device, and readable storage medium. The method includes: acquiring at least one initial script idea element described in natural language; inputting the initial script idea element into a pre-trained semantic encoding model, converting the initial script idea element into a first idea vector in a d-dimensional real vector space, where d is a positive integer; wherein all real vectors output by the semantic encoding model together constitute a script idea latent space for representing the semantic distribution relationship of the initial script idea element; performing spatial operations on at least one first idea vector within the script idea latent space to obtain a second idea vector, the second idea vector being used to represent a script concept; inputting the second idea vector into a cross-modal projector, converting the second idea vector into a conditional vector matching the word embedding dimension of a pre-trained large language model; inputting the conditional vector as a generation condition into the large language model, outputting script idea text corresponding to the script concept, the script idea text including at least one of the following: story synopsis, character biographies, and key scene description information.

An example system includes a processor that can receive a number of complex packed tensors, wherein each of the complex packed tensors include real numbers encoded as imaginary parts of complex numbers. The processor can execute a single instruction, multiple data (SIMD) operation on the complex packed tensors using an integrated circuit of real and complex packed tensors in a complex domain to generate a result.

The application discloses a mechanical arm fuzzy PID control method based on quantum pigeon group optimization, first motion trajectory planning is carried out, and a mechanical arm is controlled to move according to the planned motion trajectory through a fuzzy PID controller; a QAPIO algorithm is used to optimize fuzzy PID control parameters, and each pigeon can be used as a PID control parameter of each joint of the mechanical arm. The QAPIO algorithm of the application modifies a compass operator update equation, a probability density function in quantum representation of real number coding and a quantum rotation gate in the original algorithm, so that the algorithm has a continuous updating capability, can continuously update an optimal value, improves global optimization capability, avoids premature local optimization, and solves the problem that the original algorithm is prone to falling into a [0, 0,..., 0, 0]T point, causing the optimization algorithm to fail. The application effectively realizes optimization of fuzzy PID controller parameters of the mechanical arm, and has good practicability.

Embodiments of the present application relate to the technical field of communications, and disclosed are a communication method and apparatus, a readable storage medium, a chip, and a program product, which can improve sensing performance while ensuring communication performance. The method comprises: generating a first signal and a second signal, wherein the first signal and the second signal are used for communication and sensing, the first signal is generated on the basis of a first sequence and a second sequence, the second signal is generated on the basis of a third sequence and a fourth sequence, the sum of an element at index x in the first sequence and an element at index x in the third sequence is c, x is an integer greater than or equal to 0 and less than or equal to P-1, P is the length of the first sequence and the third sequence, P is a positive integer, c is a real number, and elements of the first sequence and elements of the third sequence are not completely identical; and sending the first signal and the second signal.

The present subject matter relates to a method for proving a statement descriptive of a functionality of an electronic circuit using a quantum computer and a proof assistant. The method comprises: encoding a current proof state into a vector of real numbers of a fixed length, the current proof state defining a task for proving at least part of the statement, encoding the vector into a quantum state of a quantum system of the quantum computer, using the quantum state as an input quantum state by a quantum machine learning model for providing an output quantum state whose measurement represents a proof step for the defined task, measuring the output quantum state, thereby obtaining the proof step for the defined task, providing the proof step to the proof assistant, in response to providing the proof step, receiving a next proof state from the proof assistant.

The application discloses an NPU native Bartlett beam forming method for MIMO radar and belongs to the technical field of radar signal processing.The baseband echo data of the MIMO radar is constructed as a four-dimensional input real number tensor, and a Bartlett steering vector is constructed as a six-dimensional weight real number tensor, which are both stored in an interlaced format of real and imaginary parts; based on an NPU parallel multiply-accumulate array and a vector processing unit, equivalent complex matrix multiplication operation and element-by-element square and scaling operation are performed in a real number domain to obtain a four-dimensional output real number tensor with real and imaginary parts in the same sequence; after inverse transformation to restore the array structure, coherent accumulation is performed along a preset beam pointing dimension to output a power spectrum vector of K beam channels, and target azimuth estimation is realized by searching for a power spectrum peak value.The application deeply couples the NPU architecture characteristics and the essence of the Bartlett algorithm, reduces the processing delay by one order of magnitude, significantly improves the real-time performance and energy efficiency ratio while retaining the complete angle resolution and anti-interference performance, and is suitable for edge-side deployment in a resource-limited environment.

A method of digitally watermarking a neural network, implemented by an electronic device, the neural network being stored within a data structure including blocks of parameters. The method includes, for a current parameter block consisting of at least N parameters representing real numbers, obtaining a message including N bits, at least N iterations of a parameter modification operation within the current block, including obtaining a current parameter, from among the at least N parameters of the current parameter block, and updating the value of a predetermined index bit of the current parameter as a function of a bit in the message.

Provided in the embodiments of the present disclosure are a channel information feedback method and apparatus. The method comprises: determining a base vector set on the basis of a dimension parameter set and a real number set, wherein the base vector set is composed of N base vectors; dividing the base vector set into M groups of orthogonal bases, wherein base vectors in each group of orthogonal bases are orthogonal pairwise; selecting k groups of orthogonal bases from among the M groups of orthogonal bases; and constructing a codebook set on the basis of the k groups of orthogonal bases, and indicating the selected codebook set to a receiving end, such that the receiving end uses the codebook set to perform quantized feedback on channel information.

The embodiment of the invention provides a modulation method, a storage medium, an electronic device and a computer program product, and the method comprises the steps: modulating a first data sequence, and obtaining a second data sequence; performing cyclic shift and addition operation on a real part item and an imaginary part item of the second data sequence to obtain a third data sequence; and multiplying each element of the third data sequence by a preset negative real number, and inserting the second data sequence in a staggered manner to obtain a fourth data sequence. Through the embodiment of the invention, the peak-to-average ratio of the data signal can be better reduced, so that the problem that the coverage capability of a communication system and the signal transmission quality are influenced due to the relatively high peak-to-average ratio in related technologies is solved, and the technical effect of improving the coverage capability of the communication system and the signal transmission quality is achieved.

The invention provides a cold source system optimization method and system based on ridge regression and a genetic algorithm, and the method comprises the steps: employing a dynamic VIF collinearity processing mechanism, calculating a variance expansion factor in real time through exponentially weighted moving average, and carrying out the fusion processing of a strong collinearity parameter according to a physical formula; through a ridge regression weight guided genetic algorithm search, the influence weight of the feature parameters on the system COP is quantified by L2 regularization, and a genetic algorithm search space is dynamically constrained; and a double-layer coding cooperation strategy is adopted, upper-layer integer coding equipment start-stop states and lower-layer real number coding operation parameters are adopted, and ridge regression weights are associated to dynamically adjust the step length. According to the method, the full-chain automatic optimization method of'perception-decision-execution 'of the real cold source system is constructed, so that automatic and efficient optimization of the cold source system is realized, the environmental adaptability and energy efficiency of the cold source system are effectively improved, and the long-term operation and maintenance cost is reduced.

The invention discloses a non-gradient and gradient collaborative topological optimization method for a single-phase elastic superstructure, and the method comprises the steps: generating a random initial configuration, and carrying out the real number type coding of the random initial configuration and a design variable, and recording the real number type as X; a multi-objective optimization model considering band gap performance maximization and structure connectivity maximization is constructed based on X, a constraint condition that a wave vector k is limited on a feature path of an irreducible Brillouin region boundary is used, the constraint condition is solved through a non-dominated sorting genetic algorithm, and a Pareto leading edge is obtained; selecting a high-performance candidate solution from the Pareto frontier as initial input; a topological optimization model considering band gap performance maximization and structural connectivity as constraints is constructed based on a high-performance candidate solution, a current design variable is solved, a three-field floating projection topological optimization framework is introduced to update a design field design variable, then implicit floating projection constraints are introduced to further carry out iterative updating on the design field design variable, and the design field design variable is optimized. And convergence is realized.

Provided is a secure real-number multiplication method and apparatus based on scale transformation, which relates to the technical field of secure real-number multiplication. The secure real-number multiplication method includes: determining, by each participant, a private input value; performing, by each participant, scale transformation on the private input value to generate a private input matrix; with the private input matrix as input, computing, by each participant, a private output matrix by utilizing a Secure Two-Party Matrix Multiplication (S2PM) protocol based on a secure data disguising technology; calculating, by each participant, a sum of all elements in the private output matrix to obtain a private output value; and sending, by each participant, the private output value to a computation requester to obtain a secure real-number multiplication result.

The embodiment of the invention discloses a question and answer method and device, electronic equipment and a medium, and relates to the technical field of artificial intelligence, and a specific implementation mode of the method comprises the following steps: carrying out vector initialization on a plurality of elements in a time sequence knowledge graph in a real number space and a complex number space to obtain a real number vector represented by a real number and a complex number vector represented by a complex number, the plurality of elements comprise entities, relationships and time; mapping an entity real number vector and a relation real number vector in the real number vectors according to a time real number vector in the real number vectors, and constructing a mapping matrix; determining a target vector represented by complex numbers of the elements based on the mapping matrix, a relation complex number vector in the complex number vectors and a time complex number vector in the complex number vectors; and when the question statement is obtained, determining a question answer corresponding to the question statement based on the target vector. The semantic space for effectively distinguishing entities and relationships is realized, the capture of time evolution characteristics is enhanced, and questions and answers can be more accurately obtained from the time sequence knowledge graph.