TMCnet News
U.S. Patents Awarded to Inventors in Massachusetts (July 25)(Targeted News Service Via Acquire Media NewsEdge) Targeted News Service Targeted News Service ALEXANDRIA, Va., July 25 -- The following federal patents were awarded to inventors in Massachusetts. *** Mitsubishi Electric Research Laboratories Assigned Patent ALEXANDRIA, Va., July 25 -- Mitsubishi Electric Research Laboratories, Cambridge, Mass., has been assigned a patent (8,229,965) developed by Tony Ezzat, Newton, Mass., for a "system and method for maximizing edit distances between particles." The abstract of the patent published by the U.S. Patent and Trademark Office states: "Embodiments of the invention disclose a system and a method for transforming a set of particles in an output set of particles representing a set of words suitable for use in an information retrieval system. The method generates, for each particle in the set of particles, combinations of parts of a particle, and replaces the particle in the set of particles with the parts of a combination maximizing a total minimum edit distance (MED) of the set of particles. For example, the method determines a MED of each particle in the set of particles, determines the total MED of the set of particles as summations of the MED of each particle, and then determines the combination maximizing the total MED of the set of particles." The patent application was filed on March 31, 2010 (12/751,678). 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,229,965.PN.&OS=PN/8,229,965&RS=PN/8,229,965 Written by Shabnam Sheikh; edited by Jaya Anand. *** Ab Initio Technology Assigned Patent ALEXANDRIA, Va., July 25 -- Ab Initio Technology, Lexington, Mass., has been assigned a patent (8,229,902) developed by five co-inventors for a "managing storage of individually accessible data units." The co-inventors are Ephraim Meriwether Vishniac, Arlington, Mass., Marshall A. Isman, Newton, Mass., Paul Bay, Arlington, Mass., H. Mark Bromley, Lyndeborough, N.H., and John L. Richardson, Santa Barbara, Calif. The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method for managing data includes receiving individually accessible data units, each identified by a key value; storing a plurality of blocks of data, each of at least some of the blocks being generated by combining a plurality of the data units; and providing an index that includes an entry for each of the blocks. One or more of the entries enable location, based on a provided key value, of a block that includes data units corresponding to a range of key values that includes the provided key value." The patent application was filed on Nov. 1, 2006 (11/555,458). 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,229,902.PN.&OS=PN/8,229,902&RS=PN/8,229,902 Written by Shabnam Sheikh; edited by Jaya Anand. *** Jumptap Assigned Patent ALEXANDRIA, Va., July 25 -- Jumptap, Cambridge, Mass., has been assigned a patent (8,229,914) developed by four co-inventors for a "mobile content spidering and compatibility determination." The co-inventors are Jorey Ramer, Brighton, Mass., Adam Soroca, Cambridge, Mass., Dennis Doughty, Brookline, Mass., and Andrew M. Groh, Burlington, Mass. The abstract of the patent published by the U.S. Patent and Trademark Office states: "An aspect of the present invention relates to systems and methods for indexing mobile content, wherein the indexing is based at least in part on compatibility between the content and a mobile communication facility." The patent application was filed on May 8, 2006 (11/382,243). 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,229,914.PN.&OS=PN/8,229,914&RS=PN/8,229,914 Written by Shabnam Sheikh; edited by Jaya Anand. *** Red Hat Assigned Patent ALEXANDRIA, Va., July 25 -- Red Hat, Raleigh, N.C., has been assigned a patent (8,229,951) developed by Seth Nickell, Cambridge, Mass., and Bryan Clark, Cambridge, Mass., for a "method and system for enabling users searching for common subject matter on a computer network to communicate with one another." The abstract of the patent published by the U.S. Patent and Trademark Office states: "Users searching for common subject matter on a computer network are identified and enabled to communicate with one another, such as by engaging in an on-line chat. The users' search queries are transmitted to a server and processed to identify which users are searching for common subject matter within a time window. A dialogue such as an on-line chat is launched and the identified users are invited to join. The users may preview the chat before joining. The users can share links to resources such as web pages and provide annotations to accompany the links. Additionally, the users' search queries may be shared in the chat. The functionality may be provided by a plug-in to web browser software, or by an executable script embedded in a web page of search results." The patent application was filed on July 14, 2005 (11/160,897). 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,229,951.PN.&OS=PN/8,229,951&RS=PN/8,229,951 Written by Shabnam Sheikh; edited by Jaya Anand. *** EMC Assigned Patent ALEXANDRIA, Va., July 25 -- EMC, Hopkinton, Mass., has been assigned a patent (8,229,904) developed by four co-inventors for "storage pools for information management." The co-inventors are Christopher Hercules Claudatos, San Jose, Calif., William Dale Andruss, Minneapolis, Richard Urmston, Westborough, Mass., and Mark Rambacher, Littleton, Mass. The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method, article of manufacture, and apparatus for managing an object are disclosed. In an embodiment, this comprises managing an object having content, in a system having a dynamic policy selector configured with at least one analytic policy applied to evaluate the content of the object. The object is associated to an information management policy. Classification levels may be used, in which classification levels are associated to information management policies and objects are associated with classification levels. Objects containing certain elements or related elements may be associated to form an information group, to which information management policies may be applied as a group. Storage pools may be used for managing objects with similar classification levels or information protection policies." The patent application was filed on Dec. 31, 2004 (11/028,089). 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,229,904.PN.&OS=PN/8,229,904&RS=PN/8,229,904 Written by Shabnam Sheikh; edited by Jaya Anand. *** Palo Alto Research Center Assigned Patent ALEXANDRIA, Va., July 25 -- Palo Alto Research Center, Palo Alto, Calif., has been assigned a patent (8,229,939) developed by Jessica N. Staddon, Redwood City, Calif., and David P. Woodruff, Cambridge, Mass., for a "server-implemented system and method for providing private inference control." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A server system maintains records and their associated attributes in a secure database. A plurality of queries generated by encrypting indices identifying a records and their associated attributes, by homomorphic encryption is received from a client system. A secret key is generated at a certain query count and is divided into randomly generated key shares. A key share sequence is homomorphically encrypted. A table is formed by encrypting the indices, secret key and attributes. Query responses, which each comprise the attributes for each of the records of the table of entries are provided. The key shares are decrypted sufficient to recover the secret key subject to a non-inference enabling query." The patent application was filed on Dec. 29, 2008 (12/345,599). 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,229,939.PN.&OS=PN/8,229,939&RS=PN/8,229,939 Written by Shabnam Sheikh; edited by Jaya Anand. *** Hitachi Data Systems Assigned Patent ALEXANDRIA, Va., July 25 -- Hitachi Data Systems, Santa Clara, Calif., has been assigned a patent (8,229,893) developed by Jack A. Orenstein, Needham, Mass., and David E. Chavez, Amesury, Mass., for a "metadata management for fixed content distributed data storage." The abstract of the patent published by the U.S. Patent and Trademark Office states: "An archival storage cluster of preferably symmetric nodes includes a metadata management system that organizes and provides access to given metadata, preferably in the form of metadata objects. Each metadata object may have a unique name, and metadata objects are organized into regions. Preferably, a region is selected by hashing one or more object attributes (e.g., the object's name) and extracting a given number of bits of the resulting hash value. The number of bits may be controlled by a configuration parameter. Each region is stored redundantly. A region comprises a set of region copies. In particular, there is one authoritative copy of the region, and zero or more backup copies. The number of backup copies may be controlled by a configuration parameter. Region copies are distributed across the nodes of the cluster so as to balance the number of authoritative region copies per node, as well as the number of total region copies per node. Backup region copies are maintained synchronized to their associated authoritative region copy." The patent application was filed on Feb. 1, 2010 (12/697,331). 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,229,893.PN.&OS=PN/8,229,893&RS=PN/8,229,893 Written by Shabnam Sheikh; edited by Jaya Anand. *** Harvest Technologies Assigned Patent ALEXANDRIA, Va., July 25 -- Harvest Technologies, Plymouth, Mass., has been assigned a patent (RE43,547) developed by James R. Ellsworth, Marshfield, Mass., and Steven F. Levesque, Hanson, Mass., for "blood components separator disk." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A separator disk for use in centrifugal separation of components is designed to automatically position itself during separation at the interface between the supernatant and the remaining components. Preferably the interface is between plasma and red blood cells." The patent application was filed on June 15, 2011 (13/161,239). 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=RE43,547&OS=RE43,547&RS=RE43,547 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** CA, Inc. Assigned Patent ALEXANDRIA, Va., July 25 -- CA, Inc., Islandia, N.Y., has been assigned a patent (8,230,509) developed by Paul Alan Gassoway, Norwood, Mass., for a "system and method for using rules to protect against malware." The abstract of the patent published by the U.S. Patent and Trademark Office states: "The invention provides a method of disabling malicious or unwanted software on a computer system using a plurality of rules, wherein the plurality of rules automatically disable functions originating from malicious software. In one embodiment, the method includes detecting a function that is attempting to act on an object within the computer system and identifying one or more rules from the plurality of rules that apply to the object. The function may then be automatically disabled when the identified rules indicate that the function should be disabled." The patent application was filed on Sept. 14, 2006 (11/520,656). 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,230,509&OS=8,230,509&RS=8,230,509 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** Oracle International Assigned Patent for Constraint based System with Domain Splitting ALEXANDRIA, Va., July 25 -- Oracle International, Redwood Shores, Calif., has been assigned a patent (8,229,870) developed by four co-inventors for a "constraint based system with domain splitting." The co-inventors are Claire M. Bagley, Carlisle, Mass., Joyce Ng, Sunnyvale, Calif., Gao Chen, Beijing, and Martin P. Plotkin, Concord, Mass. The abstract of the patent published by the U.S. Patent and Trademark Office states: "A solver for a constraint satisfaction problem includes a plurality of variables and a plurality of constraints. A floating point variable has a domain and is assigned a value by first determining if a predetermined value can be assigned to the floating point variable if the predetermined value is in the domain. If not, the solver determines if a bound of the domain can be assigned to the floating point variable. If the predetermined value can not be assigned to the floating point variable and the bound of the domain can not be assigned to the floating point variable, the solver assigns a value to the floating point variable using domain splitting." The patent application was filed on April 28, 2009 (12/431,096). 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,229,870.PN.&OS=PN/8,229,870&RS=PN/8,229,870 Written by Shabnam Sheikh; edited by Jaya Anand. *** MathWorks Assigned Patent ALEXANDRIA, Va., July 25 -- MathWorks, Natick, Mass., has been assigned a patent (8,230,515) developed by four co-inventors for a parameter based operation. The co-inventors are Nathan E. Brewton, Wayland, Mass., Victor Chudnovsky, Brookline, Mass., Joe DiPietro, Worcester, Mass., and Jeff Wendlandt, Newton, Mass. The abstract of the patent published by the U.S. Patent and Trademark Office states: "A device may include communication logic to receive a request to perform an activity on behalf of a client, where the activity is related to a primary application and a secondary application. The communication logic may send a response that allows the client to perform the activity when the client is authorized. The device may include evaluation logic to determine whether the client is related to the primary license and to determine whether a secondary license related to the secondary application is available. The evaluation logic may allocate the available secondary license to the client for use with the secondary application when the secondary license is available. The evaluation logic may authorize the client to perform the activity when the secondary license is allocated to the client." The patent application was filed on Oct. 16, 2006 (11/581,961). 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,230,515&OS=8,230,515&RS=8,230,515 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** MathWorks Assigned Patent for General Interface with Arbitrary Job Managers ALEXANDRIA, Va., July 25 -- MathWorks, Natick, Mass., has been assigned a patent (8,230,424) developed by Jocelyn Luke Martin, Burwell, United Kingdom, and Loren Dean, Natick, Mass., for "general interface with arbitrary job managers." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method, system and computer program product is disclosed for providing a distributed computing environment in which an arbitrary job manager or scheduler is able to be plugged. In the distributed computing environment, a job is created in a storage location to include one or more technical computing tasks and submitted to the arbitrary scheduler by transferring a reference to the storage location of the job. Since a reference to the storage location of the job is transferred to the scheduler, the interface with the scheduler can be implemented regardless of the scheduler. The scheduler then transfers the reference to the storage location of the job to one or more remote workers." The patent application was filed on Aug. 1, 2005 (11/194,957). 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,230,424&OS=8,230,424&RS=8,230,424 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** MathWorks Assigned Patent for Memory Mapping for Single and Multi-Processing Implementations of Code Generated from a Block Diagram Model ALEXANDRIA, Va., July 25 -- MathWorks, Natick, Mass., has been assigned a patent (8,230,395) developed by David Koh, Boston, and Zijad Galijasevic, Shrewsbury, Mass., for a "memory mapping for single and multi-processing implementations of code generated from a block diagram model." The abstract of the patent published by the U.S. Patent and Trademark Office states: "Methods and systems are provided for automatically generating code from a graphical model representing a design to be implemented on components of a target computational hardware device. During the automatic code generating process, a memory mapping is automatically determined and generated to provide an optimization of execution of the program on the target device. The optimized memory mapping is incorporated into building the program executable from the automatically generated code of the graphical model." The patent application was filed on July 21, 2009 (12/506,621). 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,230,395&OS=8,230,395&RS=8,230,395 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** International Business Machines Assigned Patent for Assist Thread for Injecting Cache Memory in a Microprocessor ALEXANDRIA, Va., July 25 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,230,422) developed by seven co-inventors for an "assist thread for injecting cache memory in a microprocessor." The co-inventors are Patrick Joseph Bohrer, Austin, Texas, Orran Yaakov Krieger, Newton, Mass., Ramakrishnan Rajamony, Austin, Texas, Michael Rosenfield, Ridgefield, Conn., Hazim Shafi, Austin, Texas, Balaram Sinharoy, Poughkeepsie, N.Y., and Robert Brett Tremaine, Stormville, N.Y. The abstract of the patent published by the U.S. Patent and Trademark Office states: "A data processing system includes a microprocessor having access to multiple levels of cache memories. The microprocessor executes a main thread compiled from a source code object. The system includes a processor for executing an assist thread also derived from the source code object. The assist thread includes memory reference instructions of the main thread and only those arithmetic instructions required to resolve the memory reference instructions. A scheduler configured to schedule the assist thread in conjunction with the corresponding execution thread is configured to execute the assist thread ahead of the execution thread by a determinable threshold such as the number of main processor cycles or the number of code instructions. The assist thread may execute in the main processor or in a dedicated assist processor that makes direct memory accesses to one of the lower level cache memory elements." The patent application was filed on Jan. 13, 2005 (11/034,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,230,422&OS=8,230,422&RS=8,230,422 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** Oracle International Assigned Patent for Smart Generator ALEXANDRIA, Va., July 25 -- Oracle International, Redwood Shores, Calif., has been assigned a patent (8,230,388) developed by William W. Lee, Boston, and Julian Pelenur, Marblehead, Mass., for a smart generator. The abstract of the patent published by the U.S. Patent and Trademark Office states: "The Smart Generator of the present invention allows the designer/developer/user to model the EJB components in a natural way without being concerned with implementation-specific details. The developer models the business objects using a UML drawing tool and the Smart Generator creates a set of classes that implements these objects with reference to the Enterprise JavaBeans specification. That is, the Smart Generator automatically create access methods and handling containment of references from the UML diagram." The patent application was filed on June 11, 2008 (12/157,517). 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,230,388&OS=8,230,388&RS=8,230,388 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** MathWorks Assigned Patent for General Interface with Arbitrary Job Managers ALEXANDRIA, Va., July 25 -- MathWorks, Natick, Mass., has been assigned a patent (8,230,427) developed by Jocelyn Luke Martin, Burwell, United Kingdom, and Loren Dean, Natick, Mass., for "general interface with arbitrary job managers." The abstract of the patent published by the U.S. Patent and Trademark Office states: " A method, system and computer program product is disclosed for providing a distributed computing environment in which an arbitrary job manager or scheduler is able to be plugged. In the distributed computing environment, a job is created in a storage location to include one or more technical computing tasks and submitted to the arbitrary scheduler by transferring a reference to the storage location of the job. Since a reference to the storage location of the job is transferred to the scheduler, the interface with the scheduler can be implemented regardless of the scheduler. The scheduler then transfers the reference to the storage location of the job to one or more remote workers. " The patent application was filed on Aug. 10, 2007 (11/891,415). 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,230,427&OS=8,230,427&RS=8,230,427 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** EMC Assigned Patent ALEXANDRIA, Va., July 25 -- EMC, Hopkinton, Mass., has been assigned a patent (8,230,384) developed by Sriram Krishnan, Shrewsbury, Mass., and Russell R. Laporte, Webster, Mass., for "techniques for generating and processing a schema instance." The abstract of the patent published by the U.S. Patent and Trademark Office states: "Described are technique for generating a configuration schema instance. A layout file is received that specifies what portion of configuration information is to be extracted from a configuration data store. The portion of configuration information is extracted from said configuration data store in accordance with said layout file. A representation of said portion of configuration information is stored in said configuration schema instance." The patent application was filed on March 30, 2006 (11/393,236). 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,230,384&OS=8,230,384&RS=8,230,384 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** International Business Machines Assigned Patent for Providing a Computing System with Real-time Capabilities ALEXANDRIA, Va., July 25 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,230,446) developed by 10 co-inventors for "providing a computing system with real-time capabilities." The co-inventors are Paul E. McKenney, Beaverton, Ore., Claudia Salzberg, Cambridge, Mass., Rene Vandenbroeck, Wake Forest, N.C., John K. Whetzel, Holly Springs, N.C., Peter H. Reynolds, Raleigh, N.C., Albert A. Asselin, Morrisville, N.C., Keith Mannthey, Portland, Ore., Torez Smith, Austin, Texas, Jeffrey Franke, Apex, N.C., and Theodore Y. Tso, Medford, Mass. The abstract of the patent published by the U.S. Patent and Trademark Office states: "A computing system is provided with real-time capabilities so that the system is capable of running applications such that one or more real-time criteria are satisfied. An interrupt architecture of the computing system is disabled. The interrupt architecture generates interrupts sent to a firmware of the computing system in response to events. A different architecture is substituted within the computing system for the interrupt architecture. The different architecture is responsive to the events without violating the real-time criteria. In response to the events occurring, the different architecture causes one or more corrective actions to be performed." The patent application was filed on Nov. 28, 2007 (11/946,511). 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,230,446&OS=8,230,446&RS=8,230,446 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** Oracle America Assigned Patent for Efficient Non-blocking K-compare-single-swap Operation ALEXANDRIA, Va., July 25 -- Oracle America, Redwood City, Calif., has been assigned a patent (8,230,421) developed by Nir N. Shavit, Cambridge, Mass., Mark S. Moir, Somerville, Mass., and Victor M. Luchangco, Arlington, Mass., for an efficient non-blocking K-compare-single-swap operation. The abstract of the patent published by the U.S. Patent and Trademark Office states: "The design of nonblocking linked data structures using single-location synchronization primitives such as compare-and-swap (CAS) is a complex affair that often requires severe restrictions on the way pointers are used. One way to address this problem is to provide stronger synchronization operations, for example, ones that atomically modify one memory location while simultaneously verifying the contents of others. We provide a simple and highly efficient nonblocking implementation of such an operation: an atomic k-word-compare single-swap operation (KCSS). Our implementation is obstruction-free. As a result, it is highly efficient in the uncontended case and relies on contention management mechanisms in the contended cases. It allows linked data structure manipulation without the complexity and restrictions of other solutions. Additionally, as a building block of some implementations of our techniques, we have developed the first nonblocking software implementation of load-linked/store-conditional that does not severely restrict word size." The patent application was filed on Sept. 28, 2007 (11/864,667). 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,230,421&OS=8,230,421&RS=8,230,421 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** Hitachi Data Systems Assigned Patent ALEXANDRIA, Va., July 25 -- Hitachi Data Systems, Santa Clara, Calif., has been assigned a patent (8,230,267) developed by Jesse A. Noller, Hudson, Mass., and Robert S. Mason Jr., Uxbridge, Mass., for an "automated software testing framework." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A generic testing framework to automatically allocate, install and verify a given version of a system under test, to exercise the system against a series of tests in a "hands-off" objective manner, and then to export information about the tests to one or more developer repositories (such as a query-able database, an email list, a developer web server, a source code version control system, a defect tracking system, or the like). The framework does not "care" or concern itself with the particular implementation language of the test as long as the test can issue directives via a command line or configuration file. During the automated testing of a given test suite having multiple tests, and after a particular test is run, the framework preferably generates an "image" of the system under test and makes that information available to developers, even while additional tests in the suite are being carried out. In this manner, the framework preserves the system "state" to facilitate concurrent or after-the-fact debugging. The framework also will re-install and verify a given version of the system between tests, which may be necessary in the event a given test is destructive or otherwise places the system in an unacceptable condition." The patent application was filed on April 5, 2010 (12/753,924). 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,230,267.PN.&OS=PN/8,230,267&RS=PN/8,230,267 Written by Kusum Sangma; edited by Anand Kumar. *** International Business Machines Assigned Patent for Method for associating annotations with document families ALEXANDRIA, Va., July 25 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,230,326) developed by six co-inventors for a "method for associating annotations with document families." The co-inventors are Jordi A. Albornoz, Cambridge, Mass., Lee D. Feigenbaum, Brookline, Mass., Douglas R. Fish, Rochester, Minn., Sean J. Martin, Cambridge, Mass., Hoa T. Tran, Rochester, Minn., and David A. Wall, Rochester, Minn. The abstract of the patent published by the U.S. Patent and Trademark Office states: "The present invention generally provides methods, systems, and articles of manufacture for managing an annotation system that includes storing annotations for a document family, i.e., a series of versions of a data source. Annotations created for one version of the data source may be viewed in context from both subsequent and prior versions of the same data source. Embodiments of the invention associate annotations with both a data source "family identifier" as well as a "version identifier." Other than adding a family ID to the data source, the data source remains unchanged. The family ID is maintained across different versions of the data source, whereas version IDs are determined for a specific version of the data source. Version IDs can be constructed from each data source directly, and do not need to be stored." The patent application was filed on Dec. 17, 2004 (11/016,221). 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,230,326.PN.&OS=PN/8,230,326&RS=PN/8,230,326 Written by Kusum Sangma; edited by Anand Kumar. *** International Business Machines Assigned Patent for Method and System for Social Bookmarking of Resources Exposed in Web Pages That Don't Follow the Representational State Transfer Architectural Style (REST) ALEXANDRIA, Va., July 25 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,230,320) developed by David A. Brooks, Providence, R.I., and Alexander Kordun, Arlington, Mass., for a "method and system for social bookmarking of resources exposed in web pages that don't follow the representational state transfer architectural style (REST)." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A system for social bookmarking of a resource provided through a Web application that doesn't follow the representational state transfer architectural style (REST). When processing a request for a social bookmarking operation, the system searches for a URL and potentially other resource information within the document object model of a currently loaded Web page. If such resource information is found, it is used to process the requested social bookmarking operation. Otherwise, if such resource information is not found in the document object model, the system uses the URL stored in the location bar of the Web browser to process the requested social bookmarking operation. The system includes semantic information in the DOM of a Web page that is used to identify subsets of content within the Web page that can be socially bookmarked. The semantic information may be stored in what is generally referred to as "microformatting"." The patent application was filed on Dec. 26, 2006 (11/616,206). 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,230,320.PN.&OS=PN/8,230,320&RS=PN/8,230,320 Written by Kusum Sangma; edited by Anand Kumar. *** International Business Machines Assigned Patent for Game Determination of Tag Relevance for Social Bookmarking ALEXANDRIA, Va., July 25 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,230,338) developed by five co-inventors for a "game determination of tag relevance for social bookmarking." The co-inventors are Casey Dugan, Medford, Mass., Michael Muller, Medford, Mass., Jerry W. Redman, Cedar Park, Texas, Amy D. Travis, Arlington, Mass., and Sara Weber, Arlington, Mass. The abstract of the patent published by the U.S. Patent and Trademark Office states: "Embodiments of the present invention provide a method, system and computer program product for game determined tag relevance for social bookmarking. In one embodiment of the invention, a method for the game determination of tag relevance for social bookmarking can be provided. The method can include rendering a game user interface in connection with content in a content browser, providing a list of tags previously associated with the content in the game user interface for a game participant and receiving relevance values for the tags through the game user interface provided by the game participant for each of the tags, comparing the relevance values to relevance values provided by others to generate a score and presenting the score in the game user interface, and applying the received relevance values to the tags to improve quality for each of the tags in association with the content." The patent application was filed on Jan. 21, 2008 (12/017,058). 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,230,338.PN.&OS=PN/8,230,338&RS=PN/8,230,338 Written by Kusum Sangma; edited by Anand Kumar. *** Digitalsmiths Assigned Patent ALEXANDRIA, Va., July 25 -- Digitalsmiths, Durham, N.C., has been assigned a patent (8,230,343) developed by ten co-inventors for an "audio and video program recording, editing and playback systems using metadata." The co-inventors are James D. Logan, Windham, N.H., Scott A. Durgin, North Andover, Mass., Brian D. Doe, Windham, N.H., Vincent E. Colella, Wilmington, Mass., Jeffrey M. Santos, Newburyport, Mass., Michael G. Palone, Acton, Mass., Stephen Boone, Windham, Mass., McFarland Hale, North Chelmsford, Mass., Paul M. Mansfield, Burlington, Mass., and Gregory J. Read, Newbury, Mass. The abstract of the patent published by the U.S. Patent and Trademark Office states: "A system for utilizing metadata created either at a central location for shared use by connected users, or at each individual user's location, to enhance user's enjoyment of available broadcast programming content. A variety of mechanisms are employed for automatically and manually identifying and designating programming segments, associating descriptive metadata which the identified segments, distributing the metadata for use at client locations, and using the supplied metadata to selectively record and playback desired programming." The patent application was filed on Aug. 20, 2007 (11/894,565). 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,230,343.PN.&OS=PN/8,230,343&RS=PN/8,230,343 Written by Kusum Sangma; edited by Anand Kumar. *** Schneider Automation Assigned Patent ALEXANDRIA, Va., July 25 -- Schneider Automation, North Andover, Mass., has been assigned a patent (8,230,115) developed by Kenneth S. Lee, Cambridge, Mass., for a "cable redundancy with a networked system." The abstract of the patent published by the U.S. Patent and Trademark Office states: "Aspects of the invention provide apparatuses, systems, and methods for supporting cable redundancy in a network connecting a network controller (101) and an I/O device (109) (an adapter). An adapter includes a first port (407) and a second port (409) for receiving the same messages from a scanner (301) over a first and second transmission media (353, 355), respectively. A connection manager module (423) instructs a switching module (419) to direct the output data contained in the first message to a data structure (421) when the first transmission medium is operational and to direct the output data contained in the second message to the data structure when the first transmission medium is non-operational. Also, the adapter formats a message from input data. The connection manager instructs a switch (411) to direct the message to a primary port (407) when a primary transmission medium (655) is operational and to direct the message to a secondary port (409) when the primary transmission medium (753) is non-operational." The patent application was filed on Dec. 28, 2007 (11/966,196). 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,230,115&OS=8,230,115&RS=8,230,115 Written by Arpi Sharma; edited by Anand Kumar. *** Intel Assigned Patent for PCI Express Enhancements and Extensions ALEXANDRIA, Va., July 25 -- Intel, Santa Clara, Calif., has been assigned a patent (8,230,120) developed by nineteen co-inventors for a "PCI express enhancements and extensions." The co-inventors are Jasmin Ajanovic, Portland, Ore., Mahesh Wagh, Portland, Ore., Prashant Sethi, Folsom, Calif., Debendra Das Sharma, Santa Clara, Calif., David Harriman, Portland, Ore., Mark Rosenbluth, Uxbridge, Mass., Ajay Bhatt, Portland, Ore., Peter Barry, Ardnacrusha, Ireland, Scott Dion Rodgers, Hillsboro, Ore., Anil Vasudevan, Portland, Ore., Sridhar Muthrasanallur, Puyallup, Wash., James Akiyama, Beaverton, Ore., Robert Blankenship, Tacoma, Wash., Ohad Falik, Kfar-Saba, Israel, Abraham Mendelson, Haifa, Israel, Ilan Pardo, Ramat-Hasharon, Israel, Eran Tamari, Ramat Gan, Israel, Eliezer Weissmann, Haifa, Israel, and Doron Shamia, Modiin, Israel. The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method and apparatus for enhancing/extending a serial point-to-point interconnect architecture, such as Peripheral Component Interconnect Express (PCIe) is herein described. Temporal and locality caching hints and prefetching hints are provided to improve system wide caching and prefetching. Message codes for atomic operations to arbitrate ownership between system devices/resources are included to allow efficient access/ownership of shared data. Loose transaction ordering provided for while maintaining corresponding transaction priority to memory locations to ensure data integrity and efficient memory access. Active power sub-states and setting thereof is included to allow for more efficient power management. And, caching of device local memory in a host address space, as well as caching of system memory in a device local memory address space is provided for to improve bandwidth and latency for memory accesses." The patent application was filed on March 28, 2011 (13/073,149). 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,230,120&OS=8,230,120&RS=8,230,120 Written by Arpi Sharma; edited by Anand Kumar. *** Intel Assigned Patent for PCI Express Enhancements and Extensions ALEXANDRIA, Va., July 25 -- Intel, Santa Clara, Calif., has been assigned a patent (8,230,119) developed by nineteen co-inventors for a "PCI express enhancements and extensions." The co-inventors are Jasmin Ajanovic, Portland, Ore., Mahesh Wagh, Portland, Ore., Prashant Sethi, Folsom, Calif., Debendra Das Sharma, Santa Clara, Calif., David Harriman, Portland, Ore., Mark Rosenbluth, Uxbridge, Mass., Ajay Bhatt, Beaverton, Ore., Peter Barry, Ardnacrusha, Ireland, Scott Dion Rodgers, Hillsboro, Ore., Anil Vasudevan, Portland, Ore., Sridhar Muthrasanallur, Bangalore, India, James Akiyama, Beaverton, Ore., Robert Blankenship, Tacoma, Wash., Ohad Falik, Kfar Saba, Israel, Abraham Mendelson, Haifa, Israel, Ilan Pardo, Ramat-Hasharon, Israel, Eran Tamari, Ramat Gan, Israel, Eliezer Weissmann, Haifa, Israel, and Doron Shamia, Modiin, Israel. The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method and apparatus for enhancing/extending a serial point-to-point interconnect architecture, such as Peripheral Component Interconnect Express (PCIe) is herein described. Temporal and locality caching hints and prefetching hints are provided to improve system wide caching and prefetching. Message codes for atomic operations to arbitrate ownership between system devices/resources are included to allow efficient access/ownership of shared data. Loose transaction ordering provided for while maintaining corresponding transaction priority to memory locations to ensure data integrity and efficient memory access. Active power sub-states and setting thereof is included to allow for more efficient power management. And, caching of device local memory in a host address space, as well as caching of system memory in a device local memory address space is provided for to improve bandwidth and latency for memory accesses." The patent application was filed on Aug. 23, 2010 (12/861,439). 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,230,119&OS=8,230,119&RS=8,230,119 Written by Arpi Sharma; edited by Anand Kumar. *** EMC Assigned Patent ALEXANDRIA, Va., July 25 -- EMC, Hopkinton, Mass., has been assigned a patent (8,230,051) developed by four co-inventors for a "method and apparatus for mapping and identifying resources for network-based services." The co-inventors are William Zahavi, Westborough, Mass., Amanuel Ronen Artzi, Framingham, Mass., David Ohsie, Baltimore, and William Kuhhirte, Redington Shores, Fla. The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method, apparatus and computer-program product for mapping and identifying resources in network based services is disclosed. The method comprises the steps of determining a measure of utilization for each of the selected transactions, generating an indication for each measure of utilization exceeding an associated utilization threshold value, determining the cause of the measure of utilization exceeding the associated utilization threshold value by correlating the transactions generating the indications with the resources executing the transaction and applying additional resources until the measure of utilization is less than the associated threshold. In one aspect of the invention, balancing the measure of utilization associated with each of the selected transactions occurs to maintain each of the measures of utilization within a substantially known tolerance to each other measure of utilization." The patent application was filed on June 27, 2006 (11/475,775). 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,230,051&OS=8,230,051&RS=8,230,051 Written by Arpi Sharma; edited by Anand Kumar. *** International Business Machines Assigned Patent for Propagation Control System and Method ALEXANDRIA, Va., July 25 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,230,028) developed by five co-inventors for a "propagation control system and method." The co-inventors are Patrick Joseph O'Sullivan, Ballsbridge, Ireland, Kieran Anthony Deegan, Summerhill, Ireland, Edith Helen Stern, Yorktown Heights, N.Y., Robert Cameron Weir, Westford, Mass., and Barry E. Willner, Briarcliff Manor, N.Y. The abstract of the patent published by the U.S. Patent and Trademark Office states: "An email message that is addressed to a plurality of recipients is defined on a first client electronic device. A first set of downstream response rights is assigned, on the first client electronic device, to a first recipient chosen from the plurality of recipients. A second set of downstream response rights is assigned, on the first client electronic device, to a second recipient chosen from the plurality of recipients. The second set of downstream response rights is different from the first set of downstream response rights." The patent application was filed on March 31, 2009 (12/415,364). 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,230,028&OS=8,230,028&RS=8,230,028 Written by Arpi Sharma; edited by Anand Kumar. *** Rockstar Bidco Assigned Patent ALEXANDRIA, Va., July 25 -- Rockstar Bidco, New York, has been assigned a patent (8,230,010) developed by Thomas P. Hardjono, Winchester, Mass., and Bradley Cain, Cambridge, Mass., for a "system, device, and method for controlling access in a multicast communication network." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A system, device, and method for controlling access in a multicast communication network uses a distributed host authentication scheme to prevent unauthorized hosts from joining a shared multicast distribution tree. An authorized host is provided with access information for accessing the shared tree. Certain access information is also distributed to at least a designated device associated with the host, although the access information may be distributed to other devices as well. The designated device uses the access information to authenticate the host and establish a security agreement with the host. Other devices may use the access information to authenticate the host in the event that the designated device is unable to authenticate the host. An authenticated host is added to the shared tree, while a host that cannot be authenticated is prevented from joining the shared tree." The patent application was filed on June 29, 2000 (09/607,007). 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,230,010&OS=8,230,010&RS=8,230,010 Written by Arpi Sharma; 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. -1094385 (c) 2012 Targeted News Service |