Patents
Literature
Patsnap Copilot is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Patsnap Copilot

150results about How to "Reduce optimization time" patented technology

Side-lobe suppression method for three-dimensional array antenna pattern based on improved MOPSO and convex optimization algorithm

The invention discloses a side-lobe suppression method for a three-dimensional array antenna pattern based on an improved MOPSO and a convex optimization algorithm. Firstly, three-dimensional array antenna pattern synthesis is modeled and analyzed, and a basic mathematic model of the array antenna radiation pattern synthesis is given, and multi-objective functions of low side-lobe pattern synthesis under constraint conditions of an array radiation direction and first side-lobe suppression are constructed respectively; then, the maximal excitation of a polarization directivity coefficient is obtained by a Lagrange multiplier method and is added in the MOPSO algorithm as preference information, an initial population is generated in the vicinity of optimal solutions, and the model is solved by iterative calculation; a convex optimization model of the low side-lobe pattern synthesis is constructed, a convex optimization tool is utilized to solve the corresponding optimal solutions under different threshold constraints, then the three-dimensional array antenna pattern under the low side-lobe constraint is obtained, and therefore the purpose of side-lobe suppression is achieved. According to the side-lobe suppression method for the three-dimensional array antenna pattern based on the improved MOPSO and the convex optimization algorithm, the optimization performance of the algorithms is improved, and the side-lobe suppression problem of the three-dimensional array antenna pattern can be solved efficiently and quickly.
Owner:NANJING UNIV OF AERONAUTICS & ASTRONAUTICS

Array antenna radar cross section reduction method based on space mapping

The invention discloses an array antenna radar cross section reduction method based on space mapping. The array antenna radar cross section reduction method based on the space mapping comprises the steps of establishing an array antenna model, enabling unit amplitude uniform plane wave to illuminate on an array antenna, and determining a total scattering field of the array antenna; deducing a radar cross section formula of the array antenna according to a pattern multiplication, establishing a space mapping rough model of the array antenna, optimizing the rough model and determining an optimum design parameter of the rough model; utilizing a method of moments of a full-wave analysis in a fine model; enabling the response of the rough model to approach that of the fine model through parameter extraction, and establishing a mapping relation of a rough model parameter and a fine model parameter; and utilizing the optimum design parameter of the rough model and the inverse mapping of the established mapping relation to obtain a prediction parameter of the fine model, and if the prediction parameter of the fine model does not meet a design requirement, subjecting the mapping relation to iteration updating until the prediction parameter of the fine model meets the design requirement. The array antenna radar cross section reduction method based on the space mapping subjects the design parameter to a global optimization and saves time under the premise of guaranteeing the accuracy.
Owner:NANJING UNIV OF SCI & TECH

Large-scale phased antenna array wide-angle scanning optimization method based on space mapping

The present invention discloses a large-scale phased antenna array wide-angle scanning optimization method based on space mapping. The large-scale phased antenna array wide-angle scanning optimization method based on space mapping comprises the following steps of: establishing an array antenna model; under the condition of not considering mutual coupling, obtaining a directional diagram of an array by multiplying directional diagrams of array elements by an array factor so as to establish a rough mode of array antenna space mapping, optimizing the rough model and determining the optimal design parameter of the rough model; processing a fine model by adopting a full-wave analysis moment method, enabling response of the rough model to approach to response of the fine model by parameter extraction and establishing a mapping relation between the rough model parameter and a fine model parameter; and obtaining the predicted parameter of the fine model by utilizing the optimal design parameter of the rough model and inverse mapping of the established mapping relation and if the predicted parameter of the fine model does not meet the design requirement, carrying out iterative updating on the mapping relation until the predicted parameter of the fine model meets the design requirement. According to the method, the designed parameter is integrally optimized and on the premise of ensuring accuracy, calculating time is saved.
Owner:NANJING UNIV OF SCI & TECH

