79 results about "Short path length" patented technology

Computer-implemented methods, systems, and articles of manufacture for determining the importance of a data item. A method includes: (a) receiving a node graph; (b) approximating a number of neighbor nodes of a node; and (c) calculating a average shortest path length of the node to the remaining nodes using the approximation step, where this calculation demonstrates the importance of a data item represented by the node. Another method includes: (a) receiving a node graph; (b) building a decomposed line graph of the node graph; (c) calculating stationary probabilities of incident edges of a node graph node in the decomposed line graph, and (d) calculating a summation of the stationary probabilities of the incident edges associated with the node, where the summation demonstrates the importance of a data item represented by the node. Both methods have at least one step carried out using a computer device.

Systems and method for selecting open shortest path first (OSPF) aggregates and aggregate weights for a particular area. In one embodiment, an aggregate selecting system includes: (1) a database for containing data pertaining to candidate OSPF aggregates and corresponding weights and (2) an aggregate selector, associated with the database, that selects at least a subset of the OSPF aggregates such that the shortest path length between the particular source and destination subnets resulting from advertisement of a set of weighted aggregates approaches the shortest path length between the particular source and destination subnets irrespective of the advertisement. In one embodiment, a weight selection system includes: (1) a database for containing data pertaining to candidate OSPF aggregates and (2) a weight assigner, associated with the database, that assigns, for the OSPF aggregates, weights based on either an average distance of subnets in the area for a particular area border router (ABR) of the area or a search heuristic.

The invention discloses a method for identifying opinion leaders in a social network based on topic link behaviors of users, comprising constructing a social network directed graph, amending edge-weight of the network, for each network node i, calculating the number of shortest paths passing through the node i, calculating the length of the shortest paths, weighting edges of the node, and calculating weighted sum B(i). Opinion leaders based on topic tracking are composed of nodes which have a larger value of B(i). The method of the invention adopts a calculation method of link relations in social network user topics, which reduces scale of network nodes and accordingly decreases system overhead and improves algorithm accuracy and recall rate.

The invention relates to a satellite network reliable routing method on the basis of virtual nodes, which is applied in single-layer routing protocols under similar polar orbit constellation models and is mainly used to solve the complexity problem that a satellite node obtains routing information. The method comprises: marking a satellite by an address of a ground logic area which is covered by the satellite, namely, being endowed with a specific role, knowing the communication conditions of surrounding virtual nodes through sending a link probe packet, generating a route updating information packet under the virtual nodes, setting flooding hop number as N, then, sending to link interfaces which satisfy the demands, receiving satellite virtual nodes of the route updating information packet, correcting parameters in the route updating information packet, extracting reached hop number J of information of each route prefix of the route updating information packet, and obtaining the theoretical shortest path length L from the satellite virtual nodes to the target ground logic area through a computational method of the ideal shortest path length, wherein the routing method shields the dynamictopology characteristics of internet, improves the routing astringency, and lowers the time delay of data packet transfer.

The invention discloses an aircraft optimal path determination method based on mixed probability A star and agent. The method is mainly used to solve problems of too long path length and too large thread value of obstacles to the aircraft. The method comprises steps of: (1) generating a topographical map of the obstacles; (2) arranging a start point SP and a stop point EP of the aircraft in the topographical map of the obstacles; (3) planning a global path of the aircraft by using a probability A star algorithm in accordance with the positions of the start point SP and the stop point EP of the aircraft; and (4) locally optimizing the planned path by using an agent algorithm. The method has advantages of short path length and low thread value, and can be used for determining the optimal path of the aircraft.

To provide an X-ray microscope that has a size small enough to be brought into a room by shortening the path length, an X-ray microscope including at least one of each of an X-ray source 1, a sample holding part 3, a concave KB mirror 4, a convex KB mirror 5, and a light receiving part 8 located at a position in an imaging relation to a position of the sample holding part 3 in this order along an optical axis is fabricated.

