Close
SUBSCRIBE TO TMCnet
TMCnet - World's Largest Communications and Technology Community

TMC NEWS

TMCNET eNEWSLETTER SIGNUP

U.S. Patents Awarded to Inventors in New York (Jan. 30)
[January 30, 2013]

U.S. Patents Awarded to Inventors in New York (Jan. 30)

(Targeted News Service Via Acquire Media NewsEdge) Targeted News Service Targeted News Service ALEXANDRIA, Va., Jan. 30 -- The following federal patents were awarded to inventors in New York.

*** TVWorks Assigned Patent ALEXANDRIA, Va., Jan. 30 -- TVWorks, Philadelphia, has been assigned a patent (8,365,230) developed by seven co-inventors for an "interactive user interface for television applications." The co-inventors are Lena D. Chane, San Francisco, Matt Marenghi, San Francisco, Ty Ahmad-Taylor, New York, Alex Chung, San Francisco, Prakash Hegde, Mill Valley, Calif., Samuel Moreau, Mill Valley, Calif., and Darrel Haber, Martinez, Calif.

The abstract of the patent published by the U.S. Patent and Trademark Office states: "An iTV user interface includes a navigable menu area through which a user can select from among a variety of services and a content display area in which formatted data associated with a selected menu service are displayed to the user. The formatted data is displayed in a rotating or ticker fashion having both a passive mode, in which the formatted data is displayed in a sequence independent of any selection operations by a television viewer, and active mode, in which the formatted data is displayed in a sequence that depends on selection operations by the television viewer. Advertisements and/or promotions may be interspersed among the content items. The navigable menu area and the content display area may be displayed to the viewer at the same time as television programming is displayed on the television." The patent application was filed on Sept. 19, 2002 (10/247,901). 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,365,230&OS=8,365,230&RS=8,365,230 Written by Satyaban Rath; edited by Hemanta Panigrahi.

*** International Business Machines Assigned Patent ALEXANDRIA, Va., Jan. 30 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,365,281) developed by five co-inventors for "determining whether method of computer program is a validator." The co-inventors are Takaaki Tateishi, Kanagawa-ken, Japan, Marco Pistoia, Hawthorne, N.Y., Omer Tripp, Herzelyia, Israel, Ryan Berg, Littleton, Mass., and Robert Wiener, Littleton, Mass.


The abstract of the patent published by the U.S. Patent and Trademark Office states: "An illegal pattern and a computer program having a method are received. The method has one or more return statements, and a number of basic blocks. The method is normalized so that each return statement of the target method relating to the illegal pattern returns a constant Boolean value. A first path condition and a second path condition for one or more corresponding paths is determined such that one or more corresponding basic blocks return a constant Boolean value of true for the first path condition and a constant Boolean value of false for the second path condition. An unsatisfiability of each path condition is determined using a monadic second-order logic (M2L) technique. Where the unsatisfiability of either path condition is false, the method is reported as not being a validator. Where the unsatisfiability of either path condition is true, the method is reported as being a validator." The patent application was filed on Nov. 19, 2010 (12/950,432). 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,365,281&OS=8,365,281&RS=8,365,281 Written by Satyaban Rath; edited by Hemanta Panigrahi.

*** International Business Machines Assigned Patent for System, Method, and Program for Determining Validity of String ALEXANDRIA, Va., Jan. 30 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,365,280) developed by four co-inventors for a "system, method, and program for determining validity of string." The co-inventors are Yinnon Avraham Haviv, Haifa, Israel, Marco Pistoia, Amawalk, N.Y., Naoshi Tabuchi, Miyagi, Japan, and Takaaki Tateishi, Kanagawa, Japan.

The abstract of the patent published by the U.S. Patent and Trademark Office states: "A computer-implemented method, program product, and system for determining the validity of a string generated by a computer programming language program. The method includes: abstracting a constraint between variables extracted from a source code for a programming language, describing the constraint in M2L, and storing the constraint; and evaluating the validity of the string on an M2L solver on the basis of the constraint and a M2L specification to determine whether the string is safe or unsafe." The patent application was filed on June 29, 2010 (12/825,610). 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,365,280&OS=8,365,280&RS=8,365,280 Written by Satyaban Rath; edited by Hemanta Panigrahi.

*** NBCUniversal Media Assigned Patent ALEXANDRIA, Va., Jan. 30 -- NBCUniversal Media, New York, has been assigned a patent (8,365,227) developed by Ya Xue, Niskayuna, N.Y., Abha Moitra, Scotia, N.Y., and Steven Matt Gustafson , Niskayuna, N.Y., for "methods and systems for online recommendation." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method for recommending videos is presented. The method includes generating a cross-usage matrix based upon a data of video sessions for a plurality of videos, generating a temporal matrix based upon release dates of the plurality of videos, generating a cross-temporal matrix based upon the cross-usage matrix and the temporal matrix, computing a global video rank corresponding to each of the plurality of videos based upon the cross-temporal matrix, generating a similarity score corresponding to each pair of videos in the plurality of videos based upon meta-data of the plurality of videos, and generating a local video rank corresponding to each of the plurality of videos relative to another video in the plurality of videos based upon the generated cross-usage matrix, the computed global video rank and the generated similarity score." The patent application was filed on Dec. 2, 2009 (12/629,345). 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,365,227&OS=8,365,227&RS=8,365,227 Written by Satyaban Rath; edited by Hemanta Panigrahi.

*** Hewlett-Packard Development Assigned Patent for Migrating a Virtual Machine Across Processing Cells Connected to an Interconnect that Provides Data Communication Without Cache Coherency Support ALEXANDRIA, Va., Jan. 30 -- Hewlett-Packard Development, Houston, has been assigned a patent (8,365,169) developed by four co-inventors for "migrating a virtual machine across processing cells connected to an interconnect that provides data communication without cache coherency support." The co-inventors are Brian J. Watson, Chesapeake, Va., Bret A. McKee, Fort Collins, Colo., Chris D. Hyser, Victor, N.Y., and Robert D. Gardner, Fort Collins, Colo.