Dynamic scheduling method of track type automatic guiding vehicle based on segmentation optimization of genetic algorithm

The invention discloses a dynamic scheduling method of a track type automatic guiding vehicle based on segmentation optimization of a genetic algorithm. The method comprises the following steps: performing segmentation optimization on a parking sequence of the track type automatic guiding vehicle at various parkable positions according to state parameters of numerical control machine tools and preset processing parameters; encoding: encoding the parking positions of the track type automatic guiding vehicle in the future N times into a gene string with a length N; decoding: using a ratio of a workpiece number completed in a process when the track type automatic guiding vehicle moves for N steps to the consumed time as gene string fitness; and performing crossover, mutation and retention ofelite gene string operations on the genetic algorithm, obtaining an optimal gene string through multiple rounds of evolution, and using the optimal gene string as the movement mode of the track type automatic guiding vehicle in the future N times. The algorithm re-optimizes the movement trajectory of the RGV in the future N times when finding that the CNC is faulty or restores from the fault, so that an RGV scheduling scheme can be automatically adjusted according to the change of the system parameters, and CNC random faults and fault restoration can be adaptive.
Owner:SHANDONG NORMAL UNIV

Composite energy storage system energy optimization and allocation method of electric automobile

The invention provides a composite energy storage system energy optimization and allocation method of an electric automobile and belongs to the field of composite energy storage system energy allocation. The problem that an existing composite energy storage system energy allocation method is long in operating time and poor in allocation effect. Firstly, a convex optimization method is adopted to generate a comparison table of the total output powder of an electric automobile after optimization and the output power of a super-capacitor bank; secondly, a two-dimensional array is established according to the comparison table, a whole automobile controller calculates the total toque required by the electric automobile in action operation according to the acquired speed of the electric automobile, front and rear motor rotation speeds and the opening degree of an accelerator pedal and calculates the real-time required powder Pd of the electric automobile according to the required total torque and the speed of the electric automobile; finally, the real-time output powder Psc of the super-capacitor bank is looked up from the two-dimensional array according to the real-time required powder Pd; according to the real-time required powder Pd, a two-way DC/DC converter is controlled so as to complete the energy allocation of the electric automobile. The composite energy storage system energy optimization and allocation method is used for energy allocation.
Owner:HARBIN UNIV OF SCI & TECH

Optimisation of sequential combinatorial processes

A method of optimising a sequential combinatorial process comprising an interchangeable sequence of events comprises using a master model to model a selection of the possible sequences, and using information derived from the master model in a surrogate model that approximates the master model with a much shorter computation time. The surrogate model calculates all the possible sequences using an algorithm to select from the information calculated by the master model that which most closely matches the events of a present sequence, following a prioritised system so that the best match is used wherever possible. All results from the surrogate model are compared so that the modelled sequence that gives the result closest to a desired optimum result for the process can be identified, and potentially applied to the process. Accuracy can be enhanced by running the optimum sequence through the master model as a check, and further by adding the optimum sequence to the information used by the surrogate model in future calculations. Any sequential combinatorial process, in which the quality of the end result of the process depends on the order in which events in the process are performed, can be optimised in this way, including manufacturing process such as machining, cutting, shaping, forming and/or heat treating a workpiece, flow of material through a factory or oil or gas through a pipeline network, chemical and material science mixing processes, computational biology modelling, and fleet management.
Owner:VOLVO AERO CORP +1

Building multi-performance oriented design optimization method

