Abstract: Provided is a StSCI protein for changing the self-incompatibility of diploid potato materials, wherein the amino acid sequence of the StSCI protein includes or consists of the following sequence: 1) the amino acid sequence represented by SEQ ID NO: 1; or 2) a functional homologous sequence having at least 95% sequence identity with the amino acid sequence represented by SEQ ID NO: 1; or 3) a protein in which one or more (e.g., 1-10) amino acids are added, deleted, or replaced in the amino acid sequence represented by SEQ ID NO: 1 and has the activity of inhibiting self-incompatibility. The advantage of the application is that the StSCI protein may inhibit the cytotoxicity of multiple types of S-RNase, which is hereditary and fundamentally overcomes the defect of self-incompatibility of diploid potatoes, thereby facilitating to realize the cultivation of a high-generation homozygous inbred line of diploid potatoes.

Abstract: The present application relates to the technical field of genetic breeding, and provides a method for identifying whether a diploid potato is self-compatible. The method relates to identifying whether a StSCI gene in the diploid potato is transcribed and expressed. Also disclosed is a method for identifying whether a StSCI gene is expressed by using molecular marker, and a method of screening for the molecular marker, which includes: obtaining the genome sequence information of parental materials, screening for difference sites of the parental materials, screening for the molecular marker, and identifying whether the screened molecular marker are usable. As for the identification of the self-compatibility of a diploid potato by using the screened molecular marker, the identification workload is small, a lot of time is saved, and the identification result is not affected by the environment, and it is accurate and reliable.

Abstract: A method for implementing a many-to-one concurrent transmission medium access control (MAC) protocol for underwater acoustic networks, including: initializing a network; setting a timer; initiating, by a receiving node, a control frame to perform handshakes with multiple nodes; exchange ID, level and location of the receiving node and a sending node, and counting the number of nodes that generate a sending notification (SN) message before timeout; and planning, by the receiving node, a receiving scheduling time of data from different nodes according to the number of successful handshake nodes, distance from each sending node to the receiving node, and data packet size; and performing data transmission.

Abstract: Index values of monitored objects are stored. Sets of index values, collected at time points within a time period and each including a first number of index values corresponding to a respective monitored object, are received. For each set, a second number of index values is selected from the first number to generate sets of reduced index values for storage. The second number to be used for reduction of subsequent index values is updated at least once, the updating comprising: generating a first list of monitored objects based on the sets of index values, generating a second list of monitored objects based on the sets of reduced index values, and updating the second number based on a comparison between the first list and the second list. The amount of monitoring data stored is reduced while enabling accurate searching for top-ranked monitored objects.

Abstract: A method for implementing a many-to-one concurrent transmission medium access control (MAC) protocol for underwater acoustic networks, including: initializing a network; setting a timer; initiating, by a receiving node, a control frame to perform handshakes with multiple nodes; exchange ID, level and location of the receiving node and a sending node, and counting the number of nodes that generate a sending notification (SN) message before timeout; and planning, by the receiving node, a receiving scheduling time of data from different nodes according to the number of successful handshake nodes, distance from each sending node to the receiving node, and data packet size; and performing data transmission.

Abstract: The present application relates to the technical field of genetic breeding, and provides a method for identifying whether a diploid potato is self-compatible. The method relates to identifying whether a StSCI gene in the diploid potato is transcribed and expressed. Also disclosed is a method for identifying whether a StSCI gene is expressed by using molecular marker, and a method of screening for the molecular marker, which includes: obtaining the genome sequence information of parental materials, screening for difference sites of the parental materials, screening for the molecular marker, and identifying whether the screened molecular marker are usable. As for the identification of the self-compatibility of a diploid potato by using the screened molecular marker, the identification workload is small, a lot of time is saved, and the identification result is not affected by the environment, and it is accurate and reliable.

Abstract: Provided is a StSCI protein for changing the self-incompatibility of diploid potato materials, wherein the amino acid sequence of the StSCI protein includes or consists of the following sequence: 1) the amino acid sequence represented by SEQ ID NO: 1; or 2) a functional homologous sequence having at least 95% sequence identity with the amino acid sequence represented by SEQ ID NO: 1; or 3) a protein in which one or more (e.g., 1-10) amino acids are added, deleted, or replaced in the amino acid sequence represented by SEQ ID NO: 1 and has the activity of inhibiting self-incompatibility. The advantage of the application is that the StSCI protein may inhibit the cytotoxicity of multiple types of S-RNase, which is hereditary and fundamentally overcomes the defect of self-incompatibility of diploid potatoes, thereby facilitating to realize the cultivation of a high-generation homozygous inbred line of diploid potatoes.

Abstract: Index values of monitored objects are stored. Sets of index values, collected at time points within a time period and each including a first number of index values corresponding to a respective monitored object, are received. For each set, a second number of index values is selected from the first number to generate sets of reduced index values for storage. The second number to be used for reduction of subsequent index values is updated at least once, the updating comprising: generating a first list of monitored objects based on the sets of index values, generating a second list of monitored objects based on the sets of reduced index values, and updating the second number based on a comparison between the first list and the second list. The amount of monitoring data stored is reduced while enabling accurate searching for top-ranked monitored objects.

Abstract: A method is presented for message-initiated constraint-based routing for digital message communication among nodes in an ad-hoc network, in which each node includes attributes having attribute values. The method includes determining local attributes for each of the nodes in the ad-hoc network and defining constraints on the attributes. Each node is provided access to the attributes of each neighboring node, with a neighboring node being a node that is one hop away. Each message transmitted over the ad-hoc network has a message type, which includes a destination specification, route specification, and objective specification. Constraint checking and cost estimation checking are performed for each message type.

