Patents by Inventor Kumar Annamraju

Kumar Annamraju 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).

  • Patent number: 8978028
    Abstract: Described is installing multiple software packages to a computing device in a single transaction, whereby the multiple package installation commits if successful, or the device is rolled back to a determined state if unsuccessful. A client process provides a system service (installer) with a package, and the service partitions package installation actions into execution, commit and rollback phases, with the execution phase run for each package. If successful, the transaction is committed by performing the multiple commit phases. If unsuccessful, the installation is rolled back via the rollback phases. The phases may be interleaved, with execution and commit phases performed in FIFO order, and rollback phases performed in LIFO order. A client process may dynamically determine which packages to install, a client process may be embedded in a package and join the transaction, and/or one client process may delegate control to another client to add package actions to the transaction.
    Type: Grant
    Filed: October 10, 2007
    Date of Patent: March 10, 2015
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Robert Charles Flaming, Hemchander V. Sannidhanam, Venkata Kiran Kumar Annamraju, William L. Cheng, Kin Yip Kenneth Wong, Carolyn L. Napier
  • Patent number: 8874375
    Abstract: A computer receives a set of Cartesian data and a set of geodetic data. A set of control points may be generated. A plurality of sets of Cartesian coordinates for each control point may be determined, wherein each set of coordinates corresponds to a Cartesian system. A deviation is determined for a combination that includes a control point and a Cartesian system. For each set of Cartesian coordinates associated with the Cartesian system that is included in the combination, and further associated with a control point not in the combination, the set of coordinates is modified according to the deviation. A cumulative deviation is determined for a plurality of combinations by determining a sum of distances of each set of modified Cartesian coordinates from the coordinates of the corresponding point in the Cartesian data. A combination associated with a minimum cumulative deviation is identified.
    Type: Grant
    Filed: October 6, 2010
    Date of Patent: October 28, 2014
    Assignee: Verizon Patent and Licensing Inc.
    Inventors: Ching-Yun Yeh, Kumar Annamraju, Anurag X. Singh, Nageswara R. Tanuku
  • Patent number: 8509116
    Abstract: A computer-implemented method receives a list of polygonal vertices associated with multiple polygons located in proximity to one another in a two-dimensional region and analyzes the polygonal vertices. The method automatically generates, based on the analysis, a polygonal hull that encloses the multiple polygons such that a line segment connecting any two polygonal vertices of the multiple polygons falls completely inside the generated polygonal hull. The multiple polygons may correspond to a two-dimensional geographic region. The computer-implemented method may be used for geographic regional segmentation.
    Type: Grant
    Filed: August 26, 2010
    Date of Patent: August 13, 2013
    Assignee: Verizon Patent and Licensing, Inc.
    Inventors: Ching-Yun Yeh, Robert Funk, Kumar Annamraju
  • Patent number: 8284698
    Abstract: A computer-implemented method receives a set of data regarding a layout of a network, where the data specifies the interconnection of linear facilities and specifies at least one network point that is disconnected from the network. The computer-implemented method further determines a closest one of the linear facilities to the at least one network point based on the set of data and shifts the at least one network point to connect the at least one network point to the network based on a distance between a vertex associated with the closest one of the linear facilities and the at least one network point. The computer-implemented method also shifts the closest one of the linear facilities to connect the at least one network point in the network based on a distance associated with a linear projection from the at least one network point to the closest one of the linear facilities.
    Type: Grant
    Filed: June 9, 2008
    Date of Patent: October 9, 2012
    Assignee: Verizon Patent and Licensing Inc.
    Inventors: Ching-Yun Yeh, Robert Funk, Kumar Annamraju
  • Publication number: 20120089333
    Abstract: A computer receives a set of Cartesian data and a set of geodetic data relating to a geographic area. A set of control points is generated, each control point being associated with a coordinate expressed in terms of latitude and longitude, and with a corresponding point in the Cartesian data. A plurality of sets of Cartesian coordinates is determined for each of the control points, each of the sets of Cartesian coordinates for one of the control points corresponding to a Cartesian system. A deviation is determined for a combination that includes a control point and a Cartesian system, the deviation being a difference between coordinates for the point in the Cartesian data and the set of Cartesian coordinates for the control point. For each set of Cartesian coordinates associated with the Cartesian system that is included in the combination, but further associated with a control point not in the combination, the set of Cartesian coordinates is modified according to the deviation.
    Type: Application
    Filed: October 6, 2010
    Publication date: April 12, 2012
    Inventors: Ching-Yun Yeh, Kumar Annamraju, Anurag X. Singh, Nageswara R. Tanuku
  • Publication number: 20100315977
    Abstract: A computer-implemented method receives a list of polygonal vertices associated with multiple polygons located in proximity to one another in a two-dimensional region and analyzes the polygonal vertices. The method automatically generates, based on the analysis, a polygonal hull that encloses the multiple polygons such that a line segment connecting any two polygonal vertices of the multiple polygons falls completely inside the generated polygonal hull. The multiple polygons may correspond to a two-dimensional geographic region. The computer-implemented method may be used for geographic regional segmentation.
    Type: Application
    Filed: August 26, 2010
    Publication date: December 16, 2010
    Applicant: VERIZON PATENT AND LICENSING INC.
    Inventors: Ching-Yun YEH, Robert FUNK, Kumar ANNAMRAJU
  • Patent number: 7813301
    Abstract: A computer-implemented method receives a list of polygonal vertices associated with multiple polygons located in proximity to one another in a two-dimensional region and analyzes the polygonal vertices. The method automatically generates, based on the analysis, a polygonal hull that encloses the multiple polygons such that a line segment connecting any two polygonal vertices of the multiple polygons falls completely inside the generated polygonal hull. The multiple polygons may correspond to a two-dimensional geographic region. The computer-implemented method may be used for geographic regional segmentation.
    Type: Grant
    Filed: May 8, 2008
    Date of Patent: October 12, 2010
    Assignee: Verizon Patent and Licensing Inc.
    Inventors: Ching-Yun Yeh, Robert Funk, Kumar Annamraju
  • Publication number: 20090303903
    Abstract: A computer-implemented method receives a set of data regarding a layout of a network, where the data specifies the interconnection of linear facilities and specifies at least one network point that is disconnected from the network. The computer-implemented method further determines a closest one of the linear facilities to the at least one network point based on the set of data and shifts the at least one network point to connect the at least one network point to the network based on a distance between a vertex associated with the closest one of the linear facilities and the at least one network point. The computer-implemented method also shifts the closest one of the linear facilities to connect the at least one network point in the network based on a distance associated with a linear projection from the at least one network point to the closest one of the linear facilities.
    Type: Application
    Filed: June 9, 2008
    Publication date: December 10, 2009
    Applicants: VERIZON DATA SERVICES LLC, VERIZON NORTH INC.
    Inventors: Ching-Yun Yeh, Robert Funk, Kumar Annamraju
  • Publication number: 20090279453
    Abstract: A computer-implemented method receives a list of polygonal vertices associated with multiple polygons located in proximity to one another in a two-dimensional region and analyzes the polygonal vertices. The method automatically generates, based on the analysis, a polygonal hull that encloses the multiple polygons such that a line segment connecting any two polygonal vertices of the multiple polygons falls completely inside the generated polygonal hull. The multiple polygons may correspond to a two-dimensional geographic region. The computer-implemented method may be used for geographic regional segmentation.
    Type: Application
    Filed: May 8, 2008
    Publication date: November 12, 2009
    Applicants: Verizon Data Services LLC, Verizon North Inc.
    Inventors: Ching-Yun YEH, Robert FUNK, Kumar ANNAMRAJU
  • Publication number: 20090100421
    Abstract: Described is installing multiple software packages to a computing device in a single transaction, whereby the multiple package installation commits if successful, or the device is rolled back to a determined state if unsuccessful. A client process provides a system service (installer) with a package, and the service partitions package installation actions into execution, commit and rollback phases, with the execution phase run for each package. If successful, the transaction is committed by performing the multiple commit phases. If unsuccessful, the installation is rolled back via the rollback phases. The phases may be interleaved, with execution and commit phases performed in FIFO order, and rollback phases performed in LIFO order. A client process may dynamically determine which packages to install, a client process may be embedded in a package and join the transaction, and/or one client process may delegate control to another client to add package actions to the transaction.
    Type: Application
    Filed: October 10, 2007
    Publication date: April 16, 2009
    Applicant: Microsoft Corporation
    Inventors: Robert Charles Flaming, Hemchander V. Sannidhanam, Venkata Kiran Kumar Annamraju, William L. Cheng, Kin Yip Kenneth Wong, Carolyn L. Napier