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

TMCNet:  U.S. Patents Awarded to Inventors in New York (Jan. 9)

[January 09, 2013]

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

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

*** Island Intellectual Property Assigned Patent ALEXANDRIA, Va., Jan. 9 -- Island Intellectual Property, Manhasset, N.Y., has been assigned a patent (8,352,342) developed by Bruce Bent II, Manhasset, N.Y., and David Gareis, Maplewood, N.J., for a "method and system for determining fees for deposits allocated over a plurality of deposit institutions." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method, system and program product, the method accessing, one or more electronic databases, comprising: aggregated account information for one or more FDIC-insured and interest-bearing aggregated deposit accounts held in one or more deposit institutions, in a program; and client account information; determining or having determined or accessing a fee tier from among a plurality of fee tiers for the respective client account; allocating, funds of the client accounts to one or more of the aggregated deposit accounts based on one or more criteria, wherein some of the client accounts in a plurality of different fee tiers are allocated to the same aggregated deposit account; determining or having determined a total interest amount for the respective client account for a period, based, at least in part, on interest earned by the one or more amounts, A.sub.ni, of the respective client account held in each of the one or more aggregated deposit accounts holding funds of the respective client account; calculating or having calculated or obtaining a fee amount for the respective client account, based at least in part, on the fee tier for the respective client account; determining or having determined a client account interest so that the fee amount for the respective client account and the client account interest substantially equal the total interest amount for the respective client account; and updating the one or more databases." The patent application was filed on June 15, 2010 (12/816,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,352,342&OS=8,352,342&RS=8,352,342 Written by Neha Bharti; edited by Jaya Anand.


*** International Business Machines Assigned Patent ALEXANDRIA, Va., Jan. 9 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,352,355) developed by Markus R. Ettl, Yorktown Heights, N.Y., Karthik Sourirajan, White Plains, N.Y., and Zhengliang Xue, Yorktown Heights, N.Y., for a "configuration pricing strategies for multi-commodity request-for-quotes." The abstract of the patent published by the U.S. Patent and Trademark Office states: "Win probability estimation model that statistically computes the probability of winning a bid at a given price, and profit optimization models that compute the optimal price for a bid balancing the probability of winning a bid at a price with the profitability of the bid at the given price. In one stage, an expected profit margin of a product may be formulated as a function of its profit margin and win probability to compute its optimal profit margin. In another stage, an expected profit for one or more product accessories may be formulated as a function of the profit margin and their conditional win probability given the server win to compute their optimal profit margins. The conditional win probabilities for the product accessories may be modeled as a function of the utilities of the various purchase options that contain the product and that accessory." The patent application was filed on May 12, 2011 (13/106,474). 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,352,355&OS=8,352,355&RS=8,352,355 Written by Neha Bharti; edited by Jaya Anand.

*** Pitney Bowes Assigned Patent ALEXANDRIA, Va., Jan. 9 -- Pitney Bowes, Stamford, Conn., has been assigned a patent (8,352,365) developed by four co-inventors for a "system and method for electronic bill presentment using a third party." The co-inventors are Robert M. Goldberg, Briarcliff Manor, N.Y., Julie A. Peck, Danbury, Conn., Kenneth E. McDonald, Nesconset, N.Y., and Richard A. Grossweiler, Bohemia, N.Y.

The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method and system for electronic bill presentment and payment using a third party intermediary is described. A third party provides an electronic post office that uses a virtual address directory to provide a level of abstraction in an EBPP data stream using the ACH network so that EBPP participants do not require the information that is typically required to process such transactions. By using the virtual address directory, neither the biller, nor the bank, nor the intermediary have all the consumer data used in the transaction. Accordingly, privacy is enhanced and any risk that privacy will be compromised is reduced." The patent application was filed on Oct. 14, 2004 (10/966,133). 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,352,365&OS=8,352,365&RS=8,352,365 Written by Neha Bharti; edited by Jaya Anand.

*** American Express Travel Related Services Assigned Patent ALEXANDRIA, Va., Jan. 9 -- American Express Travel Related Services, New York, has been assigned a patent (8,352,343) developed by eight co-inventors for "using commercial share of wallet to compile marketing company lists." The co-inventors are Kathleen Haggerty, Staten Island, N.Y., Charles Christopher Lyon, Phoenix, Benedict O. Okoh, New York, Robert E. Phelan, Mendham, N.J., Jon Kevin Ruterman, Glendale, Ariz., Geraldine A. Turner, Sandy Hook, Va., Chao M. Yuan, Montclair, N.J., and Arnab Biswas, Calcutta, India.

The abstract of the patent published by the U.S. Patent and Trademark Office states: "Commercial size of spending wallet ("CSoSW") is the total business spend of a business including cash but excluding bartered items. Commercial share of wallet ("CSoW") is the portion of the spending wallet that is captured by a particular financial company. A modeling approach utilizes various data sources to provide outputs that describe a company's spend capacity. Marketing companies that sell lists compile those lists by searching one or more databases for names and/or businesses that match certain criteria. Those marketing companies can use the CSoW/CSoSW modeling approach to show predicted spend and/or revenues for each company on a list. This makes the list more valuable to list buyers." The patent application was filed on March 28, 2012 (13/432,941). 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,352,343&OS=8,352,343&RS=8,352,343 Written by Neha Bharti; edited by Jaya Anand.

