35 results about "Least cost path" patented technology

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.

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.

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, 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.

A system and method of use resolves the frustration of repeated manual work during schema mapping. The system utilizes a transformation graph—a collection of nodes (unified attributes) and edges (transformations) in which source attributes are mapped and transformed. The system further leverages existing mappings and transformations for the purpose of suggesting to a user the optimal paths (i.e., the lowest cost paths) for mapping new sources, which is particularly useful when new sources share similarity with previously mapped sources and require the same transformations. As such, the system also promotes an evolving schema by allowing users to select which unified attributes they want to include in a target schema at any time. The system addresses the technical challenge of finding optimal transformation paths and how to present these to the user for evaluation.

The invention provides an intra-city trip service implementation method, device and system and relates to the technical field of navigation. The method comprises: acquiring a user's trip query request which carries a start location and a destination location; generating multiple segmented trip paths according to the start location, the destination location and multiple preset transfer locations, wherein every two adjacent path segments in each segmented trip path employ the corresponding transfer location as a connection point; matching vehicles for each path segment in each segmented trip path to obtain a shortest-time path, a least-cost path, and a least-transfer path; receiving the user's path selection information, and generating the user's trip orders for multiple paths according to the path selection information and vehicle information successfully matching with the selected path. Therefore, trip orders can be generated to maximum extent, car sharing is achieved, vehicle utilization efficiency is improved, fewer vehicles may run on the roads, traffic condition is improved, and trippers may arrive at their destinations sooner.

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 discloses a text information-based waveform concatenation voice synthesizing method. The method comprises the following steps: extracting acoustic parameters and text parameters of all primitives from original audio through sound segment segmentation, and training a time length prediction model and a weight prediction model according to the extracted parameters; performing layered pre-selection by adopting a layered pre-selecting method; performing primary pre-selection on the primitives in a language database by utilizing a target primitive analyzed from a text and the time length predicted by the time length prediction model to obtain candidate primitives; calculating the target primitive, the candidate primitives and the weight information predicted by the weight prediction model to obtain target cost; calculating the integrating degree between two adjacent primitives to obtain concatenation cost; searching the target cost and the concatenation cost by using a Viterbi search method to obtain the least cost path, so as to obtain an optimal primitive and a synthesized voice through smooth concatenation. According to the method, the voice synthesizing efficiency is improved; the real-time performance of the concatenation synthesis is enhanced; the prosodic features of the synthesized voice are improved.

Techniques for network routing and design are provided. A technique for determining a route for a demand in a network, wherein the network comprises primary paths and secondary paths, and at least two secondary paths may share a given link, comprises the following steps / operations. First, a graph representing the network is transformed. Edges of the graph represent channels associated with paths and nodes of the graph represent nodes of the network. The transformation is performed such that costs associated with the edges reflect costs of using channels in secondary paths. Then, the shortest path between nodes corresponding to the demand is found in the transformed graph. The shortest path represents the least-cost path in the network over which the demand may be routed. When the above route determination steps / operations result in a path with at least one loop, an alternative routing process may be executed so as to determine a loopless path for the demand. Further, integer linear program formulation design techniques are provided.

Methods and apparatuses are provided for searching a least-cost path between a source node and a destination node in a communication network. A set of costs associated with least-cost paths from the source node to a set of intermediate nodes is first determined. A least-cost path in a reverse direction from the destination node to an intermediate node is also determined. The intermediate node is selected based at least on a first cost associated with the least-cost path from the destination node to the intermediate node, and a second cost associated with a least-cost path from the source node to the intermediate node that was first determined. Accordingly, the least-cost path between the source node and the destination node might then be calculated by using the second cost as heuristic information.

A system and method includes accessing a road network database to identify a tire cost for a plurality of edges in a mining road network, identifying least-cost paths between each of a plurality of nodes on the mining road network using the tire cost for each of the plurality of edges, the nodes including a loading area and a dumping area for a plurality of haul trucks, accessing a distributed objects database to identify constraints for the nodes on the mining road network, determining a production plan using the constraints for the nodes on the mining road network by maximizing a function of the form αf′(x)-βg′(x), where f′(x) is a normalized measure of productivity, g′(x) is a normalized measure of impact on tire conditioning, and α and β, are nonnegative constants with α+β=1, subject to constraints on resource capacities and production requirements, with the material flow rates between each of the nodes on the mining road network specifying the production plan, determining a task assignment for each of the plurality of haul trucks using the production plan as guide, and transmitting the task assignment for each of the plurality of haul trucks.

When transmitting or receiving packets of mobile terminals for which movement information is managed by control devices, path costs that result from data-related factors for transmitting and receiving packets are calculated for each of paths that pass by way of the control devices and paths that do not pass by way of the control devices, processing costs that result from control-related factors for transmitting and receiving packets are calculated for each of paths that pass by way of the control devices and paths that do not pass by way of the control devices, the path costs and the processing costs that have been calculated are added for each of the paths that pass by way of the control devices and paths that do not pass by way of the control devices, the path for which the added cost is lowest is selected, and the transmission and reception of packets is carried out using the selected path.