The abstract of the patent published by the U.S. Patent and Trademark Office states: "A system includes an interconnect, processing cells connected to the interconnect, the processing cells containing corresponding cache memories and corresponding virtual machines, and a storage cell connected to the interconnect. The storage cell stores data portions that correspond to different ones of the processing cells, and the data portions are owned by individual ones of the processing cells to enable data communication over the interconnect without cache coherency support. A first and second of the processing cells are configured to migrate a virtual machine from the first processing cell to the second processing cell, where the migrated virtual machine in the second processing cell is configured to retrieve virtual machine data from a corresponding one of the data portions in the storage cell." The patent application was filed on Sept. 23, 2008 (12/236,244). 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,365,169&OS=8,365,169&RS=8,365,169 Written by Satyaban Rath; edited by Hemanta Panigrahi.

*** International Business Machines Assigned Patent for Creating and Processing Dynamic Proxy Actions for Actions that are Not Yet Registered with a Client Side Broker ALEXANDRIA, Va., Jan. 30 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,365,194) developed by Robert A. Balfe , Whitesboro, N.Y., for "creating and processing dynamic proxy actions for actions that are not yet registered with a client side broker." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A system using proxy actions to handle requests for actions that are not yet registered with a broker. When an action request is received and the action is not registered in the broker, a proxy action object is created and stored on a proxy action queue. Proxy action objects stored on the queue are read periodically and a check is made as to whether the actions they refer to have been registered yet. If an action for a queued proxy action object has been registered, the action request represented by the proxy action object delivered to the appropriate service provider component. If a proxy action object remains on the proxy action queue without the corresponding action being registered before a corresponding proxy action queue element lifetime timer expires, the proxy action object is removed from the proxy action queue without the action being performed." The patent application was filed on Oct. 29, 2007 (11/927,504). 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,365,194&OS=8,365,194&RS=8,365,194 Written by Satyaban Rath; edited by Hemanta Panigrahi.

*** International Business Machines Assigned Patent for Preventing Execution of Processes Responsive to Changes in the Environment ALEXANDRIA, Va., Jan. 30 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,365,185) developed by Mythili K. Bobak, Lagrangeville, N.Y., Tim A. McConnell, Lexington, Ky., and Michael D. Swanson, Springfield, Ore., for a "preventing execution of processes responsive to changes in the environment." The abstract of the patent published by the U.S. Patent and Trademark Office states: "Processes are programmatically categorized into a plurality of categories, which are prioritized. Serialization is used to control execution of the processes of the various categories. The serialization ensures that processes of higher priority categories are given priority in execution. This includes temporarily preventing processes of lower priority categories from being executed." The patent application was filed on Dec. 28, 2007 (11/965,978). 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,365,185&OS=8,365,185&RS=8,365,185 Written by Satyaban Rath; edited by Hemanta Panigrahi.

*** CA Inc. Assigned Patent ALEXANDRIA, Va., Jan. 30 -- CA Inc., Islandia, N.Y., has been assigned a patent (8,365,183) developed by Kouros Hodaee Esfahany, Huntington, N.Y., Rich Jan Lau, Deer Park, N.Y., and Michael Ralph Chiaramonte, Nesconset, N.Y., for a "system and method for dynamic resource provisioning for job placement." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method for dynamic resource provisioning for job placement includes receiving a request to perform a job on an unspecified computer device. One or more job criteria for performing the job are determined. Each job criteria defines a required operational characteristic needed for a computer device to perform the job. A list of available computer devices is provided. The list includes a plurality of computer devices currently provisioned to perform computer operations. A list of suitable computer devices for performing the job is determined from the list of available computer devices by comparing operational characteristics for each available computer device with the job criteria. The list of suitable computer devices includes one or more computer devices having operational characteristics that satisfy the job criteria. From the list of suitable computer devices, a least active computer device is determined, and the job is forwarded to the least active computer device." The patent application was filed on May 27, 2005 (12/203,018). 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,365,183&OS=8,365,183&RS=8,365,183 Written by Satyaban Rath; edited by Hemanta Panigrahi.

*** International Business Machines Assigned Patent for Method and Apparatus for on-demand Resource Allocation and Job Management ALEXANDRIA, Va., Jan. 30 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,365,173) developed by four co-inventors for a "method and apparatus for on-demand resource allocation and job management." The co-inventors are Wuqin Lin, Briarcliff Manor, N.Y., Zhen Liu, Tarrytown, N.Y., Charalambos Stavropoulos, Tarrytown, N.Y., and Cathy Honghui Xia, Croton-on-Hudson, N.Y.

The abstract of the patent published by the U.S. Patent and Trademark Office states: "The invention is a method and apparatus for on-demand resource planning for unified messaging services. In one embodiment, multiple clients are served by a single system, and existing system resources are allocated among all clients in a manner that optimizes system output and service provider profit without the need to increase system resources. In one embodiment, resource allocation and job scheduling are guided by individual service level agreements between the service provider and the clients that dictate minimum service levels that must be achieved by the system. Jobs are processed in a manner that at least meets the specified service levels, and the benefit or profit derived by the service provider is maximized by prioritizing incoming job requests within the parameters of the specified service levels while meeting the specified service levels. Thus, operation and hardware costs remain substantially unchanged, while system output and profit are maximized." The patent application was filed on June 30, 2008 (12/164,525). 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,365,173&OS=8,365,173&RS=8,365,173 Written by Satyaban Rath; edited by Hemanta Panigrahi.

