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

1. 发明申请

US20060224423A1 Transportation planning with parallel optimization 审中-公开
标题翻译：并行优化运输规划
公开(公告)号：US20060224423A1
公开(公告)日：2006-10-05
申请号：US11097435
申请日：2005-04-01
申请人： Rongming Sun , Mukundan Srinivasan , Georges-Henri Moll , Vinay Yadappanavar , Mei Yang
发明人： Rongming Sun , Mukundan Srinivasan , Georges-Henri Moll , Vinay Yadappanavar , Mei Yang
IPC分类号： G06F9/44
CPC分类号： G06Q10/08 , G06Q10/04 , G06Q10/0631 , G06Q10/06315 , G06Q10/06316 , G06Q10/06375
摘要： Systems, methodologies, media, and other embodiments associated with parallel optimization in transportation planning are described. One exemplary method embodiment may include selecting, in parallel, candidate loads to satisfy a set of orders, selecting final loads from the candidate loads, and in parallel selectively manipulating the final loads into a transportation plan that reduces a transportation cost.
摘要翻译：描述了与运输计划中的并行优化相关联的系统，方法，介质和其他实施例。一个示例性方法实施例可以包括并行地选择候选负载以满足一组订单，从候选负载中选择最终负载，并且并行地选择性地将最终负载操纵到降低运输成本的运输计划中。

2. 发明授权

US07672855B2 Transportation planning with drop trailer arrangements 有权
标题翻译：运输计划与拖车安排
公开(公告)号：US07672855B2
公开(公告)日：2010-03-02
申请号：US11067154
申请日：2005-02-25
申请人： Roy I. Peterkofsky , Hema Budaraju , Mei Yang , Rongming Sun , Mukundan Srinivasan
发明人： Roy I. Peterkofsky , Hema Budaraju , Mei Yang , Rongming Sun , Mukundan Srinivasan
IPC分类号： G06Q10/00 , G06F19/00
CPC分类号： G06Q10/087 , G06Q10/0631 , G06Q10/083 , G06Q10/08355
摘要： Systems, methodologies, media, and other embodiments associated with transportation planning in light of drop trailer arrangements are described. One exemplary computer-implemented method embodiment includes receiving orders that describe items to be delivered to facilities as controlled by order requirements. The method may also include accessing a transportation planning model that includes information concerning shipping modes and carriers by which an order can be delivered to a facility. The transportation planning model may also include data concerning drop trailer arrangements between facilities and the carriers. The method may also include selectively consolidating orders into shipments based on the transportation planning model and the availability of a drop trailer arrangement. The method may also include selectively assigning shipments to loads based on the transportation planning model and the availability of a drop trailer action. The method may output an actionable plan of loads stored, for example, on a computer-readable medium.
摘要翻译：描述了根据拖车布置装置的与运输计划相关联的系统，方法，介质和其他实施例。一个示例性的计算机实现的方法实施例包括接收根据订单要求来控制要描述要传送到设施的项目的订单。该方法还可以包括访问运输计划模型，其包括关于可以将订单传送到设施的运输模式和运输方的信息。运输规划模型还可以包括关于设施和承运人之间的拖车布置的数据。该方法还可以包括基于运输计划模型和拖车装置的可用性来选择性地将订单合并到货物中。该方法还可以包括基于运输计划模型和拖车动作的可用性选择性地分配货物到货物。该方法可以输出例如存储在计算机可读介质上的可操作的负载计划。

3. 发明申请

US20060195348A1 Transportation planning with drop trailer arrangements 有权
标题翻译：运输计划与拖车安排
公开(公告)号：US20060195348A1
公开(公告)日：2006-08-31
申请号：US11067154
申请日：2005-02-25
申请人： Roy Peterkofsky , Hema Budaraju , Mei Yang , Rongming Sun , Mukundan Srinivasan
发明人： Roy Peterkofsky , Hema Budaraju , Mei Yang , Rongming Sun , Mukundan Srinivasan
IPC分类号： G05B19/418 , G06F15/02 , G06F9/46
CPC分类号： G06Q10/087 , G06Q10/0631 , G06Q10/083 , G06Q10/08355
摘要： Systems, methodologies, media, and other embodiments associated with transportation planning in light of drop trailer arrangements are described. One exemplary computer-implemented method embodiment includes receiving orders that describe items to be delivered to facilities as controlled by order requirements. The method may also include accessing a transportation planning model that includes information concerning shipping modes and carriers by which an order can be delivered to a facility. The transportation planning model may also include data concerning drop trailer arrangements between facilities and the carriers. The method may also include selectively consolidating orders into shipments based on the transportation planning model and the availability of a drop trailer arrangement. The method may also include selectively assigning shipments to loads based on the transportation planning model and the availability of a drop trailer action. The method may output an actionable plan of loads stored, for example, on a computer-readable medium.
摘要翻译：描述了根据拖车布置装置的与运输计划相关联的系统，方法，介质和其他实施例。一个示例性的计算机实现的方法实施例包括接收根据订单要求来控制要描述要传送到设施的项目的订单。该方法还可以包括访问运输计划模型，其包括关于可以将订单传送到设施的运输模式和运输方的信息。运输规划模型还可以包括关于设施和承运人之间的拖车布置的数据。该方法还可以包括基于运输计划模型和拖车装置的可用性来选择性地将订单合并到货物中。该方法还可以包括基于运输计划模型和拖车动作的可用性选择性地分配货物到货物。该方法可以输出例如存储在计算机可读介质上的可操作的负载计划。

