-
公开(公告)号：US20090327492A1
公开(公告)日：2009-12-31
申请号：US12128959
申请日：2008-05-29
IPC分类号： G06F15/16
CPC分类号： G06Q10/06 , G06F11/3414 , G06Q10/10
摘要： A system and method for workload generation include a processor for identifying a workload model by determining each of a hierarchy for workload generation, time scales for workload generation, and states and transitions at each of the time scales, and defining a parameter by determining each of fields for user specific attributes, application specific attributes, network specific attributes, content specific attributes, and a probability distribution function for each of the attributes; a user level template unit corresponding to a relatively slow time scale in signal communication with the processor; an application level template corresponding to a relatively faster time scale in signal communication with the processor; a stream level template corresponding to a relatively fastest time scale in signal communication with the processor; and a communications adapter in signal communication with the processor for defining a workload generating unit responsive to the template units.
摘要翻译： 用于工作负载生成的系统和方法包括：通过确定工作负载生成的层次结构，工作负载生成的时间标度以及每个时间尺度上的状态和转换来确定工作负载模型的每个处理器，以及通过确定每个 针对用户特定属性的字段，应用特定属性，网络特定属性，内容特定属性以及每个属性的概率分布函数; 用户级模板单元，其对应于与处理器进行信号通信的相对较慢的时标; 应用级模板对应于与处理器进行信号通信的相对较快的时间尺度; 对应于与处理器进行信号通信的相对较快的时标的流级模板; 以及与处理器进行信号通信的通信适配器，用于响应于模板单元来定义工作量生成单元。
-
公开(公告)号：US08924189B2
公开(公告)日：2014-12-30
申请号：US12128959
申请日：2008-05-29
IPC分类号： G06F11/34 , G06G7/48 , G06F15/173 , G06Q10/06 , G06Q10/10
CPC分类号： G06Q10/06 , G06F11/3414 , G06Q10/10
摘要： A system and method for workload generation include a processor for identifying a workload model by determining each of a hierarchy for workload generation, time scales for workload generation, and states and transitions at each of the time scales, and defining a parameter by determining each of fields for user specific attributes, application specific attributes, network specific attributes, content specific attributes, and a probability distribution function for each of the attributes; a user level template unit corresponding to a relatively slow time scale in signal communication with the processor; an application level template corresponding to a relatively faster time scale in signal communication with the processor; a stream level template corresponding to a relatively fastest time scale in signal communication with the processor; and a communications adapter in signal communication with the processor for defining a workload generating unit responsive to the template units.
摘要翻译： 用于工作负载生成的系统和方法包括：通过确定工作负载生成的层次结构，工作负载生成的时间标度以及每个时间尺度上的状态和转换来确定工作负载模型的每个处理器，以及通过确定每个 针对用户特定属性的字段，应用特定属性，网络特定属性，内容特定属性以及每个属性的概率分布函数; 用户级模板单元，其对应于与处理器进行信号通信的相对较慢的时标; 应用级模板对应于与处理器进行信号通信的相对较快的时间尺度; 对应于与处理器进行信号通信的相对较快的时标的流级模板; 以及与处理器进行信号通信的通信适配器，用于响应于模板单元来定义工作量生成单元。
-
公开(公告)号：US20140067254A1
公开(公告)日：2014-03-06
申请号：US13600996
申请日：2012-08-31
申请人： Michele Berlingerio , Adi I. Botea , Eric P. Bouillet , Francesco Calabrese , Lea A. Deleris , Donna L. Gresh , Olivier Verscheure
发明人： Michele Berlingerio , Adi I. Botea , Eric P. Bouillet , Francesco Calabrese , Lea A. Deleris , Donna L. Gresh , Olivier Verscheure
IPC分类号： G01C21/34
CPC分类号： G01C21/36 , G01C21/26 , G01C21/3423 , G01C21/343 , G08G7/00
摘要： Embodiments of the disclosure include a computer system for journey planning, the computer system includes a journey planning server configured to perform a method. The method includes receiving a journey planning request, the journey planning request having an origin and a destination in a transportation network. The method also includes calculating an optimized journey plan by identifying a plurality of routes through the transportation network from the origin to the destination and determining an uncertainty associated with each of the plurality of routes. Calculating an optimized journey plan also includes evaluating a robustness of each of the plurality of routes to the uncertainty associated with each of the plurality of routes and selecting the optimized journey plan based on the journey planning request and the robustness of each of the plurality of routes.
摘要翻译： 本公开的实施例包括用于旅程规划的计算机系统，该计算机系统包括被配置为执行方法的行程规划服务器。 该方法包括接收旅程规划请求，旅程规划请求具有运输网络中的起点和目的地。 该方法还包括通过识别通过运输网络从原点到目的地的多条路线来计算优化的行驶计划，并且确定与多条路线中的每条路线相关联的不确定性。 计算优化的旅程计划还包括将多个路线中的每一条路线的鲁棒性评估为与多条路线中的每条路线相关联的不确定性，并且基于行程规划请求和多条路线中的每条路线的鲁棒性来选择优化的行驶计划 。
-
公开(公告)号：US09829334B2
公开(公告)日：2017-11-28
申请号：US13617065
申请日：2012-09-14
申请人： Michele Berlingerio , Adi I. Botea , Eric P. Bouillet , Francesco Calabrese , Lea A. Deleris , Donna L. Gresh , Olivier Verscheure
发明人： Michele Berlingerio , Adi I. Botea , Eric P. Bouillet , Francesco Calabrese , Lea A. Deleris , Donna L. Gresh , Olivier Verscheure
CPC分类号： G01C21/36 , G01C21/26 , G01C21/3423 , G01C21/343 , G08G7/00
摘要： Embodiments of the disclosure include a method for journey planning including receiving a journey planning request, the journey planning request having an origin and a destination in a transportation network. The method also includes calculating an optimized journey plan by identifying a plurality of routes through the transportation network from the origin to the destination and determining an uncertainty associated with each of the plurality of routes. Calculating an optimized journey plan also includes evaluating a robustness of each of the plurality of routes to the uncertainty associated with each of the plurality of routes and selecting the optimized journey plan based on the journey planning request and the robustness of each of the plurality of routes.
-
公开(公告)号：US09459108B2
公开(公告)日：2016-10-04
申请号：US13600996
申请日：2012-08-31
申请人： Michele Berlingerio , Adi I. Botea , Eric P. Bouillet , Francesco Calabrese , Lea A. Deleris , Donna L. Gresh , Olivier Verscheure
发明人： Michele Berlingerio , Adi I. Botea , Eric P. Bouillet , Francesco Calabrese , Lea A. Deleris , Donna L. Gresh , Olivier Verscheure
CPC分类号： G01C21/36 , G01C21/26 , G01C21/3423 , G01C21/343 , G08G7/00
摘要： Embodiments of the disclosure include a computer system for journey planning, the computer system includes a journey planning server configured to perform a method. The method includes receiving a journey planning request, the journey planning request having an origin and a destination in a transportation network. The method also includes calculating an optimized journey plan by identifying a plurality of routes through the transportation network from the origin to the destination and determining an uncertainty associated with each of the plurality of routes. Calculating an optimized journey plan also includes evaluating a robustness of each of the plurality of routes to the uncertainty associated with each of the plurality of routes and selecting the optimized journey plan based on the journey planning request and the robustness of each of the plurality of routes.
摘要翻译： 本公开的实施例包括用于旅程规划的计算机系统，该计算机系统包括被配置为执行方法的行程规划服务器。 该方法包括接收旅程规划请求，旅程规划请求具有运输网络中的起点和目的地。 该方法还包括通过识别通过运输网络从原点到目的地的多条路线来计算优化的行驶计划，并且确定与多条路线中的每条路线相关联的不确定性。 计算优化的旅程计划还包括将多个路线中的每一条路线的鲁棒性评估为与多条路线中的每条路线相关联的不确定性，并且基于行程规划请求和多条路线中的每条路线的鲁棒性选择优化的行驶计划 。
-
6.发明申请JOURNEY COMPUTATION WITH RE-PLANNING BASED ON EVENTS IN A TRANSPORTATION NETWORK 有权根据运输网络中的事件进行重新规划的计划公开(公告)号：US20140067266A1
公开(公告)日：2014-03-06
申请号：US13600903
申请日：2012-08-31
申请人： Michele Berlingerio , Adi I. Botea , Eric P. Bouillet , Francesco Calabrese , Olivier Verscheure
发明人： Michele Berlingerio , Adi I. Botea , Eric P. Bouillet , Francesco Calabrese , Olivier Verscheure
IPC分类号： G01C21/00
CPC分类号： G01C21/3423 , G01C21/3415
摘要： Embodiments of the disclosure include a method for journey planning including receiving a journey planning request. The request includes an origin and a destination in a transportation network. The method also includes calculating an optimized journey plan based on the journey planning request and a route map corresponding to the transportation network and identifying a potential event in the transportation. The method further includes monitoring the transportation network for the potential event and based on detecting an execution of the potential event, calculating an improved journey plan.
摘要翻译： 本公开的实施例包括用于旅程规划的方法，包括接收旅程规划请求。 该请求包括运输网络中的起点和目的地。 该方法还包括基于旅程规划请求和对应于运输网络的路线图计算优化的旅行计划，并识别交通中的潜在事件。 该方法还包括监测潜在事件的运输网络，并且基于检测到潜在事件的执行，计算改进的行驶计划。
-
7.发明授权Journey computation with re-planning based on events in a transportation network 有权根据运输网络中的事件进行重新规划的旅程计算公开(公告)号：US09304006B2
公开(公告)日：2016-04-05
申请号：US13600903
申请日：2012-08-31
申请人： Michele Berlingerio , Adi I. Botea , Eric P. Bouillet , Francesco Calabrese , Olivier Verscheure
发明人： Michele Berlingerio , Adi I. Botea , Eric P. Bouillet , Francesco Calabrese , Olivier Verscheure
CPC分类号： G01C21/3423 , G01C21/3415
摘要： Embodiments of the disclosure include a method for journey planning including receiving a journey planning request. The request includes an origin and a destination in a transportation network. The method also includes calculating an optimized journey plan based on the journey planning request and a route map corresponding to the transportation network and identifying a potential event in the transportation. The method further includes monitoring the transportation network for the potential event and based on detecting an execution of the potential event, calculating an improved journey plan.
摘要翻译： 本公开的实施例包括用于旅程规划的方法，包括接收旅程规划请求。 该请求包括运输网络中的起点和目的地。 该方法还包括基于旅程规划请求和对应于运输网络的路线图计算优化的旅行计划，并识别交通中的潜在事件。 该方法还包括监测潜在事件的运输网络，并且基于检测到潜在事件的执行，计算改进的行驶计划。
-
公开(公告)号：US20140067251A1
公开(公告)日：2014-03-06
申请号：US13617065
申请日：2012-09-14
申请人： Michele Berlingerio , Adi I. Botea , Eric P. Bouillet , Francesco Calabrese , Lea A. Deleris , Donna L. Gresh , Olivier Verscheure
发明人： Michele Berlingerio , Adi I. Botea , Eric P. Bouillet , Francesco Calabrese , Lea A. Deleris , Donna L. Gresh , Olivier Verscheure
IPC分类号： G01C21/00
CPC分类号： G01C21/36 , G01C21/26 , G01C21/3423 , G01C21/343 , G08G7/00
摘要： Embodiments of the disclosure include a method for journey planning including receiving a journey planning request, the journey planning request having an origin and a destination in a transportation network. The method also includes calculating an optimized journey plan by identifying a plurality of routes through the transportation network from the origin to the destination and determining an uncertainty associated with each of the plurality of routes. Calculating an optimized journey plan also includes evaluating a robustness of each of the plurality of routes to the uncertainty associated with each of the plurality of routes and selecting the optimized journey plan based on the journey planning request and the robustness of each of the plurality of routes.
摘要翻译： 本公开的实施例包括一种用于旅程规划的方法，包括接收旅程规划请求，行驶规划请求具有运输网络中的起点和目的地。 该方法还包括通过识别通过运输网络从原点到目的地的多条路线来计算优化的行驶计划，并且确定与多条路线中的每条路线相关联的不确定性。 计算优化的旅程计划还包括将多个路线中的每一条路线的鲁棒性评估为与多条路线中的每条路线相关联的不确定性，并且基于行程规划请求和多条路线中的每条路线的鲁棒性来选择优化的行驶计划 。
-
-
-
-
-
-
-
搜索结果
8 条记录 (耗时 0.024 秒)
