38 results about "Dominating set" patented technology

A fast computer implemented method generates near-optimal solutions to the multi-objective inventory matching problem by solving for multiple objectives simultaneously and generating multiple non-dominating solutions. The method implements a multi-assignment backjumping algorithm that consists of three steps. The first step is a rappeling step in which a feasible solution is created by applying Iterative Bipartite Matching and maximum flow algorithm. Near-optimal feasible solutions are stored in a non dominated set. The second step is to use a multi-key sort to identify undesirable matches in a given feasible solution. The third step is backlifting the solution by removing undesirable matches from the feasible solution and places those undesirable matches on a no good set of matches. If the feasible solution is non-dominated, a copy is stored in a non-dominated set. The feasible solution is finally provided as input to the repelling step.

The invention is directed to a muscle trainer and methods for exercising a weaker of two sets of opposing muscles of a person moving an implement, such as a golf club, wherein, if the two sets of opposing muscles were of appropriate strength, the two sets of opposing muscles would desirably apply forces in opposite directions to the implement to assist in maintaining an ideal movement of the implement. In various embodiments, the invention provides methods for training the opposing sets of muscles to consistently move the implement in an ideal way to accomplish a useful or recreational function. The methods include: (a) moving the muscle trainer through an actual motion; (b) determining a difference between the actual motion and an ideal motion, where the difference indicates a dominating force direction in which the muscle trainer is being urged by the stronger or dominating set of muscles; (c) applying an external force to the muscle trainer to urge the muscle trainer in the dominating force direction; and (d) using the weaker or non-dominating set of muscles to urge the muscle trainer against the external force to thereby exercise the non-dominating set of muscles.

An embodiment of the invention discloses a collaboration caching method and system for a content center network. The method comprises enabling all nodes of the content center network to be divided into a plurality of subnetworks on the basis of a communication dominating set, enabling each subnetwork to comprise one dominating node and one or a plurality of non-dominating nodes, enabling each node to comprise one embedded cache, and enabling each dominating node to store content placing index information and content request transfer index information of the subnetwork where the dominating node is located; and synergizing all embedded caches on the basis of content caching placing and dynamic routing request. According to the embodiment, the subnetworks are divided on the basis of the communication set, content setting is related to heat on the basis of the network, dynamic routing is achieved through content placing/transfer index information, the request is routed to the targeted node nearby, synergistic caching is achieved, redundancy of network content is reduced, network expenditure is reduced simultaneously, and caching synergistic efficiency is improved.

The invention relates to the technical field of data acquisition control, in particular to a distributed data acquisition control platform system. The system comprises an upper application system, a central database, a service end data acquisition middleware and an embedded data acquisition control terminal, wherein the upper application system comprises a real-time service logic dominating set and a service interfacing module for calling the central database; the central database comprises a service logic dominating set and a basic datasheet; the service end data acquisition middleware comprises a service acquisition searching module, a data service regulation definition module, a basic data configuration module, an equipment remote management module and a communication middleware; and the embedded data acquisition control terminal comprises a drive command set, an equipment driving middleware, a client end application middleware and a universal communication module. The system can flexibly construct and reconstruct an application model according to a redefined operating flow, the service logic set and the configurable basic datasheet, and supports multiple communication modes, thereby having the advantages of flexible configuration, good expansibility and wide application range.

The invention provides a power grid dynamic observing method based on PMU (power management unit) data. On the basis of PMU point distribution optimizing and in combination with the network topology information after EMS/SCADA (energy management system/supervisory control and data acquisition) state estimation, dynamic observation of the whole power grid can be achieved, and complete, reliable and real-time information is provided for a power grid advanced application analyzing function. In combination with C/S and B/S architectures, the dynamic monitoring and analyzing results are visually displayed to a dispatcher in a two-dimensional or three-dimensional manner to assist decision making. The method has the advantages that a power grid modal analysis method is combined, the coupling relation of active power and voltage phase angle is considered, the minimal dominating set algorithm is used, and the realized PMU point distribution method can actually and accurately reflect the stable weak areas of the current power grid; the EMS/SCADA data after state estimation is analyzed and correlated with PMU configuration data in a mapping manner to form mixed data, and reliable and accurate data source is provided for subsequent analysis.

