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

54 results about "Negative weight" patented technology

Negative weights, when interpreted as probabilities for constructing a local conditional distribution, are nonphysical. Also, negative weights when applied to high data values may lead to negative and nonphysical estimates. In these situations the negative weights in ordinary kriging must be corrected.

System and method for estimating the geographical location and proximity of network devices and their directly connected neighbors

A method for estimating locations of devices in a network, the method including: identifying each of the devices; inputting an approximate location of at least one of the devices; constructing a constrain for each of the devices, the constrain comprising at least one of a type of connectivity of the device and a technology characteristic related to the device; deriving an optimization criterion on a location for each of the devices, the criterion assigning a positive weight to each constrain that is satisfied by at least one of an estimated location and the approximate location and assigning a negative weight to each constrain that is not satisfied by at least one of the estimated location and the approximate location; calculating a best fit location for each of the devices that maximizes the optimization criterion; presenting the best fit location for each of the devices to a user, the user either accepting or rejecting each best fit location, the user providing additional information for constructing each constrain associated with a rejected best fit location; and iterating at least one of the identifying, the inputting, the constructing, the deriving, the calculating, and the presenting using the additional information until the user accepts each best fit location.
Owner:SAP AG

Dipulse engine with integrated propellent twining structure and preparation method

The invention discloses a dipulse engine with an integrated propellent twining structure and a preparation method. The dipulse engine comprises a combustion chamber shell, a soft interlayer, a first pulse grain assembly, a second pulse grain assembly, an ignition device and a jet pipe, wherein a front opening and a rear opening are formed in the two ends of the combustion chamber shell separately;the soft interlayer comprises a first section and a second section and divides the cavity of the combustion chamber shell into a first cavity, a third cavity and a second cavity; the first cavity isclose to the rear opening; the third cavity and the second cavity are close to the front opening and are formed internally and externally; the first pulse grain assembly comprises a first grain and afirst heat insulation layer; a central groove is formed in the first grain; the second pulse grain assembly comprises a second grain and a second heat insulation layer; the ignition device is arrangedat the front opening, and the top cover body of the ignition device is provided with a second extension part; the two wall surfaces of the second extension part are spliced with the combustion chamber shell and the second heat insulation layer separately; and the jet pipe is arranged at the rear opening. According to the dipulse engine, the second extension part is spliced with the combustion chamber shell and the second heat insulation layer, so that the negative weight is greatly reduced.
Owner:THE GENERAL DESIGNING INST OF HUBEI SPACE TECH ACAD

Semi-supervised extreme learning machine classification method based on graph balance regularization

The invention relates to a semi-supervised extreme learning machine classification method based on graph balance regularization. According to the method, an adjacency graph based on label consistencyand an adjacency graph based on information structure consistency are balanced through a non-negative weight value, so that the graph balance is achieved, a Laplace regular term of an optimal graph can be obtained to constrain a model, it is considered that the weight of the label consistency graph is increased when the information consistency graph cannot well describe the structure information of the sample set, and otherwise, the corresponding proportion needs to be reduced. The method comprises the following steps of firstly, constructing an adjacent supervised graph between the training samples through the label consistency of the samples; and combining with a semi-supervised graph based on the sample information consistency to constrain the output of the model, changing the capability of describing data distribution by reasonably adjusting the proportion of the graph, and obtaining an optimal output weight vector after obtaining an optimal adjacent graph. The method has a wide application prospect in the electroencephalogram signal processing systems and the brain-computer interface systems.
Owner:HANGZHOU DIANZI UNIV

A shortest annular path navigation method for an automated guided vehicle and the guided vehicle

A shortest annular path navigation method for an automated guided vehicle and the automated guided vehicle are disclosed. The method includes generating an adjacent matrix graph including actual formation of a road segment in a workplace according to node coordinate information in the workplace; finding out a shortest one-way annular path required by a task in the adjacent matrix graph; arranginga millimeter-wave radar in the workplace; measuring, by a gyroscope, the velocity, direction and acceleration of the automated guided vehicle and feeding the velocity, direction and acceleration backto a terminal controller in real time; performing calculation, by the terminal controller, according to feedback information from the millimeter-wave radar; and controlling, by an industrial personalcomputer, a drive module to complete position correction. A one-way annular path planning manner is adopted and a Dijkstra algorithm is adopted to achieve shortest path searching between two points ina non-negative weight graph in a shortest path algorithm, and the path planning efficiency of the automated guided vehicle is increased, thus simplifying path planning. In addition, by utilizing real-time correction through the millimeter-wave radar and the gyroscope, that the automated guided vehicle is ready to reach a target position through the shortest path is ensured.
Owner:CHINA JILIANG UNIV

