公开(公告)号：US08346704B2

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

申请号：US12465440

申请日：2009-05-13

Applicant: Youssef Hamadi ,  Said Jabbour

Inventor： Youssef Hamadi ,  Said Jabbour

IPC: G06F17/00 ,  G06N5/02

CPC classification number: G06N5/04

Abstract: Controlled constraint sharing in parallel problem solvers is described. In embodiments, constraint sharing in a problem solver is controlled by comparing a total number of shared constraints obtained in a time interval to a target, and regulating the subsequent number of shared constraints obtained from other problem solvers accordingly. Embodiments describe how the regulation of the subsequent number of shared constraints can be achieved by controlling the size of constraints shared by other problem solvers. Embodiments describe how an additive increase/multiplicative decrease algorithm can be used to determine the size of constraints to be exchanged. Embodiments also describe how the utility of the shared constraints can be determined, and used to control the size of constraints shared by other problem solvers. In embodiments, the problem solver is a Boolean satisfiability problem solver.

Abstract translation: 描述了并行问题求解器中的受控约束共享。 在实施例中，通过将在时间间隔中获得的共享约束的总数与目标进行比较来控制问题求解器中的约束共享，并且相应地调节从其他问题解决者获得的随后的共享约束数。 实施例描述了如何通过控制其他问题解决者共享的约束的大小来实现对后续数量的共享约束的调节。 实施例描述了如何使用添加增加/乘法减少算法来确定要交换的约束的大小。 实施例还描述了如何确定共享约束的效用，并且用于控制由其他问题解决者共享的约束的大小。 在实施例中，问题求解器是布尔可满足性问题求解器。

公开(公告)号：US20100293127A1

公开(公告)日：2010-11-18

申请号：US12465440

申请日：2009-05-13

Applicant: Youssef Hamadi ,  Said Jabbour

Inventor： Youssef Hamadi ,  Said Jabbour

IPC: G06N5/04

CPC classification number: G06N5/04

Abstract: Controlled constraint sharing in parallel problem solvers is described. In embodiments, constraint sharing in a problem solver is controlled by comparing a total number of shared constraints obtained in a time interval to a target, and regulating the subsequent number of shared constraints obtained from other problem solvers accordingly. Embodiments describe how the regulation of the subsequent number of shared constraints can be achieved by controlling the size of constraints shared by other problem solvers. Embodiments describe how an additive increase/multiplicative decrease algorithm can be used to determine the size of constraints to be exchanged. Embodiments also describe how the utility of the shared constraints can be determined, and used to control the size of constraints shared by other problem solvers. In embodiments, the problem solver is a Boolean satisfiability problem solver.

Abstract translation: 描述了并行问题求解器中的受控约束共享。 在实施例中，通过将在时间间隔中获得的共享约束的总数与目标进行比较来控制问题求解器中的约束共享，并且相应地调节从其他问题解决者获得的随后的共享约束数。 实施例描述了如何通过控制其他问题解决者共享的约束的大小来实现对后续数量的共享约束的调节。 实施例描述了如何使用添加增加/乘法减少算法来确定要交换的约束的大小。 实施例还描述了如何确定共享约束的效用，并且用于控制由其他问题解决者共享的约束的大小。 在实施例中，问题求解器是布尔可满足性问题求解器。

公开(公告)号：US20080183538A1

公开(公告)日：2008-07-31

申请号：US11669098

申请日：2007-01-30

Applicant: Youssef Hamadi ,  Claude-Guy Quimper

Inventor： Youssef Hamadi ,  Claude-Guy Quimper

IPC: G06F9/46

CPC classification number: G06Q10/06 ,  G06Q10/0631 ,  G06Q10/063112

