82 results about "Previous generation" patented technology

A process for making molds for retroreflective sheeting and like articles includes making a substrate having a structured surface of geometric structures such as cube corner elements. The structured surface is in one embodiment partially replicated from a previous generation structured surface, and partially machined in the substrate. At least one of the faces of the structured surface is a compound face that has one machined portion and one non-machined portion, such as a replicated portion. The process can be used to manufacture substrates with desirable geometry cube corner elements, such as cube corner elements having a hexagonal outline in plan view, without requiring the use of pin bundling techniques or laminae. The process can also be used to manufacture articles having cube corner elements in which at least one face of the cube corner element has two constituent faces disposed on opposed sides of a transition line that is nonparallel to a nondihedral edge of such cube corner element.

The invention discloses a multi-objective optimization method based on an improved gravitation search algorithm. According to the algorithm, a memory strategy is introduced into a universal gravitation search algorithm, so that particle swarm information and information of previous generations and next generations of particles are shared, the global search capability and the local search capability of the particles are balanced, and the premature convergence problem is solved. On this basis, a diversity enhancement mechanism is introduced into the algorithm, namely, particle speed and position are controlled each iteration, so that the diversity loss is relieved, the particle diversity is improved, and diversity and distributivity of non-dominated solution sets are enhanced. Therefore, by means of the multi-objective optimization method based on the improved gravitation search algorithm, the phenomenon that multi-objective optimization is caught in a local extremum can be effectively avoided, and convergence, diversity and distributivity of non-dominated solutions are remarkably improved when the gravitation search algorithm is applied to the field of multi-objective optimization.

The invention discloses an intelligent optimization-based camera calibration method, which comprises the following steps of: obtaining pixel coordinates of feature points of an image by adopting a harris sub-pixel angular point extraction method; calculating the initial values of internal and external parameters according to the pixel coordinates of the image and corresponding coordinates in the world coordinate system; initializing a particle swarm, randomly generating d particles evenly distributed around the initial values, and forming an i*d dimensional particle swarm matrix; taking an initial particle swarm as a current-generation optimal local matrix, calculating the fitness functions of particles of the initial particle swarm, and selecting and taking a particle with the minimal fitness value as the optimal particle; and renewing the particle swarm, calculating the fitness values of the new particle swarm, comparing and replacing with the previous-generation optimal local matrix, obtaining a new-generation optimal local matrix, then, obtaining a new optimal particle, and meanwhile, calculating and renewing the values of external parameters (R and T). The intelligent optimization-based camera calibration method has the advantages that: a quantum particle swarm intelligent optimization algorithm is introduced into camera calibration; and the accuracy is higher, the calculation of the initial values is simple, and the convergence rate is fast.

The invention discloses an ant colony algorithm optimization method based on searching concentration degree and dynamic pheromone update, belonging to the artificial intelligence field. Compared withthe classical ant colony algorithm, this method has the following improvements: (1) according to the path found by the previous generation of ant colony, the search concentration factor is introducedinto the selection strategy, which can adjust the range of ant selection node adaptively; (2) In the global pheromone updating phase, the search time is shortened by changing the pheromone increment dynamically; (3) the pheromone rollback mechanism is used to jump out of the local extremum when the optimal solution is not improved after many iterations. Through the above improvements, the invention obviously improves the global searching ability and the running efficiency compared with the basic ant colony algorithm.

The present invention relates to a kind of LSSVM annual power consumption prediction method based on antlion optimization, the annual power consumption prediction method comprises the following steps: determine the input variable of least square support vector machine (Least Square Support Vector Machines, LSSVM) prediction model; Initialize the antlion optimization algorithm; calculate the fitness value of the initial antlion to obtain the initial elite antlion; update the position of the ant, calculate the fitness value of the current antlion, and compare it with the fitness value of the corresponding antlion to determine whether to update the antlion Lion position; compare the fitness value of the antlion after the updated position with the fitness value of the previous elite antlion one by one, keep the antlion corresponding to the smaller fitness value, and obtain the elite antlion of this iteration; judge whether The maximum number of iterations is reached, if yes, then output the location of the elite antlion and the corresponding predicted value of annual electricity consumption, if no, continue to iterate. Compared with the prior art, the present invention has the advantages of higher prediction accuracy and higher prediction efficiency.

