专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US08943106B2 Matrix re-ordering and visualization in the presence of data hierarchies 有权
标题翻译：在存在数据层次的情况下进行矩阵重新排序和可视化
公开(公告)号：US08943106B2
公开(公告)日：2015-01-27
申请号：US12751196
申请日：2010-03-31
申请人： Abderrahim Labbi , Michail Vlachos , Christos Boutsidis
发明人： Abderrahim Labbi , Michail Vlachos , Christos Boutsidis
IPC分类号： G06F17/30
CPC分类号： G06F17/30994
摘要： Exemplary embodiments include a method for re-ordering and visualizing a matrix in the presence of a data hierarchy stored on a computer system, the method including receiving a matrix, in the computer system, the matrix having rows and columns, reordering the matrix so that groups of related rows and columns are brought in adjacent matrix positions, wherein reordering the matrix A obeys constraints imposed by the data hierarchy on at least one of the rows and the columns and reordering the hierarchy on at least one of the rows and columns, wherein affinities in the data hierarchy are extracted by the reordering of the data hierarchy.
摘要翻译：示例性实施例包括用于在存在于计算机系统上的数据层级存在的情况下重新排序和可视化矩阵的方法，该方法包括在计算机系统中接收具有行和列的矩阵，重新排序矩阵，使得相关行和列的组被带入相邻的矩阵位置，其中重新排序矩阵A在至少一行行和列上服从由数据层次结构施加的约束，并且对行和列中的至少一个重新排序层级，其中通过数据层次结构的重新排序来提取数据层次结构中的亲和度。

2. 发明授权

US07318038B2 Project risk assessment 失效
标题翻译：项目风险评估
公开(公告)号：US07318038B2
公开(公告)日：2008-01-08
申请号：US10194698
申请日：2002-07-11
申请人： Abderrahim Labbi
发明人： Abderrahim Labbi
IPC分类号： G06Q10/00
CPC分类号： G06Q10/10 , G06Q10/06313 , G06Q40/08
摘要： This invention provides techniques, systems and apparatus for assessing risk associated with a project or a portfolio of projects. An example embodiment having a processor and a memory, includes storing operational values which corresponds to a different project. Each operational value is representative of a project operational parameter. A risk vector is generated for each project based on the set of operational parameters. The risk vectors are partitioned into groups of similar risk vectors having a set of membership rules. Probabilities that a new project belongs to respective groups are generated. A risk value indicative of the risk associated with the new project is generated based on the probabilities generated. In some embodiments, the technique also assesses portfolio risk and utilizes an optimization algorithm to estimate acceptable or desirable margins to charge for each project in a portfolio of projects.
摘要翻译：本发明提供用于评估与项目或项目组合相关联的风险的技术，系统和装置。具有处理器和存储器的示例性实施例包括存储对应于不同项目的操作值。每个操作值代表项目操作参数。基于一组操作参数为每个项目生成风险向量。将风险向量划分为具有一组成员规则的类似风险向量的组。生成新项目属于各自组的概率。根据生成的概率生成指示与新项目相关的风险的风险值。在一些实施例中，该技术还评估投资组合风险，并且使用优化算法来估计对项目组合中的每个项目收取的可接受或期望的利润。

3. 发明申请