*** International Business Machines Assigned Patent for Method, Hardware Product, and Computer Program Product for Implementing Commerce between Virtual Worlds ALEXANDRIA, Va., Jan. 9 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,352,326) developed by four co-inventors for a "method, hardware product, and computer program product for implementing commerce between virtual worlds." The co-inventors are Boas Betzler, Magstadt, Germany, Sandra L. Kearney, Harleysville, Pa., Tanaz Sowdagar, San Francisco, and Hagen R. Wenzek, Tarrytown, N.Y.

The abstract of the patent published by the U.S. Patent and Trademark Office states: "A virtual business transaction is implemented between a first virtual world and a second virtual world by providing a searchable catalog that includes one or more items each comprising a virtual good, a virtual service, a real good, or a real service. An object representation is stored for each of the items. Each of the stored object representations is associated with metadata comprising any of digital rights metadata, ownership metadata, identity metadata, payment method metadata, or currency detail metadata. A set of transformation algorithms are established that are customized through a rule set. A request is received specifying a copying, modifying, or reselling of an item selected from the items in the searchable catalog. The copying, modifying, or reselling of the item from a first virtual world to a second virtual world is implemented using the set of transformation algorithms. An exchange of virtual currency is implemented between the first virtual world and the second virtual world using the set of transformation algorithms." The patent application was filed on Nov. 11, 2008 (12/268,471). 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,352,326&OS=8,352,326&RS=8,352,326 Written by Neha Bharti; edited by Jaya Anand.

*** Owl Computing Technologies Assigned Patent ALEXANDRIA, Va., Jan. 9 -- Owl Computing Technologies, Ridgefield, Conn., has been assigned a patent (8,353,022) developed by Jeffrey Charles Menoher, Norwalk, Conn., James Hope, Greenwich, Conn., and Ronald Mraz, South Salem, N.Y., for a "bilateral communication using multiple one-way data links." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A bilateral data transfer system comprising a first node, a second node, a first one-way link for unidirectional transfer of first data from the first node to the second node, and a second one-way link for unidirectional transfer of second data from the second node to the first node, wherein the unidirectional transfer of the first data across the first one-way link and the unidirectional transfer of the second data across the second one-way link are independently administered by the bilateral data transfer system. Under such bilateral data transfer system, each of the one-way data links may be subject to separately administered security restrictions and data filtering processes. Hence, it enables secure bilateral communications across different network security domains." The patent application was filed on June 4, 2012 (13/488,028). 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,353,022&OS=8,353,022&RS=8,353,022 Written by Satyaban Rath; edited by Hemanta Panigrahi.

*** Xerox Assigned Patent ALEXANDRIA, Va., Jan. 9 -- Xerox, Norwalk, Conn., has been assigned a patent (8,352,334) developed by John Stanley Ulinski, Pittsford, N.Y., for a "system and method for ordering supplies for a multifunction device using a mobile wireless handset." The abstract of the patent published by the U.S. Patent and Trademark Office states: "What is disclosed is a novel apparatus and method for effectuating the ordering of supplies via a wireless handset device. In one embodiment, the handset is pre-loaded with a plurality of folders each representing a multifunction device. A user navigates the hierarchy of folders and selects a folder. The user then selects at least one graphical widget contained therein representing a particular supply commodity available for order from a supplier. In response to a user selection thereof, a part number identified by the selected graphical widget and a supplier profile are retrieved from memory. The profile contains the ordering method and contact information. An order message is prepared according to the ordering method prescribed by the profile and is sent to the supplier to place an order for that supply commodity. The process repeats until no more supplies are to be ordered. Additional features, enhancements, and embodiments have been provided." The patent application was filed on Jan. 29, 2009 (12/361,622). 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,352,334&OS=8,352,334&RS=8,352,334 Written by Neha Bharti; edited by Jaya Anand.

*** International Business Machines Assigned Patent for Verification Techniques for Liveness Checking of Logic Designs ALEXANDRIA, Va., Jan. 9 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,352,894) developed by four co-inventors for "verification techniques for liveness checking of logic designs." The co-inventors are Jason R. Baumgartner, Austin, Texas, Paul Joseph Roessler, Austin, Texas, Ohad Shacham, Israel, and Jiazhao Xu, Mount Kisco, N.Y.

The abstract of the patent published by the U.S. Patent and Trademark Office states: "A technique for verification of a logic design using a liveness-to-safety conversion includes assigning liveness gates for liveness properties of a netlist and assigning a single loop gate to provide a loop signal for the liveness gates. Assertion of the single loop gate is prevented when none of the liveness gates are asserted. A first state of the netlist is sampled and the sampled first state provides an initial state for a first behavioral loop for at least one of the liveness gates following the assertion of the single loop gate. The sampled first state of the first behavioral loop is compared with a later state of the first behavioral loop to determine if the sampled first state is repeated. A liveness violation is returned when the sampled first state is repeated and an associated one of the liveness gates remains asserted for a duration of the first behavioral loop." The patent application was filed on Feb. 23, 2012 (13/403,799). 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,352,894&OS=8,352,894&RS=8,352,894 Written by Satyaban Rath; edited by Hemanta Panigrahi.

