公开(公告)号：US10608900B2

公开(公告)日：2020-03-31

申请号：US14932554

申请日：2015-11-04

Applicant: MICROSOFT TECHNOLOGY LICENSING, LLC

Inventor： Olivier Colle ,  Jaideep Sarkar ,  Muralidhar Sathsahayaraman ,  Radu Bogdan Gruian

IPC: G06F16/957 ,  H04L12/24 ,  H04L12/26 ,  H04L29/08

Abstract: Examples of the disclosure enable one or more operations to be executed or implemented while managing computational resources. In some examples, an instruction to implement a first operation is received. The first operation is associated with a first node of a plurality of nodes. The plurality of nodes are arranged in a plurality of regions. A second node of the plurality of nodes that is related to the first node is identified. On condition that the second node is arranged in an active region of the plurality of regions, a second operation associated with the second node is implemented within a period of time. On condition that the second node is not arranged in the active region, the second operation is not implemented within the period of time. Aspects of the disclosure enable a computing device to defer the implementation of an operation to facilitate managing computational resources.

公开(公告)号：US11068304B2

公开(公告)日：2021-07-20

申请号：US16285170

申请日：2019-02-25

Applicant: Microsoft Technology Licensing, LLC

Inventor： Jinchao Li ,  Xinying Song ,  Ah Young Kim ,  Haiyuan Cao ,  Yu Wang ,  Hui Su ,  Shahina Ferdous ,  Jianfeng Gao ,  Karan Srivastava ,  Jaideep Sarkar

IPC: G06F9/48 ,  G06F9/46 ,  H04M3/52 ,  H04M3/51 ,  G06N20/00 ,  G06Q10/04 ,  G06Q10/06 ,  G06Q10/10 ,  G06F9/50 ,  G06K9/62 ,  H04M3/523 ,  G06N7/00 ,  G06N3/08 ,  G06N20/20

Abstract: Systems and methods are disclosed for intelligent scheduling of calls to sales leads, leveraging machine learning (ML) to optimize expected results. One exemplary method includes determining, using a connectivity prediction model, call connectivity rate predictions; determining timeslot resources; allocating, based at least on the call connectivity rate predictions and timeslot resources, leads to timeslots in a first time period; determining, within a timeslot and using a lead scoring model, lead prioritization among leads within the timeslot; configuring, based at least on the lead prioritization, the telephone unit with lead information for placing a phone call; and applying a contextual bandit (ML) process to update the connectivity prediction model, the lead scoring model, or both. During subsequent time periods, the updated connectivity prediction and lead scoring models are used, thereby improving expected results over time.

公开(公告)号：US10579430B2

公开(公告)日：2020-03-03

申请号：US15972968

申请日：2018-05-07

Applicant: Microsoft Technology Licensing, LLC

Inventor： Xinying Song ,  Jaideep Sarkar ,  Karan Srivastava ,  Jianfeng Gao ,  Prabhdeep Singh ,  Hui Su ,  Jinchao Li ,  Andreea Bianca Spataru

IPC: G06F9/46 ,  G06F9/50 ,  G06F9/48

Abstract: Generally discussed herein are devices, systems, and methods for task routing. A method can include receiving, from a resource, a request for a task, in response to receiving the request, determining whether to retrieve a new task of new tasks stored in a first queue or a backlog task of backlog tasks stored in a second queue based on a combined amount of backlog tasks and new tasks relative to a capacity of the resource or the resources, retrieving the new task or the backlog task from the determined first queue or second queue, respectively, based on the determination, and providing the retrieved task to the resource.

公开(公告)号：US20190303197A1

公开(公告)日：2019-10-03

申请号：US15943206

申请日：2018-04-02

Applicant: Microsoft Technology Licensing, LLC

Inventor： Jinchao Li ,  Yu Wang ,  Karan Srivastava ,  Jianfeng Gao ,  Prabhdeep Singh ,  Haiyuan Cao ,  Xinying Song ,  Hui Su ,  Jaideep Sarkar

