Patents by Inventor Abderrahim Labbi

Abderrahim Labbi has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Publication number: 20110246537
    Abstract: 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.
    Type: Application
    Filed: March 31, 2010
    Publication date: October 6, 2011
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Abderrahim Labbi, Michail Vlachos, Christos Boutsidis
  • Publication number: 20110097001
    Abstract: 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.
    Type: Application
    Filed: October 19, 2010
    Publication date: April 28, 2011
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Abderrahim Labbi, Michail Vlachos
  • Patent number: 7386520
    Abstract: 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.
    Type: Grant
    Filed: August 22, 2003
    Date of Patent: June 10, 2008
    Assignee: International Business Machines Corporation
    Inventors: Walter Hehl, Abderrahim Labbi, Mark Lutwyche
  • Patent number: 7318038
    Abstract: 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.
    Type: Grant
    Filed: July 11, 2002
    Date of Patent: January 8, 2008
    Assignee: International Business Machines Corporation
    Inventor: Abderrahim Labbi
  • Patent number: 6931347
    Abstract: 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.
    Type: Grant
    Filed: December 22, 2003
    Date of Patent: August 16, 2005
    Assignee: International Business Machines Corporation
    Inventors: Richard A. Boedi, Abderrahim Labbi, Ulrich B. Schimpel
  • Publication number: 20040133403
    Abstract: 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.
    Type: Application
    Filed: December 22, 2003
    Publication date: July 8, 2004
    Inventors: Richard A. Boedi, Abderrahim Labbi, Ulrich B. Schimpel
  • Publication number: 20040098460
    Abstract: 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.
    Type: Application
    Filed: August 22, 2003
    Publication date: May 20, 2004
    Applicant: International Business Machines Corporation
    Inventors: Walter Hehl, Abderrahim Labbi, Mark Lutwyche
  • Publication number: 20030023470
    Abstract: 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.
    Type: Application
    Filed: July 11, 2002
    Publication date: January 30, 2003
    Applicant: International Business Machines Corporation
    Inventor: Abderrahim Labbi