The invention discloses a building multi-performance oriented design optimization method, which comprises the steps of 1, determining a building design decision target and potential influence factorsthereof as an optimization target and an optimization variable respectively, and defining constraint conditions so as to construct an optimization model; 2, obtaining a building performance sample library with statistical representativeness, wherein the step comprises construction of an optimization variable sample matrix, setting of a building physical model, construction of a building performance output matrix and construction of a building multi-dimensional input and multi-dimensional output sample matrix; 3, constructing a simplified relation model between the optimization variable and theoptimization target by adopting a machine learning algorithm, and taking the simplified relation model as an agent model; and 4, taking the agent model as a fitness function of an optimization algorithm, executing building multi-objective optimization, and obtaining a Pareto optimization result. According to the method, the multi-objective optimization process of the building performance can be more scientific and standard, calling of EnergyPlus software in the optimization process is reduced through the coupling agent model and the multi-objective genetic algorithm, and the optimization timeis shortened.
Owner:TIANJIN UNIV

Dynamic evolution rate BESO topological optimization method based on arc tangent and application thereof

The invention discloses a dynamic evolution rate BESO topological optimization method on arc tangent and an application thereof. The dynamic evolution rate BESO topological optimization method comprises the steps: firstly, for a basic structure needing topological optimization, carrying out the discrete design of a domain through a finite element grid under a given boundary and loading condition,and obtaining a finite element model; determining initialized related parameters; executing finite element analysis for the finite element model, calculating the comprehensive sensitivity of each unitof the finite element model, and constructing the current dynamic evolution rate of the finite element model according to an arc tangent dynamic evolution rate function; determining the number of units needing to be updated in the current iterative step of the finite element model according to the current dynamic evolution rate of the finite element model; updating and optimizing the finite element model according to the number of units to be updated and the comprehensive sensitivity; and if the structure of the currently updated finite element model meets a constraint condition or a convergence condition, ending the optimization, and outputting an optimization model. According to the invention, the topology optimization of the basic structure can be accelerated by using the dynamic evolution rate, and the efficiency and flexibility of topology optimization are improved.
Owner:GUANGZHOU UNIVERSITY

Method for accelerating operating speed of graphics processing unit (GPU) through dead code removal

The invention discloses a method for accelerating operating speed of a GPU through dead code removal. By the aid of the method, the implementation and compiling efficiency of a large-scale GPU kernel program can be improved. The technical scheme includes that firstly, a state detection table is established for all functions in the large-scale GPU kernel program; basic information of functions is recorded, and the state detection table is initialized; static analysis is conducted for the GPU program; and then the GPU kernel program is operated, information during operation of the GPU kernel program is recorded, states of all function detection table fields in the state detection table are updated, dead codes are marked and finally certified, and dead codes are deleted according to a dead code set D which is obtained finally. According to the method, dead codes which are not implemented during operation are removed, so that the code size of the GPU kernel program is reduced, the assembly code size which is generated finally is also reduced, the hit rate of single instruction multiple data (SIMD) instruction scheduling in the GPU can be improved, and the operation efficiency of the large-scale GPU kernel program can be greatly improved.
Owner:NAT UNIV OF DEFENSE TECH

Swarm intelligence optimization method for dynamic hydraulic balance of chilled water pipe network of central air conditioner

The invention discloses a swarm intelligence optimization method for dynamic hydraulic balance of a chilled water pipe network of a central air conditioner. The method is characterized in that intelligent computing nodes CPNs are set in air conditioning cabinets, bypass valves and water pump equipment in the chilled water pipe network; all the intelligent computing nodes CPNs are interconnected according to an actual physical topological connection relationship to form a network communication system of a swarm intelligence architecture; corresponding distributed computation is completed according to the adjustment task, and finally the dynamic hydraulic balance of the chilled water pipe network is achieved with the minimum system total power; the intelligent computing nodes CPNs of the airconditioning cabinets compute through information interaction to obtain the minimum system water supply and return pressure difference and the total flow meeting the flow requirements of all the airconditioning cabinets at the tail end of the system, and compute to obtain the opening degrees of water valves of surface air coolers of the air conditioning cabinets; and the intelligent calculatingnodes CPNs of water pumps compute to obtain an optimal operation strategy of a parallel water pump system according to the obtained system water supply and return pressure difference and the total flow requirement, and finally the purposes of the optimization of the dynamic hydraulic balance of the chilled water pipe network, the energy conservation and the consumption reduction are achieved.
Owner:XI'AN UNIVERSITY OF ARCHITECTURE AND TECHNOLOGY