*** International Business Machines Assigned Patent for Provisioning Storage-optimized Virtual Machines Within a Virtual Desktop Environment ALEXANDRIA, Va., Jan. 30 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,365,167) developed by four co-inventors for "provisioning storage-optimized virtual machines within a virtual desktop environment." The co-inventors are Kirk A. Beaty, Goldens Bridge, N.Y., Andrzej Kochut, Elmsford, N.Y., Daniel Salinas, Farmington Hills, Mich., and Charles Otto Schulz, Ridgefield, Conn.

The abstract of the patent published by the U.S. Patent and Trademark Office states: "A computer implemented method, a computer program product, and data processing system clone virtual machines in a virtual desktop environment. A request to clone a new virtual machine is intercepted, wherein the request was initially sent to a virtual management server. Responsive to intercepting the request, the new virtual machine is cloned from a snapshot of a master virtual machine. A delta file is created for the new virtual machine, wherein the delta file includes a base disk reference and a copied delta file. The new virtual machine is configured to read a base disk image from a snapshot of the master virtual machine. The new virtual machine is configured to write data to the copied delta file in the delta file." The patent application was filed on April 15, 2008 (12/103,606). 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,365,167&OS=8,365,167&RS=8,365,167 Written by Satyaban Rath; edited by Hemanta Panigrahi.

*** International Business Machines Assigned Patent for I/O Agent Assignment for Jobs Using an MPI Library ALEXANDRIA, Va., Jan. 30 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,365,171) developed by Ellick Chi-Lick Law, Woodstock, N.Y., Haizhu Liu, Poughkeepsie, N.Y., and Richard Roy Truemann, Highland, N.Y., for an "I/O agent assignment for jobs using an MPI library." The abstract of the patent published by the U.S. Patent and Trademark Office states: "An MPI library including selective I/O agent assignment from among executing tasks, provides improved performance. An MPI job is made up of a number of tasks. I/O operations in an MPI job are performed by tasks assigned as I/O agents. I/O agents are assigned such that the number of tasks assigned as I/O agents are less than the total number of tasks that make up the MPI job. In a dynamic MPI job, I/O agents may be selected from among tasks executing on a lead world or may be spread across multiple worlds. To perform I/O operations initiated by any tasks of an MPI job, including tasks not assigned as I/O agents, the MPI library instantiates worker threads within the tasks assigned as I/O agents. Once the tasks are assigned as I/O agents, identity information of the I/O agents may be stored so that a repeat assignment is not necessary." The patent application was filed on March 22, 2010 (12/728,781). 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,365,171&OS=8,365,171&RS=8,365,171 Written by Satyaban Rath; edited by Hemanta Panigrahi.

*** International Business Machines, Infineon Technologies North America Assigned Patent ALEXANDRIA, Va., Jan. 30 -- International Business Machines, Armonk, N.Y., and Infineon Technologies North America, Milpitas, Calif., have been assigned a patent (8,365,108) developed by Zachary Baum, Gardiner, N.Y., Henning Haffner, Pawling, N.Y., and Scott M. Mansfield, Hopewell Junction, N.Y., for "generating cut mask for double-patterning process." The abstract of the patent published by the U.S. Patent and Trademark Office states: "Aspects of the invention include a computer-implemented method of designing a photomask. In one embodiment, the method comprises: simulating a first photomask patterning process using a first photomask design to create simulated contours; comparing the simulated contours to a desired design; identifying regions not common to the simulated contours and the desired design; creating desired target shapes for a second photomask patterning process subsequent to the first photomask patterning process based upon the identified regions; and providing the desired target shapes for forming of a second photomask design based upon the desired target shapes." The patent application was filed on Jan. 6, 2011 (12/985,643). 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,365,108&OS=8,365,108&RS=8,365,108 Written by Satyaban Rath; edited by Hemanta Panigrahi.

*** International Business Machines Assigned Patent for Determining Availability Based on Percentage Available ALEXANDRIA, Va., Jan. 30 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,364,752) developed by Brian D. Goodman, Brooklyn, N.Y., and Lisa Seacat DeLuca, San Francisco, for "determining availability based on percentage available." The abstract of the patent published by the U.S. Patent and Trademark Office states: "An embodiment of the invention provides a system and method for displaying the scheduling availability of a user. The system includes an occupancy module for analyzing the schedule of the user to determine the occupancy for a time period in the schedule. The time period includes an available time slot and/or an occupied time slot. A processor connected to the occupancy module determines whether the occupancy for the time period is above a threshold level of occupancy. The threshold level of occupancy includes a maximum number of occupied time slots, a maximum percentage of occupied time slots, a maximum amount of occupied time, and/or a maximum percentage of occupied time. A scheduling module connected to the processor automatically displays the scheduling availability of the user as unavailable for the time slot when the occupancy for the time period is above the threshold level of occupancy." The patent application was filed on Feb. 18, 2011 (13/030,835). 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,64,752.PN.&OS=PN/83,64,752&RS=PN/83,64,752 Written by Amal Ahmed; edited by Jaya Anand.

*** International Business Machines Assigned Patent for Broken-spheres Methodology for Improved Failure Probability Analysis in Multi-fail Regions ALEXANDRIA, Va., Jan. 30 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,365,118) developed by four co-inventors for "broken-spheres methodology for improved failure probability analysis in multi-fail regions." The co-inventors are Rajiv V. Joshi, Yorktown Heights, N.Y., Rouwaida N. Kanj, Round Rock, Texas, Zhuo Li, Cedar Park, Texas, and Sani R. Nassif, Austin, Texas.

