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

90 results about "Logistic function" patented technology

A logistic function or logistic curve is a common "S" shape (sigmoid curve), with equation: f(x)=L/(1+e⁻ᵏ⁽ˣ⁻ˣ₀⁾) where e = the natural logarithm base (also known as Euler's number), x₀ = the x-value of the sigmoid's midpoint, L = the curve's maximum value, and k = the logistic growth rate or steepness of the curve. For values of x in the domain of real numbers from −∞ to +∞, the S-curve shown on the right is obtained, with the graph of f approaching L as x approaches +∞ and approaching zero as x approaches −∞.

Pedestrian identification method under road traffic environment based on improved YOLOv3.

InactiveCN109325418AVerify the recognition effectSolve the problem of difficult and slow target detectionBiometric pattern recognitionCluster algorithmRoad traffic
The invention discloses a pedestrian identification method under a road traffic environment based on improved YOLOv3. The method comprises the following steps of: S1, acquiring and pre-processing an image, and making a pedestrian sample set; 2, calculating the length-width ratio of the pedestrian candidate frames by using a clustering algorithm and the training set; 3, inputting the training set into the YOLOv3 network for multi-task training and saving the trained weight file; S4, inputting a picture to be recognized into the YOLOv3 network to obtain a multi-scale characteristic map; S5, using a logistic function to activate the x, y, confidence degree and category probability of the network prediction, and obtaining the coordinates, confidence degree and category probability of all prediction frames by judging the threshold value; S6, generating a final target detection frame and a recognition result by carrying out the non-maximum value suppression processing on the above result. The method of the invention solves the problem of low detection accuracy of the prior method, realizes the multi-task training, does not need additional storage space, and is high in detection accuracyand fast in speed.
Owner:SOUTH CHINA UNIV OF TECH

Method and system for building binary decision diagrams efficiently in a structural network representation of a digital circuit

A method, system and computer program product for building decision diagrams efficiently in a structural network representation of a digital circuit using a dynamic resource constrained and interleaved depth-first-search and modified breadth-first-search schedule is disclosed. The method includes setting a first size limit for a first set of one or more m-ary decision representations describing a logic function and setting a second size limit for a second set of one or more m-ary decision representations describing a logic function. The first set of m-ary decision representations of the logic function is then built with one of the set of a depth-first technique or a breadth-first technique until the first size limit is reached, and a second set of m-ary decision representations of the logic function is built with the other technique until the second size limit is reached. In response to determining that a union of first set and the second set of m-ary decision representations do not describe the logic function, the first and second size limits are increased, and the steps of building the first and second set are repeated. In response to determining that the union of the first set of m-ary decision representations and the second set of m-ary decision representations describe the logic function, the union is reported.
Owner:GLOBALFOUNDRIES US INC

Network logistics

Network logistics and network business are mutually integrated. In order to realize the sharing of logistics information and logistics functions among logistics enterprises, industrial and commercialenterprises and logistics supervision government departments, the network logistics has to be interconnected, intercommunicated and interoperated with network government affairs. The problem of logistics information comprehensive integration among logistics enterprises, industrial and commercial enterprises, financial institutions and government supervision departments in logistics can be effectively solved by means of the government affairs. Network logistics systems are closely related to the network business, the network government affairs, network intelligent traffic systems and the like.The network logistics is based on the network business, the network government affairs, the network intelligent traffic systems and the like. A plurality of identification facilities and a general purpose calculator are mutually connected in a short distance through transmission media according to physical topological structures of a local area network (in a star shape, a ring shape, a tree shapeor a bus shape and the like) to form a logistics network unit. Each identification facility is fixedly distributed in a monitoring area and respectively takes an identification task of cargoes and thelike of the monitoring area in the logistics system.
Owner:刘文祥

Urban trunk road travel time estimation method based on variable weight mixed distribution

The invention discloses an urban trunk road travel time estimation method based on variable weight mixed distribution, and belongs to the technical field of intelligent traffic. The method comprises the steps: collecting a trunk road travel time parameter of a trunk road in a target research region, preprocessing and verifying the distribution mode of the trunk road travel time in all time periods, building a Gaussian mixed distribution model with a fixed weight, and determining an optimal component number K; collecting the flow in all flowing direction and a signal control parameter for an intersection and an road segment, and building a mixed distribution weight coefficient Logistic function with K components; building a variable weight mixed distribution model, estimating an unknown parameter in the variable weight mixed distribution model, and finally carrying out the estimation of trunk road travel time distribution and the estimation of reliability service level. Compared with a conventional single-distribution-function and fixed weight mixed distribution model, the method irons out the defects that the transplantability and the adaptability are poor, and can achieve the more accurate estimation and reliability evaluation of the trunk road travel time distribution.
Owner:BEIHANG UNIV

Image duel scrambling method based on three-dimensional Logistic mapping

An image duel scrambling method based on three-dimensional Logistic mapping belongs to the field of digital image processing. The image positive scrambling process comprises the steps that firstly an IMAGE to be scrambled with the size of M*N is obtained, 5*M*N three-dimensional Logistic mapping function values are respectively obtained according to a three-dimensional Logistic mapping formula, the Logistic function values of last M first dimensions, last N second dimensions, and last M*N third dimensions of the 5*M*N three-dimensional Logistic mapping function values are obtained and sorted in an ascending mode respectively, and position sequences of an index 1, an index 2 and an index 3 are obtained; pixel position scrambling is conducted on the IMAGE by utilizing the sequences of the index 1 and the index 2, and an Image is obtained and converted into a single-dimensional image; an xor operation is conducted on the image and a result obtained through a reminder operation of the index 3 and 255, an image pixel value is changed to obtain an image fig, and the size of the fig is converted into the size of the IMAGE to obtain an image FIG which is a scrambling image. According to the image duel scrambling method based on three-dimensional Logistic mapping, the function value sequences of the three-dimensional Logistic mapping are utilized to respectively change the pixel position and the pixel value of the scrambling image, dual scrambling to the image is achieved, and the image duel scrambling method has the advantages of being high in generality and good in safety.
Owner:LIAONING UNIVERSITY

BESO topological optimization method based on dynamic evolution rate and adaptive grid and application of BESO topological optimization method

The invention discloses a BESO topological optimization method based on a dynamic evolution rate and an adaptive grid and application thereof, and the method comprises the steps: building a finite element model for a to-be-topologically optimized basic structure, and defining a design domain, a load, a boundary condition and a grid size; determining a constraint value and BESO necessary parameters; performing finite element analysis on the structure after mesh division, and calculating unit sensitivity under a target function and a constraint condition; filtering the unit sensitivity and updating the constrained Lagrange multiplier, and constructing the sensitivity of a Lagrange function; determining an evolution rate of the current iterative step based on a dynamic evolution rate functionof a Logistic function according to the volume rate of the current iterative step; and updating a design variable according to a set constraint function, judging whether constraint conditions and convergence conditions are met or not, if not, performing grid adaptive updating, then performing unit updating, and stopping iteration until the constraint conditions and the convergence conditions aremet. According to the invention, the calculation amount of single finite element analysis and the number of iterations required by topological optimization are effectively reduced while high calculation precision is ensured, so that the total calculation time consumption of topological optimization is greatly reduced.
Owner:GUANGZHOU UNIVERSITY

Method and system for building binary decision diagrams efficiently in a structural network representation of a digital circuit

A method, system and computer program product for building decision diagrams efficiently in a structural network representation of a digital circuit using a dynamic resource constrained and interleaved depth-first-search and modified breadth-first-search schedule is disclosed. The method includes setting a first size limit for a first set of one or more m-ary decision representations describing a logic function and setting a second size limit for a second set of one or more m-ary decision representations describing a logic function. The first set of m-ary decision representations of the logic function is then built with one of the set of a depth-first technique or a breadth-first technique until the first size limit is reached, and a second set of m-ary decision representations of the logic function is built with the other technique until the second size limit is reached. In response to determining that a union of first set and the second set of m-ary decision representations do not describe the logic function, the first and second size limits are increased, and the steps of building the first and second set are repeated. In response to determining that the union of the first set of m-ary decision representations and the second set of m-ary decision representations describe the logic function, the union is reported.
Owner:GLOBALFOUNDRIES U S INC

Contact network failure risk assessment method based on binary decision graph algorithm

The invention discloses a contact network failure risk assessment method based on a binary decision graph algorithm, comprising the steps of: (1) generating a BDD structure, determining system boundaries, basic events and top events, establishing and normalizing a fault tree, and generating a BDD structure, wherein the corresponding BDD nodes may be directly created by ITE operations for basic events; and ITE operations may be performed on basic events or other intermediate events to obtain the BDD structure of the original intermediate event for intermediate events; (2) calculating the accident rate of the contact network failure risk, generating a Boolean logic expression by the fault tree, and generating a Boolean logic function corresponding to the fault tree top event, wherein when the true value is obtained, the probability of occurrence of the top event or any intermediate event may be obtained; and (3) measuring the event importance. The invention applies the BDD method to thefailure risk assessment of the contact network, which simplifies the calculation process, and solves the problems such as the combined explosion and the complicated solving process encountered by thecut set method in the contact network failure fault tree analysis.
Owner:CHINA RAILWAYS CORPORATION +1

Abnormal traffic data identification method and device, medium, and electronic equipment

The invention relates to the field of information security, and discloses an abnormal traffic data identification method and device, a medium, and electronic equipment. The method comprises the following steps: for a sample set comprising a plurality of traffic data samples, according to independent variables and corresponding dependent variables of the traffic data samples in the sample set, carrying out fitting through a logistic function to obtain a function which is used to obtain the dependent variables from the independent variables; determining weights corresponding to abnormal trafficidentification indicators based on the function obtained through the fitting; determining the weighted sum of abnormal traffic identification indicator values of a candidate negative traffic data sample based on the weights; and if the weighted sum is larger than a weighted sum threshold, identifying the candidate negative traffic data sample as abnormal traffic data. The method disclosed by the invention has the advantages that different importance degrees of the multiple abnormal traffic identification indicators in an abnormal traffic data identification process are fully considered, so that intrusions can be prevented based on network security, and the abnormal traffic identification accuracy can be improved.
Owner:PING AN TECH (SHENZHEN) CO LTD

ESOP minimization method for logic function

The present invention discloses an ESOP minimization method for a logic function. By converting the optimal coverage searching problem of a 3n global space in the ESOP minimization process of an n variable logic function into the simplest connection problem in a plurality of cube blocks, a search space is reduced, thereby breaking away from a constraint of a variable scale; moreover, a cube set is directly operated without being converted into a minterm set, so that limitation to a product term number is avoided; and in order to achieve accurate minimization of rapid ESOP, a minimized conversion algorithm of a cube EXOR conversion diagram is adopted to improve operation efficiency so as to effectively reduce calculation complexity and a memory occupied quantity, and the characteristics that calculation time is insensitive to the number of input variables and is only related to the number of product terms included by the logic function and intersection can effectively achieve an effect that random n variables totally regulate the ESOP minimization of the logic function. The ESOP minimization method has the advantages of no limitation to the number of the product items and the number of the variables in the logic function and capacity of carrying out minimization processing on an ESOP of a random logic function.
Owner:ZHEJIANG WANLI UNIV

Space load predication method with consideration of cellular development degree

The invention relates to a space load predication method with consideration of a cellular development degree. The method comprises: a power geographic information system (GIS) is established, and integration of land information, a power supply range of a 10-kV feeder line, and classification load data is realized; cellular units are generated in the GIS in the power supply range of the 10-kV feeder line; changing situations of classification load densities are described by using a logistic function, and regular curves corresponding to all classification load density development trends are generated respectively; development degrees of classification load densities in all cellular units in a current year are determined, and thus positions of classification load densities in all cellular units in a current year on the load density development rule curves of the classes are found; and a cellular load value of a target year is predicted, a classification load density index in the cellular unit at the target year is determined by combining the classification load density development rule curves according to the classification load density development degrees in all cellular units at the current year, and then multiplication by areas corresponding to all kinds of loads in the cellular units to realize prediction of cellular load values.
Owner:NORTHEAST DIANLI UNIVERSITY
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