公开(公告)号：US08463633B2

公开(公告)日：2013-06-11

申请号：US13192221

申请日：2011-07-27

申请人： Gueyoung Jung ,  Hua Liu ,  Ramses V. Morales

发明人： Gueyoung Jung ,  Hua Liu ,  Ramses V. Morales

IPC分类号： G06Q40/00

CPC分类号： G06Q10/06 ,  G06Q10/103

摘要： A service workflow including ordered services is received, and a heuristic utility value is calculated for each service. A best node having a smallest heuristic utility value for a service is selected, and a best node identifier is placed in a node list. If the best node includes a parallel sub-workflow, potential next nodes are identified by generating potential next nodes from a data center that can perform a service associated with the best node with a minimum run-time value. Otherwise, potential next nodes are generated based on a data center associated with the service. A heuristic utility value is determined for each potential next node, and a new best node is selected based on the heuristic utility values. The identifying, determining, and selecting operations are repeated until the best node contains only the last ordered service. Data centers for each ordered service are identified based on the best node.

摘要翻译： 接收到包含有序服务的服务工作流，并为每个服务计算启发式效用值。 选择具有用于服务的最小启发式效用值的最佳节点，并且将最佳节点标识符放置在节点列表中。 如果最佳节点包括并行子工作流程，则可以通过从数据中心生成潜在的下一个节点来识别潜在的下一个节点，数据中心可以以最小的运行时间值执行与最佳节点相关联的服务。 否则，基于与服务相关联的数据中心生成潜在的下一个节点。 为每个潜在的下一个节点确定启发式效用值，并根据启发式实用值选择一个新的最佳节点。 重复识别，确定和选择操作，直到最佳节点仅包含最后有序服务。 基于最佳节点识别每个有序服务的数据中心。

公开(公告)号：US20130226670A1

公开(公告)日：2013-08-29

申请号：US13403440

申请日：2012-02-23

申请人： Andres Quiroz Hernandez ,  Ramses V. Morales ,  Hua Liu

发明人： Andres Quiroz Hernandez ,  Ramses V. Morales ,  Hua Liu

IPC分类号： G06Q10/06

CPC分类号： G06Q10/06 ,  G06Q10/067

摘要： A method of implementing a business process may include receiving business process information associated with a business process. The business process information may include a graph representing one or more activities to be performed to complete the business process. The method may include identifying, by a computing device, a number of groups associated with the business process information. Each group may be capable of performing at least a portion of the activities. The method may include partitioning, by the computing device, the graph into a number of fragments that is greater than or equal to the number of identified groups. Each fragment may include one or more activities from the graph. The method may include, for each fragment, transmitting the fragment to an identified group that is capable of performing each activity associated with the fragment, and orchestrating the performance of the activities associated with each fragment by each group.

摘要翻译： 实现业务流程的方法可以包括接收与业务流程相关联的业务流程信息。 业务流程信息可以包括表示要完成业务流程的一个或多个活动的图表。 该方法可以包括由计算设备识别与业务过程信息相关联的组的数量。 每组可能能够执行至少一部分活动。 该方法可以包括由计算设备将该图划分成大于或等于所识别的组的数目的多个片段。 每个片段可以包括图中的一个或多个活动。 对于每个片段，该方法可以包括将片段发送到能够执行与片段相关联的每个活动的标识组，并且协调每个组与每个片段相关联的活动的性能。

公开(公告)号：US20130030859A1

公开(公告)日：2013-01-31

申请号：US13192221

申请日：2011-07-27

申请人： Gueyoung Jung ,  Hua Liu ,  Ramsés V. Morales

发明人： Gueyoung Jung ,  Hua Liu ,  Ramsés V. Morales

IPC分类号： G06Q10/00

CPC分类号： G06Q10/06 ,  G06Q10/103

摘要： A service workflow including ordered services is received, and a heuristic utility value is calculated for each service. A best node having a smallest heuristic utility value for a service is selected, and a best node identifier is placed in a node list. If the best node includes a parallel sub-workflow, potential next nodes are identified by generating potential next nodes from a data center that can perform a service associated with the best node with a minimum run-time value. Otherwise, potential next nodes are generated based on a data center associated with the service. A heuristic utility value is determined for each potential next node, and a new best node is selected based on the heuristic utility values. The identifying, determining, and selecting operations are repeated until the best node contains only the last ordered service. Data centers for each ordered service are identified based on the best node.

