Patents by Inventor Andrew R. Koenig

Andrew R. Koenig 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: 20190135827
    Abstract: The present invention provides for compounds of formula (I) wherein X, Y, and R1 have any of the values defined in the specification, and pharmaceutically acceptable salts thereof, that are useful as agents in the treatment of diseases and conditions mediated and modulated by CFTR, including cystic fibrosis, Sjögren's syndrome, pancreatic insufficiency, chronic obstructive lung disease, and chronic obstructive airway disease. Also provided are pharmaceutical compositions comprised of one or more compounds of formula (I).
    Type: Application
    Filed: January 8, 2019
    Publication date: May 9, 2019
    Inventors: Robert J. Altenbach, Andrew Bogdan, Marlon D. Cowart, William Rameshchandra Krishna Esmieu, Gregory A. Gfesser, Stephen N. Greszler, John R. Koenig, Philip R. Kym, Bo Liu, Karine Fabienne Malagu, Sachin V. Patel, Marc J. Scanio, Xenia B. Searle, Eric Voight, Xueqing Wang, Ming C. Yeung
  • Patent number: 6057782
    Abstract: A method and apparatus for a paging service to automatically respond to a paging acknowledgment. The pager server receives an initial pager request from an originating user. The initial paging request is sent to a target user by the paging server. An acknowledgment to the initial pager request is received at the paging server from the target user. If the acknowledgment is not positive, alternate users are paged until a positive acknowledgment is received.
    Type: Grant
    Filed: July 30, 1997
    Date of Patent: May 2, 2000
    Assignee: AT&T Corporation
    Inventor: Andrew R. Koenig
  • Patent number: 5530957
    Abstract: A compact representation of a tree data structure and techniques for navigating the compact representation. The compact representation is a list. Each element of the list represents a node of the tree and the list is organized according to a preorder traversal of the tree. Each list element contains only the index of a data dictionary entry for the kind of item represented by the node corresponding to the list element. The navigation techniques permit the location of the list element for the sibling of the node corresponding to the given list element, the location of the list element for that node's parent, and in the case of a parent node, the location of the list element for any child of the parent. The navigation techniques work by finding the list elements for subtrees. The subtrees are found by techniques based on the fact that the number of children of all of the nodes in a subtree minus the number of nodes in the subtree always equals -1.
    Type: Grant
    Filed: August 7, 1992
    Date of Patent: June 25, 1996
    Assignee: AT&T Corp.
    Inventor: Andrew R. Koenig
  • Patent number: 4590470
    Abstract: A system which employs a pair of encryption functions f and g in the "log on" protocol of a computer dial-up arrangement. The functions are inverses of each other and, hence, a random sequence when encrypted with f and then with g results in the original sequence. When a user wishes to "log on", the computer selects a random sequence and forms a challenge sequence. The user encrypts the challenge sequence with the function g and thus forms a response sequence. Encryption with the function f by the computer permits verification of the response sequence.The secrecy of the user's function is maintained by providing the user with an authenticating device having only two ports: a power port and an I/O port. The I/O port is connected to a microprocessor which accesses a memory that contains the secret encryption function g.
    Type: Grant
    Filed: July 11, 1983
    Date of Patent: May 20, 1986
    Assignee: AT&T Bell Laboratories
    Inventor: Andrew R. Koenig