4. 发明申请

US20130117162A1 METHOD FOR FAIR SHARE ALLOCATION IN A MULTI-ECHELON SERVICE SUPPLY CHAIN THAT CONSIDERS SUPERCESSION AND REPAIR RELATIONSHIPS 审中-公开
标题翻译：多元化服务供应链公平分配方法，考虑到监督和维修关系
公开(公告)号：US20130117162A1
公开(公告)日：2013-05-09
申请号：US13480850
申请日：2012-05-25
申请人： TAO FENG , Mei Yang , Jeroen Dirks , Zhisu Zhu , Mukundan Srinivasan
发明人： TAO FENG , Mei Yang , Jeroen Dirks , Zhisu Zhu , Mukundan Srinivasan
IPC分类号： G06Q10/08
CPC分类号： G06Q10/04 , G06Q10/087 , G06Q10/20
摘要： Embodiments of the invention provide systems and methods for fair share allocation of inventory levels throughout a supply chain. According to one embodiment, a first round main Linear Programming (LP) solve can generate an initial solution. Post-processing heuristics for fair sharing can be applied to the first round solve of the main LP. Circular sourcing heuristics can be applied to the first round solve when adjusting for fair sharing allocation requirements. For example, applying the circular sourcing heuristics to the first round solve of the main LP can comprise determining a firmed supply surplus and shortage based on a demand picture from the first round solve of the main LP adjusted for fair sharing. A second round main LP solve can be executed using the fixed inter-organizational transfer variables and fixed supply towards independent demand variables from the post-processing heuristics.
摘要翻译：本发明的实施例提供了在整个供应链中公平分配库存水平的系统和方法。根据一个实施例，第一轮主线性规划（LP）求解可以产生初始解。公平共享的后处理启发式可以应用于主LP的第一轮解决。循环采购启发式可以适用于公平分配分配要求的第一轮解决。例如，将循环采购启发式应用于主LP的第一轮解决可以包括根据调整为公平共享的主LP的第一轮解决，根据需求图确定确定的供应剩余和短缺。可以使用固定的组织间转移变量和来自后处理启发式的独立需求变量的固定供应来执行第二轮主要LP解决方案。

5. 发明授权

US08626540B2 Method and apparatus for transportation planning based on mission-specific vehicle capacity constraints 有权
标题翻译：基于任务特定车辆能力限制的交通规划方法和装置
公开(公告)号：US08626540B2
公开(公告)日：2014-01-07
申请号：US11136045
申请日：2005-05-23
申请人： Roy I. Peterkofsky , Hema Budaraju , Mei Yang , Rongming Sun
发明人： Roy I. Peterkofsky , Hema Budaraju , Mei Yang , Rongming Sun
IPC分类号： G06Q10/00
CPC分类号： G06Q10/08 , G06Q10/063 , G06Q10/0631 , G06Q10/083 , G06Q10/08355
摘要： A computer, for planning moves of freight using vehicles, determines one or more attributes of a mission, based on a group of shipments being consolidated into the mission, computes a total amount of freight to be moved, and decides on feasibility of performing the mission, using a vehicle of a given type based at least on each of (A) the amount of freight, (B) one or more attributes of the mission, and (C) multiple effective capacities of freight moveable by the type of vehicle being selected, which depend on the mission attribute(s). Multiple effective capacities for each vehicle type, and corresponding values of mission attribute(s) at which they are to be applied are stored in the computer ahead of time, based on industry experience. Examples of mission attribute(s) include (1) number of stops, (2) type of stops (whether pooling or not), and (3) a combination thereof.
摘要翻译：计算机用于计划使用车辆的货物运输，根据正在整合到任务中的一组货物，确定任务的一个或多个属性，计算要移动的货物总量，并决定执行任务的可行性至少基于（A）货运量，（B）任务的一个或多个属性，以及（C）选择的车辆类型可移动的货物的多个有效能力，至少使用给定类型的车辆，这取决于任务属性。根据行业经验，每台车型的多重有效能力以及其应用的任务属性的相应值将被提前存储在计算机中。任务属性的示例包括（1）停靠点数，（2）停止类型（是否合并）和（3）其组合。