*** International Business Machines Assigned Patent for Managing Migration Ready Queue Associated with Each Processor Based on the Migration Ready Status of the Tasks ALEXANDRIA, Va., Jan. 9 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,352,946) developed by Vaddagiri Srivatsa, Bangalore, India, and Manish Gupta, Yorktown Heights, N.Y., for a "managing migration ready queue associated with each processor based on the migration ready status of the tasks." The abstract of the patent published by the U.S. Patent and Trademark Office states: "The present disclosure is directed to a method for managing tasks in a computer system having a plurality of CPUs. Each task in the computer system may be configured to indicate a migration ready indicator of the task. The migration ready indicator for a task may be given when the set of live data for that task reduces or its working set of memory changes. The method may comprise associating a migration readiness queue with each of the plurality of CPUs, the migration readiness queue having a front-end and a back-end; analyzing a task currently executing on a particular CPU, wherein the particular CPU is one of the plurality of CPUs; placing the task in the migration readiness queue of the particular CPU based on status of the task and/or the migration ready indicator of the task; and selecting at least one queued task from the front-end of the migration readiness queue of the particular CPU for migration when the particular CPU receives a task migration command." The patent application was filed on Aug. 11, 2009 (12/539,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,352,946&OS=8,352,946&RS=8,352,946 Written by Satyaban Rath; edited by Hemanta Panigrahi.

*** International Business Machines Assigned Patent for Algorithm to Share Physical Processors to Maximize Processor Cache Usage and Topologies ALEXANDRIA, Va., Jan. 9 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,352,950) developed by four co-inventors for "algorithm to share physical processors to maximize processor cache usage and topologies." The co-inventors are Donna N. Dillenberger, Yorktown Heights, N.Y., Jeffrey P. Kubala, Poughquaq, N.Y., Bernard Pierce, Poughkeepsie, N.Y., and Donald W. Schmidt, Stone Ridge, N.Y.

The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method and apparatus for use in a computing environment to run a variety of applications in logical partitions. The apparatus includes one or more logical processors (LPs), one or more logical partitions (LPARs) configured to each access a share of processing resources of the LPs in accordance with predefined instructions, and an LPAR manager configured to determine an operational mode of each of the LPARs and any available amount of an excess of the share of the processing resources of the LPs and to dispatch the processing resources of at least a subset of the LPs to the LPARs in accordance with the respective predetermined shares and with respect to the determined operational mode of the respective LPARs and the amount, if any, of the excess share." The patent application was filed on Jan. 11, 2008 (11/972,734). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=8,352,950&OS=8,352,950&RS=8,352,950 Written by Satyaban Rath; edited by Hemanta Panigrahi.

*** Massachusetts Institute of Technology Assigned Patent ALEXANDRIA, Va., Jan. 9 -- Massachusetts Institute of Technology, Cambridge, Mass., has been assigned a patent (8,352,385) developed by Benjamin I. Rapoport, New York, Rahul Sarpeshkar, Arlington, Mass., and Woradorn Wattanapanitch, Cambridge, Mass., for a "low-power analog-circuit architecture for decoding neural signals." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A microchip for performing a neural decoding algorithm is provided. The microchip is implemented using ultra-low power electronics. Also, the microchip includes a tunable neural decodable filter implemented using a plurality of amplifiers, a plurality of parameter learning filters, a multiplier, a gain and time-constant biasing circuits; and analog memory. The microchip, in a training mode, learns to perform an optimized translation of a raw neural signal received from a population of cortical neurons into motor control parameters. The optimization being based on a modified gradient descent least square algorithm wherein update for a given parameter in a filter is proportional to an averaged product of an error in the final output that the filter affects and a filtered version of its input. The microchip, in an operational mode, issues commands to controlling a device using learned mappings." The patent application was filed on May 27, 2008 (12/127,380). 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,52,385.PN.&OS=PN/83,52,385&RS=PN/83,52,385 Written by Amal Ahmed; edited by Jaya Anand.

*** International Business Machines Assigned Patent for Testing and Debugging Framework for Application Builders ALEXANDRIA, Va., Jan. 9 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,352,920) developed by Danny Soroker, Larchmont, N.Y., and Netta M. Shani, Haifa, Israel, for a "testing and debugging framework for application builders." The abstract of the patent published by the U.S. Patent and Trademark Office states: "An application builder system and methodology enables a user to create an application using a builder ("builder application"); interactively edit the builder application by adding and removing application objects; interactively edit the properties of the application objects, including a new property called "debug level"; interactively set values of parameters for a code generator, including the value of a new parameter called "debug level"; invoking the code generator to automatically generate application code; and running the resulting generated application." The patent application was filed on April 22, 2008 (12/107,593). 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,352,920&OS=8,352,920&RS=8,352,920 Written by Satyaban Rath; edited by Hemanta Panigrahi.