摘要翻译： 接收到包含有序服务的服务工作流，并为每个服务计算启发式效用值。 选择具有用于服务的最小启发式效用值的最佳节点，并且将最佳节点标识符放置在节点列表中。 如果最佳节点包括并行子工作流程，则可以通过从数据中心生成潜在的下一个节点来识别潜在的下一个节点，数据中心可以以最小的运行时间值执行与最佳节点相关联的服务。 否则，基于与服务相关联的数据中心生成潜在的下一个节点。 为每个潜在的下一个节点确定启发式效用值，并且基于启发式实用值选择新的最佳节点。 重复识别，确定和选择操作，直到最佳节点仅包含最后有序服务。 基于最佳节点识别每个有序服务的数据中心。

公开(公告)号：US08654386B2

公开(公告)日：2014-02-18

申请号：US13421405

申请日：2012-03-15

申请人： Hua Liu ,  Tong Sun

发明人： Hua Liu ,  Tong Sun

IPC分类号： G06F3/12 ,  G06K15/00

CPC分类号： G06Q30/02

摘要： Methods and systems for selecting a service provider are disclosed. Information pertaining to print service providers, including associated user and general reputation scores, are received. Each user reputation score identifies a user's perception of a print service provider's reputation. Each general reputation score identifies a general strength of the print service provider's reputation. A first set of providers is selected based on a threshold user reputation score. A second set of providers is selected (pseudo-)randomly. A trust score is determined for each provider in the first and second sets based on the associated user and general reputation scores. One or more negotiation providers are selected from the first and second sets based on the associated trust scores. One or more of the user and general reputation scores are updated for negotiation providers based on a quality of service provided or an offer provided to or by the negotiation provider.

摘要翻译： 公开了用于选择服务提供商的方法和系统。 收到与打印服务提供商有关的信息，包括相关用户和一般信誉评分。 每个用户信誉评分识别用户对打印服务提供商的声誉的看法。 每个通用信誉评分都标识了打印服务提供商声誉的一般优势。 基于阈值用户信誉评分来选择第一组提供者。 随机选择（伪）第二组提供者。 基于相关联的用户和一般信誉评分，确定第一和第二组中的每个提供者的信任分数。 基于相关联的信任分数，从第一和第二集合中选择一个或多个协商提供者。 基于提供的服务质量或向协商提供商提供的报价，为协商提供者更新一个或多个用户和一般信誉分数。

公开(公告)号：US20130160018A1

公开(公告)日：2013-06-20

申请号：US13331246

申请日：2011-12-20

申请人： Dhanwant Singh Kang ,  Hua Liu ,  Tong Sun

发明人： Dhanwant Singh Kang ,  Hua Liu ,  Tong Sun

IPC分类号： G06F9/46

CPC分类号： G06F9/50 ,  G06Q10/00 ,  G06Q10/10

摘要： A system and method for the dynamic allocation of resources based on multi-phase negotiation mechanism. A resource allocation decision can be made based on an index value computed by a selection index function. A negotiation process can be performed based on a schedule, a number of resources, and a price of resources. A user requesting a resource for a low priority task can negotiate based on the schedule, the user demanding the resource for a medium priority task can negotiate based on the schedule and/or the number of resources, and filially the user requesting the resource for a high priority job can successfully negotiate based on per unit resource price. The multi-phase negotiation mechanism motivates the users to be cooperative among them and improves a cooperative behavior coefficient and an overall user satisfaction rate.

摘要翻译： 一种基于多阶段协商机制动态资源分配的系统与方法。 可以基于由选择索引函数计算的索引值来进行资源分配决定。 可以基于日程表，资源数量和资源价格进行协商过程。 请求用于低优先级任务的资源的用户可以基于调度进行协商，要求中等优先级任务的资源的用户可以基于调度和/或资源数量协商，并且恳求用户请求资源用于 高优先级工作可以根据单位资源价格成功协商。 多阶段协商机制激励用户之间合作，提高合作行为系数和整体用户满意度。