The invention relates to a global smooth path planning method for a mobile robot. The method includes the following steps: carrying out environmental modeling according to the working environment of the mobile robot; establishing an objective function to be optimized according to the principle of safe and shortest path; carrying out path planning of the mobile robot based on an adaptive particle swarm algorithm; outputting a motion path of the mobile robot according to an optimization result; and smoothing the motion path of the mobile robot by adopting Bezier curves. According to the method,the adaptive particle swarm algorithm is combined with the Bezier curves, so that the stability and robustness are strong, the search efficiency can be effectively improved, the path length can be shortened, and the intention of manual planning is met; and moreover, the method has few parameters to be adjusted, is simple in model, and is suitable for global smooth path planning of multiple mobilerobots in complex environments.

The invention discloses an unmanned aerial vehicle path planning method based on floyd algorithm, the method comprises the steps of starting from a weighted neighboring matrix A = [a (i, j)] n x n of a graph basing on the dynamic path planning of floyd, carrying out n times of updating recursively, namely constructing a matrix D(1), according to a formula, basing on a matrix D(0) = A; and likewise, using the same formula, constructing D(2) basing on D(1); ......; and finally using the same formula, constructing a matrix D(n) basing on D(n-1), with the ith row jth column element of the matrix D(n) being the shortest path length from the ith row vertex to the jth row vertex, and calling the matrix D(n) as the distance matrix of the graph, meanwhile the method can also introduce a matrix path of a descendant node to record the shortest route between two points, and finding out the shortest route between the beginning node and end node using the method.

An efficient absorption spectroscopy system is provided. The spectroscopy system may be configured to measure solid, liquid or gaseous samples. Vacuum ultra-violet wavelengths may be utilized. Some of the disclosed techniques can be used for detecting the presence of trace concentrations of gaseous species. A preferable gas flow cell is disclosed. Some of the disclosed techniques may be used with a gas chromatography system so as to detect and identify species eluted from the column. Some of the disclosed techniques may be used in conjunction with an electrospray interface and a liquid chromatography system so as to detect and identify gas phase ions of macromolecules produced from solution. Some of the disclosed techniques may be used to characterize chemical reactions. Some of the disclosed techniques may be used in conjunction with an ultra short-path length sample cell to measure liquids.

<heading lvl="0">Abstract of Disclosure</heading> Machines for ultra-rapidly conditioning cotton fiber. In one embodiment, a machine includes a conditioning chamber for receiving cotton fiber formed into a sheet-like body. The conditioning chamber is defined on one side by an impervious plate and on an opposite side by a perforated plate. The sheet-like body of cotton fiber is pressed between the impervious and perforated plates. An air conditioner is connected for driving a conditioned gas flow through the perforations and then laterally through the sheet-like body of cotton fiber. In another embodiment, a conditioning chamber is defined on one side by an impervious plate and on an opposite side by a distribution plate having a series of alternating passages connected for respectively delivering gas flow to the cotton and for allowing gas flow to exit from the cotton. As a result, relatively short path lengths are achieved. An air conditioner is connected for driving a conditioned gas flow through the passages for delivering gas flow. In a processing embodiment for conditioning fiber being pneumatically transported by a gas flow, fibers are collected to form a thin mat. Aerosolized liquid is delivered to the thin mat, and then conditioned fiber from the thin mat is re-delivered into the gas flow.

The invention discloses a quotient space overlying model of an undirected and unweighted network and a construction method thereof. The method comprises the following steps: obtaining a maximal complete subgraph of a network by utilizing quotient space theory and compatibility relationship, gradually coarsening granularity to form a hierarchical quotient space overlay network chain, and obtaining a quotient space overlying model formed by all maximal complete subgraphs of all levels of quotient space overlay networks with granularity from fineness to coarseness and node information thereof in an initial network; intuitively finding the minimal path length between two nodes in the network according to the node information of the maximal complete subgraphs of all levels of quotient space overlay networks in the quotient space overlying model in the initial network; finding the positions of two nodes in the initial network in the quotient space overlay networks with different granularities according to the model; searching the link path between the two nodes starting from a quotient space overlay network with a coarse granularity; searching from the quotient space overlay networks with gradually finer granularity until from a quotient space overlay network with a finest granularity, so as to rapidly search the minimal path between any two nodes. The quotient space overlying model can also be constructed by using a computer.