A method is disclosed for determining a minimum connected dominating set in a graph, the method comprising obtaining an indication of an input graph, the input graph comprising a plurality of nodes and a plurality of edges; generating a distance table comprising for each node of the input graph, an indication of a distance between the given node and each of the other node of the plurality of nodes; generating a corresponding constrained binary quadratic programming problem using the generated distance table; providing the corresponding constrained binary quadratic programming problem to a quantum annealing solver; obtaining at least one approximate solution from the quantum annealing solver; post-processing the at least one approximate solution and providing the post-processed at least one approximate solution.

Method, apparatus and product for test selection based on domination criterion. In some embodiments, excluding from a test suite dominated tests, each of which is dominated by a predetermined number of dominating tests, wherein a dominated test is dominated by a dominating test if each target that is covered by the dominated test is also covered by the dominating test. In some embodiments, a reduced test suite is determined by excluding from a test suite each test that covers a dominated set of targets that is N-dominated by the reduced test suite, wherein a dominated set of targets is N-dominated by a set of tests if each target in the dominated set of targets is covered by at least N tests in the set of tests, wherein N is a predetermined number greater than one.

The invention discloses a method for recovering wireless sensor network connectivity and mainly solves the problem that connectivity loss, caused by node faults, of a wireless sensor network influences the safety reliability of the network. The method is applicable to the dynamic-topological-relation wireless sensor network. The method has the advantages that a finite-state machine model is used to screen and communicate with a dominating set, the state of a node is updated in real time, and an optimal replacement node is selected according to node criticality and distance to replace an original faulted node so as to recover the network state; the method distinguishes node criticality, network energy consumption is reduced, the node state is updated in real time, and the method is adaptive to a dynamic network topology environment.

The invention discloses a satellite network multicast routing method and system based on a minimum connected dominating set. The method comprises the following steps: obtaining specific parameters of a three-layer satellite network, and simulating the operation condition of a satellite in the STK software to obtain an on-off condition table of a satellite node within a whole period; constructing a space-time diagram model by time slot division based on the on-off condition table to obtain time link information and space link information of the satellite network; and performing multicast routing service by using a preset MCDS routing algorithm based on the minimum connected dominating set according to the obtained time link information and the space link information of the satellite network. By adoption of the satellite network multicast routing method and system, the waste of resources is reduced, the broadcast storm is avoided, the routing cost caused by the increase of node number under the condition of a single time slot is reduced, and in the case that the number of the time slots is increased, the routing cost is also effectively reduced, and a balance is obtained between two performance index, that is the routing cost and the end-to-end hop number, and in addition, the implementation complexity of the algorithm is low.

The invention belongs to a route optimization technique in wireless network communication, relates to the problem of saving energy and bandwidth resource consumption of the wireless broadcast transmission in a wireless network, and provides a construction method for a distributive multicast tree with minimized network communication resource consumption based on the problem of MCDS (minimum connected dominating set) in a graph theory. Based on the established multicast tree, the MCDS approximation algorithm-based multicast route method with minimized resource consumption finds a maximum independent set MIS, and then finds all MIS nodes connected with of a dominating node set so as to obtain a dominating multicast tree. The method optimizes the resource consumption of the multicast communication in the communication network. Due to the broadcasting nature of a wireless medium, the bandwidth and energy consumption in the multicast communication mainly depends on the message relay times in the multicast tree. Therefore, the method achieves the aim of reducing the network resource consumption through the reduction of the number of the nodes undertaking the relay mission in the multicast tree.

The invention relates to a method and device for collecting data by sink nodes of a wireless sensor network, belonging to the technical field of network communication. The method comprises the following steps of: firstly, generating a network topology of sensor nodes according to position information and communication radiuses of the sensor nodes and determining a minimum connected dominating set according to the generated network topology; then acquiring the shortest traversal path length of the minimum connected dominating set according to a TSP (Travelling Salesman Problem); and finally, if the shortest traversal path length of the minimum connected dominating set is smaller than or equal to a threshold value, considering the minimum connected dominating set as a sink node set, and collecting data of all sink nodes in the sink node set through the shortest traversal path of the minimum connected dominating set. According to the embodiment of the invention, multi-hop transmission of a wireless sensor is effectively reduced under the condition of ensuring the data delay requirement in the sensor network, the data transmission accuracy is ensured and the energy consumption is reduced.

