TMCnet News
U.S. Patents Awarded to Inventors in New York (June 19)(Targeted News Service Via Acquire Media NewsEdge) Targeted News Service Targeted News Service ALEXANDRIA, Va., June 19 -- The following federal patents were awarded to inventors in New York. *** International Business Machines Assigned Patent for Non-intrusive Event-driven Prediction ALEXANDRIA, Va., June 19 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,468,107) developed by four co-inventors for a non-intrusive event-driven prediction. The co-inventors are Hung-Yang Chang, Watson, N.Y., Joachim H. Frank, Somers, N.Y., Christoph Lingenfelder, Yorktown Heights, N.Y., and Liangzhao Zeng, Mohegan Lake, N.Y. The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method, system, and computer usable program product for non-intrusive event-driven prediction of a metric in a data processing environment are provided in the illustrative embodiments. At least one set of events is observed in the data processing environment, the set of events being generated by several processes executing in the data processing environment. A subset of the set of events are tracked for an observation period, the tracking resulting in bookkeeping information about the subset of events. A pattern of events is detected in the bookkeeping information. The pattern is formed as a tuple representing a process in the several processes, the metric corresponding to the process. A prediction model is selected for the tuple. The prediction model is supplied with the tuple and executed to generate a predicted value of the metric." The patent application was filed on Aug. 18, 2010 (12/859,243). 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=84,68,107.PN.&OS=PN/84,68,107&RS=PN/84,68,107 Written by Amal Ahmed; edited by Jaya Anand. *** International Business Machines Assigned Patent for Method and Apparatus for Discovering and Utilizing Atomic Services for Service Delivery ALEXANDRIA, Va., June 19 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,468,042) developed by Rajesh Jaluka, Poughkeepsie, N.Y., and Santhosh B. Kumaran, Peekskill, N.Y., for a "method and apparatus for discovering and utilizing atomic services for service delivery." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method, apparatus and computer readable medium for identifying and partitioning atomic services in an information technology (IT) environment are included within the invention. More specifically, the invention provides a method and system for identifying service boundaries and partitioning services into atomic services based on the services boundaries. In order to more efficiently provide services in an IT environment, this invention in at least one embodiment utilizes a method of partitioning services into atomic services based on natural services boundaries such that those atomic services may be standardized and reused as needed." The patent application was filed on June 5, 2006 (11/446,511). 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=84,68,042.PN.&OS=PN/84,68,042&RS=PN/84,68,042 Written by Amal Ahmed; edited by Jaya Anand. *** International Business Machines Assigned Patent ALEXANDRIA, Va., June 19 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,468,160) developed by four co-inventors for "semantic-aware record matching." The co-inventors are Oktie Hassanzadeh, Toronto, Anastasios Kementsietsidis, Hawthorne, N.Y., Lipyeow Lim, Honolulu, and Min Wang, Hawthorne, N.Y. The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method of semantic-aware record matching includes receiving source and target string record specifications associated with a source string record and a target string record, receiving semantic knowledge referring to tokens of the source string record and target string record, creating a first set of tokens for the source string record and a second set of tokens for the target string record based on the semantic knowledge, assigning a similarity score to the source string record and the target string record based on a semantic relationship between the first set of tokens and the second set of tokens, and matching the source string record and the target string record based on the similarity score." The patent application was filed on Oct. 30, 2009 (12/610,101). 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=84,68,160.PN.&OS=PN/84,68,160&RS=PN/84,68,160 Written by Amal Ahmed; edited by Jaya Anand. *** salesforce.com Assigned Patent ALEXANDRIA, Va., June 19 -- salesforce.com, San Francisco, has been assigned a patent (8,468,117) developed by Doug Chasman, Pittsford, N.Y., and K. Andrew Waite, Novato, Calif., for a "system, method and computer program product for creating a visual component for tenants of an on-demand database service." The abstract of the patent published by the U.S. Patent and Trademark Office states: "In accordance with embodiments, there are provided mechanisms and methods for creating visual components for tenants of an on-demand database service. These mechanisms and methods for creating visual components for tenants of an on-demand database service can enable embodiments to allow tenants to create reusable components for use in user defined interfaces, etc. The ability of embodiments to provide such feature may allow tenants to efficiently and effectively create interfaces." The patent application was filed on Jan. 22, 2009 (12/357,994). 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=84,68,117.PN.&OS=PN/84,68,117&RS=PN/84,68,117 Written by Amal Ahmed; edited by Jaya Anand. *** Leviton Manufacturing Assigned Patent ALEXANDRIA, Va., June 19 -- Leviton Manufacturing, Melville, N.Y., has been assigned a patent (8,468,165) developed by Chris D. Walker, New York, for a "method for discovering network of home or building control devices." The abstract of the patent published by the U.S. Patent and Trademark Office states: "The present disclosure relates to a method for discovering, identifying, and cataloguing devices on a network, particularly, devices included in a home automation or building control network. In embodiments, a node information table is populated with generic entries representing potentially-discoverable devices on the network. The table is traversed iteratively and potential devices are queried in turn to determine the type and capabilities of each potential device in the network. Device responses stored in the node information table, replacing generic entries with updated entries representative of actual network devices. Additionally, device responses may be used as a basis for subsequent queries to network devices. After device queries are completed, any remaining generic node information table entries are removed from the table, thereby only entries corresponding to positively-identified network devices remain in the table." The patent application was filed on Dec. 2, 2008 (12/326,502). 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=84,68,165.PN.&OS=PN/84,68,165&RS=PN/84,68,165 Written by Amal Ahmed; edited by Jaya Anand. *** Depository Trust & Clearing Assigned Patent ALEXANDRIA, Va., June 19 -- Depository Trust & Clearing, New York, has been assigned a patent (8,468,087) developed by Peter Axilrod, New York, for "methods and systems for netting of payments and collateral." The abstract of the patent published by the U.S. Patent and Trademark Office states: "The present invention generally provides for systems and methods for netting payments and collateral. Generally, systems and methods of the present invention maximize market liquidity and minimize financial risk and collateral burdens of participants." The patent application was filed on Jan. 12, 2010 (12/686,119). 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=84,68,087.PN.&OS=PN/84,68,087&RS=PN/84,68,087 Written by Amal Ahmed; edited by Jaya Anand. *** JPMorgan Chase Bank Assigned Patent ALEXANDRIA, Va., June 19 -- JPMorgan Chase Bank, New York, has been assigned a patent (8,468,092) developed by five co-inventors for a "method and system for processing internet payments using the electronic funds transfer network." The co-inventors are Denis O'Leary, New York, Vincent D'Agostino, New York, S. Richard Re, Westfield, N.J., Jessica Burney, New York, and Adam Hoffman, New York. The abstract of the patent published by the U.S. Patent and Trademark Office states: "A computer implemented system is provided for processing payments. A server including a computer memory storing a first database including a directory is provided. The directory includes authenticated registrant information comprising authenticated information for a payee, the directory identifying via a publicly available account identifier at least one linked account of said payee. The system also includes a payor computer having access to the directory and a first bank computer linked via a computer network to the server, the first bank computer configured to access payor account information from a payor account at the first bank. The first bank computer is also configured to receive payment information from the payor computer identifying the payee and to transmit a payment from the payor account at the first bank to the linked payee account located at a second bank without using an intermediary to transfer said payment." The patent application was filed on April 10, 2012 (13/443,173). 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=84,68,092.PN.&OS=PN/84,68,092&RS=PN/84,68,092 Written by Amal Ahmed; edited by Jaya Anand. *** HSBC Technologies Assigned Patent ALEXANDRIA, Va., June 19 -- HSBC Technologies, Jersey City, N.J., has been assigned a patent (8,468,090) developed by thirteen co-inventors for an "account opening computer system architecture and process for implementing same." The co-inventors are Ronald M. Lesandro, Hamburg, N.Y., Paris F. Roselli, Buffalo, N.Y., Michael J. Sullivan, Colden, N.Y., Darren P. Loveday, Waterlooville, United Kingdom, Michael R. Antognoli, Chicago, John P. Flood, Bartlett, Ill., Yilu He, Riverview, Fla., Darrick R. Brooks, Valrico, Fla., Srinivas Lakshman, Mexico City, Mexico, Richard A. Gemma, Chicago, Trevor Johnson, Vancouver, Canada, Sonu Gupta, Tampa, Fla., and Martin Hayes, Jersey City, N.J. The abstract of the patent published by the U.S. Patent and Trademark Office states: "The present invention provides, in alternative embodiments, a computer architecture and/or computer implemented methods for account opening. In some embodiments, the invention provides an integrated, component-based technology platform in which globally standardized, business configurable account opening processes are separate and decoupled from the user interface screens and are directly manageable by business functionality and/or personnel. In various embodiments, the invention provides pause and resume, save and retrieve, cross-channel, metrics, audit tracking, data logging, and/or straight-through processing capabilities for account opening." The patent application was filed on Nov. 10, 2011 (13/293,957). 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=84,68,090.PN.&OS=PN/84,68,090&RS=PN/84,68,090 Written by Amal Ahmed; edited by Jaya Anand. *** Avaya Assigned Patent ALEXANDRIA, Va., June 19 -- Avaya, Basking Ridge, N.J., has been assigned a patent (8,468,102) developed by Jeffrey G. Gartner, Hopewell Junction, N.Y., and Bryan S. Katz, Freehold, N.J., for a "creation of ad hoc social networks based on issue identification." The abstract of the patent published by the U.S. Patent and Trademark Office states: "An external network is crawled (searched) to identify issues that may exist in the external network. Once an issue is identified, internal networks are crawled to determine one or more experts on the issue. A social network of the one or more experts is created. This way, the experts can quickly address the issue. As part of the creation of the social network, a template can be created that contains the issue, sub-issues associated with the issue, a ranking of the issues/sub-issues, and a form that allows the experts to interact and address the issue/sub-issues. In addition, the identified experts can be refined based on their availability to address the issue. The template can provide the ability to respond to users of the external networks in a manner consistent with the external networks." The patent application was filed on Dec. 17, 2009 (12/640,158). 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=84,68,102.PN.&OS=PN/84,68,102&RS=PN/84,68,102 Written by Amal Ahmed; edited by Jaya Anand. *** International Business Machines Assigned Patent for Energy Management for Datacenters ALEXANDRIA, Va., June 19 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,468,371) developed by five co-inventors for an "energy management for datacenters." The co-inventors are Rajaram B. Krishnamurthy, Wappingers Falls, N.Y., Naseer S. Siddique, Poughkeepsie, N.Y., Casimer M. DeCusatis, Poughkeepsie, N.Y., Anuradha Rao, Hopewell Junction, N.Y., and Michael Onghena, Poughquag, N.Y. The abstract of the patent published by the U.S. Patent and Trademark Office states: "A datacenter schedules and executes requests to conserve energy. The datacenter uses an event-based opportunistic approach to schedule and run the requests, which provides energy efficiency. The requests are hierarchically batched and sent to the datacenter for scheduling and execution. They are selectively sent over low power links and selectively serviced by low power processors." The patent application was filed on Dec. 15, 2009 (12/637,804). 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=8,468,371.PN.&OS=PN/8,468,371&RS=PN/8,468,371 Written by Kusum Sangma; edited by Anand Kumar. *** International Business Machines Assigned Patent for Combined Group ECC Protection and Subgroup Parity Protection ALEXANDRIA, Va., June 19 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,468,416) developed by four co-inventors for a "combined group ECC protection and subgroup parity protection." The co-inventors are Alan G. Gara, Mount Kisco, N.Y., Dong Chen, Croton on Hudson, N.Y., Philip Heidelberger, Cortlandt Manor, N.Y., and Martin Ohmacht, Yorktown Heights, N.Y. The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method and system are disclosed for providing combined error code protection and subgroup parity protection for a given group of n bits. The method comprises the steps of identifying a number, m, of redundant bits for said error protection; and constructing a matrix P, wherein multiplying said given group of n bits with P produces m redundant error correction code (ECC) protection bits, and two columns of P provide parity protection for subgroups of said given group of n bits. In the preferred embodiment of the invention, the matrix P is constructed by generating permutations of m bit wide vectors with three or more, but an odd number of, elements with value one and the other elements with value zero; and assigning said vectors to rows of the matrix P." The patent application was filed on June 26, 2007 (11/768,527). 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=8,468,416.PN.&OS=PN/8,468,416&RS=PN/8,468,416 Written by Kusum Sangma; edited by Anand Kumar. *** International Business Machines Assigned Patent for Managing Redundant Immutable Files Using Deduplication in Storage Clouds ALEXANDRIA, Va., June 19 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,468,138) developed by five co-inventors for "managing redundant immutable files using deduplication in storage clouds." The co-inventors are Gaurav Chhaunker, Ap, India, Bhushan P. Jain, Maharashtra, India, Sandeep R. Patil, Elmsford, N.Y., Sri Ramanathan, Lutz, Fla., and Matthew B. Trevathan, Kennesaw, Ga. The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method includes receiving a request to save a first file as immutable. The method also includes searching for a second file that is saved and is redundant to the first file. The method further includes determining the second file is one of mutable and immutable. When the second file is mutable, the method includes saving the first file as a master copy, and replacing the second file with a soft link pointing to the master copy. When the second file is immutable, the method includes determining which of the first and second files has a later expiration date and an earlier expiration date, saving the one of the first and second files with the later expiration date as a master copy, and replacing the one of the first and second files with the earlier expiration date with a soft link pointing to the master copy." The patent application was filed on Dec. 2, 2011 (13/310,007). 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=84,68,138.PN.&OS=PN/84,68,138&RS=PN/84,68,138 Written by Amal Ahmed; edited by Jaya Anand. *** Mattel Assigned Patent ALEXANDRIA, Va., June 19 -- Mattel, El Segundo, Calif., has been assigned a patent (8,468,460) developed by five co-inventors for a "system and method for displaying, navigating and selecting electronically stored content on a multifunction handheld device." The co-inventors are Brian P. Mysliwy, Tonawanda, N.Y., Donald W. Stucke Jr., East Aurora, N.Y., Kathleen E. Kremer, Snyder, N.Y., William J. McCormick, Hamburg, N.Y., and Ellen K. Donahue, East Aurora, N.Y. The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method for navigating among activity programs in the memory of a portable handheld multifunction electronic system. Simultaneously displaying on contact-sensitive display a plurality of category icons and a subcategory icon associated with a currently selected subcategory, each category icon having a link to one or more activity programs. If a category has been selected, replacing the plurality of displayed category icons with one or more activity program icons, each of the one or more displayed activity program icons corresponding to a separate one of the activity programs belonging to the selected category and to the currently selected subcategory. If another subcategory has been selected, at least changing the link of each separate displayed category icon to a different one or more activity programs, the different one or more activity program being associated the another subcategory and with each category of the category icons being displayed." The patent application was filed on Nov. 18, 2010 (12/948,862). 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=8,468,460.PN.&OS=PN/8,468,460&RS=PN/8,468,460 Written by Kusum Sangma; edited by Anand Kumar. *** Cadence Design Systems Assigned Patent ALEXANDRIA, Va., June 19 -- Cadence Design Systems, San Jose, Calif., has been assigned a patent (8,468,404) developed by Vivek Chickermane, Ithaca, N.Y., Brion Keller, Binghamton, N.Y., and Karishna Chakravadhanula, Vestal, N.Y., for a "method and system for reducing switching activity during scan-load operations." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method and system for reducing switching activity of a spreader network during a scan-load operation is disclosed. According to one embodiment, a spreader network receives a plurality of scan input signals from a tester. A linear feedback shift register of the spread network is updated using the plurality of scan input signals. Each bit of the linear feedback shift register is shifted at each shift cycle for a plurality of shift cycles. The linear feedback shift register outputs a nonlinear gating signal using a first set of outputs and a data value feeding one or more scan chains of the spreader network using a second set of outputs. The pipeline clock of a pipeline element of the scan chains is gated using the nonlinear gating signal, and the data value is fed to the scan chains based on the pipeline clock. The scan chains are fed with updated values at the pipeline stage." The patent application was filed on June 25, 2010 (12/823,586). 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=8,468,404.PN.&OS=PN/8,468,404&RS=PN/8,468,404 Written by Kusum Sangma; edited by Anand Kumar. *** RR Donnelley Financial Assigned Patent ALEXANDRIA, Va., June 19 -- RR Donnelley Financial, Chicago, has been assigned a patent (8,468,442) developed by four co-inventors for a "system and method for rendering data." The co-inventors are Stefan Chopin, Weston, Conn., Robert Krugman, Dix Hills, N.Y., Marc Strausberg, Pound Ridge, N.Y., and Leslie Barrett, New York. The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method of viewing information associated with data in a spreadsheet, includes providing a document including data and information associated with the data, parsing the document to retrieve the associated information, processing the associated information to break the associated information down into at least one sentence, categorizing the at least one sentence to determine whether the at least one sentence corresponds to at least one category in a taxonomy corresponding to the data, assigning an association strength to the categorized at least one sentence, the association strength indicating a likelihood that the categorized at least one sentence actually corresponds to the at least one category in the taxonomy, filtering the at least one categorized sentence based on the association strength to determine whether to match the categorized at least one sentence with the at least one category in the taxonomy and outputting only the categorized at least one sentence matched with the at least one category in the taxonomy." The patent application was filed on Feb. 8, 2011 (13/022,874). 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=8,468,442.PN.&OS=PN/8,468,442&RS=PN/8,468,442 Written by Kusum Sangma; edited by Anand Kumar. *** ActiveMap Assigned Patent ALEXANDRIA, Va., June 19 - ActiveMap, Brooklyn, N.Y., has been assigned a patent (8,468,464) developed by four co-inventors for an interactive electronically presented map. The co-inventors are Michael Abramson, Brooklyn, N.Y., Erika Jakubassa, Brooklyn, N.Y., Michael Grisham, New York, and Geoff Atkin, Bayside, N.Y. The abstract of the patent published by the U.S. Patent and Trademark Office states: "The present invention provides computerized systems and methods for providing electronically presented interactive area representation, such as a map, and information associated therewith. A user can select text, imagery, or other information presented on the map and associated with one or more items or locations, causing presentation of information relating to the associated one or more items or locations, such as appropriate contact information or a hyperlink to an appropriate Web site. Additionally or alternatively, a user can input or select, based on a query or otherwise, information relating to one or more items or locations associated with text, imagery, or other information presented on the map, causing presentation of an indication of one or more locations of the associated text, imagery, or other information on the map. A magnifier feature allowing internal navigation within the map can be provided. Additionally, animated images can appear to move over the map." The patent application was filed on May 29, 2009 (12/474,850). 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=8,468,464.PN.&OS=PN/8,468,464&RS=PN/8,468,464 Written by Kusum Sangma; edited by Anand Kumar. *** Sony Assigned Patent ALEXANDRIA, Va., June 19 -- Sony, Tokyo, and Sony Electronics, Park Ridge, N.J., have been assigned a patent (8,468,454) developed by Thomas Poslinski, Elma, N.Y., for a "method and system for displaying portions of recorded media content instances." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method and system for displaying a number of portions of a number of recorded media content instances during a single viewing session. A number of entries are defined to each correspond to one of the number of portions of the number of recorded media content instances. Each of the entries are included in a play list which is selected for viewing. The portions of the number of recorded media content instances included in the entries in the play list are then displayed during the single viewing session." The patent application was filed on Aug. 26, 2004 (10/926,823). 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=8,468,454.PN.&OS=PN/8,468,454&RS=PN/8,468,454 Written by Kusum Sangma; edited by Anand Kumar. *** International Business Machines Assigned Patent for Memory System for Error Checking Fetch and Store Data ALEXANDRIA, Va., June 19 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,468,421) developed by Michael Fee, Cold Spring, N.Y., and Arthur J. O'Neill Jr., Poughkeepsie, N.Y., for a "memory system for error checking fetch and store data." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A memory system is provided. The memory system includes a memory element that is configured to selectively output data stored to and data fetched from the memory element. An error checking station is configured to receive the data stored to and the data fetched from the memory element. The error checking station is further configured to perform error checking on the data." The patent application was filed on June 23, 2010 (12/821,917). 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=8,468,421.PN.&OS=PN/8,468,421&RS=PN/8,468,421 Written by Kusum Sangma; edited by Anand Kumar. *** Your Choice Interactive Assigned Patent ALEXANDRIA, Va., June 19 -- Your Choice Interactive, New York City, N.Y., has been assigned a patent (8,468,564) developed by Peter M. Redling, New York City, N.Y., and Jackie Skipper Barrios, New York, for a "computer program product and method for providing interactive television advertising." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method of providing advertising from a central database server connected to a global computer network to distributed sites via interactive television. A representative icon is presented to a subscriber on a television screen indicating an advertisement. When a the icon is selected, an advertisement information detail is retrieved from storage in a local memory, or from the central database server and presented to the subscriber on the television screen." The patent application was filed on April 30, 2011 (13/098,412). 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,468,564&OS=8,468,564&RS=8,468,564 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** International Business Machines Assigned Patent for Predicting and Avoiding Operand-store-compare Hazards in Out-of-order Microprocessors ALEXANDRIA, Va., June 19 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,468,325) developed by eight co-inventors for "predicting and avoiding operand-store-compare hazards in out-of-order microprocessors." The co-inventors are Gregory W. Alexander, Pflugerville, Texas, Khary J. Alexander, Poughkeepsie, N.Y., Brian Curran, Saugerties, N.Y., Jonathan T. Hsieh, Vernon, Conn., Christian Jacobi, Poughkeepsie, N.Y., James R. Mitchell, Poughkeepsie, N.Y., Brian R. Prasky, Poughkeepsie, N.Y., and Brian W. Thompto, Austin, Texas. The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method and information processing system manage load and store operations executed out-of-order. At least one of a load instruction and a store instruction is executed. A determination is made that an operand store compare hazard has been encountered. An entry within an operand store compare hazard prediction table is created based on the determination. The entry includes at least an instruction address of the instruction that has been executed and a hazard indicating flag associated with the instruction. The hazard indicating flag indicates that the instruction has encountered the operand store compare hazard. When a load instruction is associated with the hazard indicating flag the load instruction becomes dependent upon all store instructions associated with a substantially similar flag." The patent application was filed on Dec. 22, 2009 (12/644,923). 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=8,468,325.PN.&OS=PN/8,468,325&RS=PN/8,468,325 Written by Kusum Sangma; edited by Anand Kumar. *** Xerox Assigned Patent for Method and System for Optimal Batching in a Production Environment ALEXANDRIA, Va., June 19 -- Xerox, Norwalk, Conn., has been assigned a patent (8,468,527) developed by Sudhendu Rai, Fairport, N.Y., for a "method and system for optimal batching in a production environment." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method for processing a plurality of jobs in a production environment may include receiving a plurality of jobs and receiving one or more instructions into a workflow management system to process the plurality of jobs. The one or more instructions may include a setup characteristic. The method may also include clustering, by the workflow management system, the plurality of jobs into super-groups based on the setup characteristic, determining, by the workflow management system, a processing sequence based on the clustering and processing the jobs according to the determined processing sequence." The patent application was filed on April 16, 2007 (11/735,787). 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,468,527&OS=8,468,527&RS=8,468,527 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** Oracle International Assigned Patent ALEXANDRIA, Va., June 19 -- Oracle International, Redwood Shores, Calif., has been assigned a patent (8,468,330) developed by Edwards E. Reed, Honeoye Falls, N.Y., and T. Iga Acar, Orem, Utah, for "methods, systems, and data structures for loading and authenticating a module." The abstract of the patent published by the U.S. Patent and Trademark Office states: "Methods, systems, and data structures are provided for loading, authenticating, and configuring a module. A loader authenticates the identity of an instance of the module and configuration data associated with the instance of the module. Additionally, the loader generates a loadable executable instance of the module and loads the executable instance into a customized execution environment based on the configuration data. Moreover, the loader attests to the identity of the executable instance by providing one or more assertions as an attestation. The presence of the attestation provides evidence to support automatic identity and configuration authentication for the loaded executable instance, when the executable instance requests external resources that require authentication, or when the identity of the loadable executable instance is requested." The patent application was filed on June 30, 2003 (10/612,666). 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=8,468,330.PN.&OS=PN/8,468,330&RS=PN/8,468,330 Written by Kusum Sangma; edited by Anand Kumar. *** This Technology Assigned Patent ALEXANDRIA, Va., June 19 -- This Technology, Denver, has been assigned a patent (8,468,563) developed by Jeffrey Sherwin, Scarsdale, N.Y., and Nickolas James Heudecker, San Jose, Calif., for a "method for ingesting multiple signals of the same meaning." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A computer implemented method and system for managing redundant signals are disclosed. At least one server receives a first signal stream with an identifier, the first signal stream having a first time associated with a first signal point. The at least one server receives a second signal stream with the identifier, the second signal stream having a second time associated with a second signal point, wherein the second time is after the first time. The at least one server compares the first time associated with the first signal stream with the second time associated with the second signal stream. The at least one server terminates transmission of the second signal stream and transmits the first signal stream when the comparison is determined to be within a time range tolerance. Both signal streams are transmitted when the comparison is determined not to be within a time range tolerance." The patent application was filed on April 30, 2012 (13/459,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,468,563&OS=8,468,563&RS=8,468,563 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** International Business Machines Assigned Patent for Facilitating Data Compression During Replication Using a Compressible Configuration Bit ALEXANDRIA, Va., June 19 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,468,315) developed by four co-inventors for a "facilitating data compression during replication using a compressible configuration bit." The co-inventors are Michael E. Browne, Staatsburg, N.Y., Nancy J. Finn, Stormville, N.Y., Christina Lara, Tucson, Ariz., and Maria R. Ward, Pflugerville, Texas. The abstract of the patent published by the U.S. Patent and Trademark Office states: "Computer program product, system and method are provided for facilitating data replication in a storage system. A logical volume of a first storage array of a replicated pair is preconfigured with one or more logical volume attributes, which include a compressible configuration bit that indicates whether data blocks to be stored to that logical volume are compressible during replication. Subsequently, with receipt of a data block at the first storage array to be stored to the logical volume, a check of the compressible configuration bit is made to determine whether the data block is compressible during replication, and if so, the data block is compressed for replication. The compressible configuration bit is placed into the payload region of the data packet being replicated to the second storage array. At the second storage array, the compressible configuration bit is used to determine whether to uncompress the replicated data block." The patent application was filed on Oct. 28, 2009 (12/607,118). 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=8,468,315.PN.&OS=PN/8,468,315&RS=PN/8,468,315 Written by Kusum Sangma; edited by Anand Kumar. *** International Business Machines Assigned Patent for Converting a Message Signaled Interruption into an I/O Adapter Event Notification to a Guest Operating System ALEXANDRIA, Va., June 19 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,468,284) developed by seven co-inventors for "converting a message signaled interruption into an I/O adapter event notification to a guest operating system." The co-inventors are Frank W. Brice Jr., Hurley, N.Y., David Craddock, New Paltz, N.Y., Janet R. Easton, Woodstock, N.Y., Mark S. Farrell, Pleasant Valley, N.Y., Thomas A. Gregg, Highland, N.Y., Damian L. Osisek, Vestal, N.Y., and Gustav E. Sittmann III, Webster Groves, Mo. The abstract of the patent published by the U.S. Patent and Trademark Office states: "One or more message signaled interruption requests from one or more input/output (I/O) adapters are converted to I/O adapter event notifications while retaining the message vector indication. An I/O adapter event notification may be routed and presented to a host or to a guest that the host is executing. To present the notification to the correct host or to the correct guest, various data structures in host and/or guest memory are used." The patent application was filed on June 23, 2010 (12/821,177). 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,468,284&OS=8,468,284&RS=8,468,284 Written by Arpi Sharma; edited by Anand Kumar. *** International Business Machines Assigned Patent ALEXANDRIA, Va., June 19 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,468,306) developed by seven co-inventors for a "microprocessor and method for deferred store data forwarding for store background data in a system with no memory model restrictions." The co-inventors are Aaron Tsai, Poughkeepsie, N.Y., Barry W. Krumm, Poughkeepsie, N.Y., James R. Mitchell, Poughkeepsie, N.Y., Bradley Nelson, Austin, Texas, Brian D. Barrick, Pflugerville, Texas, Chung-Lung Kevin Shum, Wappingers Falls, N.Y., and Michael H. Wood, Poughkeepsie, N.Y. The abstract of the patent published by the U.S. Patent and Trademark Office states: "A pipelined processor includes circuitry adapted for store forwarding, including: for each store request, and while a write to one of a cache and a memory is pending; obtaining the most recent value for at least one block of data; merging store data from the store request with the block of data thus updating the block of data and forming a new most recent value and an updated complete block of data; and buffering the updated block of data into a store data queue; for each additional store request, where the additional store request requires at least one updated block of data: determining if store forwarding is appropriate for the additional store request on a block-by-block basis; if store forwarding is appropriate, selecting an appropriate block of data from the store data queue on a block-by-block basis; and forwarding the selected block of data to the additional store request." The patent application was filed on Feb. 15, 2008 (12/031,858). 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,468,306&OS=8,468,306&RS=8,468,306 Written by Arpi Sharma; edited by Anand Kumar. *** International Business Machines Assigned Patent for Hardware Support for Software Controlled Fast Reconfiguration of Performance Counters ALEXANDRIA, Va., June 19 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,468,275) developed by Valentina Salapura, Yorktown Heights, N.Y., and Robert W. Wisniewski, Yorktown Heights, N.Y., for a "hardware support for software controlled fast reconfiguration of performance counters." The abstract of the patent published by the U.S. Patent and Trademark Office states: "Hardware support for software controlled reconfiguration of performance counters may include a plurality of performance counters collecting one or more counts of one or more selected activities. A storage element stores data value representing a time interval, and a timer element reads the data value and detects expiration of the time interval based on the data value and generates a signal. A plurality of configuration registers stores a set of performance counter configurations. A state machine receives the signal and selects a configuration register from the plurality of configuration registers for reconfiguring the one or more performance counters." The patent application was filed on Jan. 8, 2010 (12/684,496). 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,468,275&OS=8,468,275&RS=8,468,275 Written by Arpi Sharma; edited by Anand Kumar. *** International Business Machines Assigned Patent for Tracking and Detecting Thread Dependencies Using Speculative Versioning Cache ALEXANDRIA, Va., June 19 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,468,539) developed by five co-inventors for a "tracking and detecting thread dependencies using speculative versioning cache." The co-inventors are Alexandre E. Eichenberger, Chappaqua, N.Y., John K.P. O'Brien, South Salem, N.Y., Kathryn M. O'Brien, South Salem, N.Y., Lakshminarayanan Renganarayana, Elmsford, N.Y., and Xiaotong Zhuang, Yorktown Heights, N.Y. The abstract of the patent published by the U.S. Patent and Trademark Office states: "Mechanisms are provided for tracking dependencies of threads in a multi-threaded computer program execution. The mechanisms detect a dependency of a first thread's execution on results of a second thread's execution in an execution flow of the multi-threaded computer program. The mechanisms further store, in a hardware thread dependency vector storage associated with the first thread's execution, an identifier of the dependency by setting at least one bit in the hardware thread dependency vector storage corresponding to the second thread. Moreover, the mechanisms schedule tasks performed by the multi-threaded computer program based on the hardware thread dependency vector storage to minimize squashing of threads." The patent application was filed on Sept. 3, 2009 (12/553,314). 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,468,539&OS=8,468,539&RS=8,468,539 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** International Business Machines Assigned Patent for Method and Apparatus for Efficient Inter-thread Synchronization for Helper Threads ALEXANDRIA, Va., June 19 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,468,531) developed by four co-inventors for a "method and apparatus for efficient inter-thread synchronization for helper threads." The co-inventors are Michael K. Gschwind, Chappaqua, N.Y., John K. O'Brien, South Salem, N.Y., Valentina Salapura, Chappaqua, N.Y., and Zehra N. Sura, Yorktown Heights, N.Y. The abstract of the patent published by the U.S. Patent and Trademark Office states: "A monitor bit per hardware thread in a memory location may be allocated, in a multiprocessing computer system having a plurality of hardware threads, the plurality of hardware threads sharing the memory location, and each of the allocated monitor bit corresponding to one of the plurality of hardware threads. A condition bit may be allocated for each of the plurality of hardware threads, the condition bit being allocated in each context of the plurality of hardware threads. In response to detecting the memory location being accessed, it is determined whether a monitor bit corresponding to a hardware thread in the memory location is set. In response to determining that the monitor bit corresponding to a hardware thread is set in the memory location, a condition bit corresponding to a thread accessing the memory location is set in the hardware thread's context." The patent application was filed on May 26, 2010 (12/787,810). 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,468,531&OS=8,468,531&RS=8,468,531 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** International Business Machines Assigned Patent for Parallelization of Irregular Reductions Via Parallel Building and Exploitation of Conflict-free Units of Work at Runtime ALEXANDRIA, Va., June 19 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,468,508) developed by four co-inventors for "parallelization of irregular reductions via parallel building and exploitation of conflict-free units of work at runtime." The co-inventors are Alexandre E. Eichenberger, Yorktown Heights, N.Y., Yangchun Luo, Yorktown Heights, N.Y., John K. O'Brien, Yorktown Heights, N.Y., and Xiaotong Zhuang, Yorktown Heights, N.Y. The abstract of the patent published by the U.S. Patent and Trademark Office states: "An optimizing compiler device, a method, a computer program product which are capable of performing parallelization of irregular reductions. The method for performing parallelization of irregular reductions includes receiving, at a compiler, a program and selecting, at compile time, at least one unit of work (UW) from the program, each UW configured to operate on at least one reduction operation, where at least one reduction operation in the UW operates on a reduction variable whose address is determinable when running the program at a run-time. At run time, for each successive current UW, a list of reduction operations accessed by that unit of work is recorded. Further, it is determined at run time whether reduction operations accessed by a current UW conflict with any reduction operations recorded as having been accessed by prior selected units of work, and assigning the unit of work as a conflict free unit of work (CFUW) when no conflicts are found. Finally, there is scheduled, for parallel run-time operation, at least two or more processing threads to process a respective the at least two or more assigned CFUWs." The patent application was filed on Oct. 9, 2009 (12/576,717). 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,468,508&OS=8,468,508&RS=8,468,508 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** International Business Machines Assigned Patent for Method, System and Program Storage Device for Performing a Parameterized Statistical Static Timing Analysis (SSTA) of an Integrated Circuit Taking into Account Setup and Hold Margin Interdependence ALEXANDRIA, Va., June 19 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,468,483) developed by 10 co-inventors for a "method, system and program storage device for performing a parameterized statistical static timing analysis (SSTA) of an integrated circuit taking into account setup and hold margin interdependence." The co-inventors are Nathan C. Buck, Underhill, Vt., Brian M. Dreibelbis, Underhill, Vt., John P. Dubuque, Jericho, Vt., Eric A. Foreman, Fairfax, Vt., Peter A. Habitz, Hinesburg, Vt., Jeffrey G. Hemmett, St. George, Vt., Natesan Venkateswaran, Hopewell Junction, N.Y., Chandramouli Visweswariah, Croton-on-Hudson, N.Y., Xiaoyue Wang, Kanata, Canada, and Vladimir Zolotov, Putnam Valley, N.Y. The abstract of the patent published by the U.S. Patent and Trademark Office states: "In embodiments of a statistical static timing analysis (SSTA) method, system and program storage device, the interdependence between the setup time and hold time margins of a circuit block (e.g., a latch, flip-flop, etc., which requires the checking of setup and hold timing constraints) is determined, taking into account possible variations in multiple parameters (e.g., using a variation-aware characterizing technique). A parameterized statistical static timing analysis (SSTA) of a circuit incorporating the circuit block is performed in order to determine, in statistical parameterized form, setup and hold times for the circuit block. Based on the interdependence between the setup and hold time margins, setup and hold time constraints can be determined in statistical parameterized form. Finally, the setup and hold times determined during the SSTA can be checked against the setup and hold time constraints to determine, if the time constraints are violated or not and to what degree." The patent application was filed on Oct. 24, 2011 (13/279,373). 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,468,483&OS=8,468,483&RS=8,468,483 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** International Business Machines Assigned Patent for Multiple Level Linked LRU Priority ALEXANDRIA, Va., June 19 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,468,536) developed by four co-inventors for a "multiple level linked LRU priority." The co-inventors are Deanna Postles Dunn Berger, S Hyde Park, N.Y., Ekaterina M. Ambroladze, Wappingers Falls, N.Y., Michael Fee, Cold Spring, N.Y., and Diana Lynn Orf, Somerville, Mass. The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method that includes providing LRU selection logic which controllably pass requests for access to computer system resources to a shared resource via a first level and a second level, determining whether a request in a request group is active, presenting the request to LRU selection logic at the first level, when it is determined that the request is active, determining whether the request is a LRU request of the request group at the first level, forwarding the request to the second level when it is determined that the request is the LRU request of the request group, comparing the request to an LRU request from each of the request groups at the second level to determine whether the request is a LRU request of the plurality of request groups, and selecting the LRU request of the plurality of request groups to access the shared resource." The patent application was filed on June 24, 2010 (12/822,514). 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,468,536&OS=8,468,536&RS=8,468,536 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** International Business Machines Assigned Patent for Identifying Security Vulnerability in Computer Software ALEXANDRIA, Va., June 19 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,468,605) developed by seven co-inventors for an "identifying security vulnerability in computer software." The co-inventors are Yinnon A. Haviv, Beerotaim, Israel, Roee Hay, Haifa, Israel, Marco Pistoia, Amawalk, N.Y., Adi Sharabani, Ramat Gan, Israel, Takaaki Tateishi, Kanagawa-ken, Japan, Omer Tripp, Har-Adar, Israel, and Omri Weisman, Tel Aviv, Israel. The abstract of the patent published by the U.S. Patent and Trademark Office states: "Identifying a security vulnerability in a computer software application by identifying at least one source in a computer software application, identifying at least one sink in the computer software application, identifying at least one input to any of the sinks, determining whether the input derives its value directly or indirectly from any of the sources, determining a set of possible values for the input, and identifying a security vulnerability where the set of possible values for the input does not match a predefined specification of legal values associated with the sink input." The patent application was filed on Nov. 30, 2009 (12/627,351). 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,468,605&OS=8,468,605&RS=8,468,605 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** KNOA Software Assigned Patent ALEXANDRIA, Va., June 19 -- KNOA Software, New York, has been assigned a patent (8,468,502) developed by Philip Lui, New York, Zbigniew Kopytnik, East Stroudsburg, Pa., and David Rayna, Malverne, N.Y., for a "generic, multi-instance method and GUI detection system for tracking and monitoring computer applications." The abstract of the patent published by the U.S. Patent and Trademark Office states: "Presented is a system and method for monitoring events derived from a computer target application presentation layer including the steps of providing, independent of recompiling the target application's source code, a script running at a level within the target application. The script scans run-time instantiations of objects of the target application, and allocates structures in real-time to the object instantiations. These allocated structures are adapted to create a reflection of the target application structure, which is used along with detected object instantiations that match a predetermined object structure to capture a portion of an environmental spectrum of the detected object. Further, the system can process state machine events occurring on at least one of a server machine and a client/localized machine, correlate the state machine events with the environmental spectrum, and deduce a user experience based on the correlated state machine events." The patent application was filed on Nov. 17, 2011 (13/299,032). 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,468,502&OS=8,468,502&RS=8,468,502 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** International Paper Assigned Patent for Paper Substrate Containing a Wetting Agent and having Improved Print Mottle ALEXANDRIA, Va., June 19 -- International Paper, Memphis, Tenn., has been assigned a patent (8,465,622) developed by five co-inventors for a "paper substrate containing a wetting agent and having improved print mottle." The co-inventors are Yan C. Huang, Williamsburg, Ohio, Kapil M. Singh, West Chester, Ohio, David B. Shelmidine, Ticonderoga, N.Y., Jeff R. Becker, Bridport, Vt., and Paul J. Fosco, Ticonderoga, N.Y. The abstract of the patent published by the U.S. Patent and Trademark Office states: "The present invention relates to a sizing composition that, when applied to paper substrate, creates a substrate, preferably suitable for inkjet printing, having increased print density, enhanced print mottle, as well as print sharpness, low HST, and/or image dry time, the substrate preferably having high brightness and reduced color-to-color bleed as well. In addition, the present invention relates to a method of reducing the HST of a paper substrate by applying the sizing composition to at least one surface thereof. Further, the application relates to methods of making and using the sizing composition, as well as methods of making and using the paper containing the sizing composition." The patent application was filed on Nov. 3, 2011 (13/288,465). 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,465,622&OS=8,465,622&RS=8,465,622 Written by Arpi Sharma; edited by Anand Kumar. *** Comfortex Assigned Patent ALEXANDRIA, Va., June 19 -- Comfortex, Maplewood, N.Y., has been assigned a patent (8,465,617) developed by James Barss, Porter Corners, N.Y., for a "waste-free method of making window treatments." The abstract of the patent published by the U.S. Patent and Trademark Office states: "An apparatus and method are disclosed for forming cellular or non-cellular window shades directly from raw stock to the final desired window shade color, height and width to fit a particular window size, with essentially no wasted material. The shade is fabricated from a bonded array of a predetermined number of stacked, identically shaped and sized, elements or preforms of uniform length corresponding to one of the height or width dimensions of the desired window covering. The number of preforms is selected so that the length of the fully expanded array will correspond with the other of the height or width dimensions of the window covering. The raw stock is in the form of a continuously fed narrow strip of uncolored fabric to which the necessary coloring, folding, cutting-to-length, stacking and bonding steps are applied within the disclosed apparatus." The patent application was filed on Sept. 17, 2008 (12/212,260). 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,465,617&OS=8,465,617&RS=8,465,617 Written by Arpi Sharma; edited by Anand Kumar. *** Eastman Kodak Assigned Patent ALEXANDRIA, Va., June 19 -- Eastman Kodak, Rochester, N.Y., has been assigned a patent (8,465,578) developed by Barbara Boland Lussier, Rochester, N.Y., for an "inkjet printing ink set." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A process for printing an image includes printing a substrate with an aqueous inkjet ink and drying the printed image with a near-infrared drying system, wherein the inkjet ink is a yellow or magenta inkjet ink and comprises a yellow or magenta colorant and a distinct near-infrared absorbing compound. Inkjet ink sets for use with an inkjet printing system employing a near-infrared drying system in the process include at least a black ink and a yellow ink, wherein the yellow ink comprises a yellow colorant and dispersed nanoparticulate colloidal silica at a concentration of from 0.1 to about 10 wt %, and the black ink comprises a black colorant and dispersed nanoparticulate colloidal silica at a concentration of from 0 wt. % to at most 1/2 of the wt. % of the dispersed nanoparticulate colloidal silica in the yellow ink. Various embodiments provide a process for inkjet printing and drying inks with improved absorption in the near-IR region of the spectrum for improved drying performance of aqueous, hypsochromic inks, and an inkjet ink set with improved balanced near-IR drying of black and yellow inkjet inks." The patent application was filed on March 31, 2011 (13/076,940). 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,465,578&OS=8,465,578&RS=8,465,578 Written by Arpi Sharma; edited by Anand Kumar. *** Praxair Technology Assigned Patent ALEXANDRIA, Va., June 19 -- Praxair Technology, Danbury, Conn., has been assigned a patent (8,465,630) developed by five co-inventors for an "oxygen separation assembly and method." The co-inventors are David M. Reed, East Amherst, N.Y., David Frisbee Suggs, Eggertsville, N.Y., Michael J. Collins, Lockport, N.Y., Richard Martin Kelly, Buffalo, N.Y., and Gervase Maxwell Christie, Williamsville, N.Y. The abstract of the patent published by the U.S. Patent and Trademark Office states: "An electrically driven oxygen separation assembly and method for applying an electrical potential in which the assembly has one or more tubular membrane elements. The potential is applied at two central spaced locations of a tubular membrane element and at least at opposite end locations thereof. As a result the electric current flow through the tubular membrane element is divided into two parts flowing between the two central spaced locations and the opposite end locations. Additionally, the present invention also provides an end seal to be used in connection with tubular membrane elements." The patent application was filed on Oct. 28, 2009 (12/607,092). 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,465,630&OS=8,465,630&RS=8,465,630 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. -1128812 (c) 2013 Targeted News Service |