<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0">
  <channel>
    <title>Peer to Patent Application List</title>
    <link>http://peertopatent.org/patent/list</link>
    <description>This is a list of Patent Applications on the Peer to Patent site</description>
    <language>en-us</language>
    <item>
      <title>Declarative association of dialog fields</title>
      <description>Pre-Grant Publication Number: 20080104540
Title: Declarative association of dialog fields 
Inventors: Jon R. Sawyer 
Assignees: HP 

Abstract: A computer-based user interface comprises a dialog control element for usage in creating a dialog. The dialog control element acts upon a data model containing an object defined by one or more properties and modifiable by one or more controls. The dialog control element can associate object properties with controls recursively whereby properties can contain objects which further contain properties.</description>
      <pubdate>Thu May 29 00:59:15 -0700 2008</pubdate>
      <guid>http://peertopatent.org/patent/20080104540/activity</guid>
    </item>
    <item>
      <title>Managing snapshots in storage systems</title>
      <description>Pre-Grant Publication Number: 20080104139
Title: Managing snapshots in storage systems 
Inventors: Xia Xu, Aaron Lindemann 
Assignees: HP 

Abstract: Embodiments include methods, apparatus, and systems for managing snapshots in storage systems. One method includes logically linking a plurality of snapshots to a logical disk in a storage network; and splitting the snapshots from the logical disk to form a snapshot tree that includes the snapshots split from the logical disk.</description>
      <pubdate>Thu May 29 00:57:18 -0700 2008</pubdate>
      <guid>http://peertopatent.org/patent/20080104139/activity</guid>
    </item>
    <item>
      <title>Modified buddy system memory allocation</title>
      <description>Pre-Grant Publication Number: 20080104353
Title: Modified buddy system memory allocation 
Inventors: Prashanth Madisetti 
Assignees: HP 

Abstract: A modified buddy system memory allocator of an apparatus in an example receives a request for a size of memory. The modified buddy system memory allocator identifies a plurality of contiguous, differently-sized memory blocks that are each smaller than the size of memory from the request. The modified buddy system memory allocator allocates the plurality of contiguous, differently-sized memory blocks to satisfy the request for the size of memory.</description>
      <pubdate>Thu May 29 00:55:30 -0700 2008</pubdate>
      <guid>http://peertopatent.org/patent/20080104353/activity</guid>
    </item>
    <item>
      <title>Displaying group icons representing respective groups of nodes</title>
      <description>Pre-Grant Publication Number: 20080098332
Title: Displaying group icons representing respective groups of nodes 
Inventors: David C.P. LaFrance-Linden, Howard S. Rifkin 
Assignees: HP 

Abstract: Information is displayed regarding an arrangement of nodes coupled by a communications network. The nodes are associated with corresponding characteristics. Plural groups of the nodes are defined based on the characteristics associated with the nodes. Group icons representing the respective groups of nodes are displayed.</description>
      <pubdate>Thu May 29 00:53:38 -0700 2008</pubdate>
      <guid>http://peertopatent.org/patent/20080098332/activity</guid>
    </item>
    <item>
      <title>System and method of expediting certain jobs in a computer processing system</title>
      <description>Pre-Grant Publication Number: 20080098395
Title: System and method of expediting certain jobs in a computer processing system 
Inventors: Bryan L. Backer 
Assignees: HP 

Abstract: In one embodiment, jobs requiring short processing time are given preference over jobs requiring long processing time by processing to completion all jobs for the first N seconds of the job. Jobs requiring longer than N seconds to complete are given a lower priority than a newly arriving job can and continue being processed, but are subject to reduction in resources by new jobs as each new job arrives.</description>
      <pubdate>Thu May 29 00:52:32 -0700 2008</pubdate>
      <guid>http://peertopatent.org/patent/20080098395/activity</guid>
    </item>
    <item>
      <title>Rendering and correcting data</title>
      <description>Pre-Grant Publication Number: 20080104473
Title: Rendering and correcting data 
Inventors: Mitchell Trott 
Assignees: HP 

Abstract: Rendering and correcting data. Data is received. The data is stored at a memory. The data is rendered for presentation at an output device. Defects in the data stored at the memory are determined. The defects in the data stored at the memory are corrected, wherein at least a portion of the correction of the defects is performed after transmitting the data.</description>
      <pubdate>Thu May 29 00:50:28 -0700 2008</pubdate>
      <guid>http://peertopatent.org/patent/20080104473/activity</guid>
    </item>
    <item>
      <title>Non-volatile storage</title>
      <description>Pre-Grant Publication Number: 20080098157