US20110097001A1 COMPUTER-IMPLEMENTED VISUALIZATION METHOD 失效
标题翻译：计算机实现可视化方法
公开(公告)号：US20110097001A1
公开(公告)日：2011-04-28
申请号：US12907069
申请日：2010-10-19
申请人： Abderrahim Labbi , Michail Vlachos
发明人： Abderrahim Labbi , Michail Vlachos
IPC分类号： G06K9/62
CPC分类号： G06K9/6219 , G06K9/6253
摘要： A method, system and computer product for visualizing affinities between objects. The method includes the steps of: forming a representation of a minimum spanning tree where the minimum spanning tree connects the plurality of objects based on a pairwise distance between the plurality of objects; forming a hierarchical cluster of the plurality of objects where the hierarchical cluster includes a level; agglomerating the plurality of objects based on the pairwise distance; displaying a view of the representation of the minimum spanning tree in a graphical user interface; receiving a user selection of a parameter containing a hierarchical level; and identifying, in the view, a target cluster that corresponds to the hierarchical level; where at least one of the steps is carried out using a computer device so that affinities between the plurality of objects are visualized.
摘要翻译：一种用于可视化对象之间的亲和度的方法，系统和计算机产品。该方法包括以下步骤：基于多个对象之间的成对距离，形成最小生成树的连接多个对象的最小生成树的表示; 形成所述多个对象的分级集群，其中所述分层集群包括层次; 基于成对距离聚集多个物体; 在图形用户界面中显示最小生成树的表示的视图; 接收包含层次级别的参数的用户选择; 并且在视图中识别与分层级相对应的目标簇; 其中使用计算机设备执行至少一个步骤，使得可以可视化多个对象之间的亲和度。

4. 发明授权

US08437559B2 Computer-implemented visualization method 失效
标题翻译：计算机实现的可视化方法
公开(公告)号：US08437559B2
公开(公告)日：2013-05-07
申请号：US12907069
申请日：2010-10-19
申请人： Abderrahim Labbi , Michail Vlachos
发明人： Abderrahim Labbi , Michail Vlachos
IPC分类号： G06K9/62 , G06K9/68
CPC分类号： G06K9/6219 , G06K9/6253
摘要： A method, system and computer product for visualizing affinities between objects. The method includes the steps of: forming a representation of a minimum spanning tree where the minimum spanning tree connects the plurality of objects based on a pairwise distance between the plurality of objects; forming a hierarchical cluster of the plurality of objects where the hierarchical cluster includes a level; agglomerating the plurality of objects based on the pairwise distance; displaying a view of the representation of the minimum spanning tree in a graphical user interface; receiving a user selection of a parameter containing a hierarchical level; and identifying, in the view, a target cluster that corresponds to the hierarchical level; where at least one of the steps is carried out using a computer device so that affinities between the plurality of objects are visualized.
摘要翻译：一种用于可视化对象之间的亲和度的方法，系统和计算机产品。该方法包括以下步骤：基于多个对象之间的成对距离，形成最小生成树的连接多个对象的最小生成树的表示; 形成所述多个对象的分级集群，其中所述分层集群包括层次; 基于成对距离聚集多个物体; 在图形用户界面中显示最小生成树的表示的视图; 接收包含层次级别的参数的用户选择; 并且在视图中识别与分层级相对应的目标簇; 其中使用计算机设备执行至少一个步骤，使得可以可视化多个对象之间的亲和度。

5. 发明申请

US20110246537A1 MATRIX RE-ORDERING AND VISUALIZATION IN THE PRESENCE OF DATA HIERARCHIES 有权
标题翻译：数据分层存在的矩阵重新排序和可视化
公开(公告)号：US20110246537A1
公开(公告)日：2011-10-06
申请号：US12751196
申请日：2010-03-31
申请人： Abderrahim Labbi , Michail Vlachos , Christos Boutsidis
发明人： Abderrahim Labbi , Michail Vlachos , Christos Boutsidis
IPC分类号： G06F17/30 , G06F3/048
CPC分类号： G06F17/30994
摘要： Exemplary embodiments include a method for re-ordering and visualizing a matrix in the presence of a data hierarchy stored on a computer system, the method including receiving a matrix, A, in the computer system, the matrix A having rows and columns, reordering the matrix A so that groups of related rows and columns are brought in adjacent matrix positions, wherein reordering the matrix A obeys constraints imposed by the data hierarchy on at least one of the rows and the columns and reordering the hierarchy on at least one of the rows and columns, wherein affinities in the data hierarchy are extracted by the reordering of the data hierarchy.
摘要翻译：示例性实施例包括在存储在计算机系统上的数据层级存在的情况下重新排序和可视化矩阵的方法，该方法包括在计算机系统中接收矩阵A，该矩阵A具有行和列，重排序矩阵A，使得相关行和列的组被带入相邻的矩阵位置，其中重新排序矩阵A在至少一行行和列上服从由数据层次结构施加的约束，并且在至少一行上重新排序层级和列，其中通过数据层次的重新排序来提取数据层级中的亲和性。

