会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 54. 发明授权
    • Determining a change schedule
    • 确定更改时间表
    • US07930202B2
    • 2011-04-19
    • US11421877
    • 2006-06-02
    • Vijay Krishnarao NaikBiplav Srivastava
    • Vijay Krishnarao NaikBiplav Srivastava
    • G06F9/46G06F11/34
    • G06Q10/06G06Q10/0631G06Q10/06311G06Q10/06312G06Q10/109
    • A method, system, and computer readable storage medium for determining a change schedule having multiple approvers with scheduling constraints. The constraints associated with each approver are analyzed to identify a set of candidate change schedules for each time period of a number of time periods. Weights for each approver over each of the time periods are assigned to each possible change schedule. Each approver is then asked to input preferences for each of the candidate change schedules. These preferences are then weighted for each candidate change schedule. A best change schedule is selected based on the weighted preferences of each approver for each of time periods.
    • 一种方法,系统和计算机可读存储介质,用于通过调度约束确定具有多个审批者的改变调度。 分析与每个批准者相关联的约束以识别多个时间段的每个时间段的一组候选变更时间表。 每个批准者在每个时间段的权重分配给每个可能的更改计划。 然后要求每个审批者输入每个候选变更日程表的偏好。 然后对每个候选变更时间表加权这些偏好。 基于每个批准者对每个时间段的加权偏好,选择最佳变更计划。
    • 56. 发明授权
    • Methods, apparatus and computer programs supporting shortcuts across a plurality of devices
    • 支持跨多个设备的快捷方式的方法,装置和计算机程序
    • US07698656B2
    • 2010-04-13
    • US10902197
    • 2004-07-29
    • Biplav Srivastava
    • Biplav Srivastava
    • G06F3/048G06F9/45
    • G06F9/45512
    • Provided are methods, computer programs and apparatus supporting use of generic shortcuts. Generic shortcut sequences are sequences of generic inputs that are defined to an application program to initiate specific operations of the application, and which translate to a respective input sequence receivable from each of a plurality of different types of input device. An application program written to support generic shortcut sequences will initiate specific application operations when received device-specific inputs translate into a sequence of generic inputs and the sequence includes a generic shortcut sequence. An event translator applies mappings between receivable device-type-specific inputs and respective generic inputs, to allow received input sequences to be translated into sequences of generic inputs. The resulting sequences of generic inputs are compared with defined generic shortcut sequences. If a match is identified between the sequence of generic inputs (generated by translating received device-specific inputs) and a defined generic shortcut sequence, the generic shortcut sequence initiates its respective application operation.
    • 提供了支持使用通用快捷方式的方法,计算机程序和设备。 通用快捷序列是被定义为启动应用程序的特定操作的应用程序的通用输入序列,并且转换为从多个不同类型的输入设备中的每一个可接收的相应输入序列。 写入以支持通用快捷序列的应用程序将在接收到的特定于设备的输入转换为一系列通用输入时启动特定应用操作,并且该序列包括通用快捷序列。 事件翻译器应用可接收设备类型特定输入和相应的通用输入之间的映射,以允许接收的输入序列被转换成通用输入的序列。 将所得的通用输入序列与定义的通用快捷序列进行比较。 如果在通用输入序列(通过转换接收的设备特定输入生成)和定义的通用快捷序列之间标识匹配,则通用快捷方式序列启动其相应的应用操作。
    • 57. 发明授权
    • Recovery and debugging of failed network-accessible service construction
    • 故障网络可访问服务构建的恢复和调试
    • US07509519B2
    • 2009-03-24
    • US11289152
    • 2005-11-29
    • Biplav SrivastavaArun KumarKoustuv Dasgupta
    • Biplav SrivastavaArun KumarKoustuv Dasgupta
    • G06F11/00
    • G06F11/0793G06F11/0709G06F11/36
    • In response to determining that computer generation of an abstract workflow plan for a network-accessible service resulted in failure, a method attempts to automatically recover from the failure. Where attempting to automatically recover from this failure is unsuccessful, the method applies remedy rules, to assist in debugging the failure. In response to determining that computer assignment of a physical plan for the abstract workflow plan resulted in failure, the method attempts to automatically recover from the failure. Where attempting to automatically recover from this failure is unsuccessful, the method applies remedy rules, to assist in debugging the failure. In response to determining that computer evaluation of a runtime configuration for the physical plan resulted in a failure, the method attempts to automatically recover from the failure. Where attempting to automatically recover from this failure is unsuccessful, the method applies remedy rules, to assist in debugging the failure.
    • 响应于确定计算机生成针对网络可访问服务的抽象工作流计划导致失败,方法尝试自动从故障恢复。 如果尝试自动从此故障中恢复失败,则该方法应用补救规则,以帮助调试故障。 响应于确定抽象工作流计划的物理计划的计算机分配导致失败,该方法将尝试自动从故障恢复。 如果尝试自动从此故障中恢复失败,则该方法应用补救规则,以帮助调试故障。 响应于确定对物理计划的运行时配置的计算机评估导致失败,该方法尝试自动从故障恢复。 如果尝试自动从此故障中恢复失败,则该方法应用补救规则,以帮助调试故障。
    • 58. 发明授权
    • Semantically consistent adaptation of software applications
    • 语义上一致的适应软件应用程序
    • US07478378B2
    • 2009-01-13
    • US10998850
    • 2004-11-29
    • Ashish KunduAmit A NanavatiBiplav SrivastavaManish Kurhekar
    • Ashish KunduAmit A NanavatiBiplav SrivastavaManish Kurhekar
    • G06F9/45G06F12/00
    • G06F8/71
    • The adaptation precedence of an application (or order of adaptation of various components) is given as a directed acyclic graph (DAG), with each vertex being an atomic unit of adaptation, or a component which comprises of atomic units of adaptation. Each such component has an associated DAG specifying the order of adaptation with vertices as sub-components. Relations among sub-components and associated actions are stored as a table. The relations between sub-components of different components follow a set of constraints in order to be compatible relations. A linear order from the partial order is created as represented by the DAG and follows that order for adaptation of each component. Each component x is adapted atomically and then the table of relations is updated appropriately. As and when a component y is to be adapted, the table is looked-up and it is determined which relations and actions are to be enforced upon y while its adaptation is being executed. A new version of the application is the output at the end of the adaptation, which is semantically consistent with the given relations and actions.
    • 应用的适应优先级(或各种组件的适应顺序)被给出为有向非循环图(DAG),其中每个顶点是适配的原子单位,或包含原子适应单位的分量。 每个这样的组件具有相关联的DAG,其指定具有顶点的适应顺序作为子组件。 子组件和相关操作之间的关系存储为一个表。 不同组件的子组件之间的关系遵循一系列约束,以便兼容关系。 创建由DAG表示的部分顺序的线性顺序,并遵循每个组件的自适应顺序。 每个组件x原子适配,然后关系表被适当地更新。 当要调整组件y时,查找表并确定在执行其适配时在哪个关系和动作被执行。 应用程序的新版本是在适应结束时的输出,其在语义上与给定的关系和动作一致。