Shortest annular path navigation method for automatic guide transport cart and guide transport cart

The invention discloses a shortest annular path navigation method for an automatic guide transport cart and the transport cart. A shortest one-way annular path required by a mission is found out in anadjacent matrix through a Dijkstra algorithm; the shortest one-way annular path determined in step 2 is input into a centrally-controlling machine, and an industrial personal computer controls a driving module to drive the automatic guide transport cart; a binocular vision sensor and a high-speed image collecting system collect information, and determine the position of the cart in a ground coordinate system; the centrally-controlling machine sends position correcting information to the industrial personal computer according to the actual position and the movement state. By means of the one-way annular path planning method, the Dijkstra algorithm is adopted for achieving the shortest path search between two points in a non-negative-weight map in a shortest path algorithm, the path planning efficiency for the automatic guide transport cart is improved, and thus the difficulty of path planning is reduced; moreover, through real-time correction of the binocular vision sensor and the high-speed image collecting system, it is guaranteed that the automatic guide transport cart is prepared to arrive at the target position through the shortest path.
Owner:CHINA JILIANG UNIV

Image retrieval method based on multi-view local reconstruction preserving embedding

The invention discloses an image retrieval method based on multi-view local reconstruction preserving embedding. The method comprises: extracting features of an image, to obtain feature matrixes of multiple viewing angles, using a k-nearest neighbor sample of samples in an original space to reconstruct the sample, through a reconstruction weight matrix to describe similarity among the samples andneighboring samples, mapping similar structure features in the original space to a low-dimensional subspace, constructing a similarity matrix according to the reconstruction weight matrix of each viewing angle, at that same time, constructing a set of non-negative weight coefficients to represent different weight contribution of the same sample from different viewing angles, introducing auxiliarycoefficients to fuse multi-view feature information, and through an iterative optimal solution method, obtaining common low-dimensional subspace embedding representation of multiple viewing angles, finally, performing similarity measurement sorting on a to-be-retrieved image and all images, to obtain a retrieved result. The method gives full consideration to consistency and complementarity information of multiple viewing angles, optimally solves embedding representation of low-dimensional subspace of an image, and improves performance of image retrieval.
Owner:DALIAN UNIV OF TECH

Text processing technical method and system based on meaning group division

The invention relates to a text processing method and system based on meaning group division, and the method comprises the steps: obtaining an article to be analyzed in semantic tendency, wherein thearticle comprises paragraphs, the paragraphs comprise sentences, the sentences are divided into continuous language segments expressing a single meaning, ethe continuous language segments serve as a semantic meaning group, and the word segmentation of the semantic meaning group is carried out, and candidate words are obtained; obtaining a sentiment word library, allocating a tendency weight to each sentiment word in the word library, constructing a sentiment word list, retrieving candidate words in the sentiment word list, and extracting sentiment words corresponding to the candidate words astendency words of sentences; analyzing degree adverbs and negative words in front of the tendency words respectively; endowing the tendency words with degree weights and negative weights, and multiplying the negative weights, the degree weights and the tendency weights of the tendency words to obtain meaning group tendency components of the semantic meaning groups; and collecting the tendency component of each meaning group in the sentence to serve as a sentence tendency component, and obtaining a semantic tendency component of the article according to the sentence tendency component to serveas a semantic tendency analysis result of the article.
Owner:BEIJING RUNUP INFORMATION TECH

Manifold learning and gradient lifting model-based picture multi-label classification method

The invention discloses a manifold learning and gradient lifting model-based picture multi-label classification method. Constructing a weighted graph from the training data set, obtaining a non-negative weight matrix by solving the first minimization model, establishing a second minimization model according to the weighted graph, solving to obtain a reconstructed label matrix, constructing the training data set according to the reconstructed label matrix, training a binary correlation model, and predicting to obtain a label matrix; and establishing a regression device minimization solution forthe feature vector matrix of the picture, enhancing the feature vector matrix by using an iterative prediction result matrix, constructing a data set by combining a negative gradient matrix, trainingand learning to obtain weak regression devices, summing all the weak regression devices to obtain a final regression device, and processing and judging a pre-to-be-tested picture. According to the method, the multi-label classification prediction performance of the picture can be improved by fully utilizing the correlation between the partial multi-label data of the picture, the disambiguation ofthe partial label data can be realized, the accuracy and the robustness are improved, and the performance of the method is superior to that of the existing partial multi-label method of the picture.
Owner:ZHEJIANG UNIV
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