337 results about "Depth-first search" patented technology

Systems and methods for providing a boundary scan test of a wired or wireless network having a plurality of network nodes are presented. The system includes a test station communicatively coupled with the network. The test station creates a MAC layer scan test route sequence that includes each link in the network and is independent of the routing mechanism and protocol used for the network. The test station also creates a test agent that is configured to traverse each link in the scan test route sequence. The test agent is then deployed on the network and information about a link is reported back to the test station after the test agent examines the link. The scan test route sequence can be created by sending out a series of broadcast messages from one or more nodes in the network, sequentially applying a network tour to cover the entire network, or performing a depth first search on the entire network.

The invention discloses a method and device for optimizing multi-constraint quality of service (QoS) routing selection. The method comprises the following steps: acquiring the topological structure and link parameters of an existing network in accordance with information of a prediction model; creating a corresponding multi-constraint QoS routing model in accordance with the determined topological structure and link parameters, and constructing penalty functions to transform multi-constraint conditions, as well as constructing fitness functions for evaluating paths; using a depth-first search method to acquire initial feasible paths and initializing particle swarms; calculating the fitness value of each particle, and finding out the optimal fitness value of the particle adjacent to each particle; using the generation algorithm and the genetic algorithm-particle swarm optimization (GA-PSO) to carry out iterative solution at the beginning of the initial feasible paths, and carrying out natural selection and variation operations; and finding out paths which meet conditions and are provided with the optimal fitness values, realizing optimal routing selection under the multi-constraint condition, and executing in accordance with the found routings.

A high-speed shape-based router is applicable to standard-cell digital designs, chip-level-block assembly designs, and other styles of design. In a flow of the invention, the technique establishes an initial structure for each net to be routed. Nets or parts of them are ordered. Each part of the net may be routed using a spine routing search, depth first search, or a space flood search, or any combination of these. Where sections fail or an error occurs, conflicts are identified, and the technique tries routing again.

The invention relates to a path planning method for mobile robots based on a particle swarm optimization algorithm. The prior path planning method for the mobile robots has single path selection and is easy to come to a dead end. The method comprises the concrete steps of: modeling the environment first; using a polygon to represent an obstacle; using a point to represent a robot, using a small square frame to represent the original position of the robot; and using a cross to represent a target point, wherein a starting point of the robot is marked as S, and the target point is marked as G; planning paths of the robot by utilizing the particle swarm optimization algorithm; and finally performing the deep first search on the planned paths. The method adds the deep first search into a polar coordinate particle swarm. By the method, the robot can effectively find one collision-free path in most of complex environments, and finally reach target points.

A system and method are described for ordering a database flush sequence prior to committing transaction changes to a database. In one embodiment, a plurality of data operations modifying persistent data objects are performed in a sequential order within an object-oriented environment. Relational dependencies between the persistent data objects are evaluated and the changes to the data objects are reordered based on the relational dependencies. Once reordered, the changes are committed to the database. In one embodiment, a depth first search algorithm is employed to determine the appropriate order to commit the data to the database.

A software testing method based on a model includes the following steps that S1, software to be tested is analyzed, and a test object and test characteristics are determined; S2, a UML model is selected and constructed; S3, verification is performed on the UML model, and correctness of the UML model is guaranteed; S4, traversal is performed on the UML model through a depth-first search algorithm, a test case is automatically generated, a relevant coverage rate is calculated according to sufficiency criteria such as a statement coverage criterion, a judgment coverage criterion, a condition coverage criterion and a route coverage criterion, so that assessment of the test case is finished; S5, a test script is generated according to a program to be tested and the test case obtained through the UML model, the test script is automatically executed, and an actual output result obtained through execution of the test script is stored; S6, according to comparison between actual output and anticipated output of the test case, a test result is obtained, and then according to the test object and a preset stopping criterion, whether the model or the program to be tested needs to be modified or not is determined.

A hybrid sphere decoding method is disclosed. Received data is processed to obtain preliminary parameters. M_bf layers are determined to use breadth-first search and M_df layers to use depth-first search. A search process is implemented based on the preliminary parameters, in which M_bf layers are searched using breadth-first search and M_df layers are searched using depth-first search.