A system and method are provided for establishing an automated routing environment in an electronic design automation (EDA) work flow for the routing of a circuit design. A user may merely specify a flow via pattern, a flow via location, and a start and end terminal and thereby, the auto router or path finder will automatically find the least-cost paths between each of the start terminals through at least one intermediate via of the flow via and ending at an end terminal. Upon successful routing of all needed terminals, an at least partially routed circuit design may be output.

In a multi-layer transport network, a method and related control plane allow automatic provisioning of a client layer connection (31, 32, 33, 24, 34, 35) over at least one server layer connection (11, 12, 13, 21, 22, 23, 14, 15, 16, 25, 26) by selecting a path through the transport network taking into account free resources of existing server layer connections (14, 15, 16, 25) and additionally taking into account free resources in the transport network, where no server layer connections exist so far. The selection is based on a cost calculation which takes into account a cost value per link and further takes into account an additional cost value for links on which no available server layer connection exist so far. Eventually, the path having the lowest overall cost is selected. Server layer connections (11, 12, 13, 21, 22, 23, 26) on links along said selected path where no server layer connection with free resources exists so far are then established and used to set up the requested client layer (31, 32, 33, 24, 34, 35) connection.

A telecommunications system includes an MPLS network. The system includes a source node in communication with the network. The system includes a destination node in communication with the network and with the source node through a plurality of different paths. Each path of which has a residual bandwidth at a given time. The source node forming a connection with the destination node at the given time across the path of the different paths as a function of residual bandwidth. A method for selecting a preferred LSP path from a set of equal cost paths. A method for sending packets in a telecommunications network. A software program for a management station or a switch.

There is described a method of managing routing paths, in particular multicast routing paths, in a content delivery network. The method includes determining, according to a unicast routing protocol, a first link cost for a first routing path and determining a second link cost for a second routing path, the second routing path comprising a first component comprising a link cost to a router that is part of a multicast group and a second component comprising a link cost for the multicast tree from the router. An adjustment factor is then determined based on information received from the content delivery network. The adjustment factor is applied to the second link cost. The adjusted second link cost and the first link cost are analyzed to determine an adjusted least cost path in the content delivery network and the adjusted second link cost is selectively output to a routing database to influence routing in the content delivery network.

A telecommunications system includes an MPLS network. The system includes a source node in communication with the network. The system includes a destination node in communication with the network and with the source node through a plurality of different paths. Each path of which has a residual bandwidth at a given time. The source node forming a connection with the destination node at the given time across the path of the different paths as a function of residual bandwidth. A method for selecting a preferred LSP path from a set of equal cost paths. A method for sending packets in a telecommunications network. A software program for a management station or a switch.

The invention discloses a vehicle path planning method based on an ADP algorithm. The method comprises the steps of obtaining cargo distribution center information, vehicle information and customer demand point information can be utilized; According to the acquired cargo distribution center information, vehicle information and customer demand point information , calculating the mutual distance between the cargo distribution center and each customer demand point, establishing a corresponding mathematical model, finding out a distribution path with the lowest cost by adopting an ADP algorithm, and then carrying out cargo distribution according to the path with the lowest cost.

A method for extracting levee line data based on high-resolution digital terrain automatically constructs a detection ring on the digital terrain along the advance direction of the levee for the leveehigh-resolution digital terrain data, searches out a grid unit with the highest elevation value in intersecting grids of the ring and the digital terrain, continues to construct the detection ring with the grid unit as the center of the ring until the levee digital terrain detection is completed, and constructs the high-precision levee line data by connecting the center point of the ring, therebyrealizing the automatic extraction of the levee line data. Compared with a traditional manual field mapping method, the method greatly improves the efficiency of data production of the levee line. Compared the least cost path analysis method, the matrix method, the vertical line method and the point matching normal line method are common to the current levee line data extraction, the method wellsolves the problem of the line data extraction abnormality caused by the damage to the levee. The method has great advantages in both line data extraction precision and extraction efficiency, and is asuperior levee line data extraction method.

A method and system for Chinese speech pitch extraction is disclosed. The method and system for Chinese speech pitch extraction comprises: pre-computing an anti-bias auto-correlation of a Hamming window function; for at least one frame, saving a first candidate as an unvoiced candidate, and detecting other voiced candidates from the anti-bias auto-correlation function; and calculating a cost value for a pitch path according to a voiced / unvoiced intensity function based on the unvoiced and voiced candidates, saving a predetermined number of least-cost paths, and outputting at least a portion of contiguous frames with low time delay.

The invention relates to a method of determining a route using map data comprising a plurality of navigable paths, the map data being divided into a plurality of regions. The method includes using at least one processing device to: receive an origin and a destination on the map data and a selection of one of a plurality of cost functions; and use the map data and identify regions of the map data The minimum cost data of the minimum cost path among them is used to determine the route from the origin to the destination. If different minimum-cost paths exist between a pair of said regions for different cost functions, said minimum-cost data identifies more than one minimum-cost path between said pair of regions, and determining a route includes starting from and including said origin and said The minimum cost path having the lowest cost for the selected cost function is identified among the minimum cost paths for the pair of regions to the destination.