The invention relates to a problem of minimizing the cost of a multicast routing forwarding structure in an AdHoc network, and construction of a delay limit multicast forwarding structure in a wireless network based on an MCDS (minimum connected dominating set) algorithm in a graph theory. According to particularity of a wireless signal transmission method, the cost and delay function in the wireless multicast routing are redefined. In the method for constructing the delay limit multicast forwarding structure based on the vertex coloring ideas in the graph theory, which is proposed based on the MCDS theory in the graph theory, by solving the MCDS, the purpose of constructing a multicast routing structure with the minimum cost is achieved, the concept of multicast routing delay limit is proposed, and the MCDS is constructed under the constraint. The algorithm is proved to be correct by the theoretical derivation, and the algorithm is proved to be effective by a lower approximate ratio compared with the similar algorithm. At the same time, the algorithm has a time complexity of O(n) and a message complexity of O(n), thus the high efficiency of the algorithm is proved further; and the algorithm has the advantage of adapting to flexible Adhoc networks.

The invention discloses a highly efficient directional charger arranging method, which comprises the following steps: 1) arranging N chargeable sensors in a two-dimensional area, whose positions are known and M directional wireless chargers are about to be arranged; 2) conducting discretization to the entire two-dimensional area for multiple sub-areas so that the number of the candidate points for the multiple wireless chargers is made finite and the purpose of doing so is to ensure that the interface power of each sub-area after discretization can be close to a constant value; 3) for each sub-area, obtaining all possible sets of sensors that can be covered by the chargers in the sub-area; 4) obtaining the locations of all chargers and their direction combinations by discretizing the planar areas and after the covered dominating set extraction of each sub-area. and 5) continuing to select, combine and arrange the chargers from all positions and direction combinations so as to maximize the overall charging effect of a network.

The invention discloses a distribution network reactive power optimization method and a device based on a multi-objective mixed big bang algorithm. The method comprises steps: the objective function value of each fragment solution in the current population is calculated and acquired, and the first non-dominating set in the current population is determined; whether the number of iterations corresponding to the current population is smaller than the maximum iteration number is judged; if yes, an updating formula based on the multi-objective mixed big bang algorithm is used to carry out converge explosion on the current population, a new population is generated, and the objective function value of each fragment solution in the new population is calculated and acquired; and a second non-dominating set is updated. The updating formula based on the multi-objective mixed big bang algorithm is used to carry out converge explosion on the current population, the new population is generated, the population diversity can be improved by using the multi-objective mixed big bang algorithm, the fragment solution is guided to jump out of local optimum, the convergence speed is improved, and the convergence speed and the calculation accuracy of the distribution network reactive power optimization calculation are further improved.

A method for extract dominating set information of time sequence data belongs to that information extraction field of Internet and Internet of things. The method solves the problem that the existing temporal data extraction methods cannot meet the needs of large-scale storage and high real-time information extraction. At first, the user with dominating ability is selected from the mass user big data, and the other users are taken as the associate users of the users with dominating ability, and the transformation function I from the dominating user to the associated user is established; then, in the face of continuously collected user timing data, the dominant user data is stored as small data, and the transform function I is updated dynamically. By dominating the user data and the updatedtransform function I, the data information of the associated user satisfying the user requirements is extracted, so that the big data information represented by the associated user data is extracted from the small data represented by the dominating user data. Mainly used in the Internet, the Internet of things and other information extraction related fields.