A method for determining a target path for a model-based control system. The model-based control system includes a directed acyclic graph, where the directed acyclic graph includes a plurality of vertices interconnected by a plurality of edges. The method includes the steps of performing a depth-first search of the directed acyclic graph for the target path. The depth-first search is operative to return an explicit solution or an implicit solution, wherein the implicit solution is determined using a heuristic. The method further includes determining if the depth-first search returned an explicit solution or an implicit solution, and if the depth-first search returned an implicit solution, constructing the target path from the implicit solution. The method may further include constructing a pattern database.

One embodiment of the invention is a method of specifying routes for a group of nets. The method specifies a total cost. It then performs a first depth-first search to identify, for the group of nets, a complete routing solution that has a cost that does not exceed the total cost. A routing solution for a set of nets includes a route for each net in the set. If the search does not find the complete routing solution, the method then increments the total cost and performs a second depth-first search to identify a complete routing solution for the group of nets that has a cost that does not exceed the incremented total cost.

A system and method to integrate breadth-first and depth-first strategies in a single search technique or routine is provided. It combines the complementary strengths of both strategies to achieve significantly improved speed over either strategy used alone. The new algorithm can be used to efficiently find solutions to the treewidth problem that has applications in areas such as diagnosis using probabilistic inferences.

Database objects, having interdependent relationships, are transferred for replication from a publisher to a subscriber in the order of a topological sort using a depth first search algorithm. When the depth first search algorithm attempts to enumerate all outgoing edges (dependencies) of a given node (database object), a request is made to begin an atomic transaction and then a temporary copy (e.g., via a T-SQL command) of the node/database object is created under a different name. The temporary copy is used to store dependency information that could otherwise be impaired by the replication process. Dependencies amongst database objects are thus preserved during the replication process through use of the temporary copy, as well as by transferring the database objects according to the topological sort order.

Methods and apparatus are provided for discovering minimal conditional functional dependencies (CFDs). CFDs extend functional dependencies by supporting patterns of semantically related constants, and can be used as rules for cleaning relational data. A disclosed CFDMiner algorithm, based on techniques for mining closed itemsets, discovers constant minimal CFDs. A disclosed CTANE algorithm discovers general minimal CFDs based on the levelwise approach. A disclosed FastCFD algorithm discovers general minimal CFDs based on a depth-first search strategy, and an optimization technique via closed-itemset mining to reduce search space.

According to an embodiment of the present invention, a filer or other storage server is coupled to a network to store files for users of the network. An agent is coupled to the filer, and performs a scan or file walk for a Multi-Appliance Management Application (MMA) which is coupled to the filer and can monitor and manage the filer. The agent assigns identification (ID) numbers to the directories while scanning them. The ID numbers are assigned in a depth first search (DFS) order to reduce the amount of resources required for specific queries that may later be required. Several types of queries, including determining the parent of a node, determining all of the children of a node, determining the immediate children of a node, and determining all of the ancestors of a node may be easily accomplished using the ID numbers.

The invention discloses a search method for the shortest path passing through necessary vertices. The implementation steps are: (1) Construct a weighted directed graph that satisfies the path relationship; (2) Find the shortest path between the search starting point and each necessary vertex; (3) Determine whether the path exists; (4) If it exists , then use the necessary vertex as the new search starting point, and continue to search for the path; (5) if it does not exist, then go back to the previous necessary vertex, and select the next shortest path to continue searching; (6) search the last found necessary vertex to the destination The shortest path between vertices; (7) The path can be found by combining the shortest paths found between all necessary vertices. By comparing the present invention with the depth-first search method, the genetic method and the ant colony method through experiments, it can be found that the present invention has the advantages of fast solution speed, good stability and the like.

According to one embodiment, an information processing apparatus comprises a storage storing program modules and parallel execution control description describing relationships of the program modules, a conversion module extracting a part relating to the program module from the parallel execution control description, and creating graph data structure creation information including preceding and succeeding information of the program module, an adding module extracting graph data structure creation information to which the input data is given, creating a node, and adding the created node to a formerly created graph data structure, and an execution module subjecting the graph data structure to at least one of depth-first search and breadth-first search with a restricted breadth, selecting one node from nodes stored in the node memory, and executing a program module corresponding to the selected node.

The invention relates to the technology of topology analysis in the field of an electric power system, and specifically relates to a method for rapid topology analysis and the establishment of a topological island based on a graph theory. The method includes three steps: modeling, generating topology points, and generating the topological island. According to the method, topology analysis of the electric power system can be conducted via a graph theory recognition analysis method; advantages and disadvantages of breadth and depth first search algorithms can be comprehensively considered, and search advantages of depth first for a ring network are fully used; rapid topology analysis of the electric power network and the establishment of the topological island are realized, and the accuracy and rapidity of the topology analysis result of the electric power network are greatly improved.