*** International Business Machines Assigned Patent for System, Method and Program to Migrate a Virtual Machine ALEXANDRIA, Va., Jan. 9 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,352,938) developed by Jennifer A. Hunt, Endicott, N.Y., and Steven Shultz, Endicott, N.Y., for a "system, method and program to migrate a virtual machine." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A system, method and program product for migrating a first virtual machine from a first real computer to a second real computer or from a first LPAR to a second LPAR in a same real computer. Before migration, the first virtual machine comprises an operating system and an application in a first private memory private to the first virtual machine. A communication queue of the first virtual machine resides in a shared memory shared by the first and second computers or the first and second LPARs. The operating system and application are copied from the first private memory to the shared memory. The operating system and application are copied from the shared memory to a second private memory private to the first virtual machine in the second computer or second LPAR. Then, the first virtual machine is resumed in the second computer or second LPAR." The patent application was filed on March 30, 2007 (11/694,231). 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,352,938&OS=8,352,938&RS=8,352,938 Written by Satyaban Rath; edited by Hemanta Panigrahi.

*** International Business Machines Assigned Patent for Method and Apparatus for Utility-based Dynamic Resource Allocation in a Distributed Computing System ALEXANDRIA, Va., Jan. 9 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,352,951) developed by four co-inventors for a "method and apparatus for utility-based dynamic resource allocation in a distributed computing system." The co-inventors are Rajarshi Das, New Rochelle, N.Y., Jeffrey Owen Kephart, Cortlandt Manor, N.Y., Gerald James Tesauro, Croton-on-Hudson, N.Y., and William Edward Walsh, New York.

The abstract of the patent published by the U.S. Patent and Trademark Office states: "In one embodiment, the present invention is a method for allocation of finite computational resources amongst multiple entities, wherein the method is structured to optimize the business value of an enterprise providing computational services. One embodiment of the inventive method involves establishing, for each entity, a service level utility indicative of how much business value is obtained for a given level of computational system performance. The service-level utility for each entity is transformed into a corresponding resource-level utility indicative of how much business value may be obtained for a given set or amount of resources allocated to the entity. The resource-level utilities for each entity are aggregated, and new resource allocations are determined and executed based upon the resource-level utility information. The invention is thereby capable of making rapid allocation decisions, according to time-varying need or value of the resources by each of the entities." The patent application was filed on June 30, 2008 (12/164,896). 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,352,951&OS=8,352,951&RS=8,352,951 Written by Satyaban Rath; edited by Hemanta Panigrahi.

*** Composite Ideas Assigned Patent ALEXANDRIA, Va., Jan. 9 -- Composite Ideas, Ronkonkoma, N.Y., has been assigned a patent (8,352,971) developed by Paul Marsala, Bohemia, N.Y., and Edwin Babadaglian, Farmingville, N.Y., for a "contained command invocation framework." The abstract of the patent published by the U.S. Patent and Trademark Office states: "An object-oriented middleware framework for use in a network having a plurality of hosts including a first host having an associated first memory and first processor; and a second host having an associated second memory and second processor. The object-oriented middleware framework includes an Originator Command Container instantiating a Command by executing computer programming code stored in the first memory using the first processor. The framework also includes an Invocator Command Container, remote from the Originator Command Container and its associated first host where the instantiated Command is invoked, locally by executing computer programming code stored in the second memory using the second processor." The patent application was filed on July 26, 2011 (13/191,114). 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,352,971&OS=8,352,971&RS=8,352,971 Written by Satyaban Rath; edited by Hemanta Panigrahi.

*** International Business Machines Assigned Patent for Identifying Training Documents for a Content Classifier ALEXANDRIA, Va., Jan. 9 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,352,386) developed by four co-inventors for "identifying training documents for a content classifier." The co-inventors are Srinivas Varma Chitiveli, Germantown, Md., Barton Wayne Emanuel, Manassas, Va., Alexander Wolcott Holt, New Paltz, N.Y., and Michael E. Moran, Ridgewood, N.J.

The abstract of the patent published by the U.S. Patent and Trademark Office states: "Systems, methods and articles of manufacture are disclosed for identifying a training document for a content classifier. One or more thresholds may be defined for designating a document as a training document for a content classifier. A plurality of documents may be evaluated to compute a score for each respective document. The score may represent suitability of a document for training the content classifier with respect to a category. The score may be computed based on content of the plurality of documents, metadata of the plurality of documents, link structure of the plurality of documents, user feedback (e.g., user supplied document tags) received for the plurality of documents, and document metrics received for the plurality of documents. Based on the computed scores, a training document may be selected. The content classifier may be trained using the selected training document." The patent application was filed on July 2, 2009 (12/497,467). 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,52,386.PN.&OS=PN/83,52,386&RS=PN/83,52,386 Written by Amal Ahmed; edited by Jaya Anand.

*** Xerox Assigned Patent for Systems and Methods to Resize Document Content ALEXANDRIA, Va., Jan. 9 - Xerox, Norwalk, Conn., has been assigned a patent (8,352,856) developed by Claude S. Fillion, Rochester, N.Y., Vishal Monga, State College, Pa., and Zhigang Fan, Webster, N.Y., for "systems and methods to resize document content." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A system resizes content within a document that includes a document segmenter that receives a document that contains content. The document segmenter analyzes the content within the document and segments the content into a plurality of object types. An object priority applicator determines a class value associated with each object type. A location scaler identifies a datum point for each object type within the document, wherein each datum point maintains a relative location to one another regardless of document resizing. An object sizing component resizes each object based at least in part upon the class value." The patent application was filed on Nov. 11, 2009 (12/616,423). 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,352,856&OS=8,352,856&RS=8,352,856 Written by Satyaban Rath; edited by Hemanta Panigrahi.