The invention discloses a personnel characteristic-based fire evacuation path navigation method which comprises the following steps: 1, obtaining fire behavior information through a fire detector, calculating an effective time range capable of being used for escape of each path; 2, reading personnel label information by using an RFID (Radio Frequency Identification) reader-writer, locating personal position information, performing personnel evacuating speed classifying according to the obtained personnel label information and the obtained personnel position information; 3, for personnel with different speeds, calculating evacuating path information by using a shortest path precedence algorithm, wherein the evacuating path information comprises a shortest path length value from an initial position to an outlet node D and all nodes on the path; and 4, sending the shortest path length value and all nodes on the path to personnel to be evacuated. According to the personnel characteristic-based fire evacuation path navigation method, the utilization rate of the path can be effectively increased.

The invention discloses a method for determining an optimal path of a flight vehicle based on a self-adaptive A star algorithm, which is mainly used for solving the problems of excessively long length of the divided path, excessively large threat value of an obstacle to the flight vehicle and excessively large number of waypoints of the prior art. The method comprises the following implementation steps: (1) setting a start point SP and an end point EP of the flight vehicle in a map; (2) generating an obstacle region; (3) performing grid division on the obstacle region to obtain a grid map; (4) setting a grid where the start point SP of the flight vehicle is located as SG and setting the grid where the end point EP is located as EG in the grid map; (5) performing path planning according to the grid SG where the start point of the flight vehicle is located and the grid EG where the end point is located. The method disclosed by the invention has the advantages of short path length, low threat value and a small number of waypoints, and can be used for determining the optimal path of the flight vehicle.

A plurality of landmarks selected from a source weighed graph on which a path search is performed; and the shortest path lengths between landmarks, and the shortest path lengths from vertices to landmarks adjacent to the respective vertices are calculated, and are stored in a memory device so as to be later referable. Routines for calculating upper and lower limits of the shortest path length corresponding to two vertices v and w are prepared by using expressions derived from quadrangle inequalities formed of the two vertices v and w as well as two landmarks adjacent to the respective vertices v and w. In response to a call from an A* search program, these routines return the upper limit or the lower limit of the shortest path length corresponding to v and w by referring to the shortest path lengths between landmarks, and the shortest path lengths from vertices to landmarks adjacent to the respective vertices, which have been previously stored in the memory device.

The invention discloses an error checkpoint positional information automatic identification method based on big data analysis. The method comprises the steps of: calculating adjacent checkpoint pairs according to mass historical checkpoint vehicle passing data, calculating the shortest path length of the adjacent checkpoint pairs by combining with GIS map data, and calculating passing speed of vehicles between the checkpoint pairs through vehicle data; and finding out the checkpoint with error positional information according to checkpoint shortest path abnormity, checkpoint interval velocity abnormity and abnormal frequency iteration in sequence. The error checkpoint positional information automatic identification method utilizes real checkpoint vehicle passing data, and has the advantages of large data size, high data accuracy and the like, thus the accuracy of error checkpoint positional information analyzed according to attributes of vehicle passing data is high. The error checkpoint positional information automatic identification method achieves the automatic identification of the error checkpoint positional information, has the advantages of fast execution speed, high accuracy, high efficiency and the like, and omits a great deal of manual identification.

An RF coil suitable for use in imaging systems is provided which coil has a dielectric filled cavity formed by a surrounding conducting enclosure, the conducting enclosure preferably being patterned to form continuous electrical paths around the cavity, each of which paths may be tuned to a selected resonant frequency. The patterning breaks up any currents inducted in the coil and shortens path lengths to permit higher frequency, and thus higher field strength operation. The invention also includes improved mechanisms for tuning the resonant frequency of the paths, for selectively detuning the paths, for applying signal to the coil, for shortening the length of the coil and for controlling the field profile of the coil and the delivery of field to the object to the image.