IPC: G06F9/48 ,  G06F9/50 ,  G06K9/62 ,  G06F15/18

Abstract: Generally discussed herein are devices, systems, and methods for scheduling tasks to be completed by resources. A method can include identifying features of the task, the features including a time-dependent feature and a time-independent feature, the time-dependent feature indicating a time the task is more likely to be successfully completed by the resource, converting the features to feature values based on a predefined mapping of features to feature values in a first memory device, determining, by a gradient boost tree model and based on a first current time and the feature values, a likelihood the resource will successfully complete the task, and scheduling the task to be performed by the resource based on the determined likelihood.

公开(公告)号：US10001976B2

公开(公告)日：2018-06-19

申请号：US14981058

申请日：2015-12-28

Applicant: MICROSOFT TECHNOLOGY LICENSING, LLC

Inventor： Jaideep Sarkar ,  Olivier Colle ,  Prithvi Raj Balaram

IPC: G06F9/44 ,  G06F9/45 ,  G06F3/0484

CPC classification number: G06F8/30 ,  G06F3/04842 ,  G06F8/20 ,  G06F8/34 ,  G06F8/433

Abstract: Examples of the disclosure enable the recalculation of device chaining in a user interface. In some examples, a first element representing a first hardware device is received at a design surface of a computing device user interface. A second element representing a second hardware device is received at the design surface. A selection of an output associated with the first element is received. A function that binds a property of the second element to a property of the output associated with the first element is automatically generated. Aspects of the disclosure enable the automatically generated function to be displayed at the design surface.

公开(公告)号：US11734066B2

公开(公告)日：2023-08-22

申请号：US16737474

申请日：2020-01-08

Applicant: Microsoft Technology Licensing, LLC

Inventor： Jinchao Li ,  Yu Wang ,  Karan Srivastava ,  Jianfeng Gao ,  Prabhdeep Singh ,  Haiyuan Cao ,  Xinying Song ,  Hui Su ,  Jaideep Sarkar

IPC: G06F9/46 ,  G06F9/48 ,  G06F9/50 ,  G06N20/00 ,  G06F18/21

CPC classification number: G06F9/4887 ,  G06F9/4881 ,  G06F9/5005 ,  G06F18/21 ,  G06N20/00

Abstract: Generally discussed herein are devices, systems, and methods for scheduling tasks to be completed by resources. A method can include identifying features of the task, the features including a time-dependent feature and a time-independent feature, the time-dependent feature indicating a time the task is more likely to be successfully completed by the resource, converting the features to feature values based on a predefined mapping of features to feature values in a first memory device, determining, by a gradient boost tree model and based on a first current time and the feature values, a likelihood the resource will successfully complete the task, and scheduling the task to be performed by the resource based on the determined likelihood.

公开(公告)号：US20190340030A1

公开(公告)日：2019-11-07

申请号：US15972968

申请日：2018-05-07

Applicant: Microsoft Technology Licensing, LLC

Inventor： Xinying Song ,  Jaideep Sarkar ,  Karan Srivastava ,  Jianfeng Gao ,  Prabhdeep Singh ,  Hui Su ,  Jinchao Li ,  Andreea Bianca Spataru

IPC: G06F9/50 ,  G06F9/48

Abstract: Generally discussed herein are devices, systems, and methods for task routing. A method can include receiving, from a resource, a request for a task, in response to receiving the request, determining whether to retrieve a new task of new tasks stored in a first queue or a backlog task of backlog tasks stored in a second queue based on a combined amount of backlog tasks and new tasks relative to a capacity of the resource or the resources, retrieving the new task or the backlog task from the determined first queue or second queue, respectively, based on the determination, and providing the retrieved task to the resource.

公开(公告)号：US09645801B2

公开(公告)日：2017-05-09