Configuration optimization method of double-planet-row power dividing hybrid power system

The invention relates to a configuration optimization method of a double-planet-row power split hybrid power system, which comprises the following steps of generating a configuration library accordingto a clutch constraint condition and a possible connection relationship between components; removing configurations which do not meet configuration constraint conditions, and establishing a general energy management strategy of each configuration; obtaining a preliminary optimization configuration library based on a longicorn beard search algorithm; establishing a candidate scheme set screening module; obtaining an optimized configuration of each preliminary optimized configuration based on a particle swarm optimization algorithm and a candidate scheme set screening module; and screening based on the candidate scheme set screening module to obtain an optimal configuration. Compared with the prior art, all feasible configurations of the double planet rows are comprehensively and optimallydesigned, and engineering requirements of different user design objectives can be met; the comprehensive performance evaluation indexes of the economy, the dynamic property, the comfort and the reliability of the configuration are used as an optimization objective function, and the particle swarm optimization algorithm is combined to realize the quick optimization of the optimal scheme of the comprehensive performance of the configuration.
Owner:TONGJI UNIV

High-resolution Forbes aspherical photoetching objective lens

The invention relates to a high-resolution Forbes aspherical photoetching objective lens, and belongs to the technical field of high-resolution projection photoetching objective lenses. The high-resolution Forbes aspherical photoetching objective lens specifically comprises a front lens group and a rear lens group, wherein the numerical aperture is 0.75, and totally 29 lenses are used; the surfaces of six lenses are Forbes aspherical surfaces; the lenses are made of fused quartz and calcium fluoride; the calcium fluoride is used for correcting chromatic aberration; the front lens group and the rear lens group are fixedly connected together at a certain interval through a mechanical component on a lens outer frame; and the two lens groups share the same optical axis. According to the high-resolution Forbes aspherical photoetching objective lens, the resolution of the conventional projection photoetching objective lens is improved, and the effectiveness of each aspherical surface and each aspherical coefficient is guaranteed, so that the number of the aspherical surfaces and the number of effective figures of the system are reduced and the image quality is improved at the same time, and the tolerance sensitivity is reduced greatly; when a central light ray is used as a reference, single-color root-mean-square wave aberration is less than 0.5 nanometers, and the distortion is less than 0.5 nanometers; and the high-resolution Forbes aspherical photoetching objective lens can be applied to a deep ultraviolet projection photoetching device, in which the wavelength of a lighting light source is 193 nanometers.
Owner:BEIJING INSTITUTE OF TECHNOLOGYGY

Rapid optimization method and system for operating performance of Linux system

InactiveCN106649070AAvoid overriding performance optimization operationsSimplify the optimization processHardware monitoringState of artGNU/Linux
The invention discloses a rapid optimization method for the operating performance of a Linux system. The rapid optimization method includes the steps that a current-performance-state information value of a system is obtained; according to the matching rule of a preset performance-state information value and a corresponding operating condition, the current-performance-state information value is matched, and a current operating condition of the system is determined; the system is subjected to performance optimization operation corresponding to the current operating condition. According to the rapid optimization method, after the current-performance-state information value of the system is obtained, the current operating condition solely matched with the system is determined according to the established rule, and the corresponding performance optimization operation is carried out according to the current operating condition; compared with the prior art, coverage performance optimization operation of all pieces of hardware of the system is avoided, hardware with performance bottlenecks in the system is purposely optimized, the optimization process is simplified, the optimization time is shortened, and the optimization accuracy and the optimization efficiency are improved. The invention also discloses a rapid optimization system for the operating performance of the Linux system. The described advantages of the rapid optimization system are achieved.
Owner:ZHENGZHOU YUNHAI INFORMATION TECH CO LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products