-
公开(公告)号：US20170154348A1
公开(公告)日：2017-06-01
申请号：US14953499
申请日：2015-11-30
Applicant: XEROX CORPORATION
Inventor： Arpita Biswas , Koyel Mukherjee , Pallavi Manohar , Partha Dutta
CPC classification number: G06Q30/0206 , G06Q30/0222 , G06Q50/30
Abstract: Embodiments of a dynamic pricing system for determining an optimal commission rate based on a service request being served are disclosed. The dynamic pricing system comprises at least one service device that can communicate with a request device, wherein the at least one service device provides a response for a service request; and a dynamic pricing device interfacing with the at least one service device, wherein the dynamic pricing device determines an optimal commission rate corresponding to a request type for the at least one service device, wherein the optimal commission rate maximizes revenue from the service request.
-
公开(公告)号：US20150215173A1
公开(公告)日：2015-07-30
申请号：US14168228
申请日：2014-01-30
Applicant: Xerox Corporation
Inventor： Partha Dutta , Tridib Mukherjee , Koustuv Dasgupta
CPC classification number: H04L41/5016 , G06F9/4881 , G06F9/5038 , G06F9/505 , G06F2209/503 , H04L41/0896
Abstract: Disclosed are the methods for scheduling a task including at least one sub-task, on one or more computing devices in a distributed computing environment. A set of computing devices are identified from the one or more computing devices, based on an availability of a set of computational resources on the set of computing devices. Each computing device in the set of computing devices is ranked based on at least one of a monetary cost or a network cost, associated with the execution of the at least one sub-task on the each computing device. The at least one sub-task is allocated to at least one computing device from the set of computing devices for execution based on at least one of the ranking or an acceptable success probability associated with the execution of the at least one sub-task.
Abstract translation: 公开了在分布式计算环境中的一个或多个计算设备上调度包括至少一个子任务的任务的方法。 基于一组计算设备上的一组计算资源的可用性，从一个或多个计算设备识别一组计算设备。 基于与每个计算设备上的至少一个子任务的执行相关联的货币成本或网络成本中的至少一个来对该组计算设备中的每个计算设备进行排名。 基于与所述至少一个子任务的执行相关联的排序或可接受的成功概率中的至少一个，将所述至少一个子任务分配给来自所述一组计算设备的至少一个计算设备用于执行。
-
公开(公告)号：US09444846B2
公开(公告)日：2016-09-13
申请号：US14308748
申请日：2014-06-19
Applicant: Xerox Corporation
Inventor： Avinash Sharma , Partha Dutta , Tridib Mukherjee , Shruti Kunde
IPC: H04L29/06
CPC classification number: H04L63/20 , H04L63/126
Abstract: Embodiments of a method are disclosed for computing trust index among multiple entities associated with a resource marketplace. The method includes receiving multiple inputs including interaction attributes, attribute importance factors, references to databases, and multiple entities associated with the resource marketplace. The method also includes creating a weighted-interaction graph based on the received inputs. The weighted-interaction graph includes multiple vertices representing the entities. The method further includes performing a topology-specific analysis of the weighted-interaction graph. The method furthermore includes computing Euclidean distances for each pair of vertices in the weighted-interaction graph based on the performed analysis. The method also includes determining a trust index for a first entity in the received multiple entities based on the computed Euclidean distances. The trust index includes ranking of at least one of the multiple entities with respect to the first entity. The ranking is inversely proportional to the computed Euclidean distances.
Abstract translation: 公开了一种用于计算与资源市场相关联的多个实体之间的信任指数的方法的实施例。 该方法包括接收多个输入，包括交互属性，属性重要性因素，对数据库的引用以及与资源市场相关联的多个实体。 该方法还包括基于所接收的输入创建加权交互图。 加权交互图包括表示实体的多个顶点。 该方法还包括执行加权交互图的拓扑特定分析。 该方法还包括基于所执行的分析来计算加权交互图中的每对顶点的欧几里得距离。 该方法还包括基于所计算的欧氏距离来确定所接收的多个实体中的第一实体的信任度索引。 信任指数包括相对于第一实体的至少一个多个实体的排名。 排名与计算的欧氏距离成反比。
-
公开(公告)号：US09444695B2
公开(公告)日：2016-09-13
申请号：US14168228
申请日：2014-01-30
Applicant: Xerox Corporation
Inventor： Partha Dutta , Tridib Mukherjee , Koustuv Dasgupta
CPC classification number: H04L41/5016 , G06F9/4881 , G06F9/5038 , G06F9/505 , G06F2209/503 , H04L41/0896
Abstract: Disclosed are the methods for scheduling a task including at least one sub-task, on one or more computing devices in a distributed computing environment. A set of computing devices are identified from the one or more computing devices, based on an availability of a set of computational resources on the set of computing devices. Each computing device in the set of computing devices is ranked based on at least one of a monetary cost or a network cost, associated with the execution of the at least one sub-task on the each computing device. The at least one sub-task is allocated to at least one computing device from the set of computing devices for execution based on at least one of the ranking or an acceptable success probability associated with the execution of the at least one sub-task.
Abstract translation: 公开了在分布式计算环境中的一个或多个计算设备上调度包括至少一个子任务的任务的方法。 基于一组计算设备上的一组计算资源的可用性，从一个或多个计算设备识别一组计算设备。 基于与每个计算设备上的至少一个子任务的执行相关联的货币成本或网络成本中的至少一个来对该组计算设备中的每个计算设备进行排名。 基于与所述至少一个子任务的执行相关联的排序或可接受的成功概率中的至少一个，将所述至少一个子任务分配给来自所述一组计算设备的至少一个计算设备用于执行。
-
公开(公告)号：US20160171404A1
公开(公告)日：2016-06-16
申请号：US14568587
申请日：2014-12-12
Applicant: XEROX CORPORATION
Inventor： Koyel Mukherjee , Atul Singh , Partha Dutta , Koustuv Dasgupta
IPC: G06Q10/06
CPC classification number: G06Q10/06313 , G06Q10/063112
Abstract: According to embodiments illustrated herein, there is provided a method for staffing one or more employees on a project. The method includes selecting a first set of employees from the one or more employees for a skill required to process the project, based on at least a first score and a second score. The method further includes receiving an input from a computing device deterministic of at least cost of the project, wherein the input is received through a graphical user interface (GUI) presented on the computing device. The method further includes selecting a second set of employees from the first set of employees based on at least one of a cost of each employee in the first set of employees, a time duration of the project, and the cost of the project.
Abstract translation: 根据本文所示的实施例，提供了一种用于在项目上配置一个或多个雇员的方法。 所述方法包括基于至少第一分数和第二分数从所述一个或多个雇员中选择处理所述项目所需的技能的第一组雇员。 该方法还包括从计算设备接收确定项目的至少成本的输入，其中通过呈现在计算设备上的图形用户界面（GUI）接收输入。 该方法还包括基于第一组雇员中的每个雇员的成本，项目的持续时间和项目的成本中的至少一个来从第一组雇员中选择第二组雇员。
-
Patent Agency Ranking
公开(公告)号：US20160132831A1
公开(公告)日：2016-05-12
申请号：US14535359
申请日：2014-11-07
Applicant: Xerox Corporation
Inventor： Avinash Sharma , Partha Dutta , Jyotirmaya Mahapatra , Abhishek Tripathi
IPC: G06Q10/10
CPC classification number: G06Q10/1053
Abstract: The disclosed embodiments illustrate methods and systems for human resource management in an organization. A graph, representative of relationships between employees, job openings, and candidates applied for the job openings, is generated. The graph is transformed to generate a graph matrix deterministic of a mapping of nodes depicted in the graph, in a predetermined dimensional space. Further, a first distance between nodes corresponding to the candidates and a node corresponding to a job opening is determined based on the graph matrix. A list of ranked candidates, based on the first distance, is presented over a display associated with a hiring manager, allowing selection of a set of candidates. Additionally, a second distance between nodes corresponding to the candidates and between each node corresponding to a candidate and each node corresponding to an employee, is determined, based on which a set of candidates for a team are selected.
Abstract translation: 所公开的实施例示出了组织中的人力资源管理的方法和系统。 生成代表雇员之间的关系，工作机会和申请职位空缺的候选人的图表。 转换图形以在预定维度空间中生成图中描绘的节点的映射的图形矩阵确定性。 此外，基于图表矩阵确定与候选对应的节点与对应于作业开放的节点之间的第一距离。 基于第一距离的排名候选者的列表被呈现在与招聘经理相关联的显示器上，允许选择一组候选者。 此外，基于此选择一组候选人，确定对应于候选的节点和对应于候选者的每个节点与对应于雇员的每个节点之间的第二距离。
-
公开(公告)号：US20150373049A1
公开(公告)日：2015-12-24
申请号：US14308748
申请日：2014-06-19
Applicant: Xerox Corporation
Inventor： Avinash Sharma , Partha Dutta , Tridib Mukherjee , Shruti Kunde
IPC: H04L29/06
CPC classification number: H04L63/20 , H04L63/126
Abstract: Embodiments of a method are disclosed for computing trust index among multiple entities associated with a resource marketplace. The method includes receiving multiple inputs including interaction attributes, attribute importance factors, references to databases, and multiple entities associated with the resource marketplace. The method also includes creating a weighted-interaction graph based on the received inputs. The weighted-interaction graph includes multiple vertices representing the entities. The method further includes performing a topology-specific analysis of the weighted-interaction graph. The method furthermore includes computing Euclidean distances for each pair of vertices in the weighted-interaction graph based on the performed analysis. The method also includes determining a trust index for a first entity in the received multiple entities based on the computed Euclidean distances. The trust index includes ranking of at least one of the multiple entities with respect to the first entity. The ranking is inversely proportional to the computed Euclidean distances.
Abstract translation: 公开了一种用于计算与资源市场相关联的多个实体之间的信任指数的方法的实施例。 该方法包括接收多个输入，包括交互属性，属性重要性因素，对数据库的引用以及与资源市场相关联的多个实体。 该方法还包括基于所接收的输入创建加权交互图。 加权交互图包括表示实体的多个顶点。 该方法还包括执行加权交互图的拓扑特定分析。 该方法还包括基于所执行的分析来计算加权交互图中的每对顶点的欧几里得距离。 该方法还包括基于所计算的欧氏距离来确定所接收的多个实体中的第一实体的信任度索引。 信任指数包括相对于第一实体的至少一个多个实体的排名。 排名与计算的欧氏距离成反比。
-
公开(公告)号：US09173008B1
公开(公告)日：2015-10-27
申请号：US14258051
申请日：2014-04-22
Applicant: Xerox Corporation
Inventor： Partha Dutta
IPC: H04H60/32 , H04N21/647 , H04N21/4363 , H04N21/414 , H04N21/236
CPC classification number: H04N21/2146 , H04N21/2187 , H04N21/234327 , H04N21/2402 , H04N21/25841
Abstract: Embodiments of a method are disclosed for transmitting one or more videos provided by one or more video cameras disposed at a mobile object traveling along a pre-defined route. The method includes receiving the videos, bandwidth map data for multiple communication channels, travel time data for the mobile object, and service level agreement (SLA) parameters. The received video is transformed into multiple video layers. For each video layer, a transmission cost over the multiple communication channels is computed based on the bandwidth map data, the travel time data and the SLA parameters. Out of the multiple communication channels, a particular communication channel is selected for each video layer, which has the minimum transmission cost over the selected communication channel. The video layers are scheduled for transmission over the respective selected communication channels. The scheduled video layers are transmitted with respect to at least one of the SLA parameters.
Abstract translation: 公开了一种方法的实施例，用于发送由设置在沿预定路线行驶的移动物体处的一个或多个摄像机提供的一个或多个视频。 该方法包括接收视频，多个通信信道的带宽图数据，移动对象的旅行时间数据和服务水平协议（SLA）参数。 接收到的视频被转换成多个视频层。 对于每个视频层，基于带宽图数据，旅行时间数据和SLA参数来计算多个通信信道上的传输成本。 在多个通信信道中，针对所选择的通信信道具有最小传输成本的每个视频层选择特定的通信信道。 视频层被安排在相应的所选择的通信信道上进行传输。 调度视频层相对于SLA参数中的至少一个发送。
-
9.发明申请公开(公告)号：US20170228840A1
公开(公告)日：2017-08-10
申请号：US15017722
申请日：2016-02-08
Applicant: XEROX CORPORATION
Inventor： Abhishek Tripathi , Skanda Vasudevan , Alefiya Lightwala , Arpita Biswas , Partha Dutta
CPC classification number: G06Q50/165 , G06Q30/0201 , G06Q30/0202 , G06Q50/06
Abstract: A method and a system are provided for identifying one or more locations for placement of one or more replenishment stations for one or more vehicles. The method comprises receiving a historical demand data at a plurality of existing replenishment stations within a pre-defined area. The method identifies one or more point of interest locations within the pre-defined area based on a map data. Further, the method receives traffic information between a plurality of road intersections within the pre-defined area. Based on an aggregation of a first demand prediction, a second demand prediction, and a third demand prediction, the method predicts a replenishment demand at a plurality of locations. The method further identifies the one or more locations from the plurality of locations for placement of the one or more replenishment stations based on the predicted replenishment demand at the plurality of locations and a pre-defined threshold.
-
公开(公告)号：US09228841B2
公开(公告)日：2016-01-05
申请号：US14293172
申请日：2014-06-02
Applicant: Xerox Corporation
Inventor： Partha Dutta , Abhishek Tripathi , Koustuv Dasgupta , Nischal Murthy Piratla
CPC classification number: G01C21/3605 , G01C21/3423 , G01C21/3469
Abstract: Methods and systems for determining one or more routes in a navigation system. A request comprising a first set of parameters corresponding to a trip is received. The first set of parameters comprise at least one an originating node for the trip, a destination node for the trip, a start time for the trip, or a set of preferences associated with the trip. The one or more routes between the originating node and the destination node are determined based on the first set of parameters. Each of the one or more routes comprises at least one public transportation sub-trip traversed by a public vehicle and a private transportation sub-trip traversed by a private vehicle. The one or more routes are ranked based on a trip score associated with the one or more routes. The trip score is determined based on the set of preferences.
Abstract translation: 用于确定导航系统中的一个或多个路线的方法和系统。 接收包括对应于行程的第一组参数的请求。 第一组参数包括用于跳闸的至少一个起始节点，用于跳闸的目的地节点，用于跳闸的开始时间或与该行程相关联的一组偏好。 基于第一组参数来确定始发节点和目的地节点之间的一个或多个路由。 所述一个或多个路线中的每一个包括由公共车辆穿过的至少一个公共交通子跳闸和由私人车辆穿过的私人交通子跳闸。 一个或多个路线基于与一个或多个路线相关联的旅行得分进行排名。 旅行得分是基于偏好集来确定的。
-
-
-
-
-
-
-
-
-
Search Results
18
records
(took 0.021 seconds)