*** International Business Machines Assigned Patent for System for Discovering Business Processes from Noisy Activities Logs ALEXANDRIA, Va., Jan. 9 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,352,414) developed by six co-inventors for a "system for discovering business processes from noisy activities logs." The co-inventors are Anuradha Bhamidipaty, Bangalore, India, Krishna Kummamuru, Hyderabad, India, Shailabh Nagar, Bangalore, India, Ramendra Sahoo, Mohegan Lake, N.Y., Virendra K. Varshneya, Aligarh, India, and Karthik Visweswariah, Banglore, India.

The abstract of the patent published by the U.S. Patent and Trademark Office states: "A system for discovering business processes from noisy activities logs from various activities performed during the execution of the process. Activities are observed from the noisy activity logs that may include text from manually entered activity logs, chat scripts, emails, voice transcripts, desktop captures, and tool logs, wherein the noisy activity logs are received from multiple person/tool actors with each of the actors performing one or more activities related to one/more business tasks. Extracting information from the noisy activity logs to capture activity based information, and then analyzing similar activities and finding possible paths in the similar activities. The results are used to build a process graph based on the similar activities and the possible paths in the similar activities." The patent application was filed on Oct. 7, 2009 (12/575,294). 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,52,414.PN.&OS=PN/83,52,414&RS=PN/83,52,414 Written by Amal Ahmed; edited by Jaya Anand.

*** International Business Machines Assigned Patent for System and Method for Virtual Environment Preservation Based on Automated Item Reduction ALEXANDRIA, Va., Jan. 9 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,352,871) developed by six co-inventors for a "system and method for virtual environment preservation based on automated item reduction." The co-inventors are Rick A. Hamilton II, Charlottesville, Va., Neal M. Keller, Pleasantville, N.Y., Brian M. O'Connell, Cary, N.C., Clifford A. Pickover, Yorktown Heights, N.Y., and Keith R. Walker, Austin, Texas.

The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method implemented in a computer infrastructure having computer executable code, includes detecting one of an absence of a virtual universe (VU) occurrence in a VU within a predetermined time period, a special event in the VU and a change of real world status from a previous real world status. Additionally, the method includes determining a VU asset of a VU resident relevant to the VU occurrence, the special event or the previous real world status. Further, the method includes performing an automated asset reduction of the VU asset based on the determining." The patent application was filed on Dec. 4, 2008 (12/328,298). 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,352,871&OS=8,352,871&RS=8,352,871 Written by Satyaban Rath; edited by Hemanta Panigrahi.

*** Owl Computing Technologies Assigned Patent ALEXANDRIA, Va., Jan. 9 -- Owl Computing Technologies, Ridgefield, Conn., has been assigned a patent (8,352,450) developed by Ronald Mraz, South Salem, N.Y., James Hope, Greenwich, Conn., and Andrew Holmes, Darien, Conn., for a "database update through a one-way data link." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A database updating application for updating through a one-way data link a remote database in accordance with a change in a reference database is disclosed, which comprises a database trigger client associated with the reference database for generating a database update message in the form of a file or a data packet corresponding to the change in the reference database and sending the database update message to a send node interconnected to a receive node by the one-way data link, and a database trigger server associated with the remote database for receiving the database update message transmitted across the one-way data link and replicating the change on the remote database in accordance with the database update message. The present invention provides database update through a one-way data link that may be implemented efficiently in real time and with a mechanism for verifying the integrity and operability of the one-way data link for the purpose of database update. In addition, the present invention provides a way to combine the functionalities of the conventional database update applications with the security afforded by the use of a one-way data link." The patent application was filed on April 19, 2007 (11/788,077). 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,52,450.PN.&OS=PN/83,52,450&RS=PN/83,52,450 Written by Amal Ahmed; edited by Jaya Anand.

*** International Business Machines Assigned Patent for Efficient Forcing of Corner Cases in a Floating Point Rounder ALEXANDRIA, Va., Jan. 9 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,352,531) developed by four co-inventors for an "efficient forcing of corner cases in a floating point rounder." The co-inventors are Maarten J. Boersma, Holzgerlingen, Germany, J. Adam Butts, Hartsdale, N.Y., Silvia Melitta Mueller, Altdorf, Germany, and Jochen Preiss, Boeblingen, Germany.

The abstract of the patent published by the U.S. Patent and Trademark Office states: "The forcing of the result or output of a rounder portion of a floating point processor occurs only in a fraction non-increment data path within the rounder and not in the fraction increment data path within the rounder. The fraction forcing is active on a corner case such as a disabled overflow exception. A disabled overflow exception may be detected by inspecting the normalized exponent. If a disabled overflow exception is detected, the round mode is selected to execute only in the non-increment data path thereby preventing the fraction increment data path from being selected." The patent application was filed on July 22, 2008 (12/177,346). 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,352,531&OS=8,352,531&RS=8,352,531 Written by Arpi Sharma; edited by Anand Kumar.

*** International Business Machines Assigned Patent for Identifying Relevant Data from Unstructured Feeds ALEXANDRIA, Va., Jan. 9 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,352,541) developed by four co-inventors for "identifying relevant data from unstructured feeds." The co-inventors are Daniel A. Gisolfi, Hopewell, N.Y., David L. Kaminsky, Chapel Hill, N.C., Rodney A. Smith, Smyrna, Ga., and Thomas O. Rowe, Chapel Hill, N.C.

