公开(公告)号：US09342764B1

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

申请号：US14666663

申请日：2015-03-24

Applicant: Xerox Corporation

Inventor： Eric Michael Gross ,  Tulia Plumettaz ,  Pallavi Manohar ,  Manoj Gupta

IPC: G06F3/12 ,  G06K15/02

CPC classification number: G06F3/126 ,  G06F3/1204 ,  G06F3/1268 ,  G06F3/1285 ,  G06F3/1296 ,  G06K15/1817 ,  G06K15/1822

Abstract: A system for performing queue-based routing of print jobs in a multi-site print production environment may include a computing device having a scheduling queue and a processor, and a computer-readable storage medium in communication with the computing device. The computer-readable storage medium may include one or more programming instructions that, when executed, cause the processor to receive a plurality of print jobs from one or more client computing devices, store the received print jobs in the scheduling queue, determine that a released print job has been released by a print production environment, identify a similar print job from the received print jobs in the scheduling queue, remove the identified similar print job from the scheduling queue, and route the identified similar print job to the print production environment.

Abstract translation: 用于在多站点打印生产环境中执行打印作业的基于队列的路由的系统可以包括具有调度队列和处理器的计算设备以及与计算设备通信的计算机可读存储介质。 计算机可读存储介质可以包括一个或多个编程指令，其在被执行时使得处理器从一个或多个客户端计算设备接收多个打印作业，将接收到的打印作业存储在调度队列中，确定释放的 打印作业已由打印生产环境释放，从调度队列中接收到的打印作业中识别类似的打印作业，从调度队列中移除所识别的类似打印作业，并将所识别的类似打印作业路由到打印生产环境。

公开(公告)号：US09639306B1

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

申请号：US15221752

申请日：2016-07-28

Applicant: Xerox Corporation

Inventor： Manoj Gupta ,  Jagadeesh Chandra Bose Rantham Prabhakara ,  Sudhendu Rai ,  Partha Dutta

IPC: G06K15/02 ,  G06F3/12

CPC classification number: G06F3/1226 ,  G06F3/1205 ,  G06F3/1211 ,  G06F3/1262 ,  G06F3/1285

Abstract: A method of generating a cell design of print production devices for a print production environment includes receiving a print job list, and identifying a plurality of print production devices located in the production environment. The system identifies a list of functions associated with the print jobs, and generates a graph. The system determines a threshold value, and partitions the graph into a number of groups equal to the threshold value such that a number of edges extending between groups is minimized. The system generates an initial cell design for the print production environment, and causes a hardware setting of each of the plurality of production devices to be updated to reflect the cell to which the production device was assigned and to enable the production device to perform one or more functions associated with the cell to which the production device was assigned.

公开(公告)号：US20170017914A1

公开(公告)日：2017-01-19

申请号：US14798494

申请日：2015-07-14

Applicant: XEROX CORPORATION

Inventor： Manoj Gupta ,  Alefiya Lightwala ,  Partha Dutta ,  Seshadri Thirumalai Echampadi ,  Prince Gerald Albert ,  Vivek Harikrishnan Ramalingam

IPC: G06Q10/06 ,  G06Q10/10

CPC classification number: G06Q10/063112 ,  G06Q10/1053

Abstract: According to embodiments illustrated herein, a method and a system is provided for screening candidates for job opportunities. The method includes grouping the candidates into batches based on predetermined time duration, a count of the candidates, and a chronology of receiving job applications from the candidates. Each batch comprises a first set of candidates. Thereafter, a sliding window is moved over the batches, to encompass a set of batches at a first time instance. A second set of candidates is identified from the first set of candidates in a batch from the set of batches based on a score assigned to each of the first set of candidates during an interview. Further, a candidate is selected from the second set of candidates obtained from a first batch, encompassed by the sliding window at a second time instance before the first time instance.

Abstract translation: 根据本文所示的实施例，提供了一种方法和系统，用于筛选候选人的工作机会。 该方法包括基于预定持续时间，候选人的计数以及从候选者接收工作申请的时间顺序将候选人分组。 每个批次包括第一组候选人。 此后，将滑动窗口移动到批次上，以便在第一时间段包括一组批次。 基于在访问期间分配给第一组候选者中的每一个的分数，从批次集合中的第一组候选者中确定第二组候选者。 此外，从第一批次获得的第二组候选中选择候选者，该第一批候选由第一时间实例之前的第二时间实例由滑动窗包围。

公开(公告)号：US20170017522A1

公开(公告)日：2017-01-19

申请号：US14799835

申请日：2015-07-15

Applicant: XEROX CORPORATION

Inventor： Mohit Daga ,  Manoj Gupta ,  Koyel Mukherjee ,  Shailesh Vaya

IPC: G06F9/50

CPC classification number: G06F9/505 ,  G06F9/46