The invention discloses a mycoplasma bovis attenuated strain and application thereof. The mycoplasma bovis attenuated strain is prepared by the following steps: A. a mycoplasma bovis virulent strain is separated and determined: by pathogeny separation culture and PCR (Polymerase Chain Reaction) detection, the pathogeny is determined to be mycoplasma bovis; B. the mycoplasma bovis virulent strain is cultured: the mycoplasma bovis which is obtained by separation is inoculated with a liquid drug culture medium, and is then cultured in an incubator, wherein the culture medium becomes bright yellow from red, and the previous generation of bacterium liquid of 1mul is taken for inoculating PPLO (pleuropneumonia-like organism) culture medium and culturing; C. the full attenuation of mycoplasma bovis can be shown by the experiments, and by the detection of morphology, and the generation 150 of strain Mbov HB0801-150.2 cultured by mycoplasma bovis Mbov HB0801 can be verified by the experiment result; and D. the preservation number of the mycoplasma bovis Mbov HB0801-150.2 is CCTCC M20111102. The invention has good vaccine development prospective, wide clinic application value, low cost and small irritant to animals, and can produce huge economic benefits and social benefits.

The aim of the present invention is to provide a security module capable of supporting the different functions of the latest and the previous generations, by avoiding any possible attack due to this adaptability.

This aim is attained by a security module comprising first communication means to a host device, first storage means (MEM0) and first decryption means (ENC0), characterized in that it includes a state module (SM) and second communication means (COM1) and physical activation or deactivation means (TSB) of said second means, such activation or deactivation being managed by the state module (SM).

Provided are techniques for a garbage-collected interned string table. Reference objects that each reference strings in the interned string table are created. The reference objects and the strings referenced by the reference objects in the interned string table are marked with a current generation. Garbage collection is performed by: advancing the current generation to a next generation; in response to the reference objects in a previous generation from the current generation advancing to an acquired references state, promoting the reference objects and the strings referenced by the reference objects in the previous generation to the current generation; and deleting the strings that are marked with the previous generation in the interned string table.

An adapter for utilizing a handgun slide manufactured for use on a common generation and version of handgun frame to make its use capable on a newer generation or versions frame having different dimensional features. The adapter makes allows use of a slide assembly comprising of a slide, barrel, recoil spring and guide from previous generations on more recent generations of the same handgun. The adapter is mounted on the previous versions dust cover creating a new geometry to allow for proper function inside the newer generation's frame. The adapter includes a bushing. The earlier generation's slides have an outer surface shape smaller than the newer generation slide with the adapter creating the geometry necessary for compatibility.

The invention discloses a breeding method capable of improving the egg yield of muscovy ducks. The breeding method comprises the following steps of early-stage primary election, wherein a high-qualitypopulation are selected in young ducks according to the body-size healthy and strong degree in proportion; first-time egg laying selection, wherein according to the whole-period egg production numberof the previous generation and family information, the breeding values of individuals in the current generation are calculated, and high-egg-yield and high-breeding-value male and female ducks are selected and remain in proportion; egg production determination, wherein when the female ducks start laying, the number of the qualified eggs laid by each female duck individual is recorded; second-timeegg laying selection, wherein according to the egg yield of the female ducks in the current generation and the genealogy information, high-egg-yield and high-breeding-value male ducks and female ducks are selected and remain in proportion; family building, a full-sib family is built by the male ducks and the female ducks in proportion, the next generation is bred, and the above steps are repeated. The breeding method has the advantages that the contradictions between subculture and egg laying selection are well solved, genetic contributions on the egg yield in the later egg laying period aretaken into account, the breeding efficiency is improved, and improvement of economic benefits is facilitated.

The invention provides a quantum chemistry reaction optimization multi-relay selection method of a cognitive relay network. The method comprises steps of: 1, establishing a cognitive system relay selection model; 2, initializing a quantum molecule set and a system parameter; 3, evaluating the potential energy of all quantum molecules in the set and selecting the measurement state of the quantum molecule with the lowest potential energy as a global optimal solution; 4, arranging the kinetic energy of quantum molecules in a descending order, and performing decomposition reaction, invalid collision, and synthetic reaction; 5, evaluating the potential energy of newly generated quantum molecules, and if the minimum potential energy of the newly generated quantum molecules is less than the minimum potential energy of the previous generation, marking the newly generated quantum molecules as a new global optimal solution; and 6, if the number of iteration times is less than a preset maximum number of iteration times, returning to step 4, otherwise, outputting the global optimal solution. The method balances the primary user constraint condition and non-primary user constraint condition of the cognitive relay network, and chooses a relay selection scheme that maximizes the system throughput based on a quantum chemistry reaction mechanism.