The invention provides a multi-band antenna device and is applicable to a wireless communication device. The multi-band antenna device at least comprises a first radiation part, a second radiation part, a third radiation part, a feed-in terminal and an earthing terminal, wherein the second radiation part is connected with the first radiation part and has a shorter path length relative to the first radiation part, the third radiation part is connected with the first radiation part and has a shorter path length relative to the first radiation part, the feed-in terminal is connected with the second radiation part, the earthing terminal is at least connected partially with the third radiation part and/or the first radiation part. The first, the second and the third radiation parts share the feed-in terminal and the earthing terminal, the wireless signal of a first bandwidth is received and transmitted by the first radiation part, and the wireless signals of a plurality of different second bandwidths are received and transmitted by the second and the third radiation parts.

The present invention provides a route length calculation apparatus, comprising a location detection unit for acquiring current location of a mobile object; an event detection unit for detecting the occurrence of an applicable event; a route history information storage unit for storing, upon occurrence of a first event, past route information containing at least the point of occurrence of the first event; and a distance calculation unit for calculating, when occurrence of a second event is detected by the event detection unit, the shortest route length between the point of occurrence of the second event acquired by the location detection unit and the point of occurrence of the first event along a route that the mobile object has traveled before.

A computer-implemented method includes a principal process including performing a computational procedure in which the or each vertex preceding a particular vertex receives a notification that a computational procedure has been completed for the preceding vertex; and calculates new path lengths for the particular vertex by adding the length value attributed to the edge from the preceding vertex to the particular vertex to each of the recorded k shortest path lengths from the first vertex to the preceding vertex. A record of the k shortest path lengths calculated for the particular vertex is maintained. After the new path lengths have been calculated for the or each of the preceding vertices, a notification that the computational procedure has been completed for the particular vertex is issued. The computational procedure is performed with the source vertex as the first vertex and each vertex on a path from the source vertex to the destination vertex as the particular vertex.

The invention relates to the technical field of power network planning, and provides a power network partitioning method based on network structure characteristic analysis. The power network partitioning method comprises the steps of: carrying out simplification on a power network and carrying out network partitioning on the simplified power network by taking each load-center substation as the center; carrying out optimal splitting processing on the power network subjected to network partitioning; calculating a shortest path length matrix in the power network and all shortest path data; calculating edge weight information of the power network, and according to the calculated edge weight information, calculating a weighting modularity index; and according to the calculated weighting modularity index, outputting electromagnetic loop network partitioning contents so as to implement partitioning on an electromagnetic loop network and provide the theoretical basis for realistic partitioningon the power network.

The present invention proposes a method and device for acquiring the shortest path through the necessary points without order. The method includes the following steps: calculating the starting point to any necessary point, any necessary point to the end point and pairwise The shortest path length and path between the necessary points; initialize UN population individuals, the individual length is K, and fill it with the serial number of each necessary point; calculate the path and path length of each individual in the population, and carry out the population according to the path length Sort and take N best paths; take a certain proportion of individuals from the population, generate them according to the cross mutation rules, and generate a new generation of feasible solutions as a new population; when the number of iterations reaches the preset number, output N optimal solutions . The present invention generates a new generation of feasible solutions as a new population, which can effectively ensure the possibility that the new generation of populations is better than the previous generation of populations, and can stop and use the current optimal solution at any time.

The invention provides an urban road traffic network entropy computing method and system based on the shortest path. The method is characterized by taking all the shortest paths in a road network and traffics on the paths into account; computing, by calculating the shortest path between each node pair in the road network and the number of sides covered by the shortest path, the average traffic on the sides; constructing an average traffic matrix under the different shortest path lengths; and according to the Shannon information entropy formula, calculating the network entropy under different shortest path lengths so as to evaluate and analyze the structural characteristic of the road network.