Abstract: Previous workflow engines have typically used definitions of workflows with tasks having pre-assigned resources or resources computed by earlier tasks in the workflow. Also, previous workflow engines have typically used if-then rules and conditions to specify and control execution of tasks in the workflow. In contrast, the methods described herein use constraint programming techniques. Information about a workflow is provided, comprising a plurality of tasks, and for at least some of those tasks, resource allocation requirements. Using this workflow information together with policy information and information about resource characteristics, a constraint optimization problem is specified. This problem is solved using a constraint programming solver and the resulting information about resources allocated to tasks is stored. In this way, resources may be allocated to tasks in a dynamic manner, during execution of a workflow if required.

Abstract translation: 以前的工作流引擎通常使用工作流的定义，任务具有预先分配的资源或工作流中较早任务计算的资源。 此外，以前的工作流引擎通常使用if-then规则和条件来指定和控制工作流中任务的执行。 相比之下，本文描述的方法使用约束编程技术。 提供关于工作流的信息，包括多个任务，并且对于这些任务中的至少一些，资源分配要求。 使用此工作流信息以及资源特征的策略信息和信息，指定约束优化问题。 使用约束编程解算器解决此问题，并存储关于分配给任务的资源的结果信息。 以这种方式，如果需要，可以在工作流的执行期间以动态方式将资源分配给任务。

公开(公告)号：US08375052B2

公开(公告)日：2013-02-12

申请号：US11866637

申请日：2007-10-03

Applicant: Lucas Bordeaux ,  Youssef Hamadi ,  Shahram Izadi ,  Vishwa Vinay

Inventor： Lucas Bordeaux ,  Youssef Hamadi ,  Shahram Izadi ,  Vishwa Vinay

IPC: G06F17/30

CPC classification number: G06Q10/107

Abstract: An outgoing message monitor is provided. In an embodiment, outgoing messages are monitored to detect potential errors and alerts may be triggered. Using information about a message such as an email, a first classifier classifies the email into an expected class and a second classifier classifies the email into an actual class. On the basis of a comparison of the expected and actual classes an alert may be triggered. In an embodiment, the second classifier uses information derived from text content of the email which may optionally be pre-processed. The first classifier, for example, uses other information about the email such as its intended recipients, information about the presence of attachments, information about whether the email is part of a thread and other information.

Abstract translation: 提供一个传出的消息监视器。 在一个实施例中，监视传出的消息以检测潜在的错误，并且可以触发警报。 使用关于诸如电子邮件的消息的信息，第一分类器将电子邮件分类为预期类，并且第二分类器将电子邮件分类为实际类。 根据预期和实际类别的比较，可能会触发警报。 在一个实施例中，第二分类器使用从可能可预先处理的电子邮件的文本内容导出的信息。 例如，第一个分类器使用关于电子邮件的其他信息，例如其预期收件人，关于附件的存在的信息，关于该电子邮件是否是线程的一部分的信息以及其他信息。

公开(公告)号：US20090094240A1

公开(公告)日：2009-04-09

申请号：US11866637

申请日：2007-10-03

Applicant: Lucas Bordeaux ,  Youssef Hamadi ,  Shahram Izadi ,  Vishwa Vinay

Inventor： Lucas Bordeaux ,  Youssef Hamadi ,  Shahram Izadi ,  Vishwa Vinay

IPC: G06F17/30

CPC classification number: G06Q10/107

Abstract: An outgoing message monitor is provided. In an embodiment, outgoing messages are monitored to detect potential errors and alerts may be triggered. Using information about a message such as an email, a first classifier classifies the email into an expected class and a second classifier classifies the email into an actual class. On the basis of a comparison of the expected and actual classes an alert may be triggered. In an embodiment, the second classifier uses information derived from text content of the email which may optionally be pre-processed. The first classifier, for example, uses other information about the email such as its intended recipients, information about the presence of attachments, information about whether the email is part of a thread and other information.

