TMCnet News
U.S. Patents Awarded to Inventors in North Carolina (May 16)(Targeted News Service Via Acquire Media NewsEdge) Targeted News Service Targeted News Service ALEXANDRIA, Va., May 16 -- The following federal patents were awarded to inventors in North Carolina. *** BMC Software Assigned Patent ALEXANDRIA, Va., May 16 -- BMC Software, Houston, has been assigned a patent (8,180,728) developed by Gary Lewis Jackson, Charlotte, N.C., for an "area-specific reload of database." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A hierarchical database stores data for the database in a plurality of areas. A disclosed technique allows reorganization of one or more areas of the database without stopping the entire database. The areas to be reorganized are first stopped, then the areas are unloaded, reorganized, and reloaded, before restarting the reorganized areas. In-memory control blocks for the areas are updated to indicate to the database software that the areas have been reorganized, without stopping the entire database." The patent application was filed on Sept. 21, 2009 (12/563,657). The full-text of the patent can be found at http://patft1.uspto.gov/netacgi/nph-Parser?Sect1=PTO1&Sect2=HITOFF&d=PALL&p=1&u=%2Fnetahtml%2FPTO%2Fsrchnum.htm&r=1&f=G&l=50&s1=8,180,728.PN.&OS=PN/8,180,728&RS=PN/8,180,728 Written by Shabnam Sheikh; edited by Jaya Anand. *** Red Hat Assigned Patent for Methods for Improving File System Performance ALEXANDRIA, Va., May 16 -- Red Hat, Raleigh, N.C., has been assigned a patent (8,180,736) developed by James P. Schneider, Raleigh, N.C., for "methods for improving file system performance." The abstract of the patent published by the U.S. Patent and Trademark Office states: "Techniques for managing inodes of a file system are described herein. According to one embodiment, in response to a request received at the file system for committing a file to a storage, a first indirect block having multiple entries is allocated. At least one entry stores a pointer linked with a data block, where the first indirect block is referenced by a pointer stored within an inode associated with the file. A first set of data blocks having a first predetermined number of data blocks is allocated, where each entry is referenced by a pointer stored in an entry of the first indirect block. The first indirect block and the first set of data blocks are contiguous blocks with respect to each other, such that content of the first indirect block and the first set of data blocks can be retrieved via a single storage access operation." The patent application was filed on Aug. 29, 2008 (12/201,960). The full-text of the patent can be found at http://patft1.uspto.gov/netacgi/nph-Parser?Sect1=PTO1&Sect2=HITOFF&d=PALL&p=1&u=%2Fnetahtml%2FPTO%2Fsrchnum.htm&r=1&f=G&l=50&s1=8,180,736.PN.&OS=PN/8,180,736&RS=PN/8,180,736 Written by Shabnam Sheikh; edited by Jaya Anand. *** International Business Machines Assigned Patent for Method to Allow Role Based Selective Document Access Between Domains ALEXANDRIA, Va., May 16 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,181,257) developed by four co-inventors for a "method to allow role based selective document access between domains." The co-inventors are Raghuveera N. Chalasani, Fairfax, Va., Yen-Fu Chen, Austin, Texas, Barry P. Evans, Cary, N.C., and Hari Shankar, Cary, N.C. The abstract of the patent published by the U.S. Patent and Trademark Office states: "An improved solution for allowing role based selective access to a document between a plurality of domains is provided. In an embodiment of the invention, a method for allowing selective access to a document between a plurality of domains includes: obtaining a composed section of the document at a first domain; applying a security policy at the first domain to the composed section of the document; distributing the security policy from the first domain to a second domain, wherein the second domain is different than the first domain; and applying the security policy to the document at the second domain." The patent application was filed on June 15, 2007 (11/763,527). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=8,181,257&OS=8,181,257&RS=8,181,257 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** Cadence Design Systems Assigned Patent ALEXANDRIA, Va., May 16 -- Cadence Design Systems, San Jose, Calif., has been assigned a patent (8,181,137) developed by Prasanti Uppaluri, Cary, N.C., and Doug Den Dulk, Apex, N.C., for a "layout versus schematic error system and method." The abstract of the patent published by the U.S. Patent and Trademark Office states: "According to various embodiments of the invention, systems and methods for presenting Layout Versus Schematic (LVS) errors within a layout using a visual circuit representation of the design and highlighting is provided. One embodiment includes overlaying the layout circuit representation on the schematic circuit representation with highlighting that indicates the LVS errors. The method of such an embodiment compares a layout netlist against a schematic netlist in order to identify the layout-versus-schematic errors, generates a graphical representation of the layout netlist and a graphical representation of the schematic netlist, displays an overlay of the graphical representation of the layout netlist with the graphical representation of the schematic netlist and then, highlights the identified layout-versus-schematic errors that are present." The patent application was filed on Sept. 4, 2008 (12/204,708). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=8,181,137&OS=8,181,137&RS=8,181,137 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** International Business Machines Assigned Patent for System and Method for Application Server/Operating System Network/Configuration Management ALEXANDRIA, Va., May 16 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,180,865) developed by four co-inventors for a "system and method for application server/operating system network/configuration management." The co-inventors are Rohith Kottamangalam Ashok, Apex, N.C., Natasha Pothen, Raleigh, N.C., Juniarti A. Suryakusuma, Cedar Park, Texas, and Leigh Allen Williamson, Austin, Texas. The abstract of the patent published by the U.S. Patent and Trademark Office states: "The invention discloses a system and method for network application server/operating system management by packaging configuration function(s) into independently partitioned profiles (or "silos") that can be dynamically invoked by an "administrative agent" server/program using a "proxy server"/program to distribute profile configuration changes to one or more administrative agents (each of which is assigned one or more application servers/systems)." The patent application was filed on July 11, 2007 (11/776,531). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=8,180,865&OS=8,180,865&RS=8,180,865 Written by Arpi Sharma; edited by Anand Kumar. *** International Business Machines Assigned Patent for Self-checkout Coupon Sharing ALEXANDRIA, Va., May 16 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,180,670) developed by Thomas J. Prorock, Raleigh, N.C., David T. Rogers, Wake Forest, N.C., and Julia P. Rockwell, Youngsville, N.C., for a self-checkout coupon sharing. The abstract of the patent published by the U.S. Patent and Trademark Office states: "The present invention is directed to a system for processing coupons by a self checkout system, where the self checkout system includes at least one self checkout station coupled to a server. In a first aspect, a self checkout system includes a server for managing the self checkout system and at least one self checkout station coupled to the server, where the self checkout station includes a scanner for scanning at least one item for purchase by a customer, a coupon reader for receiving a coupon from the customer, and a coupon manager. The coupon manager attempts to validate the coupon against the at least one item scanned by the customer, and if the coupon fails to validate, the coupon manager stores the coupon in a coupon pool at the server such that the stored coupon can be utilized at a subsequent sales transaction." The patent application was filed on June 3, 2008 (12/132,473). The full-text of the patent can be found at http://patft1.uspto.gov/netacgi/nph-Parser?Sect1=PTO1&Sect2=HITOFF&d=PALL&p=1&u=%2Fnetahtml%2FPTO%2Fsrchnum.htm&r=1&f=G&l=50&s1=8,180,670.PN.&OS=PN/8,180,670&RS=PN/8,180,670 Written by Shabnam Sheikh; edited by Jaya Anand. *** Red Hat Assigned Patent ALEXANDRIA, Va., May 16 -- Red Hat, Raleigh, N.C., has been assigned a patent (8,180,854) developed by James P. Schneider, Raleigh, N.C., for aspect services. The abstract of the patent published by the U.S. Patent and Trademark Office states: "An aspect request associated with a web application is received by an aspect server, the web application being hosted by a web application server that is remote from the aspect server. Operations are performed according to the aspect request, the operations being associated with a crosscutting concern. A result is returned, the result supplementing functionality of the web application." The patent application was filed on May 29, 2008 (12/129,670). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=8,180,854&OS=8,180,854&RS=8,180,854 Written by Arpi Sharma; edited by Anand Kumar. *** International Business Machines Assigned Patent for Dynamic Redeployment of Services in a Computing Network ALEXANDRIA, Va., May 16 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,180,871) developed by four co-inventors for a "dynamic redeployment of services in a computing network." The co-inventors are Peter J. Brittenham, Apex, N.C., Douglas B. Davis, Raleigh, N.C., David B. Lindquist, Raleigh, N.C., and Ajamu A. Wesley, Raleigh, N.C. The abstract of the patent published by the U.S. Patent and Trademark Office states: "Methods, systems, and computer program products for improving network operations by dynamically redeploying services (such as web services or other network-accessible services) in a computing network. A programmatic replication or redeployment process is defined, whereby system upgrades may be implemented by redeploying services dynamically, without human intervention, enabling the complexity of upgrading previously-deployed software to be reduced significantly." The patent application was filed on May 23, 2001 (09/864,608). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=8,180,871&OS=8,180,871&RS=8,180,871 Written by Arpi Sharma; edited by Anand Kumar. *** International Business Machines Assigned Patent for Arrangements for Auto-merging Processing Components ALEXANDRIA, Va., May 16 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,180,862) developed by six co-inventors for "arrangements for auto-merging processing components." The co-inventors are Marcus A. Baker, Apex, N.C., Marlene J. Gillingham, Bellevue, Wash., Mark V. Kapoor, Durham, N.C., Sheldon J. Sigrist, Cary, N.C., Karen A. Taylor, Cary, N.C., and Steven J. Zaharias, Issaquah, Wash. The abstract of the patent published by the U.S. Patent and Trademark Office states: "In some embodiments, a method for auto-configuring a network is disclosed. The method can include communicating with at least one node in a processing complex, receiving node connection data from the at least one node querying a node to verify at least a portion of the node connection data, and auto-configuring system partitioning in response to the node connection data. In some embodiments, the method can also include verifying the node connection data by transmitting a request for a universally unique identifier and a node identifier. The node identifier can be associated with the universally unique identifier. The node identifier can be utilized in data transmitted between nodes." The patent application was filed on Aug. 30, 2007 (11/847,568). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=8,180,862&OS=8,180,862&RS=8,180,862 Written by Arpi Sharma; edited by Anand Kumar. *** zvelo Assigned Patent ALEXANDRIA, Va., May 16 -- zvelo, Greenwood Village, Colo., has been assigned a patent (8,180,909) developed by four co-inventors for a managed services platform. The co-inventors are Robert Charles Hartman, Aurora, Colo., John Elton Dietrich II, Cary, N.C., Jeffrey James Finn, Englewood, Colo., and Rodney Dean Holm, Evergreen, Colo. The abstract of the patent published by the U.S. Patent and Trademark Office states: "A managed services platform. An applications management server is provided for managing relationships with application service providers and others over a wide area network such as the Internet. The applications management server interfaces with a master database server and the servers of one or more application service providers, or other entities, to facilitate selection and deselection of applications, services, and capabilities that may be available for use by the information technology network of a company." The patent application was filed on Oct. 9, 2007 (11/869,552). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=8,180,909&OS=8,180,909&RS=8,180,909 Written by Arpi Sharma; edited by Anand Kumar. *** International Business Machines Assigned Patent for Method of Routing Messages to Multiple Consumers ALEXANDRIA, Va., May 16 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,180,823) developed by six co-inventors for a "method of routing messages to multiple consumers." The co-inventors are Srinivas Hasti, Stamford, Conn., Brian Keith Martin, Cary, N.C., Michael Joseph Spreitzer, Croton-on-Hudson, N.Y., Graham Derek Wallis, Hampshire, United Kingdom, David Ware, Wiltshire, United Kingdom, and Neil George Stanley Young, Hampshire, United Kingdom. The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method of routing messages to multiple consumers comprises determining a probability function defining message classification probabilities for each of a plurality of consumer sets, receiving a plurality of messages, classifying each message, storing each message in a queue, receiving notification of a consumer available to process a message, ascertaining the consumer set to which the available consumer belongs, accessing the probabilities for the ascertained consumer set, selecting a message classification according to the accessed probabilities, and transmitting a message, of the selected classification, to the available consumer." The patent application was filed on Aug. 27, 2008 (12/198,939). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=8,180,823&OS=8,180,823&RS=8,180,823 Written by Arpi Sharma; edited by Anand Kumar. *** International Business Machines Assigned Patent for Redundancy-free Circuits for Zero Counters ALEXANDRIA, Va., May 16 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,180,815) developed by Aleksandr Kaplun, Whitsett, N.C., and Huajun J. Wen, Austin, Texas, for a "redundancy-free circuits for zero counters." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A more efficient method of counting the number of zeros in a 4-bit value generates three output bits (q0, q1 and q2) from four input bits (a0, a1, a2 and a3) according to the logic equations q0=not(a1+a2+a3+a4), q1=not(a0+a1), q2=a1(not a0)+not(a0+a2). These output bits yield the number of non-significant (leading or trailing) zeros in the 4-bit value. The invention may be implemented in a 16-bit zero counter having four 4-bit decoders, but is applicable to any number of zero counters. The output bits from the four 4-bit decoders can be combined to yield a 5-bit count whose most significant bit is a one when all input bits from all four of the 4-bit blocks are zero. A multiplexer stage derives two outputs based on a portion of the decode bits. For wider counters, the output stage uses four AOI21 gates to merge additional decode bits from a next lower 16-bit zero counter." The patent application was filed on Aug. 12, 2008 (12/189,794). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=8,180,815&OS=8,180,815&RS=8,180,815 Written by Arpi Sharma; edited by Anand Kumar. *** International Business Machines Assigned Patent for System to Improve Error Correction Using Variable Latency and Associated Methods ALEXANDRIA, Va., May 16 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,181,094) developed by seven co-inventors for a "system to improve error correction using variable latency and associated methods." The co-inventors are Luis A. Lastras-Montano, Cortlandt Manor, N.Y., Piyush C. Patel, Cary, N.C., Eric E. Retter, Austin, Texas, Barry M. Trager, Yorktown Heights, N.Y., Michael R. Trombley, Cary, N.C., Shmuel Winograd, Scarsdale, N.Y., and Kenneth L. Wright, Austin, Texas. The abstract of the patent published by the U.S. Patent and Trademark Office states: "A system to improve error correction includes a fast decoder to process data packets until the fast decoder finds an uncorrectable error in a data packet at which point a request for at least two data packets is generated. The system also includes a slow decoder to correct the uncorrectable error in a data packet based upon the at least two data packets." The patent application was filed on Jan. 31, 2008 (12/023,546). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=8,181,094&OS=8,181,094&RS=8,181,094 Written by Kusum Sangma; edited by Anand Kumar. *** FormRouter Assigned Patent ALEXANDRIA, Va., May 16 -- FormRouter, Cary, N.C., has been assigned a patent (8,180,799) developed by James J. Healy, Apex, N.C., and David Richard Conorozzo, Cary, N.C., for a "dynamically creating tables to store received data." The abstract of the patent published by the U.S. Patent and Trademark Office states: "Methods, systems, and apparatus for dynamically creating tables to store received data. A form that includes data of one or more data types is received. Each of the data types is associated with a corresponding field type. The data types in the form are identified, and a storage location configured to store data of the field-type is accessed. Field types in the storage location are compared with those of the received data, and on determining that a portion of the data is of a data type that the storage location is not configured to store, the storage location is modified to store that portion of the data." The patent application was filed on April 12, 2010 (12/758,634). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=8,180,799&OS=8,180,799&RS=8,180,799 Written by Arpi Sharma; edited by Anand Kumar. *** Google Assigned Patent for Generating Action Trails from Web History ALEXANDRIA, Va., May 16 -- Google, Mountain View, Calif., has been assigned a patent (8,180,778) developed by four co-inventors for "generating action trails from web history." The co-inventors are Elin Pedersen, Portola Valley, Calif., Karl A. Gyllstrom, Chapel Hill, N.C., Shengyin Gu, Sunnyvale, Calif., and Peter Jin Hong, San Francisco. The abstract of the patent published by the U.S. Patent and Trademark Office states: "Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for generating action trails from web history are described. In one aspect, a method includes receiving a web content access history of a user, the content access history including one or more user actions, each user action being associated with a content item upon which the user action is performed and identifying one or more action trails from the content access history, each action trail including a sequence of user actions performed one content items relating to a topic. Identifying a particular action trail includes clustering the user actions into a series of segments using temporal criteria; calculating semantic similarities between the content items, and adding a segment of the series of segments to the action trail when the semantic similarities between the segment and another segment satisfy a similarity threshold." The patent application was filed on Feb. 5, 2010 (12/701,444). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=8,180,778&OS=8,180,778&RS=8,180,778 Written by Arpi Sharma; edited by Anand Kumar. *** Cisco Technology Assigned Patent for System and Method for Operating a Packet Buffer in an Intermediate Node ALEXANDRIA, Va., May 16 -- Cisco Technology, San Jose, Calif., has been assigned a patent (8,180,966) developed by Kenneth M. Key, Raleigh, N.C., Kwok Ken Mak, Chapel Hill, N.C., and Xiaoming Sun, Chapel Hill, N.C., for a "system and method for operating a packet buffer in an intermediate node." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A technique implements a novel high-speed high-density packet buffer utilizing a combination of high-speed and low-speed memory devices. The novel packet buffer is organized as a plurality of FIFO queues where each FIFO queue is associated with a particular input or output line. Each queue comprises a high-speed cache portion that resides in high-speed memory and a low-speed high-density portion that resides in low-speed high-density memory. The high-speed cache portion contains FIFO data that contains head and/or tail associated with the novel FIFO queue. The low-speed high-density portion contains FIFO data that is not contained in the high-speed cache portion." The patent application was filed on March 25, 2005 (11/090,734). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=8,180,966&OS=8,180,966&RS=8,180,966 Written by Kusum Sangma; edited by Anand Kumar. For more information about Targeted News Service products and services, please contact: Myron Struck, editor, Targeted News Service LLC, Springfield, Va., 703/304-1897; [email protected]; http://targetednews.com. -1087084 (c) 2012 Targeted News Service |