申请号：US15220069

申请日：2016-07-26

Applicant: MICROSOFT TECHNOLOGY LICENSING, LLC

Inventor： Andrew Douglas Reddish ,  Olivier Colle ,  Radu B. Gruian ,  Nizam Anuar ,  Jaideep Sarkar ,  Vijay Mital

IPC: G06F9/45 ,  G06F17/24 ,  G06F9/44

CPC classification number: G06F8/443 ,  G06F8/433 ,  G06F9/451 ,  G06F17/246

Abstract: The compilation of a transformation chain of a recalculation user interface that displays an electronic canvas that contains one or more displayed result of a transformation chain. The transformation chain includes transforms between a respective data source and data sink. User editing of the recalculation user interface could cause one or more of the transforms to be re-executed, thereby causing recalculation. The compilation involves analyzing the transformation chain of the recalculation user interface for dependencies to create a dependency graph of dependencies between entities. For instance, some dependencies might be between entities so as to indicate that if one entity is evaluated, then the other should be also. The dependency graph is then used to create a lower level of execution steps. The dependency graph is further provided to a runtime for the program, so that the dependency graph may be available during operation of the recalculation user interface.

公开(公告)号：US20160335063A1

公开(公告)日：2016-11-17

申请号：US15220069

申请日：2016-07-26

Applicant: MICROSOFT TECHNOLOGY LICENSING, LLC

Inventor： Andrew Douglas Reddish ,  Olivier Colle ,  Radu B. Gruian ,  Nizam Anuar ,  Jaideep Sarkar ,  Vijay Mital

IPC: G06F9/45

CPC classification number: G06F8/443 ,  G06F8/433 ,  G06F9/451 ,  G06F17/246

Abstract: The compilation of a transformation chain of a recalculation user interface that displays an electronic canvas that contains one or more displayed result of a transformation chain. The transformation chain includes transforms between a respective data source and data sink. User editing of the recalculation user interface could cause one or more of the transforms to be re-executed, thereby causing recalculation. The compilation involves analyzing the transformation chain of the recalculation user interface for dependencies to create a dependency graph of dependencies between entities. For instance, some dependencies might be between entities so as to indicate that if one entity is evaluated, then the other should be also. The dependency graph is then used to create a lower level of execution steps. The dependency graph is further provided to a runtime for the program, so that the dependency graph may be available during operation of the recalculation user interface.

Abstract translation: 重新计算用户界面的转换链的编译，其显示包含一个或多个显示转换链结果的电子画布。 转换链包括相应数据源和数据宿之间的变换。 重新计算用户界面的用户编辑可能导致重新执行一个或多个变换，从而导致重新计算。 编译涉及分析用于依赖关系的重新计算用户界面的转换链，以创建实体之间依赖关系的依赖图。 例如，一些依赖关系可能在实体之间，以便表明如果一个实体被评估，则另一个实体也应该是。 然后使用依赖图创建较低级别的执行步骤。 将依赖图进一步提供给程序的运行时，以便在重新计算用户界面的操作期间依赖图可能是可用的。

公开(公告)号：US10656917B2

公开(公告)日：2020-05-19

申请号：US15984293

申请日：2018-05-18

Applicant: Microsoft Technology Licensing, LLC

Inventor： Jaideep Sarkar ,  Olivier Colle ,  Prithvi Raj Balaram

IPC: G06F8/30 ,  G06F8/34 ,  G06F3/0484 ,  G06F8/20 ,  G06F8/41

Abstract: Examples of the disclosure enable the recalculation of device chaining in a user interface. In some examples, a first element representing a first hardware device is received at a design surface of a computing device user interface. A second element representing a second hardware device is received at the design surface. A selection of an output associated with the first element is received. A function that binds a property of the second element to a property of the output associated with the first element is automatically generated. Aspects of the disclosure enable the automatically generated function to be displayed at the design surface.