Abstract: A method is presented for a learning-based strategy utilized within message-initiated constraint-based routing for digital message communication among nodes in an ad-hoc network, in which each node includes attributes. The method includes determining local attributes for each of the nodes and defining constraints on the attributes. Each node is provided access to the attributes of each neighboring node. Each message transmitted over the network has a message type, which includes a destination specification, route specification, and objective specification. Constraint checking and cost estimation checking are performed for each message type. Cost estimation is utilized to converge on an optimal message path.

Abstract: This application provides a recombinant expression cassette for expressing the H subunit of Mg-chelatase, a plant gene product that is newly identified as an abscisic acid receptor. Also provided are a transgenic plant with drought-resistance and a method for producing such plants.

Abstract: A method is presented for a time-aware strategy utilized within message-initiated constraint-based routing for digital message communication among nodes in an ad-hoc network, in which each node includes attributes. The method includes determining local attributes for each of the nodes and defining constraints on the attributes. Each node is provided access to the attributes of each neighboring node, with a neighboring node being a node that is one hop away. Each message transmitted over the network has a message type, which includes a destination specification, route specification, and objective specification. Constraint checking and cost estimation checking are performed for each message type.

Abstract: Disclosed herein is a method for deriving node localization information within communication networks having a plurality of nodes, which are separated by node paths. The method includes estimating the shortest path between multiple pairs of nodes in the network and constructing a matrix encompassing the estimated shortest paths. Multidimensional scaling is then applied to the matrix and the largest eigenvectors of the transformed matrix are identified. From this is constructed a relative map of the location of the pairs of nodes within the network by utilization of the eigenvectors.

Abstract: A method for feedback control of cooperative problem solving for real-time applications in complex systems utilizes solvers parameterized by control variables. The method includes initializing the time setting and selecting at least one solver parameter value. The solver is operated with the selected solver parameter value or values for a specified interim and the operational conditions are reviewed. A solution is transmitted to the system if a solution quality condition is satisfied. The solver continues to operate if the solution quality condition is not satisfied and the performance differential is not greater than a specified threshold. If the solution quality condition is unsatisfied, but the performance differential exceeds the threshold, at least one alternate solver parameter value is selected and the solver is operated with the new solver parameter value for a specified interim. The solver continues to operate until the solution quality condition is satisfied.

Abstract: A cooperative solving method for controlling a plurality of constraint problem solvers identifies complexity criteria, which provide direction for selecting and for transitioning between constraint problem solvers. The method includes randomly selecting a test point and determining whether the test point satisfies a first complexity criterion. A first constraint problem solver is selected, and an alternate test point is identified by the first solver if the complexity criterion has not been satisfied. If the alternate test point is a problem solution, it is transmitted to the system. If the alternate test point is not a problem solution or if the original randomly-selected test point satisfies the complexity criterion, a second constraint solver selects a new test point. If the new test point is a problem solution, it is transmitted to the system; if the new test point is not a solution, the cooperative solver is restarted.

Abstract: Disclosed herein is a method for deriving node localization information within communication networks having a plurality of nodes, which are separated by node paths. The method includes estimating the shortest path between multiple pairs of nodes in the network and constructing a matrix encompassing the estimated shortest paths. Multidimensional scaling is then applied to the matrix and the largest eigenvectors of the transformed matrix are identified. From this is constructed a relative map of the location of the pairs of nodes within the network by utilization of the eigenvectors.

Abstract: A method for feedback control of cooperative problem solving for real-time applications in complex systems utilizes solvers parameterized by control variables. The method includes initializing the time setting and selecting at least one solver parameter value. The solver is operated with the selected solver parameter value or values for a specified interim and the operational conditions are reviewed. A solution is transmitted to the system if a solution quality condition is satisfied. The solver continues to operate if the solution quality condition is not satisfied and the performance differential is not greater than a specified threshold. If the solution quality condition is unsatisfied, but the performance differential exceeds the threshold, at least one alternate solver parameter value is selected and the solver is operated with the new solver parameter value for a specified interim. The solver continues to operate until the solution quality condition is satisfied.

Abstract: A cooperative solving method for controlling a plurality of constraint problem solvers identifies complexity criteria, which provide direction for selecting and for transitioning between constraint problem solvers. The method includes randomly selecting a test point and determining whether the test point satisfies a first complexity criterion. A first constraint problem solver is selected, and an alternate test point is identified by the first solver if the complexity criterion has not been satisfied. If the alternate test point is a problem solution, it is transmitted to the system. If the alternate test point is not a problem solution or if the original randomly-selected test point satisfies the complexity criterion, a second constraint solver selects a new test point. If the new test point is a problem solution, it is transmitted to the system; if the new test point is not a solution, the cooperative solver is restarted.

Abstract: A method is presented for message-initiated constraint-based routing for digital message communication among nodes in an ad-hoc network, in which each node includes attributes having attribute values. The method includes determining local attributes for each of the nodes in the ad-hoc network and defining constraints on the attributes. Each node is provided access to the attributes of each neighboring node, with a neighboring node being a node that is one hop away. Each message transmitted over the ad-hoc network has a message type, which includes a destination specification, route specification, and objective specification. Constraint checking and cost estimation checking are performed for each message type.

Abstract: A method is presented for a learning-based strategy utilized within message-initiated constraint-based routing for digital message communication among nodes in an ad-hoc network, in which each node includes attributes. The method includes determining local attributes for each of the nodes and defining constraints on the attributes. Each node is provided access to the attributes of each neighboring node. Each message transmitted over the network has a message type, which includes a destination specification, route specification, and objective specification. Constraint checking and cost estimation checking are performed for each message type. Cost estimation is utilized to converge on an optimal message path.