82 results about "Minimum cost path" patented technology

In a wireless network, a lowest cost path from a source node to a target node is selected from a plurality of potential paths. The source node sums costs for the links of each potential path. For each link, these costs include a cost of interference, dependent on a number of nodes affected by a signal sent via the respective link. The link costs can also include a cost of transmission, dependent upon a data rate for the respective link, and a cost of coordination for transmissions with other nodes of the network.

A method of moving in a minimum cost path using a grid map, and an apparatus to perform the method, the method including calculating a move cost to a goal, from each of a plurality of cells comprises in a space in which a mobile home appliance moves, and planning a movement path to the goal according to the move cost; determining one or more via points at which a direction changes on the movement path; planning the minimum cost path from the movement path by selecting one or more shortest-distance via points from the via points; and moving from a first shortest-distance via point to a second shortest-distance via point.

A Wireless LAN Context Control Protocol (WLCCP) is used to establish and manage a wireless network topology and securely manages the “operational context” for mobile stations in a campus network. The WLCCP registration protocol can automatically create and delete links in the network, securely distribute operational context, and reliably establish Layer 2 forwarding paths on wireless links. A single infrastructure node is established as the central control point for each subnet, and enables APs and MNs to select the parent node that provides the “least-cost path” to a backbone LAN. Context messages provide a general-purpose transport for context and management information. WLCCP “Trace” messages facilitate network diagnostic tools. Ethernet or UDP/IP encapsulation can be used for WLCCP messages. Ethernet encapsulation is employed for intra-subnet (e.g. AP-to-AP or AP-to-SCM) WLCCP messages. IP encapsulation is used for inter-subnet WLCCP messages and may also be used for intra-subnet WLCCP messages.

A joint search method for UAV multiobjective path planning in an urban low altitude environment first constructs a static safety index map based on static known obstacles. Meanwhile, based on proactively detected obstacles that are not marked on a geographic map by a UAV, the method constructs online a dynamic safety index map. Second, a multiobjective path planning problem is solved using a joint offline and online search method. Moreover, this method first plans offline the least cost path from a starting point to an end point and then invokes the online search scheme to replan online a changed path when the UAV detects unknown obstacles. Thus, the UAV can avoid dynamic obstacles effectively. The online search scheme has a small search space and can quickly replan a safe path for the UAV, thus satisfying the requirement of UAV on the real-time path planning.

Improved algorithms are provided for performing path management for a plurality of select data transmission sessions in a multicast network. The algorithms include: constructing a weighted graph which represents topology of the network; assigning load correlated costs to network links; and computing least cost paths for each of the data transmission sessions which accounts for global bandwidth utilization.

A method and system for directing data packets from an origin node to a destination node in a multipath communication network having a plurality of nodes, where each node is connected to at least one other node by links. The apparatus includes a processor for obtaining cost information relating to each link in the network and for determining the least-cost route between the origin node and the destination node based on the cost information relating to each link. The processor establishes a cost margin representing a range of costs above the cost of the least cost route and identifies one or more alternate routes. A data storage device stores the cost information, and a network interface selectively routes the data packets through one or more of the least cost route and the one or more alternate routes falling within the established cost margin thus balancing the network load and providing alternate data paths in case the least-cost path is unavailable.

A method for extracting a local center-axis representation of a vessel, includes: placing first and second seed points in an image that includes the vessel, wherein the first and second seed points are placed near a beginning and an end of a centerline of the vessel; representing the image as a discrete graph having nodes and edges, wherein the first seed point is a source node and the second seed point is a goal node; and finding a minimum-cost path between the first and second seed points by computing a cost of edges between the first and second seed points, wherein the cost of each edge is reciprocal to a vesselness measure of the edge.

The invention provides an image-based method for generating novel visual appearance in a new image. Synthetic texture is stitching together from small patches in existing images. First, we use a least cost path determination to determine the local boundaries between the patches. Second, we perform texture transfer by rendering an arbitrary object with a synthetic texture taken from a different object. More generally, we provide methods for rendering entire images in styles of different images. The method works directly on pixel images, and does not require 3D information.

A method compares a first data sequence with a second data sequence. A cross-correlation matrix of distances between all possible pairs of values of the first and second data sequences is constructed. A minimum cost path between diagonally opposing corners of the cross-correlation matrix is determined. The minimum cost path is projected onto a transfer function that maps between the first data sequence and the second data sequence. Then, the minimum cost path is projected onto a deformation function that corresponds to a similarity between the first data sequence and the second data sequence.

A network comprises a plurality of interconnected switches. At least one pair of switches is interconnected by a trunk formed from a plurality of individual links. A cost value is assigned to the trunk that is equal to the cost of one of the trunk's individual links. As such, a trunk is considered the same as an individual link when shortest path calculations are made. When multiple paths are computed as having the same lowest cost, the system balances load traffic between such lowest cost paths in a way that takes advantage of the higher bandwidth capabilities of trunks.

