专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US07577108B2 Learning-based strategies for message-initiated constraint-based routing 有权
标题翻译：基于消息发起的基于约束的路由的基于学习的策略
公开(公告)号：US07577108B2
公开(公告)日：2009-08-18
申请号：US10453174
申请日：2003-06-03
申请人： Ying Zhang , Markus P. J. Fromherz , Yi Shang , Sergei Vassilvitskii , Lara S. Crawford
发明人： Ying Zhang , Markus P. J. Fromherz , Yi Shang , Sergei Vassilvitskii , Lara S. Crawford
IPC分类号： H04L12/28
CPC分类号： H04L45/16 , H04L45/08 , H04L45/12 , H04L45/123 , Y10S370/913
摘要： 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. The message that is routed within the network includes the address of a sending node, the address of the source node, route constraints, destination constraints, the number of route constraints, the number of destination constraints, message identification number, sequence identification number, and routing objectives.
摘要翻译：提出了一种在消息发起的基于约束的路由中用于在ad-hoc网络中的节点之间的数字消息通信中使用的基于学习的策略的方法，其中每个节点包括属性。该方法包括确定每个节点的本地属性并且定义关于属性的约束。提供每个节点访问每个相邻节点的属性。通过网络发送的每个消息都有一个消息类型，其中包括目的地规范，路由规范和客观规范。对每种消息类型执行约束检查和成本估算检查。成本估算用于收敛于最佳消息路径。在网络中路由的消息包括发送节点的地址，源节点的地址，路由约束，目的约束，路由约束的数量，目的约束的数量，消息标识号，序列识别号和路由目标。

2. 发明授权

US07577107B2 Protocol specification for message-initiated constraint-based routing 有权
标题翻译：消息发起的基于约束的路由的协议规范
公开(公告)号：US07577107B2
公开(公告)日：2009-08-18
申请号：US10453042
申请日：2003-06-03
申请人： Ying Zhang , Markus P. J. Fromherz , Lara S. Crawford , Yi Shang
发明人： Ying Zhang , Markus P. J. Fromherz , Lara S. Crawford , Yi Shang
IPC分类号： H04L12/28
CPC分类号： H04L45/00 , H04L45/124 , H04W40/10 , H04W40/12 , H04W40/20 , H04W40/246 , H04W40/248 , H04W40/26 , Y10S370/913
摘要： 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. The message that is routed within the network includes the address of a sending node, the address of the source node, route and destination constraints, the number of route constraints, the number of destination constraints, message identification number, sequence identification number, and routing objectives.
摘要翻译：提出了一种用于在ad-hoc网络中的节点之间的用于数字消息通信的消息发起的基于约束的路由的方法，其中每个节点包括具有属性值的属性。该方法包括确定ad-hoc网络中每个节点的本地属性并定义对属性的约束。提供每个节点对每个相邻节点的属性的访问，其中相邻节点是一跳的节点。通过自组织网络传输的每个消息都有一个消息类型，其中包括目的地规范，路由规范和客观规范。对每种消息类型执行约束检查和成本估算检查。在网络中路由的消息包括发送节点的地址，源节点的地址，路由和目的约束，路由约束的数量，目的约束的数量，消息标识号，序列标识号和路由目标

3. 发明授权

US07089221B2 Feedback control of problem solving 有权
标题翻译：解决问题的反馈控制
公开(公告)号：US07089221B2
公开(公告)日：2006-08-08
申请号：US10602193
申请日：2003-06-24
申请人： Markus P. J. Fromherz , Lara S. Crawford , Yi Shang
发明人： Markus P. J. Fromherz , Lara S. Crawford , Yi Shang
IPC分类号： G06N5/00
CPC分类号： G05B13/021
摘要： 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.
摘要翻译：用于复杂系统中实时应用的协同解决问题的反馈控制方法利用由控制变量参数化的求解器。该方法包括初始化时间设置和选择至少一个求解器参数值。求解器使用所选择的求解器参数值或指定的临时值进行操作，并检查操作条件。如果满足解决方案质量条件，则将解决方案传输到系统。如果解决方案质量条件不满足且性能差异不大于指定的阈值，求解器将继续运行。如果解决方案质量条件不满足，但是性能差异超过阈值，则至少选择一个替代求解器参数值，并且在指定的中间期使用新的求解器参数值操作求解器。求解器继续运行，直到解决方案质量满足为止。

4. 发明授权

US07089220B2 Complexity-directed cooperative problem solving 有权
标题翻译：复杂性导向的合作解决问题
公开(公告)号：US07089220B2
公开(公告)日：2006-08-08
申请号：US10602189
申请日：2003-06-24
申请人： Markus P. J. Fromherz , Yi Shang , Lara S. Crawford
发明人： Markus P. J. Fromherz , Yi Shang , Lara S. Crawford
IPC分类号： G06N5/00
CPC分类号： G06N99/005
摘要： 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.
摘要翻译：用于控制多个约束问题求解器的协作解决方法识别复杂度标准，其提供用于在约束问题解决器之间进行选择和转换的方向。该方法包括随机选择测试点并确定测试点是否满足第一复杂度标准。选择第一约束问题求解器，如果复杂度标准尚未得到满足，则由第一求解器识别替代测试点。如果备用测试点是一个问题解决方案，则将其传输到系统。如果替代测试点不是问题解决方案，或者如果原始随机选择的测试点满足复杂度标准，则第二约束求解器选择新的测试点。如果新的测试点是一个问题解决方案，它将被传送到系统; 如果新的测试点不是解决方案，则重新启动协作解决方案。