6. 发明授权

US07827051B2 Scheduling with layovers and layover charge computation in transportation planning 有权
标题翻译：在运输计划中安排上岗和中转计费
公开(公告)号：US07827051B2
公开(公告)日：2010-11-02
申请号：US11136167
申请日：2005-05-23
申请人： Javier Nicolás Sánchez , Mei Yang , Rongming Sun , Roy I. Peterkofsky , Hema Budaraju
发明人： Javier Nicolás Sánchez , Mei Yang , Rongming Sun , Roy I. Peterkofsky , Hema Budaraju
IPC分类号： G06F17/30
CPC分类号： G06Q10/08 , G06Q10/0631 , G06Q10/06316 , G06Q10/08355
摘要： A computer, for planning moves of freight automatically adds one or more layover(s) to a mission. Next, the computer determines one or more charge(s) for the layovers, using carriers' rules. Thereafter, the computer uses the charge(s) in deciding whether to include the mission in a transportation plan to be executed. In some embodiments, the computer automatically maintains, for the given mission, counts of attributes on which limits are imposed by a government or by carriers, such as driving time, on-duty time, and driving distance, and when any count exceeds a corresponding limit in the midst of a driving activity, the computer automatically divides up the current driving activity into a truncated driving activity and a remainder driving activity, separated by a layover activity. The computer also determines an estimated time of arrival, including the impact of required layovers, to reach destination(s), and whether layover(s) is/are required at the destination(s), e.g. due to consignee's receiving hours or due to congestion at consignee's dock.
摘要翻译：一个计算机，用于规划货物的移动，将自动添加一个或多个停泊任务。接下来，计算机使用运营商的规则来确定出租人的一个或多个费用。此后，计算机使用费用来决定是否将任务包括在要执行的运输计划中。在一些实施例中，对于给定的任务，计算机自动维护由政府或运营商施加的限制的属性的计数，例如驾驶时间，在职时间和驾驶距离，以及当任何计数超过相应的限制在驾驶活动中，计算机自动将当前的驾驶活动分为截断驾驶活动和剩余驾驶活动，并由停电活动隔开。计算机还确定预计到达时间，包括所需中断的影响，到达目的地，以及是否需要在目的地（例如，目的地）进行停泊。由于收货人的收货时间或收货人码头的拥挤。

7. 发明申请

US20060265234A1 Mission-specific vehicle capacity constraints in transportation planning 有权
标题翻译：特派团在交通规划方面的能力限制
公开(公告)号：US20060265234A1
公开(公告)日：2006-11-23
申请号：US11136045
申请日：2005-05-23
申请人： Roy Peterkofsky , Hema Budaraju , Mei Yang , Rongming Sun
发明人： Roy Peterkofsky , Hema Budaraju , Mei Yang , Rongming Sun
IPC分类号： G06Q99/00
CPC分类号： G06Q10/08 , G06Q10/063 , G06Q10/0631 , G06Q10/083 , G06Q10/08355
摘要： A computer, for planning moves of freight using vehicles, determines one or more attributes of a mission, based on a group of shipments being consolidated into the mission, computes a total amount of freight to be moved, and decides on feasibility of performing the mission, using a vehicle of a given type based at least on each of (A) the amount of freight, (B) one or more attributes of the mission, and (C) multiple effective capacities of freight moveable by the type of vehicle being selected, which depend on the mission attribute(s). Multiple effective capacities for each vehicle type, and corresponding values of mission attribute(s) at which they are to be applied are stored in the computer ahead of time, based on industry experience. Examples of mission attribute(s) include (1) number of stops, (2) type of stops (whether pooling or not), and (3) a combination thereof.
摘要翻译：计算机用于计划使用车辆的货物运输，根据正在整合到任务中的一组货物，确定任务的一个或多个属性，计算要移动的货物总量，并决定执行任务的可行性至少基于（A）货运量，（B）任务的一个或多个属性，以及（C）选择的车辆类型可移动的货物的多个有效能力，至少使用给定类型的车辆，这取决于任务属性。根据行业经验，每台车型的多重有效能力以及其应用的任务属性的相应值将被提前存储在计算机中。任务属性的示例包括（1）停靠点数，（2）停止类型（是否合并）和（3）其组合。

8. 发明申请