The invention discloses an Ad Hoc peer-to-peer network center-less distributed quick corecognition method. The method comprises the steps of allocating non-dominated nodes, which are not repeated, of a whole network to each of dominated set nodes to take as independent neighboring nodes of the dominated set nodes, and then by virtue of a dominated set, performing distributed corecognition calculation of network node state values and sharing a final corecognition result to the whole network. By employing the method, the rapid convergence of a distributed corecognition calculation result can be implemented, the convergent result is accurate and stable and the network does not need to have a central node; through the method, an algorithm can achieve stable convergence via a round of the calculation, and the global original information of the network is not needed, such that the calculation complexity is small, and the problems that the iterative times in a previous center-less distributed iterative algorithm cannot be determined, the node interactive traffic is large, the convergent result is unstable and the like are avoided; and therefore, the energy consumption of the nodes can be saved, the traffic and the node calculation burden are reduced, the service life of the network is prolonged, the network delay is effectively reduced, and the real-time capability is good.

The invention discloses a multi-objective robust optimal allocation method for suppressing fluctuation of renewable energy. First of all, it aims at the uncertainty of the actual response of renewableenergy power generation and DR, Analyze the types of demand-side response resources, a robust interval model of available capacity is established, on this basis, Considering the fluctuation of grid-connected power of renewable energy generation, DR Resource Availability, A multi-objective robust optimal allocation model of multi-modal DR resources in smart distribution network is established to minimize the operating cost and maximize the utilization of renewable energy, and the complementarities of DR resources in different time scales are considered emphatically. To solve the above optimization problem, a non-dominated set ranking multi-objective genetic algorithm with elite strategy is used.

The invention discloses an underwater AUV path forming method based on Dirichlet vertexes. The method comprises the following steps: 1, generating AUV data collection points of a Dirichlet structure; 2, describing a dominating relation of a Dirichlet vertex to a sensor node; 3, reducing AUV data collection points by adopting a dominating set theory; and 4, obtaining an optimized path. According to the method, the length of a moving path can be reduced on the basis of ensuring complete collection of whole network data, so that the network energy consumption can be reduced, the moving speed of the underwater AUV can be improved, and an optimized path can be formed.

The invention relates to an Ad Hoc network virtual backbone node identification method, which belongs to the technical field of communication and solves the problem that the Ad Hoc network backbone nodes cannot be effectively identified in the prior art. The Ad Hoc network virtual backbone node identification method comprises the following steps: distinguishing and locating the nodes in the Ad Hocnetwork through a radio locating method, so as to obtain the number of the nodes, the location information of the nodes, and the size of the node deployment area; obtaining an important communicationdistance according to the number of the nodes and the size of the node deployment area; performing network physical topology inference according to the location information of the nodes and the important communication distance; and performing identification on the virtual backbone nodes using a unified connected dominating set according to the result of the network physical topology inference. The Ad Hoc network virtual backbone node identification method realizes automatic identification of the virtual backbone nodes in the Ad Hoc network. The result obtained by the Ad Hoc network virtual backbone node identification method is beneficial to the protection of the backbone nodes in the network, and improves the overall performance of the Ad Hoc network by improving the operational capability and information processing capability of the backbone nodes.

The invention discloses a content-oriented network caching method. The method comprises the following steps that: a base station defines virtual communities and selects virtual community management nodes in each update period; the base station selects an independent set by using a network topology formed by the virtual community management nodes; the base station randomly selects a virtual community corresponding to the independent set for performing content caching; the base station informs the selected virtual community to perform content caching, and transmits content to a corresponding virtual community management node; the virtual community management node receiving a content caching instruction selects a node for caching the content by using a generalized dominating set algorithm; the virtual community management node informs the selected node to cache the content, and transmits the content to the node; and the selected node caches the content.

The invention discloses a negative public opinion monitoring and guiding method, an electronic device and a computer storage medium. According to the present invention, the tree decomposition is carried out on the graph structures G among the social platform users, then a dynamic programming algorithm is utilized to solve a complete P-dominated set D of the graph structures G, and the users corresponding to nodes in the complete P-dominated set D are the users on a key monitoring user list in the graph structures G. Because the user corresponding to the node in the complete P-dominated set D is the person with the most friends in a region where the user is located, a message can be spread to a whole network as soon as possible through the users on the key monitoring user list, so that theburden of the manual review is reduced, and the monitoring of the social network in the village and town area can be considered manually. A key monitoring list is determined through the complete P-dominated set D, so that the omission of the social network information of the region can be reduced.