公开(公告)号：US08427680B2

公开(公告)日：2013-04-23

申请号：US12716883

申请日：2010-03-03

申请人： Mary Catherine McCorkindale ,  Jennifer C. Watts-Perotti ,  Mary Ann Sprague ,  Patricia Swenton-Wall ,  Arturo M. Lorenzo ,  Hua Liu

发明人： Mary Catherine McCorkindale ,  Jennifer C. Watts-Perotti ,  Mary Ann Sprague ,  Patricia Swenton-Wall ,  Arturo M. Lorenzo ,  Hua Liu

IPC分类号： G06F3/12

CPC分类号： G06F15/00

摘要： A user of a computerized device creates an item capable of being printed and stores the item within storage of the computerized device. An instruction to perform delayed printing of the item is received from a user of a computerized device when the user is outside a predetermined physical range of at least one printing device. The computerized device detects when the computerized device is within the predetermined physical range of the printing device and, when this occurs, the computerized device provides the user a printing option to print the item on the printing device. If the user selects the printing option, the methods herein forward the item to a conversion device. The conversion device makes the item print ready so that the item can be printed using the printing device. The methods herein then cause the item to be forwarded from the conversion device to the printing device and printed on the printing device.

摘要翻译： 计算机化设备的用户创建能够被打印的项目，并将该项目存储在计算机化设备的存储器内。 当用户在至少一个打印设备的预定物理范围之外时，从计算机化设备的用户接收到执行项目的延迟打印的指令。 计算机化设备检测计算机化设备何时在打印设备的预定物理范围内，并且当发生这种情况时，计算机化设备向用户提供打印选项以在打印设备上打印项目。 如果用户选择打印选项，则本文中的方法将该项转发到转换设备。 转换设备使项目打印准备好，以便可以使用打印设备打印项目。 这里的方法使得物品从转换装置转发到打印装置并打印在打印装置上。

公开(公告)号：US08339639B2

公开(公告)日：2012-12-25

申请号：US12335048

申请日：2008-12-15

申请人： Robert James St. Jacques, Jr. ,  Hua Liu ,  Shanmuga-nathan Gnanasambandam ,  Naveen Sharma

发明人： Robert James St. Jacques, Jr. ,  Hua Liu ,  Shanmuga-nathan Gnanasambandam ,  Naveen Sharma

IPC分类号： G06F3/12 ,  G06F15/167 ,  G06F15/16

CPC分类号： H04N1/00244 ,  G06F3/1204 ,  G06F3/1238 ,  G06F3/1267 ,  G06F3/1285 ,  H04N1/00347 ,  H04N1/2179 ,  H04N1/2183 ,  H04N1/4413 ,  H04N1/444 ,  H04N2201/0039 ,  H04N2201/3246

摘要： A method and a system for storing, accessing, and retrieving data, the printing system including a plurality of multifunction devices (MFDs) in operable communication with a network, the plurality of MFDs configured to be positioned in different geographical locations; and a memory device for automatically storing the data generated by the plurality of MFDs; wherein an authorized user is enabled to print a document via a print request from a first MFD of the plurality of MFDs and then retrieve the document at any of the other MFDs on the network without re-sending another print request from the first MFD.

摘要翻译： 一种用于存储，访问和检索数据的方法和系统，所述打印系统包括与网络可操作地通信的多个多功能设备（MFD），所述多个MFD被配置为定位在不同的地理位置; 以及用于自动存储由所述多个MFD产生的数据的存储装置; 其中授权用户能够通过来自所述多个MFD的第一MFD的打印请求来打印文档，然后在所述网络上的任何其他MFD上检索所述文档，而不从所述第一MFD重新发送另一打印请求。

公开(公告)号：US20120221590A1

公开(公告)日：2012-08-30

申请号：US13466245

申请日：2012-05-08

申请人： Hua Liu

发明人： Hua Liu

IPC分类号： G06F17/30

CPC分类号： H04L29/06 ,  H04L69/22 ,  Y10S707/99933