The abstract of the patent published by the U.S. Patent and Trademark Office states: "A failure probability for a system having multi-fail regions is computed by generating failure directions in a space whose dimensions are the system parameters under consideration. The failure directions are preferably uniform, forming radial slices. The failure directions may be weighted. The radial slices have fail boundaries defining fail regions comparable to broken shells. The distribution of the system parameters is integrated across the broken shell regions to derive a failure contribution for each failure direction. The failure probability is the sum of products of each failure contribution and its weight. Failure contributions are computed using equivalent expressions dependent on the number of dimensions, which can be used to build lookup tables for normalized fail boundary radii. The entire process can be iteratively repeated with successively increasing failure directions until the failure probability converges. The method is particularly useful in analyzing failure probability of electrical circuits such as memory cells." The patent application was filed on June 3, 2009 (12/477,361). 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,365,118&OS=8,365,118&RS=8,365,118 Written by Satyaban Rath; edited by Hemanta Panigrahi.

*** Motorola Mobility Assigned Patent ALEXANDRIA, Va., Jan. 30 -- Motorola Mobility, Libertyville, Ill., has been assigned a patent (8,365,096) developed by six co-inventors for a "method and apparatus for transparently mapping personalized alert preferences onto thin client devices with differing capabilities." The co-inventors are Mark R. Braun, Elgin, Ill., William M. Carey, London, William A. Myers, Buffalo Grove, Ill., Nitya Narasimhan, Lake Zurich, Ill., William Reinisch, New York, and Craig C. Watson, Southampton, United Kingdom.

The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method and apparatus that personalizes preferences for a thin client using custom menus is disclosed. The method may include receiving registering capabilities from the thin client, storing feature list for all devices, generation of a custom alert settings menu based on the thin client's capabilities, storing selected alert settings, and generating a list of all registered devices that have similar alert capabilities as the thin client. The custom menu can be viewed by a user on any device that has display capabilities. The user can select from among the alert settings supported by the thin client or select the alert settings for the thin client that is similar to a registered device. Apparatus is also provided for mapping alert capabilities from the feature list and the received alert preferences from a user. Thin client mapping of mapping of alert type is also provided for processing an alert request from an external device." The patent application was filed on Dec. 31, 2007 (11/967,738). 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,365,096&OS=8,365,096&RS=8,365,096 Written by Satyaban Rath; edited by Hemanta Panigrahi.

*** International Business Machines Assigned Patent for Reduction of Message Flow between Bus-connected Consumers and Producers ALEXANDRIA, Va., Jan. 30 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,364,818) developed by Jun-Jang Jeng, Armonk, N.Y., Christian A. Lang, New York, and Ioana Stanoi, White Plains, N.Y., for a "reduction of message flow between bus-connected consumers and producers." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A system, method, and computer readable medium for reducing message flow on a message bus are disclosed. The method includes determining if at least one logical operator in a plurality of logical operators requires processing on a given physical processing node in a group of physical nodes. In response to determining that the logical operator requires processing on the given physical processing node, the logical operator is pinned to the given physical processing node. Each logical operator in the plurality of logical operators is assigned to an initial physical processing node in the group of physical processing nodes on a message bus." The patent application was filed on May 4, 2009 (12/434,840). 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,64,818.PN.&OS=PN/83,64,818&RS=PN/83,64,818 Written by Amal Ahmed; edited by Jaya Anand.

*** International Business Machines Assigned Patent for Logic Modification Synthesis ALEXANDRIA, Va., Jan. 30 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,365,114) developed by six co-inventors for a logic modification synthesis. The co-inventors are Eli Arbel, Nesher, Ill., David Geiger, Peekskill, N.Y., Victor Kravets, New York, Smita Krishnaswamy, New York, Ruchir Puri, Baldwin Place, N.Y., and Haoxing Ren, Austin, Texas.

The abstract of the patent published by the U.S. Patent and Trademark Office states: "Two circuits, an original and a modified, are being recognized, with the original circuit having a first logic and the modified circuit having a second logic. The second logic contains at least one desired logic change relative to the first logic. An equivalence line is detected in the original circuit such that the first and second logic are equivalent from the circuit inputs to the equivalence line. At least one point of change is located amongst the logic gates that are neighboring the equivalence line. The points of change are accepted as verified if an observability condition is fulfilled. The observability condition is checked within a Boolean Satisfiability (SAT) formulation. Substitute logic for the verified points of change is derived using SAT and Boolean equation solving techniques, in such manner that the first logic becomes equivalent to the second logic." The patent application was filed on Aug. 25, 2010 (12/862,838). 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,365,114&OS=8,365,114&RS=8,365,114 Written by Satyaban Rath; edited by Hemanta Panigrahi.

*** International Business Machines Assigned Patent for Snapshot Interface Operations ALEXANDRIA, Va., Jan. 30 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,364,849) developed by ten co-inventors for snapshot interface operations. The co-inventors are Piyush Chaudhary, Fishkill, N.Y., Jason E. Goscinski, Snoqualmie, Wash., Rama K. Govindaraju, Hopewell Junction, N.Y., Leonard W. Helmer Jr., Stone Ridge, N.Y., Peter H. Hochschild, New York, Deryck X. Hong, Poughkeepsie, N.Y., John S. Houston, Hopewell Junction, N.Y., Jang-Soo Lee, Fishkill, N.Y., Steven J. Martin, Poughkeepsie, N.Y., and Yuqing Zhu, Ossining, N.Y.

The abstract of the patent published by the U.S. Patent and Trademark Office states: "In a multinode data processing system in which the nodes communicate with one another via communication adapters over a network or switch, the adapters are provided with a dual register mechanism for tracking microcode task status. Upon the issuance of a disruptive command that requires attention from one of the nodes, the task status maintained in one register is copied to the snapshot register. As tasks within the adapter are completed, both registers are updated, thus providing a mechanism for the nodes to determine that all tasks active at the time of the disruptive command have completed. This means that the nodes now have a mechanism for determining, as soon as possible, that all tasks that are active when a disruptive command occurs have completed, thus allowing the data processing node to perform such operations as releasing system memory that is associated with the disruptive command, thus eliminating temporal overhead that can affect performance." The patent application was filed on Dec. 20, 2004 (11/017,332). 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,64,849.PN.&OS=PN/83,64,849&RS=PN/83,64,849 Written by Amal Ahmed; edited by Jaya Anand.

