Product
Patsnap Eureka
For R&D, Patsnap Eureka makes reading and utilizing patents & technical documents easy.
Patsnap Eureka AIR
Designed for self-driven R&D workflows. Generate viable solutions, solve complex R&D challenges, empower your innovation with AI.
Patsnap Eureka Materials
Designed for material experts only. Revolutionize your material R&D, from search, analyze, to developing new materials.
Feature
TechResearch
Generate reliable direction feasibility study reports for your R&D in just a few steps.
TechSeek
Discover and master advanced knowledge NOW. Basics, ideas, possibilities, all at once.
TechMind
As an expert in R&D Theories, TechMind can generates customized viable solutions instantly.
TechRisk
Analyze your overall solution with one click, know your potential R&D risks in advance.
TechMonitor
Get weekly tech updates, stay abreast of the latest tech innovations and key insights.
Patents
Literature
Hiro is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
154 results about "Population size" patented technology
Efficacy Topic
Property
Owner
Technical Advancement
Application Domain
Technology Topic
Technology Field Word
Patent Country/Region
Patent Type
Patent Status
Application Year
Inventor
In population genetics and population ecology, population size (usually denoted N) is the number of individual organisms in a population. Population size is directly associated with amount of genetic drift, and is the underlying cause of effects like population bottlenecks and the founder effect. Genetic drift is the major source of decrease of genetic diversity within populations which drives fixation and can potentially lead to speciation events.
Method and system for optimizing an interrogation of a tag population
InactiveUS7009496B2Memory record carrier reading problemsSubscribers indirect connectionData miningPopulation size
A method and system for optimizing an interrogation of a tag population that includes a plurality of tags, wherein each of the plurality of tags is assigned a tag address includes determining a tag population size; selecting one of a plurality of efficiency profiles that matches the determined tag population size; and defining a plurality of interrogation read cycles according to the selected efficiency profile.
Owner:SYMBOL TECH LLC
Method and system for optimizing an interrogation of a tag population
InactiveUS20030214389A1Memory record carrier reading problemsSubscribers indirect connectionData miningPopulation size
A method and system for optimizing an interrogation of a tag population that includes a plurality of tags, wherein each of the plurality of tags is assigned a tag address includes determining a tag population size; selecting one of a plurality of efficiency profiles that matches the determined tag population size; and defining a plurality of interrogation read cycles according to the selected efficiency profile.
Owner:SYMBOL TECH LLC
System for continuous outcome prediction during a clinical trial
InactiveUS20060129326A1Easy to controlData processing applicationsComputer-assisted medical data acquisitionClinical efficacyClinical psychology
The present invention provides a method, apparatus, and computer instructions for improved control of clinical trials. In a preferred embodiment, after a clinical trial is initiated, data is regularly cleaned and processed to statistically analyze the data. The outcome includes a predictive measure of the timing and level by which the study will achieve one or more statistically significant levels, allowing mid-course modifications to the study (e.g., in population size, termination, etc.). Modification can be planned as part of the initial protocol, using thresholds or other appropriate criteria relating to the statistical outcome, making possible pre-approved protocol changes based on the statistical findings. This process has significant implications for the management of clinical studies, including ensuring the minimum possible time and number of patients are used in clinical studies to either prove (or disprove) the clinical efficacy of drugs or treatments.
Owner:AZERA RES
Automated field development planning of well and drainage locations
ActiveUS20080300793A1Reduce in quantityLess timeElectric/magnetic detection for well-loggingFluid removalPopulation sizeTool use by animals
A hybrid evolutionary algorithm (“HEA”) technique is described for automatically calculating well and drainage locations in a field. The technique includes planning a set of wells on a static reservoir model using an automated well planner tool that designs realistic wells that satisfy drilling and construction constraints. A subset of these locations is then selected based on dynamic flow simulation using a cost function that maximizes recovery or economic benefit. In particular, a large population of candidate targets, drain holes and trajectories is initially created using fast calculation analysis tools of cost and value, and as the workflow proceeds, the population size is reduced in each successive operation, thereby facilitating use of increasingly sophisticated calculation analysis tools for economic valuation of the reservoir while reducing overall time required to obtain the result. In the final operation, only a small number of full reservoir simulations are required for the most promising FDPs.
Owner:SCHLUMBERGER TECH CORP
Nerve network system for realizing genetic algorithm
InactiveCN1450493AEasy to implementHigh speedGenetic modelsPhysical realisationNerve networkRelationship - Father
The invention is nerve net system which can realize heredity arithmetic. It is made up of computer nerve net model component and the interfaces. The character lies in: 1. after that the computer setsthe population size, coding type and length, heredity operation probability and the arithmetic ending condition of the arithmetic, the nerve net uses population size to realize the whole heredity operation including selection, crossing, mutation and personal adaptability value, and outputs the optimized calculation and result through computer; 2. designs the heredity operation nerve net model which can realize multi-father crossing operation and multi-gene mutation operation, realizes the two operation of two-value coding heredity arithmetic and real number coding heredity arithmetic.
Owner:BEIJING UNIV OF TECH
Method for collecting spatial population distribution in real time on basis of mobile phone big data and realizing large passenger flow early warning
InactiveCN105488120ALow costIncrease frequencyData processing applicationsLocation information based serviceHuman population distributionMobile communication network
The invention aims at providing a method for collecting spatial population distribution in real time on the basis of mobile phone big data and realizing large passenger flow early warning. The method is characterized by comprising the following steps of obtaining real-time mobile phone big data from a mobile phone communication operator at each statistics moment; dividing a target region into different space regions; at the current statistics moment, mapping the latest space position of each EPID (Electronic Portal Imaging Device) obtained in the first step to each space region of the target region; and obtaining the real population size (the distribution condition of the total population in the whole target region) in each space region at the current statistics moment. The method has the advantages that the sufficient relying on the existing mobile phone big data resources is realized; the continuous encrypted position information of the existing mass anonymous mobile phone users in the mobile communication network is used; the low-cost high-frequency and automatic implementation can be realized; and the popularization distribution data in a large-range urban space range can be continuously obtained in a fast deploying way.
Owner:上海川昱信息科技有限公司
Automated field development planning of well and drainage locations
ActiveUS8005658B2Reduce in quantityWithout significantly compromising the accuracy of the more complex algorithmsElectric/magnetic detection for well-loggingFluid removalEconomic benefitsAnalysis tools
A hybrid evolutionary algorithm (“HEA”) technique is described for automatically calculating well and drainage locations in a field. The technique includes planning a set of wells on a static reservoir model using an automated well planner tool that designs realistic wells that satisfy drilling and construction constraints. A subset of these locations is then selected based on dynamic flow simulation using a cost function that maximizes recovery or economic benefit. In particular, a large population of candidate targets, drain holes and trajectories is initially created using fast calculation analysis tools of cost and value, and as the workflow proceeds, the population size is reduced in each successive operation, thereby facilitating use of increasingly sophisticated calculation analysis tools for economic valuation of the reservoir while reducing overall time required to obtain the result. In the final operation, only a small number of full reservoir simulations are required for the most promising FDPs.
Owner:SCHLUMBERGER TECH CORP
Method and device for route optimization of logistics delivery vehicle
InactiveCN105046365AImprove fitnessShort delivery distanceForecastingLogisticsLogistics managementDistance matrix
The invention discloses a method and a device for route optimization of logistics delivery vehicle, and belongs to the technical field of logistics. The method comprises the following steps of: initializing a congestion matrix alpha and a distance matrix D, generating a delivery route weight matrix omega=alpha D, and initializing a population module N<ZQ>; selecting a population size N<X>, a maximum number of generations N<G>, a crossing-over rate beta, a mutation rate gamma and a number of generations n=0, generating an initial route r1 through a greedy algorithm, and performing mutation operation on the initial route r1 to generate N<ZQ>-1 new routes; calculating fitness A<n> of each route of a first generation population formed by the initial route and the new routes, selecting N<X> routes with the highest fitness from the current population by adopting selection operators, and performing crossover and mutation operations on the N<X> routes to generate a population of next generation; updating n=n+1, when n=N<G>, calculating the fitness A<n> of all the routes in the latest population, and selecting the delivery route with the highest fitness in the current population as the optimal route. According to the invention, when the logistics delivery vehicle delivers goods, the delivery time can be as less as possible, and the delivery route can be as short as possible.
Owner:余意 +3
Multilayer obstacle-avoiding Steiner minimal tree construction method for very large scale integration
ActiveCN103902775AQuality improvementExcellent solutionGenetic modelsSpecial data processing applicationsVery large scale integrated circuitsSteiner minimal tree
The invention relates to a multilayer obstacle-avoiding Steiner minimal tree construction method for a very large scale integration. The method includes the following steps: 1, reading benchmark test circuit network data; 2, initializing parameters such as population sizes and iterations, and generating initial populations randomly; 3, updating positions and speeds of particles according to a particle updating formula; 4, calculating fitness values of new particles according to a punishment mechanism based fitness calculation function, judging whether or not the fitness values of the new particles are smaller than historical optimal values of the particles, and if yes, updating the new particles as historical optimal particles of the particles; 5, judging whether or not the fitness values of the new particles are smaller than global optimal values of the populations, and if yes, updating the new particles as global optimal particles of the populations; 6, judging whether iteration end conditions are met or not, if yes, outputting final wiring trees, and if not, returning to the step 3 for next iteration. By the method, total wiring cost is reduced, and quality of the wiring trees is improved.
Owner:上海立芯软件科技有限公司
Improved genetic algorithm-based traveling salesman problem solving method
InactiveCN107122843ASolving NP-hard problemsImprove efficiencyForecastingGenetic algorithmsMutation probabilityImproved algorithm
The invention discloses a method for solving the traveling salesman problem based on an improved genetic algorithm. The steps include: aiming at the TSP problem, encoding the path using a decimal number string; calculating the total length, and then judging the total length; after encoding On the search space U of the decimal number string path, define the fitness function f(x), and define the population size n, the crossover probability Pc, the mutation probability Pm and the number of iterations T; in the search space U, randomly generate n individuals s1, s2, s3, ..., sn, constitute the initial population S0 = {s1, s2, s3, ..., sn}, set the current iteration number t = 0; according to the fitness function f(x), evaluate the individual fitness in the population , if t<T, then end the step, otherwise perform the genetic operation step; the individual with the highest fitness obtained through the genetic operation step is the optimal solution of the traveling salesman problem solving method. Based on the traditional genetic algorithm, the present invention optimizes the traveling salesman problem to achieve the purpose of improving the shortcoming that the algorithm is prone to premature convergence and optimizing the search efficiency.
Owner:SOUTH CHINA UNIV OF TECH
Transmission and transformation project construction cost assessment method and device
InactiveCN103440370AAccurate estimateGuaranteed benefitsData processing applicationsSpecial data processing applicationsLearning factorLeast squares support vector machine
The invention provides a transmission and transformation project construction cost assessment method and device. The transmission and transformation project construction cost assessment method comprises the following steps: input historical sample data of a transmission and transformation project are received; iterations, inertia weight, learning factors, particle velocity of a chaos particle swarm and the population size of the particle swarm are initialized to build a chaos particle swarm model; according to the chaos particle swarm optimization, parameters of the chaos particle swarm model are optimized; according to the historical sample data and the optimized chaos particle swarm model, optimal values of the iterations, inertia weight and learning factors of the chaos particle swarm model are determined; according to the determined optimal values of the iterations, inertia weight and learning factors, penalty coefficients, insensitive coefficients and kernel function parameters of a least square support vector machine model are determined respectively to build the least square support vector machine model; input actual sample data of the transmission and transformation project are received; according to the actual sample data of the transmission and transformation project and the built least square support vector machine model, a construction cost assessment result of the transmission and transformation project is generated.
Owner:STATE GRID CORP OF CHINA +1
Flexible job shop batch scheduling method based on genetic algorithm
The invention discloses a batch scheduling method for flexible job shops based on genetic algorithms. The steps of the method are: (1) Determine the operating parameters, including population size M, crossover probability P C , the mutation probability P M , the number of iterations T; (2) Initial population generation, using segmented coding method to generate batch codes and process codes; (3) Individual fitness calculation, taking the reciprocal of the individual’s total completion time as its fitness value; (4) Select Operation, using the roulette selection operator; (5) crossover operation, setting crossover execution criteria, performing crossover on batch codes or process codes according to the criteria, and repairing after crossover; (6) mutation operation, using multiple Point mutation, using reverse sequence mutation for the process code; (7) Termination discrimination, judging whether the number of generations meets the termination condition, stop if it is satisfied, and output the optimal scheduling plan, otherwise go to (3). The invention can optimize the production operation of the flexible workshop, effectively shorten the production cycle, has strong applicability and is easy to popularize.
Owner:SHANGHAI UNIV
Multi-workflow scheduling method based on genetic algorithm under cloud environment
ActiveCN107967171AReduce complexityImprove computing resource utilizationProgram initiation/switchingArtificial lifeOptimal schedulingNew population
The invention discloses a multi-workflow scheduling method based on a genetic algorithm under a cloud environment. The method comprises the following steps that a previous workflow scheduling state isreserved, the genetic algorithm and a new workflow are initialized, the adaptability degree of each individual of the new workflow is calculated, and two parent individuals are selected; according tothe genetic algorithm, the parent individuals are subjected to cross operation and single-point variation, progeny individuals are obtained, the adaptability degrees of the progeny individuals are calculated, the adaptability degrees of the progeny individuals and the corresponding parent individuals are compared, and two smaller progeny individuals are selected and added to the progeny population; if the size of the progeny population is equal to that of the parent population, the progeny population and the parent population are merged, the individuals which accord with the genetic algorithmare selected from the merged population to form the new population, and otherwise, the step of selecting the parent individuals again is skipped to; finally, according to the iteration frequency, optimal scheduling is output. According to the multi-workflow scheduling method based on the genetic algorithm under the cloud environment, the situation is avoided that previous workflow scheduling is damaged so that additional communication cost can be generated, and the utilization rate of computing resources of a virtual machine is further increased.
Owner:UNIV OF ELECTRONICS SCI & TECH OF CHINA
SAR image change detection method based on quantum-inspired immune clone
ActiveCN101908213AFast and efficient searchAvoid getting stuck in a local optimumImage analysisGenetic modelsLocal optimumComputer science
Owner:XIDIAN UNIV
Two-dimensional dual-threshold SAR image segmentation method based on quantum particle swarm optimization
ActiveCN103914831AGood segmentation effectIncreased complexityImage analysisBiological modelsTime complexitySar image segmentation
The invention discloses a two-dimensional dual-threshold SAR image segmentation method based on quantum particle swarm optimization. The method comprises the realization steps: (1) initializing the particle swarm population size M and the maximum iterations Tmax and generating the initial position of each particle randomly; (2) calculating a fitness function, and obtaining the optimal position of a current particle and an overall optimal position of iteration of this time according to the maximum in-cluster variance value; (3) calculating Pid and mbestd; (4) constructing a random number set; (5) setting a definition value, judging the relation between the random number set and the definition value, and upgrading the position of each particle according to a formula; (6) checking whether the end condition is achieved, achieving the end if yes, or else executing the steps from two to five; (7) segmenting an SAR image according to a pair of searched optimal thresholds stored in two dimensions of the particle pointed by the overall optimal position. Compared with a classical segmentation method, the segmentation method is good in effect of dividing the SAR image, and relatively small in time complexity.
Owner:XIDIAN UNIV
Particle swarm optimization method based on complex network
ActiveCN103971160AImprove convenienceGuaranteed activityBiological modelsLocal optimumInformation transmission
The invention relates to a particle swarm optimization method based on a complex network. The particle swarm optimization method is used for solving the multiobjective optimization problem in the real world. The particle swarm optimization method based on the complex network comprises the steps that the population network topology is established according to a scale-free network generation mechanism, the optimization space, the population size, the positions of particles and the speeds of the particles are determined, the adaptive value is calculated according to a fitness function, the historical best position of each particle, the historical best position of the corresponding neighbor particle and the global historical best position of the particles are recorded, the positions and the speeds of the particles are updated in an iteration mode every time, the adaptive value is calculated again until iteration is completed, and the global best position is output. The particle swarm optimization method based on the complex network further provides four indexes for evaluating the optimal performance of center particles and non-center particles, the influence in neighborhood, the information transmission capacity, the advantages and disadvantages of the adaptive value and the capacity for maintaining population activeness. By means of the particle swarm optimization method based on the complex network, the local optimum can be effectively avoided, and the convergence rate and the optimization effect for resolving targets are balanced through the application of the particle swarm optimization algorithm.
Owner:BEIHANG UNIV
Space multi-joint robot path planning method based on differential evolution particle swarm optimization
ActiveCN109108963AReduce energy consumptionShorten the timeProgramme-controlled manipulatorStagnation pointDynamic models
The invention discloses a space multi-joint robot path planning method based on differential evolution particle swarm optimization. The method comprises the steps of building a kinematic model and a dynamic model of mechanical arm joint angle changes of a space multi-joint robot, then building a model of disturbance caused by collision of a multi-joint robot, expressing a changing track curve of joint angles as a polynomial function relative to time, and building a total fitness function; and in iteration solution, firstly, using particle swarm optimization, and starting a differential evolution algorithm when a stagnation point appears in particle swarm optimization, and exchanging partial individuals of the populations of the two algorithms so as to enlarge the population size, and completing path planning of the space multi-joint robot. According to the space multi-joint robot path planning method based on differential evolution particle swarm optimization, grasp path planning of the space mechanical arm is carried out by utilizing the particle swarm optimization corrected with differential evolution; and because the purpose of planning is to make the end effector of the mechanical arm arrive at the fixed position and be in the fixed gesture, and to control the structure of the mechanical arm at the termination of time, the disturbance caused to the base by collision betweenthe end effector and a target is the least, and total energy consumption of a traveling path is the least.
Owner:NORTHWESTERN POLYTECHNICAL UNIV
Optimized scheduling method for multi-lift-car elevator cluster
An optimized scheduling method based on a particle swarm optimization algorithm and used for a multi-lift-car elevator cluster includes the following steps that passenger flow information is generated through a passenger flow generator, wherein the passenger flow information is a hall layer elevator calling signal; parameter initialization is conducted, wherein parameters include the parameters including cluster size, the iteration number and the like of the adopted particle swarm optimization algorithm and the comprehensive evaluation function determined according to elevator running information; optimized calculation is conducted through the particle swarm optimization algorithm, the optimal solution is obtained through the limited times of iteration, and the optimal elevator dispatching scheme is determined; and the elevator dispatching scheme is converted into a control signal, elevator calling signals are reasonably distributed for all elevators, operation of all the elevators is coordinated, and therefore optimized scheduling of the elevator cluster is achieved. Because the update strategy of the global extremum is improved in the scheduling algorithm, optimal particles which are evenly distributed are obtained, the algorithm convergence and the scheduling performance are improved, meanwhile, it is avoided that the danger of collision may happen when lift cars run in the same shaft, and running safety of a whole elevator system and validity of the scheduling algorithm are ensured.
Owner:BOHAI UNIV
Method for synthesizing directional diagrams of linear antenna arrays on basis of wavelet mutation wind drive optimization algorithms
ActiveCN104899374AHigh speedGood precisionSpecial data processing applicationsWind driven optimizationGlobal optimal
The invention discloses a method for synthesizing directional diagrams of linear antenna arrays on the basis of wavelet mutation wind drive optimization algorithms. The method includes steps of building models of the linear antenna arrays and determining comprehensive radiation characteristic requirements and objective functions of the antenna arrays; determining the wind drive optimization algorithms and wavelet mutation operator parameters and setting population sizes, weight values of fitness functions and speeds and position boundaries of air particles; randomly generating initial speeds and positions of the air particles, substituting the positions of the air particles into the fitness functions, sorting fitness values according to ascending order, updating population sequences and determining the global optimal positions and the local optimal positions; updating the speeds and the positions of the air particles; selectively carrying out wavelet mutation on the positions of the air particles according to mutation probability; computing fitness values of the air particles at novel positions, sorting the fitness values according to ascending order again, updating the population sequences and updating the global optimal positions and the local optimal positions until the maximum number of iterations are carried out. The method has the advantages of high solving precision and convergence speed.
Owner:JIANGSU UNIV OF SCI & TECH
Particle swarm optimization user request dispatching method facing multi-type service
The invention discloses a particle swarm optimization user request dispatching method facing multi-type service. The method comprises the following steps of: 1, initializing parameters, population size and particle construction of a particle swarm optimization algorithm, and calculating computer resource consumed by each service type and loads of server nodes in a cluster; 2, updating the allocation weight of each node of the server cluster, and calculating a fitness function of the cluster; and 3, combined with the set particle swarm parameters, updating the velocity and position of each particle in the particle swarm so as to enable the particles to approach a globally optimal solution. According to the invention, the priority of each server is determined based on the priority of user requests and the resource leisure rate of each server, then the received user requests are dispatched initially according to the priority of the servers, the priority is changed dynamically in real time according to the load state of each server, the load result is optimized by adopting a particle swarm thought, and the particle swarm algorithm is avoided to fall into a locally optimal solution.
Owner:CIVIL AVIATION UNIV OF CHINA
Method for optimizing project duration of engineering project based on potential anti-key working procedures
InactiveCN104820872AReduce the number of variablesSimplify the solution processForecastingResourcesMutation operatorStart time
The invention discloses a method for optimizing the project duration of an engineering project based on potential anti-key working procedures in the technical field of engineering project duration control technologies. The method comprises the following steps: identifying potential anti-key working procedures in an engineering project based on certain technical characteristics; dividing all working procedures of the project into a potential anti-key working procedure set X and a non-potential anti-key working procedure set Y; coding the execution modes of all the working procedures in the potential anti-key working procedure set X to generate an initial group of which the size is NP, and adopting a mode of fastest execution for all the working procedures in the non-potential anti-key working procedure set Y; calculating the total duration value corresponding to each single body in the group and converting the reciprocal of the total duration value into the adaptation value of the single body; adjusting the start time of non-key working procedures; selecting a parent, and producing a child by a single-point crossover operator and a single-point mutation operator; combining the parent and the child to form a new group; and if the maximum genetic algebra is obtained, stopping calculation and outputting an optimal solution, thus obtaining the optimal duration scheme of the project.
Owner:NORTH CHINA ELECTRIC POWER UNIV (BAODING)
Construction method of test case constraint control technology based on epigenetics
ActiveUS20190087313A1Improve software qualityExpand coverageSoftware testing/debuggingGenetic algorithmsSoftware failureEpigenetics
A construction method of a test case constraint control technology based on epigenetics includes steps of: 1: defining a fitness function, a genetic coding method, and a constraint control rule; 2: initializing parameters: setting a population size, an evolution number, and a termination fitness function value; 3: initializing a population: randomly generating an initial population; 4: performing evolution termination judgment; 5. performing constraint regulation based on the epigenetics: performing constraint methylation and constraint acetylation according to the constraint control rule; 6: selecting individuals; 7: completing epigenetic evolution of the population; and 8: outputting a test case set; wherein through the above steps, construction of an epigenetic test case constraint control technology is completed, so as to design test cases that are more in line with the actual operation conditions of the software, find more potential software failures, and improve the quality of software testing.
Owner:BEIHANG UNIV
Cognitive radio method based on improved genetic algorithm
InactiveCN102523585AGuaranteed convergenceDiversity guaranteedGenetic modelsTransmission monitoringAlgorithmPopulation size
The invention discloses a cognitive radio method based on an improved genetic algorithm in the technical field of radio communication. The cognitive radio method comprises the steps of: setting initial parameters of cognitive radio and using the initial parameters as chromosomes of the genetic algorithm; setting initial mutation probability, population size and maximum evolutional generations, and setting target functions which reflect current link quality and the weight of each target function; calculating a population fitness value; conducting scale transformation of the fitness value; selecting the chromosomes; using self-adaptive crossover probability and mutation probability to conduct two-point crossover and individual mutation on the chromosomes; judging whether a condition of convergence is reached or not, and if not, returning to calculate the population fitness value; and if so, outputting a result set and using the results as the parameters of the cognitive radio. The cognitive radio method solves the problem that the final solution set is apt to be converged into a locally optimal solution in the genetic algorithm, and guarantees the diversity of populations and the convergence of the genetic algorithm at the same time.
Owner:BEIJING JIAOTONG UNIV
Image enhancement method based on adaptive immunity genetic algorithm
InactiveCN104123706AIncrease contrastEnhance detailsImage enhancementGenetic modelsPattern recognitionVaccination
The invention discloses an image enhancement method based on an adaptive immunity genetic algorithm. The image enhancement method based on the adaptive immunity genetic algorithm includes steps that S1, normalizing an image pixel gray level f(x, y) to obtain n(x, y); S2, coding parameters (alpha, beta) to be optimized, randomly generating a group of initial individuals to form an initial population, and inputting a control parameter crossover probability p<c>, a mutation probability p<m>, a population size N, a maximum running algebra G and the like; S3, judging whether an evolution algebra t is equal to G, if so, ending the algorithm, and outputting the optimal solution of (alpha, beta), otherwise, turning to the next step; S4, using a roulette strategy to select M individuals, and carrying out crossover and mutation operations on the individuals according to crossover and mutation methods in genetic operation; S5, selecting two vaccines, the individuals to be vaccinated and a vaccination point number to perform immunization, making a immunization choice after the vaccination, and using the optimal individual retention strategy for the vaccinated population; S6, obtaining the corresponding nonlinear transformation function F(u) of each group of (alpha, beta), and using the nonlinear transformation function to perform an image gray level transformation to obtain an output image g(x, y).
Owner:XUZHOU UNIV OF TECH
Variable step size constellation orbit optimization method and device based on genetic algorithm
ActiveCN109635332AImprove optimization time precisionReduce optimization timeGeometric CADMulti-objective optimisationAlgorithmImage resolution
The invention discloses a variable step size constellation orbit optimization method and device based on a genetic algorithm. The method comprises: the orbital plane number of a target satellite constellation and the satellite number of each orbital plane are set; initializing to obtain a genetic algorithm population according to the number of orbital planes and the number of satellites, and setting preset parameters of a genetic algorithm; wherein the preset parameters of the genetic algorithm comprise population size, crossover rate, variation rate and maximum genetic algebra; calculating toobtain the time resolution of the satellite constellation by adopting a variable step size strategy, and taking the time resolution as a fitness function; according to the fitness function, the crossover rate and the variation rate, performing crossover and variation processing on a part of individuals randomly selected from the genetic algorithm population; and under the condition that selection, crossover and mutation operations are determined to be completed according to the maximum genetic algebra, obtaining the individual with the highest fitness value in the new generation of population, and decoding to obtain the constellation configuration. According to the invention, the time precision of constellation orbit optimization can be improved, the optimization time is reduced, and thecoverage of better time resolution is realized.
Owner:BEIHANG UNIV
Apparatus and method for probabilistic population size and overlap determination, remote processing of private data and probabilistic population size and overlap determination for three or more data sets
The invention determines the population size and population overlap in data containing records on the unique entities without unique identifiers for the unique entities and having at least one common type of information with a known distribution of finite expectation by decomposing probabilistic calculations. The computer determines population overlap of unique entities between the data sets by subtracting a probabilistic incremental number of unique entities needed for a larger total number of values of the information with the known distribution from the data sets. The invention can also maintain the security of private data by allowing a remote computer where the original data is stored to download diagnostic and aggregation procedures from another computer over a network. The remote computer performs the functions on the data and forwards the results to the estimate processor computer over the network. The estimate processor determines population size and overlap from aggregate results and forwards this information back to the remote computer over the network. The invention also determines the overlap of three or more data sets by concatenating all combinations of the data sets and determining estimates for all subsets of the combinations of the data sets. The operations involve the cancellation of equivalent terms that have opposite signs.
Owner:THE BRISTOL OBSERVATORY
Modeling method for catalytic cracking main fractionator with varying-population-size DNA genetic algorithm
InactiveCN102663235AHigh precisionGenetic modelsSpecial data processing applicationsSupport vector machineMean square
The invention discloses a modeling method for a catalytic cracking main fractionator with a varying-population-size DNA genetic algorithm, comprising the following steps: 1) that input and output data of the catalytic cracking main fractionator are collected as modeling data through on-site operation or experimental sampling; 2) that the modeling data are used to train a support vector machine, and a mean square deviation collected by cross validation is taken as an objective function; 3) that operational parameters of the DNA genetic algorithm are set; and 4) that the varying-population-size DNA genetic algorithm is operated to optimize the parameters of the support machine, wherein collected optimization parameters of the support vector machine are used for training the support vector machine and further collecting a nonparametric model of the catalytic cracking main fractionator. The method of the invention combines the varying-population-size DNA genetic algorithm with the support vector machine, and at the same time introduces a mutation operator enlightened by flora drug resistance into the nonparametric modeling of the catalytic cracking main fractionator, thereby effectively increasing modeling precision of the support vector machine.
Owner:ZHEJIANG UNIV
Local enhancement differential evolution protein conformational space searching method
ActiveCN104933327AFast convergenceImprove forecast accuracySpecial data processing applicationsRate of convergenceSystem parameters
The invention discloses a local enhancement differential evolution protein conformational space searching method. The method comprises the following steps: giving an input sequence, and setting system parameters including a population size, the number of iterations, a crossed factor and a fragment length; performing complete fragment assembly on each individual in a population to generate an initial population; updating the population by executing variation, crossover and selection operation on each individual in the initial population in sequence to obtain an updated population; performing local enhancement on each individual in the updated population by calling a Monte Carlo method, and receiving enhanced individuals according to a set Boltzmann receiving probability to obtain an enhanced population; and iteratively running the above steps to reach an end condition. Through adoption of the local enhancement differential evolution protein conformational space searching method, the conformational space searching dimensions are effectively reduced; the convergence speed of an algorithm is increased; the prediction accuracy is effectively increased; and a conformational space can be sampled more effectively.
Owner:ZHEJIANG UNIV OF TECH
Audience Size Estimation and Complex Segment Logic
Selection of a trait may be received. A complex segment rule may be created that is usable to evaluate one or more qualification events. For example, the segment rule may be usable to evaluate a combined recency and frequency of the one or more qualification events. The qualification events may be based on collected network data associated with the plurality of visitors with each qualification event corresponding to a separate qualification of visitor according to the trait. The qualification events may be evaluated together according to the segment rule. For example, the combined recency and frequency of the one or more qualification events may be evaluated according to the segment rule. Evaluating the segment rule may include estimating a segment population size in real-time.
Owner:ADOBE SYST INC
Population size counting method of double cameras
The invention discloses a population size counting method of double cameras. The counting method comprises the steps as follows: setting a target camera A and an assistant camera B in a monitoring scene and respectively calculating characteristics of crowd block data sets in video frames of two cameras; using a transfer learning algorithm to extract sample data adjacent to the characteristic of a target population data set from an assistant population data set as a migration population data set; combining the migration population data set and the target population data set as a new population data set; fusing pixel feature and textural feature of the population data set according to a difference value between a predicated population number and real population in shaded population block in the new population data set; training a population size statistic model according to a fusion feature; using the trained population size statistic model to predict the population of newly input population image. The population size counting method of the invention solves the problem of a large number of population data scaling, unbalanced population data distribution and data missing via transfer learning, and gives full play of characteristic of different type features via feature fusion, thereby improving accuracy of the population size statistic model.
Owner:XIAN UNIV OF TECH
Who we serve
- R&D Engineer
- R&D Manager
- IP Professional
Why Patsnap Eureka
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com