Methods and systems for modeling cerebral aneurysm and their incoming and outgoing vessels from 3D image data are disclosed. Aneurysms and vessels are segmented from their background using a graph-cuts method. Begin and end of vessels are determined. Construction of a centerline of the incoming and outgoing vessels using a measure of vesselness in calculating a minimum cost path in a graph with nodes being representation of pixels is also disclosed. Vessel surface models are constructed from sub-voxel cross-sectional segmentation. The interpolation of vessels inside an aneurysm based on smooth continuity is disclosed. Selection of endo-vascular stents based on interpolation results is also provided.

A method, system, and medium for determining a least-cost, international-routing path to communicate data across a telecommunications network are provided. The path implementation variables can be presented on a user interface or used to automatically generate a switch update transaction that implements the path. The method includes identifying variables that affect the determination of a least-cost path, receiving data values that correspond to the variables, and presenting the data values so that the path can be determined in response to observing the variables. Confidence and route testing can be conducted using the present invention.

The invention discloses a congestion control method and network nodes. The method comprises the following steps: acquiring a plurality of minimum cost paths from one network node to the other networknodes by the network node; computing the congestion index and the congestion tolerability of each grouping priority sequence which is transmitted on each output interface of the network nodes and needs ensuring time delay; judging whether various grouping priority sequences are congested or not according to the congestion index and the congestion tolerability; when the congestion occurs, selectingone output interface which is not congested from output interfaces corresponding to the minimum cost paths according to destination network nodes of various data streams carried by the congested grouping priority sequence; and transmitting the data stream of the congested grouping priority sequence through the grouping priority sequence of the output interface which is not congested. The embodiment of the invention fully utilizes forward resources in the network and ensures that the congested grouping priority sequence correctly transmits.

This invention concerns a method of determining a route using map data comprising a plurality of navigable paths, the map data divided into a plurality of regions. The method comprises using at least one processing apparatus to: receive an origin and a destination on the map data and a selection of one of a plurality of cost functions and determine a route from the origin to the destination using the map data and minimum cost data that identifies minimum cost paths between regions of the map data. The minimum cost data identifies more than one minimum cost path between a pair of the regions if different minimum cost paths exist between the pair of regions for different cost functions and determining a route comprises identifying from the minimum cost paths for the pair of regions comprising the origin and destination, the minimum cost path having a lowest cost for the selected cost function.

A distributional assessment system for assessing the job performance of individuals within an organization. A rater, uses the distributional assessment system to rate the performance of a ratee, such as an employee. The distributional assessment system guides the rater through a job function description process to generate a set of assigned weights and a best feasible performance rating. The weights and best feasible performance rating are used along with an actual performance rating to generate an overall distributional assessment of the ratee. The ratee may use the weights and distributional assessment to determine the lowest cost path to improving personal job performance. In addition, an organization can use aggregate distributional assessments to determine the overall performance rating of an organization and determine the lowest cost path to improving the organization's performance. Individual distributional assessments and new job function weights may be used to identify the most likely candidates for a job promotion.

The invention relates to a text message based waveform concatenation speech synthesis method. The text message based waveform concatenation speech synthesis method includes steps of S1, extracting acoustic parameters and text parameters of all elements in an original voice frequency through segment cutting, and training a duration prediction model and a weight prediction model according to extracted parameters; S2, using a layered pre-selection method to primarily pre-select the elements in a corpus to obtain candidate elements by means of a target element of text analysis and a duration predicted by the duration prediction model; S3, calculating the target element, the candidate elements, and weight information predicted by the weight prediction model to obtain a target cost; calculating Integrating degrees of two adjacent elements to obtain a concatenation cost; using a viterbi searching method to search the target cost and the concatenation cost to obtain a minimum cost path so as to further obtain an optimum element and obtain synthesis speeches through smooth concatenation.

A method edits an input video to produce an output video. Pixels of the input video are partitioned into sets of pixels, wherein the pixels in the sets are adjacent, and for each set of pixels performing the following steps. A trellis having nodes connected by directed links is constructed. Each node corresponds to one of the pixels in the set of pixels, and each node is associated with an action and location of the pixel in the output image. Costs are assigned to the nodes and the links, wherein the costs are on apparent motion in the input video. A least cost path is determined through the trellis. Then, for each node on the path, apply the action associated the node to the corresponding pixel in the input video to edit the corresponding pixel at the location in the output video associated with the node.

The invention provides a cooperative optimization method and system for an electrified traffic network and an electric system. The electrified traffic network of an electric car and the electric network are coupled, an initial path of the electric car and initial price parameters of charging stations are obtained, the position information and residual electric quantity information of the electric car are obtained in real time, a minimum-cost path of the electric car is searched for through a dijkstra algorithm according to the position information, the residual electric quantity information and the initial path of the electric car and the initial price parameters of the charging stations, the electric quantity required by each charging station is worked out, and the electric network is optimized through a Lagrangean relaxation algorithm. The electrified traffic network of the electric car and the electric system are coupled, on the one hand, the path optimization is solved through the dijkstra algorithm, and the sum of charging, transportation and time-consuming cost is reduced, and on the other hand, electric network feedback is optimized through the Lagrangean relaxation algorithm according to the electric quantity required by each charging station, and cooperative optimization of the electrified traffic network and the electric system is achieved.