Title: Non-volatile storage 
Inventors: J. Michael Andrewartha, James Hess, David Maciorowski, Edward A. Cross 
Assignees: HP 

Abstract: One embodiment of a non-volatile memory system comprises block-accessible non-volatile memory, random access memory arranged to be linearly addressable by a processor as part of the processor's memory address space, to be read from and written to by the processor, and logic interposed between the block-accessible non-volatile memory and the random access memory and arranged to write parts of the content of the random access memory in blocks to blocks of the non-volatile, block-accessible memory. The logic is arranged to monitor processor writes to the random access memory, and to write blocks of the random access memory that differ from a most recent copy in the non-volatile, block-accessible memory to the non-volatile, block-accessible memory.</description>
      <pubdate>Thu May 29 00:41:33 -0700 2008</pubdate>
      <guid>http://peertopatent.org/patent/20080098157/activity</guid>
    </item>
    <item>
      <title>Fast write operations to a mirrored volume in a volume manager</title>
      <description>Pre-Grant Publication Number: 20080104321
Title: Fast write operations to a mirrored volume in a volume manager 
Inventors: Jeevan Kamisetty, Maurilio Cometto 
Assignees: CISCO TECHNOLOGY, INC. 

Abstract: In one embodiment, a method is provided comprising: receiving, at a virtualizer, a write command from an initiator in a storage area network, wherein the storage area network includes the initiator and a plurality of mirrored storages; sending, from the virtualizer, a write command to the plurality of mirrored storages; receiving, at the virtualizer, a transfer ready message from a first of the plurality of mirrored storages; sending a transfer ready message from the virtualizer to the initiator in response to the receiving of the transfer ready message from the first of the plurality of mirrored storages; receiving, at the virtualizer, a data message from the initiator; and sending, from the virtualizer, a data message to the plurality of mirrored storage once transfer ready messages have been received from each of the plurality of mirrored storages.</description>
      <pubdate>Thu May 29 00:35:51 -0700 2008</pubdate>
      <guid>http://peertopatent.org/patent/20080104321/activity</guid>
    </item>
    <item>
      <title>Processing queries on hierarchical markup data using shared hierarchical markup trees</title>
      <description>Pre-Grant Publication Number: 20080091649
Title: Processing queries on hierarchical markup data using shared hierarchical markup trees 
Inventors: Lipyeow Lim, Haixun Wang, Min Wang 
Assignees: INTERNATIONAL BUSINESS MACHINES CORPORATION 

Abstract: Disclosed are a method, information processing system, and computer readable medium for processing queries. The method includes receiving a data query for a set of hierarchical markup documents. At least one query path expression is extracted from the data query. The query path is processed against at least one shared hierarchical markup document in a plurality of shared hierarchical markup documents. The plurality of shared hierarchical documents is associated with the set of hierarchical markup documents. In response to the shared hierarchical markup document completely matching the query path expression, a query result for the data query is generated. The query result is based on the processing of the query path expression against at least one of the shared hierarchical markup document and the difference hierarchical markup document.</description>
      <pubdate>Wed May 14 01:24:09 -0700 2008</pubdate>
      <guid>http://peertopatent.org/patent/20080091649/activity</guid>
    </item>
    <item>
      <title>Enhanced server to client session inspection</title>
      <description>Pre-Grant Publication Number: 20080098477
Title: Enhanced server to client session inspection 
Inventors: CRAIG ALLEN WILLIAMS, Gerald S. Lathem 
Assignees: CISCO 

Abstract: In one embodiment, a technique for enhancing the inspection of data sent from a server is provided. By modifying a client request in an effort to prevent the transformation (e.g., encoding and/or compression) of data by the server, unencoded data may be received, which can be inspected without the overhead associated with first decoding the data. Further, in the event the data is encoded despite modifying the client request to prevent such encoding, the server may be untrustworthy and one or more appropriate actions may be taken.</description>
      <pubdate>Thu May 01 23:20:50 -0700 2008</pubdate>
      <guid>http://peertopatent.org/patent/20080098477/activity</guid>
    </item>
  </channel>
</rss>