*** International Business Machines Assigned Patent for Virtual Web Service ALEXANDRIA, Va., Jan. 30 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,364,837) developed by four co-inventors for a virtual web service. The co-inventors are Moon J. Kim, Wappingers Falls, N.Y., Juan Leon Rodriguez, San Ysidro, Calif., Joshua M. Woods, Farnhamville, Iowa, and Eric T.C. Yee, Los Angeles.

The abstract of the patent published by the U.S. Patent and Trademark Office states: "An improved solution for Web services is provided. In an embodiment of the invention, a method for providing a virtual Web service includes: providing a Web service gatekeeper, where the gatekeeper acts as an access point to multiple private internal enterprise environments; and then the gatekeeper receives a request for access to one, or more, of these private internal enterprise environments." The patent application was filed on Jan. 24, 2008 (12/019,230). 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,64,837.PN.&OS=PN/83,64,837&RS=PN/83,64,837 Written by Amal Ahmed; edited by Jaya Anand.

*** Realtime Data Assigned Patent ALEXANDRIA, Va., Jan. 30 -- Realtime Data, Armonk, N.Y., has been assigned a patent (8,364,836) developed by James J. Fallon, Armonk, N.Y., for a "system and methods for accelerated data storage and retrieval." The abstract of the patent published by the U.S. Patent and Trademark Office states: "Systems and methods for providing accelerated data storage and retrieval utilizing lossless data compression and decompression. A data storage accelerator includes one or a plurality of high speed data compression encoders that are configured to simultaneously or sequentially losslessly compress data at a rate equivalent to or faster than the transmission rate of an input data stream. The compressed data is subsequently stored in a target memory or other storage device whose input data storage bandwidth is lower than the original input data stream bandwidth. Similarly, a data retrieval accelerator includes one or a plurality of high speed data decompression decoders that are configured to simultaneously or sequentially losslessly decompress data at a rate equivalent to or faster than the input data stream from the target memory or storage device. The decompressed data is then output at rate data that is greater than the output rate from the target memory or data storage device. The data storage and retrieval accelerator method and system may employed: in a disk storage adapter to reduce the time required to store and retrieve data from computer to disk; in conjunction with random access memory to reduce the time required to store and retrieve data from random access memory; in a display controller to reduce the time required to send display data to the display controller or processor; and/or in an input/output controller to reduce the time required to store, retrieve, or transmit data." The patent application was filed on Oct. 26, 2006 (11/553,427). 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,64,836.PN.&OS=PN/83,64,836&RS=PN/83,64,836 Written by Amal Ahmed; edited by Jaya Anand.

*** International Business Machines Assigned Patent for Converting from Decimal Floating Point into Scaled Binary Coded Decimal ALEXANDRIA, Va., Jan. 30 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,364,734) developed by Steven R. Carlough, Poughkeepsie, N.Y., Eric M. Schwarz, Gardiner, N.Y., and Sheryll H. Veneracion, Pleasant Valley, N.Y., for "converting from decimal floating point into scaled binary coded decimal." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A system and method for converting from decimal floating point (DFP) into scaled binary coded decimal (SBCD). The system includes a mechanism for receiving a DFP number. The system also includes at least one of a mechanism for performing coefficient expansion on the DFP number to create a binary coded decimal (BCD) coefficient part of a SBCD number and a mechanism for performing exponent extraction on the DFP number to create an exponent part of the SBCD number." The patent application was filed on Sept. 15, 2005 (11/227,481). 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,64,734.PN.&OS=PN/83,64,734&RS=PN/83,64,734 Written by Amal Ahmed; edited by Jaya Anand.

*** International Business Machines Assigned Patent for Fibre Channel Input/Output Data Routing System and Method ALEXANDRIA, Va., Jan. 30 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,364,853) developed by Clinton E. Bubb, Pleasant Valley, N.Y., Daniel F. Casper, Poughkeepsie, N.Y., and John R. Flanagan, Poughkeepsie, N.Y., for a "fibre channel input/output data routing system and method." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A computer program product is provided for performing a method including: obtaining information relating to an I/O operation at a channel subsystem in a host computer system; generating at least one address control word (ACW) in the local channel memory specifying one or more host memory locations for transfer of data between the host and a control unit and including at least one ACW error checking field; generating an address control structure specifying a location in the local channel memory of a corresponding ACW and including at least one address control structure error checking field; receiving a data transfer request from the network interface that includes the addressing information; comparing the at least one ACW error checking field to the at least one address control structure error checking field; and, responsive to the fields matching, routing the data transfer request to the host memory location specified in the corresponding ACW." The patent application was filed on June 1, 2011 (13/150,539). 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,64,853.PN.&OS=PN/83,64,853&RS=PN/83,64,853 Written by Amal Ahmed; edited by Jaya Anand.

*** International Business Machines Assigned Patent for Deadlock-free Class Routes for Collective Communications Embedded in a Multi-dimensional Torus Network ALEXANDRIA, Va., Jan. 30 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,364,844) developed by four co-inventors for "deadlock-free class routes for collective communications embedded in a multi-dimensional torus network." The co-inventors are Dong Chen, Yorktown Heights, N.Y., Noel A. Eisley, Yorktown Heights, N.Y., Burkhard Steinmacher-Burow, Boeblingen, Germany, and Philip Heidelberger, Yorktown Heights, N.Y.

