-
公开(公告)号:US07552394B2
公开(公告)日:2009-06-23
申请号:US11242154
申请日:2005-10-03
IPC分类号: G06F9/00
CPC分类号: G06F3/0481
摘要: Systems, methods, media, and other embodiments associated with facilitating intelligent navigation in a graphical user interface (GUI) are described. One exemplary system embodiment includes a control element configured to facilitate closing a window and identifying a GUI navigation target. The example system may also include a top-level object configured to selectively close an open window descended from a top-level window upon determining that the top-level window is being closed.
摘要翻译: 描述了与促进图形用户界面(GUI)中的智能导航相关联的系统,方法,媒体和其他实施例。 一个示例性系统实施例包括被配置为便于关闭窗口并识别GUI导航目标的控制元件。 示例系统还可以包括顶层对象,其被配置为在确定顶级窗口正在关闭时选择性地关闭从顶级窗口下降的打开的窗口。
-
2.
公开(公告)号:US08046161B2
公开(公告)日:2011-10-25
申请号:US11173314
申请日:2005-06-30
申请人: Roy I. Peterkofsky , Hema Budaraju , Roger J. A. Goossens , Atul Kumar Srivastav , Vijay Pillarisetti
发明人: Roy I. Peterkofsky , Hema Budaraju , Roger J. A. Goossens , Atul Kumar Srivastav , Vijay Pillarisetti
IPC分类号: G06Q50/00
CPC分类号: G08G1/202 , G06Q10/083
摘要: A computer, for planning moves of freight automatically receives a plan containing a number of trips to be performed to move freight using vehicles, and partially releases only a portion of the plan for execution instead of releasing the entire plan. The plan portion that is released includes a subset of trips that are selected by the computer from among all trips in the entire plan. Thereafter, the computer simply repeats the just-described acts. Iteratively releasing portions of a plan allows the computer to be instructed to release early certain trips that are satisfactory. Trips that are sub-optimal are re-generated in a next version of the plan, based on changes in orders in the interim. The computer may also be instructed to release a trip even if sub-optimal, if its time-to-departure becomes less than an advance notice needed by a truckload service that is to execute the trip.
摘要翻译: 计算机用于计划运费自动收到一个包含若干行程的计划,用于使用车辆运输货物,并且仅部分地释放执行计划的一部分,而不是释放整个计划。 发布的计划部分包括计算机从整个计划的所有行程中选择的一组跳闸。 此后,电脑简单地重复刚才描述的动作。 迭代地释放计划的部分允许指示计算机释放令人满意的早期某些跳闸。 根据临时订单的变化,在次计划的下一个版本中重新生成次优的行程。 如果计时器的启始时间变得小于执行行程的卡车服务所需的提前通知,则也可以指示计算机释放行程,即使次优。
-