Product
Feature
Quick Research
Generate reliable direction feasibility study reports for your R&D in just a few steps.
Technical Q&A
Discover and master advanced knowledge NOW. Basics, ideas, possibilities, all at once.
Find Solutions
As an expert in R&D theories, this can generate solutions to your technical problems instantly.
Evaluate Feasibility
Analyze your overall solution with one click, know your potential R&D risks in advance.
Monitor Landscape
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.
43 results about "Nearest neighbor clustering" 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
Planning method of electric vehicle fast-charging station on expressway
InactiveCN105160428AMeet charging needsCharging stationsForecastingSimulationNearest neighbor clustering
Owner:TIANJIN UNIV
Automatic unstructured road boundary line extraction method based on vehicle-mounted laser point cloud
InactiveCN108062517AIncrease the degree of automated extractionImprove integrityActive open surveying meansCharacter and pattern recognitionEffective solutionPoint cloud
The invention provides an automatic unstructured road boundary line extraction method based on a vehicle-mounted laser point cloud. The method comprises steps: scanning line segmentation is carried out; a topology relation network is built; a moving window method is adopted to acquire ground points; clustering is carried out through a K nearest neighbor clustering method, a pseudo ground point cluster is eliminated according to the number of laser points in the point cluster, and road surface laser point cloud data are acquired; the outer contour point of the road surface laser point cloud data is set to be at the position of the road boundary line, outer contour boundary point extraction is carried out on each scanning line, two ground points with the farthest distance in each scanning line are acquired, and outer contour points at two sides of the road are finally acquired; clustering analysis is carried out, and a left contour point set and a right contour point set of the road areacquired; and boundary line tracking optimization is carried out to acquire the optimal boundary line. Extraction on an unstructured road and a road boundary can be quickly realized based on the laserpoint cloud data direction, an effective solution is provided for automatic unstructured road boundary line extraction, and the automatic road boundary line extraction degree is improved.
Owner:WUHAN UNIV
Reconfigurable processor architectures
InactiveUS20030135710A1Concurrent instruction executionArchitecture with single central processing unitComputer architectureExchange network
A reconfigurable processor architecture. A reconfigurable processor is an array of a multiplicity of various functional elements, between which the interconnections may be programmably configured. The inventive processor is implemented on a single substrate as a network of clusters of elements. Each cluster includes a crossbar switching node to which a plurality of elements is connected via ports. Additional ports on the crossbar switching node connect to the switching nodes of nearest neighbor clusters. The crossbar switching nodes allow pathways to be programmably set between any of the ports, and any pathway may be set to be either registered or unregistered. The use of clusters of processing elements allows complete freedom of local connectivity for effective configuration of many different processing functions. Wide area interconnection is more restricted, but, since it is less used, does not significantly restrict configurability. The inventive processor thus provides 1) high configurability with a low cost of switching network overhead; 2) constant clock speed, independent of configuration; and 3) very high clock speed since all communication is local or nearest neighbor.
Owner:RAYTHEON CO
Reconfigurable processor with alternately interconnected arithmetic and memory nodes of crossbar switched cluster
InactiveUS6920545B2Unrestricted configurability of connectionsSize of does not prohibitiveConcurrent instruction executionArchitecture with single central processing unitComputer architectureNear neighbor
A reconfigurable processor architecture. A reconfigurable processor is an array of a multiplicity of various functional elements, between which the interconnections may be programmably configured. The inventive processor is implemented on a single substrate as a network of clusters of elements. Each cluster includes a crossbar switching node to which a plurality of elements is connected via ports. Additional ports on the crossbar switching node connect to the switching nodes of nearest neighbor clusters. The crossbar switching nodes allow pathways to be programmably set between any of the ports, and any pathway may be set to be either registered or unregistered. The use of clusters of processing elements allows complete freedom of local connectivity for effective configuration of many different processing functions. Wide area interconnection is more restricted, but, since it is less used, does not significantly restrict configurability. The inventive processor thus provides 1) high configurability with a low cost of switching network overhead; 2) constant clock speed, independent of configuration; and 3) very high clock speed since all communication is local or nearest neighbor.
Owner:RAYTHEON CO
System and method for good nearest neighbor clustering of text
InactiveUS20070244874A1Digital data information retrievalCharacter and pattern recognitionNear neighborNearest neighbor clustering
An improved system and method for clustering text or content described by text is provided. Each text in a set of texts may be represented as a dimensional vector of words. Singleton texts that may not be similar to another text may be excluded from the set of texts for clustering. Texts identified as good nearest neighbors may then be grouped in the same cluster. In addition, metadata describing content may be used for clustering items of aggregated content from content feeds. Metadata describing items of content from content feeds may be converted into a set of texts and texts identified as good nearest neighbors may then be clustered. Items of content feeds described by the clustered texts may then be similarly clustered. Any types of items of content that may be described by text may be clustered, including audio, images, video, multimedia content, and so forth.
Owner:R2 SOLUTIONS
Electric power system payment channel evaluating method based on large data
InactiveCN105260815ARealize quantitative evaluationCharacter and pattern recognitionResourcesPaymentElectric power system
The invention provides an electric power system payment channel evaluating method based on large data and belongs to the field of electric power systems. The method comprises the steps of: firstly based on investigation questionnaire data, adopting a K-means clustering algorithm to carry out figure analysis on user payment behaviors, and identifying corresponding relations between various kinds of user attributes and the various kinds of user payment behaviors; utilizing a K nearest neighbor classification algorithm to carry out nearest neighbor clustering on electric power system payment channel evaluation factors, using a clustering result as a payment channel evaluation index, and establishing a payment channel evaluation system; utilizing a simulated genetic annealing algorithm to determine the weight of the payment channel evaluation index so as to form a payment channel evaluation module; and for new areas or new periods, utilizing electric power system practical payment data to judge whether the payment channel evaluation module is suitable, and if not, establishing a new evaluating module. The invention fills a technical void in the electric power system field, the quantitative evaluation of the electric power system payment channel is realized, and a scientific decision making basis are provided for the planning, construction and reconstruction of the payment channel.
Owner:ANSHAN POWER SUPPLY COMPANY OF STATE GRID LIAONING ELECTRIC POWER COMPANY +1
Weld joint contour feature recognition and weld pass real-time planning method
ActiveCN106952281AHigh precisionImprove welding efficiencyImage analysisSaliency mapNearest neighbor clustering
The invention provides a weld joint contour feature recognition and weld pass real-time planning method, and the method comprises the steps: obtaining a weld joint contour image in real time through a laser visual sensor, and carrying out the gray scale processing to obtain a gray scale image; building a visual attention model, processing the gray scale image through the visual attention model, obtaining a comprehensive saliency map, and extracting laser stripes through combining with the Otsu threshold segmentation method and the nearest neighbor clustering algorithm; segmenting the extracted laser stripes based on the section span of monotonous slope, and obtaining a monotonous slope section and a slope catastrophe point; finally formulating an algorithm according to the slope catastrophe point, and planning a weld pass. The method solves a problem that conventional weld pass planning is low in precision, and the method achieves the real-time planning of the weld pass.
Owner:SHANGHAI JIAO TONG UNIV
Data mining method of neural network based on nearest neighbor clustering
InactiveCN106022614AGood number of cluster centersFast learningResourcesHidden layerElectric power system
The invention discloses a data mining method of the neural network based on nearest neighbor clustering. An improved nearest neighbor clustering learning algorithm is used to train the neural network, so that on the premise that the precision requirement is met, the number of nodes of a hidden layer is reduced, the network structure is simplified, the learning speed of the neural network is increased, and the learning efficiency and precision of the neural network are further improved; and further data mining is carried out on the neural network, and the mining efficiency for a database of a large practical power system via the neural network is further improved. The data mining method aims at ensuring the safe, stable, high-quality and economical operation of the power system, and satisfying higher requirements for mass data of the digital power system and reliability, consistency and sharing performance of data.
Owner:GUANGZHOU POWER SUPPLY CO LTD +1
GC-MS non-target method used for rapid screening of plant differential metabolites
The invention discloses a GC-MS non-target method used for rapid screening of plant differential metabolites, and belongs to the technical field of flavours and fragrances, and metabonomics study technology. According to the GC-MS non-target method, modern GC-MS full scanning technology is adopted to obtain chemical ingredient information of volatile substances in plant; multidimensional Gaussian smoothing is adopted to extract substance information in a TIC picture; dynamic programming algorithm is adopted to calibrate chromatographic peak time shifting among samples, realize aligning of chromatographic peaks belongs to one same substance, achieve comparability of substance information among different samples; nearest neighbor-clustering algorithm is adopted to realize compound registration; and at last variance analysis is adopted to screen compounds with significant difference from different groups. According to the GC-MS non-target method, compound mass spectrum information is output so as to obtain a MSP file; and the MSP file can be input into the NIST database to search compounds. The GC-MS non-target method can be used for locking compounds with dissimilarities in plant samples rapidly, and is suitable for rapid analysis determination of a large amount of samples.
Owner:NINGXIA MEDICAL UNIV
Point cloud-based method and system of extracting building feature lines
ActiveCN107633523AImprove computing efficiencyAccurate calculationImage analysisPoint cloudLaser scanning
The invention provides a point cloud-based method and system of extracting building feature lines. The method comprises: extracting a plurality of planes from massive point cloud plane data; extracting two planes from the plurality of planes, and judging whether the two planes intersect; calculating and extracting an intersection line of the two planes if the two planes intersect; and judging whether two other intersecting planes exist in the plurality of planes, if yes, returning to the step of calculating and extracting an intersection line of the two planes, and otherwise, ending a process.According to the point cloud-based method of extracting the building feature lines provided by the invention, a shared nearest neighbor clustering algorithm is used for plane dividing of a building point cloud of three-dimensional ground laser scanning, the number of clusters does not need to be input in a clustering process, a method of plane intersection is used at the same time to extract building edge line features, a plane intersection distinguishing method is relatively simple, and edge line point coordinate calculation is accurate.
Owner:QIAODUOTIANGONG SHENZHEN TECH CO LTD
Intelligent control method of steering engine electro-hydraulic loading system
InactiveCN105159081ASolve the problem of online real-time controlHigh loading accuracyAdaptive controlNetwork outputNearest neighbor clustering
The invention relates to an intelligent control method of a steering engine electro-hydraulic loading system. The method comprises: a controller uses an ant colony clustering algorithm to obtain clustering information containing the clustering number and a cluster center; an RBF neural network uses the clustering number and the clustering center as the number of nerve cells of a hidden layer and a nerve cell center of the hidden layer, uses error information e and a system output signal y that are outputted by a force sensor and a displacement sensor as a pair input, and carries out on-line identification on a steering engine electro-hydraulic loading system by using a nearest neighbor clustering algorithm, thereby obtaining a neural network output; and a single nerve cell PID uses Jacobian information provided by an RBF neural network to carry out on-line self tuning on control parameters kp, ki, and kd by using a gradient descent method and then a loading force instruction signal is outputted to control movement of a steering machine. According to the invention, an on-line real-time control problem is solved; and thus the loading precision and response precision of the system are improved.
Owner:CIVIL AVIATION UNIV OF CHINA
Real-time and stage theory line loss fast estimation method with clustering technique adopted
The invention discloses a real-time and stage theory line loss fast estimation method with the clustering technique adopted. The method comprises the steps of extracting a real-time fracture surface feature vector, calculating a center fracture surface weight coefficient vector matched with the real-time fracture surface feature vector, fracture surface clustering, and theory line loss calculation. According to the real-time and stage theory line loss fast estimation method with the clustering technique adopted, when data are collected completely, center fracture surfaces are extracted by means of the nearest-neighbor clustering technique, and then fracture surfaces with similar operating states in a power grid are gathered together; under the situation of data missing, a central moment close to the data missing moment is found out by means of the nearest-neighbor clustering technique, and transmission loss of the power grid at the moment is assigned to the data missing moment; therefore, stage and real-time theory line loss values can be obtained fast, stage theory line loss calculation is achieved, the speed of the stage theory line loss calculation is increased, and precise comparison between the statistics line loss rate and the stage and real-time theory line loss values is achieved.
Owner:YANSHAN UNIV
System and method for good nearest neighbor clustering of text
InactiveUS7747083B2Digital data information retrievalCharacter and pattern recognitionNear neighborNearest neighbor clustering
An improved system and method for clustering text or content described by text is provided. Each text in a set of texts may be represented as a dimensional vector of words. Singleton texts that may not be similar to another text may be excluded from the set of texts for clustering. Texts identified as good nearest neighbors may then be grouped in the same cluster. In addition, metadata describing content may be used for clustering items of aggregated content from content feeds. Metadata describing items of content from content feeds may be converted into a set of texts and texts identified as good nearest neighbors may then be clustered. Items of content feeds described by the clustered texts may then be similarly clustered. Any types of items of content that may be described by text may be clustered, including audio, images, video, multimedia content, and so forth.
Owner:R2 SOLUTIONS
Density self-adapting non-uniform point cloud simplifying treatment method
The invention provides a density self-adapting non-uniform point cloud simplifying treatment method. The method comprises the following steps of: 1, performing K-near neighbor calculation of the whole point cloud; 2, performing self-adaptive and uniform re-sampling according to density information and curvature information of each point; and 3, setting an initial point cloud (D), outputting a simplified point cloud (FD), and working out the average density of the point cloud, which is a weighted average of the density of all points. In the method, the average density threshold value of the point cloud is set; the initial point cloud(D) is sampled by an uniform grid curvature adaptive sampling method so as to obtain a sub-point set(SD) of the initial point cloud(D); a similarity degree matrix S is obtained by working out the degree of similarity between points in the SD, and the u value of the points in the SD by indexing; by adopting a near neighbor clustering algorithm and using the S and u as AP algorithm inputs, a representative degree matrix and an adaptive degree matrix between the points are worked out; and the information between the points are updated by iteration until the target value is reached and the final point set(FD) is obtained. The method has the advantages of simplifying calculation, reducing occupied memory capacity and effectively simplifying non-uniform point cloud.
Owner:ZHEJIANG UNIV OF TECH
A fast adaptive nearest neighbor clustering method based on structured anchor graph
InactiveCN109508752AEffective studyReduce computational complexityCharacter and pattern recognitionOriginal dataNear neighbor
The invention provides a fast adaptive nearest neighbor clustering method based on a structured anchor graph. First of all, using K-Means algorithm generates representative anchors; Then, the initialsimilarity matrix is constructed for the original data points and anchor points. Then, the similarity matrix is updated iteratively by using the structured anchor graph technique, and the nearest neighbor assignment is performed adaptively. Finally, the clustering results are obtained directly according to the connected components of the graph corresponding to the final similarity matrix. The method of the invention reduces the dependence of the large-scale spectral clustering task on the initial similarity matrix weight, and can quickly obtain high-quality clustering results by iteratively optimizing the anchor graph structure.
Owner:NORTHWESTERN POLYTECHNICAL UNIV
Data-driven marine diesel engine fault detection method
ActiveCN111289256AReal-time online fault diagnosisImprove efficiencyInternal-combustion engine testingReal-time dataDieseling
The invention discloses a data-driven marine diesel engine fault detection method. The method comprises the following steps of clustering working modes of historical data of a diesel engine by adopting a k nearest neighbor clustering method to obtain a working mode type of the diesel engine; establishing a KPI model corresponding to each working mode by adopting a partial least squares regressionmethod PLS, and calculating an inspection threshold value; inputting real-time data to be detected; matching the working modes of the diesel engine by judging whether a distance between a real-time data point to be detected and a clustering center of the historical data is smaller than a preset threshold d or not; inputting to-be-detected data into the KPI model of the corresponding mode, and performing fault test statistics calculation to obtain KPI fault test statistics; and realizing data-driven marine diesel engine fault detection through comparison. By adoption of the technical scheme, real-time, wide-application-range and high-efficiency online fault diagnosis can be achieved.
Owner:PEKING UNIV
Power distribution network multi-fault first-aid repair recovery method and system considering pre-disaster pre-scheduling
ActiveCN111539566AGuaranteed uptimeShorten load outage timeForecastingSystems intergating technologiesPathPingPower flow
The invention relates to a power distribution network multi-fault first-aid repair recovery method and system considering pre-disaster pre-scheduling. The method comprises the steps: determining the outage probability of an element, and generating an anticipated accident set; calculating a system direct-current power flow; sequentially quitting the load nodes in the anticipated accident set to judge whether the system has faults or not, and if so, merging the fault nodes into an accident determination set; judging whether all nodes in the system are judged to be finished or not, and if so, obtaining an accident determination set; if not, obtaining the information of the next node; determining a system fault position and a subarea to which a fault element belongs based on the accident determination set, and constructing a path scheduling scheme; determining a DG output prediction curve by adopting a DG output prediction method based on nearest neighbor clustering; and based on the DG output prediction curve, determining a power distribution network first-aid repair recovery scheme by constructing a multi-source collaborative optimization model. The fault first-aid repair efficiencycan be effectively improved, the first-aid repair sequence is optimized, the first-aid repair plan is adjusted in real time, and the power supply capacity of available resources of the power distribution network is optimized.
Owner:YANSHAN UNIV
Clustering analysis method based on sample density and self-adaptive adjustment of clustering center
InactiveCN111382797AImprove effectivenessCharacter and pattern recognitionAlgorithmNearest neighbor clustering
The invention relates to a clustering analysis method based on sample density and self-adaptive adjustment of a clustering center. Firstly, a clustering number K and the clustering center are initialized based on the sample density and the sample neighborhood, then the clustering number K is adaptively adjusted by adopting a nearest neighbor cluster merging method, and finally, the optimal clustering result is obtained, so that the effectiveness of the clustering analysis result is greatly improved.
Owner:NORTHWESTERN POLYTECHNICAL UNIV
Outdoor facility inspection method
InactiveCN105404891AInformativeAccurate classificationCharacter and pattern recognitionColor imageNear neighbor
The invention discloses an outdoor facility inspection method. According to the outdoor facility inspection method, a color image is read, and the image is converted into a grey-scale image; line segments in the image are calculated by employing probability Hof transform, and the line segments with length exceeding a set threshold are selected; the K near neighbor clustering algorithm is utilized, and the clustering result is traversed till clustered line segments can form a profile structure of equipment; a detection-needing area is selected; and a localized binary image in the area is calculated; a white connected component of the binary image is simplified through a binary image refinement algorithm to form a curve line segment; the binary image containing the curve line segments is traversed, points at end points of the curve line segments are extracted, and the points are marked at end point queues; the end point queues are classified and processed by utilizing a gradient histogram and a support vector machine, and an inspection result is acquired. The method can adapt to a real illumination situation and further has advantages of high detection accuracy, faster processing speed, high stability and relatively high noise resistance performance and inclination resistance performance.
Owner:SOUTHWEST JIAOTONG UNIV
Density peak-core fusion-based adaptive clustering method
ActiveCN109840558ASimple methodAccurate methodCharacter and pattern recognitionClustered dataData set
The invention provides a density peak-core fusion-based adaptive clustering method, and belongs to the field of pattern recognition. The method comprises the following steps: (1) firstly, carrying outdensity neighbor clustering based on a density peak value: calculating the density of each data point in the to-be-clustered data set by using a core density-k-nearest neighbor density estimation method, determining density peak points through an adaptive threshold value, and performing density nearest neighbor clustering by taking the density peak points as a class center to obtain an initial clustering result; And (2) performing core fusion operation based on intra-class divergence: adaptively determining a core point in each initial class, fusing the two initial classes if the core pointsof the two initial classes are adjacent and the intra-class divergence can be reduced after fusion, and fusing all the initial classes to be fused to obtain a final clustering result. The method is simple, accurate and efficient, and can perform self-adaptive clustering on the data set with any shape and density distribution.
Owner:NANJING UNIV OF AERONAUTICS & ASTRONAUTICS
Improved user recommendation method based on neighbor project slope one algorithm
InactiveCN105678430AAddress scoring impactReduce sparsityForecastingCharacter and pattern recognitionItem CollectionNearest neighbor clustering
The invention, which relates to the analysis field of the user-project data, designs an improved recommendation method based on combination of a nearest neighbor clustering algorithm and a slope one algorithm. According to the invention, the method is based on combination of the k-means clustering method and the slope one algorithm. The k-means clustering method is used for finding similar individual projects for a user to form a neighbor project set; a user-project investigation data table is calculated by using the slope one algorithm; and then data prediction is carried out and the data are recommended to the user. When possibility of project investigation on a user is determined, similarity between the data projects is taken into consideration, so that the algorithm prediction result becomes accurate. A predication investigation possibility problem is converted into a project recommendation problem for solution. The possibility of investigation on the user is predicted based on the neighbor project slope one algorithm, so that the user can take related measures in advance.
Owner:DALIAN UNIV
Welding gun deviation three-dimensional extraction method for sheet welding based on passive vision sensing
ActiveCN107914067AHigh precisionRealize the extraction of three-dimensional orientationArc welding apparatusEngineeringNearest neighbor clustering
The invention provides a welding gun deviation three-dimensional extraction method for sheet welding based on passive vision sensing. A vision sensing device comprising an optical filter with the center wavelength being 660 nm and a light reducing piece combination with the transmittance being 0.040% is adopted for obtaining a welding joint image containing a welding joint contour line, and the extreme value position is obtained through polynomial fitting; and then Otsu threshold value partition and a nearest neighbor clustering algorithm are adopted for extracting the joint contour line in the welding joint image. An algorithm for a welding gun tracking point on the joint contour line is obtained according to the design of the electric arc center position in the joint image, and thereforethe three-dimensional deviation of a welding gun is determined according to the vision calibration technology and the position, obtained by an image treatment system, of the welding gun. By means ofthe method, the extracted deviation is more accurate, in addition, deviation rectifying can be conducted on the welding gun in two directions at the same time, no extra sensor is needed, and the welding cost is better reduced.
Owner:NANCHANG UNIV
Method of quickly screening difference of dry sulphitation radix paeoniae alba and non-dry sulphitation radix paeoniae alba by UPLC-MS-MS
The invention discloses a method of quickly screening difference of dry sulphitation radix paeoniae alba and non-dry sulphitation radix paeoniae alba by UPLC-MS-MS. The method comprises the followingsteps: (1) collecting medicinal materials of dry sulphitation radix paeoniae alba and non-dry sulphitation radix paeoniae alba to be differentiated to prepare a standard decoction sample; (2) feedingthe sample into an UPLC-MS-MS system for analysis to obtain mass spectrometric data; (3) directly importing originally collected data into Compound Discoverer 2.1 to analyze data; (4) correcting chromatographic peak drift by adopting a dynamic planning calculating method, aligning the chromatographic peaks, and registering matters, the retaining times of which are the closest, into a compound by means of a nearest neighbor clustering method; and (5) calculating different matters among samples by means of variance analysis and determining the difference between dry sulphitation radix paeoniae alba and non-dry sulphitation radix paeoniae alba. The compound mass spectrum information is output as an original file which does not need to be converted into other formats and can be directly imported into a Compound Discoverer 2.1 library to search for compounds. The method can quickly lock different compounds in traditional Chinese medicinal material samples and is suitable for quick analysisand determination of bulk samples.
Owner:GUANGDONG YIFANG PHARMA
Multi-source data visual analysis and display method and system
PendingCN110750528AImprove analysisBroaden applicationDigital data information retrievalCharacter and pattern recognitionData informationEngineering
The invention discloses a multi-source data visual analysis and display method and system. The multi-source data visual analysis and display method comprises the steps of receiving all data information, cleaning data, deleting abnormal data, and obtaining a data sample set; according to the type of the data sample, selecting the size of a clustering number K value; distributing the data samples inthe data sample set to the nearest neighbor cluster according to the minimum distance principle; recalculating the centers of the K clusters according to the nearest clustering result, and taking thecenters as new clustering centers; judging whether convergence occurs or not, namely judging whether the clustering center does not change any more, and if not, repeating until convergence to obtainan optimal clustering result; according to the optimal clustering result, marking corresponding labels on the data samples and enabling the labels to correspond to the display templates in a one-to-one mode, and conducting display. The multi-source data visual analysis and display system comprises a data sample processing module, a clustering number selection module, an approaching and clusteringmodule, a clustering center operation module, an optimal clustering operation module and a display module.
Owner:广东机场白云信息科技股份有限公司
Method for solving copper conductor temperature by optical fiber temperature for photoelectric composite submarine cables
InactiveCN102799788AImprove accuracySimple methodSpecial data processing applicationsOcean bottomCopper conductor
The invention relates to a method for solving copper conductor temperature by optical fiber temperature for photoelectric composite submarine cables. The method mainly comprises the following steps: (1) listing the thermal load operating current range, ambient temperature range, environment convection heat exchange coefficient range during operation of the photoelectric composite submarine cable, and carrying out uniform discretization respectively; (2) using the optical fiber temperature Tf and parameters I, G and H as the input variable X, and the copper conductor temperature Tc as the output variable; (3) through a test, measuring and acquiring the output optical fiber temperature Tf and the copper conductor temperature Tc under different thermal load operating current I, ambient temperature G and environment convection heat exchange coefficient H of the photoelectric composite submarine cable, wherein X and Tc form mx*n*p input-output sample pairs; (4) selecting a Gaussian function based on a radial basis function of a multilayer feedforward neural network; (5) studying the m*n*p input-output sample pairs by the multilayer feedforward neural network, wherein the study algorithm is a nearest neighbor clustering algorithm, the values of wi, ci and sigmai are obtained after studying, i=1, 2, 3,...N; and (6) solving the copper conductor temperature Tc from I, G, H and Tf by using a formula.
Owner:SHANGHAI MARITIME UNIVERSITY +2
Use of sequential nearest neighbor clustering for instance selection in machine condition monitoring
A method is provided for selecting a representative set of training data for training a statistical model in a machine condition monitoring system. The method reduces the time required to choose representative samples from a large data set by using a nearest-neighbor sequential clustering technique in combination with a kd-tree. A distance threshold is used to limit the geometric size the clusters. Each node of the kd-tree is assigned a representative sample from the training data, and similar samples are subsequently discarded.
Owner:SIEMENS CORP +1
Multi-reconnaissance-platform pulse-to-pulse agile radar radiation source frequency information association method
PendingCN110880012AImprove accuracyCharacter and pattern recognitionICT adaptationCosine similarityRadar radiation
The invention discloses a multi-reconnaissance-platform pulse-to-pulse agile radar radiation source frequency information association method, and the method comprises the steps: firstly carrying out the classification of radar radiation source frequency samples reported by two reconnaissance platforms through employing a nearest neighbor clustering algorithm, and calculating the number of frequency samples corresponding to each reconnaissance platform in each class; respectively constructing frequency sample interception frequency vectors of the two reconnaissance platforms; calculating cosinesimilarity between the vectors of the interception times of the two frequency samples; and finally, comparing the cosine similarity with a judgment threshold, and judging whether the radiation sourcefrequency information reported by the two reconnaissance platforms is matched. According to the method, the accuracy of frequency information association of the pulse-to-pulse agile radar radiation source of the multi-reconnaissance platform is effectively improved.
Owner:扬州船用电子仪器研究所
Planning method of electric vehicle fast charging stations on the expressway
ActiveUS10360519B2Solve the real problemMinimal costBatteries circuit arrangementsCharging stationsFast chargingNearest neighbor clustering
A planning method of EV fast charging stations on the expressway, comprising the following steps: Step 1: forecasting the spatial and temporal distribution of EV charging load, that is to determine the time and location of each EV needing charging on the expressway; Step 2: based on the forecast result achieved by Step 1, determining the locations of the fast charging stations on the expressway by the nearest neighbor clustering algorithm; Step 3: according to the spatial and temporal forecast result of the EV charging load and the locations of the fast charging stations, determining the number c of the chargers in each fast charging station by queuing theory. Due to battery characteristics, traditional gas stations do not completely match the fast charging stations. In the planning method, the locations and times for charging of the EVs are considered to determine the capacities and locations of the fast charging stations, which can meet the charging needs of the EVs more than the traditional gas station, and thus promote the development of EVs.
Owner:TIANJIN UNIV
A fast estimation method of real-time and stage theoretical line loss using clustering technology
The invention discloses a real-time and stage theory line loss fast estimation method with the clustering technique adopted. The method comprises the steps of extracting a real-time fracture surface feature vector, calculating a center fracture surface weight coefficient vector matched with the real-time fracture surface feature vector, fracture surface clustering, and theory line loss calculation. According to the real-time and stage theory line loss fast estimation method with the clustering technique adopted, when data are collected completely, center fracture surfaces are extracted by means of the nearest-neighbor clustering technique, and then fracture surfaces with similar operating states in a power grid are gathered together; under the situation of data missing, a central moment close to the data missing moment is found out by means of the nearest-neighbor clustering technique, and transmission loss of the power grid at the moment is assigned to the data missing moment; therefore, stage and real-time theory line loss values can be obtained fast, stage theory line loss calculation is achieved, the speed of the stage theory line loss calculation is increased, and precise comparison between the statistics line loss rate and the stage and real-time theory line loss values is achieved.
Owner:YANSHAN UNIV
Unmanned aerial vehicle autonomous obstacle avoidance method and system based on single-line laser radar
The invention discloses an unmanned aerial vehicle autonomous obstacle avoidance method based on a single-line laser radar. The method comprises the following steps: calculating the spatial distance between an unmanned aerial vehicle and an obstacle through combining the time interval of laser beam transmitting and receiving of the laser radar with the light velocity, presetting the obstacle avoidance flight modes of the unmanned aerial vehicle in different distance ranges, clustering the data returned by the laser radar through a nearest neighbor clustering method, and judging the surface continuity of the obstacle. Autonomous obstacle avoidance in the flight process of the unmanned aerial vehicle is achieved, the inspection efficiency of the unmanned aerial vehicle is improved, and real-time communication between the laser radar and the unmanned aerial vehicle is achieved.
Owner:GUANGZHOU POWER SUPPLY BUREAU GUANGDONG POWER GRID CO LTD
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