The abstract of the patent published by the U.S. Patent and Trademark Office states: "A computer implemented method and a system for routing data packets in a multi-dimensional computer network. The method comprises routing a data packet among nodes along one dimension towards a root node, each node having input and output communication links, said root node not having any outgoing uplinks, and determining at each node if the data packet has reached a predefined coordinate for the dimension or an edge of the subrectangle for the dimension, and if the data packet has reached the predefined coordinate for the dimension or the edge of the subrectangle for the dimension, determining if the data packet has reached the root node, and if the data packet has not reached the root node, routing the data packet among nodes along another dimension towards the root node." The patent application was filed on Jan. 29, 2010 (12/697,015). 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,64,844.PN.&OS=PN/83,64,844&RS=PN/83,64,844 Written by Amal Ahmed; edited by Jaya Anand.

*** International Business Machines Assigned Patent for Fibre Channel Input/Output Data Routing System and Method ALEXANDRIA, Va., Jan. 30 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,364,854) developed by Clinton E. Bubb, Pleasant Valley, N.Y., Daniel F. Casper, Poughkeepsie, N.Y., and John R. Flanagan, Poughkeepsie, N.Y., for a "fibre channel input/output data routing system and method." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A computer program product is provided for performing input/output (I/O) processing at a host computer system. The computer program product is configured to perform: generating an address control structure for each of a plurality of consecutive data transfer requests specified by an I/O operation, each address control structure specifying a location in the local channel memory of a corresponding address control word (ACW) that includes an Offset field indicating a relative order of a data transfer request; generating and storing in local channel memory at least one ACW specifying one or more host memory locations for the plurality of consecutive data transfer requests and including an Expected Offset field indicating a relative order of an expected data transfer request; receiving a transfer request from the network interface and comparing the Offset field and the Expected Offset field to determine whether the data transfer request has been received in the correct order." The patent application was filed on June 1, 2011 (13/150,555). 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,64,854.PN.&OS=PN/83,64,854&RS=PN/83,64,854 Written by Amal Ahmed; edited by Jaya Anand.

*** International Business Machines Assigned Patent for Sparse Matrix-vector Multiplication on Graphics Processor Units ALEXANDRIA, Va., Jan. 30 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,364,739) developed by Muthu M. Baskaran, Columbus, Ohio, and Rajesh J. Bordawekar, Yorktown Heights, N.Y., for a "sparse matrix-vector multiplication on graphics processor units." The abstract of the patent published by the U.S. Patent and Trademark Office states: "Techniques for optimizing sparse matrix-vector multiplication (SpMV) on a graphics processing unit (GPU) are provided. The techniques include receiving a sparse matrix-vector multiplication, analyzing the sparse matrix-vector multiplication to identify one or more optimizations, wherein analyzing the sparse matrix-vector multiplication to identify one or more optimizations comprises analyzing a non-zero pattern for one or more optimizations and determining whether the sparse matrix-vector multiplication is to be reused across computation, optimizing the sparse matrix-vector multiplication, wherein optimizing the sparse matrix-vector multiplication comprises optimizing global memory access, optimizing shared memory access and exploiting reuse and parallelism, and outputting an optimized sparse matrix-vector multiplication." The patent application was filed on Sept. 30, 2009 (12/569,942). 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,64,739.PN.&OS=PN/83,64,739&RS=PN/83,64,739 Written by Amal Ahmed; edited by Jaya Anand.

*** CA Inc. Assigned Patent ALEXANDRIA, Va., Jan. 30 -- CA Inc., Islandia, N.Y., has been assigned a patent (8,364,787) developed by Tim Chou, Syosset, N.Y., for "automatically adjusting command parameters to support devices of a computer network." The abstract of the patent published by the U.S. Patent and Trademark Office states: "Adjusting one or more command parameters for a device of a computer network includes accessing command sets. A command set comprises one or more commands supported by a known device, and a command has one or more command parameters. One or more command sets associated with an unknown device are identified. The following are repeated for each command set of the one or more command sets until a termination event occurs: applying the command set to the unknown device to perform an operation; determining whether the command set has failed to perform the operation; and automatically adjusting the command parameters of the command set if the command set has failed to perform the operation." The patent application was filed on Aug. 3, 2007 (11/833,295). 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,64,787.PN.&OS=PN/83,64,787&RS=PN/83,64,787 Written by Amal Ahmed; edited by Jaya Anand.

*** Harris Assigned Patent ALEXANDRIA, Va., Jan. 30 -- Harris, Melbourne, Fla., has been assigned a patent (8,364,976) developed by four co-inventors for a "pass-through adapter with crypto ignition key (CIK) functionality." The co-inventors are Christopher D. Mackey, Spencerport, N.Y., Duncan G. Harris, Webster, N.Y., Michael D. Stevens, Avon, N.Y., and Scott E. Bartholomew, Webster, N.Y.

The abstract of the patent published by the U.S. Patent and Trademark Office states: "A pass-through adapter includes an adapter body having at least two connector pin interfaces, with one configured for coupling to an external device such as a communications device. Each connector pin interface includes a plurality of connector pins, including a plurality of pass-through connector pins operative with each other for in-line, pass-through signaling when the pass-through adapter is coupled to the external device. A crypto ignition key (CIK) circuit is contained within the adapter body and connected to at least one of the connector pins to provide a secure mode of operation for the external device." The patent application was filed on March 25, 2008 (12/054,657). 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,364,976.PN.&OS=PN/8,364,976&RS=PN/8,364,976 Written by Kusum Sangma; edited by Anand Kumar.

*** Google Assigned Patent for Cross-origin Communication in Browser Frames ALEXANDRIA, Va., Jan. 30 -- Google, Mountain View, Calif., has been assigned a patent (8,365,061) developed by four co-inventors for a "cross-origin communication in browser frames." The co-inventors are David Bloom, Mountain View, Calif., Joseph Schorr, New York, Ben Lisbakken, San Francisco, and Jeffrey W. Scudder, Sunnyvale, Calif.