Abstract translation: 提供一个传出的消息监视器。 在一个实施例中，监视传出的消息以检测潜在的错误，并且可以触发警报。 使用关于诸如电子邮件的消息的信息，第一分类器将电子邮件分类为预期类，并且第二分类器将电子邮件分类为实际类。 根据预期和实际类别的比较，可能会触发警报。 在一个实施例中，第二分类器使用从可能可预先处理的电子邮件的文本内容导出的信息。 例如，第一个分类器使用关于电子邮件的其他信息，例如其预期收件人，关于附件的存在的信息，关于该电子邮件是否是线程的一部分的信息以及其他信息。

公开(公告)号：US07472094B2

公开(公告)日：2008-12-30

申请号：US11192556

申请日：2005-07-28

Applicant: Youssef Hamadi ,  Georg Ringwelski

Inventor： Youssef Hamadi ,  Georg Ringwelski

IPC: G06N5/00

CPC classification number: G06F9/5066 ,  G06F9/5027 ,  G06F2209/506 ,  G06N5/00 ,  H04L45/00 ,  H04Q2213/13054 ,  H04Q2213/13174

Abstract: A node participating in a network of nodes that solve a distributed constraint problem. The nodes have mutually constrained sub-problems of the constraint problem. The node receives values or decisions from neighbor nodes. Those values or decisions allow the sub-problems of the neighbor nodes to be solved. Some received values or decisions correspond to a first ordering of the nodes, and some received values or decisions correspond to a second ordering of the nodes. Attempts are made to solve the sub-problem of the node as constrained by the values or decisions of the neighbor nodes. Results of the attempts are communicated to neighbor nodes, where for a given value or decision the node to which the corresponding attempt result is communicated depends on which of the orderings the given value or decision corresponds to. An attempt for one context can be affected by attempts in another context.

Abstract translation: 参与解决分布式约束问题的节点网络的节点。 节点具有约束问题的相互约束的子问题。 节点从邻居节点接收值或决策。 这些值或决策允许解决邻居节点的子问题。 一些接收到的值或判定对应于节点的第一次排序，并且一些接收的值或判定对应于节点的第二次排序。 尝试解决由邻居节点的值或决定所约束的节点的子问题。 尝试的结果被传送到邻居节点，其中对于给定的值或决定，相应的尝试产生的节点所通信的节点取决于给定值或决定对应的哪个顺序。 一个上下文的尝试可能受到另一个上下文中的尝试的影响。

公开(公告)号：US20080184250A1

公开(公告)日：2008-07-31

申请号：US11669082

申请日：2007-01-30

Applicant: Youssef Hamadi ,  Claude-Guy Quimper

Inventor： Youssef Hamadi ,  Claude-Guy Quimper

IPC: G06F9/46 ,  G06F9/50

CPC classification number: G06F9/5038

Abstract: Processes are often cross-functional and involve the flow of information between several functional areas. For example, an order fulfillment process may require input from sales, logistics and manufacturing. Existing workflow engines, which do not use constraint programming techniques, are able to model such cross-functional processes only where the workflows are precisely and accurately defined. A constraint programming approach to workflow analysis is used here. A synchronization module in a constraint programming workflow engine scheduler receives registrations from listener tasks in a workflow which are dependent on tasks in other workflows. The synchronization module triggers the listener tasks at appropriate times to monitor for information from the dependent tasks. In this way cross-workflow synchronization is achieved by specifying listener tasks and registering these at the synchronization module. Thus it is not essential for the workflows to be precisely defined.

Abstract translation: 流程通常是跨功能的，涉及到几个功能区域之间的信息流。 例如，订单履行过程可能需要来自销售，物流和制造的投入。 不使用约束编程技术的现有工作流引擎只能在准确和准确地定义工作流程的情况下对这种跨功能过程进行建模。 这里使用工作流分析的约束编程方法。 约束编程工作流引擎调度程序中的同步模块从工作流中的监听器任务接收注册，这些任务依赖于其他工作流中的任务。 同步模块在适当的时间触发侦听器任务以监视从属任务的信息。 以这种方式，通过指定侦听器任务并在同步模块上注册这些任务来实现跨工作流同步。 因此，精确定义工作流程并不重要。