6. 发明授权

US07386520B2 Cost-based method for dynamically pricing and prioritizing an e-mail 有权
标题翻译：基于成本的方法来动态定价和确定电子邮件的优先级
公开(公告)号：US07386520B2
公开(公告)日：2008-06-10
申请号：US10646377
申请日：2003-08-22
申请人： Walter Hehl , Abderrahim Labbi , Mark Lutwyche
发明人： Walter Hehl , Abderrahim Labbi , Mark Lutwyche
IPC分类号： G06F99/00
CPC分类号： G06Q10/107 , G06Q20/10 , G06Q30/0283
摘要： Method for dynamically allocating a cost to an e-mail that a first user of a transmission network such as the Internet network or an Intranet network who is a member of a group, wants to forward to a second user of the transmission network who is also a member of the group. The method comprising the steps of forwarding by the first user the e-mail to a market engine in charge of allocating a cost to the e-mail, determining by the market engine the cost of the e-mail based upon intrinsic and extrinsic criteria, submitting the cost of the e-mail to the first user for agreement, forwarding by the market engine the e-mail to the second user, and updating a credit account associated with the first user.
摘要翻译：为电子邮件动态分配费用的方法，即作为组成员的诸如因特网或诸如互联网或内联网的传输网络的第一用户想要转发给传输网络的第二用户，该组的成员。该方法包括以下步骤：将电子邮件转发给负责向电子邮件分配成本的市场引擎，由市场引擎根据内在和外在标准确定电子邮件的成本，将所述电子邮件的成本提交给所述第一用户以进行协商，由市场引擎将所述电子邮件转发给所述第二用户，以及更新与所述第一用户相关联的信用账户。

7. 发明授权

US06931347B2 Safety stock determination 失效
标题翻译：安全库存决定
公开(公告)号：US06931347B2
公开(公告)日：2005-08-16
申请号：US10743249
申请日：2003-12-22
申请人： Richard A. Boedi , Abderrahim Labbi , Ulrich B. Schimpel
发明人： Richard A. Boedi , Abderrahim Labbi , Ulrich B. Schimpel
IPC分类号： G06F15/00 , G06Q10/08
CPC分类号： G06Q10/087
摘要： The invention is directed to a method for assigning to a set of products a set of corresponding continuous demand densities. In a conversion step for each product its demand time series is converted into a discrete demand density. In a normalization step the discrete demand densities are transformed into normalized discrete demand densities. In a clustering step each of the normalized discrete demand densities is assigned to a cluster and for each cluster a cluster-representative discrete density is determined. In a selection step for each cluster-representative discrete density out of a predetermined set of continuous model densities a cluster-representative continuous density is selected. In a parameter-determination step for each product for its cluster-representative continuous density product-individual density parameters are determined under use of which for each product a continuous density is determined. In an adjustment step for each product the continuous density is adjusted into the continuous demand density.
摘要翻译：本发明涉及一种用于向一组产品分配一组相应的连续需求密度的方法。在每个产品的转换步骤中，其需求时间序列被转换成离散的需求密度。在归一化步骤中，离散需求密度被转换成归一化的离散需求密度。在聚类步骤中，将归一化的离散需求密度中的每一个分配给群集，并且对于每个群集，确定簇代表的离散密度。在对于预定的连续模型密度集合中的每个簇代表的离散密度的选择步骤中，选择簇代表连续密度。在用于其聚簇代表性连续密度乘积密度参数的每个产品的参数确定步骤中，在使用其中确定每个产品的连续密度的确定步骤。在每个产品的调整步骤中，将连续密度调整为连续需求密度。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式