The abstract of the patent published by the U.S. Patent and Trademark Office states: "A device may create a child frame within a container frame displayed by a browser program. The child frame may be associated with an origin that is different than an origin associated with the container frame. The device may determine whether the child frame is locked to prohibit reading of information relating to the child frame. The determination of whether the child frame is locked including checking whether a first variable is present in the child frame. The device may determine one or more values relating to the child frame, where the one or more values are determined by checking whether a second set of variables is present in the child frame, where each variable, in the second set, corresponds to a single bit of the one or more values." The patent application was filed on Nov. 2, 2011 (13/287,599). 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,365,061.PN.&OS=PN/8,365,061&RS=PN/8,365,061 Written by Kusum Sangma; edited by Anand Kumar.

*** CQRCert Assigned Patent ALEXANDRIA, Va., Jan. 30 -- CQRCert, New York, has been assigned a patent (8,364,967) developed by Frank W. Sudia, New York, Peter C. Freund, New York, and Stuart T.F. Huang, Washington, for a "multi-step digital signature method and system." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A multi-step signing system and method uses multiple signing devices to affix a single signature which can be verified using a single public verification key. Each signing device possesses a share of the signature key and affixes a partial signature in response to authorization from a plurality of authorizing agents. In a serial embodiment, after a first partial signature has been affixed, a second signing device exponentiates the first partial signature. In a parallel embodiment, each signing device affixes a partial signature, and the plurality of partial signatures are multiplied together to form the final signature. Security of the system is enhanced by distributing capability to affix signatures among a plurality of signing devices and by distributing authority us affix a partial signature among a plurality of authorizing agents." The patent application was filed on March 23, 2009 (12/382,721). 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,364,967.PN.&OS=PN/8,364,967&RS=PN/8,364,967 Written by Kusum Sangma; edited by Anand Kumar.

*** International Business Machines Assigned Patent for System for Concurrently Managing Multiple Avatars ALEXANDRIA, Va., Jan. 30 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,365,076) developed by five co-inventors for a "system for concurrently managing multiple avatars." The co-inventors are Rick A. Hamilton II, Charlottesville, Va., Brian O'Connell, Cary, N.C., Clifford A. Pickover, Yorktown Heights, N.Y., Anne R. Sand, Peyton, Colo., and Keith R. Walker, Austin, Texas.

The abstract of the patent published by the U.S. Patent and Trademark Office states: "An approach for cloning and merging avatars that are online in a virtual universe is described. In one embodiment, there is an avatar identification component which is configured to create an identification number associated with a second avatar, a GUI partitioning component configured to partition the graphic user interface of a virtual universe, an avatar rendering component configured to render a second avatar, a communication channel component configured to manage the second avatar's communication channel, and an inventory management component configured to manage the second avatar's inventory." The patent application was filed on June 10, 2008 (12/136,276). 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,365,076.PN.&OS=PN/8,365,076&RS=PN/8,365,076 Written by Kusum Sangma; edited by Anand Kumar.

*** International Business Machines Assigned Patent for User-controlled Targeted Cache Purge ALEXANDRIA, Va., Jan. 30 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,364,899) developed by Ekaterina M. Ambroladze, Fishkill, N.Y., Patrick J. Meaney, Poughkeepsie, N.Y., and Arthur J. O'Neill Jr., Poughkeepsie, N.Y., for a "user-controlled targeted cache purge." The abstract of the patent published by the U.S. Patent and Trademark Office states: "User-controlled targeted cache purging includes receiving a request to perform an operation to purge data from a cache, the request including an index identifier identifying an index associated with the cache. The index specifies a portion of the cache to be purged. The user-controlled targeted cache purging also includes purging the data from the cache, and providing notification of successful completion of the operation." The patent application was filed on June 24, 2010 (12/822,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=8,364,899.PN.&OS=PN/8,364,899&RS=PN/8,364,899 Written by Kusum Sangma; edited by Anand Kumar.

*** International Business Machines Assigned Patent for High Performance Cache Directory Error Correction Code ALEXANDRIA, Va., Jan. 30 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,365,055) developed by Ekaterina M. Ambroladze, Waappingers Falls, N.Y., Patrick J. Meaney, Poughkeepsie, N.Y., and Arthur J. O'Neill Jr., Poughkeepsie, N.Y., for a "high performance cache directory error correction code." The abstract of the patent published by the U.S. Patent and Trademark Office states: "Defining a set of correctable error and uncorrectable error syndrome code points, generating an error correction code (ECC) syndrome decode, regarding the uncorrectable error syndrome code points as "don't cares" and logically minimizing the ECC syndrome decode for the determination of the correctable error syndrome code points based on the regarding of the uncorrectable error syndrome code points as the "don't cares" whereby output data can be ignored for the uncorrectable error syndrome code points." The patent application was filed on June 24, 2010 (12/822,889). 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,365,055.PN.&OS=PN/8,365,055&RS=PN/8,365,055 Written by Kusum Sangma; edited by Anand Kumar.

*** International Business Machines Assigned Patent for System and Method for Incident Management Enhanced with Problem Classification for Technical Support Services ALEXANDRIA, Va., Jan. 30 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,365,019) developed by Anca Sailer, Scarsdale, N.Y., Hidayatullah Habeebullah Shaikh, Mohegan Lake, N.Y., and Yang Song, Kirkland, Wash., for a "system and method for incident management enhanced with problem classification for technical support services." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A system and method of problem determination and resolution utilizes enhanced problem classification, and effectively categorizes any problem a user experiences by leveraging all available data to recognize the specific problem. Historical problem data is labeled with the cause of that problem and is analyzed to learn problem patterns. The historical problem data is classified into a predefined hierarchical structure of taxonomies by using an incremental online learning algorithm. The hierarchical structure and learned patterns are utilized to recognize problems and generate the root cause of the problem when given a new set of monitoring data and log data." The patent application was filed on June 16, 2009 (12/485,655). 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,365,019.PN.&OS=PN/8,365,019&RS=PN/8,365,019 Written by Kusum Sangma; edited by Anand Kumar.

