38 results about "Dominating set" patented technology

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.

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.

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 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 inthe 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 multicasttree.