The abstract of the patent published by the U.S. Patent and Trademark Office states: "A system and method of providing data to a mashup application may involve receiving a request from a mashup application and supplying first data to the mashup application in response to the request. Mashup information can be received from the mashup application, wherein the mashup information indicates an inclusion of the first data with second data in the execution of the mashup application. The mashup information may be stored and analyzed to identify relationships between previously unrelated data." The patent application was filed on Oct. 26, 2011 (13/281,791). 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,352,541&OS=8,352,541&RS=8,352,541 Written by Arpi Sharma; edited by Anand Kumar.

*** International Business Machines Assigned Patent ALEXANDRIA, Va., Jan. 9 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,352,839) developed by four co-inventors for an "encoding data into constrained memory." The co-inventors are Michele M. Franceschini, White Plains, N.Y., Ashish Jagmohan, White Plains, N.Y., Luis A. Lastras-Montano, Cortlandt Manor, N.Y., and Mayank Sharma, White Plains, N.Y.

The abstract of the patent published by the U.S. Patent and Trademark Office states: "Encoding data into constrained memory using a method for writing data that includes receiving write data to be encoded into a write word, receiving constraints on symbol values associated with the write word, encoding the write data into the write word, and writing the write word to a memory. The encoding includes: representing the write data and the constraints as a first linear system in a first field of a first size; embedding the first linear system into a second linear system in a second field of a second size, the second size larger than the first size; solving the second linear system in the second field resulting in a solution; and collapsing the solution into the first field resulting in the write word, the write word satisfying the constraints on symbol values associated with the write word." The patent application was filed on June 11, 2010 (12/814,142). 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,352,839.PN.&OS=PN/8,352,839&RS=PN/8,352,839 Written by Kusum Sangma; edited by Anand Kumar.

*** International Business Machines Assigned Patent for System to Improve Memory Failure Management and Associated Methods ALEXANDRIA, Va., Jan. 9 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,352,806) developed by seven co-inventors for a "system to improve memory failure management and associated methods." The co-inventors are Marc A. Gollub, Round Rock, Texas, Luis A. Lastras-Montano, Cortlandt Manor, N.Y., Piyush C. Patel, Cary, N.C., Eric E. Retter, Austin, Texas, Barry M. Trager, Yorktown Heights, N.Y., Shmuel Winograd, Scarsdale, N.Y., and Kenneth L. Wright, Austin, Texas.

The abstract of the patent published by the U.S. Patent and Trademark Office states: "A system to improve memory failure management may include memory, and an error control decoder to determine failures in the memory. The system may also include an agent that may monitor failures in the memory. The system may further include a table where the error control decoder may record the failures, and where the agent can read and write to." The patent application was filed on Jan. 31, 2008 (12/023,498). 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,352,806.PN.&OS=PN/8,352,806&RS=PN/8,352,806 Written by Kusum Sangma; edited by Anand Kumar.

*** NEC Laboratories America Assigned Patent ALEXANDRIA, Va., Jan. 9 -- NEC Laboratories America, Princeton, N.J., has been assigned a patent (8,352,827) developed by Chen Gong, New York, Guosen Yue, Plainsboro, N.J., and Xiadong Wang, New York, for an "LDPC hard decision decoder for high-speed wireless data communications." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method for low-density parity-check hard decision decoding includes computing, for every decoding iteration, a discrepancy of extrinsic messages responsive to channel inputs of a receiver, performing a flipping of the channel inputs responsive to a comparison of the discrepancy of extrinsic messages to a flipping threshold, the flipping threshold for each decoding iteration being determined based on a threshold computation responsive to a channel error probability estimation in a first iteration of a decoding of the channel inputs, and check node decoding responsive to the flipping of channel inputs." The patent application was filed on June 25, 2010 (12/823,400). 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,352,827.PN.&OS=PN/8,352,827&RS=PN/8,352,827 Written by Kusum Sangma; edited by Anand Kumar.

*** InterDigital Technology Assigned Patent ALEXANDRIA, Va., Jan. 9 -- InterDigital Technology, Wilmington, Del., has been assigned a patent (8,352,824) developed by four co-inventors for a "method and system for supporting multiple hybrid automatic repeat request processes per transmission time interval." The co-inventors are Stephen E. Terry, Northport, N.Y., Robert Lind Olesen, Huntington, N.Y., Jin Wang, Princeton, N.J., and Arty Chandra, Manhasset Hills, N.Y.

The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method and apparatus may be used for supporting multiple hybrid automatic repeat request (H-ARQ) processes per transmission time interval (TTI). A transmitter and a receiver may include a plurality of H-ARQ processes. Each H-ARQ process may transmit and receive one TB per TTI. The transmitter may generate a plurality of TBs and assign each TB to a H-ARQ process. The transmitter may send control information for each TB, which may include H-ARQ information associated TBs with the TBs. The transmitter may send the TBs using the associated H-ARQ processes simultaneously per TTI. After receiving the TBs, the receiver may send feedback for each of the H-ARQ processes and associated TBs indicating successful or unsuccessful receipt of each of the TBs to the transmitter. The feedback for multiple TBs may be combined for the simultaneously transmitted H-ARQ processes, (i.e., TBs)." The patent application was filed on Dec. 2, 2011 (13/309,713). 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,352,824.PN.&OS=PN/8,352,824&RS=PN/8,352,824 Written by Kusum Sangma; edited by Anand Kumar.