US20060265264A1 Scheduling with layovers and layover charge computation in transportation planning 有权
标题翻译：在运输计划中安排上岗和中转计费
公开(公告)号：US20060265264A1
公开(公告)日：2006-11-23
申请号：US11136167
申请日：2005-05-23
申请人： Javier Sanchez , Mei Yang , Rongming Sun , Roy Peterkofsky , Hema Budaraju
发明人： Javier Sanchez , Mei Yang , Rongming Sun , Roy Peterkofsky , Hema Budaraju
IPC分类号： G06F9/46
CPC分类号： G06Q10/08 , G06Q10/0631 , G06Q10/06316 , G06Q10/08355
摘要： A computer, for planning moves of freight automatically adds one or more layover(s) to a mission. Next, the computer determines one or more charge(s) for the layovers, using carriers' rules. Thereafter, the computer uses the charge(s) in deciding whether to include the mission in a transportation plan to be executed. In some embodiments, the computer automatically maintains, for the given mission, counts of attributes on which limits are imposed by a government or by carriers, such as driving time, on-duty time, and driving distance, and when any count exceeds a corresponding limit in the midst of a driving activity, the computer automatically divides up the current driving activity into a truncated driving activity and a remainder driving activity, separated by a layover activity. The computer also determines an estimated time of arrival, including the impact of required layovers, to reach destination(s), and whether layover(s) is/are required at the destination(s), e.g. due to consignee's receiving hours or due to congestion at consignee's dock.
摘要翻译：一个计算机，用于规划货物的移动，将自动添加一个或多个停泊任务。接下来，计算机使用运营商的规则来确定出租人的一个或多个费用。此后，计算机使用费用来决定是否将任务包括在要执行的运输计划中。在一些实施例中，对于给定的任务，计算机自动维护由政府或运营商施加的限制的属性的计数，例如驾驶时间，在职时间和驾驶距离，以及当任何计数超过相应的限制在驾驶活动中，计算机自动将当前的驾驶活动分为截断驾驶活动和剩余驾驶活动，并由停电活动隔开。计算机还确定预计到达时间，包括所需中断的影响，到达目的地，以及是否需要在目的地（例如，目的地）进行停泊。由于收货人的收货时间或收货人码头的拥挤。

9. 发明授权

US09135247B2 Web content correction and web content correction service 有权
标题翻译： Web内容更正和网页内容更正服务
公开(公告)号：US09135247B2
公开(公告)日：2015-09-15
申请号：US12484395
申请日：2009-06-15
申请人： Juan Li , Xin Wen Qi , Fang Rui Shu , Mei Yang
发明人： Juan Li , Xin Wen Qi , Fang Rui Shu , Mei Yang
IPC分类号： G06F17/00 , G06F17/30 , G06F17/27
CPC分类号： G06F17/30 , G06F17/273 , G06F17/3089
摘要： A method includes determining a location of erroneous content in a web page in response to a user's request for correcting the erroneous content in the web page; receiving the user's input of correction content for the erroneous content; and submitting correction information to a correction service provider including the location of the erroneous content and the correction content. An alternative method includes receiving correction information submitted by a user for erroneous content in a web page, the correction information including a location of the erroneous content and correction content; storing the received correction information; and retrieving the correction information and sending the correction information to the user in response to the user's request for visiting the web page.
摘要翻译：一种方法包括响应于用户对网页中错误内容的修正请求来确定网页中错误内容的位置; 接收用户对错误内容的修正内容的输入; 以及将校正信息提交给校正服务提供者，包括错误内容的位置和校正内容。一种替代方法包括：接收由用户在网页中错误内容提交的校正信息，所述校正信息包括错误内容和校正内容的位置; 存储所接收的校正信息; 以及检索所述校正信息，并且响应于所述用户访问所述网页的请求，向所述用户发送所述校正信息。

10. 发明授权

US08471299B2 Layout and pad floor plan of power transistor for good performance of SPU and STOG 有权
标题翻译：功率晶体管的布局和焊盘平面图，实现了SPU和STOG的良好性能
公开(公告)号：US08471299B2
公开(公告)日：2013-06-25
申请号：US12861678
申请日：2010-08-23
申请人： Guo Hua Zhong , Mei Yang
发明人： Guo Hua Zhong , Mei Yang
IPC分类号： H01L29/76
CPC分类号： H01L21/4871 , H01L23/4824 , H01L2924/0002 , H01L2924/00
摘要： A power transistor for use in an audio application is laid out to minimize hot spots. Hot spots are created by non-uniform power dissipation or overly concentrated current densities. The source and drain pads are disposed relative to each other to facilitate uniform power dissipation. Interleaving metal fingers and upper metal layers are connected directly to lower metal layers in the absence of vias to improve current density distribution. This layout improves some fail detection tests by 17%.
摘要翻译：布置用于音频应用的功率晶体管以最小化热点。热点由不均匀的功耗或过度集中的电流密度产生。源极和漏极焊盘相对于彼此设置以促进均匀的功率耗散。在没有通孔的情况下，交叉金属指和上金属层直接连接到下金属层，以改善电流密度分布。这种布局改进了17％的失败检测测试。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式