Embodiments of the present invention provide a seamless way to emulate legacy graphics processing on modern graphics hardware. In particular, in some embodiments, the present invention provides a way for modern GPUs to emulate the bitwise operations and rendering processes of previous generations of graphics hardware. The present invention utilizes a novel pixel shader program. The pixel shader program provides a texture lookup functionality that compensates for any missing bitwise functionality. When a bitwise operation is requested, the system will copy out the destination area to a temporary image. This temporary image is fed to the pixel shader program along with a precomputed texture. The texture is precomputed by the CPU for the various bitwise operations and acts as a lookup table for the requested operation. With the temporary image and precomputed texture, the shader program on the GPU can then emulate the legacy graphics operations seamlessly. Accordingly, all temporaries, and the emulation of the bitwise operations themselves are done using the three dimensional engine of the GPU.

The invention belongs to the field of power system analysis and computing and discloses a method for solving a node impedance matrix of an electric system on the basis of a Gaussian elimination method of a sparse symmetric matrix technology. The method mainly comprises the following steps that a node admittance matrix Y is formed; the matrix Y and a matrix En form an augmented matrix Bn=[YEn]; elimination is carried out on the matrix Bn according to the spare symmetry to obtain Bn(n-1)'=[Y(n-1)'En(n-1)']; according to Y(n-1)'Zn=En(n-1)', sparseness and symmetry, elements above and on the left of a diagonal element Znn of a matrix Zn are solved; a matrix Y(k-1)' is obtained according to the Y(n-1)'; elements above and on the left of a diagonal element Zkk of the matrix Zk are obtained according to Y(k-1)'Zk=Ek(k-1)', sparseness and symmetry. By the utilization of the symmetric sparseness, all invalid computation of the previous generation process is avoided, and computation of about 50% of nonzero elements is reduced; by the utilization of the characteristics of the E matrix element structure and the sparseness of upper triangle elements, the elements of the matrix Zk are obtained in a back substitution mode according to a symmetry mode, and back substitution computation is greatly accelerated. The method can check IEEE-30, -57 and -118 node systems and the like, and the computation speed for the IEEE-118 node system can be improved by 96-97% compared with a traditional Gaussian elimination method and an LDU triangular decomposition method.

The invention brings forward a method for backing up and learning knowledge learned by a robot, wherein the method is applied to a robot learning system. The robot learning system is composed of a robot, a next-generation robot, and a cloud end server; microprocessor chips or and storage chips are arranged inside the robot and the next-generation robot; and the robot and the next-generation robot carry out communication with the cloud end server by a network. The method comprises the following steps that: the robot stores the learned knowledge to the internal microprocessor chip or storage chip; the robot is connected with the network and uploads the learned knowledge to the cloud end server after identity authentication; and when another previous-generation robot or the next-generation robot is connected to the network, the learned knowledge stored by the cloud end server is downloaded to the microprocessor chip or and storage chip of the another previous-generation robot or the next-generation robot after successful verification. The implemented method has the following beneficial effects: the usage and operation flows become simple; and time is saved.

The invention discloses a differential evolution algorithm with a variable crossover probability factor, comprising the following steps: (1) population initialization; (2) mutation operation; (3) crossover operation; (4) selection operator; (5) termination of iteration . The beneficial effects of the present invention are: the present invention proposes a differential evolution algorithm with a variable crossover probability factor, in the crossover link, according to the size of the fitness value of different individuals in the previous generation, different individuals are given different crossover probability factor values; embodiment It shows that, compared with the traditional DE algorithm, when using this algorithm for numerical optimization, the number of iterations required is significantly reduced, the optimal value we expect can be searched faster, and the calculation time and memory consumption are effectively reduced.

The present invention, among other things, provides technologies for detecting and/or quantifying nucleic acids in cells, tissues, organs or organisms. Pre-designed barcodes are associated specific molecular targets through sequential hybridization experiments. A pseudo color based barcoding scheme is developed to overcome limitations in the previous generation of the technology such as lack of visual signals that can be associated with the probes or small internal within cell when carrying out in situ experiments.. The current method can be applied to both in vitro and in situ analysis. According to the method, each barcoding round comprises multiple serial hybridizations where a small number of colored signals (that are associated with probes) are used in each hybridization experiment within a serial hybridization round. Images from each serial hybridization experiment within the same serial hybridization round are combined to form a composite image for each barcoding round. In eachbarcoding round, the same set of molecular targets are analyzed. After all barcoding rounds are completed, associated of the barcode with these molecular targets is completed.