*** International Business Machines Assigned Patent for Providing Unsolicited Global Disconnect Requests to Users of Storage ALEXANDRIA, Va., Jan. 30 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,365,008) developed by four co-inventors for "providing unsolicited global disconnect requests to users of storage." The co-inventors are Brian D. Clark, Tucson, Ariz., Juan A. Coronado, Tucson, Ariz., Christopher D. Filachek, Lagrangeville, N.Y., and Beth A. Peterson, Tucson, Ariz.

The abstract of the patent published by the U.S. Patent and Trademark Office states: "A mechanism is provided in a storage control unit in a data processing system for providing unsolicited global disconnect requests to users. The mechanism stores lock control data in the storage control unit. The storage control unit allocates its resources into a plurality of clusters. Responsive to a given user connecting to a given partition that is for a logical subsystem resident on a first cluster within the plurality of clusters, the mechanism sends reflected partition information from the first cluster to a second cluster within the plurality of clusters. Responsive to the first cluster experiencing a failure condition, the mechanism moves control data from one or more logical subsystems from the first cluster to the second cluster and for each logical subsystem that moved from the first logical subsystem to the second logical subsystem and that has reflected partition information, presents unsolicited status to one or more users." The patent application was filed on Oct. 13, 2010 (12/903,623). 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,365,008.PN.&OS=PN/8,365,008&RS=PN/8,365,008 Written by Kusum Sangma; edited by Anand Kumar.

*** International Business Machines Assigned Patent for Horizontal Cache Persistence in a Multi-compute Node, Symmetric Multiprocessing Computer ALEXANDRIA, Va., Jan. 30 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,364,904) developed by five co-inventors for a "horizontal cache persistence in a multi-compute node, symmetric multiprocessing computer." The co-inventors are Michael A. Blake, Wappingers Falls, N.Y., Lawrence D. Curley, Endwell, N.Y., Garrett M. Drapala, Poughkeepsie, N.Y., Edward J. Kaminski, Wynnewood, Pa., and Craig R. Walters, Highland, N.Y.

The abstract of the patent published by the U.S. Patent and Trademark Office states: "Horizontal cache persistence in a multi-compute node, SMP computer, including, responsive to a determination to evict a cache line on a first one of the compute nodes, broadcasting by a first compute node an eviction notice for the cache line; transmitting the state of the cache line receiving compute nodes, including, if the cache line is missing from a compute node, an indication whether that compute node has cache storage space available for the cache line; determining by the first compute node, according to the states of the cache line and space available, whether the first compute node can evict the cache line without writing the cache line to main memory; and updating by each compute node the state of the cache line in each compute node, in dependence upon one or more of the states of the cache line in all the compute nodes." The patent application was filed on June 21, 2010 (12/819,348). 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,364,904.PN.&OS=PN/8,364,904&RS=PN/8,364,904 Written by Kusum Sangma; edited by Anand Kumar.

*** International Business Machines Assigned Patent for System and Method of Providing Credentials in a Network ALEXANDRIA, Va., Jan. 30 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,364,957) developed by Dmitry Andreev, Larchmont, N.Y., Gregory Vilshansky, Chappaqua, N.Y., and Boris Vishnevsky, Wayne, Pa., for a "system and method of providing credentials in a network." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method and system is provided to provide single sign on (SSO) functionality in a network that avoids storing a user's credentials in persistent storage. A session may be initiated with a portal which sends a session ID derivative as a credential string instead of a user's password to a target application. When the target application attempts to authenticate the user, by sending a request to a LDAP directory, the request is intercepted by a LDAP proxy that instead validates the UserID with the LDAP directory and the password is validated by a credential validator component which verifies with the portal that the credential string presented as the user password has been produced from the active session ID. In an embodiment, the credential string validator validates each short-living credential only once and upon detecting a second validation request for the same string, initiates a security breech process. A target application proxy may also be employed to terminate all sessions with the UserID when duplicate session requests occur." The patent application was filed on March 2, 2004 (10/791,322). 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,364,957.PN.&OS=PN/8,364,957&RS=PN/8,364,957 Written by Kusum Sangma; edited by Anand Kumar.

*** International Business Machines Assigned Patent for Use of Test Protection Instruction in Computing Environments that Support Pageable Guests ALEXANDRIA, Va., Jan. 30 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,364,912) developed by four co-inventors for a "use of test protection instruction in computing environments that support pageable guests." The co-inventors are Mark S. Farrell, Pleasant Valley, N.Y., Lisa Cranton Heller, Rhinebeck, N.Y., Damian L. Osisek, Vestal, N.Y., and Peter K. Szwed, Rhineback, N.Y.

The abstract of the patent published by the U.S. Patent and Trademark Office states: "Management of storage used by pageable guests of a computing environment is facilitated. A query instruction is provided that details information regarding the storage location indicated in the query. It specifies whether the storage location, if protected, is protected by host-level protection or guest-level protection." The patent application was filed on Oct. 27, 2011 (13/283,171). 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,364,912.PN.&OS=PN/8,364,912&RS=PN/8,364,912 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; editor@targetednews.com; http://targetednews.com.

-1112571 (c) 2013 Targeted News Service

[ Back To TMCnet.com's Homepage ]





LATEST VIDEOS

DOWNLOAD CENTER

UPCOMING WEBINARS

MOST POPULAR STORIES





Technology Marketing Corporation

800 Connecticut Ave, 1st Floor East, Norwalk, CT 06854 USA
Ph: 800-243-6002, 203-852-6800
Fx: 203-866-3326

General comments: tmc@tmcnet.com.
Comments about this site: webmaster@tmcnet.com.

STAY CURRENT YOUR WAY

© 2014 Technology Marketing Corporation. All rights reserved.