*** International Business Machines Assigned Patent for Methods, Systems, and Computer Program Products for Accessing a Multi-format Data Object ALEXANDRIA, Va., Jan. 9 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,352,509) developed by Joseph A. Bostian, Red Hook, N.Y., for "methods, systems, and computer program products for accessing a multi-format data object." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method for accessing a multi-format data object stored on a computer readable storage medium is provided. The method includes receiving a request to read a markup language (ML) document stored in a text format section of the multi-format data object. The method further includes locating a binary format section of the multi-format data object, where the binary format section includes a parsed binary representation of the ML document. The method additionally includes returning the parsed binary representation of the ML document in response to the request. A system, and computer program product are also provided." The patent application was filed on Dec. 19, 2007 (11/959,518). 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,352,509&OS=8,352,509&RS=8,352,509 Written by Arpi Sharma; edited by Anand Kumar.

*** International Business Machines Assigned Patent for Matching Interest and Availability of Services in Distributed Federated Service Domains ALEXANDRIA, Va., Jan. 9 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,352,610) developed by five co-inventors for "matching interest and availability of services in distributed federated service domains." The co-inventors are Ignacio Silva-Lepe, Putnam Valley, N.Y., Arun Kwangil Iyengar, Yorktown Heights, N.Y., Thomas Arthur Mikalsen, Cold Spring, N.Y., Isabelle M. Rouvellou, New York, and Revathi Subramanian, White Plains, N.Y.

The abstract of the patent published by the U.S. Patent and Trademark Office states: "Systems, methods, apparatus and articles of manufacture are disclosed for tracking, propagation and matching of messages pertaining to the interest in and availability of services across autonomous service domains. In one embodiment of the invention, a system of distributed, federated service domains in a service-oriented environment is provided wherein each service domain comprises: a plurality of locally provided services; a plurality of service requesters; and a service registry comprising descriptions of: one or more locally provided services; and one or more requested services, each of the requested services being one of: a fulfilled reference to a foreign service; and an unfulfilled reference to a foreign service." The patent application was filed on Nov. 25, 2009 (12/625,806). 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,352,610&OS=8,352,610&RS=8,352,610 Written by Arpi Sharma; edited by Anand Kumar.

*** International Business Machines Assigned Patent for Power Bus Current Bounding Using Local Current-limiting Soft-switches and Device Requirements Information ALEXANDRIA, Va., Jan. 9 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,352,758) developed by four co-inventors for a "power bus current bounding using local current-limiting soft-switches and device requirements information." The co-inventors are Robert G. Atkins, Poughkeepsie, N.Y., Edward N. Cohen, Highland, N.Y., Philip M. Corcoran, Highland, N.Y., and Edward J. Seminaro, Highland, N.Y.

The abstract of the patent published by the U.S. Patent and Trademark Office states: "An energy management control method and controller reduce power supply current and/or subsystem cooling overhead that reduces system efficiency, may reduce system reliability and may increase ambient noise. Multiple device connectors are supplied from corresponding soft switches that are programmed to provide a current level that is sufficient to supply the maximum current for the device installed in the corresponding device connector. The current level may be determined from device information provided from the device during initialization, which may directly specify a maximum current requirement. Alternatively, the maximum current requirement can be determined from other device-identifying information such as a unique device identifier. As a result a guaranteed maximum current or power and power dissipation can be determined, and multiple power supplies and/or cooling devices such as air movement devices (AMDs) may be enabled, disabled or otherwise controlled accordingly." The patent application was filed on Jan. 8, 2013 (12/728,675). 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,352,758&OS=8,352,758&RS=8,352,758 Written by Kusum Sangma; edited by Anand Kumar.

*** Symbol Technologies Assigned Patent ALEXANDRIA, Va., Jan. 9 -- Symbol Technologies, Holtsville, N.Y., has been assigned a patent (8,352,767) developed by Chi Zhang, Fresh Meadows, N.Y., and Charles Bolen, Kings Park, N.Y., for an "intelligent and adaptive method to manage mobile device power." The abstract of the patent published by the U.S. Patent and Trademark Office states: "The invention relates to systems and or methodologies for intelligent and adaptive power management in mobile devices. A peripheral power management component can set peripheral devices to active or inactive based on one or more schemas. The schemas can be predetermined or generated by the peripheral power management component. In addition, an adaptive component can modify the schemas to reflect actual usage or changing trends for each peripheral device." The patent application was filed on Nov. 26, 2008 (12/324,157). 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,352,767.PN.&OS=PN/8,352,767&RS=PN/8,352,767 Written by Kusum Sangma; edited by Anand Kumar.