The invention provides a power system sparse matrix solving method and system based on DAG and matrix rearrangement. The method comprises the following steps: acquiring a sparse matrix corresponding to a correction equation in an iterative solving process of an equation group describing a transmission network state or a device operation condition; generating a directed acyclic graph DAG containingall dependency relation information based on the sparse matrix, and layering the DAG; performing matrix rearrangement on the L matrix of the sparse matrix, the U matrix of the sparse matrix, the vector to be solved corresponding to the sparse matrix and the result vector corresponding to the sparse matrix according to the DAG layering result; after the matrix is rearranged, solving the sparse matrix by previous generation. Multiple methods are used to adjust the number of nodes in the same layer, so that memory access of the same layer can be continuously carried out through matrix rearrangement, which improves the efficiency of parallel generation calculation, and effectively improves the parallelism and operation speed of sparse generation calculation on parallel processors.

The invention provides a calibration method of a camera. The method comprises the following steps: S1. calibrating and acquiring a one-dimensional coordinate and a two-dimensional coordinate of each vertex of an image for the shoot image; S2. setting differential evolution parameters and initializing the population; S3. updating the current population individuals and acquiring a new population; S4. calculating the fitness of the individuals of the new population according to the one-dimensional coordinate and the two-dimensional coordinate; S5. calculating the current generation optimal position of the new population according to the fitness; S6. adding 1 for the non-updated times num of the optimal position if the difference value between the optimal position of the current generation and the optimal position of the previous generation is less than the threshold; S7. selecting randomly the individuals with the individual serial number 1 to m/5 in an individual space which distributes randomly again; S8. executing the step S3 to S7 repeatedly if the differential evolution generations do not reach the maximal evolution generations, or taking the camera parameters corresponding to the current optimal position which reaches the optimal evolution generations as a calibration result of the camera. Through the method provided by the invention, the system error can be reduced, the stability is good, and the anti-interference capability is high.

The invention discloses a power distribution network feeder automation terminal configuration method based on multiple intelligent algorithms. The power distribution network feeder automation terminalconfiguration method comprises the following steps: (1) inputting data required by power distribution network feeder automation terminal configuration; (2) randomly generating a plurality of feeder automation terminal configuration schemes to form an original population; (3) calculating the fitness of each individual in the population; (4) selecting an individual with the minimum objective function value in the current population, and updating a historical optimal solution; (5) judging whether a set number of iterations is reached or not, if yes, outputting a current historical optimal solution, and ending optimization; if not, executing the step (6); and (6) performing operation according to the optimization rules of different intelligent algorithms, and generating a new population on the basis of the previous generation of population. And then skipping to the step (3). The power distribution network feeder automation terminal configuration method can provide a more scientific and reasonable power distribution network feeder automation terminal configuration scheme, and can avoid the situations of feeder automation terminal configuration redundancy, investment waste and the likeon the premise of ensuring that the power supply reliability reaches the standard.

A system and method for uniquely identifying seismic data sets, wherein the system and method associate a unique seismic data set identifier with a seismic data set, wherein the unique seismic data set identifier identifies the seismic data set by being different from all other unique seismic data set identifiers associated with other seismic data sets. The unique seismic data set identifier for the seismic data set is published within a directory, thus allowing the seismic data set to be found within a computer system or network of systems by the unique seismic data set identifier that is associated with the seismic data set.

The invention discloses an improved clamping mechanism of a fatigue testing machine for in-situ imaging of a synchronous radiation light source, which is arranged on a platform cylindrical base of the synchronous radiation light source. The improved clamping mechanism comprises a sample clamping unit and a plastic deformation additional adjusting unit, wherein the sample clamping unit is vertically arranged along the axle wire of the base of the fatigue testing machine and is divided into two parts of a lower clamping head section and an upper clamping head section, and the upper clamping head section is provided with the plastic deformation additional adjusting unit. Compared with a fatigue testing machine in the previous generation, the improved clamping mechanism of the fatigue testing machine for the in-situ imaging of the synchronous radiation light source, disclosed by the invention, is further improved, and the properties of buffer vibration attenuation and noise reduction of a system are increased; on the premise that load is fully enabled to be applied to a sample, the integral bearing performance of the fatigue testing machine is ensured; the plastic deformation additional adjusting unit can be used for adjusting the size of an applied force after plastic deformation of the sample happens in compaison with the fatigue testing machine in the previous generation, detailed problems in a test implementing process are more detailedly considered.