5. 发明授权

US07486627B2 Time-aware strategy for message-initiated constraint-based routing 有权
标题翻译：消息发起的基于约束的路由的时间感知策略
公开(公告)号：US07486627B2
公开(公告)日：2009-02-03
申请号：US10453750
申请日：2003-06-03
申请人： Ying Zhang , Markus P. J. Fromherz , Sergei Vassilvitskii , Yi Shang
发明人： Ying Zhang , Markus P. J. Fromherz , Sergei Vassilvitskii , Yi Shang
IPC分类号： H04L12/28
CPC分类号： H04L45/20 , H04L45/121 , H04L45/122 , H04L45/44 , H04L47/17 , H04W4/24 , H04W28/18 , H04W40/08 , H04W40/10 , H04W40/12 , H04W40/20 , H04W40/26 , H04W48/16 , H04W84/18
摘要： 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. The message that is routed within the network includes the address of a sending node, address of the source node, route constraints, destination constraints specified with a time bound, the number of route constraints, the number of destination constraints, message identification number, sequence identification number, and routing objectives.
摘要翻译：提出了一种在消息发起的基于约束的路由中利用的时间感知策略的方法，用于在ad-hoc网络中的节点之间的数字消息通信，其中每个节点包括属性。该方法包括确定每个节点的本地属性并且定义关于属性的约束。提供每个节点对每个相邻节点的属性的访问，其中相邻节点是一跳的节点。通过网络发送的每个消息都有一个消息类型，其中包括目的地规范，路由规范和客观规范。对每种消息类型执行约束检查和成本估算检查。在网络中路由的消息包括发送节点的地址，源节点的地址，路由约束，用时间限制指定的目的约束，路由约束的数量，目的约束的数量，消息标识号，序列识别号码和路由目标。

6. 发明申请

US20090044291A1 DROUGHT-RESISTANT PLANTS AND METHOD FOR PRODUCING THE PLANTS 审中-公开
标题翻译：抗旱植物和生产植物的方法
公开(公告)号：US20090044291A1
公开(公告)日：2009-02-12
申请号：US11846471
申请日：2007-08-28
申请人： Da-Peng Zhang , Yuan-Yue Shen , Xiao-Fang Wang , Fu-Qing Wu , Shu-Yuan Du , Zheng Cao , Yi Shang , Yan-Hong Xu
发明人： Da-Peng Zhang , Yuan-Yue Shen , Xiao-Fang Wang , Fu-Qing Wu , Shu-Yuan Du , Zheng Cao , Yi Shang , Yan-Hong Xu
IPC分类号： C12N15/54 , A01H5/00
CPC分类号： C12N15/8273 , C07K14/415 , C12N9/00 , C12N15/8293
摘要： 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.
摘要翻译：该应用提供了用于表达新近鉴定为脱落酸受体的植物基因产物的Mg-螯合酶的H亚基的重组表达盒。还提供了具有抗旱性的转基因植物和用于生产这种植物的方法。

7. 发明申请

US20050080924A1 Node localization in communication networks 有权
标题翻译：节点定位在通信网络中
公开(公告)号：US20050080924A1
公开(公告)日：2005-04-14
申请号：US10682754
申请日：2003-10-09
申请人： Yi Shang , Wheeler Ruml
发明人： Yi Shang , Wheeler Ruml
IPC分类号： G06F15/173 , G06K9/62 , H04L29/08
CPC分类号： G06K9/6251 , H04L67/12 , H04L67/18
摘要： 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.
摘要翻译：本文公开了一种用于在具有由节点路径分隔的多个节点的通信网络内导出节点定位信息的方法。该方法包括估计网络中多对节点之间的最短路径并构建包含估计的最短路径的矩阵。然后将多维缩放应用于矩阵，并且识别变换矩阵的最大特征向量。由此，通过利用特征向量来构建网络中节点对的位置的相对映射。

8. 发明授权

US07457860B2 Node localization in communication networks 有权
标题翻译：节点定位在通信网络中
公开(公告)号：US07457860B2
公开(公告)日：2008-11-25
申请号：US10682754
申请日：2003-10-09
申请人： Yi Shang , Wheeler Ruml
发明人： Yi Shang , Wheeler Ruml
IPC分类号： G06F15/16 , G06F15/177
CPC分类号： G06K9/6251 , H04L67/12 , H04L67/18
摘要： 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.
摘要翻译：本文公开了一种用于在具有由节点路径分隔的多个节点的通信网络内导出节点定位信息的方法。该方法包括估计网络中多对节点之间的最短路径并构建包含估计的最短路径的矩阵。然后将多维缩放应用于矩阵，并且识别变换矩阵的最大特征向量。由此，通过利用特征向量来构建网络中节点对的位置的相对映射。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式