*** Google Assigned Patent for Local Trusted Services Manager for a Contactless Smart Card ALEXANDRIA, Va., Jan. 9 -- Google, Mountain View, Calif., has been assigned a patent (8,352,749) developed by Rob von Behren, Berkeley, Calif., Jonathan Wall, San Francisco, and Ismail Cem Paya, New York, for a "local trusted services manager for a contactless smart card." The abstract of the patent published by the U.S. Patent and Trademark Office states: "Systems, methods, computer programs, and devices are disclosed herein for deploying a local trusted service manager within a secure element of a contactless smart card device. The secure element is a component of a contactless smart card incorporated into a contactless smart card device. An asymmetric cryptography algorithm is used to generate public-private key pairs. The private keys are stored in the secure element and are accessible by a trusted service manager (TSM) software application or a control software application in the secure element. A non-TSM computer with access to the public key encrypts and then transmits encrypted application data or software applications to the secure element, where the TSM software application decrypts and installs the software application to the secure element for transaction purposes." The patent application was filed on 8,352,749 (13/235,375). 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,352,749&OS=8,352,749&RS=8,352,749 Written by Kusum Sangma; edited by Anand Kumar.

*** International Business Machines Assigned Patent for Optimal Cache Replacement Scheme Using a Training Operation ALEXANDRIA, Va., Jan. 9 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,352,684) developed by seven co-inventors for an "optimal cache replacement scheme using a training operation." The co-inventors are Roch Georges Archambault, North York, Canada, Shimin Cui, Toronto, Chen Ding, Rochester, N.Y., Yaoqing Gao, North York, Canada, Xiaoming Gu, Handan, China, Raul Esteban Silvera, Woodbridge, Canada, and Chengliang Zhang, Redmond, Wash.

The abstract of the patent published by the U.S. Patent and Trademark Office states: "Computer implemented method, system and computer usable program code for cache management. A cache is provided, wherein the cache is viewed as a sorted array of data elements, wherein a top position of the array is a most recently used position of the array and a bottom position of the array is a least recently used position of the array. A memory access sequence is provided, and a training operation is performed with respect to a memory access of the memory access sequence to determine a type of memory access operation to be performed with respect to the memory access. Responsive to a result of the training operation, a cache replacement operation is performed using the determined memory access operation with respect to the memory access." The patent application was filed on Sept. 23, 2008 (12/236,188). 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,352,684.PN.&OS=PN/8,352,684&RS=PN/8,352,684 Written by Kusum Sangma; edited by Anand Kumar.

*** International Business Machines Assigned Patent for Co-location and Offloading of Web Site Traffic Based on Traffic Pattern Recognition ALEXANDRIA, Va., Jan. 9 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,352,607) developed by seven co-inventors for a "co-location and offloading of web site traffic based on traffic pattern recognition." The co-inventors are Daniel Manuel Dias, Mohegan Lake, N.Y., Richard Pervin King, Scarsdale, N.Y., Zhen Liu, Tarrytown, N.Y., Mark Steven Squillante, Pound Ridge, N.Y., Honghui Xia, Croton on Hudson, N.Y., Shun-Zheng Yu, Guangzhou, China, and Li Zhang, Yorktown Heights, N.Y.

The abstract of the patent published by the U.S. Patent and Trademark Office states: "Identifying traffic patterns to web sites based on templates that characterize the arrival of traffic to the web sites is provided. Based on these templates, determinations are made as to which web sites should be co-located so as to optimize resource allocation. Web sites whose templates are complimentary, i.e. a first web site having a peak in arrival traffic at time t1 and a second web site that has a trough in arrival traffic at time t1, are designated as being candidates for co-location. In addition, the templates identified for the traffic patterns of web sites are used to determine thresholds for offloading traffic to other servers. These thresholds include a first threshold at which offloading should be performed, a second threshold that takes into consideration the lead time needed to begin offloading, and a third threshold that takes into consideration a lag time needed to stop offloading of traffic." The patent application was filed on Dec. 7, 2007 (11/952,641). 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,352,607&OS=8,352,607&RS=8,352,607 Written by Arpi Sharma; edited by Anand Kumar.

*** International Business Machines Assigned Patent for Performance Optimization and Dynamic Resource Reservation for Guaranteed Coherency Updates in a Multi-level Cache Hierarchy ALEXANDRIA, Va., Jan. 9 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,352,687) developed by four co-inventors for a "performance optimization and dynamic resource reservation for guaranteed coherency updates in a multi-level cache hierarchy." The co-inventors are Deanna Postles Dunn Berger, Poughkeepsie, N.Y., Michael F. Fee, Cold Spring, N.Y., Arthur J. O'Neill Jr., Poughkeepsie, N.Y., and Robert J. Sonnelitter III, Wappingers Falls, N.Y.

The abstract of the patent published by the U.S. Patent and Trademark Office states: "A cache includes a cache pipeline, a request receiver configured to receive off chip coherency requests from an off chip cache and a plurality of state machines coupled to the request receiver. The cache also includes an arbiter coupled between the plurality of state machines and the cache pipe line and is configured to give priority to off chip coherency requests as well as a counter configured to count the number of coherency requests sent from the cache pipeline to a lower level cache. The cache pipeline is halted from sending coherency requests when the counter exceeds a predetermined limit." The patent application was filed on June 23, 2010 (12/821,726). 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,352,687.PN.&OS=PN/8,352,687&RS=PN/8,352,687 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.

-1110462 (c) 2013 Targeted News Service

[ Back To Technology News's Homepage ]

OTHER NEWS PROVIDERS







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 | Privacy Policy