TMCnet News
U.S. Patents Awarded to Inventors in Minnesota (Nov. 21)(Targeted News Service Via Acquire Media NewsEdge) Targeted News Service Targeted News Service ALEXANDRIA, Va., Nov. 21 -- The following federal patents were awarded to inventors in Minnesota. *** International Business Machines Assigned Patent for Analyzing Binary Data Streams to Identify Embedded Record Structures ALEXANDRIA, Va., Nov. 21 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,316,034) developed by Andre P. Guirard, Plymouth, Minn., for "analyzing binary data streams to identify embedded record structures." The abstract of the patent published by the U.S. Patent and Trademark Office states: "According to one embodiment of the present invention, a system identifies and extracts data structures embedded within a data stream, and comprises a computer system including at least one processor. The system analyzes the data stream and identifies data structure definitions corresponding to analyzed data stream portions. The data structure definitions each define a structure of a corresponding data structure, and are configurable to accommodate various types of data structures within the data stream. The corresponding data structures within the data stream are generated by extracting information from the data stream in accordance with the data structure definitions. Embodiments of the present invention further include a method and computer program product for identifying and extracting data structures embedded within a data stream in substantially the same manner described above." The patent application was filed on Oct. 20, 2010 (12/908,018). The full-text of the patent can be found at http://patft.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=83,16,034.PN.&OS=PN/83,16,034&RS=PN/83,16,034 Written by Amal Ahmed; edited by Jaya Anand. *** Symantec Assigned Patent for Affinity Based Allocation for Storage Implementations Employing Deduplicated Data Stores ALEXANDRIA, Va., Nov. 21 -- Symantec, Mountain View, Calif., has been assigned a patent (8,315,992) developed by Stephan Kurt Gipp, Inver Grove Heights, Minn., and Adonijah Park, Forest Lake, Minn., for an "affinity based allocation for storage implementations employing deduplicated data stores." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method, apparatus, and computer program product for implementing affinity based allocation for storage implementations employing deduplicated data stores is disclosed. According to an embodiment of the present invention, a backup manager determines if information associating a data source with a first data target of a plurality of data targets has been established. The first data target is a deduplication data store and the information associating the data source with the first data target indicates an increased likelihood of at least some information stored on the data source is already being stored on the first data target prior to performing a backup. If information associating the data source with the first data target has been established, the backup manager stores a set of data on the data target." The patent application was filed on Nov. 26, 2008 (12/324,428). The full-text of the patent can be found at http://patft.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=83,15,992.PN.&OS=PN/83,15,992&RS=PN/83,15,992 Written by Amal Ahmed; edited by Jaya Anand. *** International Business Machines Assigned Patent for Programmatic Retrieval of Tabular Data within a Cell of a Query Result ALEXANDRIA, Va., Nov. 21 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,316,013) developed by Daniel Paul Kolz, Rochester, Minn., and Shannon Everett Wenzel, Colby, Wis., for a "programmatic retrieval of tabular data within a cell of a query result." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method, system and article of manufacture for processing a database query result that includes multiple data elements in a single result field. One embodiment provides a method of processing a query result. The method includes receiving a query result that includes at least one result field having multiple data elements that are in a many-to-one relationship with a second result field. The received query result is parsed to identify the multiple data elements from the first result field. Then, a result set is generated on the basis of the identified multiple data elements. The generated result set only includes one-to-one relationships between different result fields. Advantageously, the generated result set is suitable for programmatic access in order to allow an automated processing of the generated result set." The patent application was filed on Aug. 9, 2006 (11/463,342). The full-text of the patent can be found at http://patft.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=83,16,013.PN.&OS=PN/83,16,013&RS=PN/83,16,013 Written by Amal Ahmed; edited by Jaya Anand. *** Symantec Assigned Patent for Optimizing the De-duplication Rate for a Backup Stream ALEXANDRIA, Va., Nov. 21 -- Symantec, Mountain View, Calif., has been assigned a patent (8,315,985) developed by five co-inventors for an "optimizing the de-duplication rate for a backup stream." The co-inventors are James Ohr, Saint Paul, Minn., Michael Zeis, Minneapolis, Dean Elling, Burnsville, Minn., Stephan Kurt Gipp, Inver Grove Heights, Minn., and William DesJardin, Roseville, Minn. The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method and apparatus for optimizing a de-duplication rate for backup streams is described. In one embodiment, the method for optimizing data de-duplication using an extent mapping of a backup stream includes processing a backup stream to access an extent mapping associated with a plurality of data files, wherein the plurality of the data files are arranged within the backup stream and examining the extent mapping to identify at least one extent group within the backup stream, wherein the plurality of the data files are de-duplicated using at least one location of the at least one extent group." The patent application was filed on Dec. 18, 2008 (12/338,563). The full-text of the patent can be found at http://patft.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=83,15,985.PN.&OS=PN/83,15,985&RS=PN/83,15,985 Written by Amal Ahmed; edited by Jaya Anand. *** EMC Assigned Patent ALEXANDRIA, Va., Nov. 21 -- EMC, Hopkinton, Mass., has been assigned a patent (8,315,986) developed by Aditya Kapoor, Bellevue, Wash., Christopher Hercules Claudatos, San Jose, Calif., and William Dale Andruss, Minneapolis, for a restore optimization. The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method, article of manufacture, and apparatus for protecting data, comprising receiving information about objects stored on a plurality of hosts, determining whether an object needs to be backed up, and if the object needs to be backed up, requesting each host having the object to provide a portion of the object to a target. Information about the objects and backup may be stored in an index. A requesting host may request an object to be restored to a target. It is determined whether the object is available at the backup and at other hosts, and the backup and hosts having the object may be requested to provide portions of the object to the target, which may be the requesting host. The index may be used to determine availability of the object at the backup and other hosts." The patent application was filed on Dec. 24, 2007 (12/004,735). The full-text of the patent can be found at http://patft.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=83,15,986.PN.&OS=PN/83,15,986&RS=PN/83,15,986 Written by Amal Ahmed; edited by Jaya Anand. *** Cardinal CG Assigned Patent ALEXANDRIA, Va., Nov. 21 -- Cardinal CG, Eden Prairie, Minn., has been assigned a patent (RE43,817) developed by four co-inventors for low-maintenance coatings. The co-inventors are Annette J. Krisko, Sauk City, Wis., Kari B. Myli, Sauk City, Wis., Gary L. Pfaff, Cazenovia, Wis., and James E. Brownlee, Northfield, Minn. The abstract of the patent published by the U.S. Patent and Trademark Office states: "The invention provides a substrate bearing a low-maintenance coating. The coating includes two films: a first film comprising silica (e.g., silicon dioxide) and a second film comprising titania (e.g., titanium dioxide). Preferably, both films are provided within particular thickness ranges. The invention also provides methods of depositing such coatings." The patent application was filed on Oct. 12, 2011 (13/271,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=RE43,817&OS=RE43,817&RS=RE43,817 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** International Business Machines Assigned Patent for Method, Framework, and Program Product for Formatting and Serving Web Content ALEXANDRIA, Va., Nov. 21 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,316,348) developed by six co-inventors for a "method, framework, and program product for formatting and serving web content." The co-inventors are Zhiqiang Liu, Kennesaw, Ga., Jennifer Lai, Garrison, N.Y., Brian J. McDonald, Minneapolis, Laurie Miller, Lyons, Colo., Karen A. Ughetta, Raleigh, N.C., and Yael Ravin, Mount Kisco, N.Y. The abstract of the patent published by the U.S. Patent and Trademark Office states: "The present invention provides an approach and corresponding framework that separates data from its formatting/view by generating the dynamic JavaScript (data) as a set (e.g., at least one) of JavaScript (data) objects, without any HTML formatting. Then, a set of JavaScript functions can be created that takes the set of JavaScript objects as a parameter, and outputs all or a subset of this data object in a format determined by this JavaScript function. In general, these formatting functions can be static, rather than dynamic, JavaScript. This approach has the advantage of providing a much greater degree of formatting flexibility, without the need for each new format to establish a connection with the back-end system providing the data." The patent application was filed on Aug. 8, 2007 (11/835,768). 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,316,348&OS=8,316,348&RS=8,316,348 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** Microsoft Assigned Patent ALEXANDRIA, Va., Nov. 21 -- Microsoft, Redmond, Wash., has been assigned a patent (8,315,964) developed by five co-inventors for a "comprehensive human computation framework." The co-inventors are Shipeng Li, Palo Alto, Calif., Yang Yang, Hefei, China, Bin Benjamin Zhu, Edina, Minn., Rui Guo, Beijing, and Linjun Yang, Beijing. The abstract of the patent published by the U.S. Patent and Trademark Office states: "Technologies for a human computation framework suitable for answering common sense questions that are difficult for computers to answer but easy for humans to answer. The technologies support solving general common sense problems without a priori knowledge of the problems; support for determining whether an answer is from a bot or human so as to screen out spurious answers from bots; support for distilling answers collected from human users to ensure high quality solutions to the questions asked; and support for preventing malicious elements in or out of the system from attacking other system elements or contaminating the solutions produced by the system, and preventing users from being compensated without contributing answers." The patent application was filed on Oct. 27, 2008 (12/258,991). 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,315,964&OS=8,315,964&RS=8,315,964 Written by Neha Bharti; edited by Jaya Anand. *** International Business Machines Assigned Patent for Optimizing Workflow Execution Against a Heterogeneous Grid Computing Topology ALEXANDRIA, Va., Nov. 21 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,316,376) developed by four co-inventors for an "optimizing workflow execution against a heterogeneous grid computing topology." The co-inventors are Richard D.S. Dettinger, Rochester, Minn., Cale T. Rath, Byron, Minn., Richard J. Stevens, Rochester, Minn., and Shannon E. Wenzel, Colby, Wis. The abstract of the patent published by the U.S. Patent and Trademark Office states: "Optimizing workflow execution by the intelligent dispatching of workflow tasks against a grid computing system or infrastructure. For some embodiments, a grid task dispatcher may be configured to dispatch tasks in a manner that takes into account information about an entire workflow, rather than just an individual task. Utilizing information about the tasks (task metadata), such a workflow-scoped task dispatcher may more optimally assign work to compute resources available on the grid, leading to a decrease in workflow execution time and more efficient use of grid computing resources." The patent application was filed on Oct. 5, 2010 (12/898,385). 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,316,376&OS=8,316,376&RS=8,316,376 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** International Business Machines Assigned Patent for Implementing Timing Pessimism Reduction for Parallel Clock Trees ALEXANDRIA, Va., Nov. 21 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,316,333) developed by Craig M. Darsow, Rochester, Minn., and Timothy D. Helvey, Rochester, Minn., for an "implementing timing pessimism reduction for parallel clock trees." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A computer-implemented method, system, and computer program product are provided for implementing timing pessimism reduction for parallel clock trees. A common path tracing algorithm in a static timing tool is enhanced to include a proximity credit used for pairs of gates in two clock trees that are placed in close proximity to each other. The proximity credit given is equal to a predefined fraction of a proximity component of a gate delay." The patent application was filed on July 22, 2010 (12/841,384). 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,316,333&OS=8,316,333&RS=8,316,333 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** Honeywell International Assigned Patent for Safe Partition scheduling on Multi-core Processors ALEXANDRIA, Va., Nov. 21 -- Honeywell International, Morristown, N.J., has been assigned a patent (8,316,368) developed by four co-inventors for "safe partition scheduling on multi-core processors." The co-inventors are Stephen C. Vestal, North Oaks, Minn., Pamela Binns, St. Paul, Minn., Aaron Larson, Shoreview, Minn., Murali Rangarajan, Plymouth, Minn., and Ryan Roffelsen, Tigard, Ore. The abstract of the patent published by the U.S. Patent and Trademark Office states: "One example is directed to a method of generating a set of schedules for use by a partitioning kernel to execute a plurality of partitions on a plurality of processor cores included in a multi-core processor unit. The method includes determining a duration to execute each of the plurality of partitions without interference and generating a candidate set of schedules using the respective duration for each of the plurality of partitions. The method further includes estimating how much interference occurs for each partition when the partitions are executed on the multi-core processor unit using the candidate set of schedules and generating a final set of schedules by, for at least one of the partitions, scaling the respective duration in order to account for the interference for that partition. The method further includes configuring the multi-core processor unit to use the final set of schedules to control the execution of the partitions using at least two of the cores." The patent application was filed on Feb. 5, 2009 (12/366,369). 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,316,368&OS=8,316,368&RS=8,316,368 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** Walker Digital Assigned Patent ALEXANDRIA, Va., Nov. 21 -- Walker Digital, Stamford, Conn., has been assigned a patent (8,315,948) developed by four co-inventors for a "method and device for generating a single-use financial account number." The co-inventors are Jay S. Walker, Ridgefield, Conn., Bruce Schneier, Minneapolis, Sanjay K. Jindal, Wilton, Conn., and Daniel E. Tedesco, Monroe, Conn. The abstract of the patent published by the U.S. Patent and Trademark Office states: "A device for facilitating financial account transactions is described which includes a processing unit including a cryptographic processor. The device also includes an input unit, a display unit and a memory device connected to the processing unit. The memory device contains a private cryptographic key, a first data element and a second data element. The processing unit encrypts the first data element using the private cryptographic key and the second data element, modifies the second data element, combines the encrypted first data element and the second data element to generate a single-use financial account identifier, and displays the single-use financial account identifier. This identifier is then transmitted to a central processor for authorization of the transaction. The central processor extracts and decrypts data elements from the transmitted identifier using the private cryptographic key, compares those data elements with data elements stored in a memory, and verifies the single-use financial account identifier in accordance with the comparison." The patent application was filed on June 8, 2006 (11/422,986). 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,315,948&OS=8,315,948&RS=8,315,948 Written by Neha Bharti; edited by Jaya Anand. *** LSI Assigned Patent for Buffering of Data Transfers for Direct Access Block Devices ALEXANDRIA, Va., Nov. 21 -- LSI, Milpitas, Calif., has been assigned a patent (8,316,178) developed by Timothy Lund, Rochester, Minn., Carl Forhan, Rochester, Minn., and Michael Hicken, Rochester, Minn., for a "buffering of data transfers for direct access block devices." The abstract of the patent published by the U.S. Patent and Trademark Office states: "Described embodiments provide a method of transferring, by a media controller, data associated with a host data transfer between a host device and a storage media. A buffer layer module of the media controller segments the host data transfer into one or more data transfer segments. Each data transfer segment corresponds to at least a portion of the data. The buffer layer module allocates a number of physical buffers to a virtual circular buffer for buffering the one or more data transfer segments. The buffer layer module transfers, by the virtual circular buffer, each of the data transfer segments between the host device and the storage media through the allocated physical buffers." The patent application was filed on March 25, 2010 (12/731,631). The full-text of the patent can be found at http://patft.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=83,16,178.PN.&OS=PN/83,16,178&RS=PN/83,16,178 Written by Kusum Sangma; edited by Anand Kumar. *** International Business Machines Assigned Patent for Demand-based DMA Issuance for Execution Overlap ALEXANDRIA, Va., Nov. 21 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,316,159) developed by David G. Carlson, Rochester, Minn., for a "demand-based DMA issuance for execution overlap." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method, apparatus, and program product retrieve data for a task utilizing demand-based direct memory access ("DMA") requests. The method comprises, prior to the execution thereof, analyzing a first portion of a task to determine whether data required for execution thereby is stored in a local memory, and, in response to determining that the data required for execution by the first portion of the task is not stored in the local memory, proactively issuing a first DMA request for the data required for execution by the first portion of the task. The method further comprises, in response to determining that the first DMA request is not complete, determining whether to proactively analyze a second portion of the task prior to the execution thereof for a determination whether data required for execution thereby is stored in the local memory." The patent application was filed on April 15, 2011 (13/087,570). The full-text of the patent can be found at http://patft.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=83,16,159.PN.&OS=PN/83,16,159&RS=PN/83,16,159 Written by Kusum Sangma; edited by Anand Kumar. *** Symantec Assigned Patent ALEXANDRIA, Va., Nov. 21 -- Symantec, Mountain View, Calif., has been assigned a patent (8,316,197) developed by Dennis Craig Parker, Burnsville, Minn., Claudia Lynne Rudolph, Medina, Minn., and Deepak Meghraj Patil, Roseville, Minn., for "techniques for storage lifecycle policy management." The abstract of the patent published by the U.S. Patent and Trademark Office states: "Techniques for storage lifecycle policy management. In one particular exemplary embodiment, the techniques may be realized as a method for storage lifecycle policy management comprising creating a version of a storage lifecycle policy, associating a unique version ID with the created version of the storage lifecycle policy, associating the unique version ID with one or more portions of backup data created during a storage management job instantiated under the created version of the storage lifecycle policy, and ensuring that one or more storage management actions performed on the one or more portions of backup data comply with the created version of the storage lifecycle policy associated with unique version ID." The patent application was filed on March 1, 2010 (12/714,756). The full-text of the patent can be found at http://patft.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=83,16,197.PN.&OS=PN/83,16,197&RS=PN/83,16,197 Written by Kusum Sangma; edited by Anand Kumar. *** International Business Machines Assigned Patent for Physical to Hierarchical Bus Translation ALEXANDRIA, Va., Nov. 21 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,316,169) developed by seven co-inventors for a "physical to hierarchical bus translation." The co-inventors are William J. Armstrong, Rochester, Minn., Scott N. Dunham, Raleigh, N.C., David R. Engebretsen, Cannon Falls, Minn., Gregory M. Nordstrom, Pine Island, Minn., Steven M. Thurber, Austin, Texas, Curtis C. Wollbrink, Rochester, Minn., and Adalberto G. Yanes, Rochester, Minn. The abstract of the patent published by the U.S. Patent and Trademark Office states: "In an embodiment, a translation of a physical bus number to a hierarchical bus number is written to a south chip. The south chip receives a configuration write command that comprises a physical bus number. The south chip sends the configuration write command to a device via the bus identified by the physical bus number, and the device stores the physical bus number in the device. In response to a received message from a device that comprises the physical bus number, the south chip replaces the physical bus number in the message with the hierarchical bus number. The south chip sends the message to a north chip via a point-to-point serial link. Both the physical bus number and the hierarchical bus number identify a bus with which the device connects to a bridge in the south chip." The patent application was filed on April 12, 2010 (12/758,329). The full-text of the patent can be found at http://patft.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=83,16,169.PN.&OS=PN/83,16,169&RS=PN/83,16,169 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. -1105985 (c) 2012 Targeted News Service |