Abstract: According to embodiments illustrated herein there is provided a method for assigning one or more resources to a task. The method includes determining one or more workflows, comprising one or more sub-tasks in a sequence, utilizable to process the task. The method further includes determining a set of scores for each sub-task associated with each workflow based on at least a set of performance attributes of a set of resources who are available for processing each sub-task. The disclosed method further includes assigning at least a resource from the set of resources, available for processing each sub-task, based on at least one of the determined set of scores and one or more predefined requisites associated with each sub-task.

Abstract translation: 根据本文所示的实施例，提供了一种用于将一个或多个资源分配给任务的方法。 该方法包括确定一个或多个工作流，包括序列中的一个或多个子任务，可用于处理该任务。 该方法还包括基于可用于处理每个子任务的一组资源的至少一组性能属性来确定与每个工作流相关联的每个子任务的一组分数。 所公开的方法还包括基于所确定的分数集合中的至少一个和与每个子任务相关联的一个或多个预定义的条件中的至少一个，从至少一个可用于处理每个子任务的资源集中分配资源。

公开(公告)号：US20160301574A1

公开(公告)日：2016-10-13

申请号：US14683251

申请日：2015-04-10

Applicant: XEROX CORPORATION

Inventor： Manoj Gupta

IPC: H04L12/24 ,  G06F17/30

CPC classification number: H04L41/12

Abstract: The disclosed embodiments illustrate methods and systems for maintaining reachability information among one or more communication devices of a communication network. The method includes creating, at a first time instance, a first path-union graph, between a first and a second communication device that become unreachable from each other in the communication network. Thereafter, a reachability tree is created from the first path-union graph. The reachability tree includes a set of communication devices that are at a distance of less than a predefined path distance from the first communication device. Further, at a second time instance, a second path-union graph is created between the first communication device and a third communication device, when the third communication device becomes unreachable from the first communication device. Thereafter, the reachability tree is updated based on the second path-union graph.

Abstract translation: 所公开的实施例示出了用于在通信网络的一个或多个通信设备之间维护可达性信息的方法和系统。 该方法包括在第一时间实例中，在通信网络中彼此不可达的第一和第二通信设备之间创建第一路径联合图。 此后，从第一路径联合图形创建可达性树。 可达性树包括距离第一通信设备小于预定路径距离的一组通信设备。 此外，在第二时间的情况下，当第三通信设备从第一通信设备变得不可达时，在第一通信设备和第三通信设备之间创建第二路径联合图。 此后，基于第二路径联合图更新可达性树。

公开(公告)号：US09552183B2

公开(公告)日：2017-01-24

申请号：US14750199

申请日：2015-06-25

Applicant: Xerox Corporation

Inventor： Tulia Plumettaz ,  Pallavi Manohar ,  Eric Michael Gross ,  Manoj Gupta

IPC: G06F15/00 ,  G06F3/12 ,  G06Q10/06

CPC classification number: G06F3/126 ,  G06F3/1211 ,  G06F3/1285 ,  G06Q10/0631

Abstract: A system for performing queue-based routing of print jobs in a multi-site print production environment may include an electronic dispatch system having a scheduling queue, at least one processor and a computer-readable storage medium. The computer-readable storage medium may include programming instructions that, when executed, cause the processor to receive print jobs from client computing devices, identify one or more print shops, select a set of print jobs from the scheduling queue that are to be assigned to the print shops for completion, generate a feasibility matrix for the selected print jobs, determine a preliminary assignment of the selected print jobs to the identified print shops using a set cover heuristic, use a linear programming heuristic to determine a final assignment of the selected print jobs to the identified print shops, and route each of the selected print jobs to an assigned print shop as specified by the final assignment.

Abstract translation: 用于在多站点打印生产环境中执行打印作业的基于队列的路由的系统可以包括具有调度队列，至少一个处理器和计算机可读存储介质的电子调度系统。 计算机可读存储介质可以包括编程指令，其在被执行时使得处理器从客户计算设备接收打印作业，识别一个或多个打印商店，从调度队列中选择一组要分配给 打印商店完成，为所选择的打印作业生成可行性矩阵，使用集合封面启发式方法确定所选择的打印作业到所识别的打印商店的初步分配，使用线性编程启发式来确定所选打印件的最终分配 作业到所识别的印刷商店，并将每个所选择的打印作业路由到由最终作业指定的指定的印刷商店。

公开(公告)号：US20160378407A1

公开(公告)日：2016-12-29

申请号：US14750199

申请日：2015-06-25

Applicant: Xerox Corporation

Inventor： Tulia Plumettaz ,  Pallavi Manohar ,  Eric Michael Gross ,  Manoj Gupta

IPC: G06F3/12 ,  G06Q10/06

CPC classification number: G06F3/126 ,  G06F3/1211 ,  G06F3/1285 ,  G06Q10/0631

