Patents by Inventor Ian Munro

Ian Munro 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: 20200047173
    Abstract: Method of preparing a molecular catalyst from a mixture comprising a (C5-C7)alkane, a spray-dried alkylaluminoxane, and a molecular procatalyst. Molecular catalysts prepared by the method may be screened.
    Type: Application
    Filed: September 26, 2017
    Publication date: February 13, 2020
    Inventors: Ian Munro, Roger L. Kuhlman, Angela I. Padilla-Acevedo
  • Patent number: 9198903
    Abstract: There is provided the use of a 5-HT2A receptor antagonist to treat or prevent thrombosis, particularly arterial thrombosis, in a human or animal patient. The patient is suitably one who is at risk of bleeding, particularly those about to undergo, or those undergoing, surgery. A preferred 5-HT2A antagonist is thromboserin.
    Type: Grant
    Filed: February 28, 2008
    Date of Patent: December 1, 2015
    Assignee: Thromboserin Limited
    Inventor: Mark Ian Munro Noble
  • Publication number: 20100093791
    Abstract: There is provided the use of a 5-HT2A receptor antagonist to treat or prevent thrombosis, particularly arterial thrombosis, in a human or animal patient. The patient is suitably one who is at risk of bleeding, particularly those about to undergo, or those undergoing, surgery. A preferred 5-HT2A antagonist is thromboserin.
    Type: Application
    Filed: February 28, 2008
    Publication date: April 15, 2010
    Applicant: THROMBOSERIN LIMITED
    Inventor: Mark Ian Munro Noble
  • Publication number: 20020075734
    Abstract: A digital memory structure manages a subset N of a universe U={0 . . . .M-1 } of elements e, where the universe U is represented by a complete binary tree of height m+1 with elements e of the universe U at its leaves. The digital memory structure has an array of overlapped registers reg[i], preferably where O i M/2-1, for storing internal nodes of the binary tree along respective paths from ancestors of the leaves to root. Location j of register reg[i] is arranged to store internal node k, preferably where k=(i div 2j)+2m−j−l). Any internal node of the binary tree is stored tagged, if the right and/or left subtree thereof contain(s) at least one element of subset N. The digital memory structure also has an array of pointers internal[l], preferably where 1 1 M-1, to the smallest element in the right subtree, and/or the largest element in the left subtree, of each respective ontemal node 1.
    Type: Application
    Filed: May 24, 2001
    Publication date: June 20, 2002
    Inventors: James Ian Munro, Andrej Brodnik, Svante Carlsson