摘要： The embodiments of the present invention disclose a method, an apparatus and a system for protocol identification. The implementation of the method includes extracting the identification tuple of a message, wherein the identification tuple at least includes a network address; searching an identification table for the algorithm application list corresponding to the identification tuple; and performing a content identification for the message with an algorithm in the algorithm application list to obtain the protocol type of the message. By using the identification tuple which at least includes IP address and is extracted from the message to search for the corresponding algorithm, and then performing content identification for the message with the searched algorithm, the above implementation can improve the message identification precision and reduce the identification error.

摘要翻译： 本发明的实施例公开了用于协议识别的方法，装置和系统。 所述方法的实现包括提取消息的标识元组，其中所述标识元组至少包括网络地址; 搜索与识别元组相对应的算法应用列表的识别表; 并使用算法应用列表中的算法对该消息进行内容识别，以获得消息的协议类型。 通过使用至少包含IP地址并从消息中提取的识别元组来搜索相应的算法，然后利用搜索到的算法对消息进行内容标识，上述实现可以提高消息识别精度并减少识别 错误。

公开(公告)号：US07885928B2

公开(公告)日：2011-02-08

申请号：US11683758

申请日：2007-03-08

申请人： Steven J. Harrington ,  Hua Liu

发明人： Steven J. Harrington ,  Hua Liu

IPC分类号： G06F17/30 ,  G06F15/16

CPC分类号： G06F17/30212 ,  G06F11/2094 ,  G06F17/30206 ,  H04L67/1002 ,  H04L67/1008 ,  H04L67/1019 ,  H04L67/1023 ,  H04L67/104 ,  H04L67/1076 ,  H04L67/1095

摘要： Methods and systems are provided relating to a decentralized algorithm for managing replicas of a resource in a peer-to-peer network to satisfy quality of service requirements. Individual nodes within the network storing a resource replica continually monitor the node performance against quality of service (QoS) parameters and when necessary, take appropriate action to either add or delete the resource, all the while informing the other nodes within the network that maintain a replica of the resource of the particular action for dynamic fluctuation of the count of resource replicas therein.

摘要翻译： 提供了关于用于管理对等网络中的资源的副本的分散式算法以满足服务质量要求的方法和系统。 存储资源副本的网络中的各个节点连续监视节点性能与服务质量（QoS）参数，并且在必要时采取适当的动作来添加或删除资源，同时通知网络中维护一个 资源副本数量动态波动的特定动作资源的副本。

公开(公告)号：US20100149572A1

公开(公告)日：2010-06-17

申请号：US12335048

申请日：2008-12-15

申请人： Robert James St. Jacques, JR. ,  Hua Liu ,  Shanmuga-nathan Gnanasambandam ,  Naveen Sharma

发明人： Robert James St. Jacques, JR. ,  Hua Liu ,  Shanmuga-nathan Gnanasambandam ,  Naveen Sharma

IPC分类号： G06F3/12

CPC分类号： H04N1/00244 ,  G06F3/1204 ,  G06F3/1238 ,  G06F3/1267 ,  G06F3/1285 ,  H04N1/00347 ,  H04N1/2179 ,  H04N1/2183 ,  H04N1/4413 ,  H04N1/444 ,  H04N2201/0039 ,  H04N2201/3246

摘要： A method and a system for storing, accessing, and retrieving data, the printing system including a plurality of multifunction devices (MFDs) in operable communication with a network, the plurality of MFDs configured to be positioned in different geographical locations; and a memory device for automatically storing the data generated by the plurality of MFDs; wherein an authorized user is enabled to print a document via a print request from a first MFD of the plurality of MFDs and then retrieve the document at any of the other MFDs on the network without re-sending another print request from the first MFD.

摘要翻译： 一种用于存储，访问和检索数据的方法和系统，所述打印系统包括与网络可操作地通信的多个多功能设备（MFD），所述多个MFD被配置为定位在不同的地理位置; 以及用于自动存储由所述多个MFD产生的数据的存储装置; 其中授权用户能够通过来自所述多个MFD的第一MFD的打印请求来打印文档，然后在所述网络上的任何其他MFD上检索所述文档，而不从所述第一MFD重新发送另一打印请求。