Abstract: A system for performing queue-based routing of print jobs in a multi-site print production environment may include an electronic dispatch system having a scheduling queue, at least one processor and a computer-readable storage medium. The computer-readable storage medium may include programming instructions that, when executed, cause the processor to receive print jobs from client computing devices, identify one or more print shops, select a set of print jobs from the scheduling queue that are to be assigned to the print shops for completion, generate a feasibility matrix for the selected print jobs, determine a preliminary assignment of the selected print jobs to the identified print shops using a set cover heuristic, use a linear programming heuristic to determine a final assignment of the selected print jobs to the identified print shops, and route each of the selected print jobs to an assigned print shop as specified by the final assignment.

Abstract translation: 用于在多站点打印生产环境中执行打印作业的基于队列的路由的系统可以包括具有调度队列，至少一个处理器和计算机可读存储介质的电子调度系统。 计算机可读存储介质可以包括编程指令，其在被执行时使得处理器从客户计算设备接收打印作业，识别一个或多个打印商店，从调度队列中选择一组要分配给 打印商店完成，为所选择的打印作业生成可行性矩阵，使用集合封面启发式方法确定所选择的打印作业到所识别的打印商店的初步分配，使用线性编程启发式来确定所选打印件的最终分配 作业到所识别的印刷商店，并将每个所选择的打印作业路由到由最终作业指定的指定的印刷商店。

公开(公告)号：US20160283170A1

公开(公告)日：2016-09-29

申请号：US15097419

申请日：2016-04-13

Applicant: Xerox Corporation

Inventor： Eric Michael Gross ,  Tulia Plumettaz ,  Pallavi Manohar ,  Manoj Gupta

IPC: G06F3/12

CPC classification number: G06F3/126 ,  G06F3/1204 ,  G06F3/1268 ,  G06F3/1285 ,  G06F3/1296 ,  G06K15/1817 ,  G06K15/1822

Abstract: A system for performing queue-based routing of print jobs in one or more print production environments includes a computing device having a processor, and a computer-readable storage medium in communication with the computing device. The computing device will receive print jobs from one or more client computing devices, and the computing device will store the received print jobs in a scheduling queue. When the computing device determines that a released print job has been released by a print production environment, it will determine a similarity metric for a plurality of print jobs in the scheduling queen, identify the print job having the highest similarity metric, and route the identified print job to the print production environment for processing.

Abstract translation: 用于在一个或多个打印生产环境中执行打印作业的基于队列的路由的系统包括具有处理器的计算设备和与计算设备通信的计算机可读存储介质。 计算设备将从一个或多个客户端计算设备接收打印作业，并且计算设备将将所接收的打印作业存储在调度队列中。 当计算设备确定释放的打印作业已经被打印生产环境释放时，它将确定调度女王中的多个打印作业的相似性度量，识别具有最高相似性度量的打印作业，并且路由所识别的 打印作业到打印生产环境进行处理。

公开(公告)号：US10089382B2

公开(公告)日：2018-10-02

申请号：US14887096

申请日：2015-10-19

Applicant: Xerox Corporation

Inventor： Akhil Arora ,  Manoj Gupta ,  Shourya Roy

IPC: G06F17/30

Abstract: A method, non-transitory computer readable medium and apparatus for transforming a knowledge base into a machine readable format for an automated system are disclosed. For example, the method includes clustering two or more documents of a plurality of documents in the knowledge base that are similar based upon a domain specific shingling function, identifying a pattern from each document of the plurality of documents that are clustered, wherein the pattern comprises a sequence of steps, aggregating the pattern of the each document of the plurality of documents that are clustered into a trie data-structure that is machine readable, receiving a request and applying the trie data-structure to provide a solution to the request.

公开(公告)号：US20170262868A1

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

申请号：US15064642

申请日：2016-03-09

Applicant: XEROX CORPORATION

Inventor： Geetha Manjunath ,  Avinash Sharma ,  Narayanan Unny Edakunni ,  Divanshu Gupta ,  Manoj Gupta ,  Shruti Kunde ,  Rong Zhou

IPC: G06Q30/02 ,  G06F17/30 ,  G06Q30/00

CPC classification number: G06Q30/0201 ,  G06F16/3344 ,  G06F16/8358 ,  G06F16/9024 ,  G06F16/90335 ,  G06F16/9038 ,  G06F16/907 ,  G06Q30/016

Abstract: A method and a system are provided to derive one or more observations between a plurality of parameters in customer care data. The method includes receiving customer care data from a plurality of data sources. Thereafter the customer care data is transformed to create a plurality of data structures utilizing one or more semantic web protocols. The plurality of data structures represents a relationship between one or more parameters in the customer care data. Thereafter a subset of data structures is extracted from the plurality of data structures based on a query received via a query interface. One or more graph analytics techniques are applied on the subset of data structures to determine one or more observations associated with the subset of data structures. Thereafter the one or more observations pertaining to the subset of data structures are displayed on a display screen.