公开(公告)号：US20050052535A1

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

申请号：US10659121

申请日：2003-09-10

Applicant: Youssef Hamadi

Inventor： Youssef Hamadi

IPC: G06K9/62 ,  H04N5/225

CPC classification number: G06K9/6293

Abstract: Image understanding applications are assisted by a system that provides context for captured images. Devices in an image are capable of identifying themselves to the image capture device. The identifications may then be used to identify specific models needed to match possible devices in the image. In addition, the identifications may also be used to narrow the library of models needed to match possible devices in the image. Therefore, the library of possible objects may be narrowed to exclude most outdoor-oriented models or to include predominantly office-related objects. Narrowing the scope of possible models to consider can dramatically improve the effectiveness and efficiency of image understanding applications in these environments.

Abstract translation: 图像理解应用程序由为捕获的图像提供上下文的系统辅助。 图像中的设备能够识别自己到图像捕获设备。 然后可以使用标识来识别匹配图像中的可能设备所需的特定模型。 此外，标识也可用于缩小与图像中的可能设备匹配所需的模型库。 因此，可能的对象的图书馆可能被缩小，以排除大多数以户外为主的模型，或者主要包括与办公室相关的对象。 缩小考虑的可能模型的范围可以显着提高图像理解应用程序在这些环境中的有效性和效率。

公开(公告)号：US07975234B2

公开(公告)日：2011-07-05

申请号：US11548399

申请日：2006-10-11

Applicant: Youssef Hamadi ,  Stephanie Ubeda

Inventor： Youssef Hamadi ,  Stephanie Ubeda

IPC: G06F3/00 ,  G06F3/048

CPC classification number: G06F3/04847

Abstract: A user interface is described which displays a shape and enables a user to manipulate that shape by dividing it into a number of regions. Each region has an associated term which is made up from one or more constraints. A mathematical function, such as an objective function, is generated from the resultant graphical representation of the shape, where the function contains a term for each region and where each term is weighted according to the size of the corresponding region.

Abstract translation: 描述了用户界面，其显示形状并且使得用户能够通过将其划分成多个区域来操纵该形状。 每个区域具有由一个或多个约束组成的关联术语。 从形成的图形表示生成诸如目标函数的数学函数，其中函数包含每个区域的项，并且每个项根据相应区域的大小加权。

公开(公告)号：US07529429B2

公开(公告)日：2009-05-05

申请号：US11552312

申请日：2006-10-24

Applicant: Carsten Rother ,  Lucas Bordeaux ,  Youssef Hamadi ,  Andrew Blake

Inventor： Carsten Rother ,  Lucas Bordeaux ,  Youssef Hamadi ,  Andrew Blake

IPC: G06K9/36

CPC classification number: G06T11/60 ,  G06K9/469

Abstract: It is required to provide an automated process for forming a visually appealing digital collage (also referred to as a tapestry or photomontage) from a plurality of input images. Input images and a collage are labeled. Labels in the collage specify which regions of the input images are used to form those collage regions. An energy function is created for the labeling which contains terms that take into account various criteria to produce a collage. For example, those criteria may relate to the amount of information in the images, similarity of the images, entropy in the images or object class information. A multi-stage optimization process is applied to the energy function which is fast and enables large numbers of input images to be used to produce a collage.

Abstract translation: 需要提供一种用于从多个输入图像形成视觉吸引人的数字拼贴（也称为挂毯或照片蒙版）的自动化过程。 输入图像和拼贴画已标记。 拼贴中的标签指定输入图像的哪些区域用于形成这些拼贴区域。 为标签创建了能量函数，其中包含考虑到制作拼贴的各种标准的术语。 例如，这些标准可以涉及图像中的信息量，图像的相似性，图像中的熵或对象类信息。 多阶段优化过程被应用于快速的能量函数，并且能够使用大量的输入图像来产生拼贴。