The invention relates to the technical field of electric power system analysis and control and provides an online automatic generation method for a black-start scheme. The online automatic generation method comprises the following steps: acquiring a QS formatted file in an E language from 'intelligent power grid dispatching technical support system for state grid' through a file transmission protocol and analyzing the QS formatted file in a C# language; constructing a topology map by taking a node in the power grid as a vertex and a power transmission line or transformer as a border; adopting the shortest path algorithm or depth-first search algorithm for calculating a black-start recovering path from a power point to a to-be-recovered unit/load; calling ATP-EMTP and PSD-BPA7 for performing simulating calculation; introducing a class library Microsoft.Office.Interop.Word for automatically writing a simulated result into a Word file in the form of graph, word and table, thereby forming the black-start scheme. Compared with the existing method for forming the black-start scheme by manually adopting the tool, such as PSD-BPA or ATP-EMTP, which is time-wasting and labor-wasting and has the defect of inferior applicability of independently developed simulated program, the online automatic generation method has the advantage that the efficiency and credibility of the generated black-start scheme are increased. The online automatic generation method has significance in failure recovery of a power system.

A method and apparatus for performing a paging operation on a tree having a plurality of nodes is provided. A preorder number and a subtree size are maintained in a machine-readable medium for each of the plurality of nodes of the tree. The preorder number associated with a particular node of the tree identifies a position for the particular node in a depth-first search ordering of the plurality of nodes of the tree. The subtree size associated with a particular node of the tree identifies a count of all the nodes in a subtree rooted at the particular node. In response to receiving a request to perform a paging operation on the plurality of nodes of the tree, a set of nodes that satisfy the paging operation may be determined using the preorder number and the subtree size associated with each node of the tree.

The invention relates to a method for converting a ladder diagram into a PLC (Programmable Logic Controller) program command, which comprises the following steps of: 1, presenting a topological structure of a ladder diagram by using a directed graph; 2, traversing a transposed graph GL <T> by using a depth-first search method, storing a topological sorting relation of parallel-connection peaks and coil peaks in a queue Q; 3, carrying out breadth-first search on the parallel-connection peaks according to a connection relation of the directed graph GL, carrying out depth-first search on serial-connection peaks adjacently connected with the parallel-connection peaks, generating an AND expression of the directed graph GL on the whole serial-connection path and an OR expression of the serial-connection peaks; 4, generating a final expression of the maximum combining item of the parallel-connection peaks; 5, carrying out breadth-first search on a connection relation graph Gp by using the Q,figuring out an OR expression of the corresponding parallel-connection peaks and verifying, finally, constructing the maximum combining item into the AND expression to form a final result; 6, judgingwhether a queue Q' is empty; and 7, processing a starting peak. The invention can be widely applied to the process of converting the ladder diagram into the PLC program command.

The invention discloses a generating method for a power grid topological relationship based on Arcgis. The generating method comprises a step of achieving generating a power grid resource space connecting relationship automatically based on an Arcgis space analysis, and a step of generating a network topological relationship based on a depth preferential search. The technical proposal provided bythe invention automatically maintains the power grid resource space connecting relationship based on a space connecting relationship of Arcgis elements and service attributes of the elements, and uses a depth preferential algorithm to quickly generate the network topological relationship according to the correct connecting relationship. The technical proposal solves the problems that the maintenances for the connecting relationship of devices in the power grid are complicated and a network topology of the power grid is reconstructed after the power grid changes. The technical proposal is usedto solve the applications such as power supply tracing, a power supply range, a power supply radius, a power failure imitation and the like in a city power distribution grid.

The invention provides a network minimum path set determination method based on an adjacency list and aims to solve the problems about design simulation and performance evaluation of a large complex network system. The method mainly comprises the following two steps of: establishing a novel adjacency list according to a topological structure of a network; and traversing the adjacency list by using a depth-first search and backtracking combination method to determine all minimum paths. Nodes and links are not quantitatively restricted. The network minimum path set determination method based on the adjacency list is applicable to a directed network, an undirected network and a mixed network and has a wide application prospect in the large complex network systems such